CINXE.COM
Graph drawing - Wikipedia
<!DOCTYPE html> <html class="client-nojs vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available" lang="en" dir="ltr"> <head> <meta charset="UTF-8"> <title>Graph drawing - Wikipedia</title> <script>(function(){var className="client-js vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available";var cookie=document.cookie.match(/(?:^|; )enwikimwclientpreferences=([^;]+)/);if(cookie){cookie[1].split('%2C').forEach(function(pref){className=className.replace(new RegExp('(^| )'+pref.replace(/-clientpref-\w+$|[^\w-]+/g,'')+'-clientpref-\\w+( |$)'),'$1'+pref+'$2');});}document.documentElement.className=className;}());RLCONF={"wgBreakFrames":false,"wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"dmy", "wgMonthNames":["","January","February","March","April","May","June","July","August","September","October","November","December"],"wgRequestId":"afba237f-3c55-406e-b93a-fe1e870b5169","wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"Graph_drawing","wgTitle":"Graph drawing","wgCurRevisionId":1251967614,"wgRevisionId":1251967614,"wgArticleId":325813,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["Webarchive template wayback links","Articles with short description","Short description matches Wikidata","Use mdy dates from March 2024","CS1: long volume value","Graph drawing"],"wgPageViewLanguage":"en","wgPageContentLanguage":"en","wgPageContentModel":"wikitext","wgRelevantPageName":"Graph_drawing","wgRelevantArticleId":325813,"wgIsProbablyEditable":true,"wgRelevantPageIsProbablyEditable":true,"wgRestrictionEdit":[],"wgRestrictionMove":[],"wgNoticeProject":"wikipedia", "wgCiteReferencePreviewsActive":false,"wgFlaggedRevsParams":{"tags":{"status":{"levels":1}}},"wgMediaViewerOnClick":true,"wgMediaViewerEnabledByDefault":true,"wgPopupsFlags":0,"wgVisualEditor":{"pageLanguageCode":"en","pageLanguageDir":"ltr","pageVariantFallbacks":"en"},"wgMFDisplayWikibaseDescriptions":{"search":true,"watchlist":true,"tagline":false,"nearby":true},"wgWMESchemaEditAttemptStepOversample":false,"wgWMEPageLength":30000,"wgRelatedArticlesCompat":[],"wgEditSubmitButtonLabelPublish":true,"wgULSPosition":"interlanguage","wgULSisCompactLinksEnabled":false,"wgVector2022LanguageInHeader":true,"wgULSisLanguageSelectorEmpty":false,"wgWikibaseItemId":"Q739462","wgCheckUserClientHintsHeadersJsApi":["brands","architecture","bitness","fullVersionList","mobile","model","platform","platformVersion"],"GEHomepageSuggestedEditsEnableTopics":true,"wgGETopicsMatchModeEnabled":false,"wgGEStructuredTaskRejectionReasonTextInputEnabled":false,"wgGELevelingUpEnabledForUser":false};RLSTATE={ "ext.globalCssJs.user.styles":"ready","site.styles":"ready","user.styles":"ready","ext.globalCssJs.user":"ready","user":"ready","user.options":"loading","ext.cite.styles":"ready","skins.vector.search.codex.styles":"ready","skins.vector.styles":"ready","skins.vector.icons":"ready","jquery.makeCollapsible.styles":"ready","ext.wikimediamessages.styles":"ready","ext.visualEditor.desktopArticleTarget.noscript":"ready","ext.uls.interlanguage":"ready","wikibase.client.init":"ready","ext.wikimediaBadges":"ready"};RLPAGEMODULES=["ext.cite.ux-enhancements","mediawiki.page.media","ext.scribunto.logs","site","mediawiki.page.ready","jquery.makeCollapsible","mediawiki.toc","skins.vector.js","ext.centralNotice.geoIP","ext.centralNotice.startUp","ext.gadget.ReferenceTooltips","ext.gadget.switcher","ext.urlShortener.toolbar","ext.centralauth.centralautologin","mmv.bootstrap","ext.popups","ext.visualEditor.desktopArticleTarget.init","ext.visualEditor.targetLoader","ext.echo.centralauth", "ext.eventLogging","ext.wikimediaEvents","ext.navigationTiming","ext.uls.interface","ext.cx.eventlogging.campaigns","ext.cx.uls.quick.actions","wikibase.client.vector-2022","ext.checkUser.clientHints","ext.quicksurveys.init","ext.growthExperiments.SuggestedEditSession"];</script> <script>(RLQ=window.RLQ||[]).push(function(){mw.loader.impl(function(){return["user.options@12s5i",function($,jQuery,require,module){mw.user.tokens.set({"patrolToken":"+\\","watchToken":"+\\","csrfToken":"+\\"}); }];});});</script> <link rel="stylesheet" href="/w/load.php?lang=en&modules=ext.cite.styles%7Cext.uls.interlanguage%7Cext.visualEditor.desktopArticleTarget.noscript%7Cext.wikimediaBadges%7Cext.wikimediamessages.styles%7Cjquery.makeCollapsible.styles%7Cskins.vector.icons%2Cstyles%7Cskins.vector.search.codex.styles%7Cwikibase.client.init&only=styles&skin=vector-2022"> <script async="" src="/w/load.php?lang=en&modules=startup&only=scripts&raw=1&skin=vector-2022"></script> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=en&modules=site.styles&only=styles&skin=vector-2022"> <meta name="generator" content="MediaWiki 1.44.0-wmf.6"> <meta name="referrer" content="origin"> <meta name="referrer" content="origin-when-cross-origin"> <meta name="robots" content="max-image-preview:standard"> <meta name="format-detection" content="telephone=no"> <meta property="og:image" content="https://upload.wikimedia.org/wikipedia/commons/b/b9/WorldWideWebAroundWikipedia.png"> <meta property="og:image:width" content="1200"> <meta property="og:image:height" content="864"> <meta property="og:image" content="https://upload.wikimedia.org/wikipedia/commons/thumb/b/b9/WorldWideWebAroundWikipedia.png/800px-WorldWideWebAroundWikipedia.png"> <meta property="og:image:width" content="800"> <meta property="og:image:height" content="576"> <meta property="og:image" content="https://upload.wikimedia.org/wikipedia/commons/thumb/b/b9/WorldWideWebAroundWikipedia.png/640px-WorldWideWebAroundWikipedia.png"> <meta property="og:image:width" content="640"> <meta property="og:image:height" content="461"> <meta name="viewport" content="width=1120"> <meta property="og:title" content="Graph drawing - Wikipedia"> <meta property="og:type" content="website"> <link rel="preconnect" href="//upload.wikimedia.org"> <link rel="alternate" media="only screen and (max-width: 640px)" href="//en.m.wikipedia.org/wiki/Graph_drawing"> <link rel="alternate" type="application/x-wiki" title="Edit this page" href="/w/index.php?title=Graph_drawing&action=edit"> <link rel="apple-touch-icon" href="/static/apple-touch/wikipedia.png"> <link rel="icon" href="/static/favicon/wikipedia.ico"> <link rel="search" type="application/opensearchdescription+xml" href="/w/rest.php/v1/search" title="Wikipedia (en)"> <link rel="EditURI" type="application/rsd+xml" href="//en.wikipedia.org/w/api.php?action=rsd"> <link rel="canonical" href="https://en.wikipedia.org/wiki/Graph_drawing"> <link rel="license" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en"> <link rel="alternate" type="application/atom+xml" title="Wikipedia Atom feed" href="/w/index.php?title=Special:RecentChanges&feed=atom"> <link rel="dns-prefetch" href="//meta.wikimedia.org" /> <link rel="dns-prefetch" href="login.wikimedia.org"> </head> <body class="skin--responsive skin-vector skin-vector-search-vue mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject mw-editable page-Graph_drawing rootpage-Graph_drawing skin-vector-2022 action-view"><a class="mw-jump-link" href="#bodyContent">Jump to content</a> <div class="vector-header-container"> <header class="vector-header mw-header"> <div class="vector-header-start"> <nav class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-dropdown" class="vector-dropdown vector-main-menu-dropdown vector-button-flush-left vector-button-flush-right" > <input type="checkbox" id="vector-main-menu-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-main-menu-dropdown" class="vector-dropdown-checkbox " aria-label="Main menu" > <label id="vector-main-menu-dropdown-label" for="vector-main-menu-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-menu mw-ui-icon-wikimedia-menu"></span> <span class="vector-dropdown-label-text">Main menu</span> </label> <div class="vector-dropdown-content"> <div id="vector-main-menu-unpinned-container" class="vector-unpinned-container"> <div id="vector-main-menu" class="vector-main-menu vector-pinnable-element"> <div class="vector-pinnable-header vector-main-menu-pinnable-header vector-pinnable-header-unpinned" data-feature-name="main-menu-pinned" data-pinnable-element-id="vector-main-menu" data-pinned-container-id="vector-main-menu-pinned-container" data-unpinned-container-id="vector-main-menu-unpinned-container" > <div class="vector-pinnable-header-label">Main menu</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-main-menu.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-main-menu.unpin">hide</button> </div> <div id="p-navigation" class="vector-menu mw-portlet mw-portlet-navigation" > <div class="vector-menu-heading"> Navigation </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-mainpage-description" class="mw-list-item"><a href="/wiki/Main_Page" title="Visit the main page [z]" accesskey="z"><span>Main page</span></a></li><li id="n-contents" class="mw-list-item"><a href="/wiki/Wikipedia:Contents" title="Guides to browsing Wikipedia"><span>Contents</span></a></li><li id="n-currentevents" class="mw-list-item"><a href="/wiki/Portal:Current_events" title="Articles related to current events"><span>Current events</span></a></li><li id="n-randompage" class="mw-list-item"><a href="/wiki/Special:Random" title="Visit a randomly selected article [x]" accesskey="x"><span>Random article</span></a></li><li id="n-aboutsite" class="mw-list-item"><a href="/wiki/Wikipedia:About" title="Learn about Wikipedia and how it works"><span>About Wikipedia</span></a></li><li id="n-contactpage" class="mw-list-item"><a href="//en.wikipedia.org/wiki/Wikipedia:Contact_us" title="How to contact Wikipedia"><span>Contact us</span></a></li> </ul> </div> </div> <div id="p-interaction" class="vector-menu mw-portlet mw-portlet-interaction" > <div class="vector-menu-heading"> Contribute </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-help" class="mw-list-item"><a href="/wiki/Help:Contents" title="Guidance on how to use and edit Wikipedia"><span>Help</span></a></li><li id="n-introduction" class="mw-list-item"><a href="/wiki/Help:Introduction" title="Learn how to edit Wikipedia"><span>Learn to edit</span></a></li><li id="n-portal" class="mw-list-item"><a href="/wiki/Wikipedia:Community_portal" title="The hub for editors"><span>Community portal</span></a></li><li id="n-recentchanges" class="mw-list-item"><a href="/wiki/Special:RecentChanges" title="A list of recent changes to Wikipedia [r]" accesskey="r"><span>Recent changes</span></a></li><li id="n-upload" class="mw-list-item"><a href="/wiki/Wikipedia:File_upload_wizard" title="Add images or other media for use on Wikipedia"><span>Upload file</span></a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> <a href="/wiki/Main_Page" class="mw-logo"> <img class="mw-logo-icon" src="/static/images/icons/wikipedia.png" alt="" aria-hidden="true" height="50" width="50"> <span class="mw-logo-container skin-invert"> <img class="mw-logo-wordmark" alt="Wikipedia" src="/static/images/mobile/copyright/wikipedia-wordmark-en.svg" style="width: 7.5em; height: 1.125em;"> <img class="mw-logo-tagline" alt="The Free Encyclopedia" src="/static/images/mobile/copyright/wikipedia-tagline-en.svg" width="117" height="13" style="width: 7.3125em; height: 0.8125em;"> </span> </a> </div> <div class="vector-header-end"> <div id="p-search" role="search" class="vector-search-box-vue vector-search-box-collapses vector-search-box-show-thumbnail vector-search-box-auto-expand-width vector-search-box"> <a href="/wiki/Special:Search" class="cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only search-toggle" title="Search Wikipedia [f]" accesskey="f"><span class="vector-icon mw-ui-icon-search mw-ui-icon-wikimedia-search"></span> <span>Search</span> </a> <div class="vector-typeahead-search-container"> <div class="cdx-typeahead-search cdx-typeahead-search--show-thumbnail cdx-typeahead-search--auto-expand-width"> <form action="/w/index.php" id="searchform" class="cdx-search-input cdx-search-input--has-end-button"> <div id="simpleSearch" class="cdx-search-input__input-wrapper" data-search-loc="header-moved"> <div class="cdx-text-input cdx-text-input--has-start-icon"> <input class="cdx-text-input__input" type="search" name="search" placeholder="Search Wikipedia" aria-label="Search Wikipedia" autocapitalize="sentences" title="Search Wikipedia [f]" accesskey="f" id="searchInput" > <span class="cdx-text-input__icon cdx-text-input__start-icon"></span> </div> <input type="hidden" name="title" value="Special:Search"> </div> <button class="cdx-button cdx-search-input__end-button">Search</button> </form> </div> </div> </div> <nav class="vector-user-links vector-user-links-wide" aria-label="Personal tools"> <div class="vector-user-links-main"> <div id="p-vector-user-menu-preferences" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-userpage" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-dropdown" class="vector-dropdown " title="Change the appearance of the page's font size, width, and color" > <input type="checkbox" id="vector-appearance-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-appearance-dropdown" class="vector-dropdown-checkbox " aria-label="Appearance" > <label id="vector-appearance-dropdown-label" for="vector-appearance-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-appearance mw-ui-icon-wikimedia-appearance"></span> <span class="vector-dropdown-label-text">Appearance</span> </label> <div class="vector-dropdown-content"> <div id="vector-appearance-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <div id="p-vector-user-menu-notifications" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-overflow" class="vector-menu mw-portlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="https://donate.wikimedia.org/?wmf_source=donate&wmf_medium=sidebar&wmf_campaign=en.wikipedia.org&uselang=en" class=""><span>Donate</span></a> </li> <li id="pt-createaccount-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:CreateAccount&returnto=Graph+drawing" title="You are encouraged to create an account and log in; however, it is not mandatory" class=""><span>Create account</span></a> </li> <li id="pt-login-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:UserLogin&returnto=Graph+drawing" title="You're encouraged to log in; however, it's not mandatory. [o]" accesskey="o" class=""><span>Log in</span></a> </li> </ul> </div> </div> </div> <div id="vector-user-links-dropdown" class="vector-dropdown vector-user-menu vector-button-flush-right vector-user-menu-logged-out" title="Log in and more options" > <input type="checkbox" id="vector-user-links-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-user-links-dropdown" class="vector-dropdown-checkbox " aria-label="Personal tools" > <label id="vector-user-links-dropdown-label" for="vector-user-links-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-ellipsis mw-ui-icon-wikimedia-ellipsis"></span> <span class="vector-dropdown-label-text">Personal tools</span> </label> <div class="vector-dropdown-content"> <div id="p-personal" class="vector-menu mw-portlet mw-portlet-personal user-links-collapsible-item" title="User menu" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport" class="user-links-collapsible-item mw-list-item"><a href="https://donate.wikimedia.org/?wmf_source=donate&wmf_medium=sidebar&wmf_campaign=en.wikipedia.org&uselang=en"><span>Donate</span></a></li><li id="pt-createaccount" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:CreateAccount&returnto=Graph+drawing" title="You are encouraged to create an account and log in; however, it is not mandatory"><span class="vector-icon mw-ui-icon-userAdd mw-ui-icon-wikimedia-userAdd"></span> <span>Create account</span></a></li><li id="pt-login" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:UserLogin&returnto=Graph+drawing" title="You're encouraged to log in; however, it's not mandatory. [o]" accesskey="o"><span class="vector-icon mw-ui-icon-logIn mw-ui-icon-wikimedia-logIn"></span> <span>Log in</span></a></li> </ul> </div> </div> <div id="p-user-menu-anon-editor" class="vector-menu mw-portlet mw-portlet-user-menu-anon-editor" > <div class="vector-menu-heading"> Pages for logged out editors <a href="/wiki/Help:Introduction" aria-label="Learn more about editing"><span>learn more</span></a> </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-anoncontribs" class="mw-list-item"><a href="/wiki/Special:MyContributions" title="A list of edits made from this IP address [y]" accesskey="y"><span>Contributions</span></a></li><li id="pt-anontalk" class="mw-list-item"><a href="/wiki/Special:MyTalk" title="Discussion about edits from this IP address [n]" accesskey="n"><span>Talk</span></a></li> </ul> </div> </div> </div> </div> </nav> </div> </header> </div> <div class="mw-page-container"> <div class="mw-page-container-inner"> <div class="vector-sitenotice-container"> <div id="siteNotice"><!-- CentralNotice --></div> </div> <div class="vector-column-start"> <div class="vector-main-menu-container"> <div id="mw-navigation"> <nav id="mw-panel" class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-pinned-container" class="vector-pinned-container"> </div> </nav> </div> </div> <div class="vector-sticky-pinned-container"> <nav id="mw-panel-toc" aria-label="Contents" data-event-name="ui.sidebar-toc" class="mw-table-of-contents-container vector-toc-landmark"> <div id="vector-toc-pinned-container" class="vector-pinned-container"> <div id="vector-toc" class="vector-toc vector-pinnable-element"> <div class="vector-pinnable-header vector-toc-pinnable-header vector-pinnable-header-pinned" data-feature-name="toc-pinned" data-pinnable-element-id="vector-toc" > <h2 class="vector-pinnable-header-label">Contents</h2> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-toc.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-toc.unpin">hide</button> </div> <ul class="vector-toc-contents" id="mw-panel-toc-list"> <li id="toc-mw-content-text" class="vector-toc-list-item vector-toc-level-1"> <a href="#" class="vector-toc-link"> <div class="vector-toc-text">(Top)</div> </a> </li> <li id="toc-Graphical_conventions" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Graphical_conventions"> <div class="vector-toc-text"> <span class="vector-toc-numb">1</span> <span>Graphical conventions</span> </div> </a> <ul id="toc-Graphical_conventions-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Quality_measures" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Quality_measures"> <div class="vector-toc-text"> <span class="vector-toc-numb">2</span> <span>Quality measures</span> </div> </a> <ul id="toc-Quality_measures-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Layout_methods" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Layout_methods"> <div class="vector-toc-text"> <span class="vector-toc-numb">3</span> <span>Layout methods</span> </div> </a> <ul id="toc-Layout_methods-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Application-specific_graph_drawings" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Application-specific_graph_drawings"> <div class="vector-toc-text"> <span class="vector-toc-numb">4</span> <span>Application-specific graph drawings</span> </div> </a> <ul id="toc-Application-specific_graph_drawings-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Software" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Software"> <div class="vector-toc-text"> <span class="vector-toc-numb">5</span> <span>Software</span> </div> </a> <ul id="toc-Software-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-See_also" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#See_also"> <div class="vector-toc-text"> <span class="vector-toc-numb">6</span> <span>See also</span> </div> </a> <ul id="toc-See_also-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-References" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#References"> <div class="vector-toc-text"> <span class="vector-toc-numb">7</span> <span>References</span> </div> </a> <button aria-controls="toc-References-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> <span class="vector-icon mw-ui-icon-wikimedia-expand"></span> <span>Toggle References subsection</span> </button> <ul id="toc-References-sublist" class="vector-toc-list"> <li id="toc-Footnotes" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Footnotes"> <div class="vector-toc-text"> <span class="vector-toc-numb">7.1</span> <span>Footnotes</span> </div> </a> <ul id="toc-Footnotes-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-General_references" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#General_references"> <div class="vector-toc-text"> <span class="vector-toc-numb">7.2</span> <span>General references</span> </div> </a> <ul id="toc-General_references-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Specialized_subtopics" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Specialized_subtopics"> <div class="vector-toc-text"> <span class="vector-toc-numb">7.3</span> <span>Specialized subtopics</span> </div> </a> <ul id="toc-Specialized_subtopics-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Further_reading" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Further_reading"> <div class="vector-toc-text"> <span class="vector-toc-numb">8</span> <span>Further reading</span> </div> </a> <ul id="toc-Further_reading-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-External_links" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#External_links"> <div class="vector-toc-text"> <span class="vector-toc-numb">9</span> <span>External links</span> </div> </a> <ul id="toc-External_links-sublist" class="vector-toc-list"> </ul> </li> </ul> </div> </div> </nav> </div> </div> <div class="mw-content-container"> <main id="content" class="mw-body"> <header class="mw-body-header vector-page-titlebar"> <nav aria-label="Contents" class="vector-toc-landmark"> <div id="vector-page-titlebar-toc" class="vector-dropdown vector-page-titlebar-toc vector-button-flush-left" > <input type="checkbox" id="vector-page-titlebar-toc-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-titlebar-toc" class="vector-dropdown-checkbox " aria-label="Toggle the table of contents" > <label id="vector-page-titlebar-toc-label" for="vector-page-titlebar-toc-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-listBullet mw-ui-icon-wikimedia-listBullet"></span> <span class="vector-dropdown-label-text">Toggle the table of contents</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-titlebar-toc-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <h1 id="firstHeading" class="firstHeading mw-first-heading"><span class="mw-page-title-main">Graph drawing</span></h1> <div id="p-lang-btn" class="vector-dropdown mw-portlet mw-portlet-lang" > <input type="checkbox" id="p-lang-btn-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-p-lang-btn" class="vector-dropdown-checkbox mw-interlanguage-selector" aria-label="Go to an article in another language. Available in 10 languages" > <label id="p-lang-btn-label" for="p-lang-btn-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--action-progressive mw-portlet-lang-heading-10" aria-hidden="true" ><span class="vector-icon mw-ui-icon-language-progressive mw-ui-icon-wikimedia-language-progressive"></span> <span class="vector-dropdown-label-text">10 languages</span> </label> <div class="vector-dropdown-content"> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="interlanguage-link interwiki-de mw-list-item"><a href="https://de.wikipedia.org/wiki/Graphzeichnen" title="Graphzeichnen – German" lang="de" hreflang="de" data-title="Graphzeichnen" data-language-autonym="Deutsch" data-language-local-name="German" class="interlanguage-link-target"><span>Deutsch</span></a></li><li class="interlanguage-link interwiki-es mw-list-item"><a href="https://es.wikipedia.org/wiki/Dibujo_de_grafos" title="Dibujo de grafos – Spanish" lang="es" hreflang="es" data-title="Dibujo de grafos" data-language-autonym="Español" data-language-local-name="Spanish" class="interlanguage-link-target"><span>Español</span></a></li><li class="interlanguage-link interwiki-fa mw-list-item"><a href="https://fa.wikipedia.org/wiki/%D8%B1%D8%B3%D9%85_%DA%AF%D8%B1%D8%A7%D9%81" title="رسم گراف – Persian" lang="fa" hreflang="fa" data-title="رسم گراف" data-language-autonym="فارسی" data-language-local-name="Persian" class="interlanguage-link-target"><span>فارسی</span></a></li><li class="interlanguage-link interwiki-fr mw-list-item"><a href="https://fr.wikipedia.org/wiki/Trac%C3%A9_de_graphes" title="Tracé de graphes – French" lang="fr" hreflang="fr" data-title="Tracé de graphes" data-language-autonym="Français" data-language-local-name="French" class="interlanguage-link-target"><span>Français</span></a></li><li class="interlanguage-link interwiki-ko mw-list-item"><a href="https://ko.wikipedia.org/wiki/%EA%B7%B8%EB%9E%98%ED%94%84_%EA%B7%B8%EB%A6%AC%EA%B8%B0" title="그래프 그리기 – Korean" lang="ko" hreflang="ko" data-title="그래프 그리기" data-language-autonym="한국어" data-language-local-name="Korean" class="interlanguage-link-target"><span>한국어</span></a></li><li class="interlanguage-link interwiki-it mw-list-item"><a href="https://it.wikipedia.org/wiki/Raffigurazione_di_un_grafo" title="Raffigurazione di un grafo – Italian" lang="it" hreflang="it" data-title="Raffigurazione di un grafo" data-language-autonym="Italiano" data-language-local-name="Italian" class="interlanguage-link-target"><span>Italiano</span></a></li><li class="interlanguage-link interwiki-ru mw-list-item"><a href="https://ru.wikipedia.org/wiki/%D0%92%D0%B8%D0%B7%D1%83%D0%B0%D0%BB%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F_%D0%B3%D1%80%D0%B0%D1%84%D0%BE%D0%B2" title="Визуализация графов – Russian" lang="ru" hreflang="ru" data-title="Визуализация графов" data-language-autonym="Русский" data-language-local-name="Russian" class="interlanguage-link-target"><span>Русский</span></a></li><li class="interlanguage-link interwiki-tl mw-list-item"><a href="https://tl.wikipedia.org/wiki/Pagguhit_ng_grap" title="Pagguhit ng grap – Tagalog" lang="tl" hreflang="tl" data-title="Pagguhit ng grap" data-language-autonym="Tagalog" data-language-local-name="Tagalog" class="interlanguage-link-target"><span>Tagalog</span></a></li><li class="interlanguage-link interwiki-ta mw-list-item"><a href="https://ta.wikipedia.org/wiki/%E0%AE%95%E0%AF%8B%E0%AE%9F%E0%AF%8D%E0%AE%9F%E0%AF%81%E0%AE%B0%E0%AF%81_%E0%AE%B5%E0%AE%B0%E0%AF%88%E0%AE%AA%E0%AE%9F%E0%AE%AE%E0%AF%8D" title="கோட்டுரு வரைபடம் – Tamil" lang="ta" hreflang="ta" data-title="கோட்டுரு வரைபடம்" data-language-autonym="தமிழ்" data-language-local-name="Tamil" class="interlanguage-link-target"><span>தமிழ்</span></a></li><li class="interlanguage-link interwiki-uk mw-list-item"><a href="https://uk.wikipedia.org/wiki/%D0%92%D1%96%D0%B7%D1%83%D0%B0%D0%BB%D1%96%D0%B7%D0%B0%D1%86%D1%96%D1%8F_%D0%B3%D1%80%D0%B0%D1%84%D1%96%D0%B2" title="Візуалізація графів – Ukrainian" lang="uk" hreflang="uk" data-title="Візуалізація графів" data-language-autonym="Українська" data-language-local-name="Ukrainian" class="interlanguage-link-target"><span>Українська</span></a></li> </ul> <div class="after-portlet after-portlet-lang"><span class="wb-langlinks-edit wb-langlinks-link"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q739462#sitelinks-wikipedia" title="Edit interlanguage links" class="wbc-editpage">Edit links</a></span></div> </div> </div> </div> </header> <div class="vector-page-toolbar"> <div class="vector-page-toolbar-container"> <div id="left-navigation"> <nav aria-label="Namespaces"> <div id="p-associated-pages" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-associated-pages" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-nstab-main" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Graph_drawing" title="View the content page [c]" accesskey="c"><span>Article</span></a></li><li id="ca-talk" class="vector-tab-noicon mw-list-item"><a href="/wiki/Talk:Graph_drawing" rel="discussion" title="Discuss improvements to the content page [t]" accesskey="t"><span>Talk</span></a></li> </ul> </div> </div> <div id="vector-variants-dropdown" class="vector-dropdown emptyPortlet" > <input type="checkbox" id="vector-variants-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-variants-dropdown" class="vector-dropdown-checkbox " aria-label="Change language variant" > <label id="vector-variants-dropdown-label" for="vector-variants-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">English</span> </label> <div class="vector-dropdown-content"> <div id="p-variants" class="vector-menu mw-portlet mw-portlet-variants emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> </div> </div> </nav> </div> <div id="right-navigation" class="vector-collapsible"> <nav aria-label="Views"> <div id="p-views" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-views" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-view" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Graph_drawing"><span>Read</span></a></li><li id="ca-edit" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Graph_drawing&action=edit" title="Edit this page [e]" accesskey="e"><span>Edit</span></a></li><li id="ca-history" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Graph_drawing&action=history" title="Past revisions of this page [h]" accesskey="h"><span>View history</span></a></li> </ul> </div> </div> </nav> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-dropdown" class="vector-dropdown vector-page-tools-dropdown" > <input type="checkbox" id="vector-page-tools-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-tools-dropdown" class="vector-dropdown-checkbox " aria-label="Tools" > <label id="vector-page-tools-dropdown-label" for="vector-page-tools-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">Tools</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-tools-unpinned-container" class="vector-unpinned-container"> <div id="vector-page-tools" class="vector-page-tools vector-pinnable-element"> <div class="vector-pinnable-header vector-page-tools-pinnable-header vector-pinnable-header-unpinned" data-feature-name="page-tools-pinned" data-pinnable-element-id="vector-page-tools" data-pinned-container-id="vector-page-tools-pinned-container" data-unpinned-container-id="vector-page-tools-unpinned-container" > <div class="vector-pinnable-header-label">Tools</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-page-tools.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-page-tools.unpin">hide</button> </div> <div id="p-cactions" class="vector-menu mw-portlet mw-portlet-cactions emptyPortlet vector-has-collapsible-items" title="More options" > <div class="vector-menu-heading"> Actions </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-more-view" class="selected vector-more-collapsible-item mw-list-item"><a href="/wiki/Graph_drawing"><span>Read</span></a></li><li id="ca-more-edit" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Graph_drawing&action=edit" title="Edit this page [e]" accesskey="e"><span>Edit</span></a></li><li id="ca-more-history" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Graph_drawing&action=history"><span>View history</span></a></li> </ul> </div> </div> <div id="p-tb" class="vector-menu mw-portlet mw-portlet-tb" > <div class="vector-menu-heading"> General </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-whatlinkshere" class="mw-list-item"><a href="/wiki/Special:WhatLinksHere/Graph_drawing" title="List of all English Wikipedia pages containing links to this page [j]" accesskey="j"><span>What links here</span></a></li><li id="t-recentchangeslinked" class="mw-list-item"><a href="/wiki/Special:RecentChangesLinked/Graph_drawing" rel="nofollow" title="Recent changes in pages linked from this page [k]" accesskey="k"><span>Related changes</span></a></li><li id="t-upload" class="mw-list-item"><a href="/wiki/Wikipedia:File_Upload_Wizard" title="Upload files [u]" accesskey="u"><span>Upload file</span></a></li><li id="t-specialpages" class="mw-list-item"><a href="/wiki/Special:SpecialPages" title="A list of all special pages [q]" accesskey="q"><span>Special pages</span></a></li><li id="t-permalink" class="mw-list-item"><a href="/w/index.php?title=Graph_drawing&oldid=1251967614" title="Permanent link to this revision of this page"><span>Permanent link</span></a></li><li id="t-info" class="mw-list-item"><a href="/w/index.php?title=Graph_drawing&action=info" title="More information about this page"><span>Page information</span></a></li><li id="t-cite" class="mw-list-item"><a href="/w/index.php?title=Special:CiteThisPage&page=Graph_drawing&id=1251967614&wpFormIdentifier=titleform" title="Information on how to cite this page"><span>Cite this page</span></a></li><li id="t-urlshortener" class="mw-list-item"><a href="/w/index.php?title=Special:UrlQ%C4%B1sald%C4%B1c%C4%B1s%C4%B1&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FGraph_drawing"><span>Get shortened URL</span></a></li><li id="t-urlshortener-qrcode" class="mw-list-item"><a href="/w/index.php?title=Special:QrKodu&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FGraph_drawing"><span>Download QR code</span></a></li> </ul> </div> </div> <div id="p-coll-print_export" class="vector-menu mw-portlet mw-portlet-coll-print_export" > <div class="vector-menu-heading"> Print/export </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="coll-download-as-rl" class="mw-list-item"><a href="/w/index.php?title=Special:DownloadAsPdf&page=Graph_drawing&action=show-download-screen" title="Download this page as a PDF file"><span>Download as PDF</span></a></li><li id="t-print" class="mw-list-item"><a href="/w/index.php?title=Graph_drawing&printable=yes" title="Printable version of this page [p]" accesskey="p"><span>Printable version</span></a></li> </ul> </div> </div> <div id="p-wikibase-otherprojects" class="vector-menu mw-portlet mw-portlet-wikibase-otherprojects" > <div class="vector-menu-heading"> In other projects </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-wikibase" class="wb-otherproject-link wb-otherproject-wikibase-dataitem mw-list-item"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q739462" title="Structured data on this page hosted by Wikidata [g]" accesskey="g"><span>Wikidata item</span></a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> </div> </div> </div> <div class="vector-column-end"> <div class="vector-sticky-pinned-container"> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-pinned-container" class="vector-pinned-container"> </div> </nav> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-pinned-container" class="vector-pinned-container"> <div id="vector-appearance" class="vector-appearance vector-pinnable-element"> <div class="vector-pinnable-header vector-appearance-pinnable-header vector-pinnable-header-pinned" data-feature-name="appearance-pinned" data-pinnable-element-id="vector-appearance" data-pinned-container-id="vector-appearance-pinned-container" data-unpinned-container-id="vector-appearance-unpinned-container" > <div class="vector-pinnable-header-label">Appearance</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-appearance.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-appearance.unpin">hide</button> </div> </div> </div> </nav> </div> </div> <div id="bodyContent" class="vector-body" aria-labelledby="firstHeading" data-mw-ve-target-container> <div class="vector-body-before-content"> <div class="mw-indicators"> </div> <div id="siteSub" class="noprint">From Wikipedia, the free encyclopedia</div> </div> <div id="contentSub"><div id="mw-content-subtitle"></div></div> <div id="mw-content-text" class="mw-body-content"><div class="mw-content-ltr mw-parser-output" lang="en" dir="ltr"><div class="shortdescription nomobile noexcerpt noprint searchaux" style="display:none">Visualization of node-link graphs</div> <p class="mw-empty-elt"> </p> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:WorldWideWebAroundWikipedia.png" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/b/b9/WorldWideWebAroundWikipedia.png/220px-WorldWideWebAroundWikipedia.png" decoding="async" width="220" height="158" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/b/b9/WorldWideWebAroundWikipedia.png/330px-WorldWideWebAroundWikipedia.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/b/b9/WorldWideWebAroundWikipedia.png/440px-WorldWideWebAroundWikipedia.png 2x" data-file-width="1185" data-file-height="853" /></a><figcaption>Graphic representation of a minute fraction of the <a href="/wiki/WWW" class="mw-redirect" title="WWW">WWW</a>, demonstrating <a href="/wiki/Hyperlink" title="Hyperlink">hyperlinks</a>.</figcaption></figure> <p><b>Graph drawing</b> is an area of <a href="/wiki/Mathematics" title="Mathematics">mathematics</a> and <a href="/wiki/Computer_science" title="Computer science">computer science</a> combining methods from <a href="/wiki/Geometric_graph_theory" title="Geometric graph theory">geometric graph theory</a> and <a href="/wiki/Information_visualization" class="mw-redirect" title="Information visualization">information visualization</a> to derive two-dimensional depictions of <a href="/wiki/Graph_(discrete_mathematics)" title="Graph (discrete mathematics)">graphs</a> arising from applications such as <a href="/wiki/Social_network_analysis" title="Social network analysis">social network analysis</a>, <a href="/wiki/Cartography" title="Cartography">cartography</a>, <a href="/wiki/Linguistics" title="Linguistics">linguistics</a>, and <a href="/wiki/Bioinformatics" title="Bioinformatics">bioinformatics</a>.<sup id="cite_ref-1" class="reference"><a href="#cite_note-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup> </p><p>A drawing of a graph or <b>network diagram</b> is a pictorial representation of the <a href="/wiki/Vertex_(graph_theory)" title="Vertex (graph theory)">vertices</a> and <a href="/wiki/Edge_(graph_theory)" class="mw-redirect" title="Edge (graph theory)">edges</a> of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph.<sup id="cite_ref-dett6_2-0" class="reference"><a href="#cite_note-dett6-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup> In the abstract, all that matters is which pairs of vertices are connected by edges. In the concrete, however, the arrangement of these vertices and edges within a drawing affects its understandability, usability, fabrication cost, and <a href="/wiki/Aesthetics" title="Aesthetics">aesthetics</a>.<sup id="cite_ref-dett-viii_3-0" class="reference"><a href="#cite_note-dett-viii-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup> The problem gets worse if the graph changes over time by adding and deleting edges (dynamic graph drawing) and the goal is to preserve the user's mental map.<sup id="cite_ref-FOOTNOTEMisueEadesLaiSugiyama1995_4-0" class="reference"><a href="#cite_note-FOOTNOTEMisueEadesLaiSugiyama1995-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> </p> <meta property="mw:PageProp/toc" /> <div class="mw-heading mw-heading2"><h2 id="Graphical_conventions">Graphical conventions</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=1" title="Edit section: Graphical conventions"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:4node-digraph-natural.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/2/2e/4node-digraph-natural.svg/110px-4node-digraph-natural.svg.png" decoding="async" width="110" height="114" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/2/2e/4node-digraph-natural.svg/165px-4node-digraph-natural.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/2/2e/4node-digraph-natural.svg/220px-4node-digraph-natural.svg.png 2x" data-file-width="141" data-file-height="146" /></a><figcaption><a href="/wiki/Directed_graph" title="Directed graph">Directed graph</a> with arrowheads showing edge directions</figcaption></figure> <p>Graphs are frequently drawn as node–link diagrams in which the vertices are represented as disks, boxes, or textual labels and the edges are represented as <a href="/wiki/Line_segment" title="Line segment">line segments</a>, <a href="/wiki/Polygonal_chain" title="Polygonal chain">polylines</a>, or curves in the <a href="/wiki/Euclidean_plane" title="Euclidean plane">Euclidean plane</a>.<sup id="cite_ref-dett-viii_3-1" class="reference"><a href="#cite_note-dett-viii-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup> Node–link diagrams can be traced back to the 14th-16th century works of Pseudo-Lull which were published under the name of <a href="/wiki/Ramon_Llull" title="Ramon Llull">Ramon Llull</a>, a 13th century polymath. Pseudo-Lull drew diagrams of this type for <a href="/wiki/Complete_graph" title="Complete graph">complete graphs</a> in order to analyze all pairwise combinations among sets of metaphysical concepts.<sup id="cite_ref-FOOTNOTEKnuth2013_5-0" class="reference"><a href="#cite_note-FOOTNOTEKnuth2013-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup> </p><p>In the case of <a href="/wiki/Directed_graph" title="Directed graph">directed graphs</a>, <a href="/wiki/Arrow_(symbol)" title="Arrow (symbol)">arrowheads</a> form a commonly used graphical convention to show their <a href="/wiki/Orientability" title="Orientability">orientation</a>;<sup id="cite_ref-dett6_2-1" class="reference"><a href="#cite_note-dett6-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup> however, user studies have shown that other conventions such as tapering provide this information more effectively.<sup id="cite_ref-6" class="reference"><a href="#cite_note-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup> <a href="/wiki/Upward_planar_drawing" title="Upward planar drawing">Upward planar drawing</a> uses the convention that every edge is oriented from a lower vertex to a higher vertex, making arrowheads unnecessary.<sup id="cite_ref-FOOTNOTEGargTamassia1995_7-0" class="reference"><a href="#cite_note-FOOTNOTEGargTamassia1995-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup> </p><p>Alternative conventions to node–link diagrams include adjacency representations such as <a href="/wiki/Circle_packing_theorem" title="Circle packing theorem">circle packings</a>, in which vertices are represented by disjoint regions in the plane and edges are represented by adjacencies between regions; <a href="/wiki/Intersection_graph" title="Intersection graph">intersection representations</a> in which vertices are represented by non-disjoint geometric objects and edges are represented by their intersections; visibility representations in which vertices are represented by regions in the plane and edges are represented by regions that have an unobstructed line of sight to each other; confluent drawings, in which edges are represented as smooth curves within mathematical <a href="/wiki/Train_track_(mathematics)" title="Train track (mathematics)">train tracks</a>; fabrics, in which nodes are represented as horizontal lines and edges as vertical lines;<sup id="cite_ref-Longabaugh_2012_8-0" class="reference"><a href="#cite_note-Longabaugh_2012-8"><span class="cite-bracket">[</span>8<span class="cite-bracket">]</span></a></sup> and visualizations of the <a href="/wiki/Adjacency_matrix" title="Adjacency matrix">adjacency matrix</a> of the graph. </p> <div class="mw-heading mw-heading2"><h2 id="Quality_measures">Quality measures</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=2" title="Edit section: Quality measures"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Many different quality measures have been defined for graph drawings, in an attempt to find objective means of evaluating their aesthetics and usability.<sup id="cite_ref-9" class="reference"><a href="#cite_note-9"><span class="cite-bracket">[</span>9<span class="cite-bracket">]</span></a></sup> In addition to guiding the choice between different layout methods for the same graph, some layout methods attempt to directly optimize these measures. </p> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:4node-digraph-embed.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/8/89/4node-digraph-embed.svg/110px-4node-digraph-embed.svg.png" decoding="async" width="110" height="125" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/8/89/4node-digraph-embed.svg/165px-4node-digraph-embed.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/8/89/4node-digraph-embed.svg/220px-4node-digraph-embed.svg.png 2x" data-file-width="141" data-file-height="160" /></a><figcaption><a href="/wiki/Planar_graph" title="Planar graph">Planar graph</a> drawn without overlapping edges</figcaption></figure> <ul><li>The <a href="/wiki/Crossing_number_(graph_theory)" title="Crossing number (graph theory)">crossing number</a> of a drawing is the number of pairs of edges that cross each other. If the graph is <a href="/wiki/Planar_graph" title="Planar graph">planar</a>, then it is often convenient to draw it without any edge intersections; that is, in this case, a graph drawing represents a <a href="/wiki/Graph_embedding" title="Graph embedding">graph embedding</a>. However, nonplanar graphs frequently arise in applications, so graph drawing algorithms must generally allow for edge crossings.<sup id="cite_ref-10" class="reference"><a href="#cite_note-10"><span class="cite-bracket">[</span>10<span class="cite-bracket">]</span></a></sup></li> <li>The <a href="/wiki/Area_(graph_drawing)" title="Area (graph drawing)">area</a> of a drawing is the size of its smallest <a href="/wiki/Bounding_box" class="mw-redirect" title="Bounding box">bounding box</a>, relative to the closest distance between any two vertices. Drawings with smaller area are generally preferable to those with larger area, because they allow the features of the drawing to be shown at greater size and therefore more legibly. The <a href="/wiki/Aspect_ratio" title="Aspect ratio">aspect ratio</a> of the bounding box may also be important.</li> <li>Symmetry display is the problem of finding <a href="/wiki/Graph_automorphism" title="Graph automorphism">symmetry groups</a> within a given graph, and finding a drawing that displays as much of the symmetry as possible. Some layout methods automatically lead to symmetric drawings; alternatively, some drawing methods start by finding symmetries in the input graph and using them to construct a drawing.<sup id="cite_ref-11" class="reference"><a href="#cite_note-11"><span class="cite-bracket">[</span>11<span class="cite-bracket">]</span></a></sup></li> <li>It is important that edges have shapes that are as simple as possible, to make it easier for the eye to follow them. In polyline drawings, the complexity of an edge may be measured by its <a href="/wiki/Bend_minimization" title="Bend minimization">number of bends</a>, and many methods aim to provide drawings with few total bends or few bends per edge. Similarly for spline curves the complexity of an edge may be measured by the number of control points on the edge.</li> <li>Several commonly used quality measures concern lengths of edges: it is generally desirable to minimize the total length of the edges as well as the maximum length of any edge. Additionally, it may be preferable for the lengths of edges to be uniform rather than highly varied.</li> <li><a href="/wiki/Angular_resolution_(graph_drawing)" title="Angular resolution (graph drawing)">Angular resolution</a> is a measure of the sharpest angles in a graph drawing. If a graph has vertices with high <a href="/wiki/Degree_(graph_theory)" title="Degree (graph theory)">degree</a> then it necessarily will have small angular resolution, but the angular resolution can be bounded below by a function of the degree.<sup id="cite_ref-FOOTNOTEPachSharir2009_12-0" class="reference"><a href="#cite_note-FOOTNOTEPachSharir2009-12"><span class="cite-bracket">[</span>12<span class="cite-bracket">]</span></a></sup></li> <li>The <a href="/wiki/Slope_number" title="Slope number">slope number</a> of a graph is the minimum number of distinct edge slopes needed in a drawing with straight line segment edges (allowing crossings). <a href="/wiki/Cubic_graph" title="Cubic graph">Cubic graphs</a> have slope number at most four, but graphs of degree five may have unbounded slope number; it remains open whether the slope number of degree-4 graphs is bounded.<sup id="cite_ref-FOOTNOTEPachSharir2009_12-1" class="reference"><a href="#cite_note-FOOTNOTEPachSharir2009-12"><span class="cite-bracket">[</span>12<span class="cite-bracket">]</span></a></sup></li></ul> <div class="mw-heading mw-heading2"><h2 id="Layout_methods">Layout methods</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=3" title="Edit section: Layout methods"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <figure class="mw-default-size mw-halign-right" typeof="mw:File/Thumb"><a href="/wiki/File:Social_Network_Analysis_Visualization.png" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/9/9b/Social_Network_Analysis_Visualization.png/220px-Social_Network_Analysis_Visualization.png" decoding="async" width="220" height="164" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/9/9b/Social_Network_Analysis_Visualization.png/330px-Social_Network_Analysis_Visualization.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/9/9b/Social_Network_Analysis_Visualization.png/440px-Social_Network_Analysis_Visualization.png 2x" data-file-width="1184" data-file-height="882" /></a><figcaption>A force-based network visualization.<sup id="cite_ref-FOOTNOTEGrandjean2014_13-0" class="reference"><a href="#cite_note-FOOTNOTEGrandjean2014-13"><span class="cite-bracket">[</span>13<span class="cite-bracket">]</span></a></sup></figcaption></figure> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Spectral_graph_drawing_of_small_world_graph.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/d/d7/Spectral_graph_drawing_of_small_world_graph.svg/220px-Spectral_graph_drawing_of_small_world_graph.svg.png" decoding="async" width="220" height="165" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/d/d7/Spectral_graph_drawing_of_small_world_graph.svg/330px-Spectral_graph_drawing_of_small_world_graph.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/d/d7/Spectral_graph_drawing_of_small_world_graph.svg/440px-Spectral_graph_drawing_of_small_world_graph.svg.png 2x" data-file-width="614" data-file-height="461" /></a><figcaption>Spectral graph layout visualization.</figcaption></figure> <p>There are many different graph layout strategies: </p> <ul><li>In <a href="/wiki/Force-based_layout" class="mw-redirect" title="Force-based layout">force-based layout</a> systems, the graph drawing software modifies an initial vertex placement by continuously moving the vertices according to a system of forces based on physical metaphors related to systems of <a href="/wiki/Spring_(device)" title="Spring (device)">springs</a> or <a href="/wiki/Molecular_mechanics" title="Molecular mechanics">molecular mechanics</a>. Typically, these systems combine attractive forces between adjacent vertices with repulsive forces between all pairs of vertices, in order to seek a layout in which edge lengths are small while vertices are well-separated. These systems may perform <a href="/wiki/Gradient_descent" title="Gradient descent">gradient descent</a> based minimization of an <a href="/wiki/Energy_function" class="mw-redirect" title="Energy function">energy function</a>, or they may translate the forces directly into velocities or accelerations for the moving vertices.<sup id="cite_ref-14" class="reference"><a href="#cite_note-14"><span class="cite-bracket">[</span>14<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Spectral_layout" title="Spectral layout">Spectral layout</a> methods use as coordinates the <a href="/wiki/Eigenvector" class="mw-redirect" title="Eigenvector">eigenvectors</a> of a <a href="/wiki/Matrix_(mathematics)" title="Matrix (mathematics)">matrix</a> such as the <a href="/wiki/Discrete_Laplace_operator" title="Discrete Laplace operator">Laplacian</a> derived from the <a href="/wiki/Adjacency_matrix" title="Adjacency matrix">adjacency matrix</a> of the graph.<sup id="cite_ref-15" class="reference"><a href="#cite_note-15"><span class="cite-bracket">[</span>15<span class="cite-bracket">]</span></a></sup></li> <li>Orthogonal layout methods, which allow the edges of the graph to run horizontally or vertically, parallel to the coordinate axes of the layout. These methods were originally designed for <a href="/wiki/VLSI" class="mw-redirect" title="VLSI">VLSI</a> and <a href="/wiki/Printed_circuit_board" title="Printed circuit board">PCB</a> layout problems but they have also been adapted for graph drawing. They typically involve a multiphase approach in which an input graph is planarized by replacing crossing points by vertices, a topological embedding of the planarized graph is found, edge orientations are chosen to minimize bends, vertices are placed consistently with these orientations, and finally a layout compaction stage reduces the area of the drawing.<sup id="cite_ref-16" class="reference"><a href="#cite_note-16"><span class="cite-bracket">[</span>16<span class="cite-bracket">]</span></a></sup></li> <li>Tree layout algorithms these show a rooted <a href="/wiki/Tree_structure" title="Tree structure">tree</a>-like formation, suitable for <a href="/wiki/Tree_(graph_theory)" title="Tree (graph theory)">trees</a>. Often, in a technique called "balloon layout", the children of each node in the tree are drawn on a circle surrounding the node, with the radii of these circles diminishing at lower levels in the tree so that these circles do not overlap.<sup id="cite_ref-17" class="reference"><a href="#cite_note-17"><span class="cite-bracket">[</span>17<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Layered_graph_drawing" title="Layered graph drawing">Layered graph drawing</a> methods (often called Sugiyama-style drawing) are best suited for <a href="/wiki/Directed_acyclic_graph" title="Directed acyclic graph">directed acyclic graphs</a> or graphs that are nearly acyclic, such as the graphs of dependencies between modules or functions in a software system. In these methods, the nodes of the graph are arranged into horizontal layers using methods such as the <a href="/wiki/Coffman%E2%80%93Graham_algorithm" title="Coffman–Graham algorithm">Coffman–Graham algorithm</a>, in such a way that most edges go downwards from one layer to the next; after this step, the nodes within each layer are arranged in order to minimize crossings.<sup id="cite_ref-18" class="reference"><a href="#cite_note-18"><span class="cite-bracket">[</span>18<span class="cite-bracket">]</span></a></sup></li></ul> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Goldner-Harary-linear.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/8/8d/Goldner-Harary-linear.svg/220px-Goldner-Harary-linear.svg.png" decoding="async" width="220" height="183" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/8/8d/Goldner-Harary-linear.svg/330px-Goldner-Harary-linear.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/8/8d/Goldner-Harary-linear.svg/440px-Goldner-Harary-linear.svg.png 2x" data-file-width="432" data-file-height="360" /></a><figcaption>Arc diagram</figcaption></figure> <ul><li><a href="/wiki/Arc_diagram" title="Arc diagram">Arc diagrams</a>, a layout style dating back to the 1960s,<sup id="cite_ref-19" class="reference"><a href="#cite_note-19"><span class="cite-bracket">[</span>19<span class="cite-bracket">]</span></a></sup> place vertices on a line; edges may be drawn as semicircles above or below the line, or as smooth curves linked together from multiple semicircles.</li> <li><a href="/wiki/Circular_layout" title="Circular layout">Circular layout</a> methods place the vertices of the graph on a circle, choosing carefully the ordering of the vertices around the circle to reduce crossings and place adjacent vertices close to each other. Edges may be drawn either as chords of the circle or as arcs inside or outside of the circle. In some cases, multiple circles may be used.<sup id="cite_ref-20" class="reference"><a href="#cite_note-20"><span class="cite-bracket">[</span>20<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Dominance_drawing" title="Dominance drawing">Dominance drawing</a> places vertices in such a way that one vertex is upwards, rightwards, or both of another if and only if it is <a href="/wiki/Reachability" title="Reachability">reachable</a> from the other vertex. In this way, the layout style makes the reachability relation of the graph visually apparent.<sup id="cite_ref-21" class="reference"><a href="#cite_note-21"><span class="cite-bracket">[</span>21<span class="cite-bracket">]</span></a></sup></li></ul> <div class="mw-heading mw-heading2"><h2 id="Application-specific_graph_drawings">Application-specific graph drawings</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=4" title="Edit section: Application-specific graph drawings"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Graphs and graph drawings arising in other areas of application include </p> <ul><li><a href="/wiki/Sociogram" title="Sociogram">Sociograms</a>, drawings of a <a href="/wiki/Social_network" title="Social network">social network</a>, as often offered by <a href="/wiki/Social_network_analysis_software" title="Social network analysis software">social network analysis software</a><sup id="cite_ref-22" class="reference"><a href="#cite_note-22"><span class="cite-bracket">[</span>22<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Hasse_diagram" title="Hasse diagram">Hasse diagrams</a>, a type of graph drawing specialized to <a href="/wiki/Partial_order" class="mw-redirect" title="Partial order">partial orders</a><sup id="cite_ref-23" class="reference"><a href="#cite_note-23"><span class="cite-bracket">[</span>23<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Dessin_d%27enfant" title="Dessin d'enfant">Dessin d'enfants</a>, a type of graph drawing used in <a href="/wiki/Algebraic_geometry" title="Algebraic geometry">algebraic geometry</a><sup id="cite_ref-FOOTNOTEZapponi2003_24-0" class="reference"><a href="#cite_note-FOOTNOTEZapponi2003-24"><span class="cite-bracket">[</span>24<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/State_diagram" title="State diagram">State diagrams</a>, graphical representations of <a href="/wiki/Finite-state_machine" title="Finite-state machine">finite-state machines</a><sup id="cite_ref-FOOTNOTEAndersonHead2006_25-0" class="reference"><a href="#cite_note-FOOTNOTEAndersonHead2006-25"><span class="cite-bracket">[</span>25<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Computer_network_diagram" title="Computer network diagram">Computer network diagrams</a>, depictions of the nodes and connections in a <a href="/wiki/Computer_network" title="Computer network">computer network</a><sup id="cite_ref-FOOTNOTEDi_BattistaRimondini2014_26-0" class="reference"><a href="#cite_note-FOOTNOTEDi_BattistaRimondini2014-26"><span class="cite-bracket">[</span>26<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Flowchart" title="Flowchart">Flowcharts</a> and <a href="/wiki/DRAKON" title="DRAKON">drakon-charts</a>, drawings in which the nodes represent the steps of an <a href="/wiki/Algorithm" title="Algorithm">algorithm</a> and the edges represent <a href="/wiki/Control_flow" title="Control flow">control flow</a> between steps.</li> <li><a href="/wiki/Data-flow_diagram" title="Data-flow diagram">Data-flow diagrams</a>, drawings in which the nodes represent the components of an <a href="/wiki/Information_system" title="Information system">information system</a> and the edges represent the movement of information from one component to another.</li> <li><a href="/wiki/Bioinformatics" title="Bioinformatics">Bioinformatics</a> including <a href="/wiki/Phylogenetic_tree" title="Phylogenetic tree">phylogenetic trees</a>, <a href="/wiki/Protein%E2%80%93protein_interaction" title="Protein–protein interaction">protein–protein interaction</a> networks, and <a href="/wiki/Metabolic_pathway" title="Metabolic pathway">metabolic pathways</a>.<sup id="cite_ref-FOOTNOTEBachmaierBrandesSchreiber2014_27-0" class="reference"><a href="#cite_note-FOOTNOTEBachmaierBrandesSchreiber2014-27"><span class="cite-bracket">[</span>27<span class="cite-bracket">]</span></a></sup></li></ul> <p>In addition, the <a href="/wiki/Placement_(electronic_design_automation)" title="Placement (electronic design automation)">placement</a> and <a href="/wiki/Routing_(electronic_design_automation)" title="Routing (electronic design automation)">routing</a> steps of <a href="/wiki/Electronic_design_automation" title="Electronic design automation">electronic design automation</a> (EDA) are similar in many ways to graph drawing, as is the problem of <a href="/wiki/Greedy_embedding" title="Greedy embedding">greedy embedding</a> in <a href="/wiki/Distributed_computing" title="Distributed computing">distributed computing</a>, and the graph drawing literature includes several results borrowed from the EDA literature. However, these problems also differ in several important ways: for instance, in EDA, area minimization and signal length are more important than aesthetics, and the routing problem in EDA may have more than two terminals per net while the analogous problem in graph drawing generally only involves pairs of vertices for each edge. </p> <div class="mw-heading mw-heading2"><h2 id="Software">Software</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=5" title="Edit section: Software"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Gephi_0.9.1_Network_Analysis_and_Visualization_Software.png" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/6/6d/Gephi_0.9.1_Network_Analysis_and_Visualization_Software.png/220px-Gephi_0.9.1_Network_Analysis_and_Visualization_Software.png" decoding="async" width="220" height="137" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/6/6d/Gephi_0.9.1_Network_Analysis_and_Visualization_Software.png/330px-Gephi_0.9.1_Network_Analysis_and_Visualization_Software.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/6/6d/Gephi_0.9.1_Network_Analysis_and_Visualization_Software.png/440px-Gephi_0.9.1_Network_Analysis_and_Visualization_Software.png 2x" data-file-width="1397" data-file-height="871" /></a><figcaption>A graph drawing interface (<a href="/wiki/Gephi" title="Gephi">Gephi</a> 0.9.1)</figcaption></figure><p>Software, systems, and providers of systems for drawing graphs include: </p><ul><li><a href="/wiki/BioFabric" title="BioFabric">BioFabric</a> open-source software for visualizing large networks by drawing nodes as horizontal lines.</li> <li><a href="/wiki/Cytoscape" title="Cytoscape">Cytoscape</a>, open-source software for visualizing molecular interaction networks</li> <li><a href="/wiki/Gephi" title="Gephi">Gephi</a>, open-source network analysis and visualization software</li> <li><a href="/wiki/Graph-tool" title="Graph-tool">graph-tool</a>, a <a href="/wiki/Free_Software" class="mw-redirect" title="Free Software">free/libre</a> <a href="/wiki/Python_(programming_language)" title="Python (programming language)">Python</a> library for analysis of graphs</li> <li><a href="/wiki/Graphviz" title="Graphviz">Graphviz</a>, an open-source graph drawing system from <a href="/wiki/AT%26T_Corporation" title="AT&T Corporation">AT&T Corporation</a><sup id="cite_ref-28" class="reference"><a href="#cite_note-28"><span class="cite-bracket">[</span>28<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Linkurious" title="Linkurious">Linkurious</a>, a commercial network analysis and visualization software for <a href="/wiki/Graph_databases" class="mw-redirect" title="Graph databases">graph databases</a></li> <li><a href="/wiki/Mathematica" class="mw-redirect" title="Mathematica">Mathematica</a>, a general-purpose computation tool that includes 2D and 3D graph visualization and graph analysis tools.<sup id="cite_ref-29" class="reference"><a href="#cite_note-29"><span class="cite-bracket">[</span>29<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Microsoft_Automatic_Graph_Layout" title="Microsoft Automatic Graph Layout">Microsoft Automatic Graph Layout</a>, open-source .NET library (formerly called GLEE) for laying out graphs<sup id="cite_ref-30" class="reference"><a href="#cite_note-30"><span class="cite-bracket">[</span>30<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/NetworkX" title="NetworkX">NetworkX</a> is a Python library for studying graphs and networks.</li> <li><a href="/wiki/Tulip_(software)" title="Tulip (software)">Tulip</a>,<sup id="cite_ref-31" class="reference"><a href="#cite_note-31"><span class="cite-bracket">[</span>31<span class="cite-bracket">]</span></a></sup> an open-source data visualization tool</li> <li><a href="/wiki/YEd" title="YEd">yEd</a>, a graph editor with graph layout functionality<sup id="cite_ref-32" class="reference"><a href="#cite_note-32"><span class="cite-bracket">[</span>32<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/PGF/TikZ" title="PGF/TikZ">PGF/TikZ</a> 3.0 with the <code>graphdrawing</code> package (requires <a href="/wiki/LuaTeX" title="LuaTeX">LuaTeX</a>).<sup id="cite_ref-33" class="reference"><a href="#cite_note-33"><span class="cite-bracket">[</span>33<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/LaNet-vi" title="LaNet-vi">LaNet-vi</a>, an open-source large network visualization software</li></ul> <div class="mw-heading mw-heading2"><h2 id="See_also">See also</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=6" title="Edit section: See also"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a href="/wiki/International_Symposium_on_Graph_Drawing" title="International Symposium on Graph Drawing">International Symposium on Graph Drawing</a></li> <li><a href="/wiki/List_of_Unified_Modeling_Language_tools" title="List of Unified Modeling Language tools">List of Unified Modeling Language tools</a></li></ul> <div class="mw-heading mw-heading2"><h2 id="References">References</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=7" title="Edit section: References"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <div class="mw-heading mw-heading3"><h3 id="Footnotes">Footnotes</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=8" title="Edit section: Footnotes"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <style data-mw-deduplicate="TemplateStyles:r1239543626">.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}</style><div class="reflist reflist-columns references-column-width" style="column-width: 30em;"> <ol class="references"> <li id="cite_note-1"><span class="mw-cite-backlink"><b><a href="#cite_ref-1">^</a></b></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, pp. vii–viii; <a href="#CITEREFHermanMelançonMarshall2000">Herman, Melançon & Marshall (2000)</a>, Section 1.1, "Typical Application Areas".</span> </li> <li id="cite_note-dett6-2"><span class="mw-cite-backlink">^ <a href="#cite_ref-dett6_2-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-dett6_2-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, p. 6.</span> </li> <li id="cite_note-dett-viii-3"><span class="mw-cite-backlink">^ <a href="#cite_ref-dett-viii_3-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-dett-viii_3-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, p. viii.</span> </li> <li id="cite_note-FOOTNOTEMisueEadesLaiSugiyama1995-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-FOOTNOTEMisueEadesLaiSugiyama1995_4-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFMisueEadesLaiSugiyama1995">Misue et al. (1995)</a>.</span> </li> <li id="cite_note-FOOTNOTEKnuth2013-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-FOOTNOTEKnuth2013_5-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFKnuth2013">Knuth (2013)</a>.</span> </li> <li id="cite_note-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-6">^</a></b></span> <span class="reference-text"><a href="#CITEREFHoltenvan_Wijk2009">Holten & van Wijk (2009)</a>; <a href="#CITEREFHoltenIsenbergvan_WijkFekete2011">Holten et al. (2011)</a>.</span> </li> <li id="cite_note-FOOTNOTEGargTamassia1995-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-FOOTNOTEGargTamassia1995_7-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFGargTamassia1995">Garg & Tamassia (1995)</a>.</span> </li> <li id="cite_note-Longabaugh_2012-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-Longabaugh_2012_8-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFLongabaugh2012">Longabaugh (2012)</a>.</span> </li> <li id="cite_note-9"><span class="mw-cite-backlink"><b><a href="#cite_ref-9">^</a></b></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, Section 2.1.2, Aesthetics, pp. 14–16; <a href="#CITEREFPurchaseCohenJames1997">Purchase, Cohen & James (1997)</a>.</span> </li> <li id="cite_note-10"><span class="mw-cite-backlink"><b><a href="#cite_ref-10">^</a></b></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, p 14.</span> </li> <li id="cite_note-11"><span class="mw-cite-backlink"><b><a href="#cite_ref-11">^</a></b></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, p. 16.</span> </li> <li id="cite_note-FOOTNOTEPachSharir2009-12"><span class="mw-cite-backlink">^ <a href="#cite_ref-FOOTNOTEPachSharir2009_12-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-FOOTNOTEPachSharir2009_12-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><a href="#CITEREFPachSharir2009">Pach & Sharir (2009)</a>.</span> </li> <li id="cite_note-FOOTNOTEGrandjean2014-13"><span class="mw-cite-backlink"><b><a href="#cite_ref-FOOTNOTEGrandjean2014_13-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFGrandjean2014">Grandjean (2014)</a>.</span> </li> <li id="cite_note-14"><span class="mw-cite-backlink"><b><a href="#cite_ref-14">^</a></b></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, Section 2.7, "The Force-Directed Approach", pp. 29–30, and Chapter 10, "Force-Directed Methods", pp. 303–326.</span> </li> <li id="cite_note-15"><span class="mw-cite-backlink"><b><a href="#cite_ref-15">^</a></b></span> <span class="reference-text"><a href="#CITEREFBeckman1994">Beckman (1994)</a>; <a href="#CITEREFKoren2005">Koren (2005)</a>.</span> </li> <li id="cite_note-16"><span class="mw-cite-backlink"><b><a href="#cite_ref-16">^</a></b></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, Chapter 5, "Flow and Orthogonal Drawings", pp. 137–170; <a href="#CITEREFEiglspergerFeketeKlau2001">Eiglsperger, Fekete & Klau (2001)</a>.</span> </li> <li id="cite_note-17"><span class="mw-cite-backlink"><b><a href="#cite_ref-17">^</a></b></span> <span class="reference-text"><a href="#CITEREFHermanMelançonMarshall2000">Herman, Melançon & Marshall (2000)</a>, Section 2.2, "Traditional Layout – An Overview".</span> </li> <li id="cite_note-18"><span class="mw-cite-backlink"><b><a href="#cite_ref-18">^</a></b></span> <span class="reference-text"><a href="#CITEREFSugiyamaTagawaToda1981">Sugiyama, Tagawa & Toda (1981)</a>; <a href="#CITEREFBastertMatuszewski2001">Bastert & Matuszewski (2001)</a>; <a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, Chapter 9, "Layered Drawings of Digraphs", pp. 265–302.</span> </li> <li id="cite_note-19"><span class="mw-cite-backlink"><b><a href="#cite_ref-19">^</a></b></span> <span class="reference-text"><a href="#CITEREFSaaty1964">Saaty (1964)</a>.</span> </li> <li id="cite_note-20"><span class="mw-cite-backlink"><b><a href="#cite_ref-20">^</a></b></span> <span class="reference-text"><a href="#CITEREFDoğrusözMaddenMadden1997">Doğrusöz, Madden & Madden (1997)</a>.</span> </li> <li id="cite_note-21"><span class="mw-cite-backlink"><b><a href="#cite_ref-21">^</a></b></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, Section 4.7, "Dominance Drawings", pp. 112–127.</span> </li> <li id="cite_note-22"><span class="mw-cite-backlink"><b><a href="#cite_ref-22">^</a></b></span> <span class="reference-text"><a href="#CITEREFScott2000">Scott (2000)</a>; <a href="#CITEREFBrandesFreemanWagner2014">Brandes, Freeman & Wagner (2014)</a>.</span> </li> <li id="cite_note-23"><span class="mw-cite-backlink"><b><a href="#cite_ref-23">^</a></b></span> <span class="reference-text"><a href="#CITEREFDi_BattistaEadesTamassiaTollis1998">Di Battista et al. (1998)</a>, pp. 15–16, and Chapter 6, "Flow and Upward Planarity", pp. 171–214; <a href="#CITEREFFreese2004">Freese (2004)</a>.</span> </li> <li id="cite_note-FOOTNOTEZapponi2003-24"><span class="mw-cite-backlink"><b><a href="#cite_ref-FOOTNOTEZapponi2003_24-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFZapponi2003">Zapponi (2003)</a>.</span> </li> <li id="cite_note-FOOTNOTEAndersonHead2006-25"><span class="mw-cite-backlink"><b><a href="#cite_ref-FOOTNOTEAndersonHead2006_25-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFAndersonHead2006">Anderson & Head (2006)</a>.</span> </li> <li id="cite_note-FOOTNOTEDi_BattistaRimondini2014-26"><span class="mw-cite-backlink"><b><a href="#cite_ref-FOOTNOTEDi_BattistaRimondini2014_26-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFDi_BattistaRimondini2014">Di Battista & Rimondini (2014)</a>.</span> </li> <li id="cite_note-FOOTNOTEBachmaierBrandesSchreiber2014-27"><span class="mw-cite-backlink"><b><a href="#cite_ref-FOOTNOTEBachmaierBrandesSchreiber2014_27-0">^</a></b></span> <span class="reference-text"><a href="#CITEREFBachmaierBrandesSchreiber2014">Bachmaier, Brandes & Schreiber (2014)</a>.</span> </li> <li id="cite_note-28"><span class="mw-cite-backlink"><b><a href="#cite_ref-28">^</a></b></span> <span class="reference-text">"Graphviz and Dynagraph – Static and Dynamic Graph Drawing Tools", by John Ellson, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, and Gordon Woodhull, in <a href="#CITEREFJüngerMutzel2004">Jünger & Mutzel (2004)</a>.</span> </li> <li id="cite_note-29"><span class="mw-cite-backlink"><b><a href="#cite_ref-29">^</a></b></span> <span class="reference-text"><style data-mw-deduplicate="TemplateStyles:r1238218222">.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/6/65/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/d/d6/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/a/aa/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/4/4c/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}</style><cite class="citation cs2"><a rel="nofollow" class="external text" href="http://reference.wolfram.com/mathematica/tutorial/GraphDrawingIntroduction.html">"Introduction to graph drawing"</a>, <i>Wolfram Language & System Documentation Center</i><span class="reference-accessdate">, retrieved <span class="nowrap">2024-03-21</span></span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Wolfram+Language+%26+System+Documentation+Center&rft.atitle=Introduction+to+graph+drawing&rft_id=http%3A%2F%2Freference.wolfram.com%2Fmathematica%2Ftutorial%2FGraphDrawingIntroduction.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span></span> </li> <li id="cite_note-30"><span class="mw-cite-backlink"><b><a href="#cite_ref-30">^</a></b></span> <span class="reference-text"><a href="#CITEREFNachmansonRobertsonLee2008">Nachmanson, Robertson & Lee (2008)</a>.</span> </li> <li id="cite_note-31"><span class="mw-cite-backlink"><b><a href="#cite_ref-31">^</a></b></span> <span class="reference-text">"Tulip – A Huge Graph Visualization Framework", by David Auber, in <a href="#CITEREFJüngerMutzel2004">Jünger & Mutzel (2004)</a>.</span> </li> <li id="cite_note-32"><span class="mw-cite-backlink"><b><a href="#cite_ref-32">^</a></b></span> <span class="reference-text">"yFiles – Visualization and Automatic Layout of Graphs", by Roland Wiese, Markus Eiglsperger, and Michael Kaufmann, in <a href="#CITEREFJüngerMutzel2004">Jünger & Mutzel (2004)</a>.</span> </li> <li id="cite_note-33"><span class="mw-cite-backlink"><b><a href="#cite_ref-33">^</a></b></span> <span class="reference-text"><a href="#CITEREFTantau2013">Tantau (2013)</a>; see also the older <a rel="nofollow" class="external text" href="http://www.tcs.uni-luebeck.de/downloads/mitarbeiter/tantau/2012-gd-presentation.pdf">GD 2012 presentation</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20160527034523/http://www.tcs.uni-luebeck.de/downloads/mitarbeiter/tantau/2012-gd-presentation.pdf">Archived</a> 2016-05-27 at the <a href="/wiki/Wayback_Machine" title="Wayback Machine">Wayback Machine</a></span> </li> </ol></div> <div class="mw-heading mw-heading3"><h3 id="General_references">General references</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=9" title="Edit section: General references"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <style data-mw-deduplicate="TemplateStyles:r1239549316">.mw-parser-output .refbegin{margin-bottom:0.5em}.mw-parser-output .refbegin-hanging-indents>ul{margin-left:0}.mw-parser-output .refbegin-hanging-indents>ul>li{margin-left:0;padding-left:3.2em;text-indent:-3.2em}.mw-parser-output .refbegin-hanging-indents ul,.mw-parser-output .refbegin-hanging-indents ul li{list-style:none}@media(max-width:720px){.mw-parser-output .refbegin-hanging-indents>ul>li{padding-left:1.6em;text-indent:-1.6em}}.mw-parser-output .refbegin-columns{margin-top:0.3em}.mw-parser-output .refbegin-columns ul{margin-top:0}.mw-parser-output .refbegin-columns li{page-break-inside:avoid;break-inside:avoid-column}@media screen{.mw-parser-output .refbegin{font-size:90%}}</style><div class="refbegin refbegin-columns references-column-width" style="column-width: 30em"> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDi_BattistaEadesTamassiaTollis1998" class="citation cs2">Di Battista, Giuseppe; <a href="/wiki/Peter_Eades" title="Peter Eades">Eades, Peter</a>; <a href="/wiki/Roberto_Tamassia" title="Roberto Tamassia">Tamassia, Roberto</a>; Tollis, Ioannis G. (1998), <i>Graph Drawing: Algorithms for the Visualization of Graphs</i>, <a href="/wiki/Prentice_Hall" title="Prentice Hall">Prentice Hall</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-13-301615-4" title="Special:BookSources/978-0-13-301615-4"><bdi>978-0-13-301615-4</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Graph+Drawing%3A+Algorithms+for+the+Visualization+of+Graphs&rft.pub=Prentice+Hall&rft.date=1998&rft.isbn=978-0-13-301615-4&rft.aulast=Di+Battista&rft.aufirst=Giuseppe&rft.au=Eades%2C+Peter&rft.au=Tamassia%2C+Roberto&rft.au=Tollis%2C+Ioannis+G.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHermanMelançonMarshall2000" class="citation cs2">Herman, Ivan; Melançon, Guy; Marshall, M. Scott (2000), "Graph Visualization and Navigation in Information Visualization: A Survey", <i>IEEE Transactions on Visualization and Computer Graphics</i>, <b>6</b> (1): 24–43, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2F2945.841119">10.1109/2945.841119</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=IEEE+Transactions+on+Visualization+and+Computer+Graphics&rft.atitle=Graph+Visualization+and+Navigation+in+Information+Visualization%3A+A+Survey&rft.volume=6&rft.issue=1&rft.pages=24-43&rft.date=2000&rft_id=info%3Adoi%2F10.1109%2F2945.841119&rft.aulast=Herman&rft.aufirst=Ivan&rft.au=Melan%C3%A7on%2C+Guy&rft.au=Marshall%2C+M.+Scott&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJüngerMutzel2004" class="citation cs2">Jünger, Michael; <a href="/wiki/Petra_Mutzel" title="Petra Mutzel">Mutzel, Petra</a> (2004), <i>Graph Drawing Software</i>, Springer-Verlag, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-3-540-00881-1" title="Special:BookSources/978-3-540-00881-1"><bdi>978-3-540-00881-1</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Graph+Drawing+Software&rft.pub=Springer-Verlag&rft.date=2004&rft.isbn=978-3-540-00881-1&rft.aulast=J%C3%BCnger&rft.aufirst=Michael&rft.au=Mutzel%2C+Petra&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li></ul> </div> <div class="mw-heading mw-heading3"><h3 id="Specialized_subtopics">Specialized subtopics</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=10" title="Edit section: Specialized subtopics"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1239549316"><div class="refbegin refbegin-columns references-column-width" style="column-width: 30em"> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAndersonHead2006" class="citation cs2">Anderson, James Andrew; Head, Thomas J. (2006), <a rel="nofollow" class="external text" href="https://books.google.com/books?id=ikS8BLdLDxIC&pg=PA38"><i>Automata Theory with Modern Applications</i></a>, Cambridge University Press, pp. 38–41, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-521-84887-9" title="Special:BookSources/978-0-521-84887-9"><bdi>978-0-521-84887-9</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Automata+Theory+with+Modern+Applications&rft.pages=38-41&rft.pub=Cambridge+University+Press&rft.date=2006&rft.isbn=978-0-521-84887-9&rft.aulast=Anderson&rft.aufirst=James+Andrew&rft.au=Head%2C+Thomas+J.&rft_id=https%3A%2F%2Fbooks.google.com%2Fbooks%3Fid%3DikS8BLdLDxIC%26pg%3DPA38&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBachmaierBrandesSchreiber2014" class="citation cs2">Bachmaier, Christian; <a href="/wiki/Ulrik_Brandes" title="Ulrik Brandes">Brandes, Ulrik</a>; Schreiber, Falk (2014), "Biological Networks", in <a href="/wiki/Roberto_Tamassia" title="Roberto Tamassia">Tamassia, Roberto</a> (ed.), <i>Handbook of Graph Drawing and Visualization</i>, CRC Press, pp. 621–651</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Biological+Networks&rft.btitle=Handbook+of+Graph+Drawing+and+Visualization&rft.pages=621-651&rft.pub=CRC+Press&rft.date=2014&rft.aulast=Bachmaier&rft.aufirst=Christian&rft.au=Brandes%2C+Ulrik&rft.au=Schreiber%2C+Falk&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBastertMatuszewski2001" class="citation cs2">Bastert, Oliver; Matuszewski, Christian (2001), "Layered drawings of digraphs", in Kaufmann, Michael; <a href="/wiki/Dorothea_Wagner" title="Dorothea Wagner">Wagner, Dorothea</a> (eds.), <i>Drawing Graphs: Methods and Models</i>, Lecture Notes in Computer Science, vol. 2025, Springer-Verlag, pp. 87–120, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F3-540-44969-8_5">10.1007/3-540-44969-8_5</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-3-540-42062-0" title="Special:BookSources/978-3-540-42062-0"><bdi>978-3-540-42062-0</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Layered+drawings+of+digraphs&rft.btitle=Drawing+Graphs%3A+Methods+and+Models&rft.series=Lecture+Notes+in+Computer+Science&rft.pages=87-120&rft.pub=Springer-Verlag&rft.date=2001&rft_id=info%3Adoi%2F10.1007%2F3-540-44969-8_5&rft.isbn=978-3-540-42062-0&rft.aulast=Bastert&rft.aufirst=Oliver&rft.au=Matuszewski%2C+Christian&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBeckman1994" class="citation cs2">Beckman, Brian (1994), <a rel="nofollow" class="external text" href="http://research.microsoft.com/apps/pubs/default.aspx?id=69611"><i>Theory of Spectral Graph Layout</i></a>, Tech. Report MSR-TR-94-04, Microsoft Research, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20160401054322/http://research.microsoft.com/apps/pubs/default.aspx?id=69611">archived</a> from the original on 2016-04-01<span class="reference-accessdate">, retrieved <span class="nowrap">2011-09-17</span></span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Theory+of+Spectral+Graph+Layout&rft.series=Tech.+Report+MSR-TR-94-04&rft.pub=Microsoft+Research&rft.date=1994&rft.aulast=Beckman&rft.aufirst=Brian&rft_id=http%3A%2F%2Fresearch.microsoft.com%2Fapps%2Fpubs%2Fdefault.aspx%3Fid%3D69611&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBrandesFreemanWagner2014" class="citation cs2"><a href="/wiki/Ulrik_Brandes" title="Ulrik Brandes">Brandes, Ulrik</a>; Freeman, Linton C.; <a href="/wiki/Dorothea_Wagner" title="Dorothea Wagner">Wagner, Dorothea</a> (2014), "Social Networks", in <a href="/wiki/Roberto_Tamassia" title="Roberto Tamassia">Tamassia, Roberto</a> (ed.), <i>Handbook of Graph Drawing and Visualization</i>, CRC Press, pp. 805–839</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Social+Networks&rft.btitle=Handbook+of+Graph+Drawing+and+Visualization&rft.pages=805-839&rft.pub=CRC+Press&rft.date=2014&rft.aulast=Brandes&rft.aufirst=Ulrik&rft.au=Freeman%2C+Linton+C.&rft.au=Wagner%2C+Dorothea&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDi_BattistaRimondini2014" class="citation cs2">Di Battista, Giuseppe; Rimondini, Massimo (2014), "Computer Networks", in <a href="/wiki/Roberto_Tamassia" title="Roberto Tamassia">Tamassia, Roberto</a> (ed.), <i>Handbook of Graph Drawing and Visualization</i>, CRC Press, pp. 763–803</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Computer+Networks&rft.btitle=Handbook+of+Graph+Drawing+and+Visualization&rft.pages=763-803&rft.pub=CRC+Press&rft.date=2014&rft.aulast=Di+Battista&rft.aufirst=Giuseppe&rft.au=Rimondini%2C+Massimo&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDoğrusözMaddenMadden1997" class="citation cs2">Doğrusöz, Uğur; Madden, Brendan; Madden, Patrick (1997), "Circular layout in the Graph Layout toolkit", in North, Stephen (ed.), <a href="/wiki/International_Symposium_on_Graph_Drawing" title="International Symposium on Graph Drawing"><i>Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996, Proceedings</i></a>, Lecture Notes in Computer Science, vol. 1190, Springer-Verlag, pp. 92–100, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F3-540-62495-3_40">10.1007/3-540-62495-3_40</a></span>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-3-540-62495-0" title="Special:BookSources/978-3-540-62495-0"><bdi>978-3-540-62495-0</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Circular+layout+in+the+Graph+Layout+toolkit&rft.btitle=Symposium+on+Graph+Drawing%2C+GD+%2796+Berkeley%2C+California%2C+USA%2C+September+18%E2%80%9320%2C+1996%2C+Proceedings&rft.series=Lecture+Notes+in+Computer+Science&rft.pages=92-100&rft.pub=Springer-Verlag&rft.date=1997&rft_id=info%3Adoi%2F10.1007%2F3-540-62495-3_40&rft.isbn=978-3-540-62495-0&rft.aulast=Do%C4%9Frus%C3%B6z&rft.aufirst=U%C4%9Fur&rft.au=Madden%2C+Brendan&rft.au=Madden%2C+Patrick&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFEiglspergerFeketeKlau2001" class="citation cs2">Eiglsperger, Markus; Fekete, Sándor; Klau, Gunnar (2001), "Orthogonal graph drawing", in Kaufmann, Michael; <a href="/wiki/Dorothea_Wagner" title="Dorothea Wagner">Wagner, Dorothea</a> (eds.), <i>Drawing Graphs</i>, Lecture Notes in Computer Science, vol. 2025, Springer Berlin / Heidelberg, pp. 121–171, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F3-540-44969-8_6">10.1007/3-540-44969-8_6</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-3-540-42062-0" title="Special:BookSources/978-3-540-42062-0"><bdi>978-3-540-42062-0</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Orthogonal+graph+drawing&rft.btitle=Drawing+Graphs&rft.series=Lecture+Notes+in+Computer+Science&rft.pages=121-171&rft.pub=Springer+Berlin+%2F+Heidelberg&rft.date=2001&rft_id=info%3Adoi%2F10.1007%2F3-540-44969-8_6&rft.isbn=978-3-540-42062-0&rft.aulast=Eiglsperger&rft.aufirst=Markus&rft.au=Fekete%2C+S%C3%A1ndor&rft.au=Klau%2C+Gunnar&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFFreese2004" class="citation cs2">Freese, Ralph (2004), "Automated lattice drawing", in Eklund, Peter (ed.), <a rel="nofollow" class="external text" href="http://www.math.hawaii.edu/~ralph/Preprints/latdrawing.pdf"><i>Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings</i></a> <span class="cs1-format">(PDF)</span>, Lecture Notes in Computer Science, vol. 2961, Springer-Verlag, pp. 589–590, <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.6245">10.1.1.69.6245</a></span>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F978-3-540-24651-0_12">10.1007/978-3-540-24651-0_12</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-3-540-21043-6" title="Special:BookSources/978-3-540-21043-6"><bdi>978-3-540-21043-6</bdi></a>, <a rel="nofollow" class="external text" href="http://arquivo.pt/wayback/20160314184411/http://www.math.hawaii.edu/~ralph/Preprints/latdrawing.pdf">archived</a> <span class="cs1-format">(PDF)</span> from the original on 2016-03-14<span class="reference-accessdate">, retrieved <span class="nowrap">2011-09-17</span></span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Automated+lattice+drawing&rft.btitle=Concept+Lattices%3A+Second+International+Conference+on+Formal+Concept+Analysis%2C+ICFCA+2004%2C+Sydney%2C+Australia%2C+February+23-26%2C+2004%2C+Proceedings&rft.series=Lecture+Notes+in+Computer+Science&rft.pages=589-590&rft.pub=Springer-Verlag&rft.date=2004&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.69.6245%23id-name%3DCiteSeerX&rft_id=info%3Adoi%2F10.1007%2F978-3-540-24651-0_12&rft.isbn=978-3-540-21043-6&rft.aulast=Freese&rft.aufirst=Ralph&rft_id=http%3A%2F%2Fwww.math.hawaii.edu%2F~ralph%2FPreprints%2Flatdrawing.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGargTamassia1995" class="citation cs2">Garg, Ashim; Tamassia, Roberto (1995), "Upward planarity testing", <i><a href="/wiki/Order_(journal)" title="Order (journal)">Order</a></i>, <b>12</b> (2): 109–133, <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2237">10.1.1.10.2237</a></span>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2FBF01108622">10.1007/BF01108622</a>, <a href="/wiki/MR_(identifier)" class="mw-redirect" title="MR (identifier)">MR</a> <a rel="nofollow" class="external text" href="https://mathscinet.ams.org/mathscinet-getitem?mr=1354797">1354797</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:14183717">14183717</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Order&rft.atitle=Upward+planarity+testing&rft.volume=12&rft.issue=2&rft.pages=109-133&rft.date=1995&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.10.2237%23id-name%3DCiteSeerX&rft_id=https%3A%2F%2Fmathscinet.ams.org%2Fmathscinet-getitem%3Fmr%3D1354797%23id-name%3DMR&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A14183717%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1007%2FBF01108622&rft.aulast=Garg&rft.aufirst=Ashim&rft.au=Tamassia%2C+Roberto&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGrandjean2014" class="citation cs2">Grandjean, Martin (2014), <a rel="nofollow" class="external text" href="http://www.cairn.info/resume.php?ID_ARTICLE=LCN_103_0037">"La connaissance est un réseau"</a>, <i>Les Cahiers du Numérique</i>, <b>10</b> (3): 37–54, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.3166%2Flcn.10.3.37-54">10.3166/lcn.10.3.37-54</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20150627140457/http://www.cairn.info/resume.php?ID_ARTICLE=LCN_103_0037">archived</a> from the original on 2015-06-27<span class="reference-accessdate">, retrieved <span class="nowrap">2014-10-15</span></span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Les+Cahiers+du+Num%C3%A9rique&rft.atitle=La+connaissance+est+un+r%C3%A9seau&rft.volume=10&rft.issue=3&rft.pages=37-54&rft.date=2014&rft_id=info%3Adoi%2F10.3166%2Flcn.10.3.37-54&rft.aulast=Grandjean&rft.aufirst=Martin&rft_id=http%3A%2F%2Fwww.cairn.info%2Fresume.php%3FID_ARTICLE%3DLCN_103_0037&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHoltenIsenbergvan_WijkFekete2011" class="citation cs2">Holten, Danny; <a href="/wiki/Petra_Isenberg" title="Petra Isenberg">Isenberg, Petra</a>; <a href="/wiki/Jack_van_Wijk" title="Jack van Wijk">van Wijk, Jarke J.</a>; Fekete, Jean-Daniel (2011), "An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs", <a rel="nofollow" class="external text" href="http://www.lri.fr/~isenberg/publications/papers/Holten_2011_AEP.pdf"><i>IEEE Pacific Visualization Symposium (PacificVis 2011)</i></a> <span class="cs1-format">(PDF)</span>, pp. 195–202, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FPACIFICVIS.2011.5742390">10.1109/PACIFICVIS.2011.5742390</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-1-61284-935-5" title="Special:BookSources/978-1-61284-935-5"><bdi>978-1-61284-935-5</bdi></a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:16526781">16526781</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20160411130015/https://www.lri.fr/~isenberg/publications/papers/Holten_2011_AEP.pdf">archived</a> <span class="cs1-format">(PDF)</span> from the original on 2016-04-11<span class="reference-accessdate">, retrieved <span class="nowrap">2011-09-29</span></span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=An+extended+evaluation+of+the+readability+of+tapered%2C+animated%2C+and+textured+directed-edge+representations+in+node-link+graphs&rft.btitle=IEEE+Pacific+Visualization+Symposium+%28PacificVis+2011%29&rft.pages=195-202&rft.date=2011&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A16526781%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1109%2FPACIFICVIS.2011.5742390&rft.isbn=978-1-61284-935-5&rft.aulast=Holten&rft.aufirst=Danny&rft.au=Isenberg%2C+Petra&rft.au=van+Wijk%2C+Jarke+J.&rft.au=Fekete%2C+Jean-Daniel&rft_id=http%3A%2F%2Fwww.lri.fr%2F~isenberg%2Fpublications%2Fpapers%2FHolten_2011_AEP.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHoltenvan_Wijk2009" class="citation cs2">Holten, Danny; <a href="/wiki/Jack_van_Wijk" title="Jack van Wijk">van Wijk, Jarke J.</a> (2009), "A user study on visualizing directed edges in graphs", <a rel="nofollow" class="external text" href="https://web.archive.org/web/20111106004500/http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf"><i>Proceedings of the 27th International Conference on Human Factors in Computing Systems (CHI '09)</i></a> <span class="cs1-format">(PDF)</span>, pp. 2299–2308, <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.5461">10.1.1.212.5461</a></span>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F1518701.1519054">10.1145/1518701.1519054</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/9781605582467" title="Special:BookSources/9781605582467"><bdi>9781605582467</bdi></a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:9725345">9725345</a>, archived from <a rel="nofollow" class="external text" href="http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf">the original</a> <span class="cs1-format">(PDF)</span> on 2011-11-06</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=A+user+study+on+visualizing+directed+edges+in+graphs&rft.btitle=Proceedings+of+the+27th+International+Conference+on+Human+Factors+in+Computing+Systems+%28CHI+%2709%29&rft.pages=2299-2308&rft.date=2009&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.212.5461%23id-name%3DCiteSeerX&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A9725345%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1145%2F1518701.1519054&rft.isbn=9781605582467&rft.aulast=Holten&rft.aufirst=Danny&rft.au=van+Wijk%2C+Jarke+J.&rft_id=http%3A%2F%2Fwww.win.tue.nl%2F~dholten%2Fpapers%2Fdirected_edges_chi.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKnuth2013" class="citation cs2"><a href="/wiki/Donald_Knuth" title="Donald Knuth">Knuth, Donald E.</a> (2013), "Two thousand years of combinatorics", in Wilson, Robin; Watkins, John J. (eds.), <i>Combinatorics: Ancient and Modern</i>, Oxford University Press, pp. 7–37</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Two+thousand+years+of+combinatorics&rft.btitle=Combinatorics%3A+Ancient+and+Modern&rft.pages=7-37&rft.pub=Oxford+University+Press&rft.date=2013&rft.aulast=Knuth&rft.aufirst=Donald+E.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKoren2005" class="citation cs2">Koren, Yehuda (2005), "Drawing graphs by eigenvectors: theory and practice", <i>Computers & Mathematics with Applications</i>, <b>49</b> (11–12): 1867–1888, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1016%2Fj.camwa.2004.08.015">10.1016/j.camwa.2004.08.015</a></span>, <a href="/wiki/MR_(identifier)" class="mw-redirect" title="MR (identifier)">MR</a> <a rel="nofollow" class="external text" href="https://mathscinet.ams.org/mathscinet-getitem?mr=2154691">2154691</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Computers+%26+Mathematics+with+Applications&rft.atitle=Drawing+graphs+by+eigenvectors%3A+theory+and+practice&rft.volume=49&rft.issue=11%E2%80%9312&rft.pages=1867-1888&rft.date=2005&rft_id=info%3Adoi%2F10.1016%2Fj.camwa.2004.08.015&rft_id=https%3A%2F%2Fmathscinet.ams.org%2Fmathscinet-getitem%3Fmr%3D2154691%23id-name%3DMR&rft.aulast=Koren&rft.aufirst=Yehuda&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLongabaugh2012" class="citation cs2">Longabaugh, William (2012), "Combing the hairball with BioFabric: a new approach for visualization of large networks", <i>BMC Bioinformatics</i>, <b>13</b>: 275, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1186%2F1471-2105-13-275">10.1186/1471-2105-13-275</a></span>, <a href="/wiki/PMC_(identifier)" class="mw-redirect" title="PMC (identifier)">PMC</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3574047">3574047</a></span>, <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/23102059">23102059</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=BMC+Bioinformatics&rft.atitle=Combing+the+hairball+with+BioFabric%3A+a+new+approach+for+visualization+of+large+networks&rft.volume=13&rft.pages=275&rft.date=2012&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC3574047%23id-name%3DPMC&rft_id=info%3Apmid%2F23102059&rft_id=info%3Adoi%2F10.1186%2F1471-2105-13-275&rft.aulast=Longabaugh&rft.aufirst=William&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMaddenMaddenPowersHimsolt1996" class="citation cs2">Madden, Brendan; Madden, Patrick; Powers, Steve; Himsolt, Michael (1996), "Portable graph layout and editing", in Brandenburg, Franz J. (ed.), <a href="/wiki/International_Symposium_on_Graph_Drawing" title="International Symposium on Graph Drawing"><i>Graph Drawing: Symposium on Graph Drawing, GD '95, Passau, Germany, September 20–22, 1995, Proceedings</i></a>, Lecture Notes in Computer Science, vol. 1027, Springer-Verlag, pp. 385–395, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1007%2FBFb0021822">10.1007/BFb0021822</a></span>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-3-540-60723-6" title="Special:BookSources/978-3-540-60723-6"><bdi>978-3-540-60723-6</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Portable+graph+layout+and+editing&rft.btitle=Graph+Drawing%3A+Symposium+on+Graph+Drawing%2C+GD+%2795%2C+Passau%2C+Germany%2C+September+20%E2%80%9322%2C+1995%2C+Proceedings&rft.series=Lecture+Notes+in+Computer+Science&rft.pages=385-395&rft.pub=Springer-Verlag&rft.date=1996&rft_id=info%3Adoi%2F10.1007%2FBFb0021822&rft.isbn=978-3-540-60723-6&rft.aulast=Madden&rft.aufirst=Brendan&rft.au=Madden%2C+Patrick&rft.au=Powers%2C+Steve&rft.au=Himsolt%2C+Michael&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMisueEadesLaiSugiyama1995" class="citation cs2">Misue, K.; Eades, P.; Lai, W.; Sugiyama, K. (1995), "Layout Adjustment and the Mental Map", <i>Journal of Visual Languages & Computing</i>, <b>6</b> (2): 183–210, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1006%2Fjvlc.1995.1010">10.1006/jvlc.1995.1010</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Visual+Languages+%26+Computing&rft.atitle=Layout+Adjustment+and+the+Mental+Map&rft.volume=6&rft.issue=2&rft.pages=183-210&rft.date=1995&rft_id=info%3Adoi%2F10.1006%2Fjvlc.1995.1010&rft.aulast=Misue&rft.aufirst=K.&rft.au=Eades%2C+P.&rft.au=Lai%2C+W.&rft.au=Sugiyama%2C+K.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNachmansonRobertsonLee2008" class="citation cs2">Nachmanson, Lev; Robertson, George; <a href="/wiki/Bongshin_Lee" title="Bongshin Lee">Lee, Bongshin</a> (2008), "Drawing Graphs with GLEE", in <a href="/wiki/Seok-Hee_Hong" title="Seok-Hee Hong">Hong, Seok-Hee</a>; <a href="/wiki/Takao_Nishizeki" title="Takao Nishizeki">Nishizeki, Takao</a>; Quan, Wu (eds.), <a href="/wiki/International_Symposium_on_Graph_Drawing" title="International Symposium on Graph Drawing"><i>Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24–26, 2007, Revised Papers</i></a>, Lecture Notes in Computer Science, vol. 4875, Springer-Verlag, pp. 389–394, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F978-3-540-77537-9_38">10.1007/978-3-540-77537-9_38</a></span>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-3-540-77536-2" title="Special:BookSources/978-3-540-77536-2"><bdi>978-3-540-77536-2</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Drawing+Graphs+with+GLEE&rft.btitle=Graph+Drawing%2C+15th+International+Symposium%2C+GD+2007%2C+Sydney%2C+Australia%2C+September+24%E2%80%9326%2C+2007%2C+Revised+Papers&rft.series=Lecture+Notes+in+Computer+Science&rft.pages=389-394&rft.pub=Springer-Verlag&rft.date=2008&rft_id=info%3Adoi%2F10.1007%2F978-3-540-77537-9_38&rft.isbn=978-3-540-77536-2&rft.aulast=Nachmanson&rft.aufirst=Lev&rft.au=Robertson%2C+George&rft.au=Lee%2C+Bongshin&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPachSharir2009" class="citation cs2"><a href="/wiki/J%C3%A1nos_Pach" title="János Pach">Pach, János</a>; <a href="/wiki/Micha_Sharir" title="Micha Sharir">Sharir, Micha</a> (2009), "5.5 Angular resolution and slopes", <i>Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures</i>, Mathematical Surveys and Monographs, vol. 152, <a href="/wiki/American_Mathematical_Society" title="American Mathematical Society">American Mathematical Society</a>, pp. 126–127</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=5.5+Angular+resolution+and+slopes&rft.btitle=Combinatorial+Geometry+and+Its+Algorithmic+Applications%3A+The+Alcal%C3%A1+Lectures&rft.series=Mathematical+Surveys+and+Monographs&rft.pages=126-127&rft.pub=American+Mathematical+Society&rft.date=2009&rft.aulast=Pach&rft.aufirst=J%C3%A1nos&rft.au=Sharir%2C+Micha&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPurchaseCohenJames1997" class="citation cs2"><a href="/wiki/Helen_Purchase" title="Helen Purchase">Purchase, H. C.</a>; Cohen, R. F.; James, M. I. (1997), "An experimental study of the basis for graph drawing algorithms", <i>Journal of Experimental Algorithmics</i>, <b>2</b>, Article 4, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F264216.264222">10.1145/264216.264222</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:22076200">22076200</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Experimental+Algorithmics&rft.atitle=An+experimental+study+of+the+basis+for+graph+drawing+algorithms&rft.volume=2&rft.pages=Article+4&rft.date=1997&rft_id=info%3Adoi%2F10.1145%2F264216.264222&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A22076200%23id-name%3DS2CID&rft.aulast=Purchase&rft.aufirst=H.+C.&rft.au=Cohen%2C+R.+F.&rft.au=James%2C+M.+I.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSaaty1964" class="citation cs2"><a href="/wiki/Thomas_L._Saaty" title="Thomas L. Saaty">Saaty, Thomas L.</a> (1964), <a rel="nofollow" class="external text" href="https://www.pnas.org/doi/abs/10.1073/pnas.52.3.688">"The minimum number of intersections in complete graphs"</a>, <i>Proc. Natl. Acad. Sci. U.S.A.</i>, <b>52</b> (3): 688–690, <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/1964PNAS...52..688S">1964PNAS...52..688S</a></span>, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1073%2Fpnas.52.3.688">10.1073/pnas.52.3.688</a></span>, <a href="/wiki/PMC_(identifier)" class="mw-redirect" title="PMC (identifier)">PMC</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC300329">300329</a></span>, <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/16591215">16591215</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Proc.+Natl.+Acad.+Sci.+U.S.A.&rft.atitle=The+minimum+number+of+intersections+in+complete+graphs&rft.volume=52&rft.issue=3&rft.pages=688-690&rft.date=1964&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC300329%23id-name%3DPMC&rft_id=info%3Apmid%2F16591215&rft_id=info%3Adoi%2F10.1073%2Fpnas.52.3.688&rft_id=info%3Abibcode%2F1964PNAS...52..688S&rft.aulast=Saaty&rft.aufirst=Thomas+L.&rft_id=https%3A%2F%2Fwww.pnas.org%2Fdoi%2Fabs%2F10.1073%2Fpnas.52.3.688&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFScott2000" class="citation cs2">Scott, John (2000), "Sociograms and Graph Theory", <a rel="nofollow" class="external text" href="https://books.google.com/books?id=Ww3_bKcz6kgC&pg=PA"><i>Social network analysis: a handbook</i></a> (2nd ed.), Sage, pp. 64–69, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-0-7619-6339-4" title="Special:BookSources/978-0-7619-6339-4"><bdi>978-0-7619-6339-4</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.atitle=Sociograms+and+Graph+Theory&rft.btitle=Social+network+analysis%3A+a+handbook&rft.pages=64-69&rft.edition=2nd&rft.pub=Sage&rft.date=2000&rft.isbn=978-0-7619-6339-4&rft.aulast=Scott&rft.aufirst=John&rft_id=https%3A%2F%2Fbooks.google.com%2Fbooks%3Fid%3DWw3_bKcz6kgC%26pg%3DPA&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSugiyamaTagawaToda1981" class="citation cs2 cs1-prop-long-vol"><a href="/wiki/Kozo_Sugiyama" title="Kozo Sugiyama">Sugiyama, Kozo</a>; Tagawa, Shôjirô; Toda, Mitsuhiko (1981), "Methods for visual understanding of hierarchical system structures", <i><a href="/wiki/IEEE_Systems,_Man,_and_Cybernetics_Society" title="IEEE Systems, Man, and Cybernetics Society">IEEE Transactions on Systems, Man, and Cybernetics</a></i>, SMC-11 (2): 109–125, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FTSMC.1981.4308636">10.1109/TSMC.1981.4308636</a>, <a href="/wiki/MR_(identifier)" class="mw-redirect" title="MR (identifier)">MR</a> <a rel="nofollow" class="external text" href="https://mathscinet.ams.org/mathscinet-getitem?mr=0611436">0611436</a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:8367756">8367756</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=IEEE+Transactions+on+Systems%2C+Man%2C+and+Cybernetics&rft.atitle=Methods+for+visual+understanding+of+hierarchical+system+structures&rft.volume=SMC-11&rft.issue=2&rft.pages=109-125&rft.date=1981&rft_id=https%3A%2F%2Fmathscinet.ams.org%2Fmathscinet-getitem%3Fmr%3D0611436%23id-name%3DMR&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A8367756%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1109%2FTSMC.1981.4308636&rft.aulast=Sugiyama&rft.aufirst=Kozo&rft.au=Tagawa%2C+Sh%C3%B4jir%C3%B4&rft.au=Toda%2C+Mitsuhiko&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTantau2013" class="citation cs2">Tantau, Till (2013), "Graph Drawing in TikZ", <i><a href="/wiki/Journal_of_Graph_Algorithms_and_Applications" title="Journal of Graph Algorithms and Applications">Journal of Graph Algorithms and Applications</a></i>, <b>17</b> (4): 495–513, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.7155%2Fjgaa.00301">10.7155/jgaa.00301</a></span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+of+Graph+Algorithms+and+Applications&rft.atitle=Graph+Drawing+in+TikZ&rft.volume=17&rft.issue=4&rft.pages=495-513&rft.date=2013&rft_id=info%3Adoi%2F10.7155%2Fjgaa.00301&rft.aulast=Tantau&rft.aufirst=Till&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFZapponi2003" class="citation cs2">Zapponi, Leonardo (August 2003), <a rel="nofollow" class="external text" href="https://www.ams.org/notices/200307/what-is.pdf">"What is a Dessin d'Enfant"</a> <span class="cs1-format">(PDF)</span>, <i><a href="/wiki/Notices_of_the_American_Mathematical_Society" title="Notices of the American Mathematical Society">Notices of the American Mathematical Society</a></i>, <b>50</b>: 788–789, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20211003075615/https://www.ams.org/notices/200307/what-is.pdf">archived</a> <span class="cs1-format">(PDF)</span> from the original on 2021-10-03<span class="reference-accessdate">, retrieved <span class="nowrap">2021-04-28</span></span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Notices+of+the+American+Mathematical+Society&rft.atitle=What+is+a+Dessin+d%27Enfant&rft.volume=50&rft.pages=788-789&rft.date=2003-08&rft.aulast=Zapponi&rft.aufirst=Leonardo&rft_id=https%3A%2F%2Fwww.ams.org%2Fnotices%2F200307%2Fwhat-is.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li></ul> </div> <div class="mw-heading mw-heading2"><h2 id="Further_reading">Further reading</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=11" title="Edit section: Further reading"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1239549316"><div class="refbegin refbegin-columns references-column-width" style="column-width: 30em"> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDi_BattistaEadesTamassiaTollis1994" class="citation cs2">Di Battista, Giuseppe; <a href="/wiki/Peter_Eades" title="Peter Eades">Eades, Peter</a>; <a href="/wiki/Roberto_Tamassia" title="Roberto Tamassia">Tamassia, Roberto</a>; Tollis, Ioannis G. (1994), "Algorithms for Drawing Graphs: an Annotated Bibliography", <i><a href="/wiki/Computational_Geometry_(journal)" title="Computational Geometry (journal)">Computational Geometry: Theory and Applications</a></i>, <b>4</b> (5): 235–282, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1016%2F0925-7721%2894%2900014-x">10.1016/0925-7721(94)00014-x</a></span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Computational+Geometry%3A+Theory+and+Applications&rft.atitle=Algorithms+for+Drawing+Graphs%3A+an+Annotated+Bibliography&rft.volume=4&rft.issue=5&rft.pages=235-282&rft.date=1994&rft_id=info%3Adoi%2F10.1016%2F0925-7721%2894%2900014-x&rft.aulast=Di+Battista&rft.aufirst=Giuseppe&rft.au=Eades%2C+Peter&rft.au=Tamassia%2C+Roberto&rft.au=Tollis%2C+Ioannis+G.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKaufmannWagner2001" class="citation cs2">Kaufmann, Michael; <a href="/wiki/Dorothea_Wagner" title="Dorothea Wagner">Wagner, Dorothea</a>, eds. (2001), <i>Drawing Graphs: Methods and Models</i>, <a href="/wiki/Lecture_Notes_in_Computer_Science" title="Lecture Notes in Computer Science">Lecture Notes in Computer Science</a>, vol. 2025, Springer-Verlag, <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F3-540-44969-8">10.1007/3-540-44969-8</a>, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/978-3-540-42062-0" title="Special:BookSources/978-3-540-42062-0"><bdi>978-3-540-42062-0</bdi></a>, <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:1808286">1808286</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Drawing+Graphs%3A+Methods+and+Models&rft.series=Lecture+Notes+in+Computer+Science&rft.pub=Springer-Verlag&rft.date=2001&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A1808286%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1007%2F3-540-44969-8&rft.isbn=978-3-540-42062-0&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTamassia2014" class="citation cs2"><a href="/wiki/Roberto_Tamassia" title="Roberto Tamassia">Tamassia, Roberto</a>, ed. (2014), <a rel="nofollow" class="external text" href="https://web.archive.org/web/20130815181243/http://cs.brown.edu/~rt/gdhandbook/"><i>Handbook of Graph Drawing and Visualization</i></a>, CRC Press, archived from <a rel="nofollow" class="external text" href="http://cs.brown.edu/~rt/gdhandbook/">the original</a> on 2013-08-15<span class="reference-accessdate">, retrieved <span class="nowrap">2013-08-28</span></span></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Handbook+of+Graph+Drawing+and+Visualization&rft.pub=CRC+Press&rft.date=2014&rft_id=http%3A%2F%2Fcs.brown.edu%2F~rt%2Fgdhandbook%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3AGraph+drawing" class="Z3988"></span>.</li></ul> </div> <div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Graph_drawing&action=edit&section=12" title="Edit section: External links"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a rel="nofollow" class="external text" href="http://graphx.codeplex.com">GraphX library for .NET</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20180126071742/http://graphx.codeplex.com/">Archived</a> 2018-01-26 at the <a href="/wiki/Wayback_Machine" title="Wayback Machine">Wayback Machine</a>: open-source WPF library for graph calculation and visualization. Supports many layout and edge routing algorithms.</li> <li><a rel="nofollow" class="external text" href="http://gdea.informatik.uni-koeln.de/">Graph drawing e-print archive</a>: including information on papers from all <a href="/wiki/International_Symposium_on_Graph_Drawing" title="International Symposium on Graph Drawing">Graph Drawing symposia</a>.</li></ul> <pre>for many additional links related to graph drawing. </pre> <div class="navbox-styles"><style data-mw-deduplicate="TemplateStyles:r1129693374">.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}</style><style data-mw-deduplicate="TemplateStyles:r1236075235">.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}</style></div><div role="navigation" class="navbox" aria-labelledby="Graph_representations" style="padding:3px"><table class="nowraplinks mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><style data-mw-deduplicate="TemplateStyles:r1239400231">.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}</style><div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:Graph_representations" title="Template:Graph representations"><abbr title="View this template">v</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:Graph_representations" title="Template talk:Graph representations"><abbr title="Discuss this template">t</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:EditPage/Template:Graph_representations" title="Special:EditPage/Template:Graph representations"><abbr title="Edit this template">e</abbr></a></li></ul></div><div id="Graph_representations" style="font-size:114%;margin:0 4em">Graph representations</div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">Data structures</th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Graph_(abstract_data_type)" title="Graph (abstract data type)">Graph (abstract data type)</a></li> <li><a href="/wiki/Adjacency_list" title="Adjacency list">Adjacency list</a></li> <li><a href="/wiki/Edge_list" title="Edge list">Edge list</a></li> <li><a href="/wiki/Adjacency_matrix" title="Adjacency matrix">Adjacency matrix</a></li> <li><a href="/wiki/Incidence_matrix" title="Incidence matrix">Incidence matrix</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">XML-based formats</th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/DGML" title="DGML">DGML</a></li> <li>DotML</li> <li>GEXF</li> <li><a href="/wiki/GraphML" title="GraphML">GraphML</a></li> <li><a href="/wiki/GXL" title="GXL">GXL</a></li> <li><a href="/wiki/XGMML" title="XGMML">XGMML</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Text-based formats</th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/DOT_(graph_description_language)" title="DOT (graph description language)">DOT</a></li> <li><a href="/wiki/Graph_Modelling_Language" title="Graph Modelling Language">Graph Modelling Language</a> (GML)</li> <li><a href="/wiki/LCF_notation" title="LCF notation">LCF notation</a> for cubic Hamiltonian graphs</li> <li><a href="/wiki/Newick_format" title="Newick format">Newick format</a> for trees</li> <li><a href="/wiki/Trivial_Graph_Format" title="Trivial Graph Format">Trivial Graph Format</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Related concepts</th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Graph_database" title="Graph database">Graph database</a></li> <li><a class="mw-selflink selflink">Graph drawing</a></li> <li><a href="/wiki/Linked_data" title="Linked data">Linked data</a></li></ul> </div></td></tr></tbody></table></div> <!-- NewPP limit report Parsed by mw‐web.codfw.main‐59b954b7fb‐c6686 Cached time: 20241206055531 Cache expiry: 2592000 Reduced expiry: false Complications: [vary‐revision‐sha1, show‐toc] CPU time usage: 0.691 seconds Real time usage: 0.795 seconds Preprocessor visited node count: 4056/1000000 Post‐expand include size: 88876/2097152 bytes Template argument size: 1445/2097152 bytes Highest expansion depth: 12/100 Expensive parser function count: 2/500 Unstrip recursion depth: 1/20 Unstrip post‐expand size: 100807/5000000 bytes Lua time usage: 0.453/10.000 seconds Lua memory usage: 6960302/52428800 bytes Number of Wikibase entities loaded: 0/400 --> <!-- Transclusion expansion time report (%,ms,calls,template) 100.00% 684.837 1 -total 40.98% 280.664 33 Template:Citation 24.45% 167.444 1 Template:Reflist 15.37% 105.232 1 Template:Graph_representations 14.65% 100.342 1 Template:Navbox 12.33% 84.409 10 Template:Sfnp 11.43% 78.309 1 Template:Short_description 6.82% 46.686 2 Template:Pagetype 6.51% 44.592 28 Template:Harvtxt 2.84% 19.439 14 Template:Main_other --> <!-- Saved in parser cache with key enwiki:pcache:325813:|#|:idhash:canonical and timestamp 20241206055531 and revision id 1251967614. Rendering was triggered because: page-view --> </div><!--esi <esi:include src="/esitest-fa8a495983347898/content" /> --><noscript><img src="https://login.wikimedia.org/wiki/Special:CentralAutoLogin/start?useformat=desktop&type=1x1&usesul3=0" alt="" width="1" height="1" style="border: none; position: absolute;"></noscript> <div class="printfooter" data-nosnippet="">Retrieved from "<a dir="ltr" href="https://en.wikipedia.org/w/index.php?title=Graph_drawing&oldid=1251967614">https://en.wikipedia.org/w/index.php?title=Graph_drawing&oldid=1251967614</a>"</div></div> <div id="catlinks" class="catlinks" data-mw="interface"><div id="mw-normal-catlinks" class="mw-normal-catlinks"><a href="/wiki/Help:Category" title="Help:Category">Category</a>: <ul><li><a href="/wiki/Category:Graph_drawing" title="Category:Graph drawing">Graph drawing</a></li></ul></div><div id="mw-hidden-catlinks" class="mw-hidden-catlinks mw-hidden-cats-hidden">Hidden categories: <ul><li><a href="/wiki/Category:Webarchive_template_wayback_links" title="Category:Webarchive template wayback links">Webarchive template wayback links</a></li><li><a href="/wiki/Category:Articles_with_short_description" title="Category:Articles with short description">Articles with short description</a></li><li><a href="/wiki/Category:Short_description_matches_Wikidata" title="Category:Short description matches Wikidata">Short description matches Wikidata</a></li><li><a href="/wiki/Category:Use_mdy_dates_from_March_2024" title="Category:Use mdy dates from March 2024">Use mdy dates from March 2024</a></li><li><a href="/wiki/Category:CS1:_long_volume_value" title="Category:CS1: long volume value">CS1: long volume value</a></li></ul></div></div> </div> </main> </div> <div class="mw-footer-container"> <footer id="footer" class="mw-footer" > <ul id="footer-info"> <li id="footer-info-lastmod"> This page was last edited on 19 October 2024, at 02:25<span class="anonymous-show"> (UTC)</span>.</li> <li id="footer-info-copyright">Text is available under the <a href="/wiki/Wikipedia:Text_of_the_Creative_Commons_Attribution-ShareAlike_4.0_International_License" title="Wikipedia:Text of the Creative Commons Attribution-ShareAlike 4.0 International License">Creative Commons Attribution-ShareAlike 4.0 License</a>; additional terms may apply. By using this site, you agree to the <a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use" class="extiw" title="foundation:Special:MyLanguage/Policy:Terms of Use">Terms of Use</a> and <a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy" class="extiw" title="foundation:Special:MyLanguage/Policy:Privacy policy">Privacy Policy</a>. Wikipedia® is a registered trademark of the <a rel="nofollow" class="external text" href="https://wikimediafoundation.org/">Wikimedia Foundation, Inc.</a>, a non-profit organization.</li> </ul> <ul id="footer-places"> <li id="footer-places-privacy"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy">Privacy policy</a></li> <li id="footer-places-about"><a href="/wiki/Wikipedia:About">About Wikipedia</a></li> <li id="footer-places-disclaimers"><a href="/wiki/Wikipedia:General_disclaimer">Disclaimers</a></li> <li id="footer-places-contact"><a href="//en.wikipedia.org/wiki/Wikipedia:Contact_us">Contact Wikipedia</a></li> <li id="footer-places-wm-codeofconduct"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct">Code of Conduct</a></li> <li id="footer-places-developers"><a href="https://developer.wikimedia.org">Developers</a></li> <li id="footer-places-statslink"><a href="https://stats.wikimedia.org/#/en.wikipedia.org">Statistics</a></li> <li id="footer-places-cookiestatement"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement">Cookie statement</a></li> <li id="footer-places-mobileview"><a href="//en.m.wikipedia.org/w/index.php?title=Graph_drawing&mobileaction=toggle_view_mobile" class="noprint stopMobileRedirectToggle">Mobile view</a></li> </ul> <ul id="footer-icons" class="noprint"> <li id="footer-copyrightico"><a href="https://wikimediafoundation.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/static/images/footer/wikimedia-button.svg" width="84" height="29" alt="Wikimedia Foundation" loading="lazy"></a></li> <li id="footer-poweredbyico"><a href="https://www.mediawiki.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/w/resources/assets/poweredby_mediawiki.svg" alt="Powered by MediaWiki" width="88" height="31" loading="lazy"></a></li> </ul> </footer> </div> </div> </div> <div class="vector-settings" id="p-dock-bottom"> <ul></ul> </div><script>(RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgHostname":"mw-web.codfw.main-59b954b7fb-xmnz6","wgBackendResponseTime":152,"wgPageParseReport":{"limitreport":{"cputime":"0.691","walltime":"0.795","ppvisitednodes":{"value":4056,"limit":1000000},"postexpandincludesize":{"value":88876,"limit":2097152},"templateargumentsize":{"value":1445,"limit":2097152},"expansiondepth":{"value":12,"limit":100},"expensivefunctioncount":{"value":2,"limit":500},"unstrip-depth":{"value":1,"limit":20},"unstrip-size":{"value":100807,"limit":5000000},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 684.837 1 -total"," 40.98% 280.664 33 Template:Citation"," 24.45% 167.444 1 Template:Reflist"," 15.37% 105.232 1 Template:Graph_representations"," 14.65% 100.342 1 Template:Navbox"," 12.33% 84.409 10 Template:Sfnp"," 11.43% 78.309 1 Template:Short_description"," 6.82% 46.686 2 Template:Pagetype"," 6.51% 44.592 28 Template:Harvtxt"," 2.84% 19.439 14 Template:Main_other"]},"scribunto":{"limitreport-timeusage":{"value":"0.453","limit":"10.000"},"limitreport-memusage":{"value":6960302,"limit":52428800},"limitreport-logs":"anchor_id_list = table#1 {\n [\"CITEREFAndersonHead2006\"] = 1,\n [\"CITEREFBachmaierBrandesSchreiber2014\"] = 1,\n [\"CITEREFBastertMatuszewski2001\"] = 1,\n [\"CITEREFBeckman1994\"] = 1,\n [\"CITEREFBrandesFreemanWagner2014\"] = 1,\n [\"CITEREFDi_BattistaEadesTamassiaTollis1994\"] = 1,\n [\"CITEREFDi_BattistaEadesTamassiaTollis1998\"] = 1,\n [\"CITEREFDi_BattistaRimondini2014\"] = 1,\n [\"CITEREFDoğrusözMaddenMadden1997\"] = 1,\n [\"CITEREFEiglspergerFeketeKlau2001\"] = 1,\n [\"CITEREFFreese2004\"] = 1,\n [\"CITEREFGargTamassia1995\"] = 1,\n [\"CITEREFGrandjean2014\"] = 1,\n [\"CITEREFHermanMelançonMarshall2000\"] = 1,\n [\"CITEREFHoltenIsenbergvan_WijkFekete2011\"] = 1,\n [\"CITEREFHoltenvan_Wijk2009\"] = 1,\n [\"CITEREFJüngerMutzel2004\"] = 1,\n [\"CITEREFKaufmannWagner2001\"] = 1,\n [\"CITEREFKnuth2013\"] = 1,\n [\"CITEREFKoren2005\"] = 1,\n [\"CITEREFLongabaugh2012\"] = 1,\n [\"CITEREFMaddenMaddenPowersHimsolt1996\"] = 1,\n [\"CITEREFMisueEadesLaiSugiyama1995\"] = 1,\n [\"CITEREFNachmansonRobertsonLee2008\"] = 1,\n [\"CITEREFPachSharir2009\"] = 1,\n [\"CITEREFPurchaseCohenJames1997\"] = 1,\n [\"CITEREFSaaty1964\"] = 1,\n [\"CITEREFScott2000\"] = 1,\n [\"CITEREFSugiyamaTagawaToda1981\"] = 1,\n [\"CITEREFTamassia2014\"] = 1,\n [\"CITEREFTantau2013\"] = 1,\n [\"CITEREFZapponi2003\"] = 1,\n}\ntemplate_list = table#1 {\n [\"Citation\"] = 33,\n [\"Graph representations\"] = 1,\n [\"Harvard citation text\"] = 4,\n [\"Harvtxt\"] = 28,\n [\"Refbegin\"] = 3,\n [\"Refend\"] = 3,\n [\"Reflist\"] = 1,\n [\"Sfnp\"] = 10,\n [\"Short description\"] = 1,\n [\"Use mdy dates\"] = 1,\n [\"Webarchive\"] = 2,\n}\narticle_whitelist = table#1 {\n}\nciteref_patterns = table#1 {\n}\n"},"cachereport":{"origin":"mw-web.codfw.main-59b954b7fb-c6686","timestamp":"20241206055531","ttl":2592000,"transientcontent":false}}});});</script> <script type="application/ld+json">{"@context":"https:\/\/schema.org","@type":"Article","name":"Graph drawing","url":"https:\/\/en.wikipedia.org\/wiki\/Graph_drawing","sameAs":"http:\/\/www.wikidata.org\/entity\/Q739462","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q739462","author":{"@type":"Organization","name":"Contributors to Wikimedia projects"},"publisher":{"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":{"@type":"ImageObject","url":"https:\/\/www.wikimedia.org\/static\/images\/wmf-hor-googpub.png"}},"datePublished":"2003-09-23T23:32:50Z","dateModified":"2024-10-19T02:25:48Z","image":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/b\/b9\/WorldWideWebAroundWikipedia.png","headline":"visualization of node-link graphs"}</script> </body> </html>