DijkstraShortestPath | shortest path from a start node

Your edgeFlowMap will be populated by the flow value for each edge once evaluate() returns:

EdmondsKarpMaxFlow constructor

This is admittedly somewhat awkward and not super-discoverable; there's a TODO to fix this, which should be addressed in the 3.0 release.

Can't pinpoint the exact bug. But, I can tell you from experience that you should not find the minimum while consolidating. You consolidate and then you find the new minimum. You might get into trouble when you have multiple nodes with the same key and the one pointed to by min doesn't end up in the root list.

Also, while testing, don't use a random function. Create an array of arbitrary numbers and insert elements from the array into the heap.

I also don't understand how your implementation handles there being only one heap ordered tree in the Fib heap. What happens when you do an extract-min then?

You can find my Python implementation here if you need it.

During the 1st call of computeShortestPaths, you write in all visited vertices that they are visited, and their distance to the source.

You do not reset this information before calling computeShortestPaths, so the vertices retain their distance and visited status (the if(!v.isVisited()) makes sure you do not update anything for nodes that were already visited in the first call).

So you need to clear all the information in the Vertex objects between the two calls, or (better) refactor your code so that this infomation is stored in the DjikstraShortestPath object rather than the vertices, and reset each time you call computeShortestPaths.