diff options
author | Ingela Anderton Andin <[email protected]> | 2017-12-14 11:22:19 +0100 |
---|---|---|
committer | Ingela Anderton Andin <[email protected]> | 2017-12-14 11:22:19 +0100 |
commit | 64ada689858df2f03388b1c15e96abcf6e5a55c0 (patch) | |
tree | 4859967d3b6474da12a685f865a874e014e797ae /lib/stdlib/doc/src | |
parent | ebe6e8a7fa591b31c1378106173a4ebb8a2b16de (diff) | |
parent | ca00af6271665772c97bb2e146b0f5cbb760a97c (diff) | |
download | otp-64ada689858df2f03388b1c15e96abcf6e5a55c0.tar.gz otp-64ada689858df2f03388b1c15e96abcf6e5a55c0.tar.bz2 otp-64ada689858df2f03388b1c15e96abcf6e5a55c0.zip |
Merge branch 'maint'
Diffstat (limited to 'lib/stdlib/doc/src')
-rw-r--r-- | lib/stdlib/doc/src/digraph.xml | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/lib/stdlib/doc/src/digraph.xml b/lib/stdlib/doc/src/digraph.xml index 5332d7aba5..db96beed6c 100644 --- a/lib/stdlib/doc/src/digraph.xml +++ b/lib/stdlib/doc/src/digraph.xml @@ -170,6 +170,10 @@ <p>If the edge would create a cycle in an <seealso marker="#acyclic_digraph">acyclic digraph</seealso>, <c>{error, {bad_edge, <anno>Path</anno>}}</c> is returned. + If <c><anno>G</anno></c> already has an edge with value + <c><anno>E</anno></c> connecting a different pair of vertices, + <c>{error, {bad_edge, [<anno>V1</anno>, <anno>V2</anno>]}}</c> + is returned. If either of <c><anno>V1</anno></c> or <c><anno>V2</anno></c> is not a vertex of digraph <c><anno>G</anno></c>, <c>{error, {bad_vertex, </c><anno>V</anno><c>}}</c> is |