Branch and bound by the "branch" and "boundaries" strategy of two parts, one "branch" strategy is the problem of space in accordance with the breadth-first search strategy "bound" strategy is to accelerate the search speed and the use of heuristic pruning strategy. Using the branch and bound method to solve the single-source shortest path problem between the main control by pruning nodes, in general, if the solution space to the tree root node Y is contained in the solution sub-tree nodes than to X is the root of the solution contained in the subtree, then Y control the end point node X, to be controlled node X is the root of the sub-tree can be cut. Algorithm, the use of adjacency matrix graph, two-dimensional array stored in the adjacency matrix, using an array of records from the source to the vertex distance and path of the precursor peak.

fenzhijiexianfa.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．