//
//Minmum path analysis in net work by Dijkstra method.  
//
//This analysis is generaly used on wincalc window for seeking minmum path in net work.
//
//

//method by wincalc is bellow.
//Make crate wincalc window.



//wincalc views initit wincalc window with no icons.



//Make input data on wincalc window 


//Data are tokyosubway node table and spans between stations.
//Push icon buttom to link stations.


//Then wincalc views Tokyo subway network


//Solve minmum path by Dijkstra method
//Point last node of network.



//Point start node of network for seeking minnum path.



//wincalc views minmum path on window.



//And wincalc makes minmum path course table.