Ziele Untersuchung
mit Columbo Integrität von
Datenbanken Interaktion und
Portierbarkeit Ergonomie der
Schnittstellen

Angebot Produkte Projekt Beratung

Mittel Analytik Modellierung Sprachen Algebra Logik Hardware Denken Kreativität

Zusammenhänge Gesellschaft Wirtschaft Branche Firma


products/sources/formale Sprachen/GAP/pkg/digraphs/doc/ (Algebra von RWTH Aachen Version 4.15.1^©) Datei vom 27.8.2025 mit Größe 44 kB

</tr>
<tr>
<td class="tdleft"><code class="code">IsIsomorphicGraph</code></td>
<td class="tdleft"><code class="func">IsIsomorphicDigraph</code> (<a href="chap7.html#X7B4F24B283C9EE28">7.2-15</a>)</td>
<td class="tdleft"><code class="code">IsIsomorphicGraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">IsIsomorphicDigraph</code> (<a href="chap7.html#X7B4F24B283C9EE28">7.2-15</a>) in Digraphs. Note however that <code class="code">IsIsomorphicGraph</code>'s optional argument firstunbindcanon is not applicable, since the canonical labellings of a digraph are not portable between sessions.
</tr>
<tr>
<td class="tdleft"><code class="code">GraphIsomorphismClassRepresentatives</code></td>
<td class="tdleft">None</td>
<td class="tdleft">There is no analogous function in Digraphs, although this feature might be implemented in the future.</td>
</tr>
</table> 
</div>

<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap9.html">[Previous Chapter]</a> <a href="chapB.html">[Next Chapter]</a> </div>

<div class="chlinkbot">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chapA.html">A</a> <a href="chapB.html">B</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<hr />
generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a>
</body>
</html>

quality92%

¤ Dauer der Verarbeitung: 0.8 Sekunden (vorverarbeitet) ¤

Quelle chapA.html Sprache: HTML

products/sources/formale Sprachen/GAP/pkg/digraphs/doc/chapA.html

<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (Digraphs) - Appendix A:
 Grape to Digraphs Command Map
 </title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chapA" onload="jscontent()">

<div class="chlinktop">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chapA.html">A</a> <a href="chapB.html">B</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap9.html">[Previous Chapter]</a> <a href="chapB.html">[Next Chapter]</a> </div>

<a href="chapA_mj.html">[MathJax on]</a>
<a id="X800DAF137BA8E25B" name="X800DAF137BA8E25B"></a>
<div class="ChapSects"><a href="chapA.html#X800DAF137BA8E25B">A 
 Grape to Digraphs Command Map
 </a>
<div class="ContSect"> <a href="chapA.html#X7CC8A9DB86F9F0F4">A.1 
 Functions to construct and modify graphs
 </a>

</div>
<div class="ContSect"> <a href="chapA.html#X7C38A6397D2770FB">A.2 
 Functions to inspect graphs, vertices and edges
 </a>

</div>
<div class="ContSect"> <a href="chapA.html#X78A5A34783C70CD7">A.3 
 Functions to determine regularity properties of graphs
 </a>

</div>
<div class="ContSect"> <a href="chapA.html#X7C74978D85F7AF5C">A.4 
 Some special vertex subsets of a graph
 </a>

</div>
<div class="ContSect"> <a href="chapA.html#X7E51B92F7E89E266">A.5 
 Functions to construct new graphs from old
 </a>

</div>
<div class="ContSect"> <a href="chapA.html#X7A61E3FC7A2BB50E">A.6 
 Vertex-Colouring and Complete Subgraphs
 </a>

</div>
<div class="ContSect"> <a href="chapA.html#X7DFC61EC7CBDBC7E">A.7 
 Automorphism groups and isomorphism testing for graphs
 </a>

</div>
</div>

<h3>A 
 Grape to Digraphs Command Map
 </h3>

Below is a table of <a href="https://gap-packages.github.io/grape">GRAPE</a> commands with the Digraphs counterparts. The sections in this chapter correspond to the chapters in the <a href="https://gap-packages.github.io/grape">GRAPE</a> manual.

<a id="X7CC8A9DB86F9F0F4" name="X7CC8A9DB86F9F0F4"></a>

<h4>A.1 
 Functions to construct and modify graphs
 </h4>

<div class="pcenter"><table class="GAPDocTable">
<tr>
<td class="tdleft"><a href="https://gap-packages.github.io/grape">GRAPE</a> command</td>
<td class="tdleft">Digraphs command</td>
<td class="tdleft">Comments</td>
</tr>
<tr>
<td class="tdleft"><code class="code">Graph</code></td>
<td class="tdleft"><code class="func">Digraph</code> (<a href="chap3.html#X834843057CE86655">3.1-7</a>)</td>
<td class="tdleft">Used with the arguments of <code class="code">Graph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> , <code class="func">Digraph</code> (<a href="chap3.html#X834843057CE86655">3.1-7</a>) will return an equivalent digraph.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">EdgeOrbitsGraph</code></td>
<td class="tdleft"><code class="func">EdgeOrbitsDigraph</code> (<a href="chap3.html#X7B75C1D680757D6F">3.1-10</a>)</td>
<td class="tdleft">The operation <code class="func">EdgeOrbitsDigraph</code> (<a href="chap3.html#X7B75C1D680757D6F">3.1-10</a>) behaves the same as <code class="code">EdgeOrbitsDigraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">NullGraph</code></td>
<td class="tdleft"><code class="func">NullDigraph</code> (<a href="chap3.html#X80DAE31A79FEFD40">3.5-18</a>) or <code class="func">EmptyDigraph</code> (<a href="chap3.html#X80DAE31A79FEFD40">3.5-18</a>)</td>
<td class="tdleft">Note that, unlike in <a href="https://gap-packages.github.io/grape">GRAPE</a> , the arguments of <code class="func">NullDigraph</code> (<a href="chap3.html#X80DAE31A79FEFD40">3.5-18</a>) and <code class="func">EmptyDigraph</code> (<a href="chap3.html#X80DAE31A79FEFD40">3.5-18</a>) are just non-negative integers. Since digraphs in Digraphs are immutable, there is no reason (although it is possible) to create a null digraph and then add edges, as you might be used to doing in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">CompleteGraph</code></td>
<td class="tdleft"><code class="func">CompleteDigraph</code> (<a href="chap3.html#X812417E278198D9C">3.5-13</a>)</td>
<td class="tdleft">Note that, unlike in <a href="https://gap-packages.github.io/grape">GRAPE</a> , the argument to <code class="func">CompleteDigraph</code> (<a href="chap3.html#X812417E278198D9C">3.5-13</a>) is simply a non-negative integer indicating the number of vertices. By default a complete digraph in Digraphs does not have any loops. If you want a complete digraph with loops at every vertex, then use <code class="func">DigraphAddAllLoops</code> (<a href="chap3.html#X8167A50A83256ED1">3.3-45</a>).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">JohnsonGraph</code></td>
<td class="tdleft"><code class="func">JohnsonDigraph</code> (<a href="chap3.html#X80ED9CE785819607">3.5-25</a>)</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">JohnsonGraph</code> is equivalent to <code class="func">JohnsonDigraph</code> (<a href="chap3.html#X80ED9CE785819607">3.5-25</a>).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">CayleyGraph</code></td>
<td class="tdleft"><code class="func">CayleyDigraph</code> (<a href="chap3.html#X7FCADADC7EC28478">3.1-12</a>)</td>
<td class="tdleft">The operation <code class="func">CayleyDigraph</code> (<a href="chap3.html#X7FCADADC7EC28478">3.1-12</a>) behaves the same as <code class="code">CayleyGraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">AddEdgeOrbit</code></td>
<td class="tdleft"><code class="func">DigraphAddEdgeOrbit</code> (<a href="chap3.html#X7BE5C7028760B053">3.3-18</a>)</td>
<td class="tdleft">Note that, unlike in <a href="https://gap-packages.github.io/grape">GRAPE</a> , digraphs in Digraphs are immutable, and this operation returns a new digraph, i.e. it does not modify the digraph given as an argument.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">RemoveEdgeOrbit</code></td>
<td class="tdleft"><code class="func">DigraphRemoveEdgeOrbit</code> (<a href="chap3.html#X85981D9187F49018">3.3-23</a>)</td>
<td class="tdleft">Note that, unlike in <a href="https://gap-packages.github.io/grape">GRAPE</a> , digraphs in Digraphs are immutable, and this operation returns a new digraph, i.e. it does not modify the digraph given as an argument.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">AssignVertexNames</code></td>
<td class="tdleft"><code class="func">SetDigraphVertexLabels</code> (<a href="chap5.html#X7E51F2FE87140B32">5.1-12</a>) and <code class="func">SetDigraphVertexLabel</code> (<a href="chap5.html#X7CA91E4B7904F793">5.1-11</a>)</td>
<td class="tdleft">Use <code class="func">SetDigraphVertexLabel</code> (<a href="chap5.html#X7CA91E4B7904F793">5.1-11</a>) to set an individual vertex label and <code class="func">SetDigraphVertexLabels</code> (<a href="chap5.html#X7E51F2FE87140B32">5.1-12</a>) to set all of the vertex labels.</td>
</tr>
</table> 
</div>

<a id="X7C38A6397D2770FB" name="X7C38A6397D2770FB"></a>

<h4>A.2 
 Functions to inspect graphs, vertices and edges
 </h4>

<div class="pcenter"><table class="GAPDocTable">
<tr>
<td class="tdleft"><a href="https://gap-packages.github.io/grape">GRAPE</a> command</td>
<td class="tdleft">Digraphs command</td>
<td class="tdleft">Comments</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsGraph</code></td>
<td class="tdleft"><code class="func">IsDigraph</code> (<a href="chap3.html#X7877ADC77F85E630">3.1-1</a>)</td>
<td class="tdleft"><code class="func">IsDigraph</code> (<a href="chap3.html#X7877ADC77F85E630">3.1-1</a>) is a category and not a function like <code class="code">IsGraph</code>.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">OrderGraph</code></td>
<td class="tdleft"><code class="func">DigraphNrVertices</code> (<a href="chap5.html#X7C6F19B57CB2E882">5.1-2</a>)</td>
<td class="tdleft">The operation <code class="func">DigraphNrVertices</code> (<a href="chap5.html#X7C6F19B57CB2E882">5.1-2</a>) behaves the same as <code class="code">OrderGraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsVertex(<var class="Arg">graph</var>, <var class="Arg">v</var>)</code></td>
<td class="tdleft"><code class="code"><var class="Arg">v</var> in DigraphVertices(<var class="Arg">digraph</var>)</code></td>
<td class="tdleft">The attribute <code class="func">DigraphVertices</code> (<a href="chap5.html#X7C45F7D878D896AC">5.1-1</a>) can be used to return the list of vertices of a digraph, or if <var class="Arg">v</var> is known to be a positive integer, then you can simply do <code class="code"><var class="Arg">v</var> <= DigraphNrVertices(<var class="Arg">digraph</var>)</code></td>
</tr>
<tr>
<td class="tdleft"><code class="code">VertexName</code></td>
<td class="tdleft"><code class="func">DigraphVertexLabel</code> (<a href="chap5.html#X7CA91E4B7904F793">5.1-11</a>)</td>
<td class="tdleft">Unlike <code class="code">VertexName</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> , the return value of <code class="func">DigraphVertexLabel</code> (<a href="chap5.html#X7CA91E4B7904F793">5.1-11</a>) is mutable.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">VertexNames</code></td>
<td class="tdleft"><code class="func">DigraphVertexLabels</code> (<a href="chap5.html#X7E51F2FE87140B32">5.1-12</a>)</td>
<td class="tdleft">Unlike <code class="code">VertexNames</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> , the return value of <code class="func">DigraphVertexLabels</code> (<a href="chap5.html#X7E51F2FE87140B32">5.1-12</a>) is mutable.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">Vertices</code></td>
<td class="tdleft"><code class="func">DigraphVertices</code> (<a href="chap5.html#X7C45F7D878D896AC">5.1-1</a>)</td>
<td class="tdleft">The vertices of a digraph in Digraphs is always the range <code class="code">[1 .. n]</code> where <code class="code">n</code> is the number of vertices of the digraph. The operation <code class="func">DigraphVertices</code> (<a href="chap5.html#X7C45F7D878D896AC">5.1-1</a>) behaves the same as <code class="code">Vertices</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">VertexDegree</code></td>
<td class="tdleft"><code class="func">OutDegreeOfVertex</code> (<a href="chap5.html#X7A09EB648070276D">5.2-10</a>) (see also: <code class="func">InDegreeOfVertex</code> (<a href="chap5.html#X7C9CD0527CB9E6EF">5.2-12</a>))</td>
<td class="tdleft">The operation <code class="func">OutDegreeOfVertex</code> (<a href="chap5.html#X7A09EB648070276D">5.2-10</a>) behaves the same as <code class="code">VertexDegree</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">VertexDegrees</code></td>
<td class="tdleft"><code class="func">OutDegreeSet</code> (<a href="chap5.html#X7F5ACE807D1BC2E2">5.2-8</a>) (see also: <code class="func">OutDegreeSequence</code> (<a href="chap5.html#X7F5ACE807D1BC2E2">5.2-8</a>), <code class="func">OutDegrees</code> (<a href="chap5.html#X7F5ACE807D1BC2E2">5.2-8</a>), <code class="func">InDegrees</code> (<a href="chap5.html#X7ADDFBFD7A365775">5.2-9</a>), <code class="func">InDegreeSequence</code> (<a href="chap5.html#X7ADDFBFD7A365775">5.2-9</a>), <code class="func">InDegreeSet</code> (<a href="chap5.html#X7ADDFBFD7A365775">5.2-9</a>))</td>
<td class="tdleft">The operation <code class="func">OutDegreeSet</code> (<a href="chap5.html#X7F5ACE807D1BC2E2">5.2-8</a>) behaves the same as <code class="code">VertexDegrees</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsLoopy</code></td>
<td class="tdleft"><code class="func">DigraphHasLoops</code> (<a href="chap6.html#X7D92935C7D535187">6.2-1</a>)</td>
<td class="tdleft">The operation <code class="func">DigraphHasLoops</code> (<a href="chap6.html#X7D92935C7D535187">6.2-1</a>) behaves the same as <code class="code">IsLoopy</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsSimpleGraph</code></td>
<td class="tdleft"><code class="func">IsSymmetricDigraph</code> (<a href="chap6.html#X81B3EA7887219860">6.2-14</a>) and not <code class="func">DigraphHasLoops</code> (<a href="chap6.html#X7D92935C7D535187">6.2-1</a>)</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">IsSimpleGraph</code> is equivalent to <code class="func">IsSymmetricDigraph</code> (<a href="chap6.html#X81B3EA7887219860">6.2-14</a>) and not <code class="func">DigraphHasLoops</code> (<a href="chap6.html#X7D92935C7D535187">6.2-1</a>).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">Adjacency</code></td>
<td class="tdleft"><code class="func">OutNeighboursOfVertex</code> (<a href="chap5.html#X83315B0186850806">5.2-11</a>) (see also <code class="func">InNeighboursOfVertex</code> (<a href="chap5.html#X7C0DA18B8291F302">5.2-13</a>))</td>
<td class="tdleft">The operation <code class="func">OutNeighboursOfVertex</code> (<a href="chap5.html#X83315B0186850806">5.2-11</a>) behaves the same as <code class="code">Adjacency</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsEdge</code></td>
<td class="tdleft"><code class="func">IsDigraphEdge</code> (<a href="chap5.html#X7BB8ED88835F07B4">5.1-17</a>)</td>
<td class="tdleft">The arguments of <code class="func">IsDigraphEdge</code> (<a href="chap5.html#X7BB8ED88835F07B4">5.1-17</a>) can be a digraph and an edge, or a digraph and two vertices. In the first form the operation <code class="func">IsDigraphEdge</code> (<a href="chap5.html#X7BB8ED88835F07B4">5.1-17</a>) behaves the same as <code class="code">IsEdge</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">DirectedEdges</code></td>
<td class="tdleft"><code class="func">DigraphEdges</code> (<a href="chap5.html#X7D1C6A4D7ECEC317">5.1-3</a>)</td>
<td class="tdleft">The attribute <code class="func">DigraphEdges</code> (<a href="chap5.html#X7D1C6A4D7ECEC317">5.1-3</a>) behaves the same as <code class="code">DirectedEdges</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">UndirectedEdges</code></td>
<td class="tdleft">None</td>
<td class="tdleft">There is no analogous function in Digraphs, and no plans to include one.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">Distance</code></td>
<td class="tdleft"><code class="func">DigraphShortestDistance</code> (<a href="chap5.html#X8104A9D37BCD8A05">5.4-2</a>)</td>
<td class="tdleft">The operation <code class="func">DigraphShortestDistance</code> (<a href="chap5.html#X8104A9D37BCD8A05">5.4-2</a>) behaves the same as <code class="code">Distance</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">Diameter</code></td>
<td class="tdleft"><code class="func">DigraphDiameter</code> (<a href="chap5.html#X7F16B9EB8398459C">5.4-1</a>)</td>
<td class="tdleft">The attribute <code class="func">DigraphDiameter</code> (<a href="chap5.html#X7F16B9EB8398459C">5.4-1</a>) behaves the same as <code class="code">Diameter</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">Girth</code></td>
<td class="tdleft"><code class="func">DigraphUndirectedGirth</code> (<a href="chap5.html#X84688B337BDDBB09">5.4-8</a>)</td>
<td class="tdleft">The attribute <code class="func">DigraphUndirectedGirth</code> (<a href="chap5.html#X84688B337BDDBB09">5.4-8</a>) behaves the same as <code class="code">Girth</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> except that in the case that the argument is a forest, <code class="keyw">infinity</code> is returned by Digraphs whereas <code class="code">-1</code> is returned by <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsConnectedGraph</code></td>
<td class="tdleft"><code class="func">IsStronglyConnectedDigraph</code> (<a href="chap6.html#X7B37B9467C68C208">6.6-6</a>)</td>
<td class="tdleft">The attribute <code class="func">IsStronglyConnectedDigraph</code> (<a href="chap6.html#X7B37B9467C68C208">6.6-6</a>) behaves the same as <code class="code">IsConnectedGraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> .</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsBipartite</code></td>
<td class="tdleft"><code class="func">IsBipartiteDigraph</code> (<a href="chap6.html#X860CFB0C8665F356">6.2-3</a>) and <code class="func">IsSymmetricDigraph</code> (<a href="chap6.html#X81B3EA7887219860">6.2-14</a>)</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">IsBipartite</code> is equivalent to <code class="func">IsBipartiteDigraph</code> (<a href="chap6.html#X860CFB0C8665F356">6.2-3</a>) and <code class="func">IsSymmetricDigraph</code> (<a href="chap6.html#X81B3EA7887219860">6.2-14</a>).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsNullGraph</code></td>
<td class="tdleft"><code class="func">IsNullDigraph</code> (<a href="chap6.html#X7E894CCF7B1C27AE">6.2-7</a>) or <code class="func">IsEmptyDigraph</code> (<a href="chap6.html#X7E894CCF7B1C27AE">6.2-7</a>)</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">IsNullGraph</code> is equivalent to <code class="func">IsEmptyDigraph</code> (<a href="chap6.html#X7E894CCF7B1C27AE">6.2-7</a>) and its synonym <code class="func">IsNullDigraph</code> (<a href="chap6.html#X7E894CCF7B1C27AE">6.2-7</a>).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsCompleteGraph</code></td>
<td class="tdleft"><code class="func">IsCompleteDigraph</code> (<a href="chap6.html#X81F28D4D879FE3B2">6.2-5</a>)</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">IsCompleteGraph</code> is roughly equivalent to <code class="func">IsCompleteDigraph</code> (<a href="chap6.html#X81F28D4D879FE3B2">6.2-5</a>) except that in Digraphs a complete digraph has no loops.</td>
</tr>
</table> 
</div>

<a id="X78A5A34783C70CD7" name="X78A5A34783C70CD7"></a>

<h4>A.3 
 Functions to determine regularity properties of graphs
 </h4>

<div class="pcenter"><table class="GAPDocTable">
<tr>
<td class="tdleft"><a href="https://gap-packages.github.io/grape">GRAPE</a> command</td>
<td class="tdleft">Digraphs command</td>
<td class="tdleft">Comments</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsRegularGraph</code></td>
<td class="tdleft"><code class="func">IsOutRegularDigraph</code> (<a href="chap6.html#X7F0A806E7BCB413C">6.5-2</a>) (see also <code class="func">IsInRegularDigraph</code> (<a href="chap6.html#X7A3F78B37E31D9E1">6.5-1</a>) and <code class="func">IsRegularDigraph</code> (<a href="chap6.html#X7AF9DB1E7DB12306">6.5-3</a>))</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">IsRegularGraph</code> is equivalent to <code class="func">IsOutRegularDigraph</code> (<a href="chap6.html#X7F0A806E7BCB413C">6.5-2</a>).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">LocalParameters</code></td>
<td class="tdleft">None</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">LocalParameters</code> has no equivalent function in Digraphs, although this might change in the future.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">GlobalParameters</code></td>
<td class="tdleft">None</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">GlobalParameters</code> has no equivalent function in Digraphs, although this might change in the future.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IsDistanceRegular</code></td>
<td class="tdleft"><code class="func">IsDistanceRegularDigraph</code> (<a href="chap6.html#X7E2082AC7CAE59CD">6.5-4</a>)</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">IsDistanceRegular</code> is equivalent to <code class="func">IsDistanceRegularDigraph</code> (<a href="chap6.html#X7E2082AC7CAE59CD">6.5-4</a>).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">CollapsedAdjacencyMat</code></td>
<td class="tdleft">None</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">CollapsedAdjacencyMat</code> has no equivalent function in Digraphs, although this might change in the future.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">OrbitalGraphColadjMats</code></td>
<td class="tdleft">None</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">OrbitalGraphColadjMats</code> has no equivalent function in Digraphs, although this might change in the future.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">VertexTransitiveDRGs</code></td>
<td class="tdleft">None</td>
<td class="tdleft">The <a href="https://gap-packages.github.io/grape">GRAPE</a> function <code class="code">VertexTransitiveDRGs</code> has no equivalent function in Digraphs, although this might change in the future.</td>
</tr>
</table> 
</div>

<a id="X7C74978D85F7AF5C" name="X7C74978D85F7AF5C"></a>

<h4>A.4 
 Some special vertex subsets of a graph
 </h4>

<div class="pcenter"><table class="GAPDocTable">
<tr>
<td class="tdleft"><a href="https://gap-packages.github.io/grape">GRAPE</a> command</td>
<td class="tdleft">Digraphs command</td>
<td class="tdleft">Comments</td>
</tr>
<tr>
<td class="tdleft"><code class="code">ConnectedComponent</code></td>
<td class="tdleft"><code class="func">DigraphConnectedComponent</code> (<a href="chap5.html#X8484EC557810CD31">5.4-10</a>)</td>
<td class="tdleft">When applied to a simple di/graph and a vertex, <code class="code">ConnectedComponent</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">DigraphConnectedComponent</code> (<a href="chap5.html#X8484EC557810CD31">5.4-10</a>). <code class="func">DigraphConnectedComponent</code> (<a href="chap5.html#X8484EC557810CD31">5.4-10</a>) can also be applied to non-simple graphs (in the language of <a href="https://gap-packages.github.io/grape">GRAPE</a> ).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">ConnectedComponents</code></td>
<td class="tdleft"><code class="func">DigraphConnectedComponents</code> (<a href="chap5.html#X842FAD6A7B835977">5.4-9</a>)</td>
<td class="tdleft">When applied to a simple di/graph, <code class="code">ConnectedComponents</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">DigraphConnectedComponents</code> (<a href="chap5.html#X842FAD6A7B835977">5.4-9</a>). <code class="func">DigraphConnectedComponents</code> (<a href="chap5.html#X842FAD6A7B835977">5.4-9</a>) can also be applied to non-simple graphs (in the language of <a href="https://gap-packages.github.io/grape">GRAPE</a> ).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">Bicomponents</code></td>
<td class="tdleft"><code class="func">DigraphBicomponents</code> (<a href="chap5.html#X7F1B5A2782F598B1">5.4-13</a>)</td>
<td class="tdleft">When applied to a simple bipartite di/graph, <code class="code">Bicomponents</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">DigraphBicomponents</code> (<a href="chap5.html#X7F1B5A2782F598B1">5.4-13</a>). The definition of <code class="func">IsBipartiteDigraph</code> (<a href="chap6.html#X860CFB0C8665F356">6.2-3</a>) does not require its argument to be simple (in the language of <a href="https://gap-packages.github.io/grape">GRAPE</a> ), i.e. the bipartite graphs in <a href="https://gap-packages.github.io/grape">GRAPE</a> are a proper subset of the bipartite digraphs in Digraphs.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">DistanceSet</code></td>
<td class="tdleft"><code class="func">DigraphDistanceSet</code> (<a href="chap5.html#X7CB7DDCD84621D38">5.4-5</a>)</td>
<td class="tdleft"><code class="code">DistanceSet</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">DigraphDistanceSet</code> (<a href="chap5.html#X7CB7DDCD84621D38">5.4-5</a>) in Digraphs.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">Layers</code></td>
<td class="tdleft"><code class="func">DigraphLayers</code> (<a href="chap5.html#X870E04307C5F213F">5.4-36</a>)</td>
<td class="tdleft"><code class="code">Layers</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">DigraphLayers</code> (<a href="chap5.html#X870E04307C5F213F">5.4-36</a>) in Digraphs.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">IndependentSet</code></td>
<td class="tdleft"><code class="func">DigraphIndependentSet</code> (<a href="chap8.html#X84350678782BFAB7">8.2-2</a>)</td>
<td class="tdleft"><code class="code">IndependentSet</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">DigraphIndependentSet</code> (<a href="chap8.html#X84350678782BFAB7">8.2-2</a>) in Digraphs.</td>
</tr>
</table> 
</div>

<a id="X7E51B92F7E89E266" name="X7E51B92F7E89E266"></a>

<h4>A.5 
 Functions to construct new graphs from old
 </h4>

<div class="pcenter"><table class="GAPDocTable">
<tr>
<td class="tdleft"><a href="https://gap-packages.github.io/grape">GRAPE</a> command</td>
<td class="tdleft">Digraphs command</td>
<td class="tdleft">Comments</td>
</tr>
<tr>
<td class="tdleft"><code class="code">InducedSubgraph</code></td>
<td class="tdleft"><code class="func">InducedSubdigraph</code> (<a href="chap3.html#X83C51DA182CCEA2F">3.3-3</a>)</td>
<td class="tdleft"><code class="func">InducedSubdigraph</code> (<a href="chap3.html#X83C51DA182CCEA2F">3.3-3</a>) in Digraphs does not allow a third argument <code class="code">G</code> specifying a group of automorphisms on the resultant graph. This may be included in a future release.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">DistanceSetInduced</code></td>
<td class="tdleft">None</td>
<td class="tdleft">There is no analogous function in Digraphs, and no plans to include one.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">DistanceGraph</code></td>
<td class="tdleft"><code class="func">DistanceDigraph</code> (<a href="chap3.html#X865436437DF95FEF">3.3-46</a>)</td>
<td class="tdleft"><code class="code">DistanceGraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">DistanceDigraph</code> (<a href="chap3.html#X865436437DF95FEF">3.3-46</a>) in Digraphs.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">ComplementGraph</code></td>
<td class="tdleft"><code class="func">DigraphDual</code> (<a href="chap3.html#X7F71D99D852B130F">3.3-11</a>)</td>
<td class="tdleft"><code class="func">DigraphDual</code> (<a href="chap3.html#X7F71D99D852B130F">3.3-11</a>) in Digraphs is equivalent to <code class="code">ComplementGraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> with the optional argument <var class="Arg">comploops</var> set to <code class="keyw">true</code> (loops/nonloops are complemented).</td>
</tr>
<tr>
<td class="tdleft"><code class="code">PointGraph</code></td>
<td class="tdleft">None</td>
<td class="tdleft">There is no analogous function in Digraphs, and no plans to include one.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">EdgeGraph</code></td>
<td class="tdleft"><code class="func">EdgeUndirectedDigraph</code> (<a href="chap3.html#X8364C6F17A1680CB">3.3-42</a>)</td>
<td class="tdleft"><code class="code">EdgeGraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">EdgeUndirectedDigraph</code> (<a href="chap3.html#X8364C6F17A1680CB">3.3-42</a>) in Digraphs.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">SwitchedGraph</code></td>
<td class="tdleft">None</td>
<td class="tdleft">There is no analogous function in Digraphs, and no plans to include one.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">UnderlyingGraph</code></td>
<td class="tdleft"><code class="func">DigraphSymmetricClosure</code> (<a href="chap3.html#X874883DD7DD450C4">3.3-12</a>)</td>
<td class="tdleft"><code class="code">UnderlyingGraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">DigraphSymmetricClosure</code> (<a href="chap3.html#X874883DD7DD450C4">3.3-12</a>) in Digraphs.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">QuotientGraph</code></td>
<td class="tdleft"><code class="func">QuotientDigraph</code> (<a href="chap3.html#X7D1D26D27F5B56C2">3.3-9</a>)</td>
<td class="tdleft"><code class="func">QuotientDigraph</code> (<a href="chap3.html#X7D1D26D27F5B56C2">3.3-9</a>) in Digraphs takes a partition <code class="code">p</code> of the vertices of the digraph, rather than a set of generating pairs. Hence, the equivalence might not be group-invariant. Also note that in Digraphs multiple edges may be created, whereas in <a href="https://gap-packages.github.io/grape">GRAPE</a> they are effectively combined into a single edge.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">BipartiteDouble</code></td>
<td class="tdleft"><code class="func">BipartiteDoubleDigraph</code> (<a href="chap3.html#X7C6E6CB284982C7A">3.3-44</a>)</td>
<td class="tdleft"><code class="code">BipartiteDouble</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">BipartiteDoubleDigraph</code> (<a href="chap3.html#X7C6E6CB284982C7A">3.3-44</a>) in Digraphs.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">GeodesicsGraph</code></td>
<td class="tdleft">None</td>
<td class="tdleft">There is no analogous function in Digraphs, and no plans to include one.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">CollapsedIndependentOrbitsGraph</code></td>
<td class="tdleft">None</td>
<td class="tdleft">There is no analogous function in Digraphs, although this feature might be implemented in the future.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">CollapsedCompleteOrbitsGraph</code></td>
<td class="tdleft">None</td>
<td class="tdleft">There is no analogous function in Digraphs, although this feature might be implemented in the future.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">NewGroupGraph</code></td>
<td class="tdleft">None</td>
<td class="tdleft">There is no analogous function in Digraphs. However, the same results would be possible by calling <code class="func">DigraphCopy</code> (<a href="chap3.html#X83D93A8A8251E6F9">3.3-1</a>) on the digraph to produce a copy <code class="code">gr</code>, and then applying <code class="code">SetDigraphGroup(gr, G)</code>.</td>
</tr>
</table> 
</div>

<a id="X7A61E3FC7A2BB50E" name="X7A61E3FC7A2BB50E"></a>

<h4>A.6 
 Vertex-Colouring and Complete Subgraphs
 </h4>

<div class="pcenter"><table class="GAPDocTable">
<tr>
<td class="tdleft"><a href="https://gap-packages.github.io/grape">GRAPE</a> command</td>
<td class="tdleft">Digraphs command</td>
<td class="tdleft">Comments</td>
</tr>
<tr>
<td class="tdleft"><code class="code">VertexColouring</code></td>
<td class="tdleft"><code class="func">DigraphGreedyColouring</code> (<a href="chap7.html#X7AB7200D831013C1">7.3-16</a>)</td>
<td class="tdleft"><code class="code">VertexColouring</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">DigraphGreedyColouring</code> (<a href="chap7.html#X7AB7200D831013C1">7.3-16</a>) in Digraphs, except it returns a transformation rather than a list of vertex colors.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">CompleteSubgraphs</code></td>
<td class="tdleft"><code class="func">DigraphCliques</code> (<a href="chap8.html#X84EA2F9482B8D4AF">8.1-4</a>)</td>
<td class="tdleft">The functionality of <code class="code">CompleteSubgraphs</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is provided by <code class="func">DigraphCliques</code> (<a href="chap8.html#X84EA2F9482B8D4AF">8.1-4</a>) and <code class="func">DigraphMaximalCliques</code> (<a href="chap8.html#X84EA2F9482B8D4AF">8.1-4</a>) in Digraphs.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">CompleteSubgraphsOfGivenSize</code></td>
<td class="tdleft"><code class="func">DigraphCliques</code> (<a href="chap8.html#X84EA2F9482B8D4AF">8.1-4</a>)</td>
<td class="tdleft">Much of the functionality of <code class="code">CompleteSubgraphsOfGivenSize</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is provided by <code class="func">DigraphCliques</code> (<a href="chap8.html#X84EA2F9482B8D4AF">8.1-4</a>) and <code class="func">DigraphMaximalCliques</code> (<a href="chap8.html#X84EA2F9482B8D4AF">8.1-4</a>) in Digraphs, except that the functionality relating to vertex weights and partial colourings is not implemented.</td>
</tr>
</table> 
</div>

<a id="X7DFC61EC7CBDBC7E" name="X7DFC61EC7CBDBC7E"></a>

<h4>A.7 
 Automorphism groups and isomorphism testing for graphs
 </h4>

<div class="pcenter"><table class="GAPDocTable">
<tr>
<td class="tdleft"><a href="https://gap-packages.github.io/grape">GRAPE</a> command</td>
<td class="tdleft">Digraphs command</td>
<td class="tdleft">Comments</td>
</tr>
<tr>
<td class="tdleft"><code class="code">AutGroupGraph</code></td>
<td class="tdleft"><code class="func">AutomorphismGroup</code> (<a href="chap7.html#X858C32127A190175">7.2-2</a>)</td>
<td class="tdleft"><code class="code">AutGroupGraph</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">AutomorphismGroup</code> (<a href="chap7.html#X858C32127A190175">7.2-2</a>) in Digraphs.</td>
</tr>
<tr>
<td class="tdleft"><code class="code">GraphIsomorphism</code></td>
<td class="tdleft"><code class="func">IsomorphismDigraphs</code> (<a href="chap7.html#X8219FE6C839D9457">7.2-17</a>)</td>
<td class="tdleft"><code class="code">GraphIsomorphism</code> in <a href="https://gap-packages.github.io/grape">GRAPE</a> is equivalent to <code class="func">IsomorphismDigraphs</code> (<a href="chap7.html#X8219FE6C839D9457">7.2-17</a>) in Digraphs. Note however that <code class="code">GraphIsomorphism</code>'s optional argument firstunbindcanon is not applicable, since the canonical labellings of a digraph are not portable between sessions.

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.