apaki/unicstl
1
0
Fork 0
mirror of https://gitee.com/apaki/unicstl.git synced 2025-05-18 03:51:35 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

顶点链表方式调试通过

Browse Source
This commit is contained in:
建峰 2025-04-25 14:04:14 +08:00
parent 238c16c3ec
commit 0520bb99ae
2 changed files with 120 additions and 112 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

207
src/graph.c
View File

@ -310,119 +310,9 @@ void graph_free(graph_t *graph)
#endif #endif
static uint32_t graph_size(struct _graph* self)
{
if(self == NULL)
{
return 0;
}
return self->_size;
}
static bool graph_empty(struct _graph* self)
{
if(self == NULL)
{
return 0;
}
return self->size(self) == 0;
}
static uint32_t graph_capacity(struct _graph* self)
{
if(self == NULL)
{
return 0;
}
return self->_capacity;
}
static bool graph_clear(struct _graph *self)
{
if(self == NULL && self->_head == NULL)
{
return 0;
}
// for(uint32_t i = 0; i < self->_capacity; i++)
// {
// for(uint32_t j = 0; j < self->_capacity; j++)
// {
// self->_head->edge[i][j] = 0;
// }
// }
self->_size = 0;
return true;
}
static void graph_destory(struct _graph *self)
{
if(self == NULL)
{
return;
}
self->clear(self);
// if(self->_head != NULL)
// {
// if(self->_head->visited != NULL)
// {
// free(self->_head->visited);
// }
// if(self->_head->obj != NULL)
// {
// free(self->_head->obj);
// }
// if(self->_head->edge != NULL)
// {
// for(uint32_t i = 0; i < self->_capacity; i++)
// {
// if(self->_head->edge[i] != NULL)
// {
// free(self->_head->edge[i]);
// }
// }
// free(self->_head->edge);
// }
// free(self->_head);
// self->_head = NULL;
// }
}
static void graph_print(struct _graph *self)
{
if(self == NULL || self->_head == NULL || self->print_obj == NULL)
{
return;
}
printf("vertex : \n");
struct _graph_node * cur = self->_head->next;
while(cur != NULL)
{
self->print_obj(cur->obj);
cur = cur->next;
}
// printf("\n ");
// for(uint32_t i = 0; i < self->_capacity; i++)
// {
// self->print_obj((char *)self->_head->obj + i * self->_obj_size);
// }
// printf("\n");
// for(uint32_t i = 0; i < self->_capacity; i++)
// {
// self->print_obj((char *)self->_head->obj + i * self->_obj_size);
// for(uint32_t j = 0; j < self->_capacity; j++)
// {
// printf(" %2d ", self->_head->edge[i][j]);
// }
// printf("\n");
// }
printf("\n");
printf("print done.\n");
}
static struct _graph_node* graph_node_new(void *obj, uint32_t obj_size) static struct _graph_node* graph_node_new(void *obj, uint32_t obj_size)
{ {
@ -469,6 +359,103 @@ static void greph_node_free(struct _graph_node** node)
} }
} }
static uint32_t graph_size(struct _graph* self)
{
if(self == NULL)
{
return 0;
}
return self->_size;
}
static bool graph_empty(struct _graph* self)
{
if(self == NULL)
{
return 0;
}
return self->size(self) == 0;
}
static uint32_t graph_capacity(struct _graph* self)
{
if(self == NULL)
{
return 0;
}
return self->_capacity;
}
static bool graph_clear(struct _graph *self)
{
if(self == NULL && self->_head == NULL)
{
return 0;
}
struct _graph_node *cur = self->_head->next;
struct _graph_node *next = NULL;
while(cur != NULL)
{
next = cur->next;
greph_node_free(&cur);
cur = next;
}
self->_head->next = NULL;
self->_size = 0;
return true;
}
static void graph_destory(struct _graph *self)
{
if(self == NULL)
{
return;
}
self->clear(self);
if(self->_head != NULL)
{
free(self->_head);
self->_head = NULL;
}
}
static void graph_print(struct _graph *self)
{
if(self == NULL || self->_head == NULL || self->print_obj == NULL)
{
return;
}
printf("vertex : \n");
struct _graph_node * cur = self->_head->next;
while(cur != NULL)
{
self->print_obj(cur->obj);
cur = cur->next;
}
// printf("\n ");
// for(uint32_t i = 0; i < self->_capacity; i++)
// {
// self->print_obj((char *)self->_head->obj + i * self->_obj_size);
// }
// printf("\n");
// for(uint32_t i = 0; i < self->_capacity; i++)
// {
// self->print_obj((char *)self->_head->obj + i * self->_obj_size);
// for(uint32_t j = 0; j < self->_capacity; j++)
// {
// printf(" %2d ", self->_head->edge[i][j]);
// }
// printf("\n");
// }
printf("\n");
printf("print done.\n");
}
static bool graph_add_vertex(struct _graph* self, void* obj) static bool graph_add_vertex(struct _graph* self, void* obj)
{ {
assert(self != NULL); assert(self != NULL);

25
test/test_graph.c
View File

@ -32,17 +32,38 @@ void test_graph_add_vertex(void)
graph->compare = compare_num; graph->compare = compare_num;
graph->print_obj = print_num; graph->print_obj = print_num;
// test add_vertex
for(i = 0; i < size; i++) for(i = 0; i < size; i++)
{ {
TEST_ASSERT_TRUE(graph->add_vertex(graph, &data[i])); TEST_ASSERT_TRUE(graph->add_vertex(graph, &data[i]));
} }
graph->print(graph); // graph->print(graph);
TEST_ASSERT_TRUE(graph->find_vertex(graph, &data[0])); TEST_ASSERT_TRUE(graph->find_vertex(graph, &data[0]));
TEST_ASSERT_TRUE(graph->find_vertex(graph, &data[9])); TEST_ASSERT_TRUE(graph->find_vertex(graph, &data[9]));
TEST_ASSERT_FALSE(graph->find_vertex(graph, &temp)); TEST_ASSERT_FALSE(graph->find_vertex(graph, &temp));
// test del_vertex
TEST_ASSERT_TRUE(graph->del_vertex(graph, &data[0]));
TEST_ASSERT_FALSE(graph->find_vertex(graph, &data[0]));
// graph->print(graph);
for(i = 1; i < size; i++)
{
TEST_ASSERT_TRUE(graph->del_vertex(graph, &data[i]));
}
TEST_ASSERT_TRUE(graph->empty(graph));
// test clear
for(i = 0; i < size; i++)
{
TEST_ASSERT_TRUE(graph->add_vertex(graph, &data[i]));
}
// graph->print(graph);
graph->clear(graph);
// graph->print(graph);
TEST_ASSERT_TRUE(graph->empty(graph));
graph_free(&graph); graph_free(&graph);
TEST_ASSERT_NULL(graph); TEST_ASSERT_NULL(graph);