Is there a function that finds the shortest path between two nodes?

Question

Using python, is there a function that allows me to find the shortest distance between two nodes in a networkx graph. The function itself cant be from networkx. Essentially what im asking, is there an alternative function for networkx.shortest_path_length() without actually using NetworkX. I've looked at the source code and it also has nx functions.

Answer 1

Yes there is, Dijkstra's algorithm . The algorithm creates a tree of shortest paths from the starting vertex, the source, to all other points in the graph.

def dijkstra(self, src): 

    dist = [sys.maxint] * self.V 
    dist[src] = 0
    sptSet = [False] * self.V 

    for cout in range(self.V): 
        u = self.minDistance(dist, sptSet) 
        sptSet[u] = True

        for v in range(self.V): 
            if self.graph[u][v] > 0 and sptSet[v] == False and dist[v] > dist[u] + self.graph[u][v]: 
                    dist[v] = dist[u] + self.graph[u][v] 

    self.printSolution(dist)