CONNECTED GRAPH
\kənˈɛktɪd ɡɹˈaf], \kənˈɛktɪd ɡɹˈaf], \k_ə_n_ˈɛ_k_t_ɪ_d ɡ_ɹ_ˈa_f]\
Sort: Oldest first
-
A graph such that there is a path between anypair of nodes (via zero or more other nodes).Thus if we start from any node and visit all nodes connectedto it by a single edge, then all nodes connected to any ofthem, and so on, then we will eventually have visited everynode in the connected graph.
By Denis Howe
