Search - shortest path

Search - shortest path - List

[Other] CCNA_noteboot DL : 0: 第一章：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 a Cisco Interwork 第十章：Managing Traffic with Access Lists 第十一章：Wide Area Networking Protocols-Chapter I: Internetworking Chapter II: Internet Protocols Chapter III: IP Subnetting and Variable Length Subnet Masks (VLSM) Chapter IV: Introduction to the Cisco IOS Chapter V: IP Routing Chapter VI: Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF) Chapter VII: Layer 2 Switching Chapter VIII: Virtual LANs (VLANs) Chapter IX: Managing a Cisco Interwork Chapter X: Managing Traffic with Access Lists Chapter XI: Wide Area Networking Protocols
Date : 2025-12-31 Size : 2.09mb User : 林长虹
[Other] MO+BestPathSolution DL : 0: Mapobjecst最短路径的计算方法,-Mapobjecst the method of calculating the shortest path,
Date : 2025-12-31 Size : 539kb User : zhoujh
[Other] HospitalVellage DL : 0: 村庄与最近医院问题（最短路径）-Villages with the nearest hospital problems (shortest path)
Date : 2025-12-31 Size : 26kb User : ray
[Other] SHORTEST DL : 0: 开放式最短路径优先，基本的OSPF配置，给O S P F配置接口参数-Open Shortest Path First, OSPF basic configuration, the OSPF interface configuration parameters
Date : 2025-12-31 Size : 2.52mb User : 余婷
[Other] data1 DL : 0: lingo程序代码，用于计算点数比较少的路径最短问题-code lingo, relatively few points used to calculate the shortest path problem
Date : 2025-12-31 Size : 2kb User : 黄庆伟
[Other] Floyid DL : 0: 这是改进的Floyid算法程序，用于计算多源最短路，能计算最短路径的基础上，根据每段路的行驶时间，计算出对应最短路的时间矩阵，同时计算出路由矩阵。-This is the improved algorithm Floyid procedures used to calculate the multi-source shortest path, shortest-path could be calculated based on the traveling time each way, to calculate the time corresponding to the shortest path matrix, calculated at the same time a way out from the matrix.
Date : 2025-12-31 Size : 3kb User : 黄建
[Other] CcnaNote DL : 0: CCNA菜鸟笔记 2006版包含以下内容：第一章网际互联第二章因特网协议第三章 IP 子网划分和变长子网掩码（VLSM）第四章 Cisco IOS 简介第五章 IP 路由第六章增强 IGRP（EIGRP）和开放最短路径优先（OSPF）第七章虚拟局域网（VLAN）第八章管理 Cisco 互联网络第九章局域网类故障第十章使用访问列表管理流量第十一章广域网协议 -Rookie CCNA Notes, 2006 Edition contains the following contents: Chapter I Chapter II internetworking Chapter III of Internet Protocol IP subnetting and variable length subnet mask (VLSM) About Cisco IOS Chapter IV Chapter V Chapter VI IP Routing Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF) Chapter VII of the virtual LAN (VLAN) of Chapter VIII of the management of Cisco LAN Internet Chapter IX Chapter X-type fault management using the access list WAN traffic agreement Chapter XI
Date : 2025-12-31 Size : 2.33mb User : 申亚囡
[Other] dijkstra_and_floyd_matlab DL : 0: floyd和DIJKSTRA最短路径算法经典实用！-floyd and the classic shortest path algorithm Dijkstra practical!
Date : 2025-12-31 Size : 1kb User : 朱吴乐
[Other] DataCommunicationNetwork DL : 0: 数据通信网络 1 概述， OSI 7层结构 2 数据链路层，帧，差错检测 3 重传算法 4 重传算法 5 排队模型-概述和Little定理 6 M/M/1, M/M/m, 队列，等 7 排队网络 8 M/G/1队列, M/G/1 w/ 空闲 9 M/G/1 队列和保留, 优先队列 10 排队系统的稳定性 11 M/G/1队列占用率分布 12 测验 13 多路访问和Aloha 14 稳定的Aloha，树算法 15 CSMA, CSMA/CD和以太网 16 高速LANs，令牌环网，Satellite reservations 17 交换结构概述 18 高速交换调度 19 广播路由和生成树 20 最短路径路由 21 分布式路由算法，最佳路由 22 流量控制-窗口/方案 23 流量控制-基于速率的方案 24 运输层和TCP/IP 25 ATM网络 26 特别专题：光网络和无线网络-Data Communication Network An overview, OSI 7-layer structure of two data link layer, frames, error detection 3 Retransmission Retransmission Algorithm 4 Algorithm 5 queuing model- Overview and Little Theorem 6 M/M/1, M/M/m, queues, and so on 7 8 M/G/1 queue, queuing networks, M/G/1 w/free 9 M/G/1 queue, and reservations, priority queue 10, queuing system, the stability of the 11 M/G/1 queue, the distribution of the occupancy rate of 12 tests over 13 Road access and Aloha 14 stable Aloha, tree algorithm 15 CSMA, CSMA/CD and 16 high-speed Ethernet LANs, token ring network, Satellite reservations 17 switching architecture overview of 18 high-speed switch scheduling 19 broadcast routing and shortest path spanning tree 20 Route 21 Distributed routing algorithm, the best route 22 traffic control- windows/programs, 23 traffic control- rate-based program of 24 transport layer and the TCP/IP 25 ATM network of 26 Special topic: optical networking and wireless networks
Date : 2025-12-31 Size : 4.8mb User : 孙琛
[Other] Graphtheory DL : 0: 图论的算法书籍，书中包含许多经典的例子，入门用。章节：1基本概念 2最短路径 3最小生成树 4图的连通性 5支配集与独立集 6网络流 7匹配 8着色 9可行遍性-Graph theory, algorithms books, the book contains many classic examples of entry to use. Chapters: a basic concept of two shortest path minimal spanning tree 4 Figure 3 connectivity of five dominating set and independent set of six matching network flow 7 of 8 coloring 9 viable over the
Date : 2025-12-31 Size : 4.1mb User : wlx
[Other] Shortest-path DL : 0: 】本文紧密结合城市公交的特点，利用改进Dijkstra 算法开发出一个针对城市道路系统的最短路径自动搜索信息系统，该系统通过在ArcGIS 环境下建立空间数据库和属性数据库，在VB 环境下利用改进Dijsktra 算法对 ArcObjects 控件进行二次开发而设计完成，能在0. 21s 完成500 多个交叉口的计算并找出其最短路径，是一种实用的、有效的最短路径分析解决方案。-Abstract: Integrating the character of urban public traffic tightly，the paper tapped an automatic hunting information system for the shortest path of logistics deliver using the improved Dijkstra method，the purpose of the paper was to find the shortest path of two stations，the basic data of the system was constituted in the environment of ArcGIS including the spatial and attribute data and exploited in the VB condition by ArcObjects widget. The system could calculate five hundred crossway-points simultaneously in 0. 21s and find the shortest path，to prove that it is an applied and efficient solution in settling the shortest path of urban public traffic.
Date : 2025-12-31 Size : 220kb User : niuliang
[Other] Shortest-path-algorithm- DL : 0: 最短路径算法原理及C++程序和m文件程序-Shortest path algorithm and C++ program and m file program
Date : 2025-12-31 Size : 107kb User : 董华卓
[Other] ACS DL : 0: 蚁群算法实现最短路径，代码有注释，容易理解。-The ant colony algorithm to achieve the shortest path, annotated code, easy to understand.
Date : 2025-12-31 Size : 2kb User : sky
[Other] flash DL : 0: 用flash实现的火材人跑步动画，实现简单，可供学习！-The ant colony algorithm to achieve the shortest path, annotated code, easy to understand.
Date : 2025-12-31 Size : 12kb User : sky
[Other] short-path-Inherit-Algori DL : 0: 本文主要讨论了用改进的遗传算法求解最短路径的方法。-This article focuses on improved genetic algorithm for solving the shortest path.
Date : 2025-12-31 Size : 281kb User : zijian
[Other] algorithm-for-spt DL : 0: 在已有的动态更新最短路径树(Shrotest Pat h Tree ,SPT) 算法的基础上,提出节点发生变化时更新SPT 的方案,与SPT 中权值发生变化时更新SPT 的方案相结合,提出处理网络拓扑变化的完全动态SPT(Completely Dynamic of Shortest Path Tree , CD_SPT ) 算法。-Complete dynamic algorithm for updating shortest path tree
Date : 2025-12-31 Size : 611kb User : jia yu
[Other] Shortest-Paths DL : 0: 计算机算法基础中，求最短路径算法的源代码，C语言编写！-Computer algorithm based on the source code, find the shortest path algorithm, C language!
Date : 2025-12-31 Size : 728kb User : chenj
[Other] 1--OPEN-SHORTEST-PATH-FIRST(OSPF) DL : 0: Biggest advantage of OSPF over EIGRP is that it will run on any device as its based on open standard
Date : 2025-12-31 Size : 17kb User : osama
[Other] OSPF-Routing-Protocol DL : 0: In this article w ill learn about the OSPF Routing Protocol Open-Shortest-Path-First (OSPF) is the most widely used interior gateway protocol routing protocol on the world because it is a public (non-proprietary) routing protocol while its biggest rival, EIGRP, is a Cisco proprietary protocol so other vendors can’t use it. OSPF is a complex link-state routing protocol. Link-state routing protocols generate routing updates only when a change occurs in the network topology. When a link changes state, the device that detected the change creates a link-state advertisement (LSA) concerning that link and sends to all neighboring devices using a special multicast address. Each routing device takes a copy of the LSA, updates its link-state database (LSDB), and forwards the LSA to all neighboring devices -In this article we will learn about the OSPF Routing Protocol Open-Shortest-Path-First (OSPF) is the most widely used interior gateway protocol routing protocol on the world because it is a public (non-proprietary) routing protocol while its biggest rival, EIGRP, is a Cisco proprietary protocol so other vendors can’t use it. OSPF is a complex link-state routing protocol. Link-state routing protocols generate routing updates only when a change occurs in the network topology. When a link changes state, the device that detected the change creates a link-state advertisement (LSA) concerning that link and sends to all neighboring devices using a special multicast address. Each routing device takes a copy of the LSA, updates its link-state database (LSDB), and forwards the LSA to all neighboring devices
Date : 2025-12-31 Size : 263kb User : osama
[Other] 1 DL : 0: 最短路径实现 A*算法给需要的朋友们 -A* algorithm to achieve the shortest path to the need to thank my friends
Date : 2025-12-31 Size : 108kb User : 许和

« 12 »