EPA: AdjMatrix und AdjListe

This commit is contained in:
madmaurice 2016-02-11 11:40:16 +01:00
parent c656711625
commit 3f78b1903e
2 changed files with 175 additions and 0 deletions

112
adjliste.c Normal file
View File

@ -0,0 +1,112 @@
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <time.h>
#include <assert.h>
#define GET_CLOCK() ((float)clock() / CLOCKS_PER_SEC)
typedef uint32_t Node;
typedef struct node_list {
Node node;
struct node_list* next;
} *NodeList, NodeElement;
typedef struct {
NodeList* const node_lists;
uint32_t const node_count;
} AdjList;
AdjList al_Create(uint32_t node_count) {
NodeList* node_lists = malloc(sizeof(NodeList)*node_count);
for(Node i = 0; i < node_count; i++) {
node_lists[i] = NULL;
}
return (AdjList){ node_lists, node_count };
}
void al_AddEdge(AdjList al, Node nodefrom, Node nodeto) {
if(al.node_lists[nodefrom] == NULL) {
NodeElement* element = al.node_lists[nodefrom] = malloc(sizeof( NodeElement ));
element->node = nodeto;
element->next = NULL;
} else {
NodeElement* iter = al.node_lists[nodefrom];
while(iter->next != NULL) {
if(iter->node == nodeto) return;
iter = iter->next;
}
NodeElement* new = malloc(sizeof(NodeElement));
new->node = nodeto;
new->next = NULL;
iter->next = new;
}
}
void al_RemoveEdge(AdjList al, Node nodefrom, Node nodeto) {
if(al.node_lists[nodefrom] == NULL)
return;
else if(al.node_lists[nodefrom]->node == nodeto) {
NodeElement* element = al.node_lists[nodefrom];
al.node_lists[nodefrom] = element->next;
free(element);
} else if(al.node_lists[nodefrom]->next != NULL){
NodeElement* iter = al.node_lists[nodefrom];
while(iter->next->node != nodeto) {
if(iter->next == NULL) return;
iter = iter->next;
}
NodeElement* deleteme = iter->next;
iter->next = deleteme->next;
free(deleteme);
}
}
int al_TestEdge(AdjList al, Node nodefrom, Node nodeto) {
NodeElement* iter = al.node_lists[nodefrom];
while(iter != NULL) {
if(iter->node == nodeto) return 1;
iter = iter->next;
}
return 0;
}
void al_Free(AdjList al) {
for(Node i = 0; i < al.node_count; i++) {
NodeElement* iter = al.node_lists[i];
NodeElement* tmp;
while(iter != NULL) {
tmp = iter;
iter = iter->next;
free(tmp);
}
}
free(al.node_lists);
}
int main( int argc, char *argv[] ) {
AdjList b = al_Create(1000);
float start, end;
start = GET_CLOCK();
for(Node i = 0; i < 1000; i++) {
al_AddEdge(b,i,i);
for(Node j = i+1; j < i+49 && j < 1000; j++) {
al_AddEdge(b,i,j);
al_AddEdge(b,j,i);
}
}
end = GET_CLOCK();
printf("%.3f msecs\n", (end-start) * 1e3);
al_Free(b);
return 0;
}

63
bandmatrix.c Normal file
View File

@ -0,0 +1,63 @@
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <time.h>
#include <assert.h>
#define GET_CLOCK() ((float)clock() / CLOCKS_PER_SEC)
typedef uint32_t Node;
typedef struct {
uint8_t* edges;
uint32_t const node_count;
} Bandmatrix;
Bandmatrix bm_Create(uint32_t node_count) {
uint8_t* edges = malloc(sizeof(uint8_t) * node_count * node_count);
for(uint32_t i = 0; i < node_count*node_count; i++) {
edges[i] = 0;
}
return (Bandmatrix){ edges, node_count };
}
void bm_AddEdge(Bandmatrix b, Node nodefrom, Node nodeto) {
b.edges[nodefrom * b.node_count + nodeto] = 1;
}
void bm_RemoveEdge(Bandmatrix b, Node nodefrom, Node nodeto) {
b.edges[nodefrom * b.node_count + nodeto] = 0;
}
int bm_TestEdge(Bandmatrix b, Node nodefrom, Node nodeto) {
return b.edges[nodefrom * b.node_count + nodeto];
}
void bm_Free(Bandmatrix b) {
free(b.edges);
}
int main( int argc, char *argv[] ) {
Bandmatrix b = bm_Create(1000);
float start, end;
start = GET_CLOCK();
for(Node i = 0; i < 1000; i++) {
bm_AddEdge(b,i,i);
for(Node j = i+1; j < i+49 && j < 1000; j++) {
bm_AddEdge(b,i,j);
bm_AddEdge(b,j,i);
}
}
end = GET_CLOCK();
printf("%.3f msecs\n", (end-start) * 1e3);
bm_Free(b);
return 0;
}