Declaration of extended graph algorithms. More...
#include <ogdf/cluster/ClusterGraph.h>Go to the source code of this file.
Namespaces | |
| namespace | ogdf |
The namespace for all OGDF objects. | |
Functions | |
| template<class LISTITERATOR > | |
| void | ogdf::inducedSubGraph (const Graph &G, LISTITERATOR start, Graph &subGraph) |
| Computes the induced subgraph of nodes. | |
| template<class LISTITERATOR > | |
| void | ogdf::inducedSubGraph (const Graph &G, LISTITERATOR start, Graph &subGraph, NodeArray< node > &nodeTableOrig2New) |
| Computes the induced subgraph of nodes. | |
| template<class LISTITERATOR > | |
| void | ogdf::inducedSubGraph (const Graph &G, LISTITERATOR start, Graph &subGraph, NodeArray< node > &nodeTableOrig2New, EdgeArray< edge > &edgeTableOrig2New) |
| Computes the induced subgraph of nodes. | |
| template<class NODELISTITERATOR , class EDGELIST > | |
| void | ogdf::inducedSubgraph (Graph &G, NODELISTITERATOR &it, EDGELIST &E) |
| bool | ogdf::isCConnected (const ClusterGraph &C) |
| void | ogdf::makeCConnected (ClusterGraph &C, Graph &GG, List< edge > &addedEdges, bool simple=true) |
| int | ogdf::stNumber (const Graph &G, NodeArray< int > &numbering, node s=0, node t=0, bool randomized=false) |
| bool | ogdf::testSTnumber (const Graph &G, NodeArray< int > &st_no, int max) |
| double | ogdf::computeMinST (const Graph &G, EdgeArray< double > &weight, EdgeArray< bool > &isInTree) |
| Computes a minimum spanning tree using Prim's algorithm. | |
Declaration of extended graph algorithms.
Copyright (C). All rights reserved. See README.txt in the root directory of the OGDF installation for details.
Definition in file extended_graph_alg.h.