Title:
BestFirstSearch_HeapAlgo
Download
Description: 1. This program is running from the path to read a text file (path: C: INPUT.TXT)
2. Implementation of the end will produce a sorted text file (path: C: OUTPUT.TXT)
3. Given the initial disk of at least one solution
The program uses the algorithm strategy Best-first search with branch-and-bound algorithm
1. Using the Max heap implement Priority queue
2. Bound function is estimated using the disk at least a few steps away to answer
The first part
The so-called heap property (or called heap condition) refers to the information within each node than its left and right child nodes of the information is small (about two child nodes, but there is no necessary relationship between).
Although the concept of heap is a complete binary tree, in fact there exist root among an array A [1], then the A [2] and A [3] from left to right order of fill over the second layer, then A [4], A [5], A [6], A [7] from left to right order of filling up the third tier ....
To Search:
- [WBDC] - Can read and write text files to operate
File list (Check if you may need any files):
BestFirstSearch_HeapAlgo.cpp
