The QuickGraph.Algorithms namespace is the base namespace for graph algorithms.

Classes

	Class	Description
	AlgoUtility	A static class with some helper methods
	CondensationGraphAlgorithm	Creates a condensation graph transformation
	CondensationGraphVertexEventArgs	Encapsulates a vertex in the original graph and it's corresponding vertex in a transformation of the graph
	ConnectedComponentsAlgorithm	Connected component computation
	SourceFirstTopologicalSortAlgorithm
	StrongComponentsAlgorithm	Computes the graph strong components.
	TopologicalSortAlgorithm	Topological sort of the graph.
	TransitiveClosureAlgorithm	Creates a transitive closure of the input graph
	TransitiveClosureVertexEventArgs	Encapsulates a vertex in the original graph and it's corresponding vertex in a transformation of the graph

Delegates

	Delegate	Description
	CondensationGraphVertexEventHandler	Delegate to handle the CondensationGraphVertexEvent
	TransitiveClosureVertexEventHandler	Delegate to handle the TransformVertexEvent

Remarks

This namespace contains all the graph algorithms implements by quickgraph. Algorithms are classified by the type of problem they solve, and each problem is separated in it's own namespace: SearchBasic algorithms such as the DepthFirstSearchAlgorithm or the BreadthFirstSearchAlgorithm. ShortestPathComputes the single source shortest path problem.CloneCloning of graph related algorithmsMaximumFLowNetword maximu flow algorithms

A number of algorithm supports visitors defined in the Visitor namespace.