xdklise的专栏

算法导论-带路径压缩的不相交集合C++实现//带路径压缩的不相交集合templatestruct Set{ int m_rank; //秩 Set* m_parent; //父节点 Type* m_data; //数据};templateSet* MakeSet(Type* data){ Set* node = new Set; node->m_parent =

算法导论--BFS、DFS及拓扑排序class Graph(object): _max_weight=10000 _White,_Gray,_Black=0,1,2 time = 0 def __init__(self): self._num=0 self._g=[] self._prev=[] s

链表插入排序#include#include#includetypedef struct _Node{ int val; struct _Node* next;}Node;typedef struct _Node List;List* Head = NULL,*Tail=NULL;int AddNode(int val){ Node* node = (Node*)