Shortest
共 51 篇文章
Shortest 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 51 篇文章，持续更新中。
Dijkstra for the shortest path algorithm
Dijkstra for the shortest path algorithm
This code implements the shortest path algorithm via the simple scheme and fibonacci heap data struc
This code implements the shortest path algorithm via the simple scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file,
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each c
this is use the matlab...routing protocol shortest path algorithm
this is use the matlab...routing protocol
shortest path algorithm
最短路径方法The shortest path method
最短路径方法The shortest path method
adhoc in c & c++ it hepls finding the shortest path among adhoc network . it provides advance protoc
adhoc in c & c++ it hepls finding the shortest path among adhoc network . it provides advance protocols to find distence vector
matlab最短路的贪心算法
matlab最短路的贪心算法，用VC++实现，把ShortEst.dll复制到matlab工作文件夹运行（先要运行mex-setup，关联VC与MATLAB）调用方法如
a = [-1,2,3 2,-1,4 3,4,-1]
ShorstEst(a)
即可
Dijkstra by C is so great for solving algorithm find the shortest path with weigth!
Dijkstra by C is so great for solving algorithm find the shortest path with weigth!
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algo
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly onc
Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述： a)初始化：d
Floyd-Warshall算法描述
1)适用范围：
a)APSP(All Pairs Shortest Paths)
b)稠密图效果最佳
c)边权可正可负
2)算法描述：
a)初始化：dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] The
tcp ip协议详解 中文版PDF
<p>
很多不同的厂家生产各种型号的计算机，它们运行完全不同的操作系统，但TCP.IP协议族允许它们互相进行通信。这一点很让人感到吃惊，因为它的作用已远远超出了起初的设想。T C P / I P起源于6 0年代末美国政府资助的一个分组交换网络研究项目，到9 0年代已发展成为计算机之间最常应用的组网形式。它是一个真正的开放系统，因为协议族的定义及其多种实现可以不用花钱或花很少的钱就可以公开地得到。