QuickGraph contains a set of algorithms that solve classic graph theory problems. Algorithms are designed around the
, i.e. their execution is encapsulated into classes. Most algorithms are categorized by the kind of problem they can solve (note that some algorithms just don’t fit in those categories):
- Vertex predecessors,
- Edge predecessors,
- Vertex distances,
- Time stampers
namespace contains a static class,
, that contains a set of extension methods that encapsulate the creation and processing of algorithms instances.