码迷,mamicode.com
首页 >  
搜索关键字:maxflow graph cuts    ( 3774个结果
UVA - 11478 Halum (最短路应用+二分)
Description   Problem H Halum Time Limit : 3 seconds     You are given a directed graph G(V,E) with a set of vertices and edges. Each edge (i,j) that connects some ...
分类:其他好文   时间:2014-07-22 00:11:35    阅读次数:225
UVA - 11478 Halum (最短路应用+二分)
Description   Problem H Halum Time Limit : 3 seconds     You are given a directed graph G(V,E) with a set of vertices and edges. Each edge (i,j) that connects some ...
分类:其他好文   时间:2014-07-22 00:08:34    阅读次数:307
UVA fill
题目如下: Problem D Fill   There are three jugs with a volume of a, b and c liters. (a,b, and c are positive integers not greater than 200). The first and the secondjug are initially empty, wh...
分类:其他好文   时间:2014-07-21 11:32:15    阅读次数:253
STL_稀疏图,树_使用vector邻接表存储
本文出自:http://blog.csdn.net/svitter 分析:vector是STL模板中的容器。可以利用其性质来构建邻接表。 定义: #include #define MAXN 10000 //max n of a tree or graph //if is a tree, n / 2 is OK ; using namespace std; typedef ve...
分类:其他好文   时间:2014-07-21 11:27:55    阅读次数:228
POJ 1679 The Unique MST
The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:19847Accepted:6959DescriptionGiven a connected undirected graph, tell if its minim...
分类:其他好文   时间:2014-07-21 00:23:08    阅读次数:303
上下界网络流总结
1.无源汇上下界可行流 对于(u,v)有向边,上界为a,下界为b 构图方法为: (1) ss 到 v 容量为 b (2) u 到 tt 容量为 b (3) u 到 v 容量为 a-b求ss-tt最大流,当且仅当 maxflow=sigma(i,t)=sigma(s,i) 时 存在可行流2.有源汇上下...
分类:其他好文   时间:2014-07-20 22:35:29    阅读次数:252
【leetcode】Clone Graph
Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ's undirected graph serialization:Nodes are labeled uniq...
分类:其他好文   时间:2014-07-19 12:11:53    阅读次数:238
UVA Graph Coloring
题目如下: Graph Coloring  You are to write a program that tries to find an optimal coloring for agiven graph. Colors are applied to the nodes of the graph and the only availablec...
分类:其他好文   时间:2014-07-19 02:35:06    阅读次数:210
UVA Bandwidth
题目如下: Bandwidth  Given a graph (V,E) where V is a set of nodes and E is a set of arcsin VxV, and an ordering on the elements in V, then the bandwidth of a node v is defined as...
分类:其他好文   时间:2014-07-19 02:26:15    阅读次数:206
[LeetCode] Palindrome Partitioning II
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs...
分类:其他好文   时间:2014-07-19 00:05:43    阅读次数:200
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!