In calculating a route through {HEAD ~ a network} of nodes and {TAIL ~ links}, a standard constrained shortest path first method builds a network graph, accumulating a set of path data 
of
In calculating a route through { HEAD ~ a network } of nodes and { TAIL ~ links } , a standard constrained shortest path first method builds a network graph , accumulating a set of path data
OTH OTH OTH OTH OTH HEAD HEAD HEAD HEAD HEAD HEAD REL OTH OTH TAIL TAIL TAIL TAIL TAIL OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH