Graph Properties

A graph can be connected, strongly connected and a graph can have different properties ...

Connected undirected graph : An undirected graph is said to be connected connected if there is a path from every vertex to every other vertex.

A component : A component of a graph is a maximal subset of the vertices such that every vertex is reachable from each other vertex in the component.

Strongly connected directed graph : A directed graph is said to be strongly connected if there is a path from every vertex to every other vertex.

A strongly connected component of a directed graph : is a vertex u and the collection of all vertices v such that there is a path from u to v and a path from v to u.