搜索：Shortest - 虫虫下载站

matlab例程  物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA)

物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spa ...

https://www.eeworm.com/dl/665/153823.html

下载: 52

查看: 1091

人工智能/神经网络  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 city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, s ...

https://www.eeworm.com/dl/650/198173.html

下载: 153

查看: 1075

matlab例程  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 once)

https://www.eeworm.com/dl/665/237671.html

下载: 29

查看: 1041

其他书籍  第一章：Internetworking 第二章：Internet Protocols 第三章：IP Subnetting and Variable Length Subnet Masks(VLS

第一章：Internetworking 第二章：Internet Protocols 第三章：IP Subnetting and Variable Length Subnet Masks(VLSM) 第四章：Introduction to the Cisco IOS 第五章：IP路由第六章：Enhanced IGRP(EIGRP) and Open Shortest Path First(OSPF) 第七章：Layer 2 Switching 第八章：Virtual LANs(VLANs) 第九章：Managing ...

https://www.eeworm.com/dl/542/290014.html

下载: 33

查看: 1057

Java编程  java Labyrinth game；Provides two kinds to produce map s way stochastically: The stochastic distribut

java Labyrinth game；Provides two kinds to produce map s way stochastically: The stochastic distribution point method and the chart depth first traversal the law two kinds.It can searches the shortest way to demonstrate automatically

https://www.eeworm.com/dl/633/307714.html

下载: 57

查看: 1048

Internet/网络编程  OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表

OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表，以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。开放最短路径优先协议(Open Shortest Path First，OSPF)是目前最主要的内部网关协议之一。通过本课程 ...

https://www.eeworm.com/dl/620/310758.html

下载: 57

查看: 1129

matlab例程  matlab最短路的贪心算法

matlab最短路的贪心算法，用VC++实现，把ShortEst.dll复制到matlab工作文件夹运行（先要运行mex-setup，关联VC与MATLAB）调用方法如 a = [-1,2,3 2,-1,4 3,4,-1] ShorstEst(a) 即可

https://www.eeworm.com/dl/665/408531.html

下载: 103

查看: 1096

DSP编程  This program sets up EVA Timer 1, EVA Timer 2, EVB Timer 3 and EVB Timer 4 to fire an interrupt on a

This program sets up EVA Timer 1, EVA Timer 2, EVB Timer 3 and EVB Timer 4 to fire an interrupt on a period overflow. A count is kept each time each interrupt passes through the interrupt service routine. EVA Timer 1 has the shortest period while EVB Timer4 has the longest period.

https://www.eeworm.com/dl/516/432076.html

下载: 62

查看: 1048

数值算法/人工智能  C++图论算法

C++图论算法，dijistra shortest path， floyd shortest path等最短路算法

https://www.eeworm.com/dl/518/444737.html

下载: 162

查看: 1077

数据结构  迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your prog ...

https://www.eeworm.com/dl/654/450069.html

下载: 163