Changeset 810:e9fbc747ca47 in lemon-0.x
- Timestamp:
- 09/06/04 19:12:00 (21 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1105
- Location:
- src
- Files:
-
- 2 added
- 1 deleted
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
src/hugo/Makefile.am
r795 r810 12 12 graph_wrapper.h \ 13 13 invalid.h \ 14 kruskal.h \ 14 15 list_graph.h \ 15 16 map_defines.h \ -
src/hugo/unionfind.h
r774 r810 33 33 * For more features see the \ref UnionFindEnum class. 34 34 * 35 * It is primarily used in Kruskal algorithm for finding minimal 36 * cost spanning tree in a graph. 37 * \sa kruskal() 38 * 35 39 * \pre The elements are automatically added only if the map 36 40 * given to the constructor was filled with -1's. Otherwise you 37 41 * need to add all the elements by the \ref insert() method. 42 * \bug It is not clear what the constructor parameter is used for. 38 43 */ 39 44 -
src/test/Makefile.am
r800 r810 3 3 noinst_HEADERS = test_tools.h graph_test.h 4 4 5 check_PROGRAMS = test_tools_pass test_tools_fail \ 5 check_PROGRAMS = \ 6 bfs_test \ 7 dfs_test \ 8 dijkstra_test \ 9 error_test \ 6 10 graph_test \ 7 dijkstra_test bfs_test dfs_test \ 8 minlengthpaths_test mincostflows_test \ 9 unionfind_test xy_test \ 11 kruskal_test \ 12 mincostflows_test \ 13 minlengthpaths_test \ 14 test_tools_fail \ 15 test_tools_pass \ 10 16 time_measure_test \ 11 error_test 17 unionfind_test \ 18 xy_test 12 19 13 20 … … 20 27 error_test_SOURCES = error_test.cc 21 28 graph_test_SOURCES = graph_test.cc 29 kruskal_test_SOURCES = kruskal_test.cc 22 30 mincostflows_test_SOURCES = mincostflows_test.cc 23 31 minlengthpaths_test_SOURCES = minlengthpaths_test.cc
Note: See TracChangeset
for help on using the changeset viewer.