Connectedness in directed graphs
A directed graph is called strongly connected iff there is a path from
u to v and from v to u whenever u and v are vertices in the graph.
A directed graph is called weakly connected iff there is a path between
any two vertices in the underlying undirected graph (the undirected
graph that will result from making the edges of the directed graph