Planar Graph Vizualization Algorithms

Teorija grafova bitno je područje u matematici za prikaz podataka i odnosa između objekata. Planarni grafovi važna su vrsta grafova i postoje mnogi programi pomoću kojih je moguće prikazati takve grafove na dvodimenzionalnoj površini ekrana. U ovom radu su detaljnije opisana tri programa otvorenog koda: NetworkX, Boost Graph Library i JGraph, opisani su algoritmi koje oni koriste, i njihova međusobna usporedba. Testiran je njihov rad na primjerima grafova i prikazano je kakve rezultate daju.Graph theory is an important area in mathematics for presenting data and relationship between objects. Planar graphs are an important type of graphs and there are many programs that can be used to display such graphs on a two-dimensional screen surface. This paper describes in more detail three open source programs: NetworkX, Boost Graph Library and JGraph, describes the algorithms they use, and their comparison with each other. Their work was tested on examples of graphs and it is shown what results they give