Graph Drawing

 v. 2023.09 (Elderberry)

No Matches
MinSTCutDijkstra.h File Reference

MinSTCutDijkstra class template. More...

Go to the source code of this file.


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


namespace  ogdf
 The namespace for all OGDF objects.

Detailed Description

MinSTCutDijkstra class template.

Mirko Wagner
This file is part of the Open Graph Drawing Framework (OGDF).
Copyright (C)
See in the OGDF root directory for details.
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, see

Definition in file MinSTCutDijkstra.h.