1.Give an efficient algorithm which takes as input a directed graph G =
(V,E), and determines whether or not there is a vertex s is in V from which
all other vertices are reachable.?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
Give a linear-time algorithm for the following task.
Input: : A directed acyclic graph G (V,E)
Question: Does G contain a directed path that touches every vertex exactly
once?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
