There are three parts in this thesis: In the first part, we give a new kind of representation of network with or without movement prohibitions, and a new shortest-route-tree algorithm is presented.
There are three parts in this thesis: In the first part, we give a new kind of representation of network with or without movement prohibitions, and a new shortest-route-tree algorithm is presented.