资源列表
[数据结构常用算法] jiudinizhi
说明：数据结构实验，对链表中的数据进行就地逆置。-Experimental data structure of linked list data in place against the home.<吴心> 在 2025-06-16 上传 | 大小：1kb | 下载：0
[数据结构常用算法] numberconversion
说明：VC++ 数据结构 实验算法 数制转换.c-VC++ data structures algorithm number system conversion experiments. Cpp<张晓光> 在 2025-06-16 上传 | 大小：1kb | 下载：0
[数据结构常用算法] LinkListTest
说明：简单的单链表,增强版单链表,排序链表(从小到大)以及双端链表的头插法和尾插法。-LinkedList<刘岚> 在 2025-06-16 上传 | 大小：1kb | 下载：0
[数据结构常用算法] DIJKSTRA
说明：Suppose you want to find the shortest path between two intersections on a map, a starting point and a destination. To accomplish this, you could highlight the streets (tracing the streets with a marker) in a certain order, until you have a route high<synthia> 在 2025-06-16 上传 | 大小：1kb | 下载：0
[数据结构常用算法] KRUSKAL
说明： * create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimum weight from S o<synthia> 在 2025-06-16 上传 | 大小：1kb | 下载：0
[数据结构常用算法] my_BFS
说明： 1. Enqueue the root node. 2. Dequeue a node and examine it. * If the element sought is found in this node, quit the search and return a result. * Otherwise enqueue any successors (the direct child nodes) that have not yet been discovered.<synthia> 在 2025-06-16 上传 | 大小：1kb | 下载：0
[数据结构常用算法] MY_DFS
说明：DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. Then the search backtracks, retur<synthia> 在 2025-06-16 上传 | 大小：1kb | 下载：0
[数据结构常用算法] MY_QUICK
说明： 1. Pick an element, called a pivot, from the list. 2. Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way<synthia> 在 2025-06-16 上传 | 大小：1kb | 下载：0