Graph Layout Retention via Hidden Edges

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Modifying directed graphs can lead to unexpected changes in layout, causing nodes to become isolated and disrupting the workflow, requiring additional labor and computing resources to restore the correct positions of the nodes.

Innovation Solution

Generate invisible graphical user elements, or 'hidden edges', to maintain the layout of the graph during modifications by storing them as separate data structures that are not visible to the user, thus preserving node positions and avoiding automatic rearrangement.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If edges are deleted from the graph during modification, then the graph structure is updated, but nodes become isolated and layout is disrupted

Engineering Contradiction:

Improvegraph modification capabilityVSAvoidnode position stability

Core Design Contradiction:

Adaptability or versatilityVSStability of the object's composition

Solution Approach 1:

The system performs preliminary detection of isolated nodes before they become fully isolated during graph modification. By identifying nodes that will become isolated based on the edit operation, the system can proactively generate hidden edges to maintain their positions, preventing layout disruption before it occurs.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

Hidden edges act as intermediary elements that mediate between the deleted visible edges and the nodes. These invisible graphical user elements serve as placeholders that maintain the structural connection and positional stability of isolated nodes without being visible to users, thus preserving layout while allowing graph modification.

Inventive Principle:

Principle #24Intermediary (Mediator)

2Stability of the object's composition

If nodes are repositioned to maintain layout after isolation, then layout stability is preserved, but additional computing resources and labor are required

Engineering Contradiction:

Improvelayout stabilityVSAvoidediting efficiency

Core Design Contradiction:

Stability of the object's compositionVSProductivity

Solution Approach 1:

The system implements self-service by automatically detecting isolated nodes and generating hidden edges to maintain their positions without requiring user intervention. This automated process eliminates the need for manual layout restoration, preserving productivity while maintaining layout stability.

Inventive Principle:

Principle #25Self-service

Solution Approach 2:

The system creates hidden edges as copies or representations of the structural relationships that would otherwise be lost when visible edges are deleted. These hidden edges replicate the positional and connective functions of the original edges without being visible, thus maintaining layout stability without requiring additional computational resources for manual repositioning.

Inventive Principle:

Principle #26Copying

3Stability of the object's composition

If hidden edges are generated to maintain layout, then node positions are preserved, but the graph data structure becomes more complex

Engineering Contradiction:

Improvenode position preservationVSAvoiddata structure complexity

Core Design Contradiction:

Stability of the object's compositionVSDevice complexity

Solution Approach 1:

The system applies local quality by making hidden edges invisible to users while maintaining their functional presence in the data structure. This selective visibility allows the system to preserve node positions in specific local areas where isolation occurs without affecting the overall simplicity of the graph interface, thus balancing position preservation with perceived data structure complexity.

Inventive Principle:

Principle #3Local quality

Data Source

PatentUS20250308103A1Graph layout retention using hidden edges

Publication Date: 2025.10.02 SERVICENOW INC

AI summary

Various implementations disclosed herein include receiving an input indicating an edit to a graph, the graph including a plurality of nodes connected by a plurality of edges, and modifying the graph according to the input. Upon determining that the modification causes a node of the graph to be isolated, a hidden edge is generated to connect the node to at least one other node of the graph.