algonewbee
Sep17-08, 08:15 PM
Verify that in an undirected graph, the "is reachable from" relation is an equivalence relation on the vertices of the graph. Which of the three properties of an equivalence relation hold in general for the "is reachable from" relation on vertices of a directed graph?