On Feb 27, 1:04 am, "Ez_Alg" <[EMAIL PROTECTED]> wrote:
<snip>
> here is my question:
> In Internet routing, there are delays on lines but also, more
> significantly, delays at routers.
> Suppose that in addition to having edge lengths l(e) : e in E, a graph
> also has vertex costs
It seems you've got the algorithm from "data structures by tanenbaum,"
where the algorithm is taking only the edge costs into account. Try
this book "Introduction to algorithms: Cormen" you can tweak the
algorithm given there to suit your needs.
Regards,
Nupul
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
