{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:23218041"},"canonical_url":"https://search.ndltd.org/etd/vilnius/oai:vu.lt:elaba:23218041","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"Optimalių maršrutų radimas ir pavaizdavimas taikant algoritmus grafuose /","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Šukys, Vytaras,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Meškauskas, Tadas"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-11-19T09:43:33Z","subjects":[],"languages":["lit"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD23218041&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://repository.vu.lt/VU:ELABAETD23218041&prefLang=en_US","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":"open","embargo_until":null,"access_note":null},"source_record":{"url":"https://epublications.vu.lt/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Avu.lt%3Aelaba%3A23218041","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Meškauskas, Tadas"]},{"key":"dc:creator","label":"Author","values":["Šukys, Vytaras,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:23218041/23218041.pdf"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/bachelorThesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["lit"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.vu.lt/VU:ELABAETD23218041&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Optimalių maršrutų radimas ir pavaizdavimas taikant algoritmus grafuose /","Solving optimal routing problem by algorithms in graphs and visualizing results."]}]}],"canonical_facts":{"dc:contributor":["Meškauskas, Tadas"],"dc:creator":["Šukys, Vytaras,"],"dc:date":["2017"],"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."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD23218041&prefLang=en_US"],"dc:language":["lit"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:23218041/23218041.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:title":["Optimalių maršrutų radimas ir pavaizdavimas taikant algoritmus grafuose /","Solving optimal routing problem by algorithms in graphs and visualizing results."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-11-19T09:43:33Z"}