US 12,013,896 B2
Stable graph layout determination
Roeland Augustinus Maria Vliegen, Waalre (NL); Roeland Johannus Scheepens, Eindhoven (NL); and Robin Johannes Pieter Mennens, Eindhoven (NL)
Assigned to MagnaView B.V., Eindhoven (NL)
Appl. No. 17/254,705
Filed by MagnaView B.V., Eindhoven (NL)
PCT Filed Jun. 7, 2019, PCT No. PCT/EP2019/064925
§ 371(c)(1), (2) Date Dec. 21, 2020,
PCT Pub. No. WO2020/001956, PCT Pub. Date Jan. 20, 2020.
Claims priority of application No. 18180380 (EP), filed on Jun. 28, 2018.
Prior Publication US 2021/0326387 A1, Oct. 21, 2021
Int. Cl. G06F 16/901 (2019.01); G06F 16/904 (2019.01)
CPC G06F 16/9024 (2019.01) [G06F 16/904 (2019.01)] 16 Claims
OG exemplary drawing
 
16. A non-transitory computer readable medium storing computer program instructions for determining a layout of a graph, the graph being induced by a set of paths through a set of nodes, the nodes of the graph being comprised in the set of nodes, the set of paths being a subset of a global set of paths through the set of nodes, the layout comprising a position of each node of the graph, the computer program instructions when executed by a processor cause the processor to perform operations comprising:
computing a global rank assignment assigning a rank to each node in the set of nodes, computing the global rank assignment comprising iteratively:
sorting the global set of paths by a weight corresponding to each path of the global set of paths, and
iteratively 1) selecting a path through a plurality of nodes from the sorted global set of paths based on an order of the sorted global set of paths and 2) updating the global rank assignment for each of the plurality of nodes of the selected path;
filtering the global set of paths to obtain the set of paths;
computing the layout of the graph based on the global rank assignment, wherein nodes of the graph with equal rank assignments are positioned adjacent to each other; and
storing the layout of the graph in a memory.