Loading...

Searching...

No Matches

Cut Algorithms

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

## Classes | |

struct | ogdf::MinimumCutStoerWagner< T > |

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... | |

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