[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-648278-en":3,"doc-seo-648278-105":31,"detail-sidebar-cat-0-en-105":98},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":21,"is_downloadable":21,"audit_status":21,"page_count":22,"language":23,"language_code":24,"site_id":25,"html_lang":24,"table_of_contents":26,"faqs":27,"seo_title":28,"seo_description":14,"update_tm":29,"read_time":30},648278,2336475104736,"วิน","https://ap-avatar.wpscdn.com/avatar/22000c4c5e0e5b17e70?x-image-process=image/resize,m_fixed,w_180,h_180&k=1786591360781797222",6,"Technology","Visualization of Graphs - Lecture 8 - Hierarchical Layouts: Sugiyama Framework - Hierarchical Drawing - Motivation","Lecture 8 explains hierarchical graph drawing with the Sugiyama framework. It defines the problem as producing a drawing of a directed graph that closely reproduces hierarchical properties while meeting desirable constraints such as upward-directed edges, placement of vertices on few horizontal layers, limited edge crossings, short edges, and even spacing—noting that criteria can be contradictory. The lecture then introduces step 1, cycle breaking, formulated as a minimum feedback arc set (NP-hard) and a greedy heuristic for constructing an acyclic digraph, followed by the intuition behind assigning vertex y-coordinates and orienting edges upward.","Visualization of Graphs  \nLecture 8:  \nHierarchical Layouts: Sugiyama Framework  \n\n| |  |  |\n| --- | --- | --- |\n| \u003Cbr>\u003Cbr>\u003Cbr>7 |  |  |\n| \u003Cbr>6\u003Cbr>\u003Cbr>\u003Cbr>\u003Cbr>|  |  |\n| \u003Cbr>| \u003Cbr>3   2  1\u003Cbr>|  |\n| |  |  |\n\n4  \nAlexander Wolff  \nSummer term 2025  \n2-2  \nHierarchical Drawings – Motivation  \n3-8  \nHierarchical Drawing  \nProblem Statement:  \n■ Input: digraph G  \n■ Output: drawing of G that “closely”reproduces the hierarchical properties of G  \nDesirable Properties:  \n■ edges are directed upwards,  \n■ vertices lie on (few) horizontal lines,■ few pairs of edges cross,  \n■ edges are short,  \n■ vertices are evenly spaced.  \nCriteria can be contradictory!  \n4-1 Hierarchical Drawing – Applications yEd Gallery: Java profiler JProfiler using yFiles  \n4-3  \nHierarchical Drawing – Applications  \nSource: Randall Munroe, [https://xkcd.com/657](https://xkcd.com/657)  \nSource: Tanahashi & Ma,”Design Considerations for Optimizing Storyline Visualizations”, TVCG 2012  \nHierarchical Drawing – Applications  \nSource: Visualization that won the Graph Drawing Contest, Creative Track, 2016 . Klawitter & Mchedlidze  \n5-7 Classical Approach: Sugiyama Framework [Sugiyama, Tagawa, Toda ’81]  \n6-1  \nStep 1: Cycle Breaking  \n6-10  \nStep 1: Cycle Breaking  \nApproach.  \n■ Find minimum-size set E ⋆ of edges that are not upward.  \n■ Remove E ⋆ and insert reversed edges.  \nProblem Minimum Feedback Arc Set (FAS) .  \n■ Input: directed graph G  \n■ Output: minimum-size set E ⋆ ⊆ E (G) such that. . . NP-hard   \nedges in E ⋆ but reversed  \nG⋆ = (V(G), E (G) \\ E⋆ ) acyclic  \n(E(G) \\ E⋆ ) ∪ E ⋆rev  \n7-21  \nHeuristic 1  \nGreedyMakeAcyclic(Digraph G): E′ ← ∅  \nforeach v ∈ V (G) do  \nif |E→ (v)| ≥ |E← (v)| then   E′ ← E′ ∪ E→ (v) else  \n E′ ← E′ ∪ E← (v) remove v and E (v) from G.  \nreturn G′ = (V(G), E′)  \n■ G′ is a DAG.  \n[Berger, Shor ’90]  \nv   \nE → (v) := { (v, u): (v, u) ∈ E (G)} E ← (v) := { (u, v): (u, v) ∈ E (G)} E (v) := E → (v) ∪ E← (v)  \nProof Idea.  \nPlace the vertices on distinct y-coordinates.  \ny-coordinates increase/decrease towards the middle. All edges point upwards.","cbCaimxCVFsVZwRD","https://ap.wps.com/l/cbCaimxCVFsVZwRD","pdf",3621481,4,1,49,"English","en",105,"# Lecture 8: Hierarchical Layouts: Sugiyama Framework\n## Hierarchical Drawings – Motivation\n## Hierarchical Drawing: Problem Statement and Desirable Properties\n## Hierarchical Drawing – Applications\n## Classical Approach: Sugiyama Framework\n## Step 1: Cycle Breaking\n## Heuristic GreedyMakeAcyclic\n## Vertex Placement and Upward Edge Orientation","[{\"question\":\"What is the hierarchical drawing problem in this lecture?\",\"answer\":\"Given a directed graph G, the goal is to output a drawing that closely reproduces the hierarchical properties of G. The drawing emphasizes upward edges, layered vertex placement, few crossings, short edges, and even vertex spacing.\"},{\"question\":\"Which desirable properties does the lecture list for hierarchical drawings?\",\"answer\":\"Edges should be directed upwards; vertices should lie on few horizontal lines; few edge pairs should cross; edges should be short; and vertices should be evenly spaced.\"},{\"question\":\"Why is cycle breaking step 1 important, and how is it handled?\",\"answer\":\"Cycle breaking ensures the graph becomes acyclic by reversing a chosen set of edges. The lecture frames this as the minimum feedback arc set problem, notes it is NP-hard, and presents a greedy heuristic GreedyMakeAcyclic to construct a DAG.\"}]","Visualization of Graphs - Lecture 8 - Hierarchical Layouts: Sugiyama Framework - Hierarchical Drawing - Motivation | PDF",1792792942,123,{"code":4,"msg":32,"data":33},"ok",{"site_id":25,"language":24,"slug":34,"title":13,"keywords":35,"description":14,"schema_data":36,"social_meta":92,"head_meta":94,"extra_data":96,"updated_unix":97},"visualization-of-graphs-lecture-8-hierarchical-layouts-sugiyama-framework-hierarchical-drawing-motivation","",{"@graph":37,"@context":91},[38,54,74],{"@type":39,"itemListElement":40},"BreadcrumbList",[41,45,49,52],{"item":42,"name":43,"@type":44,"position":21},"https://docshare.wps.com","Home","ListItem",{"item":46,"name":47,"@type":44,"position":48},"https://docshare.wps.com/document/","Document",2,{"item":50,"name":12,"@type":44,"position":51},"https://docshare.wps.com/document/technology/",3,{"item":53,"name":13,"@type":44,"position":20},"https://docshare.wps.com/document/visualization-of-graphs-lecture-8-hierarchical-layouts-sugiyama-framework-hierarchical-drawing-motivation/648278/",{"url":53,"name":13,"@type":55,"image":56,"author":61,"headline":13,"publisher":63,"fileFormat":66,"inLanguage":24,"description":14,"dateModified":67,"datePublished":68,"encodingFormat":66,"isAccessibleForFree":69,"interactionStatistic":70},"DigitalDocument",{"url":57,"@type":58,"width":59,"height":60},"https://docshare.wps.com/thumbnails/visualization-of-graphs-lecture-8-hierarchical-layouts-sugiyama-framework-hierarchical-drawing-motivation/648278.png","ImageObject",300,407,{"name":9,"@type":62},"Person",{"url":42,"name":64,"@type":65},"DocShare","Organization","application/pdf","2026-10-29","2026-10-23",true,{"@type":71,"interactionType":72,"userInteractionCount":20},"InteractionCounter",{"@type":73},"ViewAction",{"@type":75,"mainEntity":76},"FAQPage",[77,83,87],{"name":78,"@type":79,"acceptedAnswer":80},"What is the hierarchical drawing problem in this lecture?","Question",{"text":81,"@type":82},"Given a directed graph G, the goal is to output a drawing that closely reproduces the hierarchical properties of G. The drawing emphasizes upward edges, layered vertex placement, few crossings, short edges, and even vertex spacing.","Answer",{"name":84,"@type":79,"acceptedAnswer":85},"Which desirable properties does the lecture list for hierarchical drawings?",{"text":86,"@type":82},"Edges should be directed upwards; vertices should lie on few horizontal lines; few edge pairs should cross; edges should be short; and vertices should be evenly spaced.",{"name":88,"@type":79,"acceptedAnswer":89},"Why is cycle breaking step 1 important, and how is it handled?",{"text":90,"@type":82},"Cycle breaking ensures the graph becomes acyclic by reversing a chosen set of edges. The lecture frames this as the minimum feedback arc set problem, notes it is NP-hard, and presents a greedy heuristic GreedyMakeAcyclic to construct a DAG.","https://schema.org",{"og:url":53,"og:type":93,"og:title":13,"og:site_name":64,"og:description":14},"article",{"robots":95,"canonical":53},"index,follow",{"doc_id":7,"site_id":25},1792916893,{"code":4,"msg":5,"data":99},[100,104,108,112,117,120,125,130,135,138,142],{"id":21,"doc_module":4,"doc_module_name":47,"category_name":101,"show_sort_weight":102,"slug":103},"Story & Novel",90,"story-novel",{"id":48,"doc_module":4,"doc_module_name":47,"category_name":105,"show_sort_weight":106,"slug":107},"Literature",80,"literature",{"id":20,"doc_module":4,"doc_module_name":47,"category_name":109,"show_sort_weight":110,"slug":111},"Exam",70,"exam",{"id":113,"doc_module":4,"doc_module_name":47,"category_name":114,"show_sort_weight":115,"slug":116},5,"Comic",60,"comic",{"id":11,"doc_module":4,"doc_module_name":47,"category_name":12,"show_sort_weight":118,"slug":119},50,"technology",{"id":121,"doc_module":4,"doc_module_name":47,"category_name":122,"show_sort_weight":123,"slug":124},7,"Healthcare",40,"healthcare",{"id":126,"doc_module":4,"doc_module_name":47,"category_name":127,"show_sort_weight":128,"slug":129},8,"Research & Report",30,"research-report",{"id":131,"doc_module":4,"doc_module_name":47,"category_name":132,"show_sort_weight":133,"slug":134},9,"Religion & Spirituality",20,"religion-spirituality",{"id":133,"doc_module":4,"doc_module_name":47,"category_name":136,"show_sort_weight":133,"slug":137},"World Cup","world-cup",{"id":139,"doc_module":4,"doc_module_name":47,"category_name":140,"show_sort_weight":139,"slug":141},10,"Lifestyle","lifestyle",{"id":143,"doc_module":4,"doc_module_name":47,"category_name":144,"show_sort_weight":113,"slug":145},19,"General","general"]