170 lines
3.8 KiB
C
170 lines
3.8 KiB
C
/*
|
|
* edges.c
|
|
* a part of libbubulle from tTh
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "bubulles.h"
|
|
#include "edges.h"
|
|
|
|
/* --------------------------------------------------------------------- */
|
|
EdgeList * alloc_edgelist(char *name, int sz, int flags)
|
|
{
|
|
EdgeList *elptr;
|
|
AnEdge *array;
|
|
|
|
fprintf(stderr, ">>> %s ( '%s' %d 0x%X )\n", __func__, name, sz, flags);
|
|
|
|
if (NULL==(elptr = calloc(1, sizeof(EdgeList)))) {
|
|
fprintf(stderr, "no mem available in %s\n", __func__);
|
|
return NULL;
|
|
}
|
|
memset(elptr, 0, sizeof(EdgeList));
|
|
|
|
if (NULL==(array = calloc(sz, sizeof(Bubulle)))) {
|
|
fprintf(stderr, "no mem available in %s\n", __func__);
|
|
free(elptr);
|
|
return NULL;
|
|
}
|
|
elptr->edges = array;
|
|
|
|
if ( (NULL != name) && (strlen(name) < SZ_BUBULLE_TEXT) )
|
|
strcpy(elptr->name, name);
|
|
else
|
|
strcpy(elptr->name, "noname");
|
|
|
|
elptr->magic = 0x55555555;
|
|
elptr->size = sz;
|
|
elptr->flags = flags;
|
|
|
|
return elptr;
|
|
}
|
|
/* --------------------------------------------------------------------- */
|
|
int free_edgelist(EdgeList *list, int k)
|
|
{
|
|
|
|
fprintf(stderr, ">>> %s ( %p 0x%X )\n", __func__, list, k);
|
|
|
|
if (k) {
|
|
fprintf(stderr, "%s: k must be 0, was %d\n", __func__, k);
|
|
return k;
|
|
}
|
|
|
|
free(list->edges);
|
|
|
|
memset(list, 0, sizeof(EdgeList));
|
|
free(list);
|
|
|
|
return 0;
|
|
}
|
|
/* --------------------------------------------------------------------- */
|
|
/*
|
|
* we have two functions for adding an edge to a list
|
|
* the first one add unconditionnaly the edge to the
|
|
* (non full) list...
|
|
*/
|
|
int push_an_edge(EdgeList *list, int p0, int p1)
|
|
{
|
|
|
|
#if DEBUG_LEVEL
|
|
fprintf(stderr, ">>> %s ( %p %d %d )\n", __func__, list, p0, p1);
|
|
#endif
|
|
|
|
if (list->fidx >= list->size) {
|
|
fprintf(stderr, "%s: w're doomed and overflowed\n", __func__);
|
|
#if MUST_ABORT
|
|
abort();
|
|
#endif
|
|
return -1;
|
|
}
|
|
list->edges[list->fidx].A = p0;
|
|
list->edges[list->fidx].B = p1;
|
|
list->fidx ++;
|
|
return 0;
|
|
}
|
|
/*
|
|
* and the second only insert an edge if it was missing
|
|
* from the currently know list.
|
|
*/
|
|
int push_a_missing_edge(EdgeList *list, int p0, int p1)
|
|
{
|
|
#if DEBUG_LEVEL
|
|
fprintf(stderr, ">>> %s ( %p %d %d )\n", __func__, list, p0, p1);
|
|
#endif
|
|
|
|
if (list->fidx >= list->size) {
|
|
fprintf(stderr, "%s: w're doomed and overflowed\n", __func__);
|
|
#if MUST_ABORT
|
|
abort();
|
|
#endif
|
|
return -1;
|
|
}
|
|
|
|
if ( ! is_edge_in_list(list, p0, p1) ) {
|
|
list->edges[list->fidx].A = p0;
|
|
list->edges[list->fidx].B = p1;
|
|
list->fidx ++;
|
|
}
|
|
return 0;
|
|
}
|
|
/* --------------------------------------------------------------------- */
|
|
/*
|
|
* with this func, you can search for duplicates
|
|
*/
|
|
int is_edge_in_list(EdgeList *list, int p0, int p1)
|
|
{
|
|
int idx;
|
|
|
|
for (idx=0; idx < list->fidx; idx++) {
|
|
if ( (list->edges[idx].A == p0) &&
|
|
(list->edges[idx].B == p1) ) return 1;
|
|
|
|
if ( (list->edges[idx].A == p1) &&
|
|
(list->edges[idx].B == p0) ) return 2;
|
|
}
|
|
|
|
return 0; /* NOT FOUND */
|
|
}
|
|
/* --------------------------------------------------------------------- */
|
|
int print_edgelist_desc(EdgeList *list, int k)
|
|
{
|
|
|
|
fprintf(stderr, "--- edgelist '%s' at %p\n", list->name, list);
|
|
|
|
if (k) {
|
|
fprintf(stderr, "%s: k must be 0, was %d\n", __func__, k);
|
|
return k;
|
|
}
|
|
|
|
fprintf(stderr, " array @ %p\n", list->edges);
|
|
fprintf(stderr, " size %8d\n", list->size);
|
|
fprintf(stderr, " next free %8d\n", list->fidx);
|
|
// fprintf(stderr, " magic 0x%08X\n", list->magic);
|
|
|
|
return 0;
|
|
}
|
|
/* --------------------------------------------------------------------- */
|
|
int print_the_edges(EdgeList *list, int k)
|
|
{
|
|
int foo;
|
|
|
|
fprintf(stderr, ">>> %s ( %p %d )\n", __func__, list, k);
|
|
|
|
if (k) {
|
|
fprintf(stderr, "In %s, k must be 0, was %d\n", __func__, k);
|
|
return k;
|
|
}
|
|
|
|
fprintf(stderr, " list.fidx = %d\n", list->fidx);
|
|
|
|
for (foo=0; foo<list->fidx; foo++) {
|
|
printf("%d\t\t%5d %5d\n", foo, list->edges[foo].A, list->edges[foo].B);
|
|
}
|
|
|
|
return -1;
|
|
}
|
|
/* --------------------------------------------------------------------- */
|