type_ggraphcut.html

来自「一个由Mike Gashler完成的机器学习方面的includes neural」· HTML 代码 · 共 51 行

HTML
51 行
字号 
<html><head><title>Generated Documentation</title></head><body>	<image src="headerimage.png">	<br><br><table><tr><td><big><big><big style="font-family: arial;"><b>GGraphCut</b></big></big></big><br><br></td><td> This implements an optimized max-flow/min-cut algorithm described in "An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision" by Boykov, Y. and Kolmogorov, V.</td></tr></table><br><br><big><big><i>Statics (public)</i></big></big><br><div style="margin-left: 40px;">void <big><b>Test</b></big>()<br></div><br><big><big><i>Constructors (public)</i></big></big><br><div style="margin-left: 40px;"><big><b>GGraphCut</b></big>(int nNodes)<br></div><br><big><big><i>Destructors</i></big></big><br><div style="margin-left: 40px;"><big><b>~GGraphCut</b></big>()<br></div><br><big><big><i>Public</i></big></big><br><div style="margin-left: 40px;">void <big><b>AddEdge</b></big>(int nNode1, int nNode2, float fCapacity)<br><div style="margin-left: 80px;"><font color=brown> Adds an edge to the graph. You must add all the edges before calling "Cut".</font></div><br>void <big><b>Cut</b></big>(int nSourceNode, int nSinkNode)<br><div style="margin-left: 80px;"><font color=brown> This computes the cut. nSourceNode is the node that represents the source, and nSinkNode is the node that represents the sink.</font></div><br>bool <big><b>DoesBorderTheCut</b></big>(int nNode)<br><div style="margin-left: 80px;"><font color=brown> Returns true if the specified node borders the cut</font></div><br>void <big><b>GetEdgesFromRegionList</b></big>(<a href="type_GRegionAjacencyGraph.html">GRegionAjacencyGraph</a>* pRegionList)<br><div style="margin-left: 80px;"><font color=brown> Creates an edge from the node that represents each region to the node for each of its neighbor regions.</font></div><br>int <big><b>GetNodeCount</b></big>()<br><div style="margin-left: 80px;"><font color=brown> Returns the number of nodes in the graph</font></div><br>bool <big><b>IsSource</b></big>(int nNode)<br><div style="margin-left: 80px;"><font color=brown> Determine whether the specified node is on the source-side or the sink-side of the cut. (You must call "Cut" before calling this method.)</font></div><br></div><br><big><big><i>Protected</i></big></big><br><div style="margin-left: 40px;">void <big><b>AugmentPath</b></big>(GGraphCutEdge* pEdge)<br>void <big><b>FindAHome</b></big>(int nNode)<br>void <big><b>GrowNode</b></big>(int nNode)<br>void <big><b>RecycleTree</b></big>(int nChild, int nParent)<br></div><br></body></html>

type_ggraphcut.html - 源码说明

本页面展示了「一个由Mike Gashler完成的机器学习方面的includes neural net, naive bayesian classifier, decision tree, KNN, a genet」中的 type_ggraphcut.html 源码文件，采用 HTML 编程语言编写，共 51 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与classifier相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?