| Quellcodebibliothek Statistik Leitseite products/sources/formale Sprachen/GAP/pkg/digraphs/doc/ (Algebra von RWTH Aachen Version 4.15.1©) Datei vom 27.8.2025 mit Größe 60 kB |
|
SSL chapInd_mj.html
Interaktion und |
|||||||||||
<?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> <script type="text/javascript" src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLor </script> <title>GAP (Digraphs) - Index</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="chapInd" onload="jscontent()"> <div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top< <div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.ht <p id="mathjaxlink" class="pcenter"><a href="chapInd.html">[MathJax off]</a></p> <p><a id="X83A0356F839C696F" name="X83A0356F839C696F"></a></p> <div class="index"> <h3>Index</h3> <code class="code"><</code> (for digraphs) <a href="chap4_mj.html#X84E0B5B88358C96B">4.1</a> <br <code class="code">=</code> (for digraphs) <a href="chap4_mj.html#X84E0B5B88358C96B">4.1</a> <b <code class="func">AdjacencyMatrix</code> <a href="chap5_mj.html#X7DC2CD70830BEE60">5.2-1< <code class="func">AdjacencyMatrixMutableCopy</code> <a href="chap5_mj.html#X7DC2CD70830 <code class="func">AdjacencyMatrixUpperTriangleLineDecoder</code> <a href="chap9_mj.html <code class="func">AndrasfaiGraph</code> <a href="chap3_mj.html#X7D5E3E337D03EDFF">3.5-1</ <code class="func">ArticulationPoints</code> <a href="chap5_mj.html#X7DDE06E47E605DD7">5. <code class="func">AsBinaryRelation</code> <a href="chap3_mj.html#X7FBC4BDB82FBEDD2">3.2- <code class="func">AsDigraph</code>, for a binary relation <a href="chap3_mj.html#X86834E307 <code class="func">AsGraph</code> <a href="chap3_mj.html#X7C4F13E080EC16B0">3.2-4</a> <br /> <code class="func">AsMonoid</code> <a href="chap5_mj.html#X87D5C60D7B0C1309">5.6-1</a> <br /> <code class="func">AsSemigroup</code>, for a filter and a digraph <a href="chap5_mj.html#X87D5 for a filter, semilattice digraph, and two lists <a href="chap5_mj.html#X7C6D5EC27C51066B"> <code class="func">AsTransformation</code> <a href="chap3_mj.html#X7C5360B2799943F3">3.2- <code class="func">AutomorphismGroup</code>, for a digraph <a href="chap7_mj.html#X858C3212 for a digraph and a homogeneous list <a href="chap7_mj.html#X877732B1783C391B">7.2-5</a> <br /> for a digraph, homogeneous list, and list <a href="chap7_mj.html#X7DA2C4FE837FFE01">7.2-6</ <code class="func">BananaTree</code> <a href="chap3_mj.html#X8636C2898395B7DF">3.5-2</a> <br /> <code class="func">BinaryTree</code> <a href="chap3_mj.html#X7FC309427BB170D8">3.5-3</a> <br /> <code class="func">BinomialTreeGraph</code> <a href="chap3_mj.html#X845C374280D6EAA4">3.5 <code class="func">BipartiteDoubleDigraph</code> <a href="chap3_mj.html#X7C6E6CB284982C7 <code class="func">BishopGraph</code> <a href="chap3_mj.html#X7E3240047C92733F">3.5-5</a> <br <code class="func">BishopsGraph</code> <a href="chap3_mj.html#X7E3240047C92733F">3.5-5</a> <b <code class="func">BlissAutomorphismGroup</code>, for a digraph <a href="chap7_mj.html#X7E7 for a digraph and homogeneous list <a href="chap7_mj.html#X7E7B0D88865A89F6">7.2-3</a> <br /> for a digraph, homogeneous list, and list <a href="chap7_mj.html#X7E7B0D88865A89F6">7.2-3</ <code class="func">BlissCanonicalDigraph</code> <a href="chap7_mj.html#X877B1D377EC197D7 <code class="func">BlissCanonicalLabelling</code>, for a digraph <a href="chap7_mj.html#X7D for a digraph and a list <a href="chap7_mj.html#X87DA265D803DB337">7.2-8</a> <br /> <code class="func">BondyGraph</code> <a href="chap3_mj.html#X81A0AC37816D287B">3.5-6</a> <br /> <code class="func">BookGraph</code> <a href="chap3_mj.html#X861F493382FA7C0B">3.5-7</a> <br /> <code class="func">BooleanAdjacencyMatrix</code> <a href="chap5_mj.html#X8507DC4F794780C <code class="func">BooleanAdjacencyMatrixMutableCopy</code> <a href="chap5_mj.html#X8507 <code class="func">Bridges</code> <a href="chap5_mj.html#X84D5A125848BD800">5.4-16</a> <br /> <code class="func">BurntPancakeGraph</code> <a href="chap3_mj.html#X8542287E81BDB55E">3.5 <code class="func">CayleyDigraph</code> <a href="chap3_mj.html#X7FCADADC7EC28478">3.1-12</ <code class="func">ChainDigraph</code> <a href="chap3_mj.html#X870594FC866AC88E">3.5-11</a> < <code class="func">CharacteristicPolynomial</code> <a href="chap5_mj.html#X87FA0A727CDB0 <code class="func">ChromaticNumber</code> <a href="chap7_mj.html#X807D49358529A37C">7.3-1 <code class="func">CirculantGraph</code> <a href="chap3_mj.html#X7DB5AB657A797CF2">3.5-12< <code class="func">CliqueNumber</code> <a href="chap8_mj.html#X78427A8B81FEB457">8.1-5</a> <b <code class="func">CliquesFinder</code> <a href="chap8_mj.html#X7A3BC9FF8169ABCD">8.1-2</a> < <code class="func">CompleteBipartiteDigraph</code> <a href="chap3_mj.html#X8795B0AD85601 <code class="func">CompleteDigraph</code> <a href="chap3_mj.html#X812417E278198D9C">3.5-1 <code class="func">CompleteMultipartiteDigraph</code> <a href="chap3_mj.html#X873F29CC86 <code class="func">ConormalProduct</code> <a href="chap3_mj.html#X8160BCC378AF000F">3.3-3 <code class="func">CycleDigraph</code> <a href="chap3_mj.html#X80C29DDE876FFBEB">3.5-16</a> < <code class="func">CycleGraph</code> <a href="chap3_mj.html#X7F6EC0AE81531C3C">3.5-17</a> <br <code class="func">DegreeMatrix</code> <a href="chap5_mj.html#X7BEAE1C78267F54D">5.2-15</a> < <code class="func">Digraph</code> <a href="chap3_mj.html#X834843057CE86655">3.1-7</a> <br /> for a group, list, function, and function <a href="chap3_mj.html#X834843057CE86655">3.1-7</ for a list and function <a href="chap3_mj.html#X834843057CE86655">3.1-7</a> <br /> <code class="func">Digraph6String</code> <a href="chap9_mj.html#X782A052979EA2376">9.2-3</ <code class="func">DigraphAbsorptionExpectedSteps</code> <a href="chap5_mj.html#X7B0A62C <code class="func">DigraphAbsorptionProbabilities</code> <a href="chap5_mj.html#X7874592 <code class="func">DigraphAddAllLoops</code> <a href="chap3_mj.html#X8167A50A83256ED1">3. <code class="func">DigraphAddAllLoopsAttr</code> <a href="chap3_mj.html#X8167A50A83256ED <code class="func">DigraphAddEdge</code>, for a digraph and an edge <a href="chap3_mj.html#X7E for a digraph, source, and range <a href="chap3_mj.html#X7E58CC4880627658">3.3-17</a> <br /> <code class="func">DigraphAddEdgeOrbit</code> <a href="chap3_mj.html#X7BE5C7028760B053">3 <code class="func">DigraphAddEdges</code> <a href="chap3_mj.html#X8693A61B7F752C76">3.3-1 <code class="func">DigraphAddVertex</code> <a href="chap3_mj.html#X83B2506D79453208">3.3- <code class="func">DigraphAddVertices</code>, for a digraph and a list of labels <a href="chap3_ for a digraph and an integer <a href="chap3_mj.html#X8134BEE7786BD3A7">3.3-16</a> <br /> <code class="func">DigraphAdjacencyFunction</code> <a href="chap5_mj.html#X7AFCE34A7A04D <code class="func">DigraphAllChordlessCycles</code> <a href="chap5_mj.html#X7F0AC5617CE5 <code class="func">DigraphAllChordlessCyclesOfMaximalLength</code> <a href="chap5_mj.htm <code class="func">DigraphAllSimpleCircuits</code> <a href="chap5_mj.html#X7ECD16838704F <code class="func">DigraphAllUndirectedSimpleCircuits</code> <a href="chap5_mj.html#X7F9 <code class="func">DigraphBicomponents</code> <a href="chap5_mj.html#X7F1B5A2782F598B1">5 <code class="func">DigraphByAdjacencyMatrix</code> <a href="chap3_mj.html#X8023FE387A3AB <code class="func">DigraphByEdges</code> <a href="chap3_mj.html#X7F37B6768349E269">3.1-9</ <code class="func">DigraphByInNeighbors</code> <a href="chap3_mj.html#X81BC49B57EAADEFB"> <code class="func">DigraphByInNeighbours</code> <a href="chap3_mj.html#X81BC49B57EAADEFB <code class="func">DigraphByOutNeighboursType</code> <a href="chap3_mj.html#X86E798B7795 <code class="func">DigraphCartesianProduct</code>, for a list of digraphs <a href="chap3_mj.h for a positive number of digraphs <a href="chap3_mj.html#X7D625CC87DBFFDED">3.3-32</a> <br /> <code class="func">DigraphCartesianProductProjections</code> <a href="chap3_mj.html#X879 <code class="func">DigraphClique</code> <a href="chap8_mj.html#X789854AC7B466402">8.1-3</a> < <code class="func">DigraphCliques</code> <a href="chap8_mj.html#X84EA2F9482B8D4AF">8.1-4</ <code class="func">DigraphCliquesReps</code> <a href="chap8_mj.html#X84EA2F9482B8D4AF">8. <code class="func">DigraphClosure</code> <a href="chap3_mj.html#X86F9CCEA839ABC48">3.3-47< <code class="func">DigraphColouring</code>, for a digraph and a number of colours <a href="chap7 <code class="func">DigraphConnectedComponent</code> <a href="chap5_mj.html#X8484EC557810 <code class="func">DigraphConnectedComponents</code> <a href="chap5_mj.html#X842FAD6A7B8 <code class="func">DigraphContractEdge</code>, for a digraph and a list of positive integers <a h for a digraph and two positive integers <a href="chap3_mj.html#X792AD1147E2BFCB7">3.3-27</a> < <code class="func">DigraphCopy</code> <a href="chap3_mj.html#X83D93A8A8251E6F9">3.3-1</a> <br <code class="func">DigraphCopySameMutability</code> <a href="chap3_mj.html#X83D93A8A8251 <code class="func">DigraphCore</code> <a href="chap7_mj.html#X863487EF7D64EF56">7.3-19</a> <b <code class="func">DigraphCycle</code> <a href="chap3_mj.html#X80C29DDE876FFBEB">3.5-16</a> < <code class="func">DigraphCycleBasis</code> <a href="chap5_mj.html#X794CD6037D4CF58C">5.4 <code class="func">DigraphDegeneracy</code> <a href="chap5_mj.html#X7B2E42327DA118E0">5.4 <code class="func">DigraphDegeneracyOrdering</code> <a href="chap5_mj.html#X827C2BD17A45 <code class="func">DigraphDiameter</code> <a href="chap5_mj.html#X7F16B9EB8398459C">5.4-1< <code class="func">DigraphDijkstra</code>, for a source <a href="chap5_mj.html#X79352A8286D for a source and target <a href="chap5_mj.html#X79352A8286D1D8F6">5.4-41</a> <br /> <code class="func">DigraphDirectProduct</code>, for a list of digraphs <a href="chap3_mj.html for a positive number of digraphs <a href="chap3_mj.html#X84D24DC9833B54A5">3.3-33</a> <br /> <code class="func">DigraphDirectProductProjections</code> <a href="chap3_mj.html#X84FB64 <code class="func">DigraphDisjointUnion</code>, for a list of digraphs <a href="chap3_mj.html for an arbitrary number of digraphs <a href="chap3_mj.html#X814F1DFC83DB273F">3.3-29</a> <br /> <code class="func">DigraphDistanceSet</code>, for a digraph, a pos int, and a list <a href="chap5 for a digraph, a pos int, and an int <a href="chap5_mj.html#X7CB7DDCD84621D38">5.4-5</a> <br /> <code class="func">DigraphDual</code> <a href="chap3_mj.html#X7F71D99D852B130F">3.3-11</a> <b <code class="func">DigraphDualAttr</code> <a href="chap3_mj.html#X7F71D99D852B130F">3.3-1 <code class="func">DigraphEdgeLabel</code> <a href="chap5_mj.html#X79FAEACC7F438C2F">5.1- <code class="func">DigraphEdgeLabels</code> <a href="chap5_mj.html#X7C24851087D4A8FB">5.1 <code class="func">DigraphEdges</code> <a href="chap5_mj.html#X7D1C6A4D7ECEC317">5.1-3</a> <b <code class="func">DigraphEdgeUnion</code>, for a list of digraphs <a href="chap3_mj.html#X7D for a positive number of digraphs <a href="chap3_mj.html#X7DA997697D310E44">3.3-30</a> <br /> <code class="func">DigraphEmbedding</code> <a href="chap7_mj.html#X7AD04CC186E86CCA">7.3- <code class="func">DigraphEpimorphism</code> <a href="chap7_mj.html#X7CB5AD9F861684FD">7. <code class="func">DigraphFamily</code> <a href="chap3_mj.html#X86E798B779515678">3.1-6</a> < <code class="func">DigraphFile</code> <a href="chap9_mj.html#X7845ACDA7D4D333D">9.2-6</a> <br <code class="func">DigraphFloydWarshall</code> <a href="chap5_mj.html#X864A31A8809F61C2"> <code class="func">DigraphFromDigraph6String</code> <a href="chap9_mj.html#X873D6EB8836A <code class="func">DigraphFromDIMACSString</code> <a href="chap9_mj.html#X7923733D86767C <code class="func">DigraphFromDiSparse6String</code> <a href="chap9_mj.html#X873D6EB8836 <code class="func">DigraphFromDreadnautString</code> <a href="chap9_mj.html#X87DD8B1E867 <code class="func">DigraphFromGraph6String</code> <a href="chap9_mj.html#X873D6EB8836A3C <code class="func">DigraphFromPlainTextString</code> <a href="chap9_mj.html#X8540FC21796 <code class="func">DigraphFromSparse6String</code> <a href="chap9_mj.html#X873D6EB8836A3 <code class="func">DigraphGirth</code> <a href="chap5_mj.html#X79A3DA4078CF3C90">5.4-6</a> <b <code class="func">DigraphGreedyColouring</code>, for a digraph <a href="chap7_mj.html#X7AB for a digraph and vertex order <a href="chap7_mj.html#X7AB7200D831013C1">7.3-16</a> <br /> for a digraph and vertex order function <a href="chap7_mj.html#X7AB7200D831013C1">7.3-16</a> < <code class="func">DigraphGroup</code> <a href="chap7_mj.html#X803ACEDA7BBAC5B3">7.2-10</a> < <code class="func">DigraphHasAVertex</code> <a href="chap6_mj.html#X82DBFFF17E708803">6.1 <code class="func">DigraphHash</code> <a href="chap5_mj.html#X7D97D990867B0149">5.8-1</a> <br <code class="func">DigraphHasLoops</code> <a href="chap6_mj.html#X7D92935C7D535187">6.2-1< <code class="func">DigraphHasNoVertices</code> <a href="chap6_mj.html#X78E16B8B7DF55B59"> <code class="func">DigraphHomomorphism</code> <a href="chap7_mj.html#X85E9B019877AD7FE">7 <code class="func">DigraphImmutableCopy</code> <a href="chap3_mj.html#X83D93A8A8251E6F9"> <code class="func">DigraphImmutableCopyIfImmutable</code> <a href="chap3_mj.html#X8399F7 <code class="func">DigraphImmutableCopyIfMutable</code> <a href="chap3_mj.html#X8399F742 <code class="func">DigraphIndependentSet</code> <a href="chap8_mj.html#X84350678782BFAB7 <code class="func">DigraphIndependentSets</code> <a href="chap8_mj.html#X7D2C78EB81A798A <code class="func">DigraphIndependentSetsReps</code> <a href="chap8_mj.html#X7D2C78EB81A <code class="func">DigraphInEdges</code> <a href="chap5_mj.html#X7EFAF01B7A155157">5.1-15< <code class="func">DigraphIsKing</code> <a href="chap5_mj.html#X835AAF9085BC9D84">5.4-43</ <code class="func">DigraphJoin</code>, for a list of digraphs <a href="chap3_mj.html#X7DDFC75 for a positive number of digraphs <a href="chap3_mj.html#X7DDFC759860E3390">3.3-31</a> <br /> <code class="func">DigraphJoinTable</code> <a href="chap6_mj.html#X84F4711F7FA36848">6.4- <code class="func">DigraphKings</code> <a href="chap5_mj.html#X7A17B9B67AC50561">5.4-44</a> < <code class="func">DigraphLayers</code> <a href="chap5_mj.html#X870E04307C5F213F">5.4-36</ <code class="func">DigraphLongestDistanceFromVertex</code> <a href="chap5_mj.html#X82237 <code class="func">DigraphLongestSimpleCircuit</code> <a href="chap5_mj.html#X7C735C4E86 <code class="func">DigraphLoops</code> <a href="chap5_mj.html#X83271F607BD809CF">5.2-14</a> < <code class="func">DigraphMaximalClique</code> <a href="chap8_mj.html#X789854AC7B466402"> <code class="func">DigraphMaximalCliques</code> <a href="chap8_mj.html#X84EA2F9482B8D4AF <code class="func">DigraphMaximalCliquesAttr</code> <a href="chap8_mj.html#X84EA2F9482B8 <code class="func">DigraphMaximalCliquesReps</code> <a href="chap8_mj.html#X84EA2F9482B8 <code class="func">DigraphMaximalCliquesRepsAttr</code> <a href="chap8_mj.html#X84EA2F94 <code class="func">DigraphMaximalIndependentSet</code> <a href="chap8_mj.html#X843506787 <code class="func">DigraphMaximalIndependentSets</code> <a href="chap8_mj.html#X7D2C78EB <code class="func">DigraphMaximalIndependentSetsAttr</code> <a href="chap8_mj.html#X7D2C <code class="func">DigraphMaximalIndependentSetsReps</code> <a href="chap8_mj.html#X7D2C <code class="func">DigraphMaximalIndependentSetsRepsAttr</code> <a href="chap8_mj.html#X <code class="func">DigraphMaximalMatching</code> <a href="chap5_mj.html#X7B7A67277B1C9A0 <code class="func">DigraphMaximumFlow</code> <a href="chap6_mj.html#X869EFE9F818C6E22">6. <code class="func">DigraphMaximumMatching</code> <a href="chap5_mj.html#X78E9847A858788D <code class="func">DigraphMeetTable</code> <a href="chap6_mj.html#X84F4711F7FA36848">6.4- <code class="func">DigraphMonomorphism</code> <a href="chap7_mj.html#X82D0FCD87D47ACA8">7 <code class="func">DigraphMutableCopy</code> <a href="chap3_mj.html#X83D93A8A8251E6F9">3. <code class="func">DigraphMutableCopyIfImmutable</code> <a href="chap3_mj.html#X8399F742 <code class="func">DigraphMutableCopyIfMutable</code> <a href="chap3_mj.html#X8399F7427B <code class="func">DigraphMycielskian</code> <a href="chap3_mj.html#X7B5AC5FE859F4D80">3. <code class="func">DigraphMycielskianAttr</code> <a href="chap3_mj.html#X7B5AC5FE859F4D8 <code class="func">DigraphNrAdjacencies</code> <a href="chap5_mj.html#X7BD5D255809C859E"> <code class="func">DigraphNrAdjacenciesWithoutLoops</code> <a href="chap5_mj.html#X7E53E <code class="func">DigraphNrConnectedComponents</code> <a href="chap5_mj.html#X842FAD6A7 <code class="func">DigraphNrEdges</code> <a href="chap5_mj.html#X85E1CFDD7E164AD0">5.1-4</ <code class="func">DigraphNrLoops</code> <a href="chap5_mj.html#X7BDABAF07917462B">5.1-7</ <code class="func">DigraphNrStronglyConnectedComponents</code> <a href="chap5_mj.html#X8 <code class="func">DigraphNrVertices</code> <a href="chap5_mj.html#X7C6F19B57CB2E882">5.1 <code class="func">DigraphOddGirth</code> <a href="chap5_mj.html#X8374B7357EC189C1">5.4-7< <code class="func">DigraphOrbitReps</code> <a href="chap7_mj.html#X8386028782F2D3FF">7.2- <code class="func">DigraphOrbits</code> <a href="chap7_mj.html#X8096C5287E459279">7.2-11</ <code class="func">DigraphOutEdges</code> <a href="chap5_mj.html#X7BECFE6687ECD028">5.1-1 <code class="func">DigraphPath</code> <a href="chap5_mj.html#X8039170B82A32257">5.4-23</a> <b <code class="func">DigraphPeriod</code> <a href="chap5_mj.html#X853D0B0981A33433">5.4-18</ <code class="func">DigraphPlainTextLineDecoder</code> <a href="chap9_mj.html#X7AAA35867B <code class="func">DigraphPlainTextLineEncoder</code> <a href="chap9_mj.html#X7AAA35867B <code class="func">DigraphRandomWalk</code> <a href="chap5_mj.html#X7C45396C808308C4">5.4 <code class="func">DigraphRange</code> <a href="chap5_mj.html#X7FDEBF3279759961">5.2-5</a> <b <code class="func">DigraphReflexiveTransitiveClosure</code> <a href="chap3_mj.html#X7A6C <code class="func">DigraphReflexiveTransitiveClosureAttr</code> <a href="chap3_mj.html#X <code class="func">DigraphReflexiveTransitiveReduction</code> <a href="chap3_mj.html#X82 <code class="func">DigraphReflexiveTransitiveReductionAttr</code> <a href="chap3_mj.html <code class="func">DigraphRemoveAllMultipleEdges</code> <a href="chap3_mj.html#X7DCCD024 <code class="func">DigraphRemoveAllMultipleEdgesAttr</code> <a href="chap3_mj.html#X7DCC <code class="func">DigraphRemoveEdge</code>, for a digraph and an edge <a href="chap3_mj.html# for a digraph, source, and range <a href="chap3_mj.html#X8433E3BC7E5EA6BF">3.3-22</a> <br /> <code class="func">DigraphRemoveEdgeOrbit</code> <a href="chap3_mj.html#X85981D9187F4901 <code class="func">DigraphRemoveEdges</code> <a href="chap3_mj.html#X87093FDA7F88E732">3. <code class="func">DigraphRemoveLoops</code> <a href="chap3_mj.html#X79324AF7818C0C02">3. <code class="func">DigraphRemoveLoopsAttr</code> <a href="chap3_mj.html#X79324AF7818C0C0 <code class="func">DigraphRemoveVertex</code> <a href="chap3_mj.html#X7B634A2B83C08B16">3 <code class="func">DigraphRemoveVertices</code> <a href="chap3_mj.html#X7E290E847A5A299A <code class="func">DigraphReverse</code> <a href="chap3_mj.html#X78DECD26811EFD7C">3.3-10< <code class="func">DigraphReverseAttr</code> <a href="chap3_mj.html#X78DECD26811EFD7C">3. <code class="func">DigraphReverseEdge</code>, for a digraph and an edge <a href="chap3_mj.html for a digraph, source, and range <a href="chap3_mj.html#X7821753D85402A8C">3.3-28</a> <br /> <code class="func">DigraphReverseEdges</code>, for a digraph and a list of edges <a href="chap3_ <strong class="pkg">Digraphs</strong> package overview <a href="chap1_mj.html#X7F202ABA780 <code class="func">DigraphSchreierVector</code> <a href="chap7_mj.html#X8657604E87A25E5F <code class="func">DigraphShortestDistance</code>, for a digraph and a list <a href="chap5_mj. for a digraph and two vertices <a href="chap5_mj.html#X8104A9D37BCD8A05">5.4-2</a> <br /> for a digraph, a list, and a list <a href="chap5_mj.html#X8104A9D37BCD8A05">5.4-2</a> <br /> <code class="func">DigraphShortestDistances</code> <a href="chap5_mj.html#X81F99BC67E9D0 <code class="func">DigraphShortestPath</code> <a href="chap5_mj.html#X80E9D645843973A6">5 <code class="func">DigraphShortestPathSpanningTree</code> <a href="chap3_mj.html#X79C770 <code class="func">DigraphSinks</code> <a href="chap5_mj.html#X85D5E08280914EE4">5.1-8</a> <b <code class="func">DigraphsMakeDoc</code> <a href="chap2_mj.html#X870631C38610AC25">2.4-1< <code class="func">DigraphSource</code> <a href="chap5_mj.html#X7FDEBF3279759961">5.2-5</a> < <code class="func">DigraphSources</code> <a href="chap5_mj.html#X7F5C6268839BE98C">5.1-9</ <code class="func">DigraphsRespectsColouring</code> <a href="chap7_mj.html#X7F80709A80CB <code class="func">DigraphStabilizer</code> <a href="chap7_mj.html#X78913684795FB256">7.2 <code class="func">DigraphsTestExtreme</code> <a href="chap2_mj.html#X7885EF3E785D4298">2 <code class="func">DigraphsTestInstall</code> <a href="chap2_mj.html#X86AF4DAE80B978DA">2 <code class="func">DigraphsTestStandard</code> <a href="chap2_mj.html#X7A20088B7C406C4A"> <code class="func">DigraphStronglyConnectedComponent</code> <a href="chap5_mj.html#X7EFC <code class="func">DigraphStronglyConnectedComponents</code> <a href="chap5_mj.html#X833 <code class="func">DigraphsUseBliss</code> <a href="chap7_mj.html#X83E593F3855B122E">7.2- <code class="func">DigraphsUseNauty</code> <a href="chap7_mj.html#X83E593F3855B122E">7.2- <code class="func">DigraphSymmetricClosure</code> <a href="chap3_mj.html#X874883DD7DD450 <code class="func">DigraphSymmetricClosureAttr</code> <a href="chap3_mj.html#X874883DD7D <code class="func">DigraphTopologicalSort</code> <a href="chap5_mj.html#X785C30378064CF4 <code class="func">DigraphTransitiveClosure</code> <a href="chap3_mj.html#X7A6C419080AD4 <code class="func">DigraphTransitiveClosureAttr</code> <a href="chap3_mj.html#X7A6C41908 <code class="func">DigraphTransitiveReduction</code> <a href="chap3_mj.html#X82AD17517E2 <code class="func">DigraphTransitiveReductionAttr</code> <a href="chap3_mj.html#X82AD175 <code class="func">DigraphUndirectedGirth</code> <a href="chap5_mj.html#X84688B337BDDBB0 <code class="func">DigraphVertexLabel</code> <a href="chap5_mj.html#X7CA91E4B7904F793">5. <code class="func">DigraphVertexLabels</code> <a href="chap5_mj.html#X7E51F2FE87140B32">5 <code class="func">DigraphVertices</code> <a href="chap5_mj.html#X7C45F7D878D896AC">5.1-1< <code class="func">DigraphWelshPowellOrder</code> <a href="chap7_mj.html#X7F9CB3B27B9590 <code class="func">DIMACSString</code> <a href="chap9_mj.html#X7923733D86767CE1">9.2-5</a> <b <code class="func">DiSparse6String</code> <a href="chap9_mj.html#X782A052979EA2376">9.2-3< <code class="func">DistanceDigraph</code>, for digraph and int <a href="chap3_mj.html#X86543 for digraph and list <a href="chap3_mj.html#X865436437DF95FEF">3.3-46</a> <br /> <code class="func">Dominators</code> <a href="chap5_mj.html#X7FE79CB278CE6991">5.4-28</a> <br <code class="func">DominatorTree</code> <a href="chap5_mj.html#X7D66A0FB7F6100FB">5.4-29</ <code class="func">DotColoredDigraph</code> <a href="chap9_mj.html#X7F9B99C478EE093A">9.1 <code class="func">DotDigraph</code> <a href="chap9_mj.html#X7F9B99C478EE093A">9.1-2</a> <br /> <code class="func">DotEdgeColoredDigraph</code> <a href="chap9_mj.html#X7F9B99C478EE093A <code class="func">DotHighlightedDigraph</code> <a href="chap9_mj.html#X808D12CF81E2C19F <code class="func">DotPartialOrderDigraph</code> <a href="chap9_mj.html#X84120D447E2CAC2 <code class="func">DotPreorderDigraph</code> <a href="chap9_mj.html#X7F5653C8854FAEA6">9. <code class="func">DotQuasiorderDigraph</code> <a href="chap9_mj.html#X7F5653C8854FAEA6"> <code class="func">DotSymmetricColoredDigraph</code> <a href="chap9_mj.html#X78DA31D1869 <code class="func">DotSymmetricDigraph</code> <a href="chap9_mj.html#X78DA31D1869D2F94">9 <code class="func">DotSymmetricEdgeColoredDigraph</code> <a href="chap9_mj.html#X78DA31D <code class="func">DotSymmetricVertexColoredDigraph</code> <a href="chap9_mj.html#X78DA3 <code class="func">DotVertexColoredDigraph</code> <a href="chap9_mj.html#X7F9B99C478EE09 <code class="func">DotVertexLabelledDigraph</code> <a href="chap9_mj.html#X7F9B99C478EE0 <code class="func">DoubleDigraph</code> <a href="chap3_mj.html#X7FB8B48C87C0ED16">3.3-43</ <code class="func">DreadnautString</code> <a href="chap9_mj.html#X87DD8B1E867760A5">9.2-4< <code class="func">DualPlanarGraph</code> <a href="chap5_mj.html#X876803517C34E1CD">5.7-6< <code class="func">EdgeDigraph</code> <a href="chap3_mj.html#X8595BF937B749F22">3.3-41</a> <b <code class="func">EdgeOrbitsDigraph</code> <a href="chap3_mj.html#X7B75C1D680757D6F">3.1 <code class="func">EdgeUndirectedDigraph</code> <a href="chap3_mj.html#X8364C6F17A1680CB <code class="func">EdgeWeightedDigraph</code> <a href="chap6_mj.html#X7E14055A84A52A07">6 <code class="func">EdgeWeightedDigraphMinimumSpanningTree</code> <a href="chap6_mj.html# <code class="func">EdgeWeightedDigraphShortestPath</code> <a href="chap6_mj.html#X7DAF81 <code class="func">EdgeWeightedDigraphShortestPaths</code>, for a digraph <a href="chap6_mj for a digraph and a pos int <a href="chap6_mj.html#X7EDB9C9A840F6A84">6.3-5</a> <br /> <code class="func">EdgeWeightedDigraphTotalWeight</code> <a href="chap6_mj.html#X810B2DD <code class="func">EdgeWeights</code> <a href="chap6_mj.html#X8639092D8689333D">6.3-1</a> <br <code class="func">EdgeWeightsMutableCopy</code> <a href="chap6_mj.html#X8639092D8689333 <code class="func">EmbeddingsDigraphs</code> <a href="chap7_mj.html#X82EBDF137EEDC5FD">7. <code class="func">EmbeddingsDigraphsRepresentatives</code> <a href="chap7_mj.html#X82EB <code class="func">EmptyDigraph</code> <a href="chap3_mj.html#X80DAE31A79FEFD40">3.5-18</a> < <code class="func">EpimorphismsDigraphs</code> <a href="chap7_mj.html#X7DFB1F5D873937B3"> <code class="func">EpimorphismsDigraphsRepresentatives</code> <a href="chap7_mj.html#X7D <code class="func">FacialWalks</code> <a href="chap5_mj.html#X805F15398735AD7D">5.4-35</a> <b <code class="func">GearGraph</code> <a href="chap3_mj.html#X7CE45E2B782ADE9A">3.5-19</a> <br /> <code class="func">GeneralisedPetersenGraph</code> <a href="chap3_mj.html#X7B5441F386BD1 <code class="func">GeneratorsOfCayleyDigraph</code> <a href="chap5_mj.html#X8528455987D7 <code class="func">GeneratorsOfEndomorphismMonoid</code> <a href="chap7_mj.html#X7E93B26 <code class="func">GeneratorsOfEndomorphismMonoidAttr</code> <a href="chap7_mj.html#X7E9 <code class="func">Graph</code> <a href="chap3_mj.html#X7B335342839E5146">3.2-3</a> <br /> <code class="func">Graph6String</code> <a href="chap9_mj.html#X782A052979EA2376">9.2-3</a> <b <code class="func">GridGraph</code> <a href="chap3_mj.html#X8404987F849D7CF2">3.5-43</a> <br /> <code class="func">GroupOfCayleyDigraph</code> <a href="chap5_mj.html#X7A000B1D7CCF7093"> <code class="func">HaarGraph</code> <a href="chap3_mj.html#X795B62398767E313">3.5-20</a> <br /> <code class="func">HalvedCubeGraph</code> <a href="chap3_mj.html#X801024F57DDC8A39">3.5-2 <code class="func">HamiltonianPath</code> <a href="chap5_mj.html#X863FDFC4839A3B82">5.4-3 <code class="func">HanoiGraph</code> <a href="chap3_mj.html#X7C43BDE47DF6553A">3.5-22</a> <br <code class="func">HelmGraph</code> <a href="chap3_mj.html#X782ABFCE812B020A">3.5-23</a> <br /> <code class="func">HomomorphicProduct</code> <a href="chap3_mj.html#X79FD2AF279F20A72">3. <code class="func">HomomorphismDigraphsFinder</code> <a href="chap7_mj.html#X79ABF0E783F <code class="func">HomomorphismsDigraphs</code> <a href="chap7_mj.html#X8653EDA183E06D05 <code class="func">HomomorphismsDigraphsRepresentatives</code> <a href="chap7_mj.html#X8 <code class="func">HypercubeGraph</code> <a href="chap3_mj.html#X7EE552F88609B1A2">3.5-24< <code class="func">InDegreeOfVertex</code> <a href="chap5_mj.html#X7C9CD0527CB9E6EF">5.2- <code class="func">InDegrees</code> <a href="chap5_mj.html#X7ADDFBFD7A365775">5.2-9</a> <br /> <code class="func">InDegreeSequence</code> <a href="chap5_mj.html#X7ADDFBFD7A365775">5.2- <code class="func">InDegreeSet</code> <a href="chap5_mj.html#X7ADDFBFD7A365775">5.2-9</a> <br <code class="func">InducedSubdigraph</code> <a href="chap3_mj.html#X83C51DA182CCEA2F">3.3 <code class="func">InNeighbors</code> <a href="chap5_mj.html#X85C7AA5A81DA6E11">5.2-7</a> <br <code class="func">InNeighborsMutableCopy</code> <a href="chap5_mj.html#X85C7AA5A81DA6E1 <code class="func">InNeighborsOfVertex</code> <a href="chap5_mj.html#X7C0DA18B8291F302">5 <code class="func">InNeighbours</code> <a href="chap5_mj.html#X85C7AA5A81DA6E11">5.2-7</a> <b <code class="func">InNeighboursMutableCopy</code> <a href="chap5_mj.html#X85C7AA5A81DA6E <code class="func">InNeighboursOfVertex</code> <a href="chap5_mj.html#X7C0DA18B8291F302"> <code class="func">Is2EdgeTransitive</code> <a href="chap6_mj.html#X7FB8789A7BF847E6">6.8 <code class="func">IsAcyclicDigraph</code> <a href="chap6_mj.html#X7BD08D4478218F77">6.6- <code class="func">IsAntiSymmetricDigraph</code> <a href="chap6_mj.html#X7DB1BC2286FC08E <code class="func">IsAntisymmetricDigraph</code> <a href="chap6_mj.html#X7DB1BC2286FC08E <code class="func">IsAperiodicDigraph</code> <a href="chap6_mj.html#X80E883967EBE839E">6. <code class="func">IsBiconnectedDigraph</code> <a href="chap6_mj.html#X838FAF2D825977BE"> <code class="func">IsBipartiteDigraph</code> <a href="chap6_mj.html#X860CFB0C8665F356">6. <code class="func">IsBridgelessDigraph</code> <a href="chap6_mj.html#X7D2A6572820B7F24">6 <code class="func">IsCayleyDigraph</code> <a href="chap3_mj.html#X7E749324800B38A5">3.1-4< <code class="func">IsChainDigraph</code> <a href="chap6_mj.html#X79563B297C220FB5">6.6-2</ <code class="func">IsClique</code> <a href="chap8_mj.html#X80670E3E7C36183F">8.1-1</a> <br /> <code class="func">IsCompleteBipartiteDigraph</code> <a href="chap6_mj.html#X790A4DBF853 <code class="func">IsCompleteDigraph</code> <a href="chap6_mj.html#X81F28D4D879FE3B2">6.2 <code class="func">IsCompleteMultipartiteDigraph</code> <a href="chap6_mj.html#X7FD1A157 <code class="func">IsConnectedDigraph</code> <a href="chap6_mj.html#X83C08C0B7EC1A91F">6. <code class="func">IsCycleDigraph</code> <a href="chap6_mj.html#X7E91320B8028F5D8">6.6-12< <code class="func">IsDigraph</code> <a href="chap3_mj.html#X7877ADC77F85E630">3.1-1</a> <br /> <code class="func">IsDigraphAutomorphism</code> <a href="chap7_mj.html#X80183D4A7C51365A for a digraph and a transformation or permutation <a href="chap7_mj.html#X80183D4A7C51365A <code class="func">IsDigraphColouring</code> <a href="chap7_mj.html#X7F16B8B3825A627A">7. for a transformation <a href="chap7_mj.html#X7F16B8B3825A627A">7.2-21</a> <br /> <code class="func">IsDigraphCore</code> <a href="chap6_mj.html#X78C0B2637985648B">6.8-1</a> < <code class="func">IsDigraphEdge</code>, for digraph and list <a href="chap5_mj.html#X7BB8ED for digraph and two pos ints <a href="chap5_mj.html#X7BB8ED88835F07B4">5.1-17</a> <br /> <code class="func">IsDigraphEmbedding</code> <a href="chap7_mj.html#X7D6B5A0887903810">7. for digraphs and a permutation or transformation <a href="chap7_mj.html#X7D6B5A0887903810 <code class="func">IsDigraphEndomorphism</code> <a href="chap7_mj.html#X80FE9FCB79718A61 for digraphs and a permutation or transformation <a href="chap7_mj.html#X80FE9FCB79718A61 <code class="func">IsDigraphEpimorphism</code> <a href="chap7_mj.html#X80FE9FCB79718A61"> for digraphs and a permutation or transformation <a href="chap7_mj.html#X80FE9FCB79718A61 <code class="func">IsDigraphHomomorphism</code> <a href="chap7_mj.html#X80FE9FCB79718A61 for digraphs and a permutation or transformation <a href="chap7_mj.html#X80FE9FCB79718A61 <code class="func">IsDigraphIsomorphism</code> <a href="chap7_mj.html#X80183D4A7C51365A"> for digraphs and transformation or permutation <a href="chap7_mj.html#X80183D4A7C51365A"> <code class="func">IsDigraphMonomorphism</code> <a href="chap7_mj.html#X80FE9FCB79718A61 for digraphs and a permutation or transformation <a href="chap7_mj.html#X80FE9FCB79718A61 <code class="func">IsDigraphPath</code> <a href="chap5_mj.html#X7ECD22877AEA89CC">5.4-21</ for a digraph and list <a href="chap5_mj.html#X7ECD22877AEA89CC">5.4-21</a> <br /> <code class="func">IsDigraphWithAdjacencyFunction</code> <a href="chap3_mj.html#X80F1B6D <code class="func">IsDirectedForest</code> <a href="chap6_mj.html#X7B46EA6C7B2DF2FB">6.6- <code class="func">IsDirectedTree</code> <a href="chap6_mj.html#X7B46EA6C7B2DF2FB">6.6-8</ <code class="func">IsDistanceRegularDigraph</code> <a href="chap6_mj.html#X7E2082AC7CAE5 <code class="func">IsDistributiveLatticeDigraph</code> <a href="chap6_mj.html#X7B566B4A8 <code class="func">IsEdgeTransitive</code> <a href="chap6_mj.html#X8361CA6E8401FF26">6.8- <code class="func">IsEmptyDigraph</code> <a href="chap6_mj.html#X7E894CCF7B1C27AE">6.2-7</ <code class="func">IsEquivalenceDigraph</code> <a href="chap6_mj.html#X83762C257DED2751"> <code class="func">IsEulerianDigraph</code> <a href="chap6_mj.html#X79DFBB198525544E">6.6 <code class="func">IsFunctionalDigraph</code> <a href="chap6_mj.html#X7E8F37E585DAED52">6 <code class="func">IsHamiltonianDigraph</code> <a href="chap6_mj.html#X79EFEBC37C2D262D"> <code class="func">IsImmutableDigraph</code> <a href="chap3_mj.html#X7CAFAA89804F80BD">3. <code class="func">IsIndependentSet</code> <a href="chap8_mj.html#X790733B67B0BC894">8.2- <code class="func">IsInRegularDigraph</code> <a href="chap6_mj.html#X7A3F78B37E31D9E1">6. <code class="func">IsIsomorphicDigraph</code>, for digraphs <a href="chap7_mj.html#X7B4F24 for digraphs and homogeneous lists <a href="chap7_mj.html#X7D4A1FA8868DA930">7.2-16</a> <br /> <code class="func">IsJoinSemilatticeDigraph</code> <a href="chap6_mj.html#X78D3E17B7F737 <code class="func">IsLatticeDigraph</code> <a href="chap6_mj.html#X78D3E17B7F737516">6.4- <code class="func">IsLatticeEmbedding</code>, for digraphs and a permutation or transformati <code class="func">IsLatticeEndomorphism</code>, for digraphs and a permutation or transform <code class="func">IsLatticeEpimorphism</code>, for digraphs and a permutation or transforma <code class="func">IsLatticeHomomorphism</code>, for digraphs and a permutation or transform <code class="func">IsLatticeMonomorphism</code>, for digraphs and a permutation or transform <code class="func">IsLowerSemimodularDigraph</code> <a href="chap6_mj.html#X7DEDCD177E5A <code class="func">IsMatching</code> <a href="chap5_mj.html#X848FED0B7B4ACD1F">5.1-18</a> <br <code class="func">IsMaximalClique</code> <a href="chap8_mj.html#X80670E3E7C36183F">8.1-1< <code class="func">IsMaximalIndependentSet</code> <a href="chap8_mj.html#X790733B67B0BC8 <code class="func">IsMaximalMatching</code> <a href="chap5_mj.html#X848FED0B7B4ACD1F">5.1 <code class="func">IsMaximumMatching</code> <a href="chap5_mj.html#X848FED0B7B4ACD1F">5.1 <code class="func">IsMeetSemilatticeDigraph</code> <a href="chap6_mj.html#X78D3E17B7F737 <code class="func">IsModularLatticeDigraph</code> <a href="chap6_mj.html#X80659D5784790B <code class="func">IsMultiDigraph</code> <a href="chap6_mj.html#X7BB84CFC7E8B2B26">6.2-11< <code class="func">IsMutableDigraph</code> <a href="chap3_mj.html#X7D7EDF83820ED6F5">3.1- <code class="func">IsNonemptyDigraph</code> <a href="chap6_mj.html#X7E14AE1F7CA23141">6.2 <code class="func">IsNullDigraph</code> <a href="chap6_mj.html#X7E894CCF7B1C27AE">6.2-7</a> < <code class="func">IsomorphismDigraphs</code>, for digraphs <a href="chap7_mj.html#X8219FE for digraphs and homogeneous lists <a href="chap7_mj.html#X7ED93C0F86D9D34F">7.2-18</a> <br /> <code class="func">IsOrderFilter</code>, for a digraph and a list <a href="chap6_mj.html#X7A1D <code class="func">IsOrderIdeal</code>, for a digraph and list <a href="chap6_mj.html#X786213 <code class="func">IsOuterPlanarDigraph</code> <a href="chap6_mj.html#X8251E8B187E7F059"> <code class="func">IsOutRegularDigraph</code> <a href="chap6_mj.html#X7F0A806E7BCB413C">6 <code class="func">IsPartialOrderDigraph</code> <a href="chap6_mj.html#X82BAE6D37D49A145 <code class="func">IsPerfectMatching</code> <a href="chap5_mj.html#X848FED0B7B4ACD1F">5.1 <code class="func">IsPermutationDigraph</code> <a href="chap6_mj.html#X793FB02C7C59D85B"> <code class="func">IsPlanarDigraph</code> <a href="chap6_mj.html#X8606D415858C40AA">6.7-1< <code class="func">IsPreorderDigraph</code> <a href="chap6_mj.html#X8617726C7829F796">6.4 <code class="func">IsQuasiorderDigraph</code> <a href="chap6_mj.html#X8617726C7829F796">6 <code class="func">IsReachable</code> <a href="chap5_mj.html#X7FBAB09E7C0BE5CF">5.4-20</a> <b <code class="func">IsReflexiveDigraph</code> <a href="chap6_mj.html#X8462D8E2792B23F6">6. <code class="func">IsRegularDigraph</code> <a href="chap6_mj.html#X7AF9DB1E7DB12306">6.5- <code class="func">IsStronglyConnectedDigraph</code> <a href="chap6_mj.html#X7B37B9467C6 <code class="func">IsSubdigraph</code> <a href="chap4_mj.html#X829B911D7EFD2D85">4.1-1</a> <b <code class="func">IsSymmetricDigraph</code> <a href="chap6_mj.html#X81B3EA7887219860">6. <code class="func">IsTournament</code> <a href="chap6_mj.html#X7DD8D1A185EBE865">6.2-15</a> < <code class="func">IsTransitiveDigraph</code> <a href="chap6_mj.html#X7F0835667F29F0C0">6 <code class="func">IsUndirectedForest</code> <a href="chap6_mj.html#X80FC20FA7AC4BC2A">6. <code class="func">IsUndirectedSpanningForest</code> <a href="chap4_mj.html#X833C3299787 <code class="func">IsUndirectedSpanningTree</code> <a href="chap4_mj.html#X833C3299787E2 <code class="func">IsUndirectedTree</code> <a href="chap6_mj.html#X80FC20FA7AC4BC2A">6.6- <code class="func">IsUpperSemimodularDigraph</code> <a href="chap6_mj.html#X7DEDCD177E5A <code class="func">IsVertexTransitive</code> <a href="chap6_mj.html#X7B26E4447A1611E9">6. <code class="func">IsWholeFileDecoder</code> <a href="chap9_mj.html#X7BC595AF841B78A9">9. <code class="func">IsWholeFileEncoder</code> <a href="chap9_mj.html#X7BC595AF841B78A9">9. <code class="func">IteratorFromDigraphFile</code> <a href="chap9_mj.html#X86D531B2877335 <code class="func">IteratorOfPaths</code> <a href="chap5_mj.html#X7C0416FE7A69CA2C">5.4-3 <code class="func">JohnsonDigraph</code> <a href="chap3_mj.html#X80ED9CE785819607">3.5-25< <code class="func">KellerGraph</code> <a href="chap3_mj.html#X79483C677AF65688">3.5-26</a> <b <code class="func">KingsGraph</code> <a href="chap3_mj.html#X80576A8C861512FD">3.5-27</a> <br <code class="func">KneserGraph</code> <a href="chap3_mj.html#X8655BA8584B3ACD0">3.5-28</a> <b <code class="func">KnightsGraph</code> <a href="chap3_mj.html#X84609DCA79FD9B56">3.5-29</a> < <code class="func">KuratowskiOuterPlanarSubdigraph</code> <a href="chap5_mj.html#X78E8F0 <code class="func">KuratowskiPlanarSubdigraph</code> <a href="chap5_mj.html#X7DC478637E8 <code class="func">LaplacianMatrix</code> <a href="chap5_mj.html#X865390B08331936B">5.2-1 <code class="func">LatticeDigraphEmbedding</code> <a href="chap7_mj.html#X7EEA340C81FCA5 <code class="func">LexicographicProduct</code> <a href="chap3_mj.html#X8151176882BA9901"> <code class="func">LindgrenSousselierGraph</code> <a href="chap3_mj.html#X7F61140C822880 <code class="func">LineDigraph</code> <a href="chap3_mj.html#X8595BF937B749F22">3.3-41</a> <b <code class="func">LineUndirectedDigraph</code> <a href="chap3_mj.html#X8364C6F17A1680CB <code class="func">ListNamedDigraphs</code> <a href="chap3_mj.html#X7BB820C9813F035F">3.1 <code class="func">LollipopGraph</code> <a href="chap3_mj.html#X832E82CF87BF5D43">3.5-31</ <code class="func">MaximalAntiSymmetricSubdigraph</code> <a href="chap3_mj.html#X79BA6A6 <code class="func">MaximalAntiSymmetricSubdigraphAttr</code> <a href="chap3_mj.html#X79B <code class="func">MaximalCommonSubdigraph</code> <a href="chap7_mj.html#X7D4378F27B49C9 <code class="func">MaximalSymmetricSubdigraph</code> <a href="chap3_mj.html#X829E3EAC7C4 <code class="func">MaximalSymmetricSubdigraphAttr</code> <a href="chap3_mj.html#X829E3EA <code class="func">MaximalSymmetricSubdigraphWithoutLoops</code> <a href="chap3_mj.html# <code class="func">MaximalSymmetricSubdigraphWithoutLoopsAttr</code> <a href="chap3_mj.h <code class="func">MinimalCommonSuperdigraph</code> <a href="chap7_mj.html#X7B99C75B8021 <code class="func">MinimalCyclicEdgeCut</code> <a href="chap5_mj.html#X803459AB86AB9BE2"> <code class="func">MobiusLadderGraph</code> <a href="chap3_mj.html#X853613228110588E">3.5 <code class="func">ModularProduct</code> <a href="chap3_mj.html#X807F95057F9DF576">3.3-37< <code class="func">MonomorphismsDigraphs</code> <a href="chap7_mj.html#X84B4BDB984C2A9A8 <code class="func">MonomorphismsDigraphsRepresentatives</code> <a href="chap7_mj.html#X8 <code class="func">MycielskiGraph</code> <a href="chap3_mj.html#X825943547FD7A687">3.5-33< <code class="func">NautyAutomorphismGroup</code> <a href="chap7_mj.html#X857758B18144C0C <code class="func">NautyCanonicalDigraph</code> <a href="chap7_mj.html#X877B1D377EC197D7 <code class="func">NautyCanonicalLabelling</code>, for a digraph <a href="chap7_mj.html#X7D for a digraph and a list <a href="chap7_mj.html#X87DA265D803DB337">7.2-8</a> <br /> <code class="func">NonLowerSemimodularPair</code> <a href="chap5_mj.html#X824B9896798530 <code class="func">NonUpperSemimodularPair</code> <a href="chap5_mj.html#X824B9896798530 <code class="func">NrSpanningTrees</code> <a href="chap5_mj.html#X82F30D5681466BC6">5.4-4 <code class="func">NullDigraph</code> <a href="chap3_mj.html#X80DAE31A79FEFD40">3.5-18</a> <b <code class="func">OddGraph</code> <a href="chap3_mj.html#X7904BB2982014ADA">3.5-34</a> <br /> <code class="func">OnDigraphs</code>, for a digraph and a perm <a href="chap7_mj.html#X8089720 for a digraph and a transformation <a href="chap7_mj.html#X808972017C486F1F">7.1-1</a> <br /> <code class="func">OnMultiDigraphs</code> <a href="chap7_mj.html#X7AFBA7608498F9CE">7.1-2< for a digraph, perm, and perm <a href="chap7_mj.html#X7AFBA7608498F9CE">7.1-2</a> <br /> <code class="func">OnSetsDigraphs</code>, for a set of digraphs and a perm <a href="chap7_mj.htm <code class="func">OnTuplesDigraphs</code>, for a list of digraphs and a perm <a href="chap7_mj. <code class="func">OutDegreeOfVertex</code> <a href="chap5_mj.html#X7A09EB648070276D">5.2 <code class="func">OutDegrees</code> <a href="chap5_mj.html#X7F5ACE807D1BC2E2">5.2-8</a> <br /> <code class="func">OutDegreeSequence</code> <a href="chap5_mj.html#X7F5ACE807D1BC2E2">5.2 <code class="func">OutDegreeSet</code> <a href="chap5_mj.html#X7F5ACE807D1BC2E2">5.2-8</a> <b <code class="func">OuterPlanarEmbedding</code> <a href="chap5_mj.html#X85DFB8C18088711F"> <code class="func">OutNeighbors</code> <a href="chap5_mj.html#X7E9880767AE68E00">5.2-6</a> <b <code class="func">OutNeighborsMutableCopy</code> <a href="chap5_mj.html#X7E9880767AE68E <code class="func">OutNeighborsOfVertex</code> <a href="chap5_mj.html#X83315B0186850806"> <code class="func">OutNeighbours</code> <a href="chap5_mj.html#X7E9880767AE68E00">5.2-6</a> < <code class="func">OutNeighboursMutableCopy</code> <a href="chap5_mj.html#X7E9880767AE68 <code class="func">OutNeighboursOfVertex</code> <a href="chap5_mj.html#X83315B0186850806 <code class="func">PancakeGraph</code> <a href="chap3_mj.html#X84C1D3D67E3979A5">3.5-9</a> <b <code class="func">PartialOrderDigraphJoinOfVertices</code> <a href="chap5_mj.html#X7DDB <code class="func">PartialOrderDigraphMeetOfVertices</code> <a href="chap5_mj.html#X7DDB <code class="func">PathGraph</code> <a href="chap3_mj.html#X815055168405B7F0">3.5-35</a> <br /> <code class="func">PermutationStarGraph</code> <a href="chap3_mj.html#X7A38DFC47AAE4A96"> <code class="func">PetersenGraph</code> <a href="chap3_mj.html#X823F43217A6C375D">3.5-37</ <code class="func">PlainTextString</code> <a href="chap9_mj.html#X8540FC21796A793F">9.2-1 <code class="func">PlanarEmbedding</code> <a href="chap5_mj.html#X84E3947E7D39BA64">5.7-3< <code class="func">PrintString</code> <a href="chap9_mj.html#X81FB5BE27903EC32">9.2-1</a> <br <code class="func">PrismGraph</code> <a href="chap3_mj.html#X85425DC5847E6D20">3.5-39</a> <br <code class="func">QueenGraph</code> <a href="chap3_mj.html#X785C3F1F7D690151">3.5-41</a> <br <code class="func">QueensGraph</code> <a href="chap3_mj.html#X785C3F1F7D690151">3.5-41</a> <b <code class="func">QuotientDigraph</code> <a href="chap3_mj.html#X7D1D26D27F5B56C2">3.3-9< <code class="func">RandomDigraph</code> <a href="chap3_mj.html#X86CF9F66788B2A24">3.4-1</a> < <code class="func">RandomLattice</code> <a href="chap3_mj.html#X7A023E4787682475">3.4-4</a> < <code class="func">RandomMultiDigraph</code> <a href="chap3_mj.html#X78FE275E7E77D56F">3. <code class="func">RandomTournament</code> <a href="chap3_mj.html#X7D36B5E57F055051">3.4- <code class="func">RandomUniqueEdgeWeightedDigraph</code> <a href="chap6_mj.html#X8194E7 <code class="func">ReadDigraphs</code> <a href="chap9_mj.html#X7E8142007ED0CB9F">9.2-7</a> <b <code class="func">ReadDIMACSDigraph</code> <a href="chap9_mj.html#X804FDF6A7ED64049">9.2 <code class="func">ReadPlainTextDigraph</code> <a href="chap9_mj.html#X81BD23697857B244"> <code class="func">ReducedDigraph</code> <a href="chap3_mj.html#X7CAF093B85A93D2F">3.3-4</ <code class="func">ReducedDigraphAttr</code> <a href="chap3_mj.html#X7CAF093B85A93D2F">3. <code class="func">RepresentativeOutNeighbours</code> <a href="chap7_mj.html#X7E1C806D81 <code class="func">RookGraph</code> <a href="chap3_mj.html#X7A6DD11881874F51">3.5-42</a> <br /> <code class="func">RooksGraph</code> <a href="chap3_mj.html#X7A6DD11881874F51">3.5-42</a> <br <code class="func">SemigroupOfCayleyDigraph</code> <a href="chap5_mj.html#X7A000B1D7CCF7 <code class="func">SetDigraphEdgeLabel</code> <a href="chap5_mj.html#X79FAEACC7F438C2F">5 <code class="func">SetDigraphEdgeLabels</code>, for a digraph and a function <a href="chap5_mj for a digraph and a list of lists <a href="chap5_mj.html#X7C24851087D4A8FB">5.1-14</a> <br /> <code class="func">SetDigraphVertexLabel</code> <a href="chap5_mj.html#X7CA91E4B7904F793 <code class="func">SetDigraphVertexLabels</code> <a href="chap5_mj.html#X7E51F2FE87140B3 <code class="func">Sparse6String</code> <a href="chap9_mj.html#X782A052979EA2376">9.2-3</a> < <code class="func">Splash</code> <a href="chap9_mj.html#X83B3318784E78415">9.1-1</a> <br /> <code class="func">SquareGridGraph</code> <a href="chap3_mj.html#X8404987F849D7CF2">3.5-4 <code class="func">StackedBookGraph</code> <a href="chap3_mj.html#X7B5E9D857D47F5C2">3.5- <code class="func">StackedPrismGraph</code> <a href="chap3_mj.html#X817982877B48D5BD">3.5 <code class="func">StarGraph</code> <a href="chap3_mj.html#X78F78C077CBAE1EC">3.5-45</a> <br /> <code class="func">String</code> <a href="chap9_mj.html#X81FB5BE27903EC32">9.2-1</a> <br /> <code class="func">StrongOrientation</code> <a href="chap5_mj.html#X865590147BD1C507">5.4 <code class="func">StrongOrientationAttr</code> <a href="chap5_mj.html#X865590147BD1C507 <code class="func">StrongProduct</code> <a href="chap3_mj.html#X82E200F07FEFAF27">3.3-38</ <code class="func">SubdigraphHomeomorphicToK23</code> <a href="chap5_mj.html#X806D2D6B85 <code class="func">SubdigraphHomeomorphicToK33</code> <a href="chap5_mj.html#X806D2D6B85 <code class="func">SubdigraphHomeomorphicToK4</code> <a href="chap5_mj.html#X806D2D6B85E <code class="func">SubdigraphsMonomorphisms</code> <a href="chap7_mj.html#X87E60FB17BC44 <code class="func">SubdigraphsMonomorphismsRepresentatives</code> <a href="chap7_mj.html subgraph isomorphism <a href="chap7_mj.html#X7AD04CC186E86CCA">7.3-8</a> <a href="chap7_mj <code class="func">TadpoleGraph</code> <a href="chap3_mj.html#X81D59C4D809F4AD3">3.5-46</a> < <code class="func">TCodeDecoder</code> <a href="chap9_mj.html#X875393338486D77D">9.2-13</a> < <code class="func">TournamentLineDecoder</code> <a href="chap9_mj.html#X7808D99079295C22 <code class="func">TriangularGridGraph</code> <a href="chap3_mj.html#X8234361278E8816F">3 <code class="func">UndirectedSpanningForest</code> <a href="chap3_mj.html#X7DD9766C86D3E <code class="func">UndirectedSpanningForestAttr</code> <a href="chap3_mj.html#X7DD9766C8 <code class="func">UndirectedSpanningTree</code> <a href="chap3_mj.html#X7DD9766C86D3ED2 <code class="func">UndirectedSpanningTreeAttr</code> <a href="chap3_mj.html#X7DD9766C86D <code class="func">VerticesReachableFrom</code>, for a digraph and a list of vertices <a href="c for a digraph and vertex <a href="chap5_mj.html#X7F255A2A84CB868C">5.4-22</a> <br /> <code class="func">WalshHadamardGraph</code> <a href="chap3_mj.html#X7BFA33067F83F8B0">3. <code class="func">WebGraph</code> <a href="chap3_mj.html#X84F3B70A82EEE780">3.5-48</a> <br /> <code class="func">WheelGraph</code> <a href="chap3_mj.html#X817EA60D828A765E">3.5-49</a> <br <code class="func">WholeFileDecoders</code> <a href="chap9_mj.html#X7BC595AF841B78A9">9.2 <code class="func">WholeFileEncoders</code> <a href="chap9_mj.html#X7BC595AF841B78A9">9.2 <code class="func">WindmillGraph</code> <a href="chap3_mj.html#X7BE44CA27AA5F8DB">3.5-50</ <code class="func">WriteDigraphs</code> <a href="chap9_mj.html#X82A4F0767C9EFC87">9.2-8</a> < <code class="func">WriteDIMACSDigraph</code> <a href="chap9_mj.html#X804FDF6A7ED64049">9. <code class="func">WritePlainTextDigraph</code> <a href="chap9_mj.html#X81BD23697857B244 <p> </p> </div> <div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.ht <div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top< <hr /> <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GA </body> </html> ¤ 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.0.27Bemerkung: (vorverarbeitet) ¤*Bot Zugriff |
|
2026-03-28