Document whether dag-shortest-paths works on negative weights

[AlexKnauth]

The documentation for dag-shortest-paths should say whether or not it works on dags with negative edge weights.

And in the case that it doesn't handle them, should a version be added that does? Or would restricting to dags not give any advantage over bellman-ford for this?