I am studying Brandes' betweenness algorithm for weighted undirected graph. I am not sure that, in Algorithm 1 (which is based on Dijkstra's shortest path algorithm),If a node is first encountered, then we have to check d[neighbor_node] < 0. But if not, do we have to check d[neighbor_node] > d[current] + length(current,neighbor_node)?If greater, then do I have to delete previous updates like Queue, Pre[] and others?
Brandes' betweenness algorithm for weighted undirected graph
algorithms;shortest path;graph algorithms