Platform level design for Network on Chips

S, Kendaganna Swamy; N, Anil; Jatti, Anand; Batra, Uma

doi:10.1109/iadcc.2015.7154676

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Very often a wealth different informatics Olympiads are held national, regional or international levels, in which are decided problems that requiring programming knowledge and various algorithm techniques. The creating high quality problem solution can be a difficult and time-consuming process [19][20][21][22][23][24][25]. In this paper we explored known technique for find the shortest path, with the help of the powerful programming language C# and modern technologies such as WPF, which can be used to find new ideas for problems and refine these ideas into problems suitable for the International Olympiad in Informatics (IOI) annually organized.…”

Section: Resultsmentioning

confidence: 99%

Finding the shortest path in a graph and its visualization using C# and WPF

Mavrevski¹,

Traykov²,

Trenchev³

2020

IJECE

View full text Add to dashboard Cite

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. This software is a valuable tool for the study of Dijkstra's algorithm and is a great pedagogic instrument. All figures of path visualization included in this paper are actual screenshots of our visualization program.

show abstract