Průvodce: Bi-directional Dijkstra balanced by distance

[leo.git] / mk-all

diff --git a/mk-all b/mk-all
index 82cde3a3bf439ebf5c7908320bdf6aed565b900c..3c577204af6d34a5de55905b85bd4fd30e308870 100755 (executable)
--- a/mk-all
+++ b/mk-all
@@ -2,7 +2,7 @@
 set -e
 make
 for a in 0 1 ; do
-       for b in 0 1 ; do
+       for b in 0 1 2 ; do
                out="output"
                case $a in
                        0)      out="$out-dijk" ;;
@@ -12,6 +12,7 @@ for a in 0 1 ; do
                case $b in
                        0)      out="$out-unidir" ;;
                        1)      out="$out-bidir" ;;
+                       2)      out="$out-bidir2" ;;
                        *)      exit 1 ;;
                esac
                echo "### Running with astar=$a bidir=$b ($out) ###"