What is the difference between


connected


strongly-connected and


complete?


My understanding is:


**connected**: you can get to every vertex from every other vertex.


**strongly connected**: every vertex has an edge connecting it to every other vertex.


**complete**: same as strongly connected.


Is this correct?



Difference between connected vs strongly connected vs complete graphs
* *Connected* is usually associated with undirected graphs (two way edges): there is a **path** between every two nodes.
* *Strongly connected* is usually associated with directed graphs (one way edges): there is a **route** between every two nodes.
* *Complete graphs* are undirected graphs where there is an **edge** between every pair of nodes.


