Shortest Path Computation
In this paper a generalized algorithm has been developed to find the shortest path in a transmission line network. The selected network or graph for the proposed algorithm has the ability to traverse a network or graph with any complex structures, with any number of nodes and with any number of paths this algorithm has been developed by considering the source node as the starting node and designation node as the end node.
Related Topics:
Shortest Path Computation
Reviewed by Myc
on
8:16 AM
Rating:
No comments: