Namespace QuikGraph.Algorithms.GraphPartition

Classes

KernighanLinAlgorithm<TVertex, TEdge>

Algorithm that separate a graph into two disjoint subsets A and B of equal (or nearly equal) in size, in a way that minimizes the sum of the weights of the subset of edges that cross from A to B.

PartitionHelpers

Helpers to work with Partition<TVertex>.

Structs

Partition<TVertex>

Represents a graph partition in two sub sets.