Method and system for incremental topological update within a data flow graph in gaming
A method of rendering a virtual environment is disclosed. First application data is received. The first application data includes first graph data. The first graph data corresponds to a first state of an application. Second application data is received after the first application data. The second application data corresponds to a second state of the application. The first application data and the second application data are analyzed to determine a change in the first graph data associated with the second application data. An island subgraph within the first graph data that includes the change is determined. Second graph data is generated for the second state. The generating of the second graph data includes partially reconstructing the first graph data. The partial reconstructing includes rebuilding the determined island subgraph. The generated second graph data is communicated for rendering of the virtual environment in the second state.
1. A non-transitory computer-readable storage medium storing a set of instructions that, when executed by one or more computer processors, causes the one or more computer processors to perform operations, the operations comprising:
receiving first application data, the first application data including first graph data, the first graph data corresponding to a first state of an application;
receiving second application data, the second application data corresponding to a second state of the application;
determining a subgraph within the first graph data that includes a change; and
generating second graph data for the second state, wherein the generating includes a partial reconstructing of the first graph data, the partial reconstructing including rebuilding the determined subgraph.
2. The non-transitory computer-readable storage medium of claim 1 , the operations further comprising identifying the change based on at least one of an addition of a node, a modifying of the node, or a removal of the node.
3. The non-transitory computer-readable storage medium of claim 1 , the operations further comprising identifying the change based on a modification to a topology of the first graph data.
4. The non-transitory computer-readable storage medium of claim 1 , wherein the partial reconstructing of the first graph data includes applying one or more heuristics to perform one or more of adding, removing, or rearranging one or more of nodes, connections or data to improve a speed of a rendering of a virtual environment.
5. The non-transitory computer-readable storage medium of claim 1 , wherein the partial reconstructing of the first graph data includes performing memory compaction by writing data associated with the subgraph in contiguous memory location in an order that the data is needed during a rendering of a virtual environment.
6. The non-transitory computer-readable storage medium of claim 1 , wherein the subgraph includes a plurality of subgraphs and the partial reconstructing includes rebuilding a first subgraph of the plurality of the subgraphs in parallel with rebuilding a second subgraph of the plurality of subgraphs.
7. The non-transitory computer-readable storage medium of claim 1 , wherein the first application data includes application input data from a control device, the control device configured to control an aspect of the application.
8. The non-transitory computer-readable storage medium of claim 1 , wherein the partial reconstructing the first graph data includes removing the determined subgraph based on the determined subgraph having a graphical output during a rendering of a virtual environment that is below a threshold graphical output.
9. A method comprising:
receiving first application data, the first application data including first graph data, the first graph data corresponding to a first state of an application;
receiving second application data, the second application data corresponding to a second state of the application;
determining a subgraph within the first graph data that includes a change; and
generating second graph data for the second state, wherein the generating includes a partial reconstructing of the first graph data, the partial reconstructing including rebuilding the determined subgraph.
10. The method of claim 9 , further comprising identifying the change based on at least one of an addition of a node, a modifying of the node, or a removal of the node.
11. The method of claim 9 , further comprising identifying the change based on a modification to a topology of the first graph data.
12. The method of claim 9 , wherein the partial reconstructing of the first graph data includes applying one or more heuristics to perform one or more of adding, removing, or rearranging one or more of nodes, connections or data to improve a speed of a rendering of a virtual environment.
13. The method of claim 9 , wherein the partial reconstructing of the first graph data includes performing memory compaction by writing data associated with the subgraph in contiguous memory location in an order that the data is needed during a rendering of a virtual environment.
14. The method of claim 9 , wherein the subgraph includes a plurality of subgraphs and the partial reconstructing includes rebuilding a first subgraph of the plurality of the subgraphs in parallel with rebuilding a second subgraph of the plurality of subgraphs.
15. The method of claim 9 , wherein the first application data includes application input data from a control device, the control device configured to control an aspect of the application.
16. The method of claim 9 , wherein the partial reconstructing the first graph data includes removing the determined subgraph based on the determined subgraph having a graphical output during a rendering of a virtual environment that is below a threshold graphical output.
17. A system comprising:
one or more computer processors;
one or more computer memories;
a set of instructions stored in the one or more computer memories, the set of instructions configuring the one or more computer processors to perform operations, the operations comprising:
receiving first application data, the first application data including first graph data, the first graph data corresponding to a first state of an application;
receiving second application data, the second application data corresponding to a second state of the application;
determining a subgraph within the first graph data that includes a change; and
generating second graph data for the second state, wherein the generating includes a partial reconstructing of the first graph data, the partial reconstructing including rebuilding the determined subgraph.
18. The system of claim 17 , the operations further comprising identifying the change based on at least one of an addition of a node, a modifying of the node, or a removal of the node.
19. The system of claim 17 , the operations further comprising identifying the change based on a modification to a topology of the first graph data.
20. The system of claim 17 , wherein the partial reconstructing of the first graph data includes applying one or more heuristics to perform one or more of adding, removing, or rearranging one or more of nodes, connections or data to improve a speed of a rendering of a virtual environment.