I have a graph with $N$ nodes. Every single node is not neccesarily connected to every other node on the graph, but we do know to which ones it is connected.
How can I calculate a maximum number of different possible paths between any two nodes on a graph using
dijkstras algorythmassuming the above is true?