General Information
Shortest path problem, Dijkstra's algorithm
- Usage
CALL H03ADF(N,NS,NE,DIRECT,NNZ,D,IROW,ICOL,SPLEN,PATH,IWORK,WORK,IFAIL)- Classification
| G2d1 | Shortest path network optimization |
- Type
- subroutine in NAG package (H sublibrary)
- Language
- Fortran
- Availability
- Proprietary, Portable
Module H03ADF in NAG