sfdijkstra (2.0-git)
index
user/pwd/Mdijkstra.c
Dijkstra shortest-path algorithm in 2-D

 
Synopsis
        sfdijkstra < cost.rsf > out.rsf fin1= fin2= paths= ref1=0 ref2=0 nf=0

 
Parameters
       
 
ints fin1=
[nf]
 
ints fin2=
final points [nf]
 
int nf=0
number of final points
 
strings paths=
[nf]
 
int ref1=0

 
int ref2=0
source point

 
Used In
       

 
TCCS
        flat/comaz