Suggestions of the easiest algorithms for some Graph operations

Question

The deadline for this project is closing in very quickly and I don\'t have much time to deal with what it\'s left. So, instead of looking for the best (and probably more complic

Answer 1

The simplest algorithm to compute shortest path between two nodes is Floyd-Warshall. It's just triple-nested for loops; that's it.

It computes ALL-pairs shortest path in O(N^3), so it may do more work than necessary, and will take a while if N is huge.