The QuickGraph.Concepts.Traversals namespace contains the interfaces that implement the graph traversal concepts.

Classes

	Class	Description
	Traversal	A small helper class for traversals

Interfaces

	Interface	Description
	IAdjacencyGraph	AdjacentGraph concept
	IBidirectionalGraph	Adds access to in-edges.
	IBidirectionalVertexAndEdgeListGraph	Summary description for IBidirectionalVertexAndEdgeListGraph.
	IBidirectionalVertexListGraph	A fusion of IBidirectionalGraph and IVertexListGraph.
	IClusteredGraph	A graph with clusters.
	IEdgeListAndIncidenceGraph	Defines the union of EdgeListGraph and IncidenceListGraph.
	IEdgeListGraph	The EdgeListGraph concept refines the Graph concept, and adds the requirement for efficient access to all the edges in the graph.
	IFilteredBidirectionalGraph	A bidirectional graph that supports filtered traversals
	IFilteredEdgeListGraph	A edge list graph that supports filtered traversals
	IFilteredIncidenceGraph	An incidence graph that supports filtered traversals
	IFilteredVertexAndEdgeListGraph	Union of IFilteredVertexListGraph, IFilteredEdgeListGraph and IVertexAndEdgeListGraph.
	IFilteredVertexListGraph	A vertex list graph that supports filtered traversals
	IImplicitGraph	A graph defined by a out-edges method.
	IIncidenceGraph	Access to each vertex out-edges.
	IIndexedBidirectionalVertexListGraph
	IIndexedIncidenceGraph
	IIndexedVertexListGraph
	ITreeGraph	A tree-like interface definition
	IVertexAndEdgeListGraph	Defines the union of VertexListGraph and EdgeListGraph.
	IVertexListGraph	The VertexListGraph concept refines the Graph concept, and adds the requirement for efficient traversal of all the vertices in the graph.