Re: [ns] question on route calculation

[George Riley <riley@ece.gatech.edu>]

I wrote the routealgo/dijkstra.cc and contributed it as part of the
nixvector routing in ns.  Presently nixvectors only use constant link
weights, and thus can use the simpler breadth-first-search algorithm (in
bfs.cc).  The dijkstra.cc is (I'm pretty sure) a correct implementation of
the Dijkstra algorithm.  Feel free to use it in whatever way is useful.

George


On Mon, 26 Nov 2001, Mahesh wrote:

> Hi Ahmad,
> 	Thanks a lot. While searching for the answer to the same question,
> i found a file called routealgo/dijkstra.cc. But i also found that this
> file is not used by the Makefile at all. Which means NS is not using
> dijkstra.cc for calculating shortest paths (it might be using Warshall's
> algo). Am I right? Please let me know.....
>
> Thanks in Advance,
>
> with due Regards,
> Mahesh.
>
> On Mon, 26 Nov 2001, Ahmad R Shahid wrote:
>
> > As far as I ramember, in god.cc Warshal's algorithm to
> > find the shortest path has been defined.
> >
> > Ahmad
> > --- Mahesh <mahesh@cs.iitm.ernet.in> wrote:
> > > Hi,
> > >   where can i find the route calculation code in the
> > > ns? I need to change
> > > the way routes are calculated.
> > >
> > > Thanks in Advance,
> > > Mahesh.
> > >
> > >
> > >
> >
> >
> > __________________________________________________
> > Do You Yahoo!?
> > Yahoo! GeoCities - quick and easy web site hosting, just $8.95/month.
> > http://geocities.yahoo.com/ps/info1
> >
>
>

-- 
                        -Dr. George F. Riley (riley@ece.gatech.edu)
                        -Assistant Professor, Georgia Tech ECE