com.github.mdr.ascii.graph
A directed graph, allowing multi-edges and loops.
Two vertex objects are considered indistinguishable if they compare the same via .equals().
(Since version ) see corresponding Javadoc for more information.
A directed graph, allowing multi-edges and loops.
Two vertex objects are considered indistinguishable if they compare the same via .equals().