The following tables list the members exposed by the DualGraph type.
Name | Description | |
---|---|---|
Overloaded. |
Name | Description | |
---|---|---|
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
Name | Description | |
---|---|---|
Overloaded. (Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
|
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
The input should be biconnected undirected graph. The output is directed acyclic ST graph. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
|
||
|
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
|
||
|
||
|
||
Gets a set of faces whose boundary contains the specified vertex. |
||
(Inherited from Graph.) |
||
Must be called on a proper hierarchical graph. (Inherited from Graph.) |
||
|
||
(Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
|
||
(Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Must be called on a simple hierarchical graph. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Must be called on a simple connected graph. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Replaces long links with a sequence of virtual nodes and links that connect adjacent levels. Must be called on a simple hierarchical graph. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Must be called on a transitive DAG. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
Overloaded. (Inherited from Graph.) |
||
Must be called on a planar graph. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
(Inherited from Graph.) |
||
|
||
Overloaded. (Inherited from Graph.) |
||
(Inherited from Graph.) |
||
|
||
Overloaded. (Inherited from Graph.) |