equal
deleted
inserted
replaced
33 ///Class for handling "labels" in push-relabel type algorithms. |
33 ///Class for handling "labels" in push-relabel type algorithms. |
34 |
34 |
35 ///A class for handling "labels" in push-relabel type algorithms. |
35 ///A class for handling "labels" in push-relabel type algorithms. |
36 /// |
36 /// |
37 ///\ingroup auxdat |
37 ///\ingroup auxdat |
38 ///Using this class you can assign "labels" (nonnegativ integer numbers) |
38 ///Using this class you can assign "labels" (nonnegative integer numbers) |
39 ///to the edges or nodes of a graph, manipulate and query them through |
39 ///to the edges or nodes of a graph, manipulate and query them through |
40 ///operations typically arising in "push-relabel" type algorithms. |
40 ///operations typically arising in "push-relabel" type algorithms. |
41 /// |
41 /// |
42 ///Each item is either \em active or not, and you can also choose a |
42 ///Each item is either \em active or not, and you can also choose a |
43 ///highest level active item. |
43 ///highest level active item. |