Pathfinding on native Gamestudio graphs

action test_pather()
{
	path_set(my, "path_000");
	while(1)
	{
		var start_node = ll_pfind_getClosestNode(my, my.x, 1000, NULL);
		var dest_node = ll_pfind_getClosestNode(my, target_pos.x, 1000, NULL);
		LL_LIST *path = ll_pfind_getPathToTarget(my, start_node, dest_node, ll_pfind_astarCost);
		LL_PFIND_PATH_NODE *node = (LL_PFIND_PATH_NODE *)path->first->data;
		if (path) // path has been found
		{
    		LL_PFIND_PATH_NODE *node;
 
    		// insert the start position as first node
    		node = ll_pfind_createPathNode(start_node);
    		ll_list_push(path, (void *)node);
 
    		// insert the destination as last node
    		node = ll_pfind_createPathNode(dest_node);
    		ll_list_add(path, (void *)node);
    		if (path->count > 0) // path is not empty yet
			{
    			// get the next node of the path
    			LL_PFIND_PATH_NODE = (LL_PFIND_PATH_NODE *)path->first->data;
 
    			// move to the node
    			// [insert your movement code here]
    			// [the destination should be: node->pos]
 
    			// if the entity has reached the node
   			 if (vec_dist(&my->x, &node) < 50)
    			{
       			 // remove it from the path 
        			ll_list_remove(path, path->first, ll_pfind_destroyPathNode);
    			}
			}
			else // path has been traversed completely
			{
    			ll_list_destroy(path, NULL); // remove it
			}
		}
	}
}

//LL_PFIND_PATH_NODE = (LL_PFIND_PATH_NODE *)path->first->data;    // old
LL_PFIND_PATH_NODE *node= (LL_PFIND_PATH_NODE *)path->first->data; // new

// insert the start position as first node
//node = ll_pfind_createPathNode(start_node); // old
node = ll_pfind_createPathNode(&my->x);       // new
ll_list_push(path, (void *)node);

// insert the destination as last node
//node = ll_pfind_createPathNode(dest_node); // old
node = ll_pfind_createPathNode(&target_pos); // new
ll_list_add(path, (void *)node);

//if (vec_dist(&my->x, &node) < 50)    // old
if (vec_dist(&my->x, &node->pos) < 50) // new

else // path has been traversed completely
{
	ll_list_destroy(path, NULL); // remove it
	path = NULL; // new
}

while(1)
{
	if (path) // path has been found
	{
		if (path->count > 0) // path is not empty yet
		{
			// get the next node of the path
			node = (LL_PFIND_PATH_NODE *)path->first->data;
 
			// move to the node
			// [insert your movement code here]
			// [the destination should be: node->pos]
 
			// if the entity has reached the node
			if (vec_dist(&my->x, &node->pos) < 50)
			{
				// remove it from the path 
				ll_list_remove(path, path->first, ll_pfind_destroyPathNode);
			}
		}
		else // path has been traversed completely
		{
			ll_list_destroy(path, NULL); // remove it
			path = NULL;
		}
	}
	
	wait(1);
}

action test_pather()
{
	path_set(my, "path_000");
	var start_node = ll_pfind_getClosestNode(my, my.x, 1000, NULL);
	var dest_node = ll_pfind_getClosestNode(my, target_pos.x, 1000, NULL);
	LL_LIST *path = ll_pfind_getPathToTarget(my, start_node, dest_node, ll_pfind_astarCost);
	LL_PFIND_PATH_NODE *node= (LL_PFIND_PATH_NODE *)path->first->data; // new
	while(1)
	{
		if (path) // path has been found
		{
			if (path->count > 0) // path is not empty yet
			{
				// get the next node of the path
				node = (LL_PFIND_PATH_NODE *)path->first->data;
 
				// move to the node
  				// get the direction from the entity MY to the entity YOU
  				var temp;
  				vec_set(temp,your.x); 
  				vec_sub(temp,my.x);
  				vec_to_angle(my.pan,temp); // now MY looks at YOU
  				c_move(my,node->pos,nullvector,GLIDE);
				
				// [the destination should be: node->pos]
 
				// if the entity has reached the node
				if (vec_dist(&my->x, &node->pos) < 50)
				{
					// remove it from the path 
					ll_list_remove(path, path->first, ll_pfind_destroyPathNode);
				}
			}
			else // path has been traversed completely
			{
				ll_list_destroy(path, NULL); // remove it
				path = NULL;
			}
		}
		wait(1);
	}
}

function main()
{
	game_state_game_on = 1;
	
  	video_screen = 1; // lite-C: start settings for Fullscreen
	level_load ("Mistborn.wmb");
	
	ll_pfind_init();
	
	wait(3);
	//ent_create("terrain.hmp",vector(0,0,0),terrain_basic);
	
	normal_movement = 1;
	dynamic_movement = 0;
}

VECTOR vec_to_target;
vec_diff(&vec_to_target, &node->pos, &my->x);
vec_to_angle(&my->pan, &vec_to_target);
c_move(my, vector(10 * time_step, 0, 0), nullvector, GLIDE);

action test_pather()
{
	path_set(my, "path_000");
	var start_node = ll_pfind_getClosestNode(my, my.x, 1000, NULL);
	var dest_node = ll_pfind_getClosestNode(my, player.x, 1000, NULL);
	LL_LIST *path = ll_pfind_getPathToTarget(my, start_node, dest_node, ll_pfind_astarCost);
	while(!path)
	{
		beep();
		wait(1);
	}
}

// remark: edge_skill is set by path_getedge()
if ((edge_skill[2] == THROUGH_WATER) && (entity_can_swim == FALSE))
{
	return -1; // edge cannot be traversed by this entity
}

void ent_pathfinder()
{
	entPathfinder = my;
	
	ent_setState(my, STATE_IDLE);
	ent_setPath(my, NULL);
	my->flags &= ~PASSABLE;
	path_set(my, "path_000");
	VECTOR vec_to_target;
	
	while (1)
	{
		
		if (ent_getState(my) == STATE_FOLLOW_PATH)
		{
			ent_drawPath(my, vector(0, 255, 0)); // display path
			
			LL_PFIND_PATH_NODE *node = ent_getFirstPathNode(my);
			
			if (node) // path is not empty
			{
				VECTOR vec_to_node;
				VECTOR *node_pos = ll_pfind_getPathNodePos(node);
				var dist = vec_dist(&my->x, node_pos);
				
				//vec_diff(&vec_to_node, node_pos, &my->x);
				//vec_to_angle(&my->pan, &vec_to_node);

			//	vec_add(&my->x, &vec_to_node);
						
					
vec_diff(&vec_to_target, &node->pos, &my->x);
vec_to_angle(&my->pan, &vec_to_target);
my->tilt=0;

				vec_normalize(&vec_to_target, minv(dist, PATHFINDER_SPEED * time_step));
c_move(my, vector(10 * time_step, 0, -1), nullvector, GLIDE);


				if (dist < 10) // node reached
				{
					ll_pfind_stringPullingFirst(my, ent_getPath(my), 3, ent_isReachable);
					ent_removeFirstPathNode(my);
				}
			}
			else // end of path reached
			{
				ent_setState(my, STATE_IDLE);
				ent_setPath(my, NULL);
			}
		}
		
		wait(1);
	}
}