/* Shortest Path Problem */

param N := 6;
param s := 1;
param t := 5;

param : E : w :=
1 1 1000000
1 2 1
1 3 5
1 4 1000000
1 5 1000000
1 6 1000000
2 1 1
2 2 1000000
2 3 2
2 4 2
2 5 1000000
2 6 1000000
3 1 5
3 2 4
3 3 1000000
3 4 1000000
3 5 2
3 6 1000000
4 1 1000000
4 2 1000000
4 3 3
4 4 1000000
4 5 1000000
4 6 3
5 1 1000000
5 2 1000000
5 3 1
5 4 1000000
5 5 1000000
5 6 4
6 1 1000000
6 2 1000000
6 3 1000000
6 4 1000000
6 5 1000000
6 6 1000000
;
end;