The following tables list the members exposed by the Graph type.
Public Constructors| Name | Description | |
|---|---|---|
 |
Overloaded. |
Public Fields| Name | Description | |
|---|---|---|
 |
|
|
|
|
|
|
|
|
|
|
|
|
|
Protected Fields Public Methods| Name | Description | |
|---|---|---|
|
Overloaded. |
|
|
Overloaded. |
|
|
|
|
|
Overloaded. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Overloaded. |
|
|
The input should be biconnected undirected graph. The output is directed acyclic ST graph. |
|
|
|
|
|
Overloaded. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Overloaded. |
|
|
Overloaded. |
|
|
Overloaded. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Overloaded. |
|
|
|
|
|
|
|
|
|
|
|
Must be called on a proper hierarchical graph. |
|
|
|
|
|
Overloaded. |
|
|
|
|
|
|
|
|
Overloaded. |
|
|
|
|
|
|
|
|
Must be called on a simple hierarchical graph. |
|
|
|
|
|
|
|
|
|
|
|
Must be called on a simple connected graph. |
|
|
|
|
|
|
|
|
Replaces long links with a sequence of virtual nodes and links that connect adjacent levels. Must be called on a simple hierarchical graph. |
|
|
|
|
|
|
|
|
Must be called on a transitive DAG. |
|
|
|
|
|
Overloaded. |
|
|
|
|
|
|
|
|
Overloaded. |
|
|
Must be called on a planar graph. |
|
|
|
|
|
|
|
|
|
|
|
|
|
 |
|
|
|
|
|
|
|
|
|
Overloaded. |
|
|
|
|
|
|
|
|
Overloaded. |
See Also