The shortest path problem is a classic problem in mathematics and computer science with applications in Economics (sequential decision making, analysis of social networks, etc.). The presented work is an example of realizing and applying of Dijkstra's algorithm to find the shortest path between two vertices in a connected, undirected graph, which is often a solved problem at a time annual International Olympiad in Informatics. For this purpose, are used the technologies, .NET 4.0, Visual Studio 2010, and WPF for the graphical user interface. The implemented program allows drawing an undirected graph, visualizing the shortest path between two vertices and finding its value.
Shortest path, Dijkstra's algorithm, C#, WPF
Cite this paper
Radoslav Mavrevski, Metodi Traykov, Ivan Trenchev. (2020) Finding the Shortest Path in a Graph and Its Visualization using C# and WPF. International Journal of Computers, 5, 25-29
Copyright © 2020 Author(s) retain the copyright of this article.
This article is published under the terms of the Creative Commons Attribution License 4.0