Location:
Search - graph flow
Search list
Description: 本文用Ｃ语言实现了优化算法－最小费用最大流算法，主要用于图论领域-Using C programming language, the optimization algorithm-minimum cost maximum flow algorithm, mainly for the field of graph theory
Platform: |
Size: 3072 |
Author: 申辉 |
Hits:
Description: 在计算机视觉中的立体匹配算法----最大流最小割,最新的研究成果.-in computer vision of the stereo matching algorithm-largest flow minimum cut, the latest research results.
Platform: |
Size: 450560 |
Author: adan |
Hits:
Description: 在加权的有向图中，可以求出最大流路径，即求出从起点到终点权值之和最大的路径。-In weighted directed graph, we can derive maximum flow path, that is derived from the point of origin to their destination and the largest weight of the path.
Platform: |
Size: 205824 |
Author: Leo |
Hits:
Description: GRAPH CLUSTERING by FLOW SIMULATION.pdf
Platform: |
Size: 3492864 |
Author: jzw |
Hits:
Description: 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures
Platform: |
Size: 47104 |
Author: yangfei |
Hits:
Description: 网络流算法
涉及：数据结构(图论)、算法、ACM
分类有最大流、最小费用最大流、最小割-Network flow algorithm involving: data structures (graph theory), algorithm, ACM classification has maximum flow, minimum cost maximum flow, minimum cut
Platform: |
Size: 91136 |
Author: sql |
Hits:
Description: 这是自己用c#写的一段关于图的最小切的算法，主要参考了论文：
《An Experimental Comparison of
Min-Cut/Max-Flow Algorithms for
Energy Minimization in Vision》
此文中的算法是目前比较优秀的最小切算法-This is their use of c# Write a paragraph on the minimum cut graph algorithm, the main reference of the thesis:
Platform: |
Size: 3072 |
Author: 张曦 |
Hits:
Description: 是基于Graph cuts 的源程序，用来求解Min-Cut/Max-Flow.-Graph cuts based on the source code for solving Min-Cut/Max-Flow.
Platform: |
Size: 108544 |
Author: 余丽红 |
Hits:
Description: 使用集合命令编写的图论最短路dijkstra算法的matlab程序，flord算法的matlab程序，最大匹配的匈牙利算法（hungary）matlab程序，最小生成树的两种方法编写的matlab程序，最小费用最大流matlab程序-Prepared in order to use a collection of graph theory Dijkstra shortest path algorithm matlab program, flord algorithm matlab procedures, the maximum matching algorithm Hungary (hungary) matlab procedures, minimum spanning tree, prepared by two methods matlab procedures, the minimum cost maximum flow matlab program
Platform: |
Size: 5120 |
Author: 任龙 |
Hits:
Description: 最大流算法,当时学图论的时候写的C++程序,可以用于网络流计算.-Maximum flow algorithm, at the time when learning Graph Theory wrote C++ Procedures can be used for network flow calculation.
Platform: |
Size: 900096 |
Author: 李宝亮 |
Hits:
Description: Java 图算法, 包括最短路径, 有向图算法, 无向图算法, 网络流算法, 等-Java graph algorithm, including the shortest path algorithm for directed graph, undirected graph algorithms, network flow algorithms, such as
Platform: |
Size: 4379648 |
Author: 唐某某 |
Hits:
Description: 关于最大流量的问题，涉及图论，等等，是matlab程序-On the maximum flow problem, involving graph theory, and so on, is the matlab program
Platform: |
Size: 1024 |
Author: haboy |
Hits:
Description: 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。-ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and minimum cost maximum flow, etc., it can be said of very strong combat.
Platform: |
Size: 14336 |
Author: 诗苇 |
Hits:
Description: 图书馆管理系统开发设计方案
目录
1 需求分析 3
1.1 系统目标 3
1.2 需求定义 3
2 功能说明 4
2.1 图书基本情况 4
2.2 办理借书证 4
2.3 实现借书功能 4
2.4 实现还书功能 5
2.5 图书查询 5
3 系统功能结构图 5
4 业务流程图 6
4.1 借阅信息管理 6
4.2 书籍信息管理 6
4.3 读者信息管理 7
4.4 系统管理 7
5 绘制数据流图 7
5.1 “借书证生成”数据流图 8
5.2 借书证注销数据流图 8
5.3 新书入库数据流图 9
5.4 读者借书数据流图 10
5.5 读者还书数据流图 11
5.6 查询图书数据流图 12
6 数据库设计 13
7 ER图 14
-Library management system designed and developed a needs analysis program directory 3 1.1 systems 3 1.2 needs the definition of the target 3 2 features 4 2.1 Book 4 2.2 for the basic library card 4 2.3 library functions to achieve the realization of 4 2.4 Book 2.5 Book Inquiries 5 function 5 3 system structure of the operational flow chart 5 4 Information Management 6 4.1 borrow books 6 4.2 Information Management Information Management 6 4.3 reader 7 4.4 Systems Management 7 5 Drawing data flow diagram 7 5.1 " library card to generate" data flow diagram 8 5.2 library card write-off data 5.3 Flow Chart 8 new storage 9 5.4 data flow diagram data flow diagram library readers 10 5.5 readers book data flow diagram 11 5.6 Data Flow Graph query books 12 6 Database Design 13 7 ER Figure 14
Platform: |
Size: 326656 |
Author: 植物人 |
Hits:
Description: 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
Platform: |
Size: 61440 |
Author: jiangkaihua |
Hits:
Description: 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
Platform: |
Size: 39936 |
Author: young |
Hits:
Description: 资料介绍了图论算法中最重要的定理之一的最小个最大流定理-Information on the graph theory algorithm, one of the most important theorem of the minimum of maximum flow theorem
Platform: |
Size: 36864 |
Author: 天雨 |
Hits:
Description: 五种当前主要的基于图的图像分割方法（normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker）的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker.
Platform: |
Size: 7720960 |
Author: zc |
Hits:
Description: malcode execution binary trace flow and graphing-malcode execution binary trace flow and graphing
Platform: |
Size: 18432 |
Author: obz |
Hits:
Description: 高随祥的图论与网络流理论，介绍在网络里如何利用图论进行问题的分析，对于庞大的网络流有相当的帮助。(Gao Suixiang's graph theory and network flow theory, introduced in the network how to use graph theory to analyze the problem, for a large network flow quite helpful.)
Platform: |
Size: 78843904 |
Author: kkburp
|
Hits: