Graph is an ADT that represents a collection of vertices V and the connection amongst them called edges E. Every Graph G is defined as function of G = f(V, E). A graph is created by calling one of the two constructors. One creates a graph with given number of vertices. Other takes a stream input and
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected
searching dependent graphs…