SciPy MCQ
When working with the csgraph modul, what is a correct method to find the shortest path in a graph from one element to another?
A)
ford()
B)
bellmann()
C)
dijkstra()
D)
All of the above

Correct Answer : Option (C) :   dijkstra()