搜索资源列表
rsscloud
- RSS cloud Feed 云 feed托管 路由-RSS cloud Feed feed hosted routing cloud
Decode
- 有能力约束车辆路径问题混合量子进化算法编码-Vehicle routing problem with capacity constraints coded quantum evolutionary algorithm
activerouter
- 实现ActiveRouter路由协议，主要是靠节点间病毒式传递信息-Routing protocol to achieve ActiveRouter，Rely mainly on viral transmission of information between nodes
PCB-manually-wiring-rules
- PCB手动布线规则 对初学PCB很有帮助 希望对从事电子行业的人员有所借鉴-PCB PCB manual routing rules to help beginners
NetWorkTest
- java距离链路路由 采用邻接矩阵 输入-Link routing algorithm Java
manolin-DV(New)
- 模拟路由器，距离向量算法实现路由更新。能向邻居节点发送路由信息，能够发送数据。-Analog router, distance vector routing algorithm updates. Can send routing information to neighbor nodes to send data.
datasource
- spring路由分配数据库源,在进行DAO操作前，通过上下文环境变量，获得数据源的类型-Database source routing allocation, during the DAO operations, context variables, the type of data source
algo
- This is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.
GrafoGrafic
- Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959,[1][2] is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a
WireRouter
- 用队列式分支界限法来求解布线问题. 从起始点a开始将它作为第一个扩展结点，把与该扩展结点相邻的可行的活结点加入到活结点队列，并把这些方格标记为1，表示从起始方格到这些方格的距离为1。接着从活结点队列中取出对列首结点作为下一个扩展结点，并把与当前结点相邻的且未标记的方格标记为2，并存入活结点队列。这个过程一直持续到搜索到目标方格b或活结点队列为空为止-With queue-type branch boundaries method for solving routing problem. From
src
- 用java语言采集路由表信息，并对采集得到的路由信息进行分析，和模板比对，找出有故障的路由器。-Routing table using java language acquisition, and acquisition of routing information is analyzed, and template matching to identify the faulty router.
Conditional-Shortest-Path-Routing-In-Delay-Tolera
- This an IEEE concept to network tolrent and anomoly detection-This is an IEEE concept to network tolrent and anomoly detection
Multiple-Routing-Configurations-for-Fast-IP-Netwo
- This project code for network IP recovery
Evaluating-the-Vulnerability-of-Network-Traffic-U
- This source code for network security and routing analysis I-This is source code for network security and routing analysis IEEE
DTN-java
- 几个DTN协议的Java源代码,便于对DTN路由协议的了解-Java source code ofseveral DTN protocol ，which is useful for understanging DTN routing protocol.
A-Generic-Framework-for-three-factor-authenticati
- a genegric framework for routing protocal
project
- vrp 用java写的小程序 解决车辆路径配送问题-vrp solve vehicle routing and distribution problems
mkpkj
- 这是一个小巧灵活、简单易用、易于扩展的轻量级PHP框架，并且遵循MVC模式的PHP开发框架！它秉承了很多优秀的PHP框架共有的：代码的OOP编写风格、URL的路由功能、MVC的架构思想、ORM的数据库操作、以及AJAX的前端页面技术支持。-This is a small, flexible, easy to use, easy to expand lightweight PHP framework and PHP development framework follows the MVC pat
doit1.5
- 它秉承了那些优秀的PHP框架所共有的：代码的OOP编写风格、URL的路由功能、MVC的架构思想、UID的数据库操作、以及AJAX的前端页面技术支持。-Adhering to best PHP framework common: code OOP writing style URL routing features, MVC architecture ideas, the UID database operations, as well as AJAX front page technical s
route
- 用java实现路由选择算法。Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。-Java achieve routing algorithm. Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm is used to calculate a node to all other nodes in the shortest path.