Changes in / [404:59d3aa4f921f:403:940587667b47] in lemon-main
- Files:
-
- 5 deleted
- 8 edited
Legend:
- Unmodified
- Added
- Removed
-
.hgignore
r385 r298 37 37 ^objs.*/.* 38 38 ^test/[a-z_]*$ 39 ^tools/[a-z-_]*$40 39 ^demo/.*_demo$ 41 40 ^build/.* -
doc/groups.dox
r388 r351 483 483 484 484 /** 485 @defgroup dimacs_group DIMACS format486 @ingroup io_group487 \brief Read and write files in DIMACS format488 489 Tools to read a digraph from or write it to a file in DIMACS format data.490 */491 492 /**493 485 @defgroup nauty_group NAUTY Format 494 486 @ingroup io_group 495 487 \brief Read \e Nauty format 496 497 488 Tool to read graphs from \e Nauty format data. 498 489 */ -
lemon/Makefile.am
r404 r399 29 29 lemon/dijkstra.h \ 30 30 lemon/dim2.h \ 31 lemon/dimacs.h \32 31 lemon/elevator.h \ 33 32 lemon/error.h \ … … 45 44 lemon/nauty_reader.h \ 46 45 lemon/path.h \ 47 lemon/preflow.h \48 46 lemon/random.h \ 49 47 lemon/smart_graph.h \ -
lemon/dijkstra.h
r397 r313 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 and 60 /// constants which are used in the Dijkstra algorithm for widest path 61 /// computation. 62 /// 63 /// \see DijkstraDefaultOperationTraits 64 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); 50 73 } 51 74 /// \brief Gives back true only if the first value is less than the second. -
scripts/unify-sources.sh
r396 r341 131 131 echo $WARNED_FILES out of $TOTAL_FILES files triggered warnings. 132 132 133 if [ $WARNED_FILES -gt 0 -o $FAILED_FILES -gt 0 ] 133 if [ $FAILED_FILES -gt 0 ] 134 then 135 return 1 136 elif [ $WARNED_FILES -gt 0 ] 134 137 then 135 138 if [ "$WARNING" == 'INTERACTIVE' ] 136 139 then 137 echo -n "Are the files with errors/warnings acceptable? (yes/no) "140 echo -n "Are the files with warnings acceptable? (yes/no) " 138 141 while read answer 139 142 do … … 145 148 return 1 146 149 fi 147 echo -n "Are the files with errors/warnings acceptable? (yes/no) "150 echo -n "Are the files with warnings acceptable? (yes/no) " 148 151 done 149 152 elif [ "$WARNING" == 'WERROR' ] -
test/Makefile.am
r404 r400 1 1 EXTRA_DIST += \ 2 2 test/CMakeLists.txt \ 3 test/min_cost_flow_test.lgf \ 4 test/preflow_graph.lgf 3 test/min_cost_flow_test.lgf 5 4 6 5 noinst_HEADERS += \ … … 26 25 test/random_test \ 27 26 test/path_test \ 28 test/preflow_test \29 27 test/suurballe_test \ 30 28 test/test_tools_fail \ … … 52 50 test_max_matching_test_SOURCES = test/max_matching_test.cc 53 51 test_path_test_SOURCES = test/path_test.cc 54 test_preflow_test_SOURCES = test/preflow_test.cc55 52 test_suurballe_test_SOURCES = test/suurballe_test.cc 56 53 test_random_test_SOURCES = test/random_test.cc -
test/dijkstra_test.cc
r397 r293 90 90 ::SetProcessedMap<concepts::WriteMap<Node,bool> > 91 91 ::SetStandardProcessedMap 92 ::SetOperationTraits<Dijkstra DefaultOperationTraits<VType> >92 ::SetOperationTraits<DijkstraWidestPathOperationTraits<VType> > 93 93 ::SetHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> > > 94 94 ::SetStandardHeap<BinHeap<VType, concepts::ReadWriteMap<Node,int> > > -
tools/Makefile.am
r385 r310 1 1 if WANT_TOOLS 2 2 3 bin_PROGRAMS += \ 4 tools/dimacs-to-lgf 5 3 bin_PROGRAMS += 6 4 dist_bin_SCRIPTS += tools/lemon-0.x-to-1.x.sh 7 5 8 6 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.