Mercuriallemon-0.x / file revision
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
src/work/athos/kruskal_otletek
author alpar
Sun, 06 Feb 2005 14:44:41 +0000
changeset 1128 6a347310d4c2
permissions -rw-r--r--
Several important changes:
- Named parameters for setting ReachedMap
- run() is separated into initialization and processing phase
- It is possible to run Dijkstra from multiple sources
- It is possible to stop the execution when a destination is reached. 
     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
lemon-0.x