geosolver/doc/pydoc/geosolver.gmatch.html

38 lines
2.7 KiB
HTML

<!doctype html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><title>Python: module geosolver.gmatch</title>
</head><body bgcolor="#f0f0f8">
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="heading">
<tr bgcolor="#7799ee">
<td valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial">&nbsp;<br><big><big><strong><a href="geosolver.html"><font color="#ffffff">geosolver</font></a>.gmatch</strong></big></big></font></td
><td align=right valign=bottom
><font color="#ffffff" face="helvetica, arial"><a href=".">index</a><br><a href="file:/home/rick/Programming/Python/GeoSolver/geosolver/gmatch.py">/home/rick/Programming/Python/GeoSolver/geosolver/gmatch.py</a></font></td></tr></table>
<p><tt>#&nbsp;graph&nbsp;matching&nbsp;algorithm(s)</tt></p>
<p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#aa55cc">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#fffff" face="helvetica, arial"><big><strong>Modules</strong></big></font></td></tr>
<tr><td bgcolor="#aa55cc"><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%"><table width="100%" summary="list"><tr><td width="25%" valign=top><a href="random.html">random</a><br>
</td><td width="25%" valign=top></td><td width="25%" valign=top></td><td width="25%" valign=top></td></tr></table></td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#eeaa77">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Functions</strong></big></font></td></tr>
<tr><td bgcolor="#eeaa77"><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%"><dl><dt><a name="-gmatch"><strong>gmatch</strong></a>(pattern, reference)</dt><dd><tt>Match&nbsp;pattern&nbsp;graph&nbsp;to&nbsp;reference&nbsp;graph.&nbsp;<br>
&nbsp;<br>
Pattern&nbsp;matches&nbsp;are&nbsp;subgraphs&nbsp;of&nbsp;reference&nbsp;(subgraph&nbsp;isomorphisms).<br>
(a&nbsp;subgraph&nbsp;is&nbsp;a&nbsp;subset&nbsp;of&nbsp;variables&nbsp;and&nbsp;subset&nbsp;of&nbsp;edges)<br>
Any&nbsp;vertices&nbsp;in&nbsp;the&nbsp;pattern&nbsp;that&nbsp;are&nbsp;equal&nbsp;to&nbsp;some&nbsp;vertex&nbsp;in&nbsp;reference,&nbsp;they&nbsp;are&nbsp;matched&nbsp;exactly.<br>
Otherwise,&nbsp;vertices&nbsp;in&nbsp;pattern&nbsp;are&nbsp;considered&nbsp;variables.<br>
Returns&nbsp;a&nbsp;list&nbsp;of&nbsp;solutions.&nbsp;<br>
Each&nbsp;solution&nbsp;is&nbsp;a&nbsp;Map&nbsp;from&nbsp;pattern&nbsp;vertices&nbsp;to&nbsp;reference&nbsp;vertices&nbsp;(and&nbsp;vice&nbsp;versa).</tt></dd></dl>
<dl><dt><a name="-test"><strong>test</strong></a>()</dt></dl>
</td></tr></table>
</body></html>