In the manual (Chapters on routing) I found that the default static routing algorithm uses Dijkstra to calculate the routing. So it might be used already by NS, yet I can not garantee, I suggest you read the routing chapters, I've never used that file.
sincerely -- Vincent ----- Original Message ----- From: "mohd hammad" <[EMAIL PROTECTED]> To: <ns-users@ISI.EDU> Sent: Saturday, December 24, 2005 10:05 AM Subject: [ns] run Dijkstr on Ns2 > > > Hi All, > > I am new to ns2 (i.e: a student) and currently doing > some research work > using NS2...my focus is on Dijkstra algorithm at the > moment...but the > problem is that I don't know how to run > dijkstra.cc...As far as I > understand, this is a standalone file which can be > directly called...but I > doesn't seem to work...can some one please help me by > teaching how to run > this file... > > My another question is, does NS2 implement > Widest-Shortest Path or > Shortest-Widest Path?...If either one is implmented, > how do I find how it is > implemente? > > Thank you, > > > mohammad hammad > > > > > __________________________________ > Yahoo! for Good - Make a difference this year. > http://brand.yahoo.com/cybergivingweek2005/ > >
