US 12,306,821 B2
System and techniques for traversing a dependency graph or tree structure in one step
Aaron Matthew Bush, Nixa, MO (US)
Assigned to Oracle International Corporation, Redwood Shores (CA)
Filed by Oracle International Corporation, Redwood Shores, CA (US)
Filed on Apr. 3, 2023, as Appl. No. 18/130,419.
Prior Publication US 2024/0330266 A1, Oct. 3, 2024
Int. Cl. G06F 16/23 (2019.01); G06F 16/2457 (2019.01)
CPC G06F 16/2358 (2019.01) [G06F 16/24573 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method performed by one or more processors of a computing device, the method comprising:
executing a computerized process by traversing a dependency graph comprising a plurality of nodes, wherein traversing the dependency graph comprises:
(i) receiving an input selecting a first node instance of the plurality of nodes, the first node instance comprising one or more scripts;
(ii) updating a status for the first node instance in a node process log;
(ii) accessing a node dependency table, the node dependency table listing parent nodes for the first node instance, the parent nodes being included in the plurality of nodes, wherein the parent nodes serve as dependencies for the first node instance;
(iii) determining whether the dependencies for the first node instance have been met;
(iv) in response to determining that the dependencies for the first node instance have not been met, updating the status for the first node instance and returning to step (iii);
(v) in response to determining that the dependencies for the first node instance have been met, executing the one or more scripts of the first node instance; and
(vi) updating the status for the first node instance to indicate that the one or more scripts were executed.