System and method for visualizing massive multi-digraphs
First Claim
Patent Images
1. A method of processing an input multi-digraph comprising:
- constructing a hierarchy of multi-digraph layers on top of the multi-diagraph;
extracting a graph slice from the hierarchy; and
creating a visual representation of the graph slice.
1 Assignment
0 Petitions
Accused Products
Abstract
In accordance with a feature of the invention, a hierarchy of multi-digraph layers may be constructed on top of an input multi-digraph. Each layer represents a multi-digraph obtained from an equivalence relation defined on the edge set of the input multi-digraph. In accordance with a further feature of the invention, each subgraph is small enough to be represented visually in a variety of novel ways.
-
Citations
18 Claims
-
1. A method of processing an input multi-digraph comprising:
-
constructing a hierarchy of multi-digraph layers on top of the multi-diagraph;
extracting a graph slice from the hierarchy; and
creating a visual representation of the graph slice. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system for visualizing an input multi-digraph comprising:
-
a computational engine enabled to construct a hierarchy of multi-digraph layers on top of the multi-diagraph and to extract graph slices from the hierarchy; and
a graphical engine in communication with the computational engine and enabled to create visual representations of the graph slices. - View Dependent Claims (7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18)
-
-
12. A method of visualizing a graph slice of a multi-digraph hierarchy comprising:
-
arranging edges of the graph slice in a matrix representation;
creating a visual representation of each matrix element of the matrix representation.
-
Specification