diff options
| author | Hans Bolinder <[email protected]> | 2012-03-01 11:48:20 +0100 |
|---|---|---|
| committer | Hans Bolinder <[email protected]> | 2012-03-01 11:48:20 +0100 |
| commit | fbdf7929b87f3e41b0ff573b8eaae44cdfae16d9 (patch) | |
| tree | 57c75cd725c132672c0b74d52176e1e82f1fd896 /lib/stdlib/doc/src/digraph_utils.xml | |
| parent | 3750ac230e0af600417fff900b3d5ef242fb18c7 (diff) | |
| download | otp-fbdf7929b87f3e41b0ff573b8eaae44cdfae16d9.tar.gz otp-fbdf7929b87f3e41b0ff573b8eaae44cdfae16d9.tar.bz2 otp-fbdf7929b87f3e41b0ff573b8eaae44cdfae16d9.zip | |
Remove loops from the graph created by digraph_utils:condensation/1
The function digraph_utils:condensation/1 used to create a digraph
containing loops contradicting the documentation which states that the
created digraph is free of cycles.
Thanks to Kostis Sagonas for finding the bug.
Diffstat (limited to 'lib/stdlib/doc/src/digraph_utils.xml')
| -rw-r--r-- | lib/stdlib/doc/src/digraph_utils.xml | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/stdlib/doc/src/digraph_utils.xml b/lib/stdlib/doc/src/digraph_utils.xml index e44632bfd2..ef6e1cb46f 100644 --- a/lib/stdlib/doc/src/digraph_utils.xml +++ b/lib/stdlib/doc/src/digraph_utils.xml @@ -4,7 +4,7 @@ <erlref> <header> <copyright> - <year>2000</year><year>2011</year> + <year>2000</year><year>2012</year> <holder>Ericsson AB. All Rights Reserved.</holder> </copyright> <legalnotice> @@ -156,7 +156,7 @@ <p>Creates a digraph where the vertices are the <seealso marker="#strong_components">strongly connected components</seealso> of <c><anno>Digraph</anno></c> as returned by - <c>strong_components/1</c>. If X and Y are strongly + <c>strong_components/1</c>. If X and Y are two different strongly connected components, and there exist vertices x and y in X and Y respectively such that there is an edge <seealso marker="#emanate">emanating</seealso> from x |