PATENT CLAIM ANALYSIS

Application Number: 15750630
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2019-01
Patent Classification: ["370", "238000"]

Abstract:
Examples relate to identifying shortest paths. In one example, a computing device may: access an edge table that specifies, for each edge of a graph, an edge source, an edge destination, and an edge distance value; access a current path table that specifies paths between nodes of the graph and, for each path, a source node, a destination node, a distance, and a node path; identify each path included in the current path table as a shortest known path; and for each path having a destination node that matches an edge source node, add a new path to the current path table, the new path specifying: the source node as a new source; the edge destination as a new destination; a sum of the edge value and the path distance as a new distance; and the edge destination appended to the node path as a new node path.

Claim (Index 12):
A method for identifying shortest paths, implemented by a hardware processor, the method comprising:\n accessing an edge table that specifies, for each edge of a graph that includes a plurality of nodes, an edge source node, an edge destination node, and an edge distance value; creating a first table by selecting each path from a path table that specifies a plurality of paths between nodes of the graph and, for each path, a path source node, a path destination node, a path distance from the path source node to the path destination node, a node path specifying each node included in the path between the path source node and the path destination node, and a path flag indicating whether the path is active; for each path included in the first path table, setting the path flag to indicate that the path is inactive; creating a second table by:\n identifying each path that i) is included in the path table, ii) has a path flag indicating the path is active, and iii) has a path destination node that matches an edge source node of an edge included in the edge table; and \n for each identified path, adding, to the second table, a new path specifying:\n the path source node of the identified path as a new path source node; \n the edge destination node of the identified path as a new path destination node; \n a sum of the edge value and the path distance of the identified path as a new path distance; and \n the edge destination node appended to the node path of the identified path as a new node path. \n \n combining the first table and the second table to create a combined table; and for each path included in the combined table, identifying the path as a shortest path between the path source node of the path and the path destination node of the path in response to determining that the path distance of the path specifies a smaller value than a path distance of each other path included in the combined table that specifies a same path source node and same path destination node as the path.

Metadata:
- Claim Count in Document: 7.0
- Percentile: 88.0
- Lexical Diversity: 3.4
- Patent Class: 370.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['10150816', '11776919', '14128889', '14556355', '12491085']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5074534937532587
- 35 USC 102 Novelty (BERT): 0.4611505094171525
- Combined Prediction Score: 0.502823195319648
- Mean Citation Score: 132.557865
- Max Citation Score: 138.30113
- Similarity Product: 103.03969246940316

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 0
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test