Namespace QuikGraph.Algorithms

Classes

AlgorithmBase<TGraph>

Base class for all graph algorithm.

AlgorithmExtensions

Extensions related to algorithms, to run them.

DistanceRelaxers

Implementation of several distance relaxers.

EulerianTrailAlgorithm<TVertex, TEdge>

Algorithm that find Eulerian path in a graph.

IsEulerianGraphAlgorithm

Algorithm that checks if a graph is Eulerian. (has a path use all edges one and only one time).

IsEulerianGraphAlgorithm<TVertex, TEdge>

Algorithm that checks if a graph is Eulerian. (has a path using all edges one and only one time).

IsHamiltonianGraphAlgorithm

Algorithm that checks if a graph is Hamiltonian (has a path that links all vertices and pass one and only one time by each vertex).

IsHamiltonianGraphAlgorithm<TVertex, TEdge>

Algorithm that checks if a graph is Hamiltonian (has a path that links all vertices and pass one and only one time by each vertex).

MaximumBipartiteMatchingAlgorithm<TVertex, TEdge>

Algorithm that computes a maximum bipartite matching in a graph, meaning the maximum number of edges not sharing any vertex.

RandomGraphFactory

Helpers related to graphs and randomness.

RootedAlgorithmBase<TVertex, TGraph>

Base class for all graph algorithm requiring a starting vertex (root).

RootedSearchAlgorithmBase<TVertex, TGraph>

Base class for all graph algorithm performing a search in a graph.

TarjanOfflineLeastCommonAncestorAlgorithm<TVertex, TEdge>

Offline least common ancestor in a rooted tree.

TransitiveClosureAlgorithm<TVertex, TEdge>

Algorithm that computes the transitive closure of a graph, which is another directed graph with the same vertices and every reachable vertices by a given one linked by a single edge.

TransitiveReductionAlgorithm<TVertex, TEdge>

Algorithm that computes the transitive reduction of a graph, which is another directed graph with the same vertices and as few edges as possible.

Interfaces

IAlgorithm<TGraph>

Represents an algorithm to run on a graph.

IComputation

Represents a computation of something with control states.

IConnectedComponentAlgorithm<TVertex, TEdge, TGraph>

Represents an algorithm dealing with graph connected components.

IDistanceRecorderAlgorithm<TVertex>

An algorithm that exposes events to compute a distance map between vertices.

IDistanceRelaxer

Represents a distance relaxer.

IDistancesCollection<TVertex>

Represents an object that stores information about distances between vertices.

IEdgeColorizerAlgorithm<TVertex, TEdge>

Represents a storage of edges colorization state.

IEdgePredecessorRecorderAlgorithm<TVertex, TEdge>

An algorithm that exposes events to compute edges predecessors.

ITreeBuilderAlgorithm<TVertex, TEdge>

An algorithm that exposes an event to build an edge tree.

IUndirectedTreeBuilderAlgorithm<TVertex, TEdge>

An algorithm that exposes an event to build an edge tree (in undirected graph).

IUndirectedVertexPredecessorRecorderAlgorithm<TVertex, TEdge>

An algorithm that exposes events to compute vertices predecessors (in undirected graph).

IVertexColorizerAlgorithm<TVertex>

Represents an algorithm that puts colors on vertices and allow to get that color.

IVertexPredecessorRecorderAlgorithm<TVertex, TEdge>

An algorithm that exposes events to compute vertices predecessors (in directed graph).