connected graph

RU: связный граф

An undirected graph where a path exists between every pair of vertices. A directed graph with this property (every vertex reachable from every other) is called strongly connected.