搜索资源列表
spanningtree
- 求解最小生成树问题，输入邻接矩阵权值，可以得到结果，使用于数据结构、图论和运筹学.-Solve the minimum spanning tree problem, enter the weight adjacency matrix, can be the result of the use of data structures, graph theory and operations research.
temp
- C 数据结构 A*算法 图论 矩阵 最短路径算法-C data structure matrix A* algorithm for shortest path algorithms on graph theory
juzhenfenxi(zhangxianda)
- 张贤达的矩阵分析，适合理论矩阵论知识的人用，不错的-Zhang XD matrix analysis, matrix theory, theory of knowledge for human use, good
shortest-path
- 最短路径算法，基于图论的网络图理论，代码简单，可以自行修改矩阵-Shortest path algorithm, network diagrams based on graph theory, a simple code, you can modify the matrix
C_Algorithma_datastruct_os
- 内容:操作系统相关算法,多线程,进程调度,死锁等 数据结构,堆栈,队列,链表,图论等 算法:数组,矩阵,海量数据处理,高精度计算,贪心算法,迷宫等:-Content: The operating system related algorithms, multi-threaded, process scheduling, deadlocks, etc. data structures, stacks, queues, linked lists, graph theory, etc. algor
数据结构图论
- 数据结构实验。 编写程序分别实现DG, DN, UDG, UDN的邻接矩阵和邻接表存储结构的构建； 以界面的形式给出构建类型的选择；(Data structure experiment. Write procedures to achieve DG, DN, UDG, UDN, adjacency matrix and adjacency table storage structure; The choice of type of construction is given in the
邻接矩阵与邻接表相互转化
- 数据结构图论部分，邻接矩阵转邻接表，用C语言实现，再加几个字才够20字(The data structure graph, adjacency matrix to the adjacency list, using C language, plus a few words to 20 words)