rfrye@netexa.UUCP (Rob Frye) (03/03/86)
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