A root vertex in a directed graph is the vertex that has a path to every other vertex. Given a directed Graph, find its root vertex. List of graph edges are given as:
edges = [(0, 1), (1, 2), (2, 3), (3, 0), (4, 3), (4, 5), (5, 0)]
Answers
Answered by
2
Answer:
A digraph is strongly connected if there is a directed path from every vertex to every other vertex. A digraph that is not strongly connected consists of a set of strongly connected components, which are maximal strongly connected subgraphs. A directed acyclic graph (or DAG) is a digraph with no directed cycles
Explanation:
was this answer helpful?
add this as brainly list
Similar questions