Thesis Details
Automatické umísťování uzlů v acyklickém orientovaném grafu do GUI
The goal of this work is to create an application for automatic node placement of acyclic oriented graphs. The work is mainly focusing on advanced possibilities of graph layout, for example selection of location of selected nodes, division of a graph into sub-graphs or support of polygonal nodes.
The solution describes chosen algorithms, which are being used in the resulting application. Specifically, Fruchterman-Reingold force oriented algorithm, algorithm Kamada-Kawai and an algorithm based on Meyer's self-organizing graphs.
Graph, graph algorithms, layouting algorithms, acyclic graphs, oriented graphs, node placement, graph layout, Fruchterman-Reingold, Kamada-Kawai, ISOM, self-organizing graphs, force directed algorithms, time complexity, planar graph
Burgetová Ivana, Ing., Ph.D. (DIFS FIT BUT), člen
Grézl František, Ing., Ph.D. (DCGM FIT BUT), člen
Smrčka Aleš, Ing., Ph.D. (DITS FIT BUT), člen
Vašíček Zdeněk, doc. Ing., Ph.D. (DCSY FIT BUT), člen
@bachelorsthesis{FITBT22373, author = "Jan Juda", type = "Bachelor's thesis", title = "Automatick\'{e} um\'{i}s\v{t}ov\'{a}n\'{i} uzl\r{u} v acyklick\'{e}m orientovan\'{e}m grafu do GUI", school = "Brno University of Technology, Faculty of Information Technology", year = 2020, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/22373/" }