搜索资源列表
Graph-Theory
- 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0
Matlablowestpath
- Matlab经典算法__最短路径 比较好的，能够很好的适应各种不同情况-Matlab classical shortest path algorithm __ relatively good, very good to adapt to different circumstances
P2P_by_shootingstars
- 一个模拟P2P聊天的过程的源代码，过程很简单，P2PServer运行在一个拥有公网IP的计算机上，P2PClient运行在两个不同的NAT后（注意，如果两个客户端运行在一个NAT后，本程序很可能不能运行正常，这取决于你的NAT是否支持loopback translation，详见http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-01.txt，当然，此问题可以通过双方先尝试连接
p2p
- P2P 之 UDP穿透NAT的原理与实现（附源代码） 原创：shootingstars 参考：http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-01.txt baidu 论坛上经常有对P2P原理的讨论，但是讨论归讨论，很少有实质的东西产生（源代码）。呵呵，在这里我就用自己实现的一个源代码来说明UDP穿越NAT的原理。 首先先介绍一些基本概
glomosim-2.03
- 比较全的Glomosim2.03,上次下载的那个少个文件夹，导致安装不了，特意在网上搜到了比较齐全的-Comparing the whole of Glomosim2.03, download the last few months of that folder, and can not lead to the installation, specifically the Internet found a relatively comp
futecase
- 福特汽车流程管理案例，可以应用于运作管理教学-Ford Motor case flow management, operational management can be applied to teaching
FordFulkerson
- 网络优化算法：最大流的FordFulkerson标号算法-Network optimization algorithms: maximum flow of FordFulkerson Enumeration
Graph-Theory
- 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0
clustering
- bellman ford algorithm implemented in C#.NET
bellman
- bellman algorithm program implented in c++ is based on using linked list-bellman algorithm program implented in c++ is based on using linked list
BELLMAN
- program for bellmann ford used in ada in c language
Ford_Quadlock
- this the pinout of sony ford connector-this is the pinout of sony ford connector
stereo_ford_8hx
- this the pinout of sony ford connector-this is the pinout of sony ford connector
xq
- 图论中最短路算法，最小生成树，最大匹配与最佳匹配的算法，旅行商问题，求最大流的Ford--Fulkerson 标号算法-Shortest path graph algorithm, minimum spanning tree, the largest and best match matching algorithms, traveling salesman problem, maximum flow for the Ford- Ful
FS9200_v40
- 此文件为优龙科技有限公司的fs2440文件,希望大家喜欢.-the ford is about FS2440,hope everyone will like
Queues
- lecture material about Queues. Adopted from E-book "Data Structures with C++ using STL" by William Ford, William To-lecture material about Queues. Adopted from E-book "Data Structures with C++ using STL" by William Ford,
Stacks
- Lecture material on Stacks, adopted from E-book "Data Structures with C++ using STL" by William Todd, William Ford
LinkedLists
- Power Point Presentation/Lecture material on STL topic Linked Lists, adopted from book "Data Structures with C++ using STL" by William Ford, William To-Power Point Presentation/Lecture material on STL topic Linked Lists,
Vector_Deque
- Power Point Presentation/Lecture Material on Vectors and Deques (C++ STL), adapted from "Data Structures with C++ using STL" by William Ford, William To-Power Point Presentation/Lecture Material on Vectors and Deques (C+
FordJohnson
- This program is an implementation of ford johnson algorithm with simple UI in CSharp.