Layered Graph Drawing Algorithm
Jump to navigation
Jump to search
A Layered Graph Drawing Algorithm is a Graph Drawing that ...
- See: Heuristic, Graph Drawing, Vertex (Graph Theory), Directed Graph, Prentice Hall, Lecture Notes in Computer Science, Kozo Sugiyama, IEEE Systems, Man & Cybernetics Society, Upward Planar Drawing, NP-Hard.
References
2018
- (Wikipedia, 2018) ⇒ https://en.wikipedia.org/wiki/Layered_graph_drawing Retrieved:2018-5-15.
- Layered graph drawing or hierarchical graph drawing is a type of graph drawing in which the vertices of a directed graph are drawn in horizontal rows or layers with the edges generally directed downwards. It is also known as Sugiyama-style graph drawing after Kozo Sugiyama, who first developed this drawing style.
The ideal form for a layered drawing would be an upward planar drawing, in which all edges are oriented in a consistent direction and no pairs of edges cross. However, graphs often contain cycles, minimizing the number of inconsistently-oriented edges is NP-hard, and minimizing the number of crossings is also NP-hard, so layered graph drawing systems typically apply a sequence of heuristics that reduce these types of flaws in the drawing without guaranteeing to find a drawing with the minimum number of flaws.
- Layered graph drawing or hierarchical graph drawing is a type of graph drawing in which the vertices of a directed graph are drawn in horizontal rows or layers with the edges generally directed downwards. It is also known as Sugiyama-style graph drawing after Kozo Sugiyama, who first developed this drawing style.