AUTO DRAW FLOW
First Claim
1. A method of automatically rendering a flow diagram, the method comprising:
- receiving, at a computing device, user input that specifies a key status;
generating a network of relationships between the key status and one or more other statuses;
determining flows for connections between the statuses in the network based on quantities of objects that flowed between the statuses in the network during a specified time period;
ranking the connections based on flows determined for the connections;
selecting a subset of the ranked connections;
determining a critical path based on the subset of the ranked connections; and
rendering the flow diagram including the critical path.
1 Assignment
0 Petitions
Accused Products
Abstract
A computing device can automatically generate a flow diagram showing statuses that objects in a system can possess, and the possible transitions between these statuses. Using snapshots of database data, the device can determine how the statuses of these objects have changed over time. The device can analyze the data to suggest which database fields likely represent object status. The device can render the flow diagram to illustrate system states at different selected times. Each rendered flow diagram can indicate, for the selected time point, the quantity of objects that possessed each status at that time, and, for a selected time interval, the quantity of objects that changed from each status to each other status during that time interval. The statuses can be represented in the flow diagram as status bubbles having sizes that are based on the quantities of objects have those bubble'"'"'s statuses at the selected time point.
-
Citations
19 Claims
-
1. A method of automatically rendering a flow diagram, the method comprising:
-
receiving, at a computing device, user input that specifies a key status; generating a network of relationships between the key status and one or more other statuses; determining flows for connections between the statuses in the network based on quantities of objects that flowed between the statuses in the network during a specified time period; ranking the connections based on flows determined for the connections; selecting a subset of the ranked connections; determining a critical path based on the subset of the ranked connections; and rendering the flow diagram including the critical path. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A computer-implemented method comprising:
-
automatically selecting, based on specified criteria, and from a set of statuses, a subset of statuses designated to be significant statuses; automatically positioning flow elements corresponding to statuses from the subset of statuses in a portion of a diagram that is initially presented on a display; automatically positioning one or more flow elements contained in the set of statuses, but not in the subset of statuses, in a portion of the diagram that is not initially presented on the display; and presenting, on the display, the portion of the diagram that is initially presented on the display.
-
-
7. The computer-implemented method of claim 7, further comprising:
-
receiving user input that specifies a network depth; and automatically generating, in the diagram, chains of connected flow elements limited to quantities of flow elements that are based on the user input. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A non-transitory computer-readable storage medium storing instructions which, when executed by one or more processors, cause the processors to perform operations comprising:
-
automatically selecting, based on specified criteria, and from a set of statuses, a subset of statuses designated to be significant statuses; automatically positioning flow elements corresponding to statuses from the subset of statuses in a portion of a diagram that is initially presented on a display; automatically positioning one or more flow elements contained in the set of statuses, but not in the subset of statuses, in a portion of the diagram that is not initially presented on the display; and presenting, on the display, the portion of the diagram that is initially presented on the display.
-
-
14. The non-transitory computer-readable storage medium of claim 14, said operations further comprising:
-
receiving user input that specifies a network depth; and automatically generating, in the diagram, chains of connected flow elements limited to quantities of flow elements that are based on the user input. - View Dependent Claims (15, 16, 17, 18, 19)
-
Specification