Algoritmi za risanje grafov na osnovi sil

magistrsko delo

Dragana Božović (Author), Andrej Taranenko (Mentor)

Abstract

Tema magistrskega dela je risanje grafov z algoritmi na osnovi sil. V delu predstavimo različne algoritme za risanje grafov na osnovi sil: Tuttovo baricentrično metodo, algoritem Kamada-Kawai, algoritem Fruchtermana in Reingolda, Eadesov algoritem in algoritme za velike grafe. Magistrsko delo je razdeljeno v tri dele. V prvem delu so navedeni osnovni pojmi in definicije. Drugi del se začne s kratkim zgodovinskim pregledom algoritmov za risanje grafov na osnovi sil. Nato so opisani glavni algoritmi in zapisane tudi njihove psevdokode. Zaključimo s kratkim opisom implementacije Tuttove baricentrične metode in algoritma Fruchtermana in Reingolda ter prikažemo rezultate oz. več primerov izrisa grafov s pomočjo teh dveh programov.

Keywords

algoritmi;algoritmi na osnovi sil;grafi;risanje grafov;magistrska dela;

Data

Language:	Slovenian
Year of publishing:	2015
Typology:	2.09 - Master's Thesis
Organization:	UM FNM - Faculty of Natural Sciences and Mathematics
Publisher:	[D. Božović]
UDC:	004.421.2:519.17(043.2)
COBISS:	21560072
Views:	4363
Downloads:	252
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Force-based graph drawing algorithms
Secondary abstract:	This thesis focuses on force-directed algorithms for graph drawing. In the work we present different force-directed drawing algorithms: the Tutte's barycentric method, the algorithm of Kamada and Kawai, the algorithm of Fruchterman and Reingold, the spring layout method of Eades and some algorithms for large graphs. This master thesis is divided into three parts. In the first part we describe basic concepts and definitions. The second part starts with a short historical overview of force-directed drawing algorithms. Following is a description of main algorithms where pseudocodes of these are also shown. We conclude the thesis with a brief description of how we implemented the Tutte's barycentric method and Fruchterman-Reingold algorithm and show the results, i.e. several different layouts of graphs obtained with them.
Secondary keywords:	algorithms;force-directed algorithms;graphs;graphs drawing;master theses;
URN:	URN:SI:UM:
Type (COBISS):	Master's thesis/paper
Thesis comment:	Univ. v Mariboru, Fak. za naravoslovje in matematiko, Oddelek za matematiko in računalništvo
Pages:	IX, 32 f.
ID:	8776804