Back to search

Institutional Repository of Vilnius University

Optimalių maršrutų radimas ir pavaizdavimas taikant algoritmus grafuose /

Abstract

dc:description

The aim of this thesis is to create a tool representing data collected from OpenStreetMap Application Programming Interaface, as a graph structure and which would look like a map. Use graph algorithms on the created structure to find shortest path between two points on the created map. Project created using C# programming language and Microsot .NET framework. Graphic user interface was created using Windows Presentation Foundation framework. There is a possibility to find the shortest path using two graph algorithms, there is also a possibility to simulate traffic jam and find an alternate route between two poitns. In order to better understand how graphs are helping solving shortest path problems there is a quick introduction to graph theory in the beginning of the paper. Furthermore, project realization and funcionality as well as shortesth path algorithms used are analyzed.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Šukys, Vytaras,
Contributors dc:contributor
  • Meškauskas, Tadas

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Šukys, Vytaras,. Optimalių maršrutų radimas ir pavaizdavimas taikant algoritmus grafuose /. Institutional Repository of Vilnius University, 2017. https://repository.vu.lt/VU:ELABAETD23218041&prefLang=en_US