Determining the Shortest Current Flow Path Using Dijkstra’s Algorithm in Mess Circuit
Chithambaramani. R1, Prakash. M2, Angel Latha Mary. S3

1Dr. Prakash. M, Department of CSE, Karpagam College of Engineering, Coimbatore (Tamil Nadu), India.
2R. Chitham Baramani, Department of CSE, KCG College of Technology, Chennai (Tamil Nadu), India.
3Dr. Angel Latha Mary. S, Department of CSE Karpagam College of Engineering, Coimbatore (Tamil Nadu), India.

Manuscript received on 02 June 2019 | Revised Manuscript received on 10 June 2019 | Manuscript published on 30 June 2019 | PP: 1635-1638 | Volume-8 Issue-8, June 2019 | Retrieval Number: G6240058719/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Determining the Shortest path for the current flow needs to solve the mess circuit which is certain complex nature. So first, we need to solve the complexity of the circuit and reducing it in the simplest form using many theorems available in day-to-day life. But now as far as the sample complex circuit is concerned, the complexity of the circuit can be solved by using one of the theorems namely, Mesh current analysis. We need to solve the mesh equations by applying some basic laws involved in the mesh current analysis. It is very much useful in finding the current flow which is developed in that closed loop or path. Hence the shortest path for the flow of electric current can be found using Dijkstra’s algorithm involved in the electrical circuits. This paper is proposed to identify the shortest path using Dijkstra’s algorithm. for the flow of maximum current with high Power in the complex circuit using Mesh current analysis.
Keyword: Dijkstra’s algorithm, Kirchhoff’s voltage law Mesh Current Analysis.
Scope of the Article: Nanometer-Scale Integrated Circuits.