prikaz prve stranice dokumenta ALGORITMI ZA BOJENJE GRAFOVA
  Download
PDF 1000.16 KB
undergraduate thesis
ALGORITMI ZA BOJENJE GRAFOVA
Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. urn:nbn:hr:200:997271
Gojić, Andreja
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Software Engineering
Chair of Visual Computing

Institutional repository: Faculty of Electrical Engineering, Computer Science and Information Technology Osijek

Cite this document

Gojić, A. (2021). ALGORITMI ZA BOJENJE 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:997271

Gojić, Andreja. "ALGORITMI ZA BOJENJE GRAFOVA." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:997271

Gojić, Andreja. "ALGORITMI ZA BOJENJE GRAFOVA." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:997271

Gojić, A. (2021). 'ALGORITMI ZA BOJENJE GRAFOVA', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 18 February 2025, https://urn.nsk.hr/urn:nbn:hr:200:997271

Gojić A. ALGORITMI ZA BOJENJE GRAFOVA [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2021 [cited 2025 February 18] Available at: https://urn.nsk.hr/urn:nbn:hr:200:997271

A. Gojić, "ALGORITMI ZA BOJENJE GRAFOVA", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2021. Available at: https://urn.nsk.hr/urn:nbn:hr:200:997271

Metadata
TitleALGORITMI ZA BOJENJE GRAFOVA
Title (english)Graph coloring algorithms
AuthorAndreja Gojić
MentorAlfonzo Baumgartner (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Software Engineering)
(Chair of Visual Computing)
Osijek
Defense date and country2021-09-27, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Program Engineering
Abstract
Zadatak ovog završnog rada bio je istražiti postojeće algoritme za bojenje grafova te odabrati jedan i implementirati ga u proizvoljnom programskom jeziku. Prvo su opisani teorijski pojmovi vezani uz teoriju grafu kako bi se lakše razumio sam rad, zatim je objašnjeno bojenje grafova te njegova važnost u primjeni na stvarnim problemima. Nakon toga su navedeni postojeći algoritmi za bojenje grafova kao i način njihova rada te vremenska složenost, nadalje su opisane korištene tehnologije te razvojno kruženje u kojem je implementiran odabrani algoritam. Na samome kraju je odabran algoritam pohlepnog bojenja te je u programskom jeziku C# stvorena Windows Forms aplikacija. Windows Forms aplikacija radi na način da se unese matrica susjedstva željenog grafa, a ona će koristeći algoritam pohlepnog bojenja obojiti zadani graf te rješenje prikazati u grafičkom obliku.
Abstract (english)
The aim of this final paper was to investigate the existing algorithms for coloring graphs, select one and implement it in an arbitrary programming language. Firstly, theoretical concepts related to graph theory are described in order to better understand the reseach paper itself, then the coloring of graphs and their importance in dealing to real problems are explained. After that, the existing algorithms for coloring graphs are listed, as well as the way they work and the run time, then are described the used technologies and the development environment in which the selected algorithm is implemented. At the very end, the greedy coloring algorithm was selected and the Windows Forms application was created in the C# programming language. The Windows Forms application works by entering the adjacency matrix of the desired graph, and it will use a greedy coloring algorithm to color the default graph and display the solution in graphical form.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:997271
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 on2021-11-05 14:47:37