# Connected network

### From Glossary

In the undirected case, a
graph is connected if,
for any pair of nodes, there is a path that contains both of them.
In a directed graph, or network, the path may be
required to be directed (i.e., follow the orientations of the
arcs), in which case the network is *strongly connected*; or,
the path may be allowed to ignore the arc orientations, in which
case the network is *weakly connected*.