equal
deleted
inserted
replaced
41 /// The class implements the \e Union-Find data structure. |
41 /// The class implements the \e Union-Find data structure. |
42 /// The union operation uses rank heuristic, while |
42 /// The union operation uses rank heuristic, while |
43 /// the find operation uses path compression. |
43 /// the find operation uses path compression. |
44 /// This is a very simple but efficient implementation, providing |
44 /// This is a very simple but efficient implementation, providing |
45 /// only four methods: join (union), find, insert and size. |
45 /// only four methods: join (union), find, insert and size. |
46 /// For more features see the \ref UnionFindEnum class. |
46 /// For more features, see the \ref UnionFindEnum class. |
47 /// |
47 /// |
48 /// It is primarily used in Kruskal algorithm for finding minimal |
48 /// It is primarily used in Kruskal algorithm for finding minimal |
49 /// cost spanning tree in a graph. |
49 /// cost spanning tree in a graph. |
50 /// \sa kruskal() |
50 /// \sa kruskal() |
51 /// |
51 /// |