Patent ID: 11902832
Assignee: SPIDEROAK, INC.
Field: Digital communication (Electrical engineering)
Classification: CPC H | IPC H

Claim 8:
9. A method comprising:
obtaining an acyclic graph including multiple nodes and multiple edges,
wherein an edge among the multiple edges indicates a parent node among the multiple nodes and a child node among the multiple nodes to be included in a weave,
wherein the parent node occurs before the child node in the weave,
wherein the 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;

ordering the multiple nodes in the 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 first child node and a second priority associated with the second child node;
based on the first priority and the second priority, creating the weave by ordering the first child node and the second child node.