In
graph theory, a
graph is
connected when all of its
nodes are directly or indirectly linked together with
edges. That is, if there is a
path between every two different nodes.
A directed graph is strongly connected if there is a directed path from every node to every other node.
A maximal connected subgraph of a graph is called a component of the graph.