The PLN (Persero) UP3 Manokwari consists of six feeders, each of which has up to 13–40 distribution transformers. When there is a disturbance, field officers (yantek) must go down each channel to locate the source of the interruption. It takes a significant amount of time and work. Dijkstra's algorithm is an algorithm for finding the shortest path between two points in a weighted graph. Djikstra's algorithm performs the shortest route calculation more simply and has a superior running time because the work system spreads over each graph node. The authors used the Dijkstra algorithm approach to calculate the shortest path at the point of interference. The goal of this research is to find the shortest path from the position of field officers (yantek) to the coordinate coordinates of network disruptions using the Dijkstra algorithm in the distribution network interference location detection application utilizing a mobile-based graph. The use of the Dijkstra algorithm in identifying the shortest path to the location of distribution network interruption at PLN UP3 Manokwari can assist field officers in locating the nearest route to the location of disruption with an accuracy of 98,33% as a result of this study.