in c$++$ this is the output

Enter name of network file: c:

etworkfile.txt

The Digraph's Adjacency$-$List Representation:

$1$: Los$\_$Angeles$--346$

$2$: San$\_$Francisco$--134$

$3$: Denver$--123$

$4$: Chicago$--38$

$5$: Boston$--46$

$6$: New$\_$York$--478$

$7$: Miami$--835$

$8$: New$\_$Orleans$--17$

Number of start city? $1$

Number of destination? $2$

Shortest path from Los Angeles to San Francisco is:

$1$ Los$\_$Angeles

$|$

v

$3$ Denver

$|$

v

$2$ San$\_$Francisco

More $($Y or N$)?$Y

Number of start city? $6$

Number of destination? $4$

Shortest path from New York to Chicago is:

$6$ New$\_$York

$|$

v

$4$ Chicago

More $($Y or N$)?$y