You are here: irt.org | FOLDOC | connected graph
<mathematics> A graph such that there is a path between any
pair of nodes (via zero or more other nodes).
Thus if we start from any node and visit all nodes connected
to it by a single edge, then all nodes connected to any of
them, and so on, then we will eventually have visited every
node in the connected graph.
Nearby terms: conjunction « Conjunctive Normal Form « connect « connected graph » connected subgraph » Connection Definition Language » connectionless protocol
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL
©2018 Martin Webb