apaki/unicstl
1
0
Fork 0
mirror of https://gitee.com/apaki/unicstl.git synced 2025-05-17 11:31:37 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

graph结构体node重新规划

Browse Source
This commit is contained in:
建峰 2025-04-25 10:47:42 +08:00
parent c661ebaea6
commit b788dd74ee
1 changed files with 42 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

67
include/graph.h
View File

@ -1,63 +1,80 @@
/** /**
* @file graph.h * @file graph.h
* @author wenjf (Orig5826@163.com) * @author wenjf (Orig5826@163.com)
* @brief * @brief
* @version 0.1 * @version 0.1
* @date 2024-09-03 * @date 2024-09-03
* *
* @copyright Copyright (c) 2024 * @copyright Copyright (c) 2024
* *
*/ */
#ifndef _GRAPH_H #ifndef _GRAPH_H
#define _GRAPH_H #define _GRAPH_H
#include "common.h" #include "common.h"
struct _graph_node { struct _graph_edge
void *obj; {
uint32_t **edge; struct _graph_edge* _next;
uint8_t *visited; uint32_t weight;
}; };
struct _graph { struct _graph_vertex
{
void* obj;
struct _graph_edge* edge;
bool* visited;
};
struct _graph_node
{
struct _graph_vertex* edge;
};
struct _graph
{
// -------------------- private -------------------- // -------------------- private --------------------
struct _graph_node *_head; struct _graph_node* _head;
uint32_t **edges;
uint32_t _size; uint32_t _size;
uint32_t _obj_size; uint32_t _obj_size;
uint32_t _capacity; uint32_t _capacity;
uint32_t _ratio; uint32_t _ratio;
void (*_destory)(struct _graph *self); struct _iterator _iter;
void (*_destory)(struct _graph* self);
// -------------------- public -------------------- // -------------------- public --------------------
// kernel // kernel
bool (*add)(struct _graph *self, void *obj); bool (*add)(struct _graph* self, void* obj);
bool (*get)(struct _graph *self, uint32_t idx, void *obj); bool (*get)(struct _graph* self, uint32_t idx, void* obj);
bool (*remove)(struct _graph *self, uint32_t idx); bool (*remove)(struct _graph* self, uint32_t idx);
// traverse // traverse
bool (*dfs)(struct _graph *self, uint32_t idx); bool (*dfs)(struct _graph* self, uint32_t idx);
bool (*bfs)(struct _graph *self, uint32_t idx); bool (*bfs)(struct _graph* self, uint32_t idx);
// base // base
uint32_t (*size)(struct _graph *self); uint32_t(*size)(struct _graph* self);
uint32_t (*capacity)(struct _graph *self); uint32_t(*capacity)(struct _graph* self);
bool (*clear)(struct _graph *self); bool (*clear)(struct _graph* self);
bool (*empty)(struct _graph *self); bool (*empty)(struct _graph* self);
bool (*full)(struct _graph *self); bool (*full)(struct _graph* self);
// iter
iterator_t (*iter)(struct _graph* self);
// others // others
bool (*from_matrix)(struct _graph *self, void *obj, uint32_t *edges, uint32_t size); bool (*from_matrix)(struct _graph* self, void* obj, uint32_t* edges, uint32_t size);
// -------------------- debug -------------------- // -------------------- debug --------------------
void (*print)(struct _graph *self); void (*print)(struct _graph* self);
void (*print_obj)(void *obj); void (*print_obj)(void* obj);
}; };
typedef struct _graph* graph_t; typedef struct _graph* graph_t;
graph_t graph_new2(uint32_t obj_size, uint32_t capacity); graph_t graph_new2(uint32_t obj_size, uint32_t capacity);
void graph_free(graph_t *graph); void graph_free(graph_t* graph);
#endif #endif