Graph Drawing

 v. 2023.09 (Elderberry)

No Matches
graphalg Directory Reference
+ Directory dependency graph for graphalg:




 Implementation of the A* informed search algorithm.
 Declaration of Clusterer class that computes a clustering for a given graph based on the local neighborhood structure of each edge.
 Declaration of interface for clustering algorithms that compute a clustering for a given graph based on some structural or semantical properties.
 Class for computing the connectivity of a graph.
 Declaration of doubly linked lists and iterators.
 Implementation of Dijkstra's single source shortest path algorithm.
 Declaration of ogdf::EdgeIndependentSpanningTrees.
 Declaration and implementation of GraphReduction class reduces by Leaves & Chains.
 Declares simple matching functions.
 Calculate one or all Maximum Adjacency Ordering(s) of a given simple undirected graph.
 Implementation of Edmonds-Karp max-flow algorithm.
 Declaration and implementation of Goldberg-Tarjan max-flow algorithm with global relabeling and gap relabeling heuristic.
 Interface for Max Flow Algorithms.
 Max-Flow on s-t-planar graphs (s and t lie on the boundary of the outer face) via shortest paths in the dual.
 Implementation of the maximum flow algorithm for s-t-planar graphs by Alon Itai and Yossi Shiloach (See "Maximum Flow in Planar Networks", p.135, 1979, Society for Industrial and Applied Mathematics).
 Declares maximum density subgraph algorithms.
 Definition of ogdf::MinCostFlowModule class template.
 Definition of ogdf::MinCostFlowReinelt class template.
 Declaration of ogdf::MinimumCutModule.
 Calculate minimum cut value for a given Graph.
 Declaration and implementation of ogdf::MinimumCutStoerWagner.
 Declaration of min-st-cut algorithm which calculates the min-st-cut of an st-planar graph by doing a BFS on the dual graph (class MinSTCutDFS)
 MinSTCutDijkstra class template.
 Declaration of min-st-cut algorithms parameterized by max-flow alorithm.
 Template of base class of min-st-cut algorithms.
 Classes for solving the Steiner tree problem exactly with a branch&cut algorithm.
 Implementation of an approxmiation algorithm for Steiner tree problems given by Richard T.
 Implementation of an LP-based 1.39+epsilon Steiner tree approximation algorithm by Goemans et al.
 Declaration and implementation of the class computing a 2(1-1/l) minimum Steiner tree approximation according to the algorithm of Kou et al.
 Implementation of Mehlhorn's minimum Steiner tree 2(1-1/l)-approximation algorithm.
 Declaration of ogdf::MinSteinerTreeModule.
 Implementation of an approxmiation algorithm for Steiner tree problems provided by Michel X.
 Implementation of the 1.55-approximation algorithm for the Minimum Steiner Tree problem by Robins and Zelikovsky.
 Implementation of Shore, Foulds and Gibbons' branch and bound algorithm for solving minimum Steiner tree problems.
 Implementation of the 2(1-1/l)-approximation algorithm for the minimum Steiner tree problem by Matsuyama and Takahashi.
 Implementation of Zelikovsky's 11/6-approximation algorithm for the minimum Steiner tree problem.
 Implementation of a fast and simple clustering algorithm, Modified Nibble Clusterer.
 Declaration of basic page rank.
 Declaration of base class of all planar separator algorithms.
 Declaration of class SeparatorDual.
 Declaration of class SeparatorDualFC, which applies the Fundamental Cycle Lemma directly to obtain a cycle.
 Declaration of class SeparatorHarPeled.
 Declaration of class SeparatorLiptonTarjan.
 Declaration of class SeparatorLiptonTarjanFC.
 Declaration of several shortest path algorithms.
 Declaration of base class of shortest path algorithms including some useful functions dealing with shortest paths flow (generater, checker).
 Declaration of class ShortestPathWithBFM which computes shortest paths via Bellman-Ford-Moore.
 Implementation of the basic greedy (2k-1)-spanner algorithm of Althöfer et al.
 Implementation of the random cluster-based k-spanner algorithm of Baswana and Sen 2007.
 Implementation of an k-spanner approximation algorithm from Berman et al.
 Implementation of an k-spanner approximation algorithm from Berman et al.
 Implementation of the random k-spanner algorithm of Elkin and Neiman 2018.
 A wrapper class for iterating calls to spanner algorithms.
 Implementation of the 2-spanner approximation algorithm of Kortsarz and Peleg 1994.
 Basic module for spanner algorithms.
 Definition of the ogdf::SteinerTreeLowerBoundDualAscent class template.
 Definition of the ogdf::SteinerTreePreprocessing class template.
 Declares class Triconnectivity which realizes the Hopcroft/Tarjan algorithm for finding the triconnected components of a biconnected multi-graph.
 Definition of ogdf::Voronoi class template.