added exponential distrbution + tests
new shortest-path walker (still todo) modified dijkstra-path (new helper methods)
This commit is contained in:
@@ -159,9 +159,9 @@ private:
|
||||
next.distanceWalked_m += walked_m;
|
||||
++((T*)next.node)->cnt; // TODO: eval only
|
||||
|
||||
if (next.node->z_cm != cur.node->z_cm) {
|
||||
int i = 0;
|
||||
}
|
||||
// if (next.node->z_cm != cur.node->z_cm) {
|
||||
// int i = 0;
|
||||
// }
|
||||
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user