| Package | com.yworks.yfiles.algo |
| Class | public class GraphChecker |
| Inheritance | GraphChecker  YObject Object |
| Method | Defined By | ||
|---|---|---|---|
GraphChecker(init:Boolean = true) | GraphChecker | ||
 | equals(o:Object):Boolean | YObject | |
getClass():Class [override] | GraphChecker | ||
| hashCode():int | YObject | |
[static]
Checks whether or not the given graph is acyclic, that is, if it contains no directed cycle. | GraphChecker | ||
isBiconnected(graph:Graph):Boolean [static]
Checks whether or not the given undirected graph is biconnected. | GraphChecker | ||
isBipartite(graph:Graph):Boolean [static]
Checks whether or not the given undirected graph is bipartite. | GraphChecker | ||
isConnected(graph:Graph):Boolean [static]
Checks whether or not the given graph is connected. | GraphChecker | ||
[static]
Checks whether or not the given graph is cyclic, that is, if it contains a directed cycle. | GraphChecker | ||
[static]
Checks whether the given graph is a forest, that is, a graph whose connected components are directed rooted trees. | GraphChecker | ||
isMultipleEdgeFree(graph:Graph):Boolean [static]
Checks whether or not the given undirected graph contains no multiple edges. | GraphChecker | ||
isNaryTree(graph:Graph, n:int):Boolean [static]
Checks whether or not the given graph is a directed rooted tree where each node has a maximum of n children. | GraphChecker | ||
[static]
Checks whether or not the given graph is planar. | GraphChecker | ||
isRootedTree(graph:Graph):Boolean [static]
Checks whether or not the given graph is a directed rooted tree. | GraphChecker | ||
isSelfLoopFree(graph:Graph):Boolean [static]
Checks whether or not the given graph contains no self-loops. | GraphChecker | ||
[static]
Checks whether or not the given directed graph is simple. | GraphChecker | ||
isStronglyConnected(graph:Graph):Boolean [static]
Checks whether or not the given directed graph is strongly connected. | GraphChecker | ||
[static]
Checks whether or not the given graph is an undirected tree. | GraphChecker | ||
| GraphChecker | () | Constructor |
Hide Inherited Public Methods
Show Inherited Public Methodspublic function GraphChecker(init:Boolean = true)init:Boolean (default = true) |
| getClass | () | method |
override public function getClass():ClassReturnsClass |
| isAcyclic | () | method |
public static function isAcyclic(graph:Graph):Boolean
Checks whether or not the given graph is acyclic, that is, if it contains no directed cycle.
Note: isAcyclic(graph) <=> !isCyclic(graph).
Parameters
graph:Graph — the given graph.
|
Boolean — true if the graph is acyclic; false, otherwise.
|
| isBiconnected | () | method |
public static function isBiconnected(graph:Graph):BooleanChecks whether or not the given undirected graph is biconnected.
Parameters
graph:Graph — the given undirected graph.
|
Boolean — true if the graph is biconnected; false, otherwise.
|
| isBipartite | () | method |
public static function isBipartite(graph:Graph):BooleanChecks whether or not the given undirected graph is bipartite.
Parameters
graph:Graph — the given undirected graph.
|
Boolean — true if the graph is bipartite; false, otherwise.
|
| isConnected | () | method |
public static function isConnected(graph:Graph):BooleanChecks whether or not the given graph is connected.
Parameters
graph:Graph — the given graph.
|
Boolean — true if the graph is connected; false, otherwise.
|
| isCyclic | () | method |
public static function isCyclic(graph:Graph):Boolean
Checks whether or not the given graph is cyclic, that is, if it contains a directed cycle.
Note: isCyclic(graph) <=> !isAcyclic(graph).
Parameters
graph:Graph — the given graph.
|
Boolean — true if the graph is cyclic; false, otherwise.
|
| isForest | () | method |
public static function isForest(graph:Graph):BooleanChecks whether the given graph is a forest, that is, a graph whose connected components are directed rooted trees.
Parameters
graph:Graph — the given graph.
|
Boolean — true if the graph is a forest; false, otherwise.
|
| isMultipleEdgeFree | () | method |
public static function isMultipleEdgeFree(graph:Graph):Boolean
Checks whether or not the given undirected graph contains no multiple edges.
More precisely, the method returns true if the graph contains no two distinct edges e1, e2 that connect the same pairs of nodes in either direction. Note: isMultipleEdgeFree(graph) => isSimple(graph).
Parameters
graph:Graph — the given undirected graph.
|
Boolean — true if the graph contains no multiple edges; false, otherwise.
|
| isNaryTree | () | method |
public static function isNaryTree(graph:Graph, n:int):Boolean
Checks whether or not the given graph is a directed rooted tree where each node has a maximum of n children.
Parameters
graph:Graph — the given graph.
| |
n:int |
Boolean — true if the graph is a directed rooted tree where each node has <= n children; false, otherwise.
|
| isPlanar | () | method |
public static function isPlanar(graph:Graph):BooleanChecks whether or not the given graph is planar.
Parameters
graph:Graph — the given graph.
|
Boolean — true if the graph is planar; false, otherwise.
|
| isRootedTree | () | method |
public static function isRootedTree(graph:Graph):Boolean
Checks whether or not the given graph is a directed rooted tree.
Note: isRootedTree(graph) => isTree(graph).
Parameters
graph:Graph — the given graph.
|
Boolean — true if the graph is a directed rooted tree; false, otherwise.
|
| isSelfLoopFree | () | method |
public static function isSelfLoopFree(graph:Graph):Boolean
Checks whether or not the given graph contains no self-loops.
Note: !isSelfLoopFree(graph) => !isAcyclic(graph).
Parameters
graph:Graph — the given graph.
|
Boolean — true if the graph contains no self-loops; false, otherwise.
|
| isSimple | () | method |
public static function isSimple(graph:Graph):Boolean
Checks whether or not the given directed graph is simple.
A graph is called simple if it contains no two distinct edges e1, e2 where e1.source() == e2.source() && e1.target() == e2.target(). Note: isMultipleEdgeFree(graph) => isSimple(graph).
Parameters
graph:Graph — the given directed graph.
|
Boolean — true if the graph is simple; false, otherwise.
|
| isStronglyConnected | () | method |
public static function isStronglyConnected(graph:Graph):BooleanChecks whether or not the given directed graph is strongly connected.
Parameters
graph:Graph — the given directed graph.
|
Boolean — true if the graph is strongly connected; false, otherwise.
|
| isTree | () | method |
public static function isTree(graph:Graph):Boolean
Checks whether or not the given graph is an undirected tree.
Note: isRootedTree(graph) => isTree(graph).
Parameters
graph:Graph — the given graph.
|
Boolean — true if the graph is an undirected tree; false, otherwise.
|