-
```
ok this is the thread. if you're not up to date, take a glance at
http://en.wikipedia.org/wiki/Kruskal's_algorithm
```
Original issue reported on code.google.com by `drdaniel...@gmail.com` on 10…
-
```
It's a useful data structure that is not so easy to implement by itself, and
that is very useful in algorithmics, such as in the graph theory, for instance.
```
Original issue reported on code.g…
-
```
It's a useful data structure that is not so easy to implement by itself, and
that is very useful in algorithmics, such as in the graph theory, for instance.
```
Original issue reported on code.g…
-
```
It's a useful data structure that is not so easy to implement by itself, and
that is very useful in algorithmics, such as in the graph theory, for instance.
```
Original issue reported on code.g…
-
```
It's a useful data structure that is not so easy to implement by itself, and
that is very useful in algorithmics, such as in the graph theory, for instance.
```
Original issue reported on code.g…
-
```
It's a useful data structure that is not so easy to implement by itself, and
that is very useful in algorithmics, such as in the graph theory, for instance.
```
Original issue reported on code.g…
-
```
It's a useful data structure that is not so easy to implement by itself, and
that is very useful in algorithmics, such as in the graph theory, for instance.
```
Original issue reported on code.g…
-
-
```
It's a useful data structure that is not so easy to implement by itself, and
that is very useful in algorithmics, such as in the graph theory, for instance.
```
Original issue reported on code.g…
-
```
It's a useful data structure that is not so easy to implement by itself, and
that is very useful in algorithmics, such as in the graph theory, for instance.
```
Original issue reported on code.g…