Is the Is Reachable From Relation an Equivalence Relation in Directed Graphs?

  • Level: Graduate 
  • Thread starter algonewbee
  • Start date
  • Tags Tags
    Graph
1 reply · 3K views · last reply
algonewbee
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?