Mathematics A graph is, not less than, weakly connected when There may be an undirected path (disregarding the directions within a directed graph) concerning any two nodesKelvin SohKelvin Soh one,8151212 silver badges1515 bronze badges $endgroup$ one two $begingroup$ I actually dislike definitions which include "a cycle is usually a shut route". If