Crate webgraph_algo

Algorithms for WebGraph

Algorithms for the Rust implementation of the WebGraph framework for graph compression.

Acknowledgments

This software has been partially supported by project SERICS (PE00000014) under the NRRP MUR program funded by the EU - NGEU, and by project ANR COREGRAPHIE, grant ANR-20-CE23-0002 of the French Agence Nationale de la Recherche. Views and opinions expressed are however those of the authors only and do not necessarily reflect those of the European Union or the Italian MUR. Neither the European Union nor the Italian MUR can be held responsible for them.

Re-exports

pub use llp::*;

Modules

distances

Algorithms related to distances.

llp

Layered label propagation.

prelude

sccs

Algorithms used to compute and work with strongly connected components.

utils

Utilities.

visits

Visits on graphs.

Macros

thread_pool

Utility macro to create thread_pools.

Functions

is_acyclic

Returns whether the graph is acyclic.

top_sort

Returns the node of the graph in topological-sort order, if the graph is acyclic.