Method and system for recursion check and low-level code generation for directed graph
AssigneeSap SE
InventorJaakob Kind
Life of this patent
Estimating the term…
Loading patent…
AssigneeSap SE
InventorJaakob Kind
Estimating the term…
A method and a system for fast recursion check and low-level code generation for directed graph. In a directed graph each vertex is connected to at least one other vertex with a directed edge to form an ordered pair of a source vertex and a target vertex. Low-level codes are assigned to the vertices of the directed graph, where for each ordered pair the low-level code of the target vertex is bigger than the low-level code of the source vertex. A new edge is added to connect a first vertex and a second vertex of the graph, where the first vertex is the source vertex and the second vertex is the target vertex of the new ordered pair. The low-level code of the target vertex of the new ordered pair is not bigger than the low-level code of the source vertex. For the new ordered pair and all ordered pairs that descend from the new ordered pair, the low-level codes of the target nodes are changed to values bigger than the low-level codes of the corresponding source vertices, when necessary.
A computer implemented method for manipulating a bill of materials, the bill of materials comprising a plurality of components necessary to manufacture a product and a plurality of edges, wherein each component of the plurality of components is connected to at least one other component of the plurality of components with a corresponding at least one edge to form at least one ordered pair of a plurality of ordered pairs in the graph, wherein each ordered pair includes a source component and a target component of the plurality of components connected by a corresponding edge of the plurality of edges, the method comprising:
A system comprising:
A non-transitory machine readable medium having instructions stored therein which, when executed on a computer system, the computer system to manipulate a bill of materials comprising a plurality of components and a plurality of edges, wherein each component of the plurality of components is connected to another component of the plurality of components with an edge to form an ordered pair of a source component and a target component, cause the computer system to perform a set of operations comprising:
Dependencies are inferred from the claim text.