Location:
Search - ford
Search list
Description: Description of Ford Fulkerson´ s method in C-Description of Ford Fulkerson´ s method in C++
Platform: |
Size: 7168 |
Author: ns |
Hits:
Description: C++ code for Bellman Ford Algorithm
Platform: |
Size: 1024 |
Author: Neo |
Hits:
Description: 网络最大流 Dinic算法 比Ford-Furkson,Edmond-Karps效率要高， 算法复杂性为O(V^2*E)-Dinic is a high-efficient maximum-flow algorithm proposed by a russian named diniz
Platform: |
Size: 3072 |
Author: lelading |
Hits:
Description: 作者Andrew V. Godberg
本文介绍一种解决网络最大流问题的算法。-Abstract. All previously known efftcient maximum-flow algorithms work by finding augmenting paths,
either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length
augmenting paths at once (using the layered network approach of Dinic).
Platform: |
Size: 1408000 |
Author: waterrenny |
Hits:
Description: MPI implementation for Matrix Multiplication using Ford Method
Platform: |
Size: 3072 |
Author: ahmed |
Hits:
Description: 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 two paths between the root node and some vertex v (i.e. a cycle), we can delete the last edge of the longer path without increasing the distance from the root node to any node in the subgraph.
If every pair of nodes in the graph has a unique shortest path between them, then the shortest path tree is unique. This is because if a particular path from the root to some vertex is minimal, then any part of that path (from node u to node v) is a minimal path between these two nodes.
In graphs with no negative distances, Dijkstra s algorithm computes the shortest path tree, from a given vertex. In graphs with possibly negative distances, the Bellman-Ford algorithm can be used instead.
Platform: |
Size: 7168 |
Author: darulor |
Hits:
Description: 实现的是最小费用最大流问题，在残量网络中找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.
Platform: |
Size: 1024 |
Author: 张佳静 |
Hits:
Description: 一个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()
• Create a subclass of Car class and name it as Truck. The Truck class has the following fields and methods.
o int weight
o double getSalePrice() // If weight > 2000, 10 discount. Otherwise, 20 discount.
• Create a subclass of Car class and name it as Ford. The Ford class has the following fields and methods
o int year
o int manufacturerDiscount
o double getSalePrice() // From the sale price computed from Car class, subtract the manufacturerDiscount.
• Create a subclass of Car class and name it as Sedan. The Sedan class has the following fields and methods.
o int length
o double getSalePrice() // If length > 20 feet, 5 discount, Otherwise, 10 discount.
• Create MyOwnAutoShop class which contains the main() method. Perform the following within the
Platform: |
Size: 6144 |
Author: 帅江兵 |
Hits:
Description: 声卡驱动用于福德.家悦等电脑或2005年以前地老电脑-Sound card driver for Ford. Yuet other computer at home or to the old computer before 2005
Platform: |
Size: 10092544 |
Author: 王超 |
Hits:
Description: 1994年，在英国成立了一个叫做汽车工业软件可靠性联合会（The Motor Industry Software Reliability Association，简称MISRA）的组织。它是致力于协助汽车厂商开发安全可靠的软件的跨国协会，其成员包括：AB汽车电子、罗孚汽车、宾利 汽车、福特汽车、捷豹汽车、路虎公司、Lotus公司、MIRA公司、Ricardo公司、TRW汽车电子、利兹大学和福特VISTEON汽车系统公司。
经过了四年的研究和准备，MISRA于1998年发布了一个针对汽车工业软件安全性的C语言编程规范——《汽车专用软件的C语言编程指南》 (Guidelines for the Use of the C Language in Vehicle Based Software)，共有127条规则，称为MISRA C:1998。目前MISRA C:2004版已有141条规则，21个类别，每一条规则对应一条编程准则。-In 1994, the British set up a named Motor Industry Software Reliability Association (The Motor Industry Software Reliability Association, referred to as the MISRA) organization. It is committed to helping automobile manufacturers to develop secure software, international association whose members include: AB Automotive Electronics, Rover, Bentley Motors, Ford, Jaguar, Land Rover, Lotus Corporation, MIRA company, Ricardo Company, TRW Automotive Electronics, University of Leeds and Ford VISTEON Automotive Systems.
After four years of research and preparation, MISRA in 1998 released a security for the Motor Industry Software Specification C programming language- "car-specific software, C language programming Guide" (Guidelines for the Use of the C Language in Vehicle Based Software), a total of 127 rules, known as MISRA C: 1998. Currently MISRA C: 2004 edition has 141 rules, 21 categories, each rule corresponds to a programming guidelines.
Platform: |
Size: 564224 |
Author: digitalhot |
Hits:
Description: bellman ford is in this program
Platform: |
Size: 2633728 |
Author: taurus |
Hits:
Description: tail light implementation for ford thunderbird car.........break,left indicator, right indicator and hazard signal
Platform: |
Size: 2048 |
Author: harsha |
Hits:
Description: The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem.
Platform: |
Size: 1024 |
Author: ww |
Hits:
Description: ford & fulkerson program
Platform: |
Size: 323584 |
Author: diegocotta |
Hits:
Description: 各大车系的OBDII总线协议。
比如：VW，Ford，GM等等。-OBDII bus protocol。
Platform: |
Size: 17408 |
Author: 林立峰 |
Hits:
Description: 贝尔曼福特 和 迪杰斯特拉 单源最短路径算法的实现-single source shortest path algorithm，Bellman Ford and Dijkstra
Platform: |
Size: 6144 |
Author: chraac |
Hits:
Description: This is a small program that tests voltage drops on a Ford 6R80 transmission for correctness, using an ATMEGA168 and a reed relay matrix with some logic glue.
Platform: |
Size: 136192 |
Author: auto_turret |
Hits:
Description: ford-fulkerson算法，通过标号寻找网络最大流-ford-fulkerson algorithm
Platform: |
Size: 1024 |
Author: 张晋 |
Hits:
Description: 利用Ford--Fulkerson 标号法求最大流算法的MATLAB 程序代码-The use of Ford- Fulkerson labeling method for the maximum flow algorithm of MATLAB code
Platform: |
Size: 1024 |
Author: yangjie |
Hits:
Description: 基于距离向量算法的路由器设计与实现，有两个实例，分别用java个c写的-Bellman-Ford shortest path algorithm
Platform: |
Size: 67584 |
Author: 许伟 |
Hits: