资源列表
main
- 计算闭包完全最短路径，可自由输入闭包的顶点个数-fLOYD，Calculate the complete shortest path path, the number of vertices of the free input closure
Knap
- 背包问题的模板程序，可适应不同数据类型,使用了模板类-Template program knapsack problem can be adapted to different types of data, using a template class
Chinas-postal-problem
- 计算机离散数学-图论-中的中国邮路问题的一种解决方案，可在dev，VC下调试成功-Computer discrete mathematics- China postal problem in graph theory, a solution, can be in dev, VC debugging success
aly
- 写出将一个无向图的邻接矩阵转换成邻接表的算法-Write an undirected graph adjacency matrix algorithm converts adjacency list
als
- 每30个旅客同乘一条船将全船一半的旅客投入海中，30个人围成一圈，由第一个人数起，依次报数，数到第9人，便把他投入大海中 然后再从他的下一个人数起，数到第9人，再将他扔进大海中。如此循环地进行，直到剩下15个乘客为止。问哪些位置是将是被扔下大海的位置。-Each 30 passenger ride with a boat to ship half of the passengers into the sea, 30 people form a circle, starting the
A-topological-sort-of-directed-graph
- 数据结构中的有向图的拓扑排序算法基础程序，可在此基础上进行更改，主要构造了无向图、有向图和逆邻接图，使用c语言编程。-Data structure topological sort algorithm of the directed graph based program that can be changed, on the basis of the main structure undirected graph and directed graph and inverse adjacency
str2double
- Converts floating-point number to a string
Dijkstra
- 数据结构Dijkstra迪杰斯特拉带权有向图求最短路径算法，有图分析。-Data structure Dijkstra Dijkstra weighted directed graph algorithm for the shortest path between a figure analysis.
ConsoleApplication3
- 建立有n个单词的链表，重复单词只在链表中保留一个，出现次数高的单词前-The establishment of a n-word list, leaving only a repeated word in the list, the number of occurrences of a word before high
ConsoleApplication4
- 用Dijkstra算法求有向图G的v1顶点到其他顶点v的最短路径Path[v]及其距离Dist[v],以学校地点为例-With Dijkstra algorithm for a directed graph G vertices v1 shortest path to other vertex v Path [v] and its distance Dist [v], school locations Case
cfd2d
- This program was written for cfd simulation with 2D.
Preorder-binary-tree
- 使用C语言非递归方式实现中序遍历二叉树，-Non-recursive manner using C language to achieve binary tree traversal,