Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

Cut Algorithms

Algorithms for computing minimum (s-t-)cuts. More...

Classes

class  ogdf::MinCut
 Computes a minimum cut in a graph. More...
 
class  ogdf::MinSTCutBFS< TCost >
 Min-st-cut algorithm, that calculates the cut by doing a depth first search over the dual graph of of an st-planar input graph. More...
 
class  ogdf::MinSTCutDijkstra< TCost >
 Min-st-cut algorithm, that calculates the cut by calculating the shortest path between the faces adjacent to an edge between s and t, via the algorithm by Dijkstra on the dual graph. More...
 
class  ogdf::MinSTCutMaxFlow< TCost >
 Min-st-cut algorithm, that calculates the cut via maxflow. More...
 

Detailed Description

Algorithms for computing minimum (s-t-)cuts.