Patent ID: 11928612
Assignee: SPIDEROAK, INC.
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 7:
8. The method of claim 7, comprising:
obtaining the first acyclic graph including the multiple nodes and the multiple edges,
wherein an edge among the multiple edges indicates the weave of the first acyclic graph including indicating a parent node among the multiple nodes and a child node among the multiple nodes,
wherein the parent node occurs before the child node in the weave,
wherein the first acyclic graph includes a branch node having a first child node and a second child node,
wherein the first child node and the second child node do not have a parent-child relationship indicating the weave, and
wherein the first child node includes the finalize node;

ordering the multiple nodes in the first acyclic graph by ordering a portion of the multiple nodes according to at least a portion of the multiple edges; and
ordering the first child node and the second child node by:
obtaining a first priority associated with the finalize node represented by the first child node and a second priority associated with the second child node,
wherein the first priority associated with the finalize node is higher than a priority associated with a node that is not the finalize node;

determining that the first priority is higher than the second priority; and
creating the weave by ordering the first child node before the second child node in the weave.