h44z/uibk_703602-Compiler-Construction
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add student example inputs

Browse Source
This commit is contained in:
Alex Hirsch
2019-03-18 13:50:36 +01:00
parent 480716b4a9
commit 14da3497ed
45 changed files with 1245 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

179
examples/dijkstra/dijkstra.mc Normal file
View File

@@ -0,0 +1,179 @@
void dijkstra(int[15] path_cost)
{
int[15] calc_cost;
int i;
int j;
i = 0;
while (i < 4)
{
j = 0;
while (j < 4)
{
if (path_cost[i * 4 + j] == 0)
calc_cost[i * 4 + j] = 9999;
else
calc_cost[i * 4 + j] = path_cost[i * 4 + j];
j = j + 1;
}
i = i + 1;
}
int[4] distance;
bool[4] visited;
int node_count;
int next_node;
node_count = 0;
while (node_count < 4)
{
distance[node_count] = calc_cost[node_count];
if (node_count == 0)
visited[node_count] = true;
else
visited[node_count] = false;
node_count = node_count + 1;
}
node_count = 1;
while (node_count < 4)
{
int min_distance;
int traversel_count;
min_distance = 9999;
traversel_count = 0;
while (traversel_count < 4)
{
if (!visited[traversel_count] &&
distance[traversel_count] < min_distance)
{
min_distance = distance[traversel_count];
next_node = traversel_count;
}
traversel_count = traversel_count + 1;
}
visited[next_node] = true;
traversel_count = 0;
while (traversel_count < 4)
{
if (!visited[traversel_count])
{
if (distance[traversel_count] >
calc_cost[next_node * 4 + traversel_count] + min_distance)
{
distance[traversel_count] =
calc_cost[next_node * 4 + traversel_count] + min_distance;
}
}
traversel_count = traversel_count + 1;
}
node_count = node_count + 1;
}
int print_counter;
print_counter = 1;
while (print_counter < 4)
{
print("Distance to node ");
print_int(print_counter);
print(" = ");
print_int(distance[print_counter]);
print_nl();
print_counter = print_counter + 1;
}
}
int main()
{
int[15] path_cost;
int input_counter;
int node_counter;
input_counter = 1;
node_counter = 1;
path_cost[0] = 0;
print("Enter the path costs ('0' = no path)");
print_nl();
while (input_counter < 15)
{
if (input_counter < 4)
{
print("Enter path cost from 0 -> ");
print_int(node_counter);
print(":");
print_nl();
path_cost[input_counter] = read_int();
}
if (input_counter >= 4 && input_counter < 8)
{
if (input_counter != 5)
{
print("Enter path cost from 1 -> ");
print_int(node_counter);
print(":");
print_nl();
path_cost[input_counter] = read_int();
}
else
{
path_cost[input_counter] = 0;
}
}
if (input_counter >= 8 && input_counter < 12)
{
if (input_counter != 10)
{
print("Enter path cost from 2 -> ");
print_int(node_counter);
print(":");
print_nl();
path_cost[input_counter] = read_int();
}
else
{
path_cost[input_counter] = 0;
}
}
if (input_counter >= 12)
{
if (input_counter != 15)
{
print("Enter path cost from 3 -> ");
print_int(node_counter);
print(":");
print_nl();
path_cost[input_counter] = read_int();
}
else
{
path_cost[input_counter] = 0;
}
}
if (node_counter >= 3)
node_counter = 0;
else
node_counter = node_counter + 1;
input_counter = input_counter + 1;
}
dijkstra(path_cost);
return 0;
}

12
examples/dijkstra/dijkstra.stdin.txt Normal file
View File

@@ -0,0 +1,12 @@
10
30
70
0
10
40
0
0
10
0
0
0

16
examples/dijkstra/dijkstra.stdout.txt Normal file
View File

@@ -0,0 +1,16 @@
Enter the path costs ('0' = no path)
Enter path cost from 0 -> 1:
Enter path cost from 0 -> 2:
Enter path cost from 0 -> 3:
Enter path cost from 1 -> 0:
Enter path cost from 1 -> 2:
Enter path cost from 1 -> 3:
Enter path cost from 2 -> 0:
Enter path cost from 2 -> 1:
Enter path cost from 2 -> 3:
Enter path cost from 3 -> 0:
Enter path cost from 3 -> 1:
Enter path cost from 3 -> 2:
Distance to node 1 = 10
Distance to node 2 = 20
Distance to node 3 = 30