文件列表:

GrTheory\ColorGraph.m (1603, 2004-10-09)
GrTheory\Contents.m (913, 2004-10-09)
GrTheory\CycleBasis.m (1711, 2004-10-09)
GrTheory\DecompPartOrder.m (2877, 2004-09-17)
GrTheory\Evalidation.m (825, 2004-10-09)
GrTheory\GrTheoryTest.m (8323, 2004-10-09)
GrTheory\MaxFlows.m (1827, 2004-10-09)
GrTheory\MaxMatch.m (1515, 2004-10-09)
GrTheory\MinSpanTree.m (1885, 2004-10-09)
GrTheory\MinVerCover.m (1749, 2004-10-09)
GrTheory\PlotGraph.m (5613, 2004-10-09)
GrTheory\ShortPath.m (1404, 2004-10-09)
GrTheory\TravSale.m (2673, 2004-10-09)
Kevin's code\graph\acyclic.m (585, 2003-01-03)
Kevin's code\graph\assignEdgeNums.m (670, 2004-05-25)
Kevin's code\graph\best_first_elim_order.m (2791, 2003-03-21)
Kevin's code\graph\C\best_first_elim_order.c (3065, 2002-05-29)
Kevin's code\graph\C\cell.c (2721, 2002-05-29)
Kevin's code\graph\C\cell.h (746, 2002-05-29)
Kevin's code\graph\C\CVS\Entries (613, 2004-02-07)
Kevin's code\graph\C\CVS\Entries.Extra (221, 2004-02-07)
Kevin's code\graph\C\CVS\Repository (9, 2004-02-07)
Kevin's code\graph\C\CVS\Root (33, 2004-02-07)
Kevin's code\graph\C\elim.c (10383, 2002-05-29)
Kevin's code\graph\C\elim.h (433, 2002-05-29)
Kevin's code\graph\C\installC_graph.m (398, 2003-01-18)
Kevin's code\graph\C\io.h (266, 2002-05-29)
Kevin's code\graph\C\map.c (6412, 2002-05-29)
Kevin's code\graph\C\map.h (958, 2002-05-29)
Kevin's code\graph\C\misc.h (170, 2002-05-29)
Kevin's code\graph\C\strong_elim_order_broken.c (2538, 2002-05-29)
Kevin's code\graph\C\test.h (251, 2002-05-29)
Kevin's code\graph\C\testmlf.c (250, 2002-05-29)
Kevin's code\graph\C\triangulate.c (3904, 2002-05-29)
Kevin's code\graph\check_jtree_property.m (717, 2002-05-29)
Kevin's code\graph\check_triangulated.m (1194, 2003-03-21)
Kevin's code\graph\children.m (399, 2002-05-29)
Kevin's code\graph\cliques_to_jtree.m (1942, 2002-05-29)
Kevin's code\graph\cliques_to_strong_jtree.m (3585, 2002-05-29)
Kevin's code\graph\connected_graph.m (212, 2002-05-29)
... ...

A brief description of graph cuts M-Files and the steps of computation: myCode/graph_cuts: Takes in potentials, computes optimal assignment using pot2flow, MaxFlows, reachable, and find_cut. Outputs optimal assignment in a matrix corresponding to the lattice. myCode/pot2Flow: Given potentials, constructs the flow network whose min cut will partition vertices into those assigned 0 and 1 in the optimal assignment. GrTheory/MaxFlows: Computes the max flow through the network. myCode/reachable: Determines saturated arcs and removes them from the network. myCode/find_cut: Finds all vertices reachable from the source vertex. These are assigned 0; unreachable vertices are assigned 1. myCode/potentials, myCode/noise: Helper functions for gc_image_demo.

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：