/*
 * Copyright (c) 2016-2020 Marco Hladik <marco@icculus.org>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF MIND, USE, DATA OR PROFITS, WHETHER
 * IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
 * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

/* parse info_node entities and convert them to FTE compatible routing data */
#define NODE_DEBUG

typedef struct node_s {
	vector origin;
	float radius;

	struct neighbour_s
	{
		int node;
		float dist;
		int flags;
	} *nb;
	int nb_count;
} node_t;

node_t *g_pNodes;
int g_iNodes;
int g_nodes_present;

/* info_nodes can do a lot more in theory, right now we don't */
class info_node { };

/* write current nodes to disk */
void Nodes_Save(string);
void Nodes_Load(string);
void Nodes_Init(void)
