The Design of Software (CLOSED)

A public forum for discussing the design of software, from the user interface to the code architecture. Now closed.

The "Design of Software" discussion group has been merged with the main Joel on Software discussion group.

The archives will remain online indefinitely.

Find all paths in directed cyclic weighted graph

Hi All,

I have a directed cyclic weighted graph. I need to find all paths from a node to itself where the maximum distance travelled ( a total of weight of the edges ) is not greater than a number say N.

If you compute it manually then it involves paths where the cycles are made use of as well.

However i tried using DFS but it does not solve that problem.

Any clues to how to solve this problem?

madhav bhargava Send private email
Saturday, July 19, 2008

If edges are weighted and you keeps track of the distance traveled, why is dfs not working? Could you be more specific?
Pablo Send private email
Sunday, July 20, 2008
You should really do your own homework.
Monday, July 21, 2008

This topic is archived. No further replies will be accepted.

Other recent topics Other recent topics
Powered by FogBugz