Changes in / [403:940587667b47:404:59d3aa4f921f] in lemon-main
- Files:
-
- 5 added
- 8 edited
Legend:
- Unmodified
- Added
- Removed
-
.hgignore
r298 r385 37 37 ^objs.*/.* 38 38 ^test/[a-z_]*$ 39 ^tools/[a-z-_]*$ 39 40 ^demo/.*_demo$ 40 41 ^build/.* -
doc/groups.dox
r351 r388 483 483 484 484 /** 485 @defgroup dimacs_group DIMACS format 486 @ingroup io_group 487 \brief Read and write files in DIMACS format 488 489 Tools to read a digraph from or write it to a file in DIMACS format data. 490 */ 491 492 /** 485 493 @defgroup nauty_group NAUTY Format 486 494 @ingroup io_group 487 495 \brief Read \e Nauty format 496 488 497 Tool to read graphs from \e Nauty format data. 489 498 */ -
lemon/Makefile.am
r399 r404 29 29 lemon/dijkstra.h \ 30 30 lemon/dim2.h \ 31 lemon/dimacs.h \ 31 32 lemon/elevator.h \ 32 33 lemon/error.h \ … … 44 45 lemon/nauty_reader.h \ 45 46 lemon/path.h \ 47 lemon/preflow.h \ 46 48 lemon/random.h \ 47 49 lemon/smart_graph.h \ -
lemon/dijkstra.h
r313 r397 48 48 static Value plus(const Value& left, const Value& right) { 49 49 return left + right; 50 }51 /// \brief Gives back true only if the first value is less than the second.52 static bool less(const Value& left, const Value& right) {53 return left < right;54 }55 };56 57 /// \brief Widest path operation traits for the Dijkstra algorithm class.58 ///59 /// This operation traits class defines all computational operations and60 /// constants which are used in the Dijkstra algorithm for widest path61 /// computation.62 ///63 /// \see DijkstraDefaultOperationTraits64 template <typename Value>65 struct DijkstraWidestPathOperationTraits {66 /// \brief Gives back the maximum value of the type.67 static Value zero() {68 return std::numeric_limits<Value>::max();69 }70 /// \brief Gives back the minimum of the given two elements.71 static Value plus(const Value& left, const Value& right) {72 return std::min(left, right);73 50 } 74 51 /// \brief Gives back true only if the first value is less than the second. -
scripts/unify-sources.sh
r341 r396 131 131 echo $WARNED_FILES out of $TOTAL_FILES files triggered warnings. 132 132 133 if [ $FAILED_FILES -gt 0 ] 134 then 135 return 1 136 elif [ $WARNED_FILES -gt 0 ] 133 if [ $WARNED_FILES -gt 0 -o $FAILED_FILES -gt 0 ] 137 134 then 138 135 if [ "$WARNING" == 'INTERACTIVE' ] 139 136 then 140 echo -n "Are the files with warnings acceptable? (yes/no) "137 echo -n "Are the files with errors/warnings acceptable? (yes/no) " 141 138 while read answer 142 139 do … … 148 145 return 1 149 146 fi 150 echo -n "Are the files with warnings acceptable? (yes/no) "147 echo -n "Are the files with errors/warnings acceptable? (yes/no) " 151 148 done 152 149 elif [ "$WARNING" == 'WERROR' ] -
test/Makefile.am
r400 r404 1 1 EXTRA_DIST += \ 2 2 test/CMakeLists.txt \ 3 test/min_cost_flow_test.lgf 3 test/min_cost_flow_test.lgf \ 4 test/preflow_graph.lgf 4 5 5 6 noinst_HEADERS += \ … … 25 26 test/random_test \ 26 27 test/path_test \ 28 test/preflow_test \ 27 29 test/suurballe_test \ 28 30 test/test_tools_fail \ … … 50 52 test_max_matching_test_SOURCES = test/max_matching_test.cc 51 53 test_path_test_SOURCES = test/path_test.cc 54 test_preflow_test_SOURCES = test/preflow_test.cc 52 55 test_suurballe_test_SOURCES = test/suurballe_test.cc 53 56 test_random_test_SOURCES = test/random_test.cc -
test/dijkstra_test.cc
r293 r397 90 90 ::SetProcessedMap<concepts::WriteMap<Node,bool> > 91 91 ::SetStandardProcessedMap 92 ::SetOperationTraits<Dijkstra WidestPathOperationTraits<VType> >92 ::SetOperationTraits<DijkstraDefaultOperationTraits<VType> > 93 93 ::SetHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> > > 94 94 ::SetStandardHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> > > -
tools/Makefile.am
r310 r385 1 1 if WANT_TOOLS 2 2 3 bin_PROGRAMS += 3 bin_PROGRAMS += \ 4 tools/dimacs-to-lgf 5 4 6 dist_bin_SCRIPTS += tools/lemon-0.x-to-1.x.sh 5 7 6 8 endif WANT_TOOLS 9 10 tools_dimacs_to_lgf_SOURCES = tools/dimacs-to-lgf.cc
Note: See TracChangeset
for help on using the changeset viewer.