reading the source code of five different implementations of the dijkstra's single source shortest path i was wondering if anyone else cares to compare implementations of graph algorithms.
my questions are:
- what algorithm is implemented in what lib / database?
- how does the implementation perform with small, big, dense or sparse graphs?
More ideas? Comments? Anyone intrested to boostrap a pad or wiki to compile this?
[link] [3 comments]
