Design and Analysis of Algorithms...
Here are some study notes that cover
- Adjacency-List/Matrix
- BFS, Breadth-First Search
- DFS, Depth-First Search
- Forefathers
- Edge and Vertex ID
- Topological Sort
- SCC, Strongly Connected Components
- MST, Minimum Spanning Tree
Download the PDF file.
Also, here is a small Java program that performs the Floyd-Warshall algorithm