Shortest
共 51 篇文章
Shortest 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 51 篇文章，持续更新中。
物流分析工具包。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,
single source shortest path
single source shortest path
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights o
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path
calculates the shortest path and distance between two nodes on a map
calculates the shortest path and distance between two nodes on a map
实现了蚁群算法求解TSP问题。注释详细 function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,
实现了蚁群算法求解TSP问题。注释详细
function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q)
-------------------------------------------------------------------------
主要
Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in
Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest path from s to every other vertex
this process is about how to get the shortest path, this process write by VC++.
this process is about how to get the shortest path, this process write by VC++.
这个说明倒不是说明函数的功能
这个说明倒不是说明函数的功能，只是声明一下函数中出现的问题。
shortest()函数没有问题，在secshortest中我希望只得到一条次短路（或几条roadcost()值相同的次短路），结果却出来好几条，我仔细检查了一下程序，应该没有什么问题。
因此在使用时，要得到次短路，只能用roadcost()函数分别求一下各条路的权重和，找到最小的。
有些奇怪
Program helping you to remember the route. It cab be route from conference room to coffee-room, it
Program helping you to remember the route.
It cab be route from conference room to coffee-room, it can be tourist trip, it can be pathway in labyrinth. during first traversal you make notes in you ph
第一章：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 Fir
tentang shortest path
tentang shortest path
OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表
OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表，以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。
开放最短路径优先协议(Open Shortest Path First，OSPF)是目前最主要的内部网关协议之一。通过本课程设计，学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认
There are many algorithms that can be applied to graphs. Many of these are actually used in the real
There are many algorithms that can be applied to graphs. Many of these are actually used in the real world,
such as Dijkstra’s algorithm to find shortest paths. We will discuss a few here.
C++图论算法
C++图论算法，dijistra shortest path， floyd shortest path等最短路算法
I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a s
I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a simple data structure, say simple scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say
k Shortest Paths David Eppstein s method ICTCLAS研究学习组 http://groups.google.com/group/ictclas?ms
k Shortest Paths
David Eppstein s method
ICTCLAS研究学习组
http://groups.google.com/group/ictclas?msg=subscribe
迷宫算法（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 m
Algoritm branch and bound and shortest path in C
Algoritm branch and bound and shortest path in C
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 rout
its for shortest path algorithm
its for shortest path algorithm