Assume we have a path in an undirected cyclic weighted graph. Assuming we have an engine that can find a path from node A to node B in such a graph, is there an easy way/algorithm to figure out if the given path from A to B is at least X% better than any other disjoint path from A to B? By disjoint I mean two paths may not share any edges.

  • $\begingroup$ When you mean cyclic, do you mean it's a cycle? $\endgroup$ – davidlowryduda Oct 7 '11 at 23:14
  • $\begingroup$ I mean it has cycles. $\endgroup$ – Schultz9999 Oct 7 '11 at 23:17
  • $\begingroup$ Perhaps this paper might be of use: dl.acm.org/citation.cfm?id=78636 $\endgroup$ – Joseph Malkevitch Oct 8 '11 at 22:24
  • $\begingroup$ @JosephMalkevitch: we already have A* based search engine. $\endgroup$ – Schultz9999 Oct 10 '11 at 22:46

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.