搜索资源列表
huajdj
- 哈夫曼树中,树的带权路径长度的含义是各个字符的码长与其出现的此时的乘积和, 也就是电文的代码总长,所以采用哈夫曼树构造的编码是一种能使电文代码总长最短的 不等长编码。-Huffman tree. tree with the right path length is the meaning of the various characters code length of time with the product and, is the message code chief Therefo
dao-you-xi-tong
- 设计连云港市导游系统。以图中顶点表示各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。 提供图中任意景点查询，即求任意两点间的所有路径。 导游图的景点和道路的修改扩充功能。 -Lianyungang City guide system design. To vertices that the attractions
floyd
- 此源码是算法floyd算法的实现,里面有我自己详细解说的几个重点，对于学习图论很有帮助，用于求任意两点间最短路径和路径长度-This source is the realization of the algorithm floyd algorithm, which has my own detailed explanation of several key helpful for learning graph theory, used to find the shortest path betw
5
- 已知一个有向带权图G和图中某个源点V0，求得从该源点V0到图中其它各个顶点之间 的最短路径。-Given a directed weighted graph G and a source figure V0, V0 obtained from the source to the other drawing the shortest path between the vertices.
xiaoyuandaohang
- 实现校园导航和校园景点介绍以及任意两景点间最短路径-Navigation in campus and campus attractions as well as the shortest path between any two points of interest
QPSK_modulation-and-Dijkstra-method
- 介绍了qpsk调制解调及Dijkstra最短路径算法，并给出了仿真的结果和程序。-Introduced qpsk modem and Dijkstra shortest path algorithm, and the simulation results and procedures.