gives a matrix, where the entry is the length of a shortest path in g between vertices and .
returns a three-dimensional matrix with dimensions , in which the entry is the length of a shortest path from to and the entry is the predecessor of in a shortest path from to .
- Computation on Graphs
- Discrete Mathematics
- Graph Algorithms
- Graph Construction & Representation
- Graph Operations and Modifications
- Graph Properties
- Graph Properties & Measurements
- Graphs and Matrices
- Graphs & Networks
- Graph Visualization
- Mathematical Data Formats
- Statistical Analysis
- Social Network Analysis