5 years ago (2015-12-06)  Algorithm language |   First to comment  17 
post score 0 times, average 0.0

The backtracking method traverses the solution space tree through a depth-first traversal strategy. Its implementation process is to search for all its child or child nodes from the root node, and determine for each node whether it satisfies the constraint conditions and the decision function if it is satisfied. Entering this node also searches this node for its children.The node that owns a child node is called a live node. When no node is found in the search, the original parent node is returned to continue to search for a live node, and so on until the backtracking algorithm searches for the solution space tree. Backtracking is a omnipotent algorithm for solving problems because it traverses through all the possible solutions to the problem. If you construct the space tree correctly, you can traverse through the solution space tree.The backtracking algorithm can solve all possible solutions to the problem. When we actually solve some optimal solution problems, we can cut off the subtree that is worse than the intermediate solution by the pruning function.

The minimum solution of m for the m-coloring problem of undirected graphs



This article has been printed on copyright and is protected by copyright laws. It must not be reproduced without permission.If you need to reprint, please contact the author or visit the copyright to obtain the authorization. If you feel that this article is useful to you, you can click the "Sponsoring Author" below to call the author!

Reprinted Note Source: Baiyuan's Blog>>https://wangbaiyuan.cn/en/backtracking-method-undirected-graph-node-color-color-number-at-least-2.html

Post comment


No Comment


Forget password?