always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
5d2fb27ccd8caee252ce244f176ae75bb6b79d68
ortools-clone/docs/cpp_algorithms/classoperations__research_1_1GraphSymmetryFinder.html
Corentin Le Molgat b670dc9daa Update doc
2020-04-23 15:34:43 +02:00

257 lines
13 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>OR-Tools</title>
<meta http-equiv="Content-Type" content="text/html;"/>
<meta charset="utf-8"/>
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
</head>
<body>
<div id="banner-container">
<div id="banner">
<span id="sfml">Google OR-Tools 7.5</span>
</div>
</div>
<div id="content" style="width: 100%; overflow: hidden;">
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
<h2>C++ Reference</h2>
<ul>
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
</ul>
</div>
<div id="content">
<div align="center">
<h1 style="color: #145A32;">C++ Reference: Algorithms</h1>
</div>
<!-- Generated by Doxygen 1.8.16 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="namespaceoperations__research.html">operations_research</a></li><li class="navelem"><a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html">GraphSymmetryFinder</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#pub-types">Public Types</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="classoperations__research_1_1GraphSymmetryFinder-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">GraphSymmetryFinder</div> </div>
</div><!--header-->
<div class="contents">
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock">
<p class="definition">Definition at line <a class="el" href="find__graph__symmetries_8h_source.html#l00043">43</a> of file <a class="el" href="find__graph__symmetries_8h_source.html">find_graph_symmetries.h</a>.</p>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:a84f705240fd04d39747187079208d4bf"><td class="memItemLeft" align="right" valign="top">typedef ::util::StaticGraph&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#a84f705240fd04d39747187079208d4bf">Graph</a></td></tr>
<tr class="separator:a84f705240fd04d39747187079208d4bf"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:af0ae1a4d86cfcf11128fe60ea0f8d20b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#af0ae1a4d86cfcf11128fe60ea0f8d20b">GraphSymmetryFinder</a> (const <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#a84f705240fd04d39747187079208d4bf">Graph</a> &amp;graph, bool is_undirected)</td></tr>
<tr class="separator:af0ae1a4d86cfcf11128fe60ea0f8d20b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a998043f7ad1e35dc5f6cb23e18f6e7dd"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#a998043f7ad1e35dc5f6cb23e18f6e7dd">IsGraphAutomorphism</a> (const <a class="el" href="classoperations__research_1_1DynamicPermutation.html">DynamicPermutation</a> &amp;permutation) const</td></tr>
<tr class="separator:a998043f7ad1e35dc5f6cb23e18f6e7dd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad3c41b66c39c8978f4663f3fe74843b5"><td class="memItemLeft" align="right" valign="top">util::Status&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#ad3c41b66c39c8978f4663f3fe74843b5">FindSymmetries</a> (double time_limit_seconds, std::vector&lt; int &gt; *node_equivalence_classes_io, std::vector&lt; std::unique_ptr&lt; SparsePermutation &gt; &gt; *generators, std::vector&lt; int &gt; *factorized_automorphism_group_size)</td></tr>
<tr class="separator:ad3c41b66c39c8978f4663f3fe74843b5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a651a63b1943d8b8fa2346df1d1a2f55c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#a651a63b1943d8b8fa2346df1d1a2f55c">RecursivelyRefinePartitionByAdjacency</a> (int first_unrefined_part_index, <a class="el" href="classoperations__research_1_1DynamicPartition.html">DynamicPartition</a> *partition)</td></tr>
<tr class="separator:a651a63b1943d8b8fa2346df1d1a2f55c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acb28211fa0581e72d3dcb6b43ebe857a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#acb28211fa0581e72d3dcb6b43ebe857a">DistinguishNodeInPartition</a> (int node, <a class="el" href="classoperations__research_1_1DynamicPartition.html">DynamicPartition</a> *partition, std::vector&lt; int &gt; *new_singletons_or_null)</td></tr>
<tr class="separator:acb28211fa0581e72d3dcb6b43ebe857a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<h2 class="groupheader">Member Typedef Documentation</h2>
<a id="a84f705240fd04d39747187079208d4bf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a84f705240fd04d39747187079208d4bf">&#9670;&nbsp;</a></span>Graph</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">typedef ::util::StaticGraph <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#a84f705240fd04d39747187079208d4bf">Graph</a></td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="find__graph__symmetries_8h_source.html#l00045">45</a> of file <a class="el" href="find__graph__symmetries_8h_source.html">find_graph_symmetries.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="af0ae1a4d86cfcf11128fe60ea0f8d20b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af0ae1a4d86cfcf11128fe60ea0f8d20b">&#9670;&nbsp;</a></span>GraphSymmetryFinder()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html">GraphSymmetryFinder</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#a84f705240fd04d39747187079208d4bf">Graph</a> &amp;&#160;</td>
<td class="paramname"><em>graph</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool&#160;</td>
<td class="paramname"><em>is_undirected</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="acb28211fa0581e72d3dcb6b43ebe857a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acb28211fa0581e72d3dcb6b43ebe857a">&#9670;&nbsp;</a></span>DistinguishNodeInPartition()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void DistinguishNodeInPartition </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>node</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="classoperations__research_1_1DynamicPartition.html">DynamicPartition</a> *&#160;</td>
<td class="paramname"><em>partition</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">std::vector&lt; int &gt; *&#160;</td>
<td class="paramname"><em>new_singletons_or_null</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="ad3c41b66c39c8978f4663f3fe74843b5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad3c41b66c39c8978f4663f3fe74843b5">&#9670;&nbsp;</a></span>FindSymmetries()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">util::Status FindSymmetries </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>time_limit_seconds</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">std::vector&lt; int &gt; *&#160;</td>
<td class="paramname"><em>node_equivalence_classes_io</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">std::vector&lt; std::unique_ptr&lt; SparsePermutation &gt; &gt; *&#160;</td>
<td class="paramname"><em>generators</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">std::vector&lt; int &gt; *&#160;</td>
<td class="paramname"><em>factorized_automorphism_group_size</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a998043f7ad1e35dc5f6cb23e18f6e7dd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a998043f7ad1e35dc5f6cb23e18f6e7dd">&#9670;&nbsp;</a></span>IsGraphAutomorphism()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool IsGraphAutomorphism </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classoperations__research_1_1DynamicPermutation.html">DynamicPermutation</a> &amp;&#160;</td>
<td class="paramname"><em>permutation</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a651a63b1943d8b8fa2346df1d1a2f55c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a651a63b1943d8b8fa2346df1d1a2f55c">&#9670;&nbsp;</a></span>RecursivelyRefinePartitionByAdjacency()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void RecursivelyRefinePartitionByAdjacency </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>first_unrefined_part_index</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="classoperations__research_1_1DynamicPartition.html">DynamicPartition</a> *&#160;</td>
<td class="paramname"><em>partition</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li><a class="el" href="find__graph__symmetries_8h_source.html">find_graph_symmetries.h</a></li>
</ul>
</div><!-- contents -->
</div>
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink