map_edge.c

/**
>HEADER
    Copyright (c) 2004 Haixu Tang hatang@indiana.edu

    This file is part of the RepGraph package.

    RepGraph is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    RepGraph is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with RepGraph.  If not, see <http://www.gnu.org/licenses/>.
<HEADER
**/

#include <stdinc.h>
#include <extvab.h>
#include <extfunc.h>

void add_path(NODES *vertex, int path_index, int path_pos);
void rem_path(NODES *vertex, int path_index, int path_pos);
void set_path(NODES **vertex, int num_vertex, PATH *path, int num_path);

void set_path(NODES **vertex, int num_vertex, PATH *path, int num_path)
{
	int	i, j, k;
	NODES	*begin;

	for(i = 0; i < num_vertex; i ++)	{
		vertex[i] -> num_path = 0;
	}

	for(i = 0; i < num_path; i ++)	{
		if(path[i].len_path == 0)	continue;
		begin = path[i].edge[0] -> begin;
		add_path(begin, i, 0);
		for(j = 0; j < path[i].len_path; j ++)	{
			begin = path[i].edge[j] -> end;
			add_path(begin, i, j + 1);
		}
	}
}

void rem_path(NODES *vertex, int path_index, int path_pos)
{
	int	i, j, k, l;
	int	*index, *pos;

	for(i = vertex -> num_path - 1; i >= 0; i --)	{
		if(vertex -> path_index[i] == path_index && vertex -> path_pos[i] == path_pos)	{
			for(j = i; j < vertex -> num_path - 1; j ++)	{
				vertex -> path_index[j] = vertex -> path_index[j + 1];
				vertex -> path_pos[j] = vertex -> path_pos[j + 1];
			}
			vertex -> num_path --;
		}
	}
}


void add_path(NODES *vertex, int path_index, int path_pos)
{
	int	i, j, k, l, label;
	int	*index, *pos;

	index = (int *) ckalloc((vertex -> num_path) * sizeof(int));
	pos = (int *) ckalloc((vertex -> num_path) * sizeof(int));
	for(i = 0; i < vertex -> num_path; i ++)	{
		index[i] = vertex -> path_index[i];
		pos[i] = vertex -> path_pos[i];
	}
	free((void *) vertex -> path_index);
	free((void *) vertex -> path_pos);
	vertex -> path_index = (int *) ckalloc((vertex -> num_path + 1) * sizeof(int));
	vertex -> path_pos = (int *) ckalloc((vertex -> num_path + 1) * sizeof(int));

	label = 0;
	for(i = 0; i < vertex -> num_path; i ++)	{
		vertex -> path_index[i] = index[i];
		vertex -> path_pos[i] = pos[i];
		if(index[i] == path_index && pos[i] == path_pos)	{
			label = 1;
		}
	}
	free((void *) index);
	free((void *) pos);
	if(label == 0)	{
		vertex -> path_index[vertex -> num_path] = path_index;
		vertex -> path_pos[vertex -> num_path] = path_pos;
		vertex -> num_path ++;
	}
}