Programming, Algorithms, Data, Tech, Web Development.
every pair of vertices. Disconnected graph - a graph where there are unreachable vertices. There is not a path between every pair of vertices. Finite graph - a graph with a finite number of nodes and edges. Infinite graph - a graph where an end of the graph in a particular direction(s) extends to