Re: Longest path
- From: "Raghu V. Hudli" <raghu>
- Date: Sat, 31 Mar 2007 17:24:04 +0530
Use shortest path with sign of weights reversed.
"Mahdi" <mahdi.dabestani@xxxxxxxxx> wrote in message
news:1175279270.739095.62590@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Hello!
A short question :
We want an algorithm that finds the longest simple path in a graph.
Thanks.
--
Posted via a free Usenet account from
http://www.teranews.com
.
Relevant Pages
- Re: Shortish paths
... Remember I'm not asking for an algorithm, just for advice on what to ... original graph. ... optimal solution is removed from the graph, ... I intend to begin by rereading the shortest path sections of Cormen ...
(comp.theory) - Re: Graph Algorithm Question
... is there an algorithm to do the following: ... However the graph should contain no directed ... cycle whose weight is negative. ... If all the edges weighs are positive then shortest path from X to X is ...
(comp.theory) - Re: Shortish paths
... original graph. ... The functionality of Dijkstra's original algorithm can be extended ... optimal solution is removed from the graph, ... I intend to begin by rereading the shortest path sections of Cormen ...
(comp.theory) - Re: Shortish paths
... For how many nodes and how many edges will the actual algorithm run ... original graph. ... optimal solution is removed from the graph, ... I intend to begin by rereading the shortest path sections of Cormen ...
(comp.theory) - Re: Representing a Tree in Python
... other nodes in the graph. ... Dijkstra code you are using it may be possible to help you with the ... finds shortest path between only two nodes. ... And what is the best way to represent a tree in Python?. ...
(comp.lang.python) |
|
