搜索资源列表
mathmodelMATLABcode
- 数学建模各种模型的MATLAB源码,包括灰色模型、回归模型及回归检验、最小生成树、最短路径等-Mathematical Modeling of the MATLAB source models, including the gray model, regression model and regression testing, minimum spanning tree, shortest path, etc.
ds_3
- 有向无环图的拓扑排序 用邻接矩阵保存图,边的输入采用三元组(求最短路径)和二元组(拓扑排序)。-DAG topological sort of the adjacency matrix with the preservation plan, while the use of triple input (for the shortest path) and the dual group (topological sort).
floyd
- 求最短路径的最短距离!功能强大···不容置疑-The shortest path for the shortest distance! No doubt a powerful
Dijkstra
- 最短路径算法 C语言版的 很好用 需要的试试吧-Shortest path algorithm C language version of the well with
df
- 给定 N (1 < N < 100 000) 个小于等于 10000 的正整数组成的序列和一个正整数 S (S < 100 000 000)。请编写一个程序,查找该序列中是否有连续元素组成的子序列,其和大于等于 S。如果找到,则输出符合条件的最短子序列的长度,如果没有找到,则输出 0-Given N (1 < N < 100 000) were less than or equal to 10000, composed of positive integer seque
network
- 用神经网络的方法计算最短路径,用例子的方式计算出了五个城市间的最短距离。-Neural network with the shortest path method
OSPF
- OSPF- Open shortest path first. which a routing protocol. uses IP version 4-OSPF- Open shortest path first. which a routing protocol. uses IP version 4
Dijkstra_exe
- Dijkstra by C is so great for solving algorithm find the shortest path with weigth!
bfs-src
- 1.程序基于java语言。运行要求java运行环境。即就使jdk1.2以上。否则程序无法运行。 2.程序中读图时,可以选择读有向图还是无向图。 3.本程序为一个图的综合运行环境。提供了图的各种操作。包括读图,DFS判断图中是否存在 环路,BFS全局访问,两点之间的最短路径,屏幕清空。并且跟踪说明了图的各种操作的 过程。 4.程序可以多次的读图,进行图的各种操作。点击面板上的各种按钮就可以进行各种操作。-1. Procedures based on the java language.
shortestpath
- 最短路径算法,超级经典的,欢迎大家下载,谢谢啊!-Shortest path algorithm, super-classic, welcome to download
JinChengDiaoDu
- 进程高度模拟,分别采用先来先服务(FCFS),最短作业优先(SJF)、响应比高者优先(HRN)的调度算法。-The process of a high degree of simulation, using the First Come First Served (FCFS), shortest operation priority (SJF), respond to high priority (HRN) scheduling algorithm.
MiniPass
- 自己上学编的基于Dijkstra的最短路径&最大流量java源码,图论部分用Rot语言描述,带junit测试程序-Navigation finds the shortest (and/or) path between points on a map using the Dijkstra algorithm
tanxin
- 算法设计与分析中贪心算法C++实现代码 包括但愿最短路径问题,哈弗曼编码,整数最有分解,最小生成树,最优分解,删数问题等-Algorithm Design and Analysis of greedy algorithm in C++ code, including the realization of hope that the shortest path problem,哈弗曼coding, the most integral decomposition, minimum spanning
AntOnStick
- 蚂蚁爬杆,有c#图形界面,能计算出所有蚂蚁爬出杆的最短,最长的时间-Ants crawling under, and c# graphical interface that can calculate all the ants out of the shortest rod, the longest time
graph
- 图的遍历,能够快速找到图中的最短路径,复杂度低-Graph traversal, can quickly find the shortest path map, low complexity
dongtaiguihua
- 该程序实现了动态规划问题,这样来求最短路径 绝对原创-The program achieved a dynamic programming problem, so that the shortest path to seeking absolute originality I would like to thank
HUFFMAN
- 在电报收发、数据通信过程中,可使用前缀编码使字符编码的平均长度最短。这种前缀编码可通过构造哈夫曼树的方式来实现。 算法输入:各字符及其权值。 算法输出:各字符的编码串 -In his cable, transceiver, data communication process, can use the prefix encoding character encoding so that the average length of the shortest. This prefix H
zuiduanwenti
- 关于全球若干大城市之间最短距离问题的解决,数学建模-A number of major cities on the global problem of the shortest distance between the solution of mathematical modeling
S030602102
- 赋权有向图中心问题 问题描述: 设G=(V,E)是一个赋权有向图,v是G的一个顶点, v的偏心距定义为: Max {w∈ V,从w到v的最短路径长度} G中偏心距最小的顶点称为G的中心。试利用Floyd 算法设计一个求赋权有向图中心的算法。-Empowering the central issue Digraph Problem Descr iption: Let G = (V, E) is a directed graph Empoweri
zuiduanlujingwenti
- 最短路径问题的PPT描述,在数学建模上的广泛应用-PPT shortest path problem described in the mathematical modeling on a wide range of applications