A public forum for discussing the design of software, from the user interface to the code architecture. Now closed.
Gosh Ryan don't be mean to the poor fellow.
Here's how it's done. First calculate which path is shortest. This will be a simple exercise. Then, find the second shortest path. Keep going under you have found the longest path. Now, count how many paths you have. It will be helpful to use a red-black tree for this.
Monday, December 12, 2005
Finding the longest path between two nodes on a graph is np-hard. It is a superset of the hamilton path problem.
Monday, December 19, 2005
This topic is archived. No further replies will be accepted.Other recent topics
Powered by FogBugz