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 2*V[g]*V[g], 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 .
- Graph Algorithms
- Graphs & Networks
- Graph Visualization
- Computation on Graphs
- Graph Construction & Representation
- Graphs and Matrices
- Graph Properties & Measurements
- Graph Operations and Modifications
- Statistical Analysis
- Social Network Analysis
- Graph Properties
- Mathematical Data Formats
- Discrete Mathematics