How would I find the min distance between two vertices in a graph.
What function should I use?
For example, in the above, $d(2,4)=2$ and $d(2,3)=1$
$\begingroup$
$\endgroup$
1
-
$\begingroup$ By "min distance", do you mean the length of the minimum path between to specified vertices? $\endgroup$– m_goldbergCommented May 1, 2016 at 3:17
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
You can use GraphDistance to do that:
g = Graph[{1 <-> 2, 2 <-> 3, 3 <-> 1, 1 <-> 4}];
GraphDistance[g, 2, 3]
GraphDistance[g, 2, 4]
(* 1 *)
(* 2 *)
answered May 1, 2016 at 1:55