Definition
Connected Graph
A graph is called connected if exists an edge sequence from all
to all . Or equivalently, a graph is called connected
consists of exactly one connected component. Strong Connectivity: A directed graph
is called strongly connected if it is connected and respects the directions of the edges. Weak Connectivity: A directed graph is called weakly connected if it is connect but does not respect the direction of the edges.
Connected Component
Connected Component
The maximum connected subgraph of an undirected graph
is called (connected) component of . Example: The following graph has two connected components: