in single source shortest path ,having neg cost edges is good but:
1)it may
lead us goto into a loop of arbitrary time
in the meanwhile we can have another path with minimum positive cost but
with less time.
now by taking time factor into consideration,ie,larger path with neg cost or
smaller path with larger cost
how to code this??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
