forked from YaccConstructor/QuickGraph
-
-
Notifications
You must be signed in to change notification settings - Fork 69
Condensation Graph
Alexandre Rabérin edited this page May 12, 2020
·
1 revision
This algorithm condensates any graph by merging a set of edges in a condensed edge. The user can provide a predicate of edges to specify which edge to condensate or condense by components as well.
The AlgorithmExtensions class provide various helpers to condensate graphs:
IVertexAndEdgeListGraph<TVertex, TEdge> graph = ...; // Input graph
// Condensations
var weaklyCondensed = graph.CondensateWeaklyConnected();
var stronglyCondensed = graph.CondensateStronglyConnected();