Optimized Finding shortest paths in graphs. Implementations: Bidirectional BFS, Grail index, Weakly & Strongly Connected graph Components (using iteration instead of recursion wherever needed, e.g. Tarjan's algorithm), parallelization using threads
panosfoto / software_development-sp Goto Github PK
View Code? Open in Web Editor NEWThis project forked from manospits/software_development-sp
Shortest Path