Algorithms Concepts

QuickGraph contains a set of algorithms that solve classic graph theory problems. Algorithms are designed around the command pattern, 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

tip: The QuickGraph.Algorithms namespace contains a static class, AlgorithmExtensions, that contains a set of extension methods that encapsulate the creation and processing of algorithms instances.

Last edited Mar 30, 2009 at 6:08 AM by pelikhan, version 6

Comments

No comments yet.