Arranging directed acyclic graph data for display
Abstract:
The disclosed examples relate to arranging graph data for display on a display device. One example provides, on a computing device, a method comprising determining one or more connected groups of nodes in directed acyclic graph data, for each connected group of nodes, determining a reachability from each node with no inputs to each of one or more nodes with no outputs to determine a plurality of initial node/terminal node pairs, and for each initial node/terminal node pair, determining a path from the initial node to the terminal node. The method further comprises initializing a grid based upon the determined paths, placing each node at a corresponding initial grid location, and placing edges between nodes based upon the determined paths to form an initial grid representation, modifying the initial grid representation via a cost function to form a modified grid representation, and outputting the modified grid representation for display.
Public/Granted literature
Information query
Patent Agency Ranking
0/0