Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!gamma!epsilon!zeta!sabre!petrus!bellcore!decvax!linus!philabs!cmcl2!seismo!rlgvax!hadron!netexa!rfrye
From: rfrye@netexa.UUCP (Rob Frye)
Newsgroups: net.wanted.sources
Subject: Shortest Path in "C"
Message-ID: <120@netexa.UUCP>
Date: Mon, 3-Mar-86 14:13:59 EST
Article-I.D.: netexa.120
Posted: Mon Mar  3 14:13:59 1986
Date-Received: Sat, 8-Mar-86 21:58:53 EST
Distribution: net
Organization: NetExpress, Inc., Vienna, VA
Lines: 15

I am looking for a version of the Shortest Path First routing algorithm
available in C.  Various forms of this exist and have been described
by Knuth, Moore, Dijkstra, etc.  Does "sendmail" or such use it?  I hope
to find one that works for arbitrary network configurations and builds
the Shortest Path Tree for an appropriate node to all other nodes, using
path "costs" in some form.

Thanks in advance!!
-- 
--->
--
"You can Telenet, but you can't tell it much."

				Rob Frye, NetExpress Inc.
				{seismo,rlgvax}!hadron!{netex,netexa}!rfrye