diff options
author | Hans Bolinder <[email protected]> | 2017-12-14 09:58:54 +0100 |
---|---|---|
committer | GitHub <[email protected]> | 2017-12-14 09:58:54 +0100 |
commit | 4c7d0f1c937ec37fbdac47de4f71f92feb0128c7 (patch) | |
tree | 7fcba797a780725e63e24b390df10f43da404d05 | |
parent | 44b09e036b31b29dddc3b178e8f6b9fc96a9a874 (diff) | |
parent | f8ccbc01e43293d610973328dfcaf5f3753c9d92 (diff) | |
download | otp-4c7d0f1c937ec37fbdac47de4f71f92feb0128c7.tar.gz otp-4c7d0f1c937ec37fbdac47de4f71f92feb0128c7.tar.bz2 otp-4c7d0f1c937ec37fbdac47de4f71f92feb0128c7.zip |
Merge pull request #1650 from jabarszcz/doc_digraph_error
digraph: Document a bad_edge error
-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 |