SHORTEST PATH COMPUTATION IN A TRANSMISSION LINE NETWORK .doc (Paper Presentation)

ABSTRACT

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.

Dijikstras’s algorithm is used to find the closest node from the source node. The proposed software is developed, tested and verified with an example. The problem of finding efficient routing algorithm has been a fundamental area, in the field of a transmission line network. Routing is the act of transform the power from

…………….So on ..........(download any of the following links to get complete paper presentation in word document)

Ziddu Link

Uploaded.to Link

Mediafire Link

Adrive Link

Rapidshare Link