{"title":"Interactive Graph Visualization in DDLab","authors":"Andrew Wuensche","doi":"arxiv-2406.10704","DOIUrl":null,"url":null,"abstract":"Interactive visualization of the basin of attraction field, the\n``ibaf-graph'', is a new feature in DDLab with the same interactive functions\nas the ``network-graph'' and ``jump-graph''. These functions allow any node and\nits connected fragment to be dragged/dropped with the pointer as a graphic\nanimation with elastic links. The fragment itself depends on the node's link\nsetting by inputs, outputs, or either, and a distance in link-steps. Further\noptions include graph geometry, rescaling, node display, and link editing. This\narticle describes the three graph types, network/ibaf/jump, their selection,\nenhanced functions, and applications to cellular automata, discrete dynamical\nnetworks and random maps.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"20 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - PHYS - Cellular Automata and Lattice Gases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.10704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Interactive visualization of the basin of attraction field, the
``ibaf-graph'', is a new feature in DDLab with the same interactive functions
as the ``network-graph'' and ``jump-graph''. These functions allow any node and
its connected fragment to be dragged/dropped with the pointer as a graphic
animation with elastic links. The fragment itself depends on the node's link
setting by inputs, outputs, or either, and a distance in link-steps. Further
options include graph geometry, rescaling, node display, and link editing. This
article describes the three graph types, network/ibaf/jump, their selection,
enhanced functions, and applications to cellular automata, discrete dynamical
networks and random maps.