Open
Graph Drawing
Framework

 v. snapshot-2018-03-28
 

Graph Algorithms

This module contains various basic and advanced graph algorithms. More...

Modules

 Self-Loops and Multi-Edges
 Functions dealing with self-loops and multiple (parallel) edges in graphs.
 
 Induced Subgraphs and Cliques
 Provides functions dealing with induced subgraphs and finding cliques.
 
 Basic Functions for Digraphs
 Basic functions operating on digraphs like testing for single source or sink, st-graph, bimodal.
 
 Basic Functions for Trees and Forests
 Functions for testing if a graph represents a (free) tree or forest.
 
 Connectivity in Graphs and Digraphs
 Provides functions dealing with connectivity in graphs and clustered.
 
 Shortest Paths
 Algorithms for computing shortest paths in graphs (including single-source and all-pairs).
 
 Flow Algorithms
 Algorithms for computing min-cost and maximum flows.
 
 Minimum Spanning Trees
 Provides algorithms for minimum spanning trees.
 
 Steiner Trees
 Algorithms for computing Steiner trees.
 
 Planarity and Planarization
 Provides algorithms dealing with planarity of graphs.
 
 Cluster-Planarity and Planarization
 Provides algorithms dealing with cluster-planarity and embedding.
 
 Augmentation
 Provides algorithms for graph augmentation (e.g., adding edges to make a graph biconnected).
 
 Graph Clustering
 Provides algorithms for clustering graphs.
 
 Orientations
 Provides functions for orienting graphs like st-numbering.
 

Classes

class  ogdf::BasicPageRank
 Basic page rank calculation. More...
 
class  ogdf::ConvexHull
 Computes the convex hull of a set of points or a layout. More...
 
class  ogdf::Voronoi< T >
 Computes Voronoi regions in an edge-weighted graph. More...
 

Detailed Description

This module contains various basic and advanced graph algorithms.