Watersheds on edge or node weighted graphs "par l'exemple"

Watersheds have been defined both for node and edge weighted graphs. We show that they are identical: for each edge (resp.\ node) weighted graph exists a node (resp. edge) weighted graph with the same minima and catchment basin.