搜索资源列表
97Things
- 这是一本关于Refactoring的书，从网上搜集并且整理为PDF文档，希望大家可以从这篇文章中学到更多的东西。-In this truly unique technical book, today s leading software architects present valuable principles on key development issues that go way beyond technology. More
Ford_CAA
- Ford公司CAA应用(CATIA二次开发）-Ford' s CAA Application (CATIA secondary development)
-SPFA
- Bellman-Ford算法及其改进---SPFA算法_Lifeng Wang.htm-Bellman-Ford algorithm and its improvement--- SPFA algorithm _Lifeng Wang.htm
fordfulk
- it is a source code for ford fulkerson algorithm
Bellman-ford
- 单源最短路径,bellman_ford算法,邻接阵形式,复杂度O(n^3)-Single-source shortest path, bellman_ford algorithm, adjacency matrix form, the complexity of O (n ^ 3)
Q1_3
- bellman 方程的matlab实现,十分不错的源代码-bellman function matlab
Bellman_ford
- Bellman Ford in another way
xiaocheanpaiwenti
- 校车安排问题的C++程序，用ford算法算最短路径-School Bus arrangements for the C++ program
diagnostika
- Diagnostik obvod, je mozne s nium diagnostikovat automobily znač ky ford,atak podobě. T o znamená je urč en pro americké znač ky
Oreilly.97.Things.Every.Programmer.Should.Know.Fe
- 97 Things Every Programmer Should Know. Get 97 short and extremely useful tips from some of the most experienced and respected practitioners in the industry, including Uncle Bob Martin, Scott Meyers, Dan North, Lin
belman(2)
- Dijkstra算法中要求边的权非负，如果遇到负权，则可以采用Bellman-Ford算法。-about bellman-ford
bellman
- bellman-ford算法，典型最短路算法，用于计算一个节点到其他所有节点的最短路径-bellman-ford algorithm, a typical shortest path algorithm for computing a node to all other nodes of the shortest path
PHP
- Descr iption of Ford Fulkerson´ s method in C-Descr iption of Ford Fulkerson´ s method in C++
BellmanFord
- C++ code for Bellman Ford Algorithm
Dinic
- 网络最大流 Dinic算法 比Ford-Furkson,Edmond-Karps效率要高， 算法复杂性为O(V^2*E)-Dinic is a high-efficient maximum-flow algorithm proposed by a russian named diniz
5
- MPI implementation for Matrix Multiplication using Ford Method
MINIMALpATH
- A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are tw
mincostflow
- 实现的是最小费用最大流问题，在残量网络中找s-t最短路，运用bellman-ford算法。-To achieve the minimum cost maximum flow problem, in the residual network, find the shortest st, the use of bellman-ford algorithm.
MyOwnAutoShopProject
- 一个AutoShop Project，具体见英文描述，是我的一个小作业，呵呵。-• Create a super class called Car. The Car class has the following fields and methods. o int speed o double regularPrice o String color o double getSalePrice()
IT168.com-51057viashengkawanneng
- 声卡驱动用于福德.家悦等电脑或2005年以前地老电脑-Sound card driver for Ford. Yuet other computer at home or to the old computer before 2005