Re: [omnetpp] Shortest Path Algorithms (weightedSingleShortestPathsTo, etc.)

["Alfonso Ariza" <aarizaq_m at xxx>]

I test several implementation of Shortest Paths long time ago. The code are 
in spanish and don't work in omnet, is only for test, but, if you have 
interest I can send, I have implemented a k-shortest path with pruning that 
can find a less cost  multiple constraint path
--------------------------------------------------
From: "alper toku" <alpertoku at xxx>
Sent: Sunday, June 01, 2008 1:11 PM
To: <omnetpp-l at xxx>
Subject: [omnetpp] Shortest Path Algorithms 
(weightedSingleShortestPathsTo,etc.)

>
>
>
> Hi all,
>
>
> I am studying for my masters degree at Middle East Technical University in 
> Ankara, Turkey. My thesis subject is Optical Burst Switching. In OMNET 
> manual in ctopology class, it is mentioned that in the future shortest 
> path algorithms like "unweightedMultiShortestPathsTo", 
> "weightedSingleShortestPathsTo" and  "weightedMultiShortestPathsTo" will 
> be implemented. I tried to develop these algorithms on my own but I 
> couldn't succeed it.
> Has anyone already developed these algorithms by this time? If yes, could 
> you send me the codes?
>
> Thank you very much.
>
>
> Alper TOKU
> _________________________________________________________________
> Give to a good cause with every e-mail. Join the i’m Initiative from 
> Microsoft.
> http://im.live.com/Messenger/IM/Join/Default.aspx?souce=EML_WL_ GoodCause
> _______________________________________________
> OMNeT++ Mailing List
> options: http://lists.omnetpp.org/mailman/listinfo/omnetpp-l
> archive: http://www.omnetpp.org/listarchive/index.php
> 
_______________________________________________
OMNeT++ Mailing List
options: http://lists.omnetpp.org/mailman/listinfo/omnetpp-l
archive: http://www.omnetpp.org/listarchive/index.php