Rewrinting the whole code, with a better respect of C++ good pratices (trying :) )
Added an iterator to walk throw adjacents nodes (ie all predecessors + successors)
Tested new codes for Graph rewritten class
Tested new codes for rewritten Acm algorithms
To do:
-rewrite Coloring algorithms
-rewrite PathFinding algorithms
Testing Acm... fixed a small bug
Simple Graph coloring algorithm implementation (Welsh-Powell)
tests rewritten PathFinding algorithms
tested : rewritten eXtended Path finding algorithms (Dijkstra & Bellman)
End of rewritting.
To do:
-documentation
-more tests