# connected graph

A connected graph is a graph in which a path exists between all
pairs of vertices. If the graph is also a directed graph, and there exists
a path from each vertex to every other vertex, then it is a **strongly-connected
graph**. If a connected graph is such that exactly one edge connects
each pair of vertices, then it is said to be a complete
graph.