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/test/digraph_utils_SUITE.erl | |
| 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/test/digraph_utils_SUITE.erl')
| -rw-r--r-- | lib/stdlib/test/digraph_utils_SUITE.erl | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/lib/stdlib/test/digraph_utils_SUITE.erl b/lib/stdlib/test/digraph_utils_SUITE.erl index 12c486c25f..6b554c2fb7 100644 --- a/lib/stdlib/test/digraph_utils_SUITE.erl +++ b/lib/stdlib/test/digraph_utils_SUITE.erl @@ -1,7 +1,7 @@ %% %% %CopyrightBegin% %% -%% Copyright Ericsson AB 2000-2011. All Rights Reserved. +%% Copyright Ericsson AB 2000-2012. All Rights Reserved. %% %% The contents of this file are subject to the Erlang Public License, %% Version 1.1, (the "License"); you may not use this file except in @@ -211,8 +211,7 @@ condensation(Config) when is_list(Config) -> {lists:sort(V1), lists:sort(V2)} end, ?line Es = lists:map(Fun, digraph:edges(CG)), - ?line [{[b],[c]},{[b],[d]},{[e,f,g],[e,f,g]},{[h],[h]},{[i,j],[i,j]}] = - lists:sort(Es), + ?line [{[b],[c]},{[b],[d]}] = lists:sort(Es), ?line true = digraph:delete(CG), ?line true = digraph:delete(G), ok. |