Minimum route from two nodes
 

A graph for which the relations between pairs of vertices are symmetric
so that each edge has no directional character (as opposed to a directe
graph).

Rog Wrote:
What is an undirected graph? I don't recall this from my
maths days ...

Rgds

Rog



-----Original Message-----

What is the algorithm to find the minimum route from two
nodes of an
undirected graph?


--
stefantem
----------------------------------------------------------
--------------
stefantem's Profile: http://www.excelforum.com/member.php?
action=getinfo&userid=13594
View this thread:
http://www.excelforum.com/showthread...hreadid=263127

.


--
stefante
-----------------------------------------------------------------------
stefantem's Profile: http://www.excelforum.com/member.php...fo&userid=1359
View this thread: http://www.excelforum.com/showthread.php?threadid=26312