Generating Inputs for Graph Algorithms

Name
Uku Hannes Arismaa
Abstract
The purpose of the Bachelor’s thesis is to create a program to aid in the teaching of the course „Algorithms and data structures“. The program generates inputs for graph algorithms so that multiple inputs could be generated such that they pose a similar challenge to the student who is tasked with demonstrating the work of the algorithm with the given input. Using this program the professors can quickly generate inputs for the students. The program has methods for generating inputs for the Kahn algorithm, the Dijkstra algorithm, the Bellmann-Ford algorithm and the Floyd-Warshall algorithm. This program is one step of many on the path of imporving the learning process of graph algorithms for students.
Graduation Thesis language
Estonian
Graduation Thesis type
Bachelor - Computer Science
Supervisor(s)
Ahti Põder
Defence year
2022
 
PDF Extras