There is some overlap between Combinatorica and the Graph related framework but there are also various elements missing. As far as I can see there is no 'Dijkstra' method or algorithm in Mathematica or is there a way (combination of other Graph methods) to do it? That is, without accessing Combinatorica by converting Graph to an EdgeList and so on.


1 Answer 1


FindShortestPath supports two methods "BellmanFord" and "Dijkstra" and it works on normal non-combinatorica Graphs.

  • $\begingroup$ Wonderful, so well hidden. Thanks. $\endgroup$ Nov 20, 2013 at 13:02
  • 2
    $\begingroup$ @FrancoisVanderseypen It's not hidden at all. Just type Dijkstra in the search bar, and you get a long list with hits. FindShortestPath is the fourth one in my list. $\endgroup$ Nov 20, 2013 at 15:49
  • $\begingroup$ Searching for Dinitz, Prim's or Kruskal doesn't reveal much. My question was more general but I refrained from asking too much. $\endgroup$ Nov 20, 2013 at 17:02

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.