Peder, AhtiTiganik, Sander2017-04-262017-04-262015http://hdl.handle.net/10062/56093Töös vaadeldakse tasandiliste graafide kujutamisega seonduvaid probleeme. Uuritakse, kuidas tuvastada mõnede graafitüüpide tasandilisust. Eraldi vaadeldakse kaksiksidusaid graafe. Selle graafide klassi jaoks on teada head lahendialgoritmid. Antud töös vaadeldakse J. Hopcrofti ja R. Tarjani loodud radade lisamise meetodit. Seda kasutades lahendatakse probleem, kuidas praktiliselt luua mittetasandilise graafi võimalikult tasandilisele lähedane kujutis. Töö tulemuseks on rakendusprogramm, mis võimaldab leida sellist graafi kujutist PDF-vormingus. Sealjuures saab programmi kasutaja interaktiivselt tulemust parandada.The goal of this thesis is to look at the problems connected with the visualization of planar graphs, more precisely, how to determine the planarity of certain kinds of graphs. Bi-connected graphs are viewed separately. There are many well known solving algorithms for this graph class. This thesis concentrates on the path addition method created by J. Hopcroft and R. Tarjan. The algorithm is used to solve the problem of how to create the best possible planar projection of a non-planar graph. As a result of this thesis a program was created, which lets you find such a projection in PDF-format. Also the user can interactively improve the outcome.estThesis