traitgraph_algo/
lib.rs

1#![warn(missing_docs)]
2//! This crate offers traits for abstract graph algorithms.
3
4/// Algorithms related to graph components, i.e. finding the strongly or weakly connected components of a graph or checking if a graph is strongly connected.
5pub mod components;
6/// Dijkstra's shortest path algorithm.
7pub mod dijkstra;
8/// Algorithms related to Eulerian graphs.
9pub mod eulerian;
10/// Algorithms to create certain parameterisable graph classes, like binary trees.
11pub mod predefined_graphs;
12/// A trait for bidirected queues to abstract over the different implementations in the standard library.
13pub mod queue;
14/// Algorithms for graph traversals, i.e. preorder breadth or depth first search as well as postorder depth first search.
15pub mod traversal;