#include <ogdf/planarity/embedder/ConnectedSubgraph.h>
Public Member Functions | |
| ConnectedSubgraph () | |
Static Public Member Functions | |
| static void | call (const Graph &G, Graph &SG, const node &nG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG) |
| Computes a connected subgraph SG of G containing node nG. | |
| static void | call (const Graph &G, Graph &SG, const node &nG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG) |
| Computes a connected subgraph SG of G containing node nG. | |
| static void | call (const Graph &G, Graph &SG, const node &nG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, NodeArray< node > &nG_to_nSG) |
| Computes a connected subgraph SG of G containing node nG. | |
| static void | call (const Graph &G, Graph &SG, const node &nG, node &nSG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG) |
| Computes a connected subgraph SG of G containing node nG. | |
| static void | call (const Graph &G, Graph &SG, const node &nG, node &nSG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG) |
| Computes a connected subgraph SG of G containing node nG. | |
| static void | call (const Graph &G, Graph &SG, const node &nG, node &nSG, NodeArray< node > &nSG_to_nG, EdgeArray< edge > &eSG_to_eG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG) |
| Computes a connected subgraph SG of G containing node nG. | |
| static void | call (const Graph &G, Graph &SG, const node &nG, node &nSG, NodeArray< node > &nSG_to_nG, EdgeArray< edge > &eSG_to_eG, NodeArray< node > &nG_to_nSG, EdgeArray< edge > &eG_to_eSG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG) |
| Computes a connected subgraph SG of G containing node nG. | |
| static void | call (const Graph &G, Graph &SG, const node &nG, NodeArray< node > &nSG_to_nG) |
| Computes a connected subgraph SG of G containing node nG. | |
| static void | call (const Graph &G, Graph &SG, const node &nG, NodeArray< node > &nSG_to_nG, EdgeArray< edge > &eSG_to_eG, NodeArray< node > &nG_to_nSG, EdgeArray< edge > &eG_to_eSG) |
| Computes a connected subgraph SG of G containing node nG. | |
Static Private Member Functions | |
| static void | recursion (Graph &SG, NodeArray< bool > &nodeVisited, EdgeArray< bool > &edgeVisited, const node &nG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG, NodeArray< node > &nSG_to_nG, EdgeArray< edge > &eSG_to_eG, NodeArray< node > &nG_to_nSG, EdgeArray< edge > &eG_to_eSG) |
| Copies to SG node nG and recursively all adjacent edges and nodes. | |
Definition at line 41 of file ConnectedSubgraph.h.
|
inline |
Definition at line 44 of file ConnectedSubgraph.h.
|
inlinestatic |
Computes a connected subgraph SG of G containing node nG.
| G | is the original graph. |
| SG | is assigned the connected subgraph containing nG. |
| nG | is a node in G. |
| nodeLengthG | stores for each node of G its length. |
| nodeLengthSG | is assigned for each node of SG its length. |
Definition at line 111 of file ConnectedSubgraph.h.
|
inlinestatic |
Computes a connected subgraph SG of G containing node nG.
| G | is the original graph. |
| SG | is assigned the connected subgraph containing nG. |
| nG | is a node in G. |
| nodeLengthG | stores for each node of G its length. |
| nodeLengthSG | is assigned for each node of SG its length. |
| edgeLengthG | stores for each edge of G its length. |
| edgeLengthSG | is assigned for each edge of SG its length. |
Definition at line 127 of file ConnectedSubgraph.h.
|
inlinestatic |
Computes a connected subgraph SG of G containing node nG.
| G | is the original graph. |
| SG | is assigned the connected subgraph containing nG. |
| nG | is a node in G. |
| nodeLengthG | stores for each node of G its length. |
| nodeLengthSG | is assigned for each node of SG its length. |
| nG_to_nSG | is assigned a mapping of nodes in G to nodes in SG. |
Definition at line 71 of file ConnectedSubgraph.h.
|
inlinestatic |
Computes a connected subgraph SG of G containing node nG.
| G | is the original graph. |
| SG | is assigned the connected subgraph containing nG. |
| nG | is a node in G. |
| nSG | is assigned the corresponding node of nG in SG. |
| nodeLengthG | stores for each node of G its length. |
| nodeLengthSG | is assigned for each node of SG its length. |
Definition at line 55 of file ConnectedSubgraph.h.
|
inlinestatic |
Computes a connected subgraph SG of G containing node nG.
| G | is the original graph. |
| SG | is assigned the connected subgraph containing nG. |
| nG | is a node in G. |
| nSG | is assigned the corresponding node of nG in SG. |
| nodeLengthG | is saving for each node of G its length. |
| nodeLengthSG | is assigned for each node of SG its length. |
| edgeLengthG | is saving for each edge of G its length. |
| edgeLengthSG | is assigned for each edge of SG its length. |
Definition at line 94 of file ConnectedSubgraph.h.
|
inlinestatic |
Computes a connected subgraph SG of G containing node nG.
| G | is the original graph. |
| SG | is assigned the connected subgraph containing nG. |
| nG | is a node in G. |
| nSG | |
| nSG_to_nG | is mapping nodes in SG to nodes in G |
| eSG_to_eG | is mapping edges in SG to edges in G |
| nodeLengthG | is saving for each node of G its length. |
| nodeLengthSG | is assigned for each node of SG its length. |
| edgeLengthG | stores for each edge of G its length. |
| edgeLengthSG | is assigned for each edge of SG its length. |
Definition at line 146 of file ConnectedSubgraph.h.
|
static |
Computes a connected subgraph SG of G containing node nG.
| G | is the original graph. |
| SG | is assigned the connected subgraph containing nG. |
| nG | is a node in G. |
| nSG | |
| nSG_to_nG | is mapping nodes in SG to nodes in G |
| eSG_to_eG | is mapping edges in SG to edges in G |
| nG_to_nSG | is mapping nodes in G to nodes in SG |
| eG_to_eSG | is mapping edges in G to edges in SG |
| nodeLengthG | stores for each node of G its length. |
| nodeLengthSG | is assigned for each node of SG its length. |
| edgeLengthG | stores for each edge of G its length. |
| edgeLengthSG | is assigned for each edge of SG its length. |
Definition at line 264 of file ConnectedSubgraph.h.
|
inlinestatic |
Computes a connected subgraph SG of G containing node nG.
| G | is the original graph. |
| SG | is assigned the connected subgraph containing nG. |
| nG | is a node in G. |
| nSG_to_nG | is mapping nodes in SG to nodes in G |
Definition at line 195 of file ConnectedSubgraph.h.
|
static |
Computes a connected subgraph SG of G containing node nG.
| G | is the original graph. |
| SG | is assigned the connected subgraph containing nG. |
| nG | is a node in G. |
| nSG_to_nG | is mapping nodes in SG to nodes in G |
| eSG_to_eG | is mapping edges in SG to edges in G |
| nG_to_nSG | is mapping nodes in G to nodes in SG |
| eG_to_eSG | is mapping edges in G to edges in SG |
Definition at line 302 of file ConnectedSubgraph.h.
|
staticprivate |
Copies to SG node nG and recursively all adjacent edges and nodes.
| SG | is the connected subgraph. |
| nodeVisited | saves for all nodes in G, if they were already treated. |
| edgeVisited | saves for all edges in G, if they were already treated. |
| nG | is a node in G. |
| nodeLengthG | is saving for each node of G its length. |
| nodeLengthSG | is saving for each node of SG its length. |
| edgeLengthG | is saving for each edge of G its length. |
| edgeLengthSG | is saving for each edge of SG its length. |
| nSG_to_nG | is mapping nodes in SG to nodes in G |
| eSG_to_eG | is mapping edges in SG to edges in G |
| nG_to_nSG | is mapping nodes in G to nodes in SG |
| eG_to_eSG | is mapping edges in G to edges in SG |
Definition at line 233 of file ConnectedSubgraph.h.