prikaz prve stranice dokumenta Izrada C# aplikacije za pretraživanje grafova
  Download
PDF 1.41 MB
undergraduate thesis
Izrada C# aplikacije za pretraživanje grafova
2016. urn:nbn:hr:200:447130
Doko, Petar
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Computer Engineering and Automation
Chair of Computer Engineering

Cite this document

Doko, P. (2016). Izrada C# aplikacije za pretraživanje grafova (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:447130

Doko, Petar. "Izrada C# aplikacije za pretraživanje grafova." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2016. https://urn.nsk.hr/urn:nbn:hr:200:447130

Doko, Petar. "Izrada C# aplikacije za pretraživanje grafova." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2016. https://urn.nsk.hr/urn:nbn:hr:200:447130

Doko, P. (2016). 'Izrada C# aplikacije za pretraživanje grafova', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 21 April 2024, https://urn.nsk.hr/urn:nbn:hr:200:447130

Doko P. Izrada C# aplikacije za pretraživanje grafova [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2016 [cited 2024 April 21] Available at: https://urn.nsk.hr/urn:nbn:hr:200:447130

P. Doko, "Izrada C# aplikacije za pretraživanje grafova", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:200:447130

Please login to the repository to save this object to your list.
Metadata
TitleIzrada C# aplikacije za pretraživanje grafova
Title (english)C# application for graph search
AuthorPetar Doko
MentorIvan Aleksi (mentor)
Committee memberIvan Aleksi (predsjednik povjerenstva)
Committee memberHrvoje Glavaš (član povjerenstva)
Committee memberKrešimir Nenadić (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Computer Engineering and Automation)
(Chair of Computer Engineering)
Osijek
Defense date and country2016-09-28, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Process Computing
Abstract
U aplikaciji omogućeno je dodavanje čvorova na koje se mogu primijeniti metode pretraživanja. Čvorovi se mogu dodavati lijevim, a brisati desnim klikom. Prilikom dodavanja ili klikom na već postojeći čvor otvara se skočni(pop-up) prozor u kojemu se mogu urediti koordinate x,y i težina čvora. Početni čvor prikazan je zelenom bojom, krajnji čvor plavom, a svi čvorovi između su crvene boje. Pritiskom na gumb sa crvenim X znakom brišu se svi čvorovi, a sa gumbom kose crvene linije mogu se povezivati čvorovi međusobno. Nakon dodavanja čvorova bez težina mogu se primijeniti nearest neighbour i random metoda pretraživanja. Nakon odabira jedne od te dvije metode, prikazuje se ispis vremena pretraživanja, udaljenost od početnog do krajnjeg čvora i broj posjećenih čvorova. Za primjenu Dijkstrin algoritma potrebno je prvo čvorovima dodijeliti težine(težinske vrijednosti) i nakon toga povezati ih međusobno. Kada se primijeni Dijkstrin algoritam ispisuje se najkraća udaljenost od početnog do krajnjeg čvora preko povezanih čvorova. Kada je korisnik gotov sa radom i želi spremiti podatke, pritiskom na gumb Save u direktoriju gdje je spremljena aplikacija spremaju se dva .txt dokumenta od kojih prvi sadrži čvorove sa njihovim koordinatama i težinama(dokument nodes), a drugi način na koji su povezani ti čvorovi(dokument connectedNodes).
Abstract (english)
C# application was made using Microsoft Visual Studio 2015. In the application users can add nodes on which methods for searching can be applied. Nodes can be added with left mouse click, and they can be removed by right mouse click. When a node is added or an existing node is clicked, a pop-up window appears in which x and y coordinates and the weight of the node can be edited. The beginning node is coloured green, the end node blue, and every node inbetween is coloured red. By clicking on the button with the red X, all nodes are deleted, and by clicking on the button with a red askew line, all nodes can be connected. After adding weight-less nodes, nearest neighbour and random search methods can be applied. After choosing one of those two methods, time of the search, distance from the beginning and end node and the number of visited nodes is shown. To apply Dijkstra's algorithm, nodes first need to be assigned weight and after that, the nodes need to be connected. When Dijkstra's algorithm is applied, shortest distance from the beginning to the end node is shown. When the user is done working and wants to save the data, clicking on the button Save, two .txt files are saved. The first contains nodes with their coordinates and weights and the other one contains the way those nodes are connected.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:447130
Study programmeTitle: Undergraduate University Study Programme in Computer Engineering
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2016-11-02 12:21:36