source:
lemon-0.x/src/work/athos/kruskal_otletek
@
273:e9024dad7fc1
| Last change on this file since 273:e9024dad7fc1 was 251:f123e5116bc1, checked in by , 22 years ago | |
|---|---|
| File size: 356 bytes | |
| Rev | Line | |
|---|---|---|
| [251] | 1 | |
| 2 | UnionFind<graph_type, NodeIt> uf( G, G.NodeIt()); | |
| 3 | NodeUnionFind<graph_type> uf( G); | |
| 4 | ||
| 5 | Kell e: | |
| 6 | find visszaadja a nagyfonokot, altalaban kell e a belso tarolobol tudni visszafejteni az ott levo pontot. | |
| 7 | Kell e merge(int, int) | |
| 8 | esetleg merge(Nodeit fonoka, NodeIt fonokb) | |
| 9 | ||
| 10 | konstruálás map-bõl. | |
| 11 | find: visszaad egy egészet | |
| 12 | ||
| 13 | findAndMerge: visszaad egy boolt | |
| 14 |
Note: See TracBrowser
for help on using the repository browser.
