webgraph-algo-0.2.0
- webgraph-algo 0.2.0
- Docs.rs crate page
- Apache-2.0 OR LGPL-2.1-or-later
- Links
- Repository
- crates.io
- Source
- Owners
- vigna
- Dependencies
- anyhow ^1.0.79 normal
  
  card-est-array ^0.1.0 normal
  
  dsi-progress-logger ^0.8.1 normal
  
  epserde ^0.8.0 normal
  
  kahan ^0.1.4 normal
  
  lender ^0.3.1 normal
  
  log ^0.4.22 normal
  
  no-break ^0.1.2 normal
  
  nonmax ^0.5.5 normal
  
  num_cpus ^1.16.0 normal
  
  parallel_frontier ^0.1.1 normal
  
  predicates ^3.1.2 normal
  
  rand ^0.9.0 normal
  
  rayon ^1.10.0 normal
  
  sealed ^0.6.0 normal
  
  sux ^0.7.2 normal
  
  sync-cell-slice ^0.9.9 normal
  
  thiserror ^2.0.12 normal
  
  webgraph ^0.3.0 normal
- Versions
- 95.44% of the crate is documented
Platform
- x86_64-unknown-linux-gnu
Feature flags

docs.rs
- About docs.rs
- Privacy policy

Rust

webgraph_algo0.2.0

In webgraph_algo::sccs

webgraph_algo::sccs

Function tarjan

pub fn tarjan(graph: impl RandomAccessGraph, pl: &mut impl ProgressLog) -> Sccs

Expand description

Tarjan’s algorithm for strongly connected components.