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.
Discover more from Soa Technology | Aditya Website Development Designing Company
Subscribe to get the latest posts sent to your email.
