mirror of
https://gitee.com/apaki/unicstl.git
synced 2026-05-28 22:54:19 +08:00
jf-home
26eeb65cc9
- 将所有打印和比较函数的参数指针从 `void*` 修改为 `const void*`，增强类型安全 - 引入自定义断言宏 `unicstl_assert` 及其实现，替换标准 `assert` - 优化动态数组容量增长策略，新增 `unicstl_new_capacity` 函数 - 重构链表 接口：`push`/`pop` 重命名为 `push_back`/`pop_front`，新增 `push_front`/`pop_back`/`insert`/`remove`/`contains` 方法 - 移除链表结构体中未使用的 `_index_front` 和 `_index_back` 成员 - 在头文件中补充关键函数的时间复杂度注释
109 lines
2.3 KiB
C
109 lines
2.3 KiB
C
/**
|
|
* @file graph.h
|
|
* @author wenjf (Orig5826@163.com)
|
|
* @brief
|
|
* @version 0.1
|
|
* @date 2024-09-03
|
|
*
|
|
* @copyright Copyright (c) 2024
|
|
*
|
|
*/
|
|
#ifndef _GRAPH_H
|
|
#define _GRAPH_H
|
|
|
|
#include "unicstl_internal.h"
|
|
|
|
#include "stack.h"
|
|
#include "queue.h"
|
|
|
|
enum _graph_type
|
|
{
|
|
GRAPH_UNDIRECTED,
|
|
GRAPH_DIRECTED,
|
|
// GRAPH_UNDIRECTED_WEIGHT,
|
|
// GRAPH_DIRECTED_WEIGHT,
|
|
};
|
|
|
|
enum _graph_search
|
|
{
|
|
GRAPH_DFS,
|
|
GRAPH_BFS,
|
|
};
|
|
|
|
|
|
struct _graph_edge
|
|
{
|
|
uint32_t weight;
|
|
struct _graph_edge* next;
|
|
void *target;
|
|
};
|
|
|
|
struct _graph_node
|
|
{
|
|
void* obj;
|
|
struct _graph_node* next;
|
|
|
|
bool visited;
|
|
struct _graph_edge* edgehead;
|
|
};
|
|
|
|
struct _graph
|
|
{
|
|
// -------------------- private --------------------
|
|
struct _graph_node* _head;
|
|
|
|
uint32_t _size;
|
|
uint32_t _obj_size;
|
|
uint32_t _capacity;
|
|
uint32_t _ratio;
|
|
|
|
enum _graph_type _type;
|
|
enum _graph_search _search;
|
|
|
|
stack_t stack;
|
|
queue_t queue;
|
|
|
|
struct _iterator _iter;
|
|
|
|
void (*_destory)(struct _graph* self);
|
|
|
|
// -------------------- public --------------------
|
|
// kernel
|
|
// -> vertex
|
|
bool (*add_vertex)(struct _graph* self, void* obj);
|
|
bool (*del_vertex)(struct _graph* self, void* obj);
|
|
bool (*find_vertex)(struct _graph* self, void* obj);
|
|
// -> edge
|
|
bool (*add_edge)(struct _graph* self, void* from, void* to, uint32_t weight);
|
|
bool (*del_edge)(struct _graph* self, void* from, void* to);
|
|
bool (*find_edge)(struct _graph* self, void* from, void* to);
|
|
|
|
// base
|
|
uint32_t(*size)(struct _graph* self);
|
|
uint32_t(*capacity)(struct _graph* self);
|
|
bool (*empty)(struct _graph* self);
|
|
bool (*full)(struct _graph* self);
|
|
bool (*clear)(struct _graph* self);
|
|
|
|
// iter
|
|
iterator_t (*iter)(struct _graph* self, enum _graph_search search, void *obj);
|
|
|
|
// config
|
|
compare_fun_t compare; // !!! you have to implement this function
|
|
|
|
// others
|
|
bool (*from_matrix)(struct _graph* self, void* obj, uint32_t* edges, uint32_t size);
|
|
|
|
// -------------------- debug --------------------
|
|
void (*print)(struct _graph* self);
|
|
void (*print_obj)(const void* obj);
|
|
};
|
|
typedef struct _graph* graph_t;
|
|
|
|
graph_t graph_new(uint32_t obj_size);
|
|
// graph_t graph_new2(uint32_t obj_size, uint32_t capacity);
|
|
|
|
void graph_free(graph_t* graph);
|
|
|
|
#endif
|