followinginclude the given vertices and vdetermine whether reaches find all the vertices of determine whether is strongly connected determine whether is acyclic compute the transitive closure that are reachable from given vertex of in the remainder of this sectionwe explore some efficient algorithms for solving these problems traversing digraph