continue with graphs

alib2algo/src/graph/shortestpath/BellmanFord.cpp

alib2algo/src/graph/shortestpath/BellmanFord.h

alib2algo/src/graph/shortestpath/Dijkstra.cpp

alib2algo/src/graph/shortestpath/Dijkstra.h

alib2algo/src/graph/shortestpath/FloydWarshall.cpp

alib2algo/src/graph/shortestpath/FloydWarshall.h

alib2algo/src/graph/sort/TopologicalSort.cpp

alib2algo/src/graph/sort/TopologicalSort.h

alib2algo/src/graph/spanningtree/JarnikPrim.cpp

alib2algo/src/graph/spanningtree/JarnikPrim.h

alib2algo/src/graph/traverse/Bfs.cpp

alib2algo/src/graph/traverse/Bfs.h

alib2algo/src/graph/traverse/Dfs.cpp

alib2algo/src/graph/traverse/Dfs.h

alib2algo/src/regexp/transform/RegExpIterate.h

alib2algo/test-src/graph/traverse/BfsTest.cpp

alib2algo/test-src/graph/traverse/DfsTest.cpp

alib2data/src/common/multipleDispatch.hpp