Function path_next_node

Source/path.cpp:287–306

* @brief insert pPath into the frontier (keeping the frontier sorted by total distance) */

 * @brief insert pPath into the frontier (keeping the frontier sorted by total distance)
 */
void path_next_node(PATHNODE *pPath)
{
	PATHNODE *next, *current;
	int f;

	next = path_2_nodes;
	if (!path_2_nodes->NextNode) {
		path_2_nodes->NextNode = pPath;
	} else {
		current = path_2_nodes;
		next = path_2_nodes->NextNode;
		f = pPath->f;
		while (next && next->f < f) {
			current = next;
			next = next->NextNode;
		}
		pPath->NextNode = next;
		current->NextNode = pPath;
	}
}

/**
 * @brief update all path costs using depth-first search starting at pPath