How abt negating values and using same single source shortest path algo ? 2010/1/15 saltycookie <[email protected]>
> longest path is NP-hard > > 2010/1/11 Johan <[email protected]> > >> Ok, so I know that Dijkstra can be used to solve the single-source >> shortest path problem quite efficiently. I however need to find the >> single source longest path through a graph. Can Dijkstra be used for >> this if I transform the edge lengths so that the longest edge is now >> the shortest etc etc. Does anybody have any references to work done >> which is similar to the this longest path problem? >> >> >> -- >> 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]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> >> >> > > > -- > 此致 > 敬礼！ > > 林夏祥 > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > >--
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.
