Suppose we have a weighted, acyclic digraph, with positive and negative edge weights.
Is there an algorithm that determines whether there is a path of weight zero between vertices A and B? The Bellman-Form algorithm finds the path of smallest weight - is there another algorithm that determines the path of smallest absolute value weight?
Thanks, Charles