- isCyclic() - Method in interface berack96.lib.graph.Graph
-
Tells if the graph has some cycle.
A cycle is detected if visiting the graph G starting from V1 (that is any of the vertex of G),
the visit can return to V1 in any point.
- isCyclic() - Method in class berack96.lib.graph.impl.AdjGraph
-
- isCyclic() - Method in class berack96.lib.graph.impl.MapGraph
-
- isCyclic() - Method in class berack96.lib.graph.impl.MatrixGraph
-
- isDAG() - Method in interface berack96.lib.graph.Graph
-
Tells if the graph has the property of DAG (Directed Acyclic Graph).
A graph is a DAG only if absent of any cycle.
- isDAG() - Method in class berack96.lib.graph.impl.AdjGraph
-
- isDAG() - Method in class berack96.lib.graph.impl.MapGraph
-
- isDAG() - Method in class berack96.lib.graph.impl.MatrixGraph
-
- isDiscovered(V) - Method in class berack96.lib.graph.visit.impl.VisitInfo
-
Tells if a vertex is discovered or not
- isStillContained() - Method in class berack96.lib.graph.Vertex
-
This call tell if the current vertex is still contained in the graph linked.
While this function return false all the other methods will throw an exception.
- isVisited(V) - Method in class berack96.lib.graph.visit.impl.VisitInfo
-
Tells if the vertex is visited or not
- iterator() - Method in class berack96.lib.graph.impl.AdjGraph
-
- iterator() - Method in class berack96.lib.graph.impl.MapGraph
-
- iterator() - Method in class berack96.lib.graph.impl.MatrixGraph
-