A B C D E F G H I K L M N O P R S T U V W

C

changeRefresh(int) - Static method in class berack96.lib.graph.view.VisitListener

compareTo(VisitInfo<V>.VertexInfo) - Method in class berack96.lib.graph.visit.impl.VisitInfo.VertexInfo

contains(V) - Method in interface berack96.lib.graph.Graph

Check if the vertex passed is contained in the graph or not.
The vertex V1 is contained in the graph G, if and only if:
exist V2 in G such that V2.equals(V1)

contains(V) - Method in class berack96.lib.graph.impl.AdjGraph

contains(V) - Method in class berack96.lib.graph.impl.MapGraph

contains(V) - Method in class berack96.lib.graph.impl.MatrixGraph

containsEdge(V, V) - Method in interface berack96.lib.graph.Graph

Check if the edge between the two vertex passed is contained in the graph or not.
An edge between V1 and V2 is contained in the graph if and only if i can travel from V1 to V2.
If one of the two vertices is not contained in the graph, then even the edge isn't

containsEdge(V, V) - Method in class berack96.lib.graph.impl.AdjGraph

containsEdge(V, V) - Method in class berack96.lib.graph.impl.MapGraph

containsEdge(V, V) - Method in class berack96.lib.graph.impl.MatrixGraph

A B C D E F G H I K L M N O P R S T U V W