搜索资源列表
求网络的最小费用最大流-C语言
- 本程序是利用Ford和Fulkerson迭加算法，求最小费用最大流-use of this procedure is superposition Ford and Fulkerson algorithm, the minimum cost for maximum flow
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 than four dozen architects-- i
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, Linda Rising, Udi Dahan, Neal For
tail_light_ford_thunderbird
- tail light implementation for ford thunderbird car.........break,left indicator, right indicator and hazard signal
OBDIIprotocols091214
- 各大车系的OBDII总线协议。 比如：VW，Ford，GM等等。-OBDII bus protocol。
Bellman-ford
- Program to implement Bellman Ford Algorithm