Saved Bookmarks
| 1. |
What Is Meant By Strongly Connected In A Graph? |
|
Answer» An undirected graph is CONNECTED, if there is a path from EVERY vertex to every other vertex. A DIRECTED graph with this PROPERTY is CALLED strongly connected. An undirected graph is connected, if there is a path from every vertex to every other vertex. A directed graph with this property is called strongly connected. |
|