How to find a path in graph with maximum edges?

Given a graph, how can I find a path of length X between two nodes in the graph. The path should ideally visit an edge no more than once.

i have to write a c++ algorithm to find the shortest path of a graph. but we are not allowed to use graph theory algorithms such as Dijkstra's algorithm, etc. We were thinking ...show more

How can I find the minimum cut on a graph using a maximum flow algorithm? The answer says that the min cut consists of the edges with reachable from vertex and unreachable to vertex. (reachability is from the source vertex) Also, do any other algorithms...

Without the last condition, a reasonable approach would be to use Floyd-Warshall (or Dijkstra's, etc.) to precompute all pairwise shortest-path-distances for V', call these E', and use a TSP heuristic to approximate the shortest Hamiltonian path through...

I would like an algorithm or pointers to further research on how to find a fixed length path between two nodes in a weighted undirected graph.

I remember reading somewhere that this is a NP hard problem. But what if I add an aditional clause that guarantees that even though there might be a negative cycle in the graph, there exists a path that doesn't go through the negative cycle?

eg: http://upload.wikimedia.org/wikipedia/co… what method to be followed to find the MST when there are vertices with no entering edges?

There's no start node or goal node- I want the longest contiguous path. It can begin anywhere, can end anywhere as long as the total path is the longest possible. I guess the recurrence for Dynamic Programming would be something like: ds(u,v)=max(dsâ...

Note that it can be from any node to any other node. In other words, how can someone find the (maximum) diameter of a graph (unweighted and directed acyclic)?