A shortest-path routing algorithm for incomplete WK-recursive networks

The design of shortest-path routing algorithms was found difficult for incomplete networks since most of them lack unified representation. An algorithm was proposed to route a message using a shortest-path for incomplete WK-recursive networks. This algorithm was found to take O(t) time for an intermediate mode to determine the next Node along the shortest path in O time preprocessing.