do not use multiple dispatch in graph algos

...2algo_experimental/src/graph/embedding/HopcroftTarjan.cpp

alib2algo_experimental/src/graph/embedding/HopcroftTarjan.h

alib2algo_experimental/src/graph/isomorphism/HopcroftGraph.h

alib2algo_experimental/src/graph/isomorphism/HopcroftImpl.h

...2algo_experimental/src/graph/isomorphism/HopcroftWong.cpp

alib2algo_experimental/src/graph/isomorphism/HopcroftWong.h

alib2algo_experimental/src/graph/isomorphism/Isomorphism.cpp

alib2algo_experimental/src/graph/isomorphism/Isomorphism.h

...algo_experimental/src/graph/maximumflow/FordFulkerson.cpp

alib2algo_experimental/src/graph/maximumflow/FordFulkerson.h

...2algo_experimental/src/graph/minimumcut/FordFulkerson.cpp

alib2algo_experimental/src/graph/minimumcut/FordFulkerson.h

...2algo_experimental/src/graph/shortestpath/BellmanFord.cpp

alib2algo_experimental/src/graph/shortestpath/BellmanFord.h

alib2algo_experimental/src/graph/shortestpath/Dijkstra.cpp

alib2algo_experimental/src/graph/shortestpath/Dijkstra.h

...lgo_experimental/src/graph/shortestpath/FloydWarshall.cpp

...2algo_experimental/src/graph/shortestpath/FloydWarshall.h

alib2algo_experimental/src/graph/sort/TopologicalSort.cpp

alib2algo_experimental/src/graph/sort/TopologicalSort.h