Methods and systems for displaying network information
First Claim
1. A computer implemented method of displaying a scheduling model as a network structure using force-directed layout wherein the network includes a plurality of nodes each node including an associated slack parameter having a value, said method comprising:
- selecting a central time-directed axis;
positioning each network node along the central time-directed axis using the associated slack parameter value of the network node to determine a distance from the central time-directed axis;
applying force-directed computations to sets of concurrent nodes; and
determining a subsequent set of concurrent nodes by selecting nodes which are successors only for edges for which the predecessors are contained in the previous concurrent sets of nodes until the entire network is partitioned into sets of concurrent nodes.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods and systems for displaying a network structure using force-directed layout are provided. The network includes a plurality of nodes, each node including an associated slack parameter having a value. The method including selecting a central time-directed axis, positioning each network node along the axis using the associated slack parameter value of the network node to determine a distance from the central time-directed axis, and applying force-directed computations to sets of concurrent nodes.
-
Citations
17 Claims
-
1. A computer implemented method of displaying a scheduling model as a network structure using force-directed layout wherein the network includes a plurality of nodes each node including an associated slack parameter having a value, said method comprising:
-
selecting a central time-directed axis; positioning each network node along the central time-directed axis using the associated slack parameter value of the network node to determine a distance from the central time-directed axis; applying force-directed computations to sets of concurrent nodes; and determining a subsequent set of concurrent nodes by selecting nodes which are successors only for edges for which the predecessors are contained in the previous concurrent sets of nodes until the entire network is partitioned into sets of concurrent nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A system for displaying a scheduling model as a network structure comprising:
-
a database embodied on a computer readable media, said database comprising data relating to a feed-forward network and force-directed layout computations for the network; and a processor configured to receive data from said database, said processor comprising; a sequencing component configured to partition the feed-forward network into sets of concurrent nodes and determine a slack value for each node; and a layout management component configured to simulate the application of forces to each set of concurrent nodes to determine the spatial arrangement of the sets of nodes and to determine a distance of each node from a central time-directed axis based at least partially on the slack value. - View Dependent Claims (15, 16)
-
-
17. A computer readable medium encoded with a program configured to:
-
instruct a computer to display a scheduling model as a network structure using force-directed layout wherein the network includes a plurality of nodes positioned along a central time-directed axis using a slack parameter value associated with each node to determine a distance of respective nodes from the central time-directed axis; partition the plurality of nodes into sets of concurrent nodes; and instruct the computer to apply force-directed computations to each set of concurrent nodes.
-
Specification