# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1223459763 -7200
# Node ID 445b86e6bb9fac1122cc0ab72a31edfcee453866
# Parent 907446600ca9618c543cd9ba27d594bf79fe2dba
Use 0 instead of NULL
diff --git a/lemon/bfs.h b/lemon/bfs.h
|
a
|
b
|
|
| 322 | 322 | ///\param g The digraph the algorithm runs on. |
| 323 | 323 | Bfs(const Digraph &g) : |
| 324 | 324 | G(&g), |
| 325 | | _pred(NULL), local_pred(false), |
| 326 | | _dist(NULL), local_dist(false), |
| 327 | | _reached(NULL), local_reached(false), |
| 328 | | _processed(NULL), local_processed(false) |
| | 325 | _pred(0), local_pred(false), |
| | 326 | _dist(0), local_dist(false), |
| | 327 | _reached(0), local_reached(false), |
| | 328 | _processed(0), local_processed(false) |
| 329 | 329 | { } |
| 330 | 330 | |
| 331 | 331 | ///Destructor. |
diff --git a/lemon/dfs.h b/lemon/dfs.h
|
a
|
b
|
|
| 321 | 321 | ///\param g The digraph the algorithm runs on. |
| 322 | 322 | Dfs(const Digraph &g) : |
| 323 | 323 | G(&g), |
| 324 | | _pred(NULL), local_pred(false), |
| 325 | | _dist(NULL), local_dist(false), |
| 326 | | _reached(NULL), local_reached(false), |
| 327 | | _processed(NULL), local_processed(false) |
| | 324 | _pred(0), local_pred(false), |
| | 325 | _dist(0), local_dist(false), |
| | 326 | _reached(0), local_reached(false), |
| | 327 | _processed(0), local_processed(false) |
| 328 | 328 | { } |
| 329 | 329 | |
| 330 | 330 | ///Destructor. |
diff --git a/lemon/dijkstra.h b/lemon/dijkstra.h
|
a
|
b
|
|
| 479 | 479 | ///\param _length The length map used by the algorithm. |
| 480 | 480 | Dijkstra(const Digraph& _g, const LengthMap& _length) : |
| 481 | 481 | G(&_g), length(&_length), |
| 482 | | _pred(NULL), local_pred(false), |
| 483 | | _dist(NULL), local_dist(false), |
| 484 | | _processed(NULL), local_processed(false), |
| 485 | | _heap_cross_ref(NULL), local_heap_cross_ref(false), |
| 486 | | _heap(NULL), local_heap(false) |
| | 482 | _pred(0), local_pred(false), |
| | 483 | _dist(0), local_dist(false), |
| | 484 | _processed(0), local_processed(false), |
| | 485 | _heap_cross_ref(0), local_heap_cross_ref(false), |
| | 486 | _heap(0), local_heap(false) |
| 487 | 487 | { } |
| 488 | 488 | |
| 489 | 489 | ///Destructor. |
diff --git a/lemon/time_measure.h b/lemon/time_measure.h
|
a
|
b
|
|
| 187 | 187 | ///The time ellapsed since the last call of stamp() |
| 188 | 188 | TimeStamp ellapsed() const |
| 189 | 189 | { |
| 190 | | TimeStamp t(NULL); |
| | 190 | TimeStamp t(0); |
| 191 | 191 | return t-*this; |
| 192 | 192 | } |
| 193 | 193 | |
| … |
… |
|
| 544 | 544 | ///and <tt>2*min_time</tt>. |
| 545 | 545 | ///\param f the function object to be measured. |
| 546 | 546 | ///\param min_time the minimum total running time. |
| 547 | | ///\retval num if it is not \c NULL, then the actual |
| | 547 | ///\retval num if it is set, then the actual |
| 548 | 548 | /// number of execution of \c f will be written into <tt>*num</tt>. |
| 549 | | ///\retval full_time if it is not \c NULL, then the actual |
| | 549 | ///\retval full_time if it is set, then the actual |
| 550 | 550 | /// total running time will be written into <tt>*full_time</tt>. |
| 551 | 551 | ///\return The average running time of \c f. |
| 552 | 552 | |
| 553 | 553 | template<class F> |
| 554 | | TimeStamp runningTimeTest(F f,double min_time=10,unsigned int *num = NULL, |
| | 554 | TimeStamp runningTimeTest(F f,double min_time=10, unsigned int *num=0, |
| 555 | 555 | TimeStamp *full_time=NULL) |
| 556 | 556 | { |
| 557 | 557 | TimeStamp full; |