Let be a non-directed graph and write if some path in starts at and ends at (with ). Show that is an equivalence relation on , and define the connected components of through its equivalence classes.
Bonus: can you define an equivalence relation on directed graphs? What does it mean in the directed case?