×

Method for determining a best path between two nodes

  • US 5,521,910 A
  • Filed: 10/05/1994
  • Issued: 05/28/1996
  • Est. Priority Date: 01/28/1994
  • Status: Expired due to Term
First Claim
Patent Images

1. In a method of breadth-first searching to build a spanning tree, wherein a plurality of traversals are made of different paths moving outwardly from a starting point in a search to find an optimum path to a destination point based on a plurality of metrics, the improvement comprising:

  • initializing a vector of metrics at the starting point where a value of each metric in the vector is a best value;

    traversing an arc to a next node along a path from the starting point to the destination point; and

    at an end of each traversal, modifying the vector of metrics to produce a traversal value which accumulates from a best value to a worst value, comparing the values of the metrics and eliminating the paths which are not best or do not pass a threshold level in at least one metric.

View all claims
  • 6 Assignments
Timeline View
Assignment View
    ×
    ×