&Digraphs\ ;

\n[BM06] Boyer, J. M.\ and Myrvold, W. J.,\n On the Cutting Edge: Simplified\ O(n) Planarity by Edge\n Addition,\n in Gr\ aph Algorithms and Applications 5,\n {WORLD} {S\ CIENTIFIC}\n (2006),\n 241--273.\n

\n[CK86] Calder\ bank, R. and Kantor, W. M.,\n The geometry of two-weig\ ht codes,\n Bull. London Math. Soc.,\n 18 (2)\n (1986),\n 97--122.\n

\n[Gab00] Gabow, H. N.,\n Path-based depth-first search for strong and biconnected\n \ components,\n Information Processing Letters,\n 74 (34)\n (\ 2000),\n 107 - 114.\ \n

\n[JK07] Junttila, T. and\ Kaski, P. (Applegate, D., Brodal, G. S., Panario,\ D. and Sedgewick, R., Eds.),\n Engineering an effi\ cient canonical labeling tool for large and\n sparse graphs,\n \ in Proceedings of the Ninth Workshop on Algorithm Eng\ ineering and\n Experiments and the Fourth Workshop on Analytic Algorithms and\ \n Combinatorics,\n SIAM\n\ (2007),\n 135--149\ .\n

\n[MP14] McKay, B. D. an\ d Piperno, A.,\n Practical graph isomorphism, II,\ \n Journal of Symbolic Computation,\n 60 (0)\n (2014),\n 94 - 112.\n

\n[vLS81\ ] van Lint, J. H. and Schrijver, A.,\n <\ i class='BibTitle'>Construction of strongly regular graphs, two-weight codes a\ nd\n partial geometries by finite fields,\n Combinatorica,\n 1 (1)\n (1981),\n 63--73.\n

1 \n The Digraphs\ package\n \n

1.1 \ Introduction\n\n

\n
1.1-1 Def\ initions\n\n

2 Installing Digraphs\n
2.1 For those in a hurry\n\n
\n
2.2 Optional package\ dependencies\n\n
\n
  2.2-1 The Grape package\n\n
\n
2.\ 3 Compiling the kernel module\n\n\n
&nb\ sp;2.4 Rebuilding the documentation\n\n
\n
  2.4-1 DigraphsMakeDoc\n
\n
2.5 Testing your installation\n\n
\n
  \ 2.5-1 DigraphsTestInstall\n
  2.5-2 DigraphsTestStandard\ \n
  2.5-3 DigraphsTestExtreme\n
\n
\n", 3 := "
3 Creating digraphs\n
3.1 Creating digraphs\n\n
\n
<\ span class=\"nocss\">  3.1-1 IsDigraph\n
  3.1-2 Is\ MutableDigraph\n
\   3.1-3 IsImmutab\ leDigraph\n
\ ; 3.1-4 IsCayleyDigrap\ h\n
  <\ /span>3.1-5 IsDigraphWithAdjacency\ Function\n
\ 3.1-6 DigraphByOutNei\ ghboursType\n
&nb\ sp; 3.1-7 Digraph<\ /span>\n
  \ 3.1-8 DigraphByAdjacencyMatrix\ \n
  3.1-9 DigraphByEdges\n\
  3.1-10 EdgeOrbitsDigraph\n
  3.1-11 DigraphByInNeighbours\n
  3.1-12 CayleyDigraph\n
\n<\ div class=\"ContSect\"> 3.2 Ch\ anging representations\n\n
\n
  3.2-1 AsBinaryRelation\n
  3.2-2 AsDigraph\n  3.2-3 Graph\n
  3.2-4 As\ Graph\n
&nb\ sp;3.2-5 AsTransformation\n
\n
3.3 \ New digraphs from old\n\n
\n
&nb\ sp;3.3-1 DigraphImmutableCo\ py\n
  \ 3.3-2 DigraphImmutableCopyI\ fImmutable\n
&nbs\ p; 3.3-3 InducedSubdig\ raph\n
&nbs\ p;3.3-4 ReducedDigraph<\ /span>\n
  \ 3.3-5 MaximalSymmetricSubdigraph\n
  3.3-6 MaximalAntiSymmetricSubdi\ graph\n
&nb\ sp;3.3-7 UndirectedSpanning\ Forest\n
&n\ bsp;3.3-8 QuotientDigraph\n
  3.3-9 DigraphReverse\ \n
  3.3-10 DigraphDual\n
  3.3-11 DigraphSymmetricClosure\n
  3.3-12 DigraphTransitiveClosure\n
  3.3-13 DigraphTransitiveReduction\n
  3.3-14 DigraphAddVertex\n
  3.3-15 DigraphAddVertices\n
  3.3-16 DigraphAddEdge\n
  3.3-17 DigraphAddEdgeOrbit\n\
  3.3-18 DigraphAddEdges\n
<\ span class=\"nocss\">  3.3-19 DigraphRemoveVertex\n
  3.3-20 DigraphRemoveVertices\n
  3.3-21 DigraphRemoveEdge\n
  3.\ 3-22 DigraphRemoveEdgeOrbit\n
  3.\ 3-23 DigraphRemoveEdges\n
  3.3-2\ 4 DigraphRemoveLoops\n
  3.3-25 Di\ graphRemoveAllMultipleEdges\n
  3.\ 3-26 DigraphReverseEdges\n
  3.3-2\ 7 DigraphDisjointUnion\n
  3.3-28 \ DigraphEdgeUnion\n
  3.3-29 Digra\ phJoin\n
&n\ bsp;3.3-30 DigraphCartesian\ Product\n
&\ nbsp;3.3-31 DigraphDirectPr\ oduct\n
&nb\ sp;3.3-32 DigraphCartesianP\ roductProjections\n
  3.3-33 Digra\ phDirectProductProjections\n
  3.3\ -34 LineDigraph\n
  3.3-35 LineUnd\ irectedDigraph\n
\   3.3-36 DoubleDi\ graph\n
&nb\ sp;3.3-37 BipartiteDoubleDi\ graph\n
&nb\ sp;3.3-38 DigraphAddAllLoop\ s\n
  <\ /span>3.3-39 DistanceDigraph\n
  <\ a href=\"chap3_mj.html#X86F9CCEA839ABC48\">3.3-40 DigraphClosure\n<\ span class=\"ContSS\">
  3.3-41 DigraphMycielskian\n
\n
3.4 Random digraphs\n\n
\n
  3.4-1 RandomDigraph\n
  3.4-2 RandomMultiDigraph\n
  3.4-3 RandomTournament\n<\ br />  3.4-4 RandomLattice\n
\n
3.5 Standard examples\n\n
\n
  3.5-1 ChainDigraph\n
  3.5-2\ CompleteDigraph\n
  3.5-3 Comple\ teBipartiteDigraph\n
  3.5-4 Compl\ eteMultipartiteDigraph\n
  3.5-5 C\ ycleDigraph\n
&nb\ sp; 3.5-6 EmptyDigraph\ \n
  3.5-7 JohnsonDigraph\n
  3.5-8 PetersenGraph\n
  3.5-9 GeneralisedPetersenGraph\n
\n
\n", 4 := "
4 Operators\n
4.1 Operators for digraphs\n\n
\n
  4.1-1 IsSubdigraph\n
  4.1-2 Is\ UndirectedSpanningTree\n
\n
\n", 5 := "
5 Attributes and operations\n
5.1 Vertices and\ edges\n\n
\n
  5.1-1 DigraphVertices\n
  5.1-2 DigraphNrVertices\n
  5.1-3 DigraphEdges\n
  5.1-4 Di\ graphNrEdges\n
&n\ bsp; 5.1-5 DigraphSink\ s\n
  <\ /span>5.1-6 DigraphSources\n
  5.1-7 DigraphTopologicalSort\n
  5.1-8 DigraphVertexLabel\n<\ span class=\"ContSS\">
  5.1-9 DigraphVertexLabels\n
  5.1-10 DigraphEdgeLabel\n
  5.1-11 DigraphEdgeLabels\n
  5.1-12 DigraphInEdges\n\
  5.1-13 DigraphOutEdges\n
<\ span class=\"nocss\">  5.1-14 IsDigraphEdge\n
  5.1\ -15 IsMatching\n
\   5.1-16 DigraphM\ aximalMatching\n
\   5.1-17 DigraphM\ aximumMatching\n
\n
5.2 Neighbours and degree\n\n
\n
  5.2-1 A\ djacencyMatrix\n
\   5.2-2 Character\ isticPolynomial\n
  5.2-3 BooleanA\ djacencyMatrix\n
\   5.2-4 DigraphAd\ jacencyFunction\n
  5.2-5 DigraphR\ ange\n
&nbs\ p;5.2-6 OutNeighbours\n
  <\ a href=\"chap5_mj.html#X85C7AA5A81DA6E11\">5.2-7 InNeighbours\n
  5.2-8 OutDegrees\n
  5.2-9 InDegrees\n
  5.2-10 OutDegreeOfVertex\n
  \ 5.2-11 OutNeighboursOfVertex\n
  5\ .2-12 InDegreeOfVertex\n
  5.2-13 \ InNeighboursOfVertex\n
  5.2-14 Di\ graphLoops\n
&nbs\ p; 5.2-15 PartialOrder\ DigraphMeetOfVertices\n
  5.2-16 D\ egreeMatrix\n
&nb\ sp; 5.2-17 LaplacianMa\ trix\n
\n
5.3 Reachability and connectivity\n\n
\n
  5.3-1 Dig\ raphDiameter\n
&n\ bsp; 5.3-2 DigraphShor\ testDistance\n
&n\ bsp; 5.3-3 DigraphShor\ testDistances\n
&\ nbsp; 5.3-4 DigraphLon\ gestDistanceFromVertex\n
  5.3-5 D\ igraphDistanceSet\n
  5.3-6 Digrap\ hGirth\n
&n\ bsp;5.3-7 DigraphOddGirth\n
  5.3-8 DigraphUndirectedGirth\n
  5.3-9 DigraphConnectedComponents\ \n
  5.3-10 DigraphConnectedCompon\ ent\n
  \ ;5.3-11 DigraphStronglyConn\ ectedComponents\n
  5.3-12 Digraph\ StronglyConnectedComponent\n
  5.3\ -13 DigraphBicomponents\n
  5.3-1\ 4 ArticulationPoints\n
  5.3-15 Di\ graphPeriod\n
&nb\ sp; 5.3-16 DigraphFloy\ dWarshall\n
\ ; 5.3-17 IsReachable\n
  5.3-18 DigraphPath\n\
  5.3-19 DigraphShortestPath\n
  5.3-20 IteratorOfPaths\n
  5.3-21 DigraphAllSimpleCircuits\n
  5.3-22 DigraphLongestSimpleCircuit\n
  5.3-23 DigraphLayers\n
  5.3-24 DigraphDegeneracy\n
  5.3-25 DigraphDegeneracyOrdering\n
  5.3-26 HamiltonianPath\n
  5.3-27 NrSpanningTrees\n
  5.3-28 DigraphDijkstra\n
\n
5.4 Cayley graphs of grou\ ps\n\n
\n  5.4-1 GroupOfCayleyDigraph\n
  5.4-2 GeneratorsOfCayleyDigraph\n
\n
5.5 Associated s\ emigroups\n\n
\n
  5.5-1 AsSemigroup\n
<\ span class=\"nocss\">  5.5-2 AsSemigroup\n
\n
5.6 Planarity\n\ \n
\n
  5.6-1 Kurat\ owskiPlanarSubdigraph\n
  5.6-2 Ku\ ratowskiOuterPlanarSubdigraph\n
  \ 5.6-3 PlanarEmbedding\n
  5.6-4 Ou\ terPlanarEmbedding\n
  5.6-5 Subdi\ graphHomeomorphicToK23\n
\n
\n", 6 := "
6 Properties of digraphs\n
6.1 Edge propertie\ s\n\n
\n  6.1-1 DigraphHasLoops\n
  6.1-2 IsAntiSymmetricDigraph\n
  6.1-3 IsBipartiteDigraph\n
  6.\ 1-4 IsCompleteBipartiteDigraph\n
  6.1-5 IsCompleteDigraph\n
  6.1-6\ IsCompleteMultipartiteDigraph\n
  6.1-7 IsEmptyDigraph\n
  6.1-8 Is\ EquivalenceDigraph\n
  6.1-9 IsFun\ ctionalDigraph\n
\   6.1-10 IsMultiD\ igraph\n
&n\ bsp;6.1-11 IsReflexiveDigra\ ph\n
  \ 6.1-12 IsSymmetricDigraph\n
  6.1-13 IsTournament\ \n
  6.1-14 IsTransitiveDigraph\n<\ span class=\"ContSS\">
  6.1-15 IsPreorderDigraph\n
  6.1-16 IsPartialOrderDigraph\n
  6.1-17 IsMeetSemilatticeDigraph\n
\n
6.2 Regularity\n\n
\n
  6.2-1 IsInRegularDigraph\n
  6.2-2 IsOutRegularDigraph\n
  6.2-3 IsRegularDigraph\n\
  6.2-4 IsDistanceRegularDigraph\n
\n
6.3 Connectiv\ ity and cycles\n\n
\n
  6.3-1 IsAcyclicDigraph\n
  6.3-2 IsChainDigraph\n
  6.3-3 IsConnectedDigraph\n
  6.3-4 IsBiconnectedDigraph\n
  \ 6.3-5 IsStronglyConnectedDigraph\n
  6.3-6 IsAperiodicDigraph\n
  6.\ 3-7 IsDirectedTree\n
  6.3-8 IsUnd\ irectedTree\n
&nb\ sp; 6.3-9 IsEulerianDi\ graph\n
&nb\ sp;6.3-10 IsHamiltonianDigr\ aph\n
  \ ;6.3-11 IsCycleDigraph<\ /span>\n
\n
6.4 Planarity\n\n
\n
  6.4-1 IsPlanarDigraph\n
  6.4-2 IsOuterPlanarDigraph\n
\n
&n\ bsp;6.5 Homomorphisms and transformations\n\n
\n
  6.5-1 IsDigraphCore\ \n
  6.5-2 IsEdgeTransitive\n
  6.5-3 IsVertexTransitive\n
\n
\n", 7 := "
7 Homomorphisms\n
7.1 Acting on digraphs\n\n
\n
  7.1-1 OnDigraphs\n
  7.1-2 OnMu\ ltiDigraphs\n
\n
7.2 Isomorphisms and canonical labellings\n\n
\n
  7.2-1 DigraphsUseNauty\n
  7.\ 2-2 AutomorphismGroup\n
  7.2-3 Bl\ issAutomorphismGroup\n
  7.2-4 Nau\ tyAutomorphismGroup\n
  7.2-5 Auto\ morphismGroup\n
&\ nbsp; 7.2-6 Automorphi\ smGroup\n
&\ nbsp;7.2-7 BlissCanonicalLa\ belling\n
&\ nbsp;7.2-8 BlissCanonicalLa\ belling\n
&\ nbsp;7.2-9 BlissCanonicalDi\ graph\n
&nb\ sp;7.2-10 DigraphGroup<\ /span>\n
  \ 7.2-11 DigraphOrbits\n<\ span class=\"ContSS\">
  7.2-12 DigraphOrbitReps\n
  7.2-13 DigraphSchreierVector\n
  7.2-14 DigraphStabilizer\n
  7.2-15 IsIsomorphicDigraph\n
  7.2-16 IsIsomorphicDigraph\n
  7.2-17 IsomorphismDigraphs\n
  7.2-18 IsomorphismDigraphs\n\
  7.2-19 RepresentativeOutNeighbours\n
  7.2-20 IsDigraphIsomorphism\n
  7.2-21 IsDigraphColouring\n
\n
7.3 Homomorphis\ ms of digraphs\n\n
\n
  7.3-1 HomomorphismDigraphsFinder\n
  7.3-2 DigraphHomomorphism\n
  7.3-3 HomomorphismsDigraphs\n
  7.3-4 DigraphMonomorphism\n
  7.3-5 MonomorphismsDigraphs\n
  7.3-6 DigraphEpimorphism\n  7.3-7 EpimorphismsDigraphs\n
  7.3-8 DigraphEmbedding\n
  7.3-9 EmbeddingsDigraphs\n
  7.3-\ 10 IsDigraphHomomorphism\n
  7.3-1\ 1 IsDigraphEmbedding\n
  7.3-12 Di\ graphsRespectsColouring\n
  7.3-1\ 3 GeneratorsOfEndomorphismMonoid\n
  7.3-14 DigraphColouring\n
  7.3\ -15 DigraphGreedyColouring\n
  7.3\ -16 DigraphWelshPowellOrder\n
  7.\ 3-17 ChromaticNumber\n
  7.3-18 Di\ graphCore\n
\n
\n", 8 := "
8 Finding cliques and independent sets\n\
8.1 F\ inding cliques\n\n
\n
  8.1-1 IsClique\n
  8.1-2 CliquesFinder\n
  8\ .1-3 DigraphClique\n
  8.1-4 Digra\ phMaximalCliques\n
  8.1-5 Clique\ Number\n
\n
8.2 Finding independent sets\n\n\
\n
  8.2-1 IsInde\ pendentSet\n
&nbs\ p; 8.2-2 DigraphIndepe\ ndentSet\n
\ 8.2-3 DigraphMaximalI\ ndependentSets\n
\n
\n", 9 := "
9 Visualising and IO\n
9.1 Visualising a digra\ ph\n\n
\n  9.1-1 Splash\n
  9.1-2\ DotDigraph\n
&nb\ sp; 9.1-3 DotSymmetric\ Digraph\n
&\ nbsp;9.1-4 DotPartialOrderD\ igraph\n
&n\ bsp;9.1-5 DotPreorderDigrap\ h\n
  <\ /span>9.1-6 DotHighlightedDigraph<\ /a>\n
\n
9.2\ Reading and writing digraphs to a file\n\n
\n
  9.2-1\ String\n
&\ nbsp;9.2-2 DigraphFromGraph\ 6String\n
&\ nbsp;9.2-3 Graph6String\ \n
  9.2-4 DigraphFile\n
  9.2-5 ReadDigraphs\n
  9.2-6 WriteDigraphs\n<\ br />  9.2-7 IteratorFromDigraphFile\n<\ br />  9.2-8 DigraphPlainTextLineEncoder\n
  9.2-9 TournamentLineDecoder\n
  9.2-10 AdjacencyMatrixUpperTriangleLineDecoder\n
  9.2-11 TCodeDecoder\n
  9.2-12 PlainTextString\n
  9.2-13 WritePlainTextDigraph\n\
  9.2-14 WriteDIMACSDigraph\n
\n
\n", A := "
A \n Grape to Digraphs Command Map\n \n
\ ;A.1 \n Functions to construct and modify graphs\n \n\ \n
\n
A.2 \n Functions to inspect graphs, vertices and edges\n \ \n\n
\n
A.3 \n Functions to determine regularity properties of \ graphs\n \n\n
\n
A.4 \n Some special vertex subsets o\ f a graph\n \n\n
\n
A.5 \n Functions to construct new\ graphs from old\n \n\n
\n
A.6 \n Vertex-Colouring an\ d Complete Subgraphs\n \n\n
\n
A.7 \n Automorphism g\ roups and isomorphism testing for graphs\n \n\n
\n\n" ), chapsectlinkstext := rec( 1 := "
1 \n The Digraphs\ package\n \n
1.1 \ Introduction\n\n
\n
  1.1-1 Def\ initions\n\n
\n
\n", 2 := "
2 Installing Digraphs\n
2.1 For those in a hurry\n\n
\n
2.2 Optional package\ dependencies\n\n
\n
  2.2-1 The Grape package\n\n
\n
2.\ 3 Compiling the kernel module\n\n\n
&nb\ sp;2.4 Rebuilding the documentation\n\n
\n
  2.4-1 DigraphsMakeDoc\n
\n
2.5 Testing your installation\n\n
\n
  \ 2.5-1 DigraphsTestInstall\n
  2.5-2 DigraphsTestStandard\ \n
  2.5-3 DigraphsTestExtreme\n
\n
\n", 3 := "
3 Creating digraphs\n
3.1 Creating digraphs\n\n
\n
<\ span class=\"nocss\">  3.1-1 IsDigraph\n
  3.1-2 Is\ MutableDigraph\n
\   3.1-3 IsImmutab\ leDigraph\n
\ ; 3.1-4 IsCayleyDigrap\ h\n
  <\ /span>3.1-5 IsDigraphWithAdjacency\ Function\n
\ 3.1-6 DigraphByOutNei\ ghboursType\n
&nb\ sp; 3.1-7 Digraph<\ /span>\n
  \ 3.1-8 DigraphByAdjacencyMatrix\ \n
  3.1-9 DigraphByEdges\n\
  3.1-10 EdgeOrbitsDigraph\n
  3.1-11 DigraphByInNeighbours\n
  3.1-12 CayleyDigraph\n
\n<\ div class=\"ContSect\"> 3.2 Ch\ anging representations\n\n
\n
  3.2-1 AsBinaryRelation\n
  3.2-2 AsDigraph\n  3.2-3 Graph\n
  3.2-4 As\ Graph\n
&nb\ sp;3.2-5 AsTransformation\n
\n
3.3 \ New digraphs from old\n\n
\n
&nb\ sp;3.3-1 DigraphImmutableCo\ py\n
  \ 3.3-2 DigraphImmutableCopyI\ fImmutable\n
&nbs\ p; 3.3-3 InducedSubdig\ raph\n
&nbs\ p;3.3-4 ReducedDigraph<\ /span>\n
  \ 3.3-5 MaximalSymmetricSubdigraph\n
  3.3-6 MaximalAntiSymmetricSubdi\ graph\n
&nb\ sp;3.3-7 UndirectedSpanning\ Forest\n
&n\ bsp;3.3-8 QuotientDigraph\n
  3.3-9 DigraphReverse\ \n
  3.3-10 DigraphDual\n
  3.3-11 DigraphSymmetricClosure\n
  3.3-12 DigraphTransitiveClosure\n
  3.3-13 DigraphTransitiveReduction\n
  3.3-14 DigraphAddVertex\n
  3.3-15 DigraphAddVertices\n
  3.3-16 DigraphAddEdge\n
  3.3-17 DigraphAddEdgeOrbit\n\
  3.3-18 DigraphAddEdges\n
<\ span class=\"nocss\">  3.3-19 DigraphRemoveVertex\n
  3.3-20 DigraphRemoveVertices\n
  3.3-21 DigraphRemoveEdge\n
  3.\ 3-22 DigraphRemoveEdgeOrbit\n
  3.\ 3-23 DigraphRemoveEdges\n
  3.3-2\ 4 DigraphRemoveLoops\n
  3.3-25 Di\ graphRemoveAllMultipleEdges\n
  3.\ 3-26 DigraphReverseEdges\n
  3.3-2\ 7 DigraphDisjointUnion\n
  3.3-28 \ DigraphEdgeUnion\n
  3.3-29 Digra\ phJoin\n
&n\ bsp;3.3-30 DigraphCartesian\ Product\n
&\ nbsp;3.3-31 DigraphDirectPr\ oduct\n
&nb\ sp;3.3-32 DigraphCartesianP\ roductProjections\n
  3.3-33 Digra\ phDirectProductProjections\n
  3.3\ -34 LineDigraph\n
  3.3-35 LineUnd\ irectedDigraph\n
\   3.3-36 DoubleDi\ graph\n
&nb\ sp;3.3-37 BipartiteDoubleDi\ graph\n
&nb\ sp;3.3-38 DigraphAddAllLoop\ s\n
  <\ /span>3.3-39 DistanceDigraph\n
  <\ a href=\"chap3_mj.html#X86F9CCEA839ABC48\">3.3-40 DigraphClosure\n<\ span class=\"ContSS\">
  3.3-41 DigraphMycielskian\n
\n
3.4 Random digraphs\n\n
\n
  3.4-1 RandomDigraph\n
  3.4-2 RandomMultiDigraph\n
  3.4-3 RandomTournament\n<\ br />  3.4-4 RandomLattice\n
\n
3.5 Standard examples\n\n
\n
  3.5-1 ChainDigraph\n
  3.5-2\ CompleteDigraph\n
  3.5-3 Comple\ teBipartiteDigraph\n
  3.5-4 Compl\ eteMultipartiteDigraph\n
  3.5-5 C\ ycleDigraph\n
&nb\ sp; 3.5-6 EmptyDigraph\ \n
  3.5-7 JohnsonDigraph\n
  3.5-8 PetersenGraph\n
  3.5-9 GeneralisedPetersenGraph\n
\n
\n", 4 := "
4 Operators\n
4.1 Operators for digraphs\n\n
\n
  4.1-1 IsSubdigraph\n
  4.1-2 Is\ UndirectedSpanningTree\n
\n
\n", 5 := "
5 Attributes and operations\n
5.1 Vertices and\ edges\n\n
\n
  5.1-1 DigraphVertices\n
  5.1-2 DigraphNrVertices\n
  5.1-3 DigraphEdges\n
  5.1-4 Di\ graphNrEdges\n
&n\ bsp; 5.1-5 DigraphSink\ s\n
  <\ /span>5.1-6 DigraphSources\n
  5.1-7 DigraphTopologicalSort\n
  5.1-8 DigraphVertexLabel\n<\ span class=\"ContSS\">
  5.1-9 DigraphVertexLabels\n
  5.1-10 DigraphEdgeLabel\n
  5.1-11 DigraphEdgeLabels\n
  5.1-12 DigraphInEdges\n\
  5.1-13 DigraphOutEdges\n
<\ span class=\"nocss\">  5.1-14 IsDigraphEdge\n
  5.1\ -15 IsMatching\n
\   5.1-16 DigraphM\ aximalMatching\n
\   5.1-17 DigraphM\ aximumMatching\n
\n
5.2 Neighbours and degree\n\n
\n
  5.2-1 A\ djacencyMatrix\n
\   5.2-2 Character\ isticPolynomial\n
  5.2-3 BooleanA\ djacencyMatrix\n
\   5.2-4 DigraphAd\ jacencyFunction\n
  5.2-5 DigraphR\ ange\n
&nbs\ p;5.2-6 OutNeighbours\n
  <\ a href=\"chap5_mj.html#X85C7AA5A81DA6E11\">5.2-7 InNeighbours\n
  5.2-8 OutDegrees\n
  5.2-9 InDegrees\n
  5.2-10 OutDegreeOfVertex\n
  \ 5.2-11 OutNeighboursOfVertex\n
  5\ .2-12 InDegreeOfVertex\n
  5.2-13 \ InNeighboursOfVertex\n
  5.2-14 Di\ graphLoops\n
&nbs\ p; 5.2-15 PartialOrder\ DigraphMeetOfVertices\n
  5.2-16 D\ egreeMatrix\n
&nb\ sp; 5.2-17 LaplacianMa\ trix\n
\n
5.3 Reachability and connectivity\n\n
\n
  5.3-1 Dig\ raphDiameter\n
&n\ bsp; 5.3-2 DigraphShor\ testDistance\n
&n\ bsp; 5.3-3 DigraphShor\ testDistances\n
&\ nbsp; 5.3-4 DigraphLon\ gestDistanceFromVertex\n
  5.3-5 D\ igraphDistanceSet\n
  5.3-6 Digrap\ hGirth\n
&n\ bsp;5.3-7 DigraphOddGirth\n
  5.3-8 DigraphUndirectedGirth\n
  5.3-9 DigraphConnectedComponents\ \n
  5.3-10 DigraphConnectedCompon\ ent\n
  \ ;5.3-11 DigraphStronglyConn\ ectedComponents\n
  5.3-12 Digraph\ StronglyConnectedComponent\n
  5.3\ -13 DigraphBicomponents\n
  5.3-1\ 4 ArticulationPoints\n
  5.3-15 Di\ graphPeriod\n
&nb\ sp; 5.3-16 DigraphFloy\ dWarshall\n
\ ; 5.3-17 IsReachable\n
  5.3-18 DigraphPath\n\
  5.3-19 DigraphShortestPath\n
  5.3-20 IteratorOfPaths\n
  5.3-21 DigraphAllSimpleCircuits\n
  5.3-22 DigraphLongestSimpleCircuit\n
  5.3-23 DigraphLayers\n
  5.3-24 DigraphDegeneracy\n
  5.3-25 DigraphDegeneracyOrdering\n
  5.3-26 HamiltonianPath\n
  5.3-27 NrSpanningTrees\n
  5.3-28 DigraphDijkstra\n
\n
5.4 Cayley graphs of grou\ ps\n\n
\n  5.4-1 GroupOfCayleyDigraph\n
  5.4-2 GeneratorsOfCayleyDigraph\n
\n
5.5 Associated s\ emigroups\n\n
\n
  5.5-1 AsSemigroup\n
<\ span class=\"nocss\">  5.5-2 AsSemigroup\n
\n
5.6 Planarity\n\ \n
\n
  5.6-1 Kurat\ owskiPlanarSubdigraph\n
  5.6-2 Ku\ ratowskiOuterPlanarSubdigraph\n
  \ 5.6-3 PlanarEmbedding\n
  5.6-4 Ou\ terPlanarEmbedding\n
  5.6-5 Subdi\ graphHomeomorphicToK23\n
\n
\n", 6 := "
6 Properties of digraphs\n
6.1 Edge propertie\ s\n\n
\n  6.1-1 DigraphHasLoops\n
  6.1-2 IsAntiSymmetricDigraph\n
  6.1-3 IsBipartiteDigraph\n
  6.\ 1-4 IsCompleteBipartiteDigraph\n
  6.1-5 IsCompleteDigraph\n
  6.1-6\ IsCompleteMultipartiteDigraph\n
  6.1-7 IsEmptyDigraph\n
  6.1-8 Is\ EquivalenceDigraph\n
  6.1-9 IsFun\ ctionalDigraph\n
\   6.1-10 IsMultiD\ igraph\n
&n\ bsp;6.1-11 IsReflexiveDigra\ ph\n
  \ 6.1-12 IsSymmetricDigraph\n
  6.1-13 IsTournament\ \n
  6.1-14 IsTransitiveDigraph\n<\ span class=\"ContSS\">
  6.1-15 IsPreorderDigraph\n
  6.1-16 IsPartialOrderDigraph\n
  6.1-17 IsMeetSemilatticeDigraph\n
\n
6.2 Regularity\n\n
\n
  6.2-1 IsInRegularDigraph\n
  6.2-2 IsOutRegularDigraph\n
  6.2-3 IsRegularDigraph\n\
  6.2-4 IsDistanceRegularDigraph\n
\n
6.3 Connectiv\ ity and cycles\n\n
\n
  6.3-1 IsAcyclicDigraph\n
  6.3-2 IsChainDigraph\n
  6.3-3 IsConnectedDigraph\n
  6.3-4 IsBiconnectedDigraph\n
  \ 6.3-5 IsStronglyConnectedDigraph\n
  6.3-6 IsAperiodicDigraph\n
  6.\ 3-7 IsDirectedTree\n
  6.3-8 IsUnd\ irectedTree\n
&nb\ sp; 6.3-9 IsEulerianDi\ graph\n
&nb\ sp;6.3-10 IsHamiltonianDigr\ aph\n
  \ ;6.3-11 IsCycleDigraph<\ /span>\n
\n
6.4 Planarity\n\n
\n
  6.4-1 IsPlanarDigraph\n
  6.4-2 IsOuterPlanarDigraph\n
\n
&n\ bsp;6.5 Homomorphisms and transformations\n\n
\n
  6.5-1 IsDigraphCore\ \n
  6.5-2 IsEdgeTransitive\n
  6.5-3 IsVertexTransitive\n
\n
\n", 7 := "
7 Homomorphisms\n
7.1 Acting on digraphs\n\n
\n
  7.1-1 OnDigraphs\n
  7.1-2 OnMu\ ltiDigraphs\n
\n
7.2 Isomorphisms and canonical labellings\n\n
\n
  7.2-1 DigraphsUseNauty\n
  7.\ 2-2 AutomorphismGroup\n
  7.2-3 Bl\ issAutomorphismGroup\n
  7.2-4 Nau\ tyAutomorphismGroup\n
  7.2-5 Auto\ morphismGroup\n
&\ nbsp; 7.2-6 Automorphi\ smGroup\n
&\ nbsp;7.2-7 BlissCanonicalLa\ belling\n
&\ nbsp;7.2-8 BlissCanonicalLa\ belling\n
&\ nbsp;7.2-9 BlissCanonicalDi\ graph\n
&nb\ sp;7.2-10 DigraphGroup<\ /span>\n
  \ 7.2-11 DigraphOrbits\n<\ span class=\"ContSS\">
  7.2-12 DigraphOrbitReps\n
  7.2-13 DigraphSchreierVector\n
  7.2-14 DigraphStabilizer\n
  7.2-15 IsIsomorphicDigraph\n
  7.2-16 IsIsomorphicDigraph\n
  7.2-17 IsomorphismDigraphs\n
  7.2-18 IsomorphismDigraphs\n\
  7.2-19 RepresentativeOutNeighbours\n
  7.2-20 IsDigraphIsomorphism\n
  7.2-21 IsDigraphColouring\n
\n
7.3 Homomorphis\ ms of digraphs\n\n
\n
  7.3-1 HomomorphismDigraphsFinder\n
  7.3-2 DigraphHomomorphism\n
  7.3-3 HomomorphismsDigraphs\n
  7.3-4 DigraphMonomorphism\n
  7.3-5 MonomorphismsDigraphs\n
  7.3-6 DigraphEpimorphism\n  7.3-7 EpimorphismsDigraphs\n
  7.3-8 DigraphEmbedding\n
  7.3-9 EmbeddingsDigraphs\n
  7.3-\ 10 IsDigraphHomomorphism\n
  7.3-1\ 1 IsDigraphEmbedding\n
  7.3-12 Di\ graphsRespectsColouring\n
  7.3-1\ 3 GeneratorsOfEndomorphismMonoid\n
  7.3-14 DigraphColouring\n
  7.3\ -15 DigraphGreedyColouring\n
  7.3\ -16 DigraphWelshPowellOrder\n
  7.\ 3-17 ChromaticNumber\n
  7.3-18 Di\ graphCore\n
\n
\n", 8 := "
8 Finding cliques and independent sets\n\
8.1 F\ inding cliques\n\n
\n
  8.1-1 IsClique\n
  8.1-2 CliquesFinder\n
  8\ .1-3 DigraphClique\n
  8.1-4 Digra\ phMaximalCliques\n
  8.1-5 Clique\ Number\n
\n
8.2 Finding independent sets\n\n\
\n
  8.2-1 IsInde\ pendentSet\n
&nbs\ p; 8.2-2 DigraphIndepe\ ndentSet\n
\ 8.2-3 DigraphMaximalI\ ndependentSets\n
\n
\n", 9 := "
9 Visualising and IO\n
9.1 Visualising a digra\ ph\n\n
\n  9.1-1 Splash\n
  9.1-2\ DotDigraph\n
&nb\ sp; 9.1-3 DotSymmetric\ Digraph\n
&\ nbsp;9.1-4 DotPartialOrderD\ igraph\n
&n\ bsp;9.1-5 DotPreorderDigrap\ h\n
  <\ /span>9.1-6 DotHighlightedDigraph<\ /a>\n
\n
9.2\ Reading and writing digraphs to a file\n\n
\n
  9.2-1\ String\n
&\ nbsp;9.2-2 DigraphFromGraph\ 6String\n
&\ nbsp;9.2-3 Graph6String\ \n
  9.2-4 DigraphFile\n
  9.2-5 ReadDigraphs\n
  9.2-6 WriteDigraphs\n<\ br />  9.2-7 IteratorFromDigraphFile\n<\ br />  9.2-8 DigraphPlainTextLineEncoder\n
  9.2-9 TournamentLineDecoder\n
  9.2-10 AdjacencyMatrixUpperTriangleLineDecoder\n
  9.2-11 TCodeDecoder\n
  9.2-12 PlainTextString\n
  9.2-13 WritePlainTextDigraph\n\
  9.2-14 WriteDIMACSDigraph\n
\n
\n", A := "
A \n Grape to Digraphs Command Map\n \n
\ ;A.1 \n Functions to construct and modify graphs\n \n\ \n
\n
A.2 \n Functions to inspect graphs, vertices and edges\n \ \n\n
\n
A.3 \n Functions to determine regularity properties of \ graphs\n \n\n
\n
A.4 \n Some special vertex subsets o\ f a graph\n \n\n
\n
A.5 \n Functions to construct new\ graphs from old\n \n\n
\n
A.6 \n Vertex-Colouring an\ d Complete Subgraphs\n \n\n
\n
A.7 \n Automorphism g\ roups and isomorphism testing for graphs\n \n\n
\n\n" ), chaptitle := rec( 1 := "\n The Digraphs package\n ", 2 := "Installing Digraphs<\ /strong>", 3 := "Creating digraphs", 4 := "Operators", 5 := "Attributes and operations", 6 := "Properties of digraphs", 7 := "Homomorphisms", 8 := "Finding cliques and independent sets", 9 := "Visualising and IO", A := "\n Grape to Digraphs Command Map\n " ), content := [ rec( content := "Book SYSTEM \"gapdoc.dtd\"\n [ Digraphs\">\n http://www.maths.qmul.ac.uk/~leonard/grape/Grape\">\n http://www.tcs.tkk.fi/Software/bliss/bliss\">\n https://github.com/graph-algorithms/edge-addition-planarity-suiteedge-addition-planarity-suite\">\n ht\ tp://pallini.di.uniroma1.it/nauty\">\n https://github.com/gap-packages/NautyTracesInter\ faceNautyTracesInterface\">\n \n http://gap-p\ ackages.github.io/io/\nIO\">\n \n http://http:/\ /gap-packages.github.io/orb/\n Orb\">\n https://github.com/gap-packages/datastructuresdatastructures\">\n \n\n\n\n\n\n\n\n\n\n ]", count := [ 0, 0, 0, 1 ], name := "XMLDOCTYPE", root := ~ ), rec( attributes := rec( Name := "digraphs" ), content := [ rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ) ], count := [ 0, 0, 0, 1 ], name := "Title", next := 2023, root := ~, start := 1998, stop := 2022 ), rec( attributes := rec( ), content := [ rec( content := "Version 1.2.1", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Version", next := 2062, root := ~, start := 2026, stop := 2061 ), rec( attributes := rec( ), content := [ rec( content := "Jan De Beule\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "jdebeule@cage.ugent.be", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Email", next := 2128, root := ~, start := 2091, stop := 2127 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "http://homepages.vub.ac.b\ e/~jdbeule", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Homepage", next := 2189, root := ~, start := 2133, stop := 2188 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2201, root := ~, start := 2066, stop := 2200 ), rec( attributes := rec( ), content := [ rec( content := "Julius Jonušas\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "julius.jonusas@tuwien.ac.\ at", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Email", next := 2279, root := ~, start := 2237, stop := 2278 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "http://julius.jonusas.wor\ k", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Homepage", next := 2331, root := ~, start := 2284, stop := 2330 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2343, root := ~, start := 2205, stop := 2342 ), rec( attributes := rec( ), content := [ rec( content := "James D. Mitchell\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "jdm3@st-and.ac.uk", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Email", next := 2409, root := ~, start := 2377, stop := 2408 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "http://www-groups.mcs.st-\ andrews.ac.uk/~jamesm", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Homepage", next := 2481, root := ~, start := 2414, stop := 2480 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2493, root := ~, start := 2347, stop := 2492 ), rec( attributes := rec( ), content := [ rec( content := "Michael Torpey\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "mct25@st-andrews.ac.uk", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Email", next := 2561, root := ~, start := 2524, stop := 2560 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "https://mtorpey.github.io\ ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Homepage", next := 2612, root := ~, start := 2566, stop := 2611 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2624, root := ~, start := 2497, stop := 2623 ), rec( attributes := rec( ), content := [ rec( content := "Wilf A. Wilson\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "gap@wilf-wilson.net", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Email", next := 2689, root := ~, start := 2655, stop := 2688 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "http://wilf.me", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "Homepage", next := 2729, root := ~, start := 2694, stop := 2728 ), rec( content := "\n ", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2741, root := ~, start := 2628, stop := 2740 ), rec( attributes := rec( ), content := [ rec( content := "Stuart Burrell", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2776, root := ~, start := 2745, stop := 2775 ), rec( attributes := rec( ), content := [ rec( content := "Reinis Cirpons", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2811, root := ~, start := 2780, stop := 2810 ), rec( attributes := rec( ), content := [ rec( content := "Luke Elliott", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2844, root := ~, start := 2815, stop := 2843 ), rec( attributes := rec( ), content := [ rec( content := "Max Horn", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2873, root := ~, start := 2848, stop := 2872 ), rec( attributes := rec( ), content := [ rec( content := "Christopher Jefferson", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2915, root := ~, start := 2877, stop := 2914 ), rec( attributes := rec( ), content := [ rec( content := "Markus Pfeiffer", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2951, root := ~, start := 2919, stop := 2950 ), rec( attributes := rec( ), content := [ rec( content := "Chris Russell", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 2985, root := ~, start := 2955, stop := 2984 ), rec( attributes := rec( ), content := [ rec( content := "Finn Smith", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 3016, root := ~, start := 2989, stop := 3015 ), rec( attributes := rec( ), content := [ rec( content := "Murray White", count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 0, 1 ], name := "Author", next := 3049, root := ~, start := 3020, stop := 3048 ), rec( attributes := rec( ), content := [ rec( content := "© 2014-20 by\n Jan De Beule, \ Julius Jonušas, James D. Mitchell, Michael\n Torpey, Wilf A. Wilson et al.\ ", count := [ 0, 0, 1, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 0, 0, 1, 2 ], mathmode := "Text", name := "P", next := 3199, root := ~, start := 3195, stop := 3198 ), rec( content := "\n\n ", count := [ 0, 0, 1, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 0, 0, 1, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 1, 2 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " is free software; you can redis\ tribute it and/or modify it\n under the terms of the ", count := [ 0, 0, 1, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Text := "GNU General Public License" ), content := [ rec( content := "\n http://www.fsf.org/\ licenses/gpl.html", count := [ 0, 0, 1, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 1, 2 ], mathmode := "Text", name := "URL", next := 3388, root := ~, start := 3302, stop := 3387 ), rec( content := " as published by the Free Softwa\ re\n Foundation; either version 3 of the License, or (at your option) any l\ ater\n version.\n ", count := [ 0, 0, 1, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 1, 1 ], name := "Copyright", next := 3529, root := ~, start := 3053, stop := 3528 ), rec( attributes := rec( ), content := [ rec( content := "\n The ", count := [ 0, 0, 2, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 0, 0, 2, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 2, 1 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package is a ", count := [ 0, 0, 2, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "GAP", count := [ 0, 0, 2, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 2, 1 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " package containing methods for \ graphs,\n digraphs, and multidigraphs.\n ", count := [ 0, 0, 2, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 2, 1 ], name := "Abstract", next := 3667, root := ~, start := 3533, stop := 3666 ), rec( attributes := rec( ), content := [ rec( content := "\n We would like to thank Chri\ stopher Jefferson for his help in including \n ", count := [ 0, 0, 3, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "bliss" ) , content := [ rec( content := "http://www.tcs.tk\ k.fi/Software/bliss/", count := [ 0, 0, 3, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 3, 1 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 0, 0, 3, 1 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ), content := [ rec( attributes := rec( ), content := [ rec( content := "bliss", count := [ 0, 0, 3, 1 ], name := "PCDATA", root := ~ ) ], count := [ 0, 0, 3, 1 ], name := "Package", next := 131, root := ~, start := 107, stop := 130 ) ], count := [ 0, 0, 3, 1 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " in ", count := [ 0, 0, 3, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 0, 0, 3, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 3, 1 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ".\n\n This package's methods \ for computing digraph homomorphisms are based on work\n by Max Neunhöffer,\ and independently Artur Schäfer.\n ", count := [ 0, 0, 3, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 3, 1 ], name := "Acknowledgements", next := 3962, root := ~, start := 3671, stop := 3961 ) ], count := [ 0, 0, 0, 1 ], mathmode := "Text", name := "TitlePage", next := 3976, root := ~, start := 1984, stop := 3975 ), rec( attributes := rec( ), content := 0, count := [ 0, 0, 4, 1 ], mathmode := "Text", name := "TableOfContents", next := 3997, root := ~, start := 3979, stop := 3996 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 0, 0, 4, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "The Digraphs package" ), content := [ rec( content := "\n ", count := [ 1, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n The ", count := [ 1, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 1, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 0, 0, 2 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package\n ", count := [ 1, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 4098, root := ~, start := 4049, stop := 4097 ), rec( content := "\n ", count := [ 1, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "Digraphs" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 1, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 0, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package overview", count := [ 1, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 0, 0, 3 ], mathmode := "Text", name := "Index", next := 4158, root := ~, start := 4101, stop := 4157 ), rec( content := "\n\n", count := [ 1, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Introduction", count := [ 1, 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 4200, root := ~, start := 4169, stop := 4199 ), rec( content := "\n\n This is the manual\ for version 1.2.1 of the ", count := [ 1, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 1, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package.\n This packag\ e was developed at the University of St Andrews by:\n ", count := [ 1, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Jan De Be\ ule,", count := [ 1, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 5 ], name := "Item", next := 4376, root := ~, start := 4350, stop := 4375 ), rec( attributes := rec( ), content := [ rec( content := "Julius Jo\ nušas,", count := [ 1, 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 7 ], name := "Item", next := 4414, root := ~, start := 4381, stop := 4413 ), rec( attributes := rec( ), content := [ rec( content := "James D. \ Mitchell,", count := [ 1, 1, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 9 ], name := "Item", next := 4450, root := ~, start := 4419, stop := 4449 ), rec( attributes := rec( ), content := [ rec( content := "Michael C\ . Torpey, and", count := [ 1, 1, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 11 ], name := "Item", next := 4490, root := ~, start := 4455, stop := 4489 ), rec( attributes := rec( ), content := [ rec( content := "Wilf A. W\ ilson.", count := [ 1, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 13 ], name := "Item", next := 4523, root := ~, start := 4495, stop := 4522 ) ], count := [ 1, 1, 0, 4 ], mathmode := "Text", name := "List", next := 4533, root := ~, start := 4339, stop := 4532 ), rec( content := "\n Additional contribut\ ions were made by:\n ", count := [ 1, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Stuart Bu\ rrell,", count := [ 1, 1, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 17 ], name := "Item", next := 4616, root := ~, start := 4588, stop := 4615 ), rec( attributes := rec( ), content := [ rec( content := "Reinis Ci\ rpons,", count := [ 1, 1, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 19 ], name := "Item", next := 4649, root := ~, start := 4621, stop := 4648 ), rec( attributes := rec( ), content := [ rec( content := "Luke Elli\ ott,", count := [ 1, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 21 ], name := "Item", next := 4680, root := ~, start := 4654, stop := 4679 ), rec( attributes := rec( ), content := [ rec( content := "Max Horn,\ ", count := [ 1, 1, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 23 ], name := "Item", next := 4707, root := ~, start := 4685, stop := 4706 ), rec( attributes := rec( ), content := [ rec( content := "Christoph\ er Jefferson,", count := [ 1, 1, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 25 ], name := "Item", next := 4747, root := ~, start := 4712, stop := 4746 ), rec( attributes := rec( ), content := [ rec( content := "Markus Pf\ eiffer,", count := [ 1, 1, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 27 ], name := "Item", next := 4781, root := ~, start := 4752, stop := 4780 ), rec( attributes := rec( ), content := [ rec( content := "Chris Rus\ sell,", count := [ 1, 1, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 29 ], name := "Item", next := 4813, root := ~, start := 4786, stop := 4812 ), rec( attributes := rec( ), content := [ rec( content := "Finn Smit\ h, and", count := [ 1, 1, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 31 ], name := "Item", next := 4846, root := ~, start := 4818, stop := 4845 ), rec( attributes := rec( ), content := [ rec( content := "Maria Tsa\ lakou,", count := [ 1, 1, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 33 ], name := "Item", next := 4879, root := ~, start := 4851, stop := 4878 ), rec( attributes := rec( ), content := [ rec( content := "Murray Wh\ yte.", count := [ 1, 1, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 35 ], name := "Item", next := 4910, root := ~, start := 4884, stop := 4909 ) ], count := [ 1, 1, 0, 16 ], mathmode := "Text", name := "List", next := 4920, root := ~, start := 4577, stop := 4919 ), rec( content := "\n\n The ", count := [ 1, 1, 0, 37 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 1, 1, 0, 37 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 37 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package contains a vari\ ety of methods for efficiently creating\n and storing mutable and immutable d\ igraphs and computing information about\n them. Full explanations of all t\ he functions contained in the package are\n provided below. ", count := [ 1, 1, 0, 37 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "P", next := 5182, root := ~, start := 5178, stop := 5181 ), rec( content := "\n\n If the ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ), content := [ rec( content := "http://ww\ w.maths.qmul.ac.uk/~leonard/grape/", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 1, 1, 0, 38 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "Grape", count := [ 1, 1, 0, 38 ], name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], name := "Package", next := 137, root := ~, start := 113, stop := 136 ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " package is available, i\ t will be loaded automatically.\n Digraphs created with the ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package can be converte\ d to ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ), content := [ rec( content := "http://ww\ w.maths.qmul.ac.uk/~leonard/grape/", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 1, 1, 0, 38 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "Grape", count := [ 1, 1, 0, 38 ], name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], name := "Package", next := 137, root := ~, start := 113, stop := 136 ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := "\n graphs with ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Graph" ) , content := 0, count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "Ref", next := 5364, root := ~, start := 5345, stop := 5363 ), rec( content := ", and conversely ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ), content := [ rec( content := "http://ww\ w.maths.qmul.ac.uk/~leonard/grape/", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 1, 1, 0, 38 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "Grape", count := [ 1, 1, 0, 38 ], name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], name := "Package", next := 137, root := ~, start := 113, stop := 136 ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " graphs can be\n conver\ ted to ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " objects with ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph" ), content := 0, count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "Ref", next := 5463, root := ~, start := 5442, stop := 5462 ), rec( content := ". ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ), content := [ rec( content := "http://ww\ w.maths.qmul.ac.uk/~leonard/grape/", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 1, 1, 0, 38 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "Grape", count := [ 1, 1, 0, 38 ], name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], name := "Package", next := 137, root := ~, start := 113, stop := 136 ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " is not\n required for \ ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " to run. ", count := [ 1, 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "P", next := 5519, root := ~, start := 5515, stop := 5518 ), rec( content := "\n\n The ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "bliss" ), content := [ rec( content := "http://ww\ w.tcs.tkk.fi/Software/bliss/", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 1, 1, 0, 39 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "bliss", count := [ 1, 1, 0, 39 ], name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], name := "Package", next := 131, root := ~, start := 107, stop := 130 ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " tool ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "JK07" ), content := 0, count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "Cite", next := 5558, root := ~, start := 5540, stop := 5557 ), rec( content := " is included in this pac\ kage. It\n is an open-source tool for computing automorphism groups and cano\ nical forms\n of graphs, written by Tommi Junttila and Petteri Kaski. Several\ of the methods\n in the ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package rely on ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "bliss" ), content := [ rec( content := "http://ww\ w.tcs.tkk.fi/Software/bliss/", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 1, 1, 0, 39 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "bliss", count := [ 1, 1, 0, 39 ], name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], name := "Package", next := 131, root := ~, start := 107, stop := 130 ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := ". If the ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "NautyTracesInte\ rface" ), content := [ rec( content := "https://github.com/gap-packages/NautyT\ racesInterface", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 1, 1, 0, 39 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ) , rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "NautyTrac\ esInterface", count := [ 1, 1, 0, 39 ], name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], name := "Package", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := "\n package for GAP is a\ vailable then it is also possible to use ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "nauty" ), content := [ rec( content := "http://pa\ llini.di.uniroma1.it/", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 1, 1, 0, 39 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "nauty", count := [ 1, 1, 0, 39 ], name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], name := "Package", next := 124, root := ~, start := 100, stop := 123 ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "MP14" ), content := 0, count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "Cite", next := 5920, root := ~, start := 5898, stop := 5919 ), rec( content := " for computing automorph\ ism groups and canonical forms\n in ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ". See Section \n ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Sect := "Isomorphisms and canoni\ cal labellings" ), content := 0, count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "Ref", next := 6058, root := ~, start := 6007, stop := 6057 ), rec( content := " for more details. \n \ ", count := [ 1, 1, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := 0, count := [ 1, 1, 0, 40 ], mathmode := "Text", name := "P", next := 6085, root := ~, start := 6081, stop := 6084 ), rec( content := "\n\n From version 1.0.0\ of this package, digraphs can be either mutable or immutable.\n Mutable digr\ aphs can be changed in-place by many of the methods in the\n package, which a\ voids unnecessary copying. Immutable digraphs cannot be\n changed in-place, b\ ut their advantage is that the value of an attribute of\n an immutable digrap\ h is only ever computed once. Mutable digraphs can be\n converted into immuta\ ble digraphs in-place using ", count := [ 1, 1, 0, 40 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref", Func := "MakeImmutable" ), content := 0, count := [ 1, 1, 0, 40 ], mathmode := "Text", name := "Ref", next := 6566, root := ~, start := 6520, stop := 6565 ), rec( content := ". One of the motivation\ s for introducing mutable\n digraphs in version 1.0.0 was that in practice th\ e authors often wanted\n to create a digraph and immediately modify it (remov\ ing certain edges,\n loops, and so on). Before version 1.0.0, this involved c\ opying the digraph\n several times, with each copy being discarded almost imm\ ediately.\n From version 1.0.0, this unnecessary copying can be eliminated by\ \n first creating a mutable digraph, then changing it in-place, and finally\ \n converting the mutable digraph to an immutable one in-place\n (if desirab\ le).\n\n ", count := [ 1, 1, 0, 40 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Definitions" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Definitio\ ns", count := [ 1, 1, 1, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 2 ], mathmode := "Text", name := "Heading", next := 7197, root := ~, start := 7167, stop := 7196 ), rec( content := "\n\n For the \ purposes of this package and its documentation, the following\n definitions\ apply: ", count := [ 1, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "P", next := 7300, root := ~, start := 7296, stop := 7299 ), rec( content := "\n\n A ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "E", next := 7322, root := ~, start := 7308, stop := 7321 ), rec( content := " ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "E=(E^0,E^\ 1,r,s)", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "M", next := 7345, root := ~, start := 7323, stop := 7344 ), rec( content := ", also known as \ a ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "directed\\ n graph", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "E", next := 7390, root := ~, start := 7363, stop := 7389 ), rec( content := ", consists of a \ set of vertices ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "E^0", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "M", next := 7432, root := ~, start := 7422, stop := 7431 ), rec( content := " and a set of ed\ ges\n ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "E^1", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "M", next := 7466, root := ~, start := 7456, stop := 7465 ), rec( content := " together with f\ unctions ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s, r: E^1\ \\to E^0", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "M", next := 7515, root := ~, start := 7491, stop := 7514 ), rec( content := ", called the\n \ ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "source", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "E", next := 7545, root := ~, start := 7532, stop := 7544 ), rec( content := " and ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "range", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "E", next := 7562, root := ~, start := 7550, stop := 7561 ), rec( content := ", respectively.\\ n\n The source and range of an edge is respectively the values of ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s, r", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "M", next := 7656, root := ~, start := 7645, stop := 7655 ), rec( content := " at\n that ed\ ge.\n\n An edge is called a ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "loop", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "E", next := 7711, root := ~, start := 7700, stop := 7710 ), rec( content := " if its source a\ nd range are the same.\n\n A digraph is called a ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "multidigr\ aph", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "E", next := 7796, root := ~, start := 7777, stop := 7795 ), rec( content := " if there exist \ two or more edges\n with the same source and the same range. ", count := [ 1, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "P", next := 7879, root := ~, start := 7875, stop := 7878 ), rec( content := "\n\n A ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "directed \ walk", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "E", next := 7907, root := ~, start := 7887, stop := 7906 ), rec( content := " on a digraph is\ a sequence of alternating vertices\n and edges ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(v_1, e_1\ , v_2, e_2, ..., e_{n-1}, v_n)", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "M", next := 8019, root := ~, start := 7973, stop := 8018 ), rec( content := " such that each \ edge\n ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e_i", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "M", next := 8054, root := ~, start := 8044, stop := 8053 ), rec( content := " has source ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v_i", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "M", next := 8076, root := ~, start := 8066, stop := 8075 ), rec( content := " and range ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v_{i+1}", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "M", next := 8101, root := ~, start := 8087, stop := 8100 ), rec( content := ". A ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "directed\\ n path", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "E", next := 8131, root := ~, start := 8105, stop := 8130 ), rec( content := " is a directed w\ alk where no vertex (and hence no edge) is\n repeated. A ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "directed \ circuit", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "E", next := 8230, root := ~, start := 8207, stop := 8229 ), rec( content := " is a directed w\ alk where ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v_1 =\n \ v_n", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "M", next := 8278, root := ~, start := 8256, stop := 8277 ), rec( content := ", and a ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "directed \ cycle", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "E", next := 8307, root := ~, start := 8286, stop := 8306 ), rec( content := " is a directed c\ ircuit where where no\n vertex is repeated, except for ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v_1 = v_n\ ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "M", next := 8396, root := ~, start := 8380, stop := 8395 ), rec( content := ". ", count := [ 1, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "P", next := 8403, root := ~, start := 8399, stop := 8402 ), rec( content := "\n\n The ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "length", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "E", next := 8426, root := ~, start := 8413, stop := 8425 ), rec( content := " of a directed w\ alk ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(v_1, e_1\ , v_2, e_2, ..., e_{n-1},\n v_n)", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "M", next := 8498, root := ~, start := 8446, stop := 8497 ), rec( content := " is equal to ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n-1", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "M", next := 8521, root := ~, start := 8511, stop := 8520 ), rec( content := ", the number of \ edges it contains. A\n directed walk (or path) ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(v_1, e_1\ , v_2, e_2, ..., e_{n-1}, v_n)", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "M", next := 8633, root := ~, start := 8587, stop := 8632 ), rec( content := " is\n sometim\ es called a directed walk (or path) ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "from vert\ ex ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ _1", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "M", next := 8709, root := ~, start := 8699, stop := 8708 ), rec( content := " to\n \ vertex ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ _n", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "M", next := 8736, root := ~, start := 8726, stop := 8735 ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "E", next := 8740, root := ~, start := 8684, stop := 8739 ), rec( content := ". A directed wa\ lk of zero length, i.e. a sequence\n ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(v)", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "M", next := 8805, root := ~, start := 8795, stop := 8804 ), rec( content := " for some vertex\ ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "v", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "M", next := 8830, root := ~, start := 8822, stop := 8829 ), rec( content := ", is called ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "trivial", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "E", next := 8856, root := ~, start := 8842, stop := 8855 ), rec( content := ". A trivial\n \ directed walk is considered to be both a circuit and a cycle, as is the\n \ empty directed walk ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "()", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "M", next := 8977, root := ~, start := 8968, stop := 8976 ), rec( content := ". A ", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "simple ci\ rcuit", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "E", next := 9002, root := ~, start := 8981, stop := 9001 ), rec( content := " is another name\ for a\n non-trivial and non-empty directed cycle.", count := [ 1, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 1, 1, 1, 7 ], mathmode := "Text", name := "P", next := 9074, root := ~, start := 9070, stop := 9073 ), rec( content := "\n\n ", count := [ 1, 1, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 1, 1 ], mathmode := "Text", name := "Subsection", next := 9091, root := ~, start := 7135, stop := 9090 ), rec( content := "\n ", count := [ 1, 1, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 1, 0, 1 ], mathmode := "Text", name := "Section", next := 9104, root := ~, start := 4160, stop := 9103 ), rec( content := "\n", count := [ 1, 1, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 1, 0, 0, 1 ], mathmode := "Text", name := "Chapter", next := 9115, root := ~, start := 4008, stop := 9114 ), rec( content := "\n ", count := [ 1, 1, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " intro ", count := [ 1, 1, 1, 7 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 1, 1, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Installing Digraphs" ) , content := [ rec( content := "\n ", count := [ 2, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Installing ", count := [ 2, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 0, 0, 2 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ) ], count := [ 2, 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 9214, root := ~, start := 9174, stop := 9213 ), rec( content := "\n\n ", count := [ 2, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "For those in a hurry" ), content := [ rec( content := "\n ", count := [ 2, 1, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "For those in a hu\ rry", count := [ 2, 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 9300, root := ~, start := 9261, stop := 9299 ), rec( content := "\n In this section we\ give a brief description of how to start using\n ", count := [ 2, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ".", count := [ 2, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "P", next := 9390, root := ~, start := 9386, stop := 9389 ), rec( content := "\n\n It is assumed th\ at you have a working copy of ", count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "GAP", count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " with version number\n \ 4.9.0 or higher. The most up-to-date version of ", count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "GAP", count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " and instructions\n o\ n how to install it can be obtained from the main ", count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "GAP", count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " webpage\n ", count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "http://www.gap-sy\ stem.org", count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "URL", next := 9656, root := ~, start := 9620, stop := 9655 ), rec( content := ".", count := [ 2, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 1, 0, 5 ], mathmode := "Text", name := "P", next := 9661, root := ~, start := 9657, stop := 9660 ), rec( content := "\n\n The following is\ a summary of the steps that should lead to a\n successful installation of \ ", count := [ 2, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 5 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ":\n\n ", count := [ 2, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ensure that the ", count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "IO" ), content := [ rec( content := "\n http://gap-packages\ .github.io/io/\n", count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "URL", next := 78, root := ~, start := 17, stop := 77 ) ], count := [ 2, 1, 0, 7 ], name := "Alt", next := 84, root := ~, start := 1, stop := 83 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "IO", count := [ 2, 1, 0, 7 ], name := \ "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 7 ], name := "Package", next := 122, root := ~, start := 101 , stop := 121 ) ], count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "Alt", next := 128, root := ~, start := 84, stop := 127 ), rec( content := " package\ version 4.5.1 or higher is available.\n ", count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "IO" ), content := [ rec( content := "\n http://gap-packages\ .github.io/io/\n", count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "URL", next := 78, root := ~, start := 17, stop := 77 ) ], count := [ 2, 1, 0, 7 ], name := "Alt", next := 84, root := ~, start := 1, stop := 83 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "IO", count := [ 2, 1, 0, 7 ], name := \ "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 7 ], name := "Package", next := 122, root := ~, start := 101 , stop := 121 ) ], count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "Alt", next := 128, root := ~, start := 84, stop := 127 ), rec( content := " must be\ compiled before ", count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " can be \ loaded.\n ", count := [ 2, 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 7 ], name := "Item", next := 9952, root := ~, start := 9791, stop := 9951 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ensure that the ", count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Orb" ), content := [ rec( content := "\n http://http://gap-\ packages.github.io/orb/", count := [ 2, 1, 0, 9 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "URL\ ", next := 86, root := ~, start := 17, stop := 85 ), rec( content := "\n " , count := [ 2, 1, 0, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 9 ], name := "Alt", next := 98, root := ~, start := 1, stop := 97 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Orb", count := [ 2, 1, 0, 9 ], name :=\ "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 9 ], name := "Package", next := 137, root := ~, start := 115 , stop := 136 ) ], count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 98, stop := 142 ), rec( content := " package\ version 4.8.2 or higher is available.\n ", count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Orb" ), content := [ rec( content := "\n http://http://gap-\ packages.github.io/orb/", count := [ 2, 1, 0, 9 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "URL\ ", next := 86, root := ~, start := 17, stop := 85 ), rec( content := "\n " , count := [ 2, 1, 0, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 9 ], name := "Alt", next := 98, root := ~, start := 1, stop := 97 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Orb", count := [ 2, 1, 0, 9 ], name :=\ "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 9 ], name := "Package", next := 137, root := ~, start := 115 , stop := 136 ) ], count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 98, stop := 142 ), rec( content := " has bet\ ter performance when compiled, but although compilation is\n recommende\ d, it is not required to be compiled for ", count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " to be\n\ loaded.\n ", count := [ 2, 1, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 9 ], name := "Item", next := 10232, root := ~, start := 9960, stop := 10231 ), rec( attributes := rec( ), content := [ rec( content := " ensure t\ hat the ", count := [ 2, 1, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "datastructures" ), content := [ rec( content := "https://github\ .com/gap-packages/datastructures", count := [ 2, 1, 0, 11 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 11 ], mathmode := "Tex\ t", name := "URL", next := 103, root := ~, start := 17, stop := 102 ) ], count := [ 2, 1, 0, 11 ], name := "Alt", next := 109, root := ~, start := 1, stop := 108 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "datastructures", count := [ 2, 1, 0, 1\ 1 ], name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 11 ], name := "Packa\ ge", next := 162, root := ~, start := 129, stop := 161 ) ], count := [ 2, 1, 0, 11 ], mathmode := "Text", name := "Alt", next := 168, root := ~, start := 109, stop := 167 ), rec( content := " package\ version\n 0.2.5 or higher is available. \n ", count := [ 2, 1, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 11 ], name := "Item", next := 10361, root := ~, start := 10240, stop := 10360 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "T\ his step is optional:", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "B", next := 10413, root := ~, start := 10384, stop := 10412 ), rec( content := " certain\ functions in ", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " require\ \n the ", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 2, 1, 0, 13 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ 2, 1, 0, 13 ], name\ := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " package\ to be available; see Section\n ", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Subsect := "The \ Grape package" ), content := 0, count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "Ref", next := 10553, root := ~, start := 10519, stop := 10552 ), rec( content := " for ful\ l details. To use these\n functions make sure\n that the ", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 2, 1, 0, 13 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ 2, 1, 0, 13 ], name\ := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " package\ version 4.8.1 or higher is available.\n If ", count := [ 2, 1, 0, 13 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 2, 1, 0, 13 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ 2, 1, 0, 13 ], name\ := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " is not \ available, then ", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " can be \ used as normal with\n the exception that the functions listed in Subsec\ tion\n ", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Subsect := "The \ Grape package" ), content := 0, count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "Ref", next := 10875, root := ~, start := 10841, stop := 10874 ), rec( content := " will no\ t work.\n ", count := [ 2, 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 13 ], name := "Item", next := 10904, root := ~, start := 10369, stop := 10903 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "T\ his step is optional:", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "B", next := 10962, root := ~, start := 10933, stop := 10961 ), rec( content := " certain\ functions in ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " require\ \n the ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 2, 1, 0, 15 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 2, 1, 0, 15 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 2, 1\ , 0, 15 ], name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " package\ to be available.\n ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " TODO \n\ see Section\n for full d\ etails. ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "XMLCOMMENT" , root := ~ ), rec( content := "\n \ If you want to make use of these functions, please ensure that the\n \ ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 2, 1, 0, 15 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 2, 1, 0, 15 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 2, 1\ , 0, 15 ], name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " package\ version 0.2 or\n higher is available. If ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 2, 1, 0, 15 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 2, 1, 0, 15 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 2, 1\ , 0, 15 ], name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " is not \ available,\n then ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " can be \ used as normal with the exception that \n functions whose names conta\ in ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "N\ auty", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "Q", next := 11521, root := ~, start := 11509, stop := 11520 ), rec( content := " will no\ t work.\n ", count := [ 2, 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 15 ], name := "Item", next := 11550, root := ~, start := 10918, stop := 11549 ), rec( attributes := rec( ), content := [ rec( content := "\n \ download the package archive ", count := [ 2, 1, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraphs-1.2.1.tar.gz", count := [ 2, 1, 0, 17 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 2, 1, 0, 17 ], mathmode := "Text", name := "F", next := 11629, root := ~, start := 11602, stop := 11628 ), rec( content := " from\n \ ", count := [ 2, 1, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Text := "the Dig\ raph package webpage" ), content := [ rec( content := "http://gap-packages.git\ hub.io/Digraphs/", count := [ 2, 1, 0, 17 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 2, 1, 0, 17 ], mathmode := "Text", name := "URL", next := 11728, root := ~, start := 11643, stop := 11727 ), rec( content := ".\n \ ", count := [ 2, 1, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 17 ], name := "Item", next := 11743, root := ~, start := 11558, stop := 11742 ), rec( attributes := rec( ), content := [ rec( content := "\n \ unzip and untar the file, this should create a directory called\n ", count := [ 2, 1, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraphs-1.2.1", count := [ 2, 1, 0, 19 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 2, 1, 0, 19 ], mathmode := "Text", name := "F", next := 11858, root := ~, start := 11838, stop := 11857 ), rec( content := ".\n \ ", count := [ 2, 1, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 19 ], name := "Item", next := 11873, root := ~, start := 11751, stop := 11872 ), rec( attributes := rec( ), content := [ rec( content := "\n \ locate the ", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ kg", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "F", next := 11917, root := ~, start := 11907, stop := 11916 ), rec( content := " directo\ ry of your ", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " directo\ ry, which contains\n the directories ", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ib", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "F", next := 12002, root := ~, start := 11992, stop := 12001 ), rec( content := ", ", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ oc", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "F", next := 12014, root := ~, start := 12004, stop := 12013 ), rec( content := " and so \ on. Move the directory\n ", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraphs-1.2.1", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "F", next := 12073, root := ~, start := 12053, stop := 12072 ), rec( content := " into th\ e ", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ kg", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "F", next := 12093, root := ~, start := 12083, stop := 12092 ), rec( content := " directo\ ry.\n ", count := [ 2, 1, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 21 ], name := "Item", next := 12118, root := ~, start := 11881, stop := 12117 ), rec( attributes := rec( ), content := [ rec( content := "\n \ it is necessary to compile the ", count := [ 2, 1, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 1, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 23 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package\ .\n Inside the ", count := [ 2, 1, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ kg/digraphs-1.2.1", count := [ 2, 1, 0, 23 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 2, 1, 0, 23 ], mathmode := "Text", name := "F", next := 12235, root := ~, start := 12211, stop := 12234 ), rec( content := " directo\ ry, type\n ", count := [ 2, 1, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ n./configure\nmake", count := [ 2, 1, 0, 24 ], name := "PCDATA", root := ~ ) ] , count := [ 2, 1, 0, 24 ], mathmode := "Text", name := "Listing", next := 12308, root := ~, start := 12260, stop := 12307 ), rec( content := "\n \ Further information about this step can be found in Section\n ", count := [ 2, 1, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Sect := "Compili\ ng the kernel module" ), content := 0, count := [ 2, 1, 0, 25 ], mathmode := "Text", name := "Ref", next := 12426, root := ~, start := 12385, stop := 12425 ), rec( content := ".\n \ ", count := [ 2, 1, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 23 ], name := "Item", next := 12441, root := ~, start := 12126, stop := 12440 ), rec( attributes := rec( ), content := [ rec( content := "\n \ start ", count := [ 2, 1, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 2, 1, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 27 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " in the \ usual way (i.e. type ", count := [ 2, 1, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ap", count := [ 2, 1, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 27 ], mathmode := "Text", name := "C", next := 12514, root := ~, start := 12504, stop := 12513 ), rec( content := " at the \ command line).\n ", count := [ 2, 1, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 27 ], name := "Item", next := 12550, root := ~, start := 12449, stop := 12549 ), rec( attributes := rec( ), content := [ rec( content := "\n \ type ", count := [ 2, 1, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "L\ oadPackage(\"digraphs\");", count := [ 2, 1, 0, 29 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 2, 1, 0, 29 ], mathmode := "Text", name := "C", next := 12609, root := ~, start := 12578, stop := 12608 ), rec( content := "\n \ ", count := [ 2, 1, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 29 ], name := "Item", next := 12623, root := ~, start := 12558, stop := 12622 ) ], count := [ 2, 1, 0, 6 ], mathmode := "Text", name := "List", next := 12635, root := ~, start := 9777, stop := 12634 ), rec( content := "\n\n If you want to c\ heck that the package is working correctly, you\n should run some of the te\ sts described in Section\n ", count := [ 2, 1, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Sect := "Testing your installati\ on" ), content := 0, count := [ 2, 1, 0, 31 ], mathmode := "Text", name := "Ref", next := 12802, root := ~, start := 12763, stop := 12801 ), rec( content := ".\n ", count := [ 2, 1, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 1, 0, 1 ], mathmode := "Text", name := "Section", next := 12816, root := ~, start := 9218, stop := 12815 ), rec( content := "\n\n ", count := [ 2, 1, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 1, 0, 31 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 2, 1, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 1, 0, 31 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n\n ", count := [ 2, 1, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Optional package dependencies"\ ), content := [ rec( content := "\n ", count := [ 2, 2, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Optional package \ dependencies", count := [ 2, 2, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 0, 2 ], mathmode := "Text", name := "Heading", next := 13081, root := ~, start := 13033, stop := 13080 ), rec( content := "\n\n ", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "************************\ ********************************************", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n\n The ", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package is written in " , count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "GAP", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " and C code and requires\ the\n ", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "IO" ), content := [ rec( content := "\n ht\ tp://gap-packages.github.io/io/\n", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "URL", next := 78, root := ~, start := 17, stop := 77 ) ], count := [ 2, 2, 0, 3 ], name := "Alt", next := 84, root := ~, start := 1, stop := 83 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "IO", count := [ 2, 2, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ 2, 2, 0, 3 ], name := "Package", next := 122, root := ~, start := 101, stop := 121 ) ], count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "Alt", next := 128, root := ~, start := 84, stop := 127 ), rec( content := " package. The ", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "IO" ), content := [ rec( content := "\n ht\ tp://gap-packages.github.io/io/\n", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "URL", next := 78, root := ~, start := 17, stop := 77 ) ], count := [ 2, 2, 0, 3 ], name := "Alt", next := 84, root := ~, start := 1, stop := 83 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "IO", count := [ 2, 2, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ 2, 2, 0, 3 ], name := "Package", next := 122, root := ~, start := 101, stop := 121 ) ], count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "Alt", next := 128, root := ~, start := 84, stop := 127 ), rec( content := " package is used to read\ and write transformations,\n partial permutations, and bipartitions to a f\ ile. ", count := [ 2, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 2, 0, 4 ], mathmode := "Text", name := "P", next := 13376, root := ~, start := 13372, stop := 13375 ), rec( content := "\n\n ", count := [ 2, 2, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "************************\ ********************************************", count := [ 2, 2, 0, 4 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n\n ", count := [ 2, 2, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "The Grape package" ), content := [ rec( content := "\n ", count := [ 2, 2, 1, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "The Grape\ package", count := [ 2, 2, 1, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 1, 2 ], mathmode := "Text", name := "Heading", next := 13544, root := ~, start := 13508, stop := 13543 ), rec( content := "\n\n The ", count := [ 2, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ), content := [ rec( content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ 2, 2, 1, 3 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 1, 3 ], mathmode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 2, 2, 1, 3 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ), content := [ rec( attributes := rec( ) , content := [ rec( content := "G\ rape", count := [ 2, 2, 1, 3 ], name := "PCDATA", root := ~ ) ], count := [ 2, 2, 1, 3 ], name := "Package", next := 137, root := ~, start := 113, stop := 136 ) ], count := [ 2, 2, 1, 3 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " package must be\ available for the following operations to be\n available:\n\n ", count := [ 2, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( attributes :=\ rec( Oper := "Graph" ), content := 0, count := [ 2, 2, 1, 5 ], mathmode := "T\ ext", name := "Ref", next := 13689, root := ~, start := 13670, stop := 13688 ) , rec( content := "\ with a digraph argument", count := [ 2, 2, 1, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 2, 2, 1, 5 ], name := "Item", next := 13720, root := ~, start := 13664, stop := 13719 ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( Attr := "AsGraph" ), content := 0, count := [ 2, 2, 1, 7 ], mathmode := \ "Text", name := "Ref", next := 13756, root := ~, start := 13735, stop := 13755\ ), rec( content := " with a digraph argument", count := [ 2, 2, 1, 7 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 1, 7 ], name := "Item", next := 13787, root := ~, start := 13729, stop := 13786 ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( Oper := "Digraph" ), content := 0, count := [ 2, 2, 1, 9 ], mathmode := \ "Text", name := "Ref", next := 13823, root := ~, start := 13802, stop := 13822\ ), rec( content := " with a ", count := [ 2, 2, 1, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( content := "http://www.math\ s.qmul.ac.uk/~leonard/grape/", count := [ 2, 2, 1, 9 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 2, 2, 1, 9 ], mathmode := "Text", name\ := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 2, 2, 1, 9 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( content :\ = "Grape", count := [ 2, 2, 1, 9 ], name := "PCDATA", root := ~ ) ], count := [ \ 2, 2, 1, 9 ], name := "Package", next := 137, root := ~, start := 113, stop :=\ 136 ) ], count := [ 2, 2, 1, 9 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := "\ graph argument", count := [ 2, 2, 1, 9 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 2, 2, 1, 9 ], name := "Item", next := 13860, root := ~, start := 13796, stop := 13859 ) ], count := [ 2, 2, 1, 4 ], mathmode := "Text", name := "List", next := 13874, root := ~, start := 13649, stop := 13873 ), rec( content := "\n\n If ", count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ), content := [ rec( content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ 2, 2, 1, 11 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 2, 2, 1, 11 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ), content := [ rec( attributes := rec( ) , content := [ rec( content := "G\ rape", count := [ 2, 2, 1, 11 ], name := "PCDATA", root := ~ ) ], count := [ 2, 2, 1, 11 ], name := "Package", next := 137, root := ~, start := 113, stop := 136 ) ], count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " is not availabl\ e, then ", count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs" , count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " can be used as \ normal with\n the exception that the functions above will not work.\n \ ", count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 1, 1 ], mathmode := "Text", name := "Subsection", next := 14031, root := ~, start := 13463, stop := 14030 ), rec( content := "\n ", count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 2, 0, 1 ], mathmode := "Text", name := "Section", next := 14044, root := ~, start := 12981, stop := 14043 ), rec( content := "\n\n ", count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n\n ", count := [ 2, 2, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Compiling the kernel module" ) , content := [ rec( content := "\n ", count := [ 2, 3, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Compiling the ker\ nel module", count := [ 2, 3, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 2 ], mathmode := "Text", name := "Heading", next := 14305, root := ~, start := 14259, stop := 14304 ), rec( content := "\n The ", count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package has a ", count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "GAP", count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " kernel component in\n \ C which should be compiled. This component contains certain low-level\n f\ unctions required by ", count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ".\n ", count := [ 2, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 3, 0, 4 ], mathmode := "Text", name := "P", next := 14485, root := ~, start := 14481, stop := 14484 ), rec( content := "\n\n It is not possib\ le to use the ", count := [ 2, 3, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 3, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 4 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package without compili\ ng it.", count := [ 2, 3, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 3, 0, 5 ], mathmode := "Text", name := "P", next := 14565, root := ~, start := 14561, stop := 14564 ), rec( content := "\n\n To compile the k\ ernel component inside the ", count := [ 2, 3, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "pkg/digraphs-1.2.\ 1", count := [ 2, 3, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 5 ], mathmode := "Text", name := "F", next := 14638, root := ~, start := 14614, stop := 14637 ), rec( content := "\n directory, type\n" , count := [ 2, 3, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n\n./configure\n\ make", count := [ 2, 3, 0, 6 ], name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 6 ], mathmode := "Text", name := "Listing", next := 14708, root := ~, start := 14659, stop := 14707 ), rec( content := "\n ", count := [ 2, 3, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 3, 0, 8 ], mathmode := "Text", name := "P", next := 14717, root := ~, start := 14713, stop := 14716 ), rec( content := "\n\n If you installed\ the package in another 'pkg' directory than the standard 'pkg'\n directory\ in your ", count := [ 2, 3, 0, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "GAP", count := [ 2, 3, 0, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 8 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " installation, then you \ have to do two things. Firstly\n during compilation you have to use the opt\ ion '--with-gaproot=PATH' of the\n 'configure' script where 'PATH' is a pat\ h to the main GAP root directory (if\n not given the default '../..' is ass\ umed).", count := [ 2, 3, 0, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "P", next := 15095, root := ~, start := 15091, stop := 15094 ), rec( content := "\n\n If you installed\ ", count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "GAP", count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " on several architecture\ s, you must execute the\n configure/make step for each of the architectures\ . You can either do this\n immediately after configuring and compiling GAP \ itself on this architecture, or\n alternatively set the environment\n va\ riable 'CONFIGNAME' to the name of the configuration you used when compiling\n\ GAP before running './configure'. Note however that your compiler choice \ and\n flags (environment variables 'CC' and 'CFLAGS') need to be chosen to \ match the\n setup of the original GAP compilation. For example you have to \ specify 32-bit\n or 64-bit mode correctly!\n ", count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 3, 0, 1 ], mathmode := "Text", name := "Section", next := 15743, root := ~, start := 14209, stop := 15742 ), rec( content := "\n\n ", count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n\n ", count := [ 2, 3, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Rebuilding the documentation" ), content := [ rec( content := "\n ", count := [ 2, 4, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Rebuilding the do\ cumentation", count := [ 2, 4, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 4, 0, 2 ], mathmode := "Text", name := "Heading", next := 16006, root := ~, start := 15959, stop := 16005 ), rec( content := "\n The ", count := [ 2, 4, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 4, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 4, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package comes complete \ with pdf, html, and text versions of\n the documentation. However, you migh\ t find it necessary, at some point, to\n rebuild the documentation. To rebu\ ild the documentation, please use the\n function ", count := [ 2, 4, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "DigraphsMakeDoc" ), content := 0, count := [ 2, 4, 0, 3 ], mathmode := "Text", name := "Ref", next := 16283, root := ~, start := 16254, stop := 16282 ), rec( content := ".\n\n ", count := [ 2, 4, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "", Name := "DigraphsMakeDoc\ " ), content := 0, count := [ 2, 4, 1, 2 ], mathmode := "Text", name := "Func", next := 16342, root := ~, start := 16305, stop := 16341 ), rec( attributes := rec( ), content := [ rec( content := "Nothing", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "Returns", next := 16371, root := ~, start := 16345, stop := 16370 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function should be called with no argument to compile the ", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := "\n do\ cumentation.\n ", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "Description", next := 16501, root := ~, start := 16374, stop := 16500 ) ], count := [ 2, 4, 1, 1 ], mathmode := "Text", name := "ManSection", next := 16515, root := ~, start := 16290, stop := 16514 ), rec( content := "\n\n ", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 4, 0, 1 ], mathmode := "Text", name := "Section", next := 16529, root := ~, start := 15908, stop := 16528 ), rec( content := "\n\n ", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n\n ", count := [ 2, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Testing your installation" ), content := [ rec( content := "\n ", count := [ 2, 5, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Testing your inst\ allation", count := [ 2, 5, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 0, 2 ], mathmode := "Text", name := "Heading", next := 16786, root := ~, start := 16742, stop := 16785 ), rec( content := "\n\n In this section \ we describe how to test that ", count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " is working as\n inte\ nded. To test that ", count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " is installed correctly \ use\n ", count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "DigraphsTestInstall" ), content := 0, count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "Ref", next := 16965, root := ~, start := 16932, stop := 16964 ), rec( content := " or for more extensive t\ ests use\n ", count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "DigraphsTestStandard" ) , content := 0, count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "Ref", next := 17036, root := ~, start := 17002, stop := 17035 ), rec( content := ". ", count := [ 2, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "P", next := 17042, root := ~, start := 17038, stop := 17041 ), rec( content := "\n\n If something goe\ s wrong, then please review the instructions in Section ", count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Sect := "For those in a hurry" ) , content := 0, count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "Ref", next := 17160, root := ~, start := 17120, stop := 17159 ), rec( content := " and ensure that ", count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " has been\n properly \ installed. If you continue having problems, please use the ", count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Text := "issue tracker" ), content := [ rec( content := "https://github.co\ m/gap-packages/Digraphs/issues", count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "URL", next := 17355, root := ~, start := 17270, stop := 17354 ), rec( content := "\n to report the issu\ es you are having.\n\n ", count := [ 2, 5, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "", Name := "DigraphsTestIns\ tall" ), content := 0, count := [ 2, 5, 1, 2 ], mathmode := "Text", name := "Func", next := 17458, root := ~, start := 17417, stop := 17457 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "K", next := 17481, root := ~, start := 17470, stop := 17480 ), rec( content := " or ", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "K", next := 17497, root := ~, start := 17485, stop := 17496 ), rec( content := ".", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "Returns", next := 17508, root := ~, start := 17461, stop := 17507 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function can be called without arguments to test your installation of\n " , count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " is work\ ing correctly. These tests should take no more than a\n few seconds to comp\ lete. To test more comprehensively that\n ", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " is work\ ing correctly, use ", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sTestStandard" ), content := 0, count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "Ref", next := 17819, root := ~, start := 17785, stop := 17818 ), rec( content := ".\n ", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "Description", next := 17837, root := ~, start := 17511, stop := 17836 ) ], count := [ 2, 5, 1, 1 ], mathmode := "Text", name := "ManSection", next := 17851, root := ~, start := 17402, stop := 17850 ), rec( content := "\n\n ", count := [ 2, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "", Name := "DigraphsTestSta\ ndard" ), content := 0, count := [ 2, 5, 2, 2 ], mathmode := "Text", name := "Func", next := 17914, root := ~, start := 17872, stop := 17913 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "K", next := 17937, root := ~, start := 17926, stop := 17936 ), rec( content := " or ", count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "K", next := 17953, root := ~, start := 17941, stop := 17952 ), rec( content := ".", count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "Returns", next := 17964, root := ~, start := 17917, stop := 17963 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function can be called without arguments to test all of the methods\n inc\ luded in ", count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ".\n T\ hese tests should take less than a minute to complete. ", count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "P", next := 18150, root := ~, start := 18146, stop := 18149 ), rec( content := "\n\n \ To quickly test that ", count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " is inst\ alled correctly use ", count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sTestInstall" ), content := 0, count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "Ref", next := 18252, root := ~, start := 18215, stop := 18251 ), rec( content := ". For a\ more thorough test, use ", count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sTestExtreme" ), content := 0, count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "Ref", next := 18322, root := ~, start := 18285, stop := 18321 ), rec( content := ".\n ", count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 2, 3 ], mathmode := "Text", name := "Description", next := 18340, root := ~, start := 17967, stop := 18339 ) ], count := [ 2, 5, 2, 1 ], mathmode := "Text", name := "ManSection", next := 18354, root := ~, start := 17857, stop := 18353 ), rec( content := "\n\n ", count := [ 2, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "", Name := "DigraphsTestExt\ reme" ), content := 0, count := [ 2, 5, 3, 2 ], mathmode := "Text", name := "Func", next := 18416, root := ~, start := 18375, stop := 18415 ), rec( attributes := rec( ), content := [ rec( content := "Nothing." , count := [ 2, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 3, 3 ], mathmode := "Text", name := "Returns", next := 18446, root := ~, start := 18419, stop := 18445 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function should be called with no argument. It executes a series of\n ver\ y demanding tests, which measure the performance of a variety of\n function\ s on large examples. These tests take a long time to\n complete, at least \ several minutes. ", count := [ 2, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "P", next := 18722, root := ~, start := 18718, stop := 18721 ), rec( content := "\n\n \ For these tests to complete, the digraphs library ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraphs-lib", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "C", next := 18797, root := ~, start := 18778, stop := 18796 ), rec( content := " must\n \ be downloaded and placed in the ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraphs", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "C", next := 18854, root := ~, start := 18839, stop := 18853 ), rec( content := " directo\ ry in a subfolder\n named ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraphs-lib", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "F", next := 18909, root := ~, start := 18890, stop := 18908 ), rec( content := ".\n T\ his library can be found on the ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " website\ .\n ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 3, 3 ], mathmode := "Text", name := "Description", next := 18984, root := ~, start := 18449, stop := 18983 ) ], count := [ 2, 5, 3, 1 ], mathmode := "Text", name := "ManSection", next := 18998, root := ~, start := 18360, stop := 18997 ), rec( content := "\n\n\n ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 5, 0, 1 ], mathmode := "Text", name := "Section", next := 19013, root := ~, start := 16694, stop := 19012 ), rec( content := "\n\n ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "********************************\ **************************************", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n\n\n", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 2, 0, 0, 1 ], mathmode := "Text", name := "Chapter", next := 19187, root := ~, start := 9134, stop := 19186 ), rec( content := "\n ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " installing ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 2, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Creating digraphs" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Creating digraphs", count := [ 3, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 19282, root := ~, start := 19246, stop := 19281 ), rec( content := "\n\n In this chapter we describ\ e how to create digraphs.", count := [ 3, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 0, 0, 4 ], mathmode := "Text", name := "P", next := 19341, root := ~, start := 19337, stop := 19340 ), rec( content := "\n\n ", count := [ 3, 0, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Creating digraphs\ ", count := [ 3, 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 19390, root := ~, start := 19354, stop := 19389 ), rec( content := "\n ", count := [ 3, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Name := "IsDigraph", Type := "Category" ), content := 0, count := [ 3, 1, 1, 2 ], mathmode := "Text", name := "Filt", next := 19450, root := ~, start := 19410, stop := 19449 ), rec( attributes := rec( ), content := [ rec( content := "\n Eve\ ry digraph in ", count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " belong\ s to the category\n ", count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraph", count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "C", next := 19549, root := ~, start := 19533, stop := 19548 ), rec( content := ". Some \ basic attributes and operations for digraphs\n are ", count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Vertices" ), content := 0, count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "Ref", next := 19639, root := ~, start := 19610, stop := 19638 ), rec( content := ", ", count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Edges" ), content := 0, count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "Ref", next := 19667, root := ~, start := 19641, stop := 19666 ), rec( content := ", and\n \ ", count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "OutNeig\ hbours" ), content := 0, count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "Ref", next := 19704, root := ~, start := 19677, stop := 19703 ), rec( content := ".\n " , count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "Description", next := 19724, root := ~, start := 19453, stop := 19723 ) ], count := [ 3, 1, 1, 1 ], mathmode := "Text", name := "ManSection", next := 19738, root := ~, start := 19395, stop := 19737 ), rec( content := "\n\n ", count := [ 3, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Name := "IsMutableDigrap\ h", Type := "Category" ), content := 0, count := [ 3, 1, 2, 2 ], mathmode := "Text", name := "Filt", next := 19806, root := ~, start := 19759, stop := 19805 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sMutableDigraph", count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "C", next := 19850, root := ~, start := 19827, stop := 19849 ), rec( content := " is a sy\ nonym for ", count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsDigra\ ph" ), content := 0, count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "Ref", next := 19892, root := ~, start := 19868, stop := 19891 ), rec( content := " and ", count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Filt := "IsMutable" ), content := 0, count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "Ref", next := 19940, root := ~, start := 19897, stop := 19939 ), rec( content := ". A mut\ able digraph may be changed\n in-place by methods in the ", count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package\ , and is not attribute-storing\n – see ", count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Filt := "IsAttributeStoringRep" ), content := 0, count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "Ref", next := 20119, root := ~, start := 20068, stop := 20118 ), rec( content := ".\n " , count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 2, 4 ], mathmode := "Text", name := "P", next := 20129, root := ~, start := 20125, stop := 20128 ), rec( content := "\n\n \ A mutable digraph may be converted into an immutable attribute-storing\n di\ graph by calling ", count := [ 3, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Func := "MakeImmutable" ), content := 0, count := [ 3, 1, 2, 4 ], mathmode := "Text", name := "Ref", next := 20271, root := ~, start := 20229, stop := 20270 ), rec( content := " on the\\ n digraph.\n ", count := [ 3, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 2, 3 ], mathmode := "Text", name := "Description", next := 20310, root := ~, start := 19809, stop := 20309 ) ], count := [ 3, 1, 2, 1 ], mathmode := "Text", name := "ManSection", next := 20324, root := ~, start := 19744, stop := 20323 ), rec( content := "\n\n ", count := [ 3, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Name := "IsImmutableDigr\ aph", Type := "Category" ), content := 0, count := [ 3, 1, 3, 2 ], mathmode := "Text", name := "Filt", next := 20394, root := ~, start := 20345, stop := 20393 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sImmutableDigraph", count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "C", next := 20440, root := ~, start := 20415, stop := 20439 ), rec( content := " is a su\ bcategory of ", count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsDigra\ ph" ), content := 0, count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "Ref", next := 20485, root := ~, start := 20461, stop := 20484 ), rec( content := ".\n D\ igraphs that lie in ", count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sImmutableDigraph", count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "C", next := 20537, root := ~, start := 20512, stop := 20536 ), rec( content := " are imm\ utable and\n attribute-storing. In particular, they lie in\n ", count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Filt := "IsAttributeStoringRep" ), content := 0, count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "Ref", next := 20661, root := ~, start := 20610, stop := 20660 ), rec( content := ". ", count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 3, 4 ], mathmode := "Text", name := "P", next := 20667, root := ~, start := 20663, stop := 20666 ), rec( content := "\n\n \ A mutable digraph may be converted to an immutable\n digraph that lies in t\ he category ", count := [ 3, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sImmutableDigraph", count := [ 3, 1, 3, 4 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 3, 1, 3, 4 ], mathmode := "Text", name := "C", next := 20787, root := ~, start := 20762, stop := 20786 ), rec( content := " by call\ ing\n ", count := [ 3, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Func := "MakeImmutable" ), content := 0, count := [ 3, 1, 3, 4 ], mathmode := "Text", name := "Ref", next := 20845, root := ~, start := 20803, stop := 20844 ), rec( content := " on the \ digraph.", count := [ 3, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 3, 5 ], mathmode := "Text", name := "P", next := 20865, root := ~, start := 20861, stop := 20864 ), rec( content := "\n\n \ The operation ", count := [ 3, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ MutableCopy" ), content := 0, count := [ 3, 1, 3, 5 ], mathmode := "Text", name := "Ref", next := 20917, root := ~, start := 20885, stop := 20916 ), rec( content := " can be \ used\n to construct a mutable copy of an immutable digraph. It is however n\ ot\n possible to convert an immutable digraph into a mutable digraph in-pla\ ce.\n ", count := [ 3, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 3, 3 ], mathmode := "Text", name := "Description", next := 21099, root := ~, start := 20397, stop := 21098 ) ], count := [ 3, 1, 3, 1 ], mathmode := "Text", name := "ManSection", next := 21113, root := ~, start := 20330, stop := 21112 ), rec( content := "\n\n ", count := [ 3, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Name := "IsCayleyDigraph\ ", Type := "Category" ), content := 0, count := [ 3, 1, 4, 2 ], mathmode := "Text", name := "Filt", next := 21180, root := ~, start := 21134, stop := 21179 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sCayleyDigraph", count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "C", next := 21223, root := ~, start := 21201, stop := 21222 ), rec( content := " is a su\ bcategory of ", count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraph", count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "C", next := 21260, root := ~, start := 21244, stop := 21259 ), rec( content := ". Digrap\ hs that\n are Cayley digraphs of a group and that are constructed by the op\ eration\n ", count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "CayleyD\ igraph" ), content := 0, count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "Ref", next := 21384, root := ~, start := 21357, stop := 21383 ), rec( content := " are con\ structed in this category, and are\n always immutable.\n ", count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "Description", next := 21467, root := ~, start := 21183, stop := 21466 ) ], count := [ 3, 1, 4, 1 ], mathmode := "Text", name := "ManSection", next := 21481, root := ~, start := 21119, stop := 21480 ), rec( content := "\n\n ", count := [ 3, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Name := "IsDigraphWithAd\ jacencyFunction", Type := "Category" ), content := 0, count := [ 3, 1, 5, 2 ], mathmode := "Text", name := "Filt", next := 21563, root := ~, start := 21502, stop := 21562 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphWithAdjacencyFunction", count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "C", next := 21621, root := ~, start := 21584, stop := 21620 ), rec( content := " is a su\ bcategory of ", count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraph", count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "C", next := 21658, root := ~, start := 21642, stop := 21657 ), rec( content := ".\n D\ igraphs that are ", count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ reated", count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "E", next := 21696, root := ~, start := 21682, stop := 21695 ), rec( content := " using a\ n adjacency function are constructed\n in this category.\n ", count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "Description", next := 21779, root := ~, start := 21566, stop := 21778 ) ], count := [ 3, 1, 5, 1 ], mathmode := "Text", name := "ManSection", next := 21793, root := ~, start := 21487, stop := 21792 ), rec( content := "\n\n ", count := [ 3, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Name := "DigraphByOutNei\ ghboursType" ), content := 0, count := [ 3, 1, 6, 2 ], mathmode := "Text", name := "Var", next := 21854, root := ~, start := 21814, stop := 21853 ), rec( attributes := rec( Name := "DigraphFamily" ), content := 0, count := [ 3, 1, 6, 4 ], mathmode := "Text", name := "Fam", next := 21884, root := ~, start := 21857, stop := 21883 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ type of all digraphs is ", count := [ 3, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphByOutNeighboursType", count := [ 3, 1, 6, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 1, 6, 5 ], mathmode := "Text", name := "C", next := 21966, root := ~, start := 21933, stop := 21965 ), rec( content := ".\n T\ he family of all digraphs is ", count := [ 3, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphFamily", count := [ 3, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 6, 5 ], mathmode := "Text", name := "C", next := 22022, root := ~, start := 22002, stop := 22021 ), rec( content := ".\n ", count := [ 3, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 6, 5 ], mathmode := "Text", name := "Description", next := 22040, root := ~, start := 21887, stop := 22039 ) ], count := [ 3, 1, 6, 1 ], mathmode := "Text", name := "ManSection", next := 22054, root := ~, start := 21799, stop := 22053 ), rec( content := "\n\n ", count := [ 3, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt,] obj[, so\ urce, range]", Name := "Digraph" ), content := 0, count := [ 3, 1, 7, 2 ], mathmode := "Text", name := "Oper", next := 22136, root := ~, start := 22075, stop := 22135 ), rec( attributes := rec( Arg := "[filt,] list, fu\ nc", Label := "for a list and function", Name := "Digraph" ), content := 0, count := [ 3, 1, 7, 4 ], mathmode := "Text", name := "Oper", next := 22229, root := ~, start := 22139, stop := 22228 ), rec( attributes := rec( Arg := "[filt,] G, list,\ act, adj", Label := "for a group, list, function, and function", Name := "Digraph" ), content := 0, count := [ 3, 1, 7, 6 ], mathmode := "Text", name := "Oper", next := 22346, root := ~, start := 22232, stop := 22345 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "Returns", next := 22378, root := ~, start := 22349, stop := 22377 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ the optional first argument ", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "A", next := 22441, root := ~, start := 22430, stop := 22440 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "A", next := 22587, root := ~, start := 22576, stop := 22586 ), rec( content := " is ", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "Ref", next := 22621, root := ~, start := 22591, stop := 22620 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "A", next := 22689, root := ~, start := 22678, stop := 22688 ), rec( content := " is ", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "Ref", next := 22729, root := ~, start := 22693, stop := 22728 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "A", next := 22814, root := ~, start := 22803, stop := 22813 ), rec( content := " is not \ present, then ", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "Ref", next := 22872, root := ~, start := 22836, stop := 22871 ), rec( content := " is used\ by default.\n ", count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "for a list (i.e. an adjacency list)", coun\ t := [ 3, 1, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 8 ], name := "Mar\ k", next := 22958, root := ~, start := 22910, stop := 22957 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n if ", count := [ 3, 1, 7, 9\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ ), content := [ rec( content := "obj", count := [ 3, 1, 7, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 9 ], mathmode := \ "Text", name := "A", next := 22993, root := ~, start := 22983, stop := 22992 ) , rec( cont\ ent := " is a list of lists of positive integers in\n the range from ", coun\ t := [ 3, 1, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "1", count := [ 3, 1, 7, 9 ], \ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 9 ], math\ mode := "Text", name := "C", next := 23068, root := ~, start := 23060, stop :=\ 23067 ), rec( content := " to ", count := [ 3, 1, 7, 9 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "Length(", count := [ 3, 1, 7, 9 ], mathmode := "Text", name := "PCDATA"\ , root := ~ ), rec( attributes := rec( ), content := [ rec( content := "obj",\ count := [ 3, 1, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ],\ count := [ 3, 1, 7, 9 ], mathmode := "Text", name := "A", next := 23092, root\ := ~, start := 23082, stop := 23091 ), rec( content := ")", count := [ 3, 1, \ 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, \ 7, 9 ], mathmode := "Text", name := "C", next := 23097, root := ~, start := 23\ 072, stop := 23096 ), rec( content := ", then this function\n returns t\ he digraph with vertices\n ", count := [ 3, 1, 7, 9 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ re\ c( content := "E ^ 0 = ", count := [ 3, 1, 7, 9 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 9 ], mathmode := "Text", name :=\ "M", next := 23183, root := ~, start := 23168, stop := 23182 ), rec( attribut\ es := rec( ), content := [ rec( content := "[1 .. Length(", count := [ 3, 1, \ 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := \ rec( ), content := [ rec( content := "obj", count := [ 3, 1, 7, 9 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 9 ], mathmode\ := "Text", name := "A", next := 23209, root := ~, start := 23199, stop := 232\ 08 ), rec( content := ")]", count := [ 3, 1, 7, 9 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 9 ], mathmode := "Text", name \ := "C", next := 23215, root := ~, start := 23183, stop := 23214 ), rec( conten\ t := ",\n and edges corresponding to the entries of ", count := [ 3, 1,\ 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :=\ rec( ), content := [ rec( content := "obj", count := [ 3, 1, 7, 9 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 9 ], mathmod\ e := "Text", name := "A", next := 23277, root := ~, start := 23267, stop := 23\ 276 ), rec( content := ". ", count := [ 3, 1, 7, 9 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ \ 3, 1, 7, 10 ], mathmode := "Text", name := "P", next := 23283, root := ~, star\ t := 23279, stop := 23282 ), rec( content := "\n\n More precisely, ther\ e is an edge from vertex ", count := [ 3, 1, 7, 10 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "i", count := [ 3, 1, 7, 10 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 3, 1, 7, 10 ], mathmode := "Text", name := "C", next :=\ 23346, root := ~, start := 23338, stop := 23345 ), rec( content := " to ", coun\ t := [ 3, 1, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "j", count := [ 3, 1, 7, 10 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 10 ] , math\ mode := "Text", name := "C", next := 23358, root := ~, start := 23350, stop :=\ 23357 ), rec( content := " if and\n only if ", count := [ 3, 1, 7, 10 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "j", count := [ 3, 1, 7, 10 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 10 ], mathmode := "Text", name\ := "C", next := 23390, root := ~, start := 23382, stop := 23389 ), rec( conte\ nt := " is in ", count := [ 3, 1, 7, 10 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := re\ c( ), content := [ rec( content := "obj", count := [ 3, 1, 7, 10 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 10 ], mathmode\ := "Text", name := "A", next := 23410, root := ~, start := 23400, stop := 234\ 09 ), rec( content := "[i]", count := [ 3, 1, 7, 10 ], mathmode := "Text", nam\ e := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 10 ], mathmode := "Text", name\ := "C", next := 23417, root := ~, start := 23397, stop := 23416 ), rec( conte\ nt := "; the source of this edge is\n ", count := [ 3, 1, 7, 10 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "i", count := [ 3, 1, 7, 10 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 10 ], mathmode := "Text", name\ := "C", next := 23462, root := ~, start := 23454, stop := 23461 ), rec( conte\ nt := " and the range is ", count := [ 3, 1, 7, 10 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "j", count := [ 3, 1, 7, 10 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 3, 1, 7, 10 ], mathmode := "Text", name := "C", next :=\ 23488, root := ~, start := 23480, stop := 23487 ), rec( content := ". If ", coun\ t := [ 3, 1, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "j", count := [ 3, 1, 7, 10 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 10 ] , math\ mode := "Text", name := "C", next := 23501, root := ~, start := 23493, stop :=\ 23500 ), rec( content := " occurs in\n ", count := [ 3, 1, 7, 10 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( attributes := rec( ), content := [ rec( content := "obj", count\ := [ 3, 1, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 3, 1, 7, 10 ], mathmode := "Text", name := "A", next := 23533, root := \ ~, start := 23523, stop := 23532 ), rec( content := "[i]", count := [ 3, 1, 7,\ 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7\ , 10 ], mathmode := "Text", name := "C", next := 23540, root := ~, start := 23\ 520, stop := 23539 ), rec( content := " with multiplicity ", count := [ 3, 1, \ 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :=\ rec( ), content := [ rec( content := "k", count := [ 3, 1, 7, 10 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 10 ], mathmod\ e := "Text", name := "C", next := 23567, root := ~, start := 23559, stop := 23\ 566 ), rec( content := ", then there are ", count := [ 3, 1, 7, 10 ], mathmode\ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content\ := [ rec( content := "k", count := [ 3, 1, 7, 10 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 10 ], mathmode := "Text", name\ := "C", next := 23592, root := ~, start := 23584, stop := 23591 ), rec( conte\ nt := "\n edges from ", count := [ 3, 1, 7, 10 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "i", count := [ 3, 1, 7, 10 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 3, 1, 7, 10 ], mathmode := "Text", name := "C", next :=\ 23620, root := ~, start := 23612, stop := 23619 ), rec( content := " to ", coun\ t := [ 3, 1, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "j", count := [ 3, 1, 7, 10 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 10 ] , math\ mode := "Text", name := "C", next := 23632, root := ~, start := 23624, stop :=\ 23631 ), rec( content := ".\n ", count := [ 3, 1, 7, 10 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 9 ], name := "Item\ ", next := 23647, root := ~, start := 22965, stop := 23646 ), rec( attributes :\ = rec( ), content := [ rec( content := "for three lists", count := [ 3, 1, 7,\ 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 11 ], name := "Mar\ k", next := 23683, root := ~, start := 23655, stop := 23682 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n if ", count := [ 3, 1, 7, 1\ 2 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec\ ( ), content := [ rec( content := "obj", count := [ 3, 1, 7, 12 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 12 ], mathmode \ := "Text", name := "A", next := 23718, root := ~, start := 23708, stop := 2371\ 7 ), rec( content := " is a duplicate-free list, and ", count := [ 3, 1, 7, 12\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ ), content := [ rec( content := "source", count := [ 3, 1, 7, 12 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 12 ], mathmod\ e := "Text", name := "A", next := 23762, root := ~, start := 23749, stop := 23\ 761 ), rec( content := " and\n ", count := [ 3, 1, 7, 12 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :=\ [ rec( content := "range", count := [ 3, 1, 7, 12 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 12 ], mathmode := "Text", name\ := "A", next := 23787, root := ~, start := 23775, stop := 23786 ), rec( conte\ nt := " are lists of equal length consisting of positive integers\n in \ the list ", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "[1 .. Lengt\ h(", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~\ ), rec( attributes := rec( ), content := [ rec( content := "obj", count := [\ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := \ [ 3, 1, 7, 12 ], mathmode := "Text", name := "A", next := 23892, root := ~, st\ art := 23882, stop := 23891 ), rec( content := ")]", count := [ 3, 1, 7, 12 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 12 ] , math\ mode := "Text", name := "C", next := 23898, root := ~, start := 23866, stop :=\ 23897 ), rec( content := ", then this function\n returns a digraph wit\ h vertices\n ", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :=\ "E ^ 0 = ", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "M", next \ := 23982, root := ~, start := 23967, stop := 23981 ), rec( attributes := rec( \ ), content := [ rec( content := "[1 .. Length(", count := [ 3, 1, 7, 12 ], ma\ thmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), c\ ontent := [ rec( content := "obj", count := [ 3, 1, 7, 12 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 12 ], mathmode := "Tex\ t", name := "A", next := 24008, root := ~, start := 23998, stop := 24007 ), re\ c( content := ")]", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "C" , next\ := 24014, root := ~, start := 23982, stop := 24013 ), rec( content := ", and\ \n ", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "Length(", c\ ount := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), re\ c( attributes := rec( ), content := [ rec( content := "source", count := [ 3,\ 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3\ , 1, 7, 12 ], mathmode := "Text", name := "A", next := 24051, root := ~, start\ := 24038, stop := 24050 ), rec( content := ")", count := [ 3, 1, 7, 12 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 12 ], math\ mode := "Text", name := "C", next := 24056, root := ~, start := 24028, stop :=\ 24055 ), rec( content := " edges. For each ", count := [ 3, 1, 7, 12 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "i", count := [ 3, 1, 7, 12 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 12 ], mathmode := "Text", name\ := "C", next := 24082, root := ~, start := 24074, stop := 24081 ), rec( conte\ nt := " in\n ", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :=\ "[1 .. Length(", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "sou\ rce", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root := \ ~ ) ], count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "A", next := 2412\ 3, root := ~, start := 24110, stop := 24122 ), rec( content := ")]", count := \ [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :=\ [ 3, 1, 7, 12 ], mathmode := "Text", name := "C", next := 24129, root := ~, star\ t := 24094, stop := 24128 ), rec( content := " there exists an edge with sourc\ e\n vertex ", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PC\ DATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\ source[i]", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", ro\ ot := ~ ) ], count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "C", next :\ = 24194, root := ~, start := 24178, stop := 24193 ), rec( content := " and ran\ ge vertex ", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "range[i]", \ count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 3, 1, 7, 12 ], mathmode := "Text", name := "C", next := 24227, root := \ ~, start := 24212, stop := 24226 ), rec( content := ".\n See ", count :\ = [ 3, 1, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( Attr := "DigraphSource" ), content := 0, count := [ 3, 1, 7, 12\ ], mathmode := "Text", name := "Ref", next := 24268, root := ~, start := 2424\ 1, stop := 24267 ), rec( content := " and ", count := [ 3, 1, 7, 12 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "D\ igraphRange" ), content := 0, count := [ 3, 1, 7, 12 ], mathmode := "Text", name\ := "Ref", next := 24299, root := ~, start := 24273, stop := 24298 ), rec( cont\ ent := ".\n ", count := [ 3, 1, 7, 12 ], mathmode := "Text", name := "P\ CDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1\ , 7, 13 ], mathmode := "Text", name := "P", next := 24313, root := ~, start :=\ 24309, stop := 24312 ), rec( content := "\n\n The vertices of the digr\ aph will be labelled by the elements of\n ", count := [ 3, 1, 7, 13 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "obj", count := [ 3, 1, 7, 13 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 13 ], mathmode := "Text", name\ := "A", next := 24405, root := ~, start := 24395, stop := 24404 ), rec( conte\ nt := ".\n ", count := [ 3, 1, 7, 13 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 3, 1, 7, 12 ], name := "Item", next := 24420, root := ~, start := 236\ 90, stop := 24419 ), rec( attributes := rec( ), content := [ rec( content := \ "for an integer, and two lists", count := [ 3, 1, 7, 14 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 14 ], name := "Mark", next := 2447\ 0, root := ~, start := 24428, stop := 24469 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n if ", count := [ 3, 1, 7, 15 ], mathmode := "Text", name := \ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :\ = "obj", count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "A", next := 2\ 4505, root := ~, start := 24495, stop := 24504 ), rec( content := " is an inte\ ger, and ", count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "source", co\ unt := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 3, 1, 7, 15 ], mathmode := "Text", name := "A", next := 24538, root := \ ~, start := 24525, stop := 24537 ), rec( content := " and\n ", count :=\ [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "range", count := [ 3, 1, 7, 1\ 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, \ 15 ], mathmode := "Text", name := "A", next := 24563, root := ~, start := 2455\ 1, stop := 24562 ), rec( content := " are lists of equal length consisting of \ positive integers\n in the list ", count := [ 3, 1, 7, 15 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :\ = [ rec( content := "[1 .. ", count := [ 3, 1, 7, 15 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( con\ tent := "obj", count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA",\ root := ~ ) ], count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "A", nex\ t := 24661, root := ~, start := 24651, stop := 24660 ), rec( content := "]", c\ ount := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 3, 1, 7, 15 ], mathmode := "Text", name := "C", next := 24666, root := \ ~, start := 24642, stop := 24665 ), rec( content := ", then this function\n \ returns a digraph with vertices\n ", count := [ 3, 1, 7, 15 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "E ^ 0 = ", count := [ 3, 1, 7, 15 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 15 ], mathmode := "T\ ext", name := "M", next := 24750, root := ~, start := 24735, stop := 24749 ), rec( attr\ ibutes := rec( ), content := [ rec( content := "[1 .. ", count := [ 3, 1, 7, \ 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "obj", count := [ 3, 1, 7, 15 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 15 ], mathmode\ := "Text", name := "A", next := 24769, root := ~, start := 24759, stop := 247\ 68 ), rec( content := "]", count := [ 3, 1, 7, 15 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 15 ], mathmode := "Text", name\ := "C", next := 24774, root := ~, start := 24750, stop := 24773 ), rec( conte\ nt := ", and\n ", count := [ 3, 1, 7, 15 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "Length(", count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA", \ root := ~ ), rec( attributes := rec( ), content := [ rec( content := "source"\ , count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) \ ], count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "A", next := 24811, r\ oot := ~, start := 24798, stop := 24810 ), rec( content := ")", count := [ 3, \ 1, 7, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3,\ 1, 7, 15 ], mathmode := "Text", name := "C", next := 24816, root := ~, start \ := 24788, stop := 24815 ), rec( content := " edges. For each ", count := [ 3,\ 1, 7, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribute\ s := rec( ), content := [ rec( content := "i", count := [ 3, 1, 7, 15 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 15 ], math\ mode := "Text", name := "C", next := 24842, root := ~, start := 24834, stop :=\ 24841 ), rec( content := " in\n ", count := [ 3, 1, 7, 15 ], mathmode \ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content \ := [ rec( content := "[1 .. Length(", count := [ 3, 1, 7, 15 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ \ rec( content := "source", count := [ 3, 1, 7, 15 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 15 ], mathmode := "Text", name \ := "A", next := 24883, root := ~, start := 24870, stop := 24882 ), rec( conten\ t := ")]", count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "C", next :=\ 24889, root := ~, start := 24854, stop := 24888 ), rec( content := " there ex\ ists an edge with source\n vertex ", count := [ 3, 1, 7, 15 ], mathmode\ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content\ := [ rec( content := "source[i]", count := [ 3, 1, 7, 15 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 15 ], mathmode := "Tex\ t", name := "C", next := 24954, root := ~, start := 24938, stop := 24953 ), rec( cont\ ent := " and range vertex ", count := [ 3, 1, 7, 15 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "range[i]", count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "C", next\ := 24987, root := ~, start := 24972, stop := 24986 ), rec( content := ".\n \ See ", count := [ 3, 1, 7, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( Attr := "DigraphSource" ), content := 0, coun\ t := [ 3, 1, 7, 15 ], mathmode := "Text", name := "Ref", next := 25028, root :\ = ~, start := 25001, stop := 25027 ), rec( content := " and ", count := [ 3, 1\ , 7, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes \ := rec( Attr := "DigraphRange" ), content := 0, count := [ 3, 1, 7, 15 ], math\ mode := "Text", name := "Ref", next := 25059, root := ~, start := 25033, stop \ := 25058 ), rec( content := ".\n ", count := [ 3, 1, 7, 15 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 15 ], name := "Ite\ m", next := 25074, root := ~, start := 24477, stop := 25073 ), rec( attributes :\ = rec( ), content := [ rec( content := "for a list and a function", count := [ \ 3, 1, 7, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 16 ], name := "Mar\ k", next := 25120, root := ~, start := 25082, stop := 25119 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n if ", count := [ 3, 1, 7, 1\ 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec\ ( ), content := [ rec( content := "list", count := [ 3, 1, 7, 17 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 17 ], mathmode\ := "Text", name := "A", next := 25156, root := ~, start := 25145, stop := 251\ 55 ), rec( content := " is a list and ", count := [ 3, 1, 7, 17 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :=\ [ rec( content := "func", count := [ 3, 1, 7, 17 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 17 ], mathmode := "Text", name\ := "A", next := 25182, root := ~, start := 25171, stop := 25181 ), rec( conte\ nt := " is a function taking 2\n arguments that are elements of ", coun\ t := [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "list", count := [ 3, 1, 7, 17\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 1\ 7 ], mathmode := "Text", name := "A", next := 25256, root := ~, start := 25245 , stop\ := 25255 ), rec( content := ", and ", count := [ 3, 1, 7, 17 ], mathmode := "\ Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ \ rec( content := "func", count := [ 3, 1, 7, 17 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 17 ], mathmode := "Text", name :=\ "A", next := 25273, root := ~, start := 25262, stop := 25272 ), rec( content \ := " returns\n ", count := [ 3, 1, 7, 17 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "true", count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "K", next :=\ 25301, root := ~, start := 25290, stop := 25300 ), rec( content := " or ", coun\ t := [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "false", count := [ 3, 1, 7, 1\ 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, \ 17 ], mathmode := "Text", name := "K", next := 25317, root := ~, start := 2530\ 5, stop := 25316 ), rec( content := ", then this operation creates a digraph w\ ith\n vertices ", count := [ 3, 1, 7, 17 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "[1 .. Length(", count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDATA", root := \ ~ ) ], count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "A", next := 2540\ 6, root := ~, start := 25395, stop := 25405 ), rec( content := ")]", count := \ [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :=\ [ 3, 1, 7, 17 ], mathmode := "Text", name := "C", next := 25412, root := ~, star\ t := 25379, stop := 25411 ), rec( content := " and an edge from vertex\n \ ", count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~\ ), rec( attributes := rec( ), content := [ rec( content := "i", count := [ 3\ , 1, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ \ 3, 1, 7, 17 ], mathmode := "Text", name := "C", next := 25453, root := ~, star\ t := 25445, stop := 25452 ), rec( content := " to vertex ", count := [ 3, 1, 7\ , 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "j", count := [ 3, 1, 7, 17 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 17 ], mathmode :\ = "Text", name := "C", next := 25472, root := ~, start := 25464, stop := 25471\ ), rec( content := " if and only if\n ", count := [ 3, 1, 7, 17 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( attributes := rec( ), content := [ rec( content := "func", coun\ t := [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], cou\ nt := [ 3, 1, 7, 17 ], mathmode := "Text", name := "A", next := 25510, root :=\ ~, start := 25499, stop := 25509 ), rec( content := "(", count := [ 3, 1, 7, \ 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "list", count := [ 3, 1, 7, 17 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 17 ], mathmod\ e := "Text", name := "A", next := 25522, root := ~, start := 25511, stop := 25\ 521 ), rec( content := "[i], ", count := [ 3, 1, 7, 17 ], mathmode := "Text", \ name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( c\ ontent := "list", count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "A", \ next := 25538, root := ~, start := 25527, stop := 25537 ), rec( content := "[j\ ])", count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~\ ) ], count := [ 3, 1, 7, 17 ], mathmode := "Text", name := "C", next := 25546 , root\ := ~, start := 25496, stop := 25545 ), rec( content := " returns ", count := [ \ 3, 1, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "true", count := [ 3, 1, 7, 17 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 17 ] , math\ mode := "Text", name := "K", next := 25566, root := ~, start := 25555, stop :=\ 25565 ), rec( content := ".\n ", count := [ 3, 1, 7, 17 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 17 ], name := "Ite\ m", next := 25581, root := ~, start := 25127, stop := 25580 ), rec( attributes :\ = rec( ), content := [ rec( content := "for a group, a list, and two function\ s", count := [ 3, 1, 7, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 18 ], name := "Mar\ k", next := 25640, root := ~, start := 25589, stop := 25639 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n The arguments will be ", coun\ t := [ 3, 1, 7, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "G, list, act, adj", count := \ [ 3, 1, 7, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :=\ [ 3, 1, 7, 19 ], mathmode := "Text", name := "A", next := 25708, root := ~, star\ t := 25684, stop := 25707 ), rec( content := ". ", count := [ 3, 1, 7, 19 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := 0, count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "P", next := 2\ 5714, root := ~, start := 25710, stop := 25713 ), rec( content := "\n\n \ Let ", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ), rec( attributes := rec( ), content := [ rec( content := "G", count := \ [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :=\ [ 3, 1, 7, 20 ], mathmode := "Text", name := "A", next := 25736, root := ~, star\ t := 25728, stop := 25735 ), rec( content := " be a group acting on the object\ s in ", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ), rec( attributes := rec( ), content := [ rec( content := "list", count \ := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count\ := [ 3, 1, 7, 20 ], mathmode := "Text", name := "A", next := 25784, root := ~ , star\ t := 25773, stop := 25783 ), rec( content := " via\n the action ", coun\ t := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "act", count := [ 3, 1, 7, 20 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 20\ ], mathmode := "Text", name := "A", next := 25818, root := ~, start := 25808, stop\ := 25817 ), rec( content := ", and let ", count := [ 3, 1, 7, 20 ], mathmode \ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content \ := [ rec( content := "adj", count := [ 3, 1, 7, 20 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 20 ], mathmode := "Text", name\ := "A", next := 25838, root := ~, start := 25828, stop := 25837 ), rec( conte\ nt := " be a function taking\n two objects from ", count := [ 3, 1, 7, \ 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "list", count := [ 3, 1, 7, 20 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 20 ], mathmod\ e := "Text", name := "A", next := 25896, root := ~, start := 25885, stop := 25\ 895 ), rec( content := " as arguments and returning ", count := [ 3, 1, 7, 20 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "true", count := [ 3, 1, 7, 20 ], mathmode := "Text",\ name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 20 ], mathmode := "Text" , name\ := "C", next := 25935, root := ~, start := 25924, stop := 25934 ), rec( conte\ nt := " or\n ", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :=\ "false", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "C", next := \ 25959, root := ~, start := 25947, stop := 25958 ), rec( content := ". The func\ tion ", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ), rec( attributes := rec( ), content := [ rec( content := "adj", count :\ = [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count \ := [ 3, 1, 7, 20 ], mathmode := "Text", name := "A", next := 25984, root := ~, star\ t := 25974, stop := 25983 ), rec( content := " will describe the adjacency\n \ between objects from ", count := [ 3, 1, 7, 20 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "list", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "A", next\ := 26053, root := ~, start := 26042, stop := 26052 ), rec( content := ", whic\ h is invariant under the action of\n ", count := [ 3, 1, 7, 20 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "G", count := [ 3, 1, 7, 20 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 20 ], mathmode := "Text", name\ := "A", next := 26110, root := ~, start := 26102, stop := 26109 ), rec( conte\ nt := ". This variant of the constructor returns a digraph with\n verti\ ces the objects of ", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "P\ CDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := \ "list", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ) ], count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "A", next := 26\ 210, root := ~, start := 26199, stop := 26209 ), rec( content := " and directe\ d edges ", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "[x, y]", co\ unt := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 3, 1, 7, 20 ], mathmode := "Text", name := "C", next := 26243, root := \ ~, start := 26230, stop := 26242 ), rec( content := "\n when ", count :\ = [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "f(x, y)", count := [ 3, 1, 7,\ 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7\ , 20 ], mathmode := "Text", name := "C", next := 26271, root := ~, start := 26\ 257, stop := 26270 ), rec( content := " is ", count := [ 3, 1, 7, 20 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conte\ nt := [ rec( content := "true", count := [ 3, 1, 7, 20 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 20 ], mathmode := "Text", name\ := "C", next := 26286, root := ~, start := 26275, stop := 26285 ), rec( conte\ nt := ". ", count := [ 3, 1, 7, 20 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 7, 21 ], math\ mode := "Text", name := "P", next := 26292, root := ~, start := 26288, stop :=\ 26291 ), rec( content := "\n\n The action of the group ", count := [ 3\ , 1, 7, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := [ rec( content := "G", count := [ 3, 1, 7, 21 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 21 ], math\ mode := "Text", name := "A", next := 26334, root := ~, start := 26326, stop :=\ 26333 ), rec( content := " on the objects in ", count := [ 3, 1, 7, 21 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "list", count := [ 3, 1, 7, 21 ], mathmode := "Text",\ name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 21 ], mathmode := "Text" , name\ := "A", next := 26364, root := ~, start := 26353, stop := 26363 ), rec( conte\ nt := " is stored\n in the attribute ", count := [ 3, 1, 7, 21 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := \ "DigraphGroup" ), content := 0, count := [ 3, 1, 7, 21 ], mathmode := "Text", name\ := "Ref", next := 26426, root := ~, start := 26400, stop := 26425 ), rec( cont\ ent := ", and is used to speed up\n operations like ", count := [ 3, 1,\ 7, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Attr := "DigraphDiameter" ), content := 0, count := [ 3, 1, 7, 21 ], math\ mode := "Text", name := "Ref", next := 26505, root := ~, start := 26476, stop \ := 26504 ), rec( content := ".\n ", count := [ 3, 1, 7, 21 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 19 ], name := "Ite\ m", next := 26520, root := ~, start := 25647, stop := 26519 ), rec( attributes :\ = rec( ), content := [ rec( content := "for a Grape package graph", count := [ \ 3, 1, 7, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 22 ], name := "Mar\ k", next := 26566, root := ~, start := 26528, stop := 26565 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n if ", count := [ 3, 1, 7, 2\ 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec\ ( ), content := [ rec( content := "obj", count := [ 3, 1, 7, 23 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 23 ], mathmode \ := "Text", name := "A", next := 26601, root := ~, start := 26591, stop := 2660\ 0 ), rec( content := " is a ", count := [ 3, 1, 7, 23 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content :=\ [ rec( attributes := rec( Text := "Grape" ), content := [ rec( content := "ht\ tp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ 3, 1, 7, 23 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 23 ], mathmod\ e := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ] , coun\ t := [ 3, 1, 7, 23 ], name := "Alt", next := 93, root := ~, start := 1, stop :\ = 92 ), rec( attributes := rec( Only := "Text" ), content := [ rec( attributes\ := rec( ), content := [ rec( content := "Grape", count := [ 3, 1, 7, 23 ], n\ ame := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 23 ], name := "Package", n\ ext := 137, root := ~, start := 113, stop := 136 ) ], count := [ 3, 1, 7, 23 ] , math\ mode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 14\ 2 ), rec( content := " package graph (i.e. a record for which the\n fun\ ction ", count := [ 3, 1, 7, 23 ], mathmode := "Text", name := "PCDATA", root \ := ~ ), rec( attributes := rec( ), content := [ rec( content := "IsGraph", co\ unt := [ 3, 1, 7, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 3, 1, 7, 23 ], mathmode := "Text", name := "C", next := 26689, root := \ ~, start := 26675, stop := 26688 ), rec( content := " returns ", count := [ 3,\ 1, 7, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribute\ s := rec( ), content := [ rec( content := "true", count := [ 3, 1, 7, 23 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 23 ], math\ mode := "Text", name := "K", next := 26709, root := ~, start := 26698, stop :=\ 26708 ), rec( content := "), then this function returns\n a digraph is\ omorphic to ", count := [ 3, 1, 7, 23 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "obj", count\ := [ 3, 1, 7, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 3, 1, 7, 23 ], mathmode := "Text", name := "A", next := 26781, root := \ ~, start := 26771, stop := 26780 ), rec( content := ".\n ", count := [ 3,\ 1, 7, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 23 ], name := "Ite\ m", next := 26796, root := ~, start := 26573, stop := 26795 ), rec( attributes :\ = rec( ), content := [ rec( content := "for a binary relation", count := [ 3,\ 1, 7, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 24 ], name := "Mar\ k", next := 26838, root := ~, start := 26804, stop := 26837 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n if ", count := [ 3, 1, 7, 2\ 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec\ ( ), content := [ rec( content := "obj", count := [ 3, 1, 7, 25 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 25 ], mathmode \ := "Text", name := "A", next := 26873, root := ~, start := 26863, stop := 2687\ 2 ), rec( content := " is a binary relation on the points ", count := [ 3, 1, \ 7, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :=\ rec( ), content := [ rec( content := "[1 .. n]", count := [ 3, 1, 7, 25 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 25 ], math\ mode := "Text", name := "C", next := 26924, root := ~, start := 26909, stop :=\ 26923 ), rec( content := " for\n some posititve integer ", count := [ \ 3, 1, 7, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "n", count := [ 3, 1, 7, 25 ], ma\ thmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 25 ], math\ mode := "Text", name := "M", next := 26968, root := ~, start := 26960, stop :=\ 26967 ), rec( content := ", then this function returns the digraph\n d\ efined by ", count := [ 3, 1, 7, 25 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "obj", count\ := [ 3, 1, 7, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 3, 1, 7, 25 ], mathmode := "Text", name := "A", next := 27038, root := \ ~, start := 27028, stop := 27037 ), rec( content := ". Specifically, this func\ tion returns a digraph\n which has ", count := [ 3, 1, 7, 25 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conten\ t := [ rec( content := "n", count := [ 3, 1, 7, 25 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 25 ], mathmode := "Text", name\ := "M", next := 27112, root := ~, start := 27104, stop := 27111 ), rec( conte\ nt := " vertices, and which has an edge with source ", count := [ 3, 1, 7, 25 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "i", count := [ 3, 1, 7, 25 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 25 ], mathmode := "Text", name\ := "C", next := 27165, root := ~, start := 27157, stop := 27164 ), rec( conte\ nt := "\n and range ", count := [ 3, 1, 7, 25 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "j", count := [ 3, 1, 7, 25 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 3, 1, 7, 25 ], mathmode := "Text", name := "C", next :=\ 27192, root := ~, start := 27184, stop := 27191 ), rec( content := " if and o\ nly if ", count := [ 3, 1, 7, 25 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "[i,j]", cou\ nt := [ 3, 1, 7, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 3, 1, 7, 25 ], mathmode := "Text", name := "C", next := 27220, root := \ ~, start := 27208, stop := 27219 ), rec( content := " is a pair in\n th\ e binary relation ", count := [ 3, 1, 7, 25 ], mathmode := "Text", name := "PC\ DATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\ obj", count := [ 3, 1, 7, 25 ], mathmode := "Text", name := "PCDATA", root := \ ~ ) ], count := [ 3, 1, 7, 25 ], mathmode := "Text", name := "A", next := 2727\ 2, root := ~, start := 27262, stop := 27271 ), rec( content := ".\n ", coun\ t := [ 3, 1, 7, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 25 ], name := "Ite\ m", next := 27287, root := ~, start := 26845, stop := 27286 ) ], count := [ 3, 1, 7, 8 ], mathmode := "Text", name := "List", next := 27299, root := ~, start := 22897, stop := 27298 ), rec( content := "\n\n \ ", count := [ 3, 1, 7, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([\n> [2, 5, 8, 10], [2, 3, 4, 2, 5, 6, 8, 9, 10], [1],\n> \ [3, 5, 7, 8, 10], [2, 5, 7], [3, 6, 7, 9, 10], [1, 4],\n> [1, 5, 9], [1, 2, 7,\ 8], [3, 5]]);\n\ngap> gr :\ = Digraph([\"a\", \"b\", \"c\"], [\"a\"], [\"b\"]);\n\ngap> gr := Digraph(5, [1, 2, 2, 4, 1, 1], [2, 3, 5, 5, 1, \ 1]);\n\ngap> Petersen := Grap\ h(SymmetricGroup(5), [[1, 2]], OnSets,\n> function(x, y) return Intersection(x\ , y) = []; end);;\ngap> Digraph(Petersen);\n\ngap> gr := Digraph([1 .. 10], ReturnTrue);\n", count := [ 3, 1, 7, 28 ], name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 28 ], mathmode := "Text", name := "Example", next := 28041, root := ~, start := 27305, stop := 28040 ), rec( content := "\n\n \ The next example illustrates the uses of the fourth and fifth variants of\n \ this constructor. The resulting digraph is a strongly regular graph, and\ \n it is actually the point graph of the van Lint-Schrijver partial\n \ geometry, ", count := [ 3, 1, 7, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "vLS81" ) , content := 0, count := [ 3, 1, 7, 29 ], mathmode := "Text", name := "Cite", next := 28308, root := ~, start := 28289, stop := 28307 ), rec( content := ". The a\ lgebraic description\n is taken from the seminal paper of Calderbank and \ Kantor ", count := [ 3, 1, 7, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "CK86" ), content := 0, count := [ 3, 1, 7, 29 ], mathmode := "Text", name := "Cite", next := 28426, root := ~, start := 28400, stop := 28425 ), rec( content := ".\n", count := [ 3, 1, 7, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> f := GF(3 ^ 4);\nGF(3^4)\ngap> gamma := First(f, x -> Order(x) = 5);\nZ(\ 3^4)^64\ngap> L := Union([Zero(f)], List(Group(gamma)));\n[ 0*Z(3), Z(3)^0, Z(\ 3^4)^16, Z(3^4)^32, Z(3^4)^48, Z(3^4)^64 ]\ngap> omega := Union(List(L, x -> L\ ist(Difference(L, [x]), y -> x - y)));\n[ Z(3)^0, Z(3), Z(3^4)^5, Z(3^4)^7, Z(\ 3^4)^8, Z(3^4)^13, Z(3^4)^15, \n Z(3^4)^16, Z(3^4)^21, Z(3^4)^23, Z(3^4)^24, \ Z(3^4)^29, Z(3^4)^31, \n Z(3^4)^32, Z(3^4)^37, Z(3^4)^39, Z(3^4)^45, Z(3^4)^4\ 7, Z(3^4)^48, \n Z(3^4)^53, Z(3^4)^55, Z(3^4)^56, Z(3^4)^61, Z(3^4)^63, Z(3^4\ )^64, \n Z(3^4)^69, Z(3^4)^71, Z(3^4)^72, Z(3^4)^77, Z(3^4)^79 ]\ngap> adj :=\ function(x, y)\n> return x - y in omega;\n> end;\nfunction( x, y ) ... end\ \ngap> digraph := Digraph(AsList(f), adj);\n\ngap> group := Group(Z(3));;\ngap> act := \\*;\n\ngap> digraph := Digraph(group, List(f), act, adj);\n\n", count := [ 3, 1, 7, 30 ], name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 30 ], mathmode := "Text", name := "Example", next := 29396, root := ~, start := 28428, stop := 29395 ), rec( content := "\n ", count := [ 3, 1, 7, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 7, 7 ], mathmode := "Text", name := "Description", next := 29413, root := ~, start := 22381, stop := 29412 ) ], count := [ 3, 1, 7, 1 ], mathmode := "Text", name := "ManSection", next := 29427, root := ~, start := 22060, stop := 29426 ), rec( content := "\n\n ", count := [ 3, 1, 7, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]list", Name := "DigraphByAdjace\ ncyMatrix" ), content := 0, count := [ 3, 1, 8, 2 ], mathmode := "Text", name := "Oper", next := 29506, root := ~, start := 29448, stop := 29505 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "Returns", next := 29538, root := ~, start := 29509, stop := 29537 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ the optional first argument ", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "A", next := 29601, root := ~, start := 29590, stop := 29600 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "A", next := 29747, root := ~, start := 29736, stop := 29746 ), rec( content := " is ", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "Ref", next := 29781, root := ~, start := 29751, stop := 29780 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "A", next := 29849, root := ~, start := 29838, stop := 29848 ), rec( content := " is ", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "Ref", next := 29889, root := ~, start := 29853, stop := 29888 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "A", next := 29974, root := ~, start := 29963, stop := 29973 ), rec( content := " is not \ present, then ", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "Ref", next := 30032, root := ~, start := 29996, stop := 30031 ), rec( content := " is used\ by default.", count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "P", next := 30056, root := ~, start := 30052, stop := 30055 ), rec( content := "\n\n \ If ", count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "A", next := 30076, root := ~, start := 30065, stop := 30075 ), rec( content := " is the \ adjacency matrix of a digraph in the sense of\n ", count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Adjacen\ cyMatrix" ), content := 0, count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "Ref", next := 30163, root := ~, start := 30134, stop := 30162 ), rec( content := ", then t\ his operation returns the digraph\n which is defined by ", count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "A", next := 30240, root := ~, start := 30229, stop := 30239 ), rec( content := ". ", count := [ 3, 1, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "P", next := 30246, root := ~, start := 30242, stop := 30245 ), rec( content := "\n\n \ Alternatively, if ", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "A", next := 30281, root := ~, start := 30270, stop := 30280 ), rec( content := " is a sq\ uare boolean matrix, then this\n operation returns the digraph with ", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "L\ ength(", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "C", next := 30373, root := ~, start := 30359, stop := 30372 ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "A", next := 30384, root := ~, start := 30373, stop := 30383 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "C", next := 30392, root := ~, start := 30384, stop := 30391 ), rec( content := "\n ve\ rtices which has the edge ", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i,j]", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "C", next := 30437, root := ~, start := 30425, stop := 30436 ), rec( content := " if and \ only if\n ", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "A", next := 30468, root := ~, start := 30457, stop := 30467 ), rec( attributes := rec( ), content := [ rec( content := "[\ i][j]", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "C", next := 30481, root := ~, start := 30468, stop := 30480 ), rec( content := " is ", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "K", next := 30496, root := ~, start := 30485, stop := 30495 ), rec( content := ". ", count := [ 3, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 8, 6 ], mathmode := "Text", name := "P", next := 30502, root := ~, start := 30498, stop := 30501 ), rec( content := "\n\n \ ", count := [ 3, 1, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> DigraphByAdjacencyMatrix([\n> [0, 1, 0, 2, 0],\n> [1, 1, 1, 0, 1],\n> [0\ , 3, 2, 1, 1],\n> [0, 0, 1, 0, 1],\n> [2, 0, 0, 0, 0]]);\n\ngap> D := DigraphByAdjacencyMatrix([\n> [true,\ false, true],\n> [false, false, true],\n> [false, true, false]]);\n\ngap> OutNeighbours(D);\n[ [ 1, 3 ], [ 3 ],\ [ 2 ] ]\ngap> D := DigraphByAdjacencyMatrix(IsMutableDigraph, \n> [[true, fal\ se, true],\n> [false, false, true],\n> [false, true, false]]);\n\n", count := [ 3, 1, 8, 7 ], name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 7 ], mathmode := "Text", name := "Example", next := 31098, root := ~, start := 30508, stop := 31097 ), rec( content := "\n ", count := [ 3, 1, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 8, 3 ], mathmode := "Text", name := "Description", next := 31115, root := ~, start := 29541, stop := 31114 ) ], count := [ 3, 1, 8, 1 ], mathmode := "Text", name := "ManSection", next := 31129, root := ~, start := 29433, stop := 31128 ), rec( content := "\n\n ", count := [ 3, 1, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]list[, n\ ]", Name := "DigraphByEdges" ), content := 0, count := [ 3, 1, 9, 2 ], mathmode := "Text", name := "Oper", next := 31203, root := ~, start := 31150, stop := 31202 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "Returns", next := 31235, root := ~, start := 31206, stop := 31234 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ the optional first argument ", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "A", next := 31298, root := ~, start := 31287, stop := 31297 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "A", next := 31444, root := ~, start := 31433, stop := 31443 ), rec( content := " is ", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "Ref", next := 31478, root := ~, start := 31448, stop := 31477 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "A", next := 31546, root := ~, start := 31535, stop := 31545 ), rec( content := " is ", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "Ref", next := 31586, root := ~, start := 31550, stop := 31585 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "A", next := 31671, root := ~, start := 31660, stop := 31670 ), rec( content := " is not \ present, then ", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "Ref", next := 31729, root := ~, start := 31693, stop := 31728 ), rec( content := " is used\ by default.", count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "P", next := 31753, root := ~, start := 31749, stop := 31752 ), rec( content := "\n\n \ If ", count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "A", next := 31773, root := ~, start := 31762, stop := 31772 ), rec( content := " is list\ of pairs of positive integers, then this function\n returns the digraph wi\ th the minimum number of vertices ", count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "C", next := 31900, root := ~, start := 31892, stop := 31899 ), rec( content := " such th\ at\n its list equal ", count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "A", next := 31941, root := ~, start := 31930, stop := 31940 ), rec( content := ".", count := [ 3, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "P", next := 31946, root := ~, start := 31942, stop := 31945 ), rec( content := "\n\n \ If the optional second argument ", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "A", next := 31992, root := ~, start := 31984, stop := 31991 ), rec( content := " is a po\ sitive integer with\n ", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "n", count := [ 3, 1, 9, 5 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 5 ], mathmode := \ "Text", name := "A", next := 32035, root := ~, start := 32027, stop := 32034 ) , rec( content := "\ >= m", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "C", next := 32044, root := ~, start := 32024, stop := 32043 ), rec( content := " (with " , count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "C", next := 32059, root := ~, start := 32051, stop := 32058 ), rec( content := " defined\ as above),\n then this function returns the digraph with ", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "A", next := 32135, root := ~, start := 32127, stop := 32134 ), rec( content := " vertice\ s and list\n ", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "A", next := 32169, root := ~, start := 32158, stop := 32168 ), rec( content := ". ", count := [ 3, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 9, 6 ], mathmode := "Text", name := "P", next := 32175, root := ~, start := 32171, stop := 32174 ), rec( content := "\n\n \ See ", count := [ 3, 1, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Edges" ), content := 0, count := [ 3, 1, 9, 6 ], mathmode := "Text", name := "Ref", next := 32211, root := ~, start := 32185, stop := 32210 ), rec( content := ".\n\n \ ", count := [ 3, 1, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> DigraphByEdges(\n> [[1, 3], [2, 1], [2, 3], [2, 5], [3, 6],\n> [4, 6], \ [5, 2], [5, 4], [5, 6], [6, 6]]);\n\ngap> DigraphByEdges(\n> [[1, 3], [2, 1], [2, 3], [2, 5], [3, 6],\n> [4, 6\ ], [5, 2], [5, 4], [5, 6], [6, 6]], 12);\n\ngap> DigraphByEdges(IsMutableDigraph, \n> [[1, 3], [2, 1], [2, 3],\ [2, 5], [3, 6],\n> [4, 6], [5, 2], [5, 4], [5, 6], [6, 6]], 12);\n\n", count := [ 3, 1, 9, 7 ], name := "PCDAT\ A", root := ~ ) ], count := [ 3, 1, 9, 7 ], mathmode := "Text", name := "Example", next := 32741, root := ~, start := 32218, stop := 32740 ), rec( content := "\n ", count := [ 3, 1, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 9, 3 ], mathmode := "Text", name := "Description", next := 32758, root := ~, start := 31238, stop := 32757 ) ], count := [ 3, 1, 9, 1 ], mathmode := "Text", name := "ManSection", next := 32772, root := ~, start := 31135, stop := 32771 ), rec( content := "\n\n ", count := [ 3, 1, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "G, edges[, n]", Name := "EdgeOrbitsDigra\ ph" ), content := 0, count := [ 3, 1, 10, 2 ], mathmode := "Text", name := "Oper", next := 32845, root := ~, start := 32793, stop := 32844 ), rec( attributes := rec( ), content := [ rec( content := "\n An \ immutable digraph.\n ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "Returns", next := 32896, root := ~, start := 32848, stop := 32895 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "A", next := 32928, root := ~, start := 32920, stop := 32927 ), rec( content := " is a pe\ rmutation group, ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "A", next := 32965, root := ~, start := 32953, stop := 32964 ), rec( content := " is an e\ dge or list of\n edges, and ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "A", next := 33011, root := ~, start := 33003, stop := 33010 ), rec( content := " is a no\ n-negative integer such that ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "A", next := 33056, root := ~, start := 33048, stop := 33055 ), rec( content := " fixes\n\ ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 1, 10, 3 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := \ "Text", name := "A", next := 33084, root := ~, start := 33076, stop := 33083 ) , rec( content := "\ ]", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "C", next := 33089, root := ~, start := 33067, stop := 33088 ), rec( content := " setwise\ , then\n this operation returns an immutable digraph with ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "A", next := 33165, root := ~, start := 33157, stop := 33164 ), rec( content := " vertice\ s and the union\n of the orbits of the edges in ", count := [ 3, 1, 10, 3 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ edges ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "A", next := 33237, root := ~, start := 33223, stop := 33236 ), rec( content := " under t\ he action of the\n permutation group ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "A", next := 33292, root := ~, start := 33284, stop := 33291 ), rec( content := ". An ed\ ge in this context is simply a pair of\n positive integers.\n ", count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 10, 4 ], mathmode := "Text", name := "P", next := 33370, root := ~, start := 33366, stop := 33369 ), rec( content := "\n\n \ If the optional third argument ", count := [ 3, 1, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 1, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 4 ], mathmode := "Text", name := "A", next := 33415, root := ~, start := 33407, stop := 33414 ), rec( content := " is not \ present, then the largest\n moved point of the permutation group ", count := [ 3, 1, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 4 ], mathmode := "Text", name := "A", next := 33498, root := ~, start := 33490, stop := 33497 ), rec( content := " is used\ by default.", count := [ 3, 1, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 10, 5 ], mathmode := "Text", name := "P", next := 33522, root := ~, start := 33518, stop := 33521 ), rec( content := "\n\n \ ", count := [ 3, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph := EdgeOrbitsDigraph(Group((1, 3), (1, 2)(3, 4)),\n> \ [[1, 2], [4, 5]], 5);\n\ngap> OutNeighbours(digraph);\n[ [ 2, 4, 5 ], [ 1, 3, 5 ], [ 2, 4,\ 5 ], [ 1, 3, 5 ], [ ] ]\ngap> RepresentativeOutNeighbours(digraph);\n[ [ 2, \ 4, 5 ], [ ] ]\n", count := [ 3, 1, 10, 6 ], name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 6 ], mathmode := "Text", name := "Example", next := 33880, root := ~, start := 33528, stop := 33879 ), rec( content := "\n ", count := [ 3, 1, 10, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 10, 3 ], mathmode := "Text", name := "Description", next := 33897, root := ~, start := 32899, stop := 33896 ) ], count := [ 3, 1, 10, 1 ], mathmode := "Text", name := "ManSection", next := 33911, root := ~, start := 32778, stop := 33910 ), rec( content := "\n\n ", count := [ 3, 1, 10, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]list", Name := "DigraphByInNeig\ hbours" ), content := 0, count := [ 3, 1, 11, 2 ], mathmode := "Text", name := "Oper", next := 33987, root := ~, start := 33932, stop := 33986 ), rec( attributes := rec( Arg := "[filt, ]list", Name := "DigraphByInNeig\ hbors" ), content := 0, count := [ 3, 1, 11, 4 ], mathmode := "Text", name := "Oper", next := 34044, root := ~, start := 33990, stop := 34043 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "Returns", next := 34076, root := ~, start := 34047, stop := 34075 ), rec( attributes := rec( ), content := [ rec( content := "\n If th\ e optional first argument ", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "A", next := 34137, root := ~, start := 34126, stop := 34136 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph be\ ing created will\n belong to. For example, if ", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "A", next := 34279, root := ~, start := 34268, stop := 34278 ), rec( content := " is ", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "Ref", next := 34313, root := ~, start := 34283, stop := 34312 ), rec( content := ",\n the\ n the digraph being created will be mutable, if ", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "A", next := 34379, root := ~, start := 34368, stop := 34378 ), rec( content := " is ", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "Ref", next := 34417, root := ~, start := 34383, stop := 34416 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "A", next := 34500, root := ~, start := 34489, stop := 34499 ), rec( content := " is not \ present, then ", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "Ref", next := 34556, root := ~, start := 34522, stop := 34555 ), rec( content := " is used\ by default.", count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "P", next := 34580, root := ~, start := 34576, stop := 34579 ), rec( content := "\n\n If\ ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "A", next := 34598, root := ~, start := 34587, stop := 34597 ), rec( content := " is a li\ st of lists of positive integers list the range\n ", count := [ 3, 1, 11, 6 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. Length(", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "list", count := [ 3, 1, 11, 6 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := \ "Text", name := "A", next := 34683, root := ~, start := 34672, stop := 34682 ) , rec( content := "\ )]", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "C", next := 34689, root := ~, start := 34656, stop := 34688 ), rec( content := ", then t\ his function returns the\n digraph with vertices ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "E\ ^0=", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "M", next := 34757, root := ~, start := 34746, stop := 34756 ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. Length(", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "list", count := [ 3, 1, 11, 6 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := \ "Text", name := "A", next := 34784, root := ~, start := 34773, stop := 34783 ) , rec( content := "\ )]", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "C", next := 34790, root := ~, start := 34757, stop := 34789 ), rec( content := ", and\n \ edges corresponding to the entries of ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "A", next := 34847, root := ~, start := 34836, stop := 34846 ), rec( content := ". More p\ recisely, there is an\n edge with source vertex ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "C", next := 34911, root := ~, start := 34903, stop := 34910 ), rec( content := " and ran\ ge vertex ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "C", next := 34937, root := ~, start := 34929, stop := 34936 ), rec( content := " if ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "C", next := 34949, root := ~, start := 34941, stop := 34948 ), rec( content := " is list\ \n ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "list", count := [ 3, 1, 11, 6 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := \ "Text", name := "A", next := 34974, root := ~, start := 34963, stop := 34973 ) , rec( content := "\ [j]", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "C", next := 34981, root := ~, start := 34960, stop := 34980 ), rec( content := ". ", count := [ 3, 1, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "P", next := 34987, root := ~, start := 34983, stop := 34986 ), rec( content := "\n\n If\ ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "C", next := 35002, root := ~, start := 34994, stop := 35001 ), rec( content := " occurs \ list ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "list", count := [ 3, 1, 11, 7 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 7 ], mathmode := \ "Text", name := "A", next := 35029, root := ~, start := 35018, stop := 35028 ) , rec( content := "\ [j]", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "C", next := 35036, root := ~, start := 35015, stop := 35035 ), rec( content := " with mu\ ltiplicity ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "C", next := 35063, root := ~, start := 35055, stop := 35062 ), rec( content := ",\n the\ n there are ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "C", next := 35090, root := ~, start := 35082, stop := 35089 ), rec( content := " multipl\ e edges from ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "C", next := 35119, root := ~, start := 35111, stop := 35118 ), rec( content := " to ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "C", next := 35131, root := ~, start := 35123, stop := 35130 ), rec( content := ". ", count := [ 3, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 11, 8 ], mathmode := "Text", name := "P", next := 35137, root := ~, start := 35133, stop := 35136 ), rec( content := "\n\n Se\ e ", count := [ 3, 1, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "InNeigh\ bours" ), content := 0, count := [ 3, 1, 11, 8 ], mathmode := "Text", name := "Ref", next := 35171, root := ~, start := 35145, stop := 35170 ), rec( content := ".\n\n \ ", count := [ 3, 1, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphByInNeighbours([\n> [2, 5, 8, 10], [2, 3, 4, 5, 6, 8, 9, 10]\ ,\n> [1], [3, 5, 7, 8, 10], [2, 5, 7], [3, 6, 7, 9, 10], [1, 4],\n> [1, 5, 9],\ [1, 2, 7, 8], [3, 5]]);\n\ngap>\ D := DigraphByInNeighbours([[2, 3, 2], [1], [1, 2, 3]]);\n\ngap> D := DigraphByInNeighbours(IsMutableDigra\ ph, \n> [[2, 3, 2], [1], [1, 2, 3]]);\n\n", count := [ 3, 1, 11, 9 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 1, 11, 9 ], mathmode := "Text", name := "Example", next := 35707, root := ~, start := 35178, stop := 35706 ), rec( content := "\n ", count := [ 3, 1, 11, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 11, 5 ], mathmode := "Text", name := "Description", next := 35724, root := ~, start := 34079, stop := 35723 ) ], count := [ 3, 1, 11, 1 ], mathmode := "Text", name := "ManSection", next := 35738, root := ~, start := 33917, stop := 35737 ), rec( content := "\n\n ", count := [ 3, 1, 11, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "G[, gens]", Name := "CayleyDigraph" ), content := 0, count := [ 3, 1, 12, 2 ], mathmode := "Text", name := "Oper", next := 35803, root := ~, start := 35759, stop := 35802 ), rec( attributes := rec( ), content := [ rec( content := "An immuta\ ble digraph.", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "Returns", next := 35846, root := ~, start := 35806, stop := 35845 ), rec( attributes := rec( ), content := [ rec( content := "\n Let\ ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "A", next := 35879, root := ~, start := 35871, stop := 35878 ), rec( content := " be any \ group and let ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ens", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "A", next := 35912, root := ~, start := 35901, stop := 35911 ), rec( content := " be a li\ st of elements of\n ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "A", next := 35950, root := ~, start := 35942, stop := 35949 ), rec( content := ". This o\ peration returns an immutable digraph that corresponds to\n the Cayley grap\ h of ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "A", next := 36048, root := ~, start := 36040, stop := 36047 ), rec( content := " with re\ spect\n ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ens", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "A", next := 36077, root := ~, start := 36066, stop := 36076 ), rec( content := ". The ve\ rtices are the elements of ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "A", next := 36120, root := ~, start := 36112, stop := 36119 ), rec( content := ". There \ exists an edge\n from the vertex ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "C", next := 36171, root := ~, start := 36163, stop := 36170 ), rec( content := " to the \ vertex ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "C", next := 36194, root := ~, start := 36186, stop := 36193 ), rec( content := " if and \ only if there exists\n a generator ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "C", next := 36247, root := ~, start := 36239, stop := 36246 ), rec( content := " in ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ens", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "A", next := 36262, root := ~, start := 36251, stop := 36261 ), rec( content := " such th\ at ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ * g = y", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "C", next := 36289, root := ~, start := 36273, stop := 36288 ), rec( content := ". ", count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "P", next := 36295, root := ~, start := 36291, stop := 36294 ), rec( content := "\n\n \ ", count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( content := " FIXME W\ hat is the correspondence between vertices and elements? ", count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "XMLCOMMENT" , root := ~ ), rec( content := "\n\n \ If the optional second argument ", count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ens", count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "A", next := 36422, root := ~, start := 36411, stop := 36421 ), rec( content := " is not \ present, then the\n generators of ", count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "A", next := 36474, root := ~, start := 36466, stop := 36473 ), rec( content := " are use\ d by default.", count := [ 3, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "P", next := 36499, root := ~, start := 36495, stop := 36498 ), rec( content := "\n\n \ The digraph created by this operation belongs to the category ", count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsCayle\ yDigraph" ), content := 0, count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "Ref", next := 36602, root := ~, start := 36567, stop := 36601 ), rec( content := ", the gr\ oup ", count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "A", next := 36622, root := ~, start := 36614, stop := 36621 ), rec( content := " can be \ recovered from the\n digraph using ", count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "GroupOf\ CayleyDigraph" ), content := 0, count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "Ref", next := 36701, root := ~, start := 36667, stop := 36700 ), rec( content := ", and th\ e generators\n ", count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ens", count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "A", next := 36737, root := ~, start := 36726, stop := 36736 ), rec( content := " can be \ obtained using ", count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Generat\ orsOfCayleyDigraph" ), content := 0, count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "Ref", next := 36799, root := ~, start := 36760, stop := 36798 ), rec( content := ".", count := [ 3, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 1, 12, 6 ], mathmode := "Text", name := "P", next := 36804, root := ~, start := 36800, stop := 36803 ), rec( content := "\n\n \ Note that this function can only return an immutable digraph.\n\n ", count := [ 3, 1, 12, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> G := DihedralGroup(8);\n\ngap> Cay\ leyDigraph(G);\n\ngap> G := Dihed\ ralGroup(IsPermGroup, 8);\nGroup([ (1,2,3,4), (2,4) ])\ngap> CayleyDigraph(G);\ \n\ngap> digraph := CayleyDigraph\ (G, [()]);\n\ngap> GroupOfCayleyDi\ graph(digraph) = G;\ntrue\ngap> GeneratorsOfCayleyDigraph(digraph);\n[ () ]", count := [ 3, 1, 12, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 1, 12, 7 ], mathmode := "Text", name := "Example", next := 37360, root := ~, start := 36877, stop := 37359 ), rec( content := "\n ", count := [ 3, 1, 12, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 12, 3 ], mathmode := "Text", name := "Description", next := 37377, root := ~, start := 35849, stop := 37376 ) ], count := [ 3, 1, 12, 1 ], mathmode := "Text", name := "ManSection", next := 37391, root := ~, start := 35744, stop := 37390 ), rec( content := "\n\n ", count := [ 3, 1, 12, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 1, 0, 1 ], mathmode := "Text", name := "Section", next := 37405, root := ~, start := 19345, stop := 37404 ), rec( content := "\n\n ", count := [ 3, 1, 12, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Changing represen\ tations", count := [ 3, 2, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 0, 2 ], mathmode := "Text", name := "Heading", next := 37461, root := ~, start := 37418, stop := 37460 ), rec( content := "\n ", count := [ 3, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "AsBinaryRelatio\ n" ), content := 0, count := [ 3, 2, 1, 2 ], mathmode := "Text", name := "Oper", next := 37526, root := ~, start := 37481, stop := 37525 ), rec( attributes := rec( ), content := [ rec( content := "A binary \ relation.", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "Returns", next := 37566, root := ~, start := 37529, stop := 37565 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "A", next := 37604, root := ~, start := 37590, stop := 37603 ), rec( content := " is a di\ graph with a positive number of vertices\n ", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "M", next := 37665, root := ~, start := 37657, stop := 37664 ), rec( content := ", and no\ multiple edges, then this operation returns a binary\n relation on the poi\ nts ", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1..n]", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "C", next := 37767, root := ~, start := 37754, stop := 37766 ), rec( content := ".\n T\ he pair ", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i,j]", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "C", next := 37794, root := ~, start := 37782, stop := 37793 ), rec( content := " is in t\ he binary relation if and only if\n ", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i,j]", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "C", next := 37852, root := ~, start := 37840, stop := 37851 ), rec( content := " is an e\ dge in ", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "A", next := 37881, root := ~, start := 37867, stop := 37880 ), rec( content := ".\n " , count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 2, 1, 4 ], mathmode := "Text", name := "P", next := 37891, root := ~, start := 37887, stop := 37890 ), rec( content := "\n", count := [ 3, 2, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3, 2], [1, 2], [2], [3, 4]]);\n\ngap> AsBinaryRelation(D);\nBinary Relation on 4 points\n", count := [ 3, 2, 1, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 2, 1, 5 ], mathmode := "Text", name := "Example", next := 38073, root := ~, start := 37892, stop := 38072 ), rec( content := "\n ", count := [ 3, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 1, 3 ], mathmode := "Text", name := "Description", next := 38090, root := ~, start := 37569, stop := 38089 ) ], count := [ 3, 2, 1, 1 ], mathmode := "Text", name := "ManSection", next := 38104, root := ~, start := 37466, stop := 38103 ), rec( content := "\n\n ", count := [ 3, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]trans[, \ n]", Name := "AsDigraph" ), content := 0, count := [ 3, 2, 2, 2 ], mathmode := "Text", name := "Oper", next := 38174, root := ~, start := 38125, stop := 38173 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ , or ", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "K", next := 38211, root := ~, start := 38200, stop := 38210 ), rec( content := ".", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "Returns", next := 38222, root := ~, start := 38177, stop := 38221 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ the optional first argument ", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "A", next := 38285, root := ~, start := 38274, stop := 38284 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "A", next := 38431, root := ~, start := 38420, stop := 38430 ), rec( content := " is ", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "Ref", next := 38465, root := ~, start := 38435, stop := 38464 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "A", next := 38533, root := ~, start := 38522, stop := 38532 ), rec( content := " is ", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "Ref", next := 38573, root := ~, start := 38537, stop := 38572 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "A", next := 38658, root := ~, start := 38647, stop := 38657 ), rec( content := " is not \ present, then ", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "Ref", next := 38716, root := ~, start := 38680, stop := 38715 ), rec( content := " is used\ by default.", count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "P", next := 38740, root := ~, start := 38736, stop := 38739 ), rec( content := "\n\n \ If ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rans", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "A", next := 38761, root := ~, start := 38749, stop := 38760 ), rec( content := " is a tr\ ansformation, and ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "A", next := 38795, root := ~, start := 38787, stop := 38794 ), rec( content := " is a no\ n-negative integer\n such that the restriction of ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rans", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "A", next := 38867, root := ~, start := 38855, stop := 38866 ), rec( content := " to ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 2, 2, 4 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := \ "Text", name := "A", next := 38888, root := ~, start := 38880, stop := 38887 ) , rec( content := "\ ]", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "C", next := 38893, root := ~, start := 38871, stop := 38892 ), rec( content := " defines\ \n a transformation of ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 2, 2, 4 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := \ "Text", name := "A", next := 38943, root := ~, start := 38935, stop := 38942 ) , rec( content := "\ ]", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "C", next := 38948, root := ~, start := 38926, stop := 38947 ), rec( content := ", then " , count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sDigraph", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "C", next := 38971, root := ~, start := 38955, stop := 38970 ), rec( content := "\n re\ turns the functional digraph with ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "A", next := 39020, root := ~, start := 39012, stop := 39019 ), rec( content := " vertice\ s defined by\n ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rans", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "A", next := 39057, root := ~, start := 39045, stop := 39056 ), rec( content := ". See ", count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsFunct\ ionalDigraph" ), content := 0, count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "Ref", next := 39096, root := ~, start := 39063, stop := 39095 ), rec( content := ".\n " , count := [ 3, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "P", next := 39106, root := ~, start := 39102, stop := 39105 ), rec( content := "\n\n \ Specifically, the digraph returned by ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sDigraph", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "C", next := 39166, root := ~, start := 39150, stop := 39165 ), rec( content := " has ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "A", next := 39180, root := ~, start := 39172, stop := 39179 ), rec( content := " edges:\\ n for each vertex ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "C", next := 39216, root := ~, start := 39208, stop := 39215 ), rec( content := " in ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 2, 2, 5 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 5 ], mathmode := \ "Text", name := "A", next := 39237, root := ~, start := 39229, stop := 39236 ) , rec( content := "\ ]", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "C", next := 39242, root := ~, start := 39220, stop := 39241 ), rec( content := ", there \ is a unique edge\n with source ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "C", next := 39291, root := ~, start := 39283, stop := 39290 ), rec( content := "; this e\ dge has range ", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ^", count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes :\ = rec( ), content := [ rec( content := "trans", count := [ 3, 2, 2, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 5 ], mathmode := \ "Text", name := "A", next := 39330, root := ~, start := 39318, stop := 39329 ) ], count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "C", next := 39334, root := ~, start := 39313, stop := 39333 ), rec( content := ".\n " , count := [ 3, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "P", next := 39344, root := ~, start := 39340, stop := 39343 ), rec( content := "\n\n \ If the optional second argument ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "A", next := 39390, root := ~, start := 39382, stop := 39389 ), rec( content := " is not \ supplied, then the degree of\n the transformation ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rans", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "A", next := 39462, root := ~, start := 39450, stop := 39461 ), rec( content := " is used\ by default. If the restriction of\n ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rans", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "A", next := 39522, root := ~, start := 39510, stop := 39521 ), rec( content := " to ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 2, 2, 6 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := \ "Text", name := "A", next := 39543, root := ~, start := 39535, stop := 39542 ) , rec( content := "\ ]", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "C", next := 39548, root := ~, start := 39526, stop := 39547 ), rec( content := " does no\ t define a transformation of\n ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 2, 2, 6 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := \ "Text", name := "A", next := 39606, root := ~, start := 39598, stop := 39605 ) , rec( content := "\ ]", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "C", next := 39611, root := ~, start := 39589, stop := 39610 ), rec( content := ", then " , count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sDigraph(", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "trans", count := [ 3, 2, 2, 6 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := \ "Text", name := "A", next := 39643, root := ~, start := 39631, stop := 39642 ) , rec( content := "\ , ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 2, 2, 6 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := \ "Text", name := "A", next := 39653, root := ~, start := 39645, stop := 39652 ) , rec( content := "\ )", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "C", next := 39658, root := ~, start := 39618, stop := 39657 ), rec( content := "\n re\ turns ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "K", next := 39682, root := ~, start := 39671, stop := 39681 ), rec( content := ".\n\n \ ", count := [ 3, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> f := Transformation([4, 3, 3, 1, 7, 9, 10, 4, 2, 3]);\nTransformation( [\ 4, 3, 3, 1, 7, 9, 10, 4, 2, 3 ] )\ngap> AsDigraph(f);\n\ngap> AsDigraph(f, 4);\n\ngap> AsDigraph(f, 5);\nfail\ngap> b := BinaryRelationOnPoi\ nts(\n> [[3], [1, 3, 5], [1], [1, 2, 4], [2, 3, 5]]);\nBinary Relation on 5 po\ ints\ngap> D := AsDigraph(b);\n\n\ ", count := [ 3, 2, 2, 7 ], name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 7 ], mathmode := "Text", name := "Example", next := 40175, root := ~, start := 39689, stop := 40174 ), rec( content := "\n ", count := [ 3, 2, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 2, 3 ], mathmode := "Text", name := "Description", next := 40192, root := ~, start := 38225, stop := 40191 ) ], count := [ 3, 2, 2, 1 ], mathmode := "Text", name := "ManSection", next := 40206, root := ~, start := 38110, stop := 40205 ), rec( content := "\n\n ", count := [ 3, 2, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "Graph" ), content := 0, count := [ 3, 2, 3, 2 ], mathmode := "Text", name := "Oper", next := 40261, root := ~, start := 40227, stop := 40260 ), rec( attributes := rec( ), content := [ rec( content := "A ", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 3, 2, 3, 3 ] , name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ 3, 2, 3, 3 ], name \ := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 3 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " package\ graph.", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "Returns", next := 40307, root := ~, start := 40264, stop := 40306 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "A", next := 40345, root := ~, start := 40331, stop := 40344 ), rec( content := " is a mu\ table or immutable digraph without multiple edges, then this operation\n re\ turns a ", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 3, 2, 3, 3 ] , name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ 3, 2, 3, 3 ], name \ := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 3 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " package\ graph that is isomorphic to ", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "A", next := 40496, root := ~, start := 40482, stop := 40495 ), rec( content := ". ", count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "P", next := 40502, root := ~, start := 40498, stop := 40501 ), rec( content := "\n\n \ If ", count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "A", next := 40525, root := ~, start := 40511, stop := 40524 ), rec( content := " is a mu\ ltidigraph, then since ", count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 3, 2, 3, 4 ] , name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ 3, 2, 3, 4 ], name \ := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 4 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " does no\ t support\n multiple edges, the multiple edges will be reduced to a single \ edge in the\n result. In order words, for a multidigraph this operation wil\ l return the\n same as ", count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ raph(DigraphRemoveAllMultipleEdges(", count := [ 3, 2, 3, 4 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "C", next := 40793, root := ~, start := 40750, stop := 40792 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "A", next := 40807, root := ~, start := 40793, stop := 40806 ), rec( attributes := rec( ), content := [ rec( content := ")\ )", count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "C", next := 40816, root := ~, start := 40807, stop := 40815 ), rec( content := ".\n\n \ ", count := [ 3, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> Petersen := Graph(SymmetricGroup(5), [[1, 2]], OnSets,\n> function(x, y)\ return Intersection(x, y) = []; end);;\ngap> Display(Petersen);\nrec(\n adja\ cencies := [ [ 3, 5, 8 ] ],\n group := \n Group( [ ( 1, 2, 3, 5, 7)( 4, 6, \ 8, 9,10), ( 2, 4)( 6, 9)( 7,10) \n ] ),\n isGraph := true,\n names := [ \ [ 1, 2 ], [ 2, 3 ], [ 3, 4 ], [ 1, 3 ], [ 4, 5 ], \n [ 2, 4 ], [ 1, 5 ], \ [ 3, 5 ], [ 1, 4 ], [ 2, 5 ] ],\n order := 10,\n representatives := [ 1 ],\n\ schreierVector := [ -1, 1, 1, 2, 1, 1, 1, 1, 2, 2 ] )\ngap> Digraph(Petersen\ );\n\ngap> Graph(last) = Peterse\ n;\ntrue", count := [ 3, 2, 3, 5 ], name := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 5 ], mathmode := "Text", name := "Example", next := 41469, root := ~, start := 40823, stop := 41468 ), rec( content := "\n ", count := [ 3, 2, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 3, 3 ], mathmode := "Text", name := "Description", next := 41486, root := ~, start := 40310, stop := 41485 ) ], count := [ 3, 2, 3, 1 ], mathmode := "Text", name := "ManSection", next := 41500, root := ~, start := 40212, stop := 41499 ), rec( content := "\n\n ", count := [ 3, 2, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "AsGraph" ), content := 0, count := [ 3, 2, 4, 2 ], mathmode := "Text", name := "Attr", next := 41557, root := ~, start := 41521, stop := 41556 ), rec( attributes := rec( ), content := [ rec( content := "A ", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ 3, 2, 4, 3 ] , name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ 3, 2, 4, 3 ], name \ := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " package\ graph.", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "Returns", next := 41603, root := ~, start := 41560, stop := 41602 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "A", next := 41641, root := ~, start := 41627, stop := 41640 ), rec( content := " is a di\ graph, then this method returns the same as\n ", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Graph" ), content := 0, count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "Ref", next := 41716, root := ~, start := 41697, stop := 41715 ), rec( content := ", except\ that if ", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "A", next := 41747, root := ~, start := 41733, stop := 41746 ), rec( content := " is immu\ table, then the\n result will be stored as a mutable attribute of ", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "A", next := 41837, root := ~, start := 41823, stop := 41836 ), rec( content := ".\n I\ n this latter case, when ", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sGraph(", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "C", next := 41884, root := ~, start := 41869, stop := 41883 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "A", next := 41898, root := ~, start := 41884, stop := 41897 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "C", next := 41906, root := ~, start := 41898, stop := 41905 ), rec( content := " is call\ ed\n subsequently, the same ", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " object \ will be returned as before.\n\n ", count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2], [3], []]);\n\ngap> G := AsGraph(D);\nrec( adjacencies := [ [ 1, 2 ], [ 3 ], [ ] ], \ group := Group(()), \n isGraph := true, names := [ 1 .. 3 ], order := 3, \n \ representatives := [ 1, 2, 3 ], schreierVector := [ -1, -2, -3 ] )\n", count := [ 3, 2, 4, 4 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 2, 4, 4 ], mathmode := "Text", name := "Example", next := 42317, root := ~, start := 41990, stop := 42316 ), rec( content := "\n ", count := [ 3, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 4, 3 ], mathmode := "Text", name := "Description", next := 42334, root := ~, start := 41606, stop := 42333 ) ], count := [ 3, 2, 4, 1 ], mathmode := "Text", name := "ManSection", next := 42348, root := ~, start := 41506, stop := 42347 ), rec( content := "\n\n ", count := [ 3, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "AsTransformatio\ n" ), content := 0, count := [ 3, 2, 5, 2 ], mathmode := "Text", name := "Attr", next := 42414, root := ~, start := 42369, stop := 42413 ), rec( attributes := rec( ), content := [ rec( content := "A transfo\ rmation, or ", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "K", next := 42458, root := ~, start := 42447, stop := 42457 ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "Returns", next := 42468, root := ~, start := 42417, stop := 42467 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "A", next := 42506, root := ~, start := 42492, stop := 42505 ), rec( content := " is a fu\ nctional digraph, then ", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sTransformation", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "C", next := 42560, root := ~, start := 42537, stop := 42559 ), rec( content := "\n re\ turns the transformation which is defined by ", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "A", next := 42626, root := ~, start := 42612, stop := 42625 ), rec( content := ". See " , count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsFunct\ ionalDigraph" ), content := 0, count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "Ref", next := 42672, root := ~, start := 42633, stop := 42671 ), rec( content := ". Otherw\ ise,\n ", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sTransformation(", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "C", next := 42713, root := ~, start := 42689, stop := 42712 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "A", next := 42727, root := ~, start := 42713, stop := 42726 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "C", next := 42735, root := ~, start := 42727, stop := 42734 ), rec( content := " returns\ ", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "K", next := 42755, root := ~, start := 42744, stop := 42754 ), rec( content := ". ", count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "P", next := 42762, root := ~, start := 42758, stop := 42761 ), rec( content := "\n\n \ If ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "A", next := 42785, root := ~, start := 42771, stop := 42784 ), rec( content := " is a fu\ nctional digraph with ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "M", next := 42823, root := ~, start := 42815, stop := 42822 ), rec( content := " vertice\ s, then\n ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sTransformation(", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "C", next := 42867, root := ~, start := 42843, stop := 42866 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "A", next := 42881, root := ~, start := 42867, stop := 42880 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "C", next := 42889, root := ~, start := 42881, stop := 42888 ), rec( content := " will re\ turn the\n transformation ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "C", next := 42933, root := ~, start := 42925, stop := 42932 ), rec( content := " of degr\ ee at most ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "M", next := 42960, root := ~, start := 42952, stop := 42959 ), rec( content := " where f\ or each ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ \n \\leq i \\leq n", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "M", next := 43004, root := ~, start := 42976, stop := 43003 ), rec( content := ", ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ^ f", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "C", next := 43018, root := ~, start := 43006, stop := 43017 ), rec( content := " is equa\ l to the unique out-neighbour of\n vertex ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "C", next := 43078, root := ~, start := 43070, stop := 43077 ), rec( content := " in ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "A", next := 43096, root := ~, start := 43082, stop := 43095 ), rec( content := ".\n\n \ ", count := [ 3, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1], [3], [2]]);\n\ngap> AsTransformation(D);\nTransformation( [ 1, 3, 2 ] )\ngap> D := Cycl\ eDigraph(IsMutableDigraph, 3);\n\nga\ p> AsTransformation(D);\nTransformation( [ 2, 3, 1 ] )\ngap> AsPermutation(las\ t);\n(1,2,3)\ngap> D := Digraph([[2, 3], [], []]);\n\ngap> AsTransformation(D);\nfail", count := [ 3, 2, 5, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 2, 5, 5 ], mathmode := "Text", name := "Example", next := 43562, root := ~, start := 43103, stop := 43561 ), rec( content := "\n ", count := [ 3, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 5, 3 ], mathmode := "Text", name := "Description", next := 43579, root := ~, start := 42471, stop := 43578 ) ], count := [ 3, 2, 5, 1 ], mathmode := "Text", name := "ManSection", next := 43593, root := ~, start := 42354, stop := 43592 ), rec( content := "\n\n ", count := [ 3, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 2, 0, 1 ], mathmode := "Text", name := "Section", next := 43607, root := ~, start := 37409, stop := 43606 ), rec( content := "\n\n ", count := [ 3, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "New digraphs from\ old", count := [ 3, 3, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 0, 2 ], mathmode := "Text", name := "Heading", next := 43660, root := ~, start := 43620, stop := 43659 ), rec( content := "\n ", count := [ 3, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphImmutabl\ eCopy" ), content := 0, count := [ 3, 3, 1, 2 ], mathmode := "Text", name := "Oper", next := 43729, root := ~, start := 43680, stop := 43728 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphMutableC\ opy" ), content := 0, count := [ 3, 3, 1, 4 ], mathmode := "Text", name := "Oper", next := 43779, root := ~, start := 43732, stop := 43778 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphCopySame\ Mutability" ), content := 0, count := [ 3, 3, 1, 6 ], mathmode := "Text", name := "Oper", next := 43836, root := ~, start := 43782, stop := 43835 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphCopy" ), content := 0, count := [ 3, 3, 1, 8 ], mathmode := "Text", name := "Oper", next := 43879, root := ~, start := 43839, stop := 43878 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "Returns", next := 43911, root := ~, start := 43882, stop := 43910 ), rec( attributes := rec( ), content := [ rec( content := "\n Eac\ h of these operations returns a new copy of ", count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "A", next := 43993, root := ~, start := 43979, stop := 43992 ), rec( content := ",\n o\ f the appropriate mutability, retaining none of the attributes or\n propert\ ies of ", count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "A", next := 44098, root := ~, start := 44084, stop := 44097 ), rec( content := ". ", count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 1, 10 ], mathmode := "Text", name := "P", next := 44104, root := ~, start := 44100, stop := 44103 ), rec( content := "\n\n \ ", count := [ 3, 3, 1, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "D\ igraphCopy", count := [ 3, 3, 1, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 1, 10 ], mathmode := "Text", name := "C", next := 44128, root := ~, start := 44110, stop := 44127 ), rec( content := " is a sy\ nonym for ", count := [ 3, 3, 1, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphCopySameMutability", count := [ 3, 3, 1, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 1, 10 ], mathmode := "Text", name := "C", next := 44178, root := ~, start := 44146, stop := 44177 ), rec( content := ".\n", count := [ 3, 3, 1, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(10);\n\ngap>\ DigraphCopy(D) = D;\ntrue\ngap> IsIdenticalObj(DigraphCopy(D), D);\nfalse\nga\ p> DigraphMutableCopy(D);\n\n", count := [ 3, 3, 1, 11 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 1, 11 ], mathmode := "Text", name := "Example", next := 44432, root := ~, start := 44180, stop := 44431 ), rec( content := "\n ", count := [ 3, 3, 1, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 1, 9 ], mathmode := "Text", name := "Description", next := 44449, root := ~, start := 43914, stop := 44448 ) ], count := [ 3, 3, 1, 1 ], mathmode := "Text", name := "ManSection", next := 44463, root := ~, start := 43665, stop := 44462 ), rec( content := "\n\n ", count := [ 3, 3, 1, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphImmutabl\ eCopyIfImmutable" ), content := 0, count := [ 3, 3, 2, 2 ], mathmode := "Text", name := "Oper", next := 44544, root := ~, start := 44484, stop := 44543 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphImmutabl\ eCopyIfMutable" ), content := 0, count := [ 3, 3, 2, 4 ], mathmode := "Text", name := "Oper", next := 44605, root := ~, start := 44547, stop := 44604 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphMutableC\ opyIfMutable" ), content := 0, count := [ 3, 3, 2, 6 ], mathmode := "Text", name := "Oper", next := 44664, root := ~, start := 44608, stop := 44663 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphMutableC\ opyIfImmutable" ), content := 0, count := [ 3, 3, 2, 8 ], mathmode := "Text", name := "Oper", next := 44725, root := ~, start := 44667, stop := 44724 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "Returns", next := 44757, root := ~, start := 44728, stop := 44756 ), rec( attributes := rec( ), content := [ rec( content := "\n Eac\ h of these operations returns either the original argument\n ", count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "A", next := 44858, root := ~, start := 44844, stop := 44857 ), rec( content := ", or a n\ ew copy of ", count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "A", next := 44891, root := ~, start := 44877, stop := 44890 ), rec( content := " of the \ appropriate\n mutability, according to the mutability of ", count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "A", next := 44972, root := ~, start := 44958, stop := 44971 ), rec( content := ".\n", count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> C := CycleDigraph(10);\n\ngap>\ D := DigraphImmutableCopyIfImmutable(C);\n\ngap> IsIdenticalObj(C, D);\nfalse\ngap> C = D;\ntrue\ngap> D := D\ igraphImmutableCopyIfMutable(C);\n\n\ gap> IsIdenticalObj(C, D);\ntrue\ngap> C = D;\ntrue\ngap> D := DigraphMutableC\ opyIfMutable(C);\n\ngap> IsMutableDi\ graph(D);\nfalse\ngap> D := DigraphMutableCopyIfImmutable(C);\n\ngap> IsMutableDigraph(D);\ntrue\ngap> C := Cycl\ eDigraph(IsMutableDigraph, 10);\n\ \ngap> D := DigraphImmutableCopyIfImmutable(C);\n\ngap> IsIdenticalObj(C, D);\ntrue\ngap> C = D;\ntrue\ngap> D :\ = DigraphImmutableCopyIfMutable(C);\n\ngap> IsIdenticalObj(C, D);\nfalse\ngap> C = D;\ntrue\ngap> D := Digraph\ MutableCopyIfMutable(C);\n\ngap> I\ sMutableDigraph(D);\ntrue\ngap> D := DigraphMutableCopyIfImmutable(C);\n\ngap> IsIdenticalObj(C, D);\ntrue\ngap>\ IsMutableDigraph(D);\ntrue", count := [ 3, 3, 2, 10 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 2, 10 ], mathmode := "Text", name := "Example", next := 46234, root := ~, start := 44974, stop := 46233 ), rec( content := "\n ", count := [ 3, 3, 2, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 2, 9 ], mathmode := "Text", name := "Description", next := 46251, root := ~, start := 44760, stop := 46250 ) ], count := [ 3, 3, 2, 1 ], mathmode := "Text", name := "ManSection", next := 46265, root := ~, start := 44469, stop := 46264 ), rec( content := "\n\n ", count := [ 3, 3, 2, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, verts", Name := "InducedSubdigra\ ph" ), content := 0, count := [ 3, 3, 3, 2 ], mathmode := "Text", name := "Oper", next := 46339, root := ~, start := 46286, stop := 46338 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "Returns", next := 46371, root := ~, start := 46342, stop := 46370 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "A", next := 46409, root := ~, start := 46395, stop := 46408 ), rec( content := " is a di\ graph, and ", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ erts", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "A", next := 46440, root := ~, start := 46428, stop := 46439 ), rec( content := " is a su\ bset of the\n vertices of ", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "A", next := 46490, root := ~, start := 46476, stop := 46489 ), rec( content := ", then t\ his operation returns a digraph\n constructed from ", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "A", next := 46565, root := ~, start := 46551, stop := 46564 ), rec( content := " by reta\ ining precisely those vertices in\n ", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ erts", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "A", next := 46623, root := ~, start := 46611, stop := 46622 ), rec( content := ", and th\ ose edges whose source and range vertices are both\n contained in ", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ erts", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "A", next := 46711, root := ~, start := 46699, stop := 46710 ), rec( content := ". ", count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 3, 4 ], mathmode := "Text", name := "P", next := 46717, root := ~, start := 46713, stop := 46716 ), rec( content := "\n\n \ The vertices of the induced subdigraph are\n ", count := [ 3, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1..Length(verts)]", count := [ 3, 3, 3, 4 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 3, 3, 3, 4 ], mathmode := "Text", name := "C", next := 46795, root := ~, start := 46770, stop := 46794 ), rec( content := " but the\ original vertex labels can be\n accessed via ", count := [ 3, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 3, 3, 3, 4 ], mathmode := "Text", name := "Ref", next := 46884, root := ~, start := 46851, stop := 46883 ), rec( content := ". ", count := [ 3, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "P", next := 46890, root := ~, start := 46886, stop := 46889 ), rec( content := "\n\n \ If ", count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "A", next := 46913, root := ~, start := 46899, stop := 46912 ), rec( content := " belongs\ to ", count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "Ref", next := 46955, root := ~, start := 46925, stop := 46954 ), rec( content := ", then\n\ ", count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "A", next := 46980, root := ~, start := 46966, stop := 46979 ), rec( content := " is modi\ fied in place. If ", count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "A", next := 47020, root := ~, start := 47006, stop := 47019 ), rec( content := " belongs\ to ", count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "Ref", next := 47070, root := ~, start := 47032, stop := 47069 ), rec( content := ", a new \ immutable digraph containing the\n appropriate\n vertices and edges is r\ eturned.", count := [ 3, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 3, 6 ], mathmode := "Text", name := "P", next := 47166, root := ~, start := 47162, stop := 47165 ), rec( content := "\n\n \ ", count := [ 3, 3, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 1, 2, 3, 4, 4], [1, 3, 4], [3, 1], [1, 1]]);\n\ngap> InducedSubdigraph(D, [1, 3, 4\ ]);\n\ngap> DigraphVertices(l\ ast);\n[ 1 .. 3 ]\ngap> D := DigraphMutableCopy(D);\n\ngap> new := InducedSubdigraph(D, [1, 3, 4]);\n\ngap> D = new;\ntrue\n", count := [ 3, 3, 3, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 3, 7 ], mathmode := "Text", name := "Example", next := 47644, root := ~, start := 47172, stop := 47643 ), rec( content := "\n ", count := [ 3, 3, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 3, 3 ], mathmode := "Text", name := "Description", next := 47661, root := ~, start := 46374, stop := 47660 ) ], count := [ 3, 3, 3, 1 ], mathmode := "Text", name := "ManSection", next := 47675, root := ~, start := 46271, stop := 47674 ), rec( content := "\n\n ", count := [ 3, 3, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "ReducedDigraph"\ ), content := 0, count := [ 3, 3, 4, 2 ], mathmode := "Text", name := "Oper", next := 47739, root := ~, start := 47696, stop := 47738 ), rec( attributes := rec( Arg := "digraph", Name := "ReducedDigraphA\ ttr" ), content := 0, count := [ 3, 3, 4, 4 ], mathmode := "Text", name := "Attr", next := 47789, root := ~, start := 47742, stop := 47788 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "Returns", next := 47821, root := ~, start := 47792, stop := 47820 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns a digraph isomorphic to the subdigraph of\n ", count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "A", next := 47924, root := ~, start := 47910, stop := 47923 ), rec( content := " induced\ by the set of non-isolated vertices,\n i.e. the set of those vertices of " , count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "A", next := 48022, root := ~, start := 48008, stop := 48021 ), rec( content := " which a\ re the source or\n range of some edge in ", count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "A", next := 48087, root := ~, start := 48073, stop := 48086 ), rec( content := ".\n S\ ee ", count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Induced\ Subdigraph" ), content := 0, count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "Ref", next := 48128, root := ~, start := 48097, stop := 48127 ), rec( content := ".\n " , count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "P", next := 48138, root := ~, start := 48134, stop := 48137 ), rec( content := "\n\n \ The ordering of the remaining vertices of ", count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "A", next := 48200, root := ~, start := 48186, stop := 48199 ), rec( content := " is pres\ erved, as are\n the labels of the remaining vertices and edges;\n see ", count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "Ref", next := 48315, root := ~, start := 48282, stop := 48314 ), rec( content := " and ", count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ EdgeLabels" ), content := 0, count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "Ref", next := 48351, root := ~, start := 48320, stop := 48350 ), rec( content := ".\n T\ his can allow one to match a vertex in the reduced digraph to the\n corresp\ onding vertex in ", count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "A", next := 48466, root := ~, start := 48452, stop := 48465 ), rec( content := ".\n " , count := [ 3, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 4, 7 ], mathmode := "Text", name := "P", next := 48476, root := ~, start := 48472, stop := 48475 ), rec( content := "\n\n \ If ", count := [ 3, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 7 ], mathmode := "Text", name := "A", next := 48499, root := ~, start := 48485, stop := 48498 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the isolated \ vertices of the mutable digraph ", count := [ 3, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 7 ], mathmode := "Text", name := "A", next := 48630, root := ~, start := 48616, stop := 48629 ), rec( content := " are\n \ removed in-place.\n ", count := [ 3, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2], [], [], [1, 4], []]);\n\ngap> R := ReducedDigraph(D);\n\ngap> OutNeighbours(R);\n[ [ 1, 2 ], [ ], [ 1, 3 ] ]\ngap> Di\ graphEdges(D);\n[ [ 1, 1 ], [ 1, 2 ], [ 4, 1 ], [ 4, 4 ] ]\ngap> DigraphEdges(\ R);\n[ [ 1, 1 ], [ 1, 2 ], [ 3, 1 ], [ 3, 3 ] ]\ngap> DigraphVertexLabel(R, 3)\ ;\n4\ngap> DigraphVertexLabel(R, 2);\n2\ngap> D := Digraph(IsMutableDigraph, [\ [], [3], [2]]);\n\ngap> ReducedDigra\ ph(D);\n\ngap> D;\n\n", count := [ 3, 3, 4, 8 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 8 ], mathmode := "Text", name := "Example", next := 49323, root := ~, start := 48661, stop := 49322 ), rec( content := "\n ", count := [ 3, 3, 4, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 4, 5 ], mathmode := "Text", name := "Description", next := 49340, root := ~, start := 47824, stop := 49339 ) ], count := [ 3, 3, 4, 1 ], mathmode := "Text", name := "ManSection", next := 49354, root := ~, start := 47681, stop := 49353 ), rec( content := "\n\n ", count := [ 3, 3, 4, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "MaximalSymmetri\ cSubdigraph" ), content := 0, count := [ 3, 3, 5, 2 ], mathmode := "Text", name := "Oper", next := 49430, root := ~, start := 49375, stop := 49429 ), rec( attributes := rec( Arg := "digraph", Name := "MaximalSymmetri\ cSubdigraphAttr" ), content := 0, count := [ 3, 3, 5, 4 ], mathmode := "Text", name := "Attr", next := 49492, root := ~, start := 49433, stop := 49491 ), rec( attributes := rec( Arg := "digraph", Name := "MaximalSymmetri\ cSubdigraphWithoutLoops" ), content := 0, count := [ 3, 3, 5, 6 ], mathmode := "Text", name := "Oper", next := 49562, root := ~, start := 49495, stop := 49561 ), rec( attributes := rec( Arg := "digraph", Name := "MaximalSymmetri\ cSubdigraphWithoutLoopsAttr" ), content := 0, count := [ 3, 3, 5, 8 ], mathmode := "Text", name := "Attr", next := 49636, root := ~, start := 49565, stop := 49635 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "Returns", next := 49668, root := ~, start := 49639, stop := 49667 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "A", next := 49706, root := ~, start := 49692, stop := 49705 ), rec( content := " is a di\ graph, then ", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "M\ aximalSymmetricSubdigraph", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "C", next := 49759, root := ~, start := 49726, stop := 49758 ), rec( content := "\n re\ turns a symmetric digraph without multiple edges which has the same\n verte\ x set as ", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "A", next := 49866, root := ~, start := 49852, stop := 49865 ), rec( content := ", and wh\ ose edge list is formed from\n ", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "A", next := 49921, root := ~, start := 49907, stop := 49920 ), rec( content := " by igno\ ring the multiplicity of edges, and by ignoring\n edges ", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u,v]", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "C", next := 49999, root := ~, start := 49987, stop := 49998 ), rec( content := " for whi\ ch there does not exist an edge ", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ v,u]", count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "C", next := 50051, root := ~, start := 50039, stop := 50050 ), rec( content := ".\n " , count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 5, 10 ], mathmode := "Text", name := "P", next := 50061, root := ~, start := 50057, stop := 50060 ), rec( content := "\n\n \ The digraph returned by ", count := [ 3, 3, 5, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "M\ aximalSymmetricSubdigraphWithoutLoops", count := [ 3, 3, 5, 10 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 10 ], mathmode := "Text", name := "C", next := 50136, root := ~, start := 50091, stop := 50135 ), rec( content := " is\n \ the same, except that loops are removed.", count := [ 3, 3, 5, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 5, 11 ], mathmode := "Text", name := "P", next := 50188, root := ~, start := 50184, stop := 50187 ), rec( content := "\n \n\ If ", count := [ 3, 3, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 11 ], mathmode := "Text", name := "A", next := 50215, root := ~, start := 50201, stop := 50214 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the mutable d\ igraph ", count := [ 3, 3, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 11 ], mathmode := "Text", name := "A", next := 50321, root := ~, start := 50307, stop := 50320 ), rec( content := " is chan\ ged in-place into such\n a digraph described above.", count := [ 3, 3, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 5, 12 ], mathmode := "Text", name := "P", next := 50386, root := ~, start := 50382, stop := 50385 ), rec( content := "\n\n \ See ", count := [ 3, 3, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymme\ tricDigraph" ), content := 0, count := [ 3, 3, 5, 12 ], mathmode := "Text", name := "Ref", next := 50428, root := ~, start := 50396, stop := 50427 ), rec( content := ", ", count := [ 3, 3, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMulti\ Digraph" ), content := 0, count := [ 3, 3, 5, 12 ], mathmode := "Text", name := "Ref", next := 50458, root := ~, start := 50430, stop := 50457 ), rec( content := ", and\n \ ", count := [ 3, 3, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digraph\ HasLoops" ), content := 0, count := [ 3, 3, 5, 12 ], mathmode := "Text", name := "Ref", next := 50497, root := ~, start := 50468, stop := 50496 ), rec( content := " for mor\ e information.\n ", count := [ 3, 3, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 2], [1, 3], [4], [3, 1]]);\n\ngap> not IsSymmetricDigraph(D) and IsMultiDigraph(D);\ \ntrue\ngap> OutNeighbours(D);\n[ [ 2, 2 ], [ 1, 3 ], [ 4 ], [ 3, 1 ] ]\ngap> \ S := MaximalSymmetricSubdigraph(D);\n\ngap> IsSymmetricDigraph(S) and not IsMultiDigraph(S);\ntrue\nga\ p> OutNeighbours(S);\n[ [ 2 ], [ 1 ], [ 4 ], [ 3 ] ]\ngap> D := CycleDigraph(I\ sMutableDigraph, 3);\n\ngap> Maximal\ SymmetricSubdigraph(D);\n\ngap> D;\n\n", count := [ 3, 3, 5, 13 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 5, 13 ], mathmode := "Text", name := "Example", next := 51199, root := ~, start := 50524, stop := 51198 ), rec( content := "\n ", count := [ 3, 3, 5, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 5, 9 ], mathmode := "Text", name := "Description", next := 51216, root := ~, start := 49671, stop := 51215 ) ], count := [ 3, 3, 5, 1 ], mathmode := "Text", name := "ManSection", next := 51230, root := ~, start := 49360, stop := 51229 ), rec( content := "\n\n ", count := [ 3, 3, 5, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "MaximalAntiSymm\ etricSubdigraph" ), content := 0, count := [ 3, 3, 6, 2 ], mathmode := "Text", name := "Oper", next := 51310, root := ~, start := 51251, stop := 51309 ), rec( attributes := rec( Arg := "digraph", Name := "MaximalAntiSymm\ etricSubdigraphAttr" ), content := 0, count := [ 3, 3, 6, 4 ], mathmode := "Text", name := "Attr", next := 51376, root := ~, start := 51313, stop := 51375 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "Returns", next := 51408, root := ~, start := 51379, stop := 51407 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "A", next := 51446, root := ~, start := 51432, stop := 51445 ), rec( content := " is a di\ graph, then ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "M\ aximalAntiSymmetricSubdigraph", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "C", next := 51503, root := ~, start := 51466, stop := 51502 ), rec( content := "\n re\ turns an anti-symmetric subdigraph of ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "A", next := 51562, root := ~, start := 51548, stop := 51561 ), rec( content := " formed \ by\n retaining the vertices of ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "A", next := 51617, root := ~, start := 51603, stop := 51616 ), rec( content := ", discar\ ding any duplicate edges,\n and discarding any edge ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i,j]", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "C", next := 51691, root := ~, start := 51679, stop := 51690 ), rec( content := " of ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "A", next := 51709, root := ~, start := 51695, stop := 51708 ), rec( content := " where " , count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ > j", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "C", next := 51728, root := ~, start := 51716, stop := 51727 ), rec( content := "\n an\ d the reverse edge ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ j,i]", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "C", next := 51766, root := ~, start := 51754, stop := 51765 ), rec( content := " is an e\ dge of ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "A", next := 51795, root := ~, start := 51781, stop := 51794 ), rec( content := ".\n I\ n other words, for every\n symmetric pair of edges ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i,j]", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "C", next := 51867, root := ~, start := 51855, stop := 51866 ), rec( content := " and ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ j,i]", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "C", next := 51884, root := ~, start := 51872, stop := 51883 ), rec( content := " in ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "A", next := 51902, root := ~, start := 51888, stop := 51901 ), rec( content := ", where \ \n ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "C", next := 51923, root := ~, start := 51915, stop := 51922 ), rec( content := " and ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "C", next := 51936, root := ~, start := 51928, stop := 51935 ), rec( content := " are dis\ tinct, it discards the the edge\n ", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ \\max(i,j),\\min(i,j)]", count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "M", next := 52008, root := ~, start := 51980, stop := 52007 ), rec( content := ".\n " , count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 6, 6 ], mathmode := "Text", name := "P", next := 52018, root := ~, start := 52014, stop := 52017 ), rec( content := "\n\n \ If ", count := [ 3, 3, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 6 ], mathmode := "Text", name := "A", next := 52041, root := ~, start := 52027, stop := 52040 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the mutable d\ igraph ", count := [ 3, 3, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 6 ], mathmode := "Text", name := "A", next := 52147, root := ~, start := 52133, stop := 52146 ), rec( content := " is chan\ ged in-place. ", count := [ 3, 3, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 6, 7 ], mathmode := "Text", name := "P", next := 52173, root := ~, start := 52169, stop := 52172 ), rec( content := "\n\n \ See ", count := [ 3, 3, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsAntis\ ymmetricDigraph" ), content := 0, count := [ 3, 3, 6, 7 ], mathmode := "Text", name := "Ref", next := 52219, root := ~, start := 52183, stop := 52218 ), rec( content := " for mor\ e information.\n ", count := [ 3, 3, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 2], [1, 3], [4], [3, 1]]);\n\ngap> not IsAntiSymmetricDigraph(D) and IsMultiDigraph\ (D);\ntrue\ngap> OutNeighbours(D);\n[ [ 2, 2 ], [ 1, 3 ], [ 4 ], [ 3, 1 ] ]\ng\ ap> D := MaximalAntiSymmetricSubdigraph(D);\n\ngap> IsAntiSymmetricDigraph(D) and not IsMultiDigra\ ph(D);\ntrue\ngap> OutNeighbours(D);\n[ [ 2 ], [ 3 ], [ 4 ], [ 1 ] ]\ngap> D :\ = Digraph(IsMutableDigraph, [[2], [1]]);\n\ngap> MaximalAntiSymmetricSubdigraph(D);\n\ngap> D;\n\n", count := [ 3, 3, 6, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 6, 8 ], mathmode := "Text", name := "Example", next := 52949, root := ~, start := 52246, stop := 52948 ), rec( content := "\n ", count := [ 3, 3, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 6, 5 ], mathmode := "Text", name := "Description", next := 52966, root := ~, start := 51411, stop := 52965 ) ], count := [ 3, 3, 6, 1 ], mathmode := "Text", name := "ManSection", next := 52980, root := ~, start := 51236, stop := 52979 ), rec( content := "\n\n ", count := [ 3, 3, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "UndirectedSpann\ ingForest" ), content := 0, count := [ 3, 3, 7, 2 ], mathmode := "Text", name := "Oper", next := 53054, root := ~, start := 53001, stop := 53053 ), rec( attributes := rec( Arg := "digraph", Name := "UndirectedSpann\ ingForestAttr" ), content := 0, count := [ 3, 3, 7, 4 ], mathmode := "Text", name := "Attr", next := 53114, root := ~, start := 53057, stop := 53113 ), rec( attributes := rec( Arg := "digraph", Name := "UndirectedSpann\ ingTree" ), content := 0, count := [ 3, 3, 7, 6 ], mathmode := "Text", name := "Oper", next := 53168, root := ~, start := 53117, stop := 53167 ), rec( attributes := rec( Arg := "digraph", Name := "UndirectedSpann\ ingTreeAttr" ), content := 0, count := [ 3, 3, 7, 8 ], mathmode := "Text", name := "Attr", next := 53226, root := ~, start := 53171, stop := 53225 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ , or ", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "K", next := 53263, root := ~, start := 53252, stop := 53262 ), rec( content := ".", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "Returns", next := 53274, root := ~, start := 53229, stop := 53273 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "A", next := 53312, root := ~, start := 53298, stop := 53311 ), rec( content := " is a di\ graph with at least one vertex, then\n ", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "U\ ndirectedSpanningForest", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "C", next := 53392, root := ~, start := 53361, stop := 53391 ), rec( content := " returns\ an undirected spanning forest of\n ", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "A", next := 53452, root := ~, start := 53438, stop := 53451 ), rec( content := ", otherw\ ise this attribute returns ", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "K", next := 53498, root := ~, start := 53487, stop := 53497 ), rec( content := ". See ", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsUndir\ ectedSpanningForest" ), content := 0, count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "Ref", next := 53551, root := ~, start := 53504, stop := 53550 ), rec( content := " for the\ definition of an undirected\n spanning forest.", count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "P", next := 53612, root := ~, start := 53608, stop := 53611 ), rec( content := "\n\n \ If ", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "A", next := 53635, root := ~, start := 53621, stop := 53634 ), rec( content := " is a di\ graph with at least one vertex and whose ", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Maximal\ SymmetricSubdigraph" ), content := 0, count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "Ref", next := 53730, root := ~, start := 53684, stop := 53729 ), rec( content := " is conn\ ected (see ", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsConne\ ctedDigraph" ), content := 0, count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "Ref", next := 53788, root := ~, start := 53749, stop := 53787 ), rec( content := "), then \ ", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "U\ ndirectedSpanningTree", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "C", next := 53825, root := ~, start := 53796, stop := 53824 ), rec( content := " returns\ \n an undirected spanning tree of ", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "A", next := 53883, root := ~, start := 53869, stop := 53882 ), rec( content := ", otherw\ ise this attribute\n returns ", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "K", next := 53933, root := ~, start := 53922, stop := 53932 ), rec( content := ". See " , count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsUndir\ ectedSpanningTree" ), content := 0, count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "Ref", next := 53979, root := ~, start := 53940, stop := 53978 ), rec( content := " for the\ \n definition of an undirected spanning tree.", count := [ 3, 3, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "P", next := 54038, root := ~, start := 54034, stop := 54037 ), rec( content := "\n\n \ If ", count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "A", next := 54061, root := ~, start := 54047, stop := 54060 ), rec( content := " is immu\ table, then an immutable digraph is returned.\n Otherwise, the mutable digr\ aph ", count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "A", next := 54164, root := ~, start := 54150, stop := 54163 ), rec( content := " is chan\ ged in-place into an\n undirected spanning tree of ", count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "A", next := 54239, root := ~, start := 54225, stop := 54238 ), rec( content := ".", count := [ 3, 3, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 7, 12 ], mathmode := "Text", name := "P", next := 54244, root := ~, start := 54240, stop := 54243 ), rec( content := "\n\n \ Note that for an immutable digraph that has known undirected spanning tree,\n \ the attribute ", count := [ 3, 3, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "U\ ndirectedSpanningTree", count := [ 3, 3, 7, 12 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 7, 12 ], mathmode := "Text", name := "C", next := 54373, root := ~, start := 54344, stop := 54372 ), rec( content := " returns\ the same digraph as\n the attribute ", count := [ 3, 3, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "U\ ndirectedSpanningForest", count := [ 3, 3, 7, 12 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 7, 12 ], mathmode := "Text", name := "C", next := 54451, root := ~, start := 54420, stop := 54450 ), rec( content := ".\n\n \ ", count := [ 3, 3, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2, 1, 3], [1], [4], [3, 4, 3]]);\n\ngap> UndirectedSpanningTree(D);\nfail\ngap> for\ est := UndirectedSpanningForest(D);\n\ngap> OutNeighbours(forest);\n[ [ 2 ], [ 1 ], [ 4 ], [ 3 ] ]\nga\ p> IsUndirectedSpanningForest(D, forest);\ntrue\ngap> DigraphConnectedComponen\ ts(forest).comps;\n[ [ 1, 2 ], [ 3, 4 ] ]\ngap> DigraphConnectedComponents(Max\ imalSymmetricSubdigraph(D)).comps;\n[ [ 1, 2 ], [ 3, 4 ] ]\ngap> UndirectedSpa\ nningForest(MaximalSymmetricSubdigraph(D))\n> = forest;\ntrue\ngap> D := Compl\ eteDigraph(4);\n\ngap> tree := Und\ irectedSpanningTree(D);\n\ngap> IsUndirectedSpanningTree(D, tree);\ntrue\ngap> tree = UndirectedSpanni\ ngForest(D);\ntrue\ngap> UndirectedSpanningForest(EmptyDigraph(0));\nfail\ngap\ > D := PetersenGraph(IsMutableDigraph);\n\ngap> UndirectedSpanningTree(D);\n\ngap> D;\n\n", count := [ 3, 3, 7, 13 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 7, 13 ], mathmode := "Text", name := "Example", next := 55613, root := ~, start := 54458, stop := 55612 ), rec( content := "\n ", count := [ 3, 3, 7, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 7, 9 ], mathmode := "Text", name := "Description", next := 55630, root := ~, start := 53277, stop := 55629 ) ], count := [ 3, 3, 7, 1 ], mathmode := "Text", name := "ManSection", next := 55644, root := ~, start := 52986, stop := 55643 ), rec( content := "\n\n ", count := [ 3, 3, 7, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, p", Name := "QuotientDigraph\ " ), content := 0, count := [ 3, 3, 8, 2 ], mathmode := "Text", name := "Oper", next := 55712, root := ~, start := 55665, stop := 55711 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "Returns", next := 55744, root := ~, start := 55715, stop := 55743 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "A", next := 55782, root := ~, start := 55768, stop := 55781 ), rec( content := " is a di\ graph, and ", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "A", next := 55809, root := ~, start := 55801, stop := 55808 ), rec( content := " is a pa\ rtition of the vertices\n of ", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "A", next := 55862, root := ~, start := 55848, stop := 55861 ), rec( content := ", then t\ his operation returns a digraph constructed by\n amalgamating all vertices \ of ", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "A", next := 55964, root := ~, start := 55950, stop := 55963 ), rec( content := " which l\ ie in the same part of\n ", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "A", next := 56007, root := ~, start := 55999, stop := 56006 ), rec( content := ".\n " , count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 8, 4 ], mathmode := "Text", name := "P", next := 56017, root := ~, start := 56013, stop := 56016 ), rec( content := "\n\n \ A partition of the vertices of ", count := [ 3, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 4 ], mathmode := "Text", name := "A", next := 56068, root := ~, start := 56054, stop := 56067 ), rec( content := " is a li\ st of non-empty\n disjoint lists, such that the union of all the sub-lists \ is equal\n to vertex set of ", count := [ 3, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 4 ], mathmode := "Text", name := "A", next := 56197, root := ~, start := 56183, stop := 56196 ), rec( content := ". In par\ ticular, each vertex must appear\n in precisely one sub-list.\n ", count := [ 3, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "P", next := 56277, root := ~, start := 56273, stop := 56276 ), rec( content := "\n\n \ The vertices of ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "A", next := 56313, root := ~, start := 56299, stop := 56312 ), rec( content := " in part\ ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "C", next := 56330, root := ~, start := 56322, stop := 56329 ), rec( content := " of ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "A", next := 56342, root := ~, start := 56334, stop := 56341 ), rec( content := " will be\ come\n vertex ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "C", next := 56374, root := ~, start := 56366, stop := 56373 ), rec( content := " in the \ quotient, and there exists some edge in ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "A", next := 56436, root := ~, start := 56422, stop := 56435 ), rec( content := "\n wi\ th source in part ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "C", next := 56469, root := ~, start := 56461, stop := 56468 ), rec( content := " and ran\ ge in part ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "C", next := 56496, root := ~, start := 56488, stop := 56495 ), rec( content := " if and \ only if there\n is an edge from ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "C", next := 56546, root := ~, start := 56538, stop := 56545 ), rec( content := " to ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "C", next := 56558, root := ~, start := 56550, stop := 56557 ), rec( content := " in the \ quotient.\n In particular, this means that the quotient of a digraph has no\ multiple edges.\n which was a change introduced in version 1.0.0 of the ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package\ .\n ", count := [ 3, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "P", next := 56746, root := ~, start := 56742, stop := 56745 ), rec( content := "\n\n \ If ", count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "A", next := 56769, root := ~, start := 56755, stop := 56768 ), rec( content := " belongs\ to ", count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "Ref", next := 56811, root := ~, start := 56781, stop := 56810 ), rec( content := ", then\n\ ", count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "A", next := 56836, root := ~, start := 56822, stop := 56835 ), rec( content := " is modi\ fied in place. If ", count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "A", next := 56876, root := ~, start := 56862, stop := 56875 ), rec( content := " belongs\ to ", count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "Ref", next := 56926, root := ~, start := 56888, stop := 56925 ), rec( content := ", a new \ immutable digraph with the above\n properties is returned.", count := [ 3, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 8, 7 ], mathmode := "Text", name := "P", next := 56998, root := ~, start := 56994, stop := 56997 ), rec( content := "\n\n \ ", count := [ 3, 3, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 1], [4], [1], [1, 3, 4]]);\n\ngap> DigraphVertices(D);\n[ 1 .. 4 ]\ngap> DigraphEdges(D)\ ;\n[ [ 1, 2 ], [ 1, 1 ], [ 2, 4 ], [ 3, 1 ], [ 4, 1 ], [ 4, 3 ], \n [ 4, 4 ] \ ]\ngap> p := [[1], [2, 4], [3]];\n[ [ 1 ], [ 2, 4 ], [ 3 ] ]\ngap> quo := Quot\ ientDigraph(D, p);\n\ngap> Digraph\ Vertices(quo);\n[ 1 .. 3 ]\ngap> DigraphEdges(quo);\n[ [ 1, 1 ], [ 1, 2 ], [ 2\ , 1 ], [ 2, 2 ], [ 2, 3 ], [ 3, 1 ] ]\ngap> QuotientDigraph(EmptyDigraph(0), [\ ]);\n\n", count := [ 3, 3, 8, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 8, 8 ], mathmode := "Text", name := "Example", next := 57612, root := ~, start := 57004, stop := 57611 ), rec( content := "\n ", count := [ 3, 3, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 8, 3 ], mathmode := "Text", name := "Description", next := 57629, root := ~, start := 55747, stop := 57628 ) ], count := [ 3, 3, 8, 1 ], mathmode := "Text", name := "ManSection", next := 57643, root := ~, start := 55650, stop := 57642 ), rec( content := "\n\n ", count := [ 3, 3, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphReverse"\ ), content := 0, count := [ 3, 3, 9, 2 ], mathmode := "Text", name := "Oper", next := 57707, root := ~, start := 57664, stop := 57706 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphReverseA\ ttr" ), content := 0, count := [ 3, 3, 9, 4 ], mathmode := "Text", name := "Attr", next := 57757, root := ~, start := 57710, stop := 57756 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "Returns", next := 57789, root := ~, start := 57760, stop := 57788 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ reverse of a digraph is the digraph formed by reversing the orientation\n \ of each of its edges, i.e. for every edge ", count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i, j]", count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "C", next := 57945, root := ~, start := 57932, stop := 57944 ), rec( content := " of a di\ graph, the\n reverse contains the corresponding edge ", count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ j, i]", count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "C", next := 58021, root := ~, start := 58008, stop := 58020 ), rec( content := ".", count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "P", next := 58026, root := ~, start := 58022, stop := 58025 ), rec( content := "\n\n \ ", count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphReverse", count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "C", next := 58053, root := ~, start := 58032, stop := 58052 ), rec( content := " returns\ the reverse of the digraph ", count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "A", next := 58103, root := ~, start := 58089, stop := 58102 ), rec( content := ". If\n \ ", count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "A", next := 58126, root := ~, start := 58112, stop := 58125 ), rec( content := " is immu\ table, then a new immutable digraph is returned. Otherwise,\n the mutable d\ igraph ", count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "A", next := 58232, root := ~, start := 58218, stop := 58231 ), rec( content := " is chan\ ged in-place into its reverse.\n ", count := [ 3, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3], [1, 3, 5], [1], [1, 2, 4], [2, 3, 5]]);\n\ngap> DigraphReverse(D);\n\ngap> OutNeighbours(last);\n[ [ 2, 3, 4 ], [ 4, 5 \ ], [ 1, 2, 5 ], [ 4 ], [ 2, 5 ] ]\ngap> D := Digraph([[2, 4], [1], [4], [3, 4]\ ]);\n\ngap> DigraphEdges(D);\n[ [ \ 1, 2 ], [ 1, 4 ], [ 2, 1 ], [ 3, 4 ], [ 4, 3 ], [ 4, 4 ] ]\ngap> DigraphEdges(\ DigraphReverse(D));\n[ [ 1, 2 ], [ 2, 1 ], [ 3, 4 ], [ 4, 1 ], [ 4, 3 ], [ 4, \ 4 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> OutNeighbours(D);\n[ [ 2 ], [ 3 ], [ 1 ] ]\ngap> Digra\ phReverse(D);\n\ngap> OutNeighbours(\ D);\n[ [ 3 ], [ 1 ], [ 2 ] ]\n", count := [ 3, 3, 9, 7 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 9, 7 ], mathmode := "Text", name := "Example", next := 59096, root := ~, start := 58275, stop := 59095 ), rec( content := "\n ", count := [ 3, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 9, 5 ], mathmode := "Text", name := "Description", next := 59113, root := ~, start := 57792, stop := 59112 ) ], count := [ 3, 3, 9, 1 ], mathmode := "Text", name := "ManSection", next := 59127, root := ~, start := 57649, stop := 59126 ), rec( content := "\n\n ", count := [ 3, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphDual" ), content := 0, count := [ 3, 3, 10, 2 ], mathmode := "Text", name := "Oper", next := 59188, root := ~, start := 59148, stop := 59187 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphDualAttr\ " ), content := 0, count := [ 3, 3, 10, 4 ], mathmode := "Text", name := "Attr", next := 59235, root := ~, start := 59191, stop := 59234 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "Returns", next := 59267, root := ~, start := 59238, stop := 59266 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ual", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "E", next := 59303, root := ~, start := 59292, stop := 59302 ), rec( content := " of ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "A", next := 59321, root := ~, start := 59307, stop := 59320 ), rec( content := " has the\ same vertices as ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "A", next := 59361, root := ~, start := 59347, stop := 59360 ), rec( content := ",\n a\ nd there is an edge in the dual from ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "C", next := 59413, root := ~, start := 59405, stop := 59412 ), rec( content := " to ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "C", next := 59425, root := ~, start := 59417, stop := 59424 ), rec( content := "\n wh\ enever there is no edge from ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "C", next := 59469, root := ~, start := 59461, stop := 59468 ), rec( content := " to ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "C", next := 59481, root := ~, start := 59473, stop := 59480 ), rec( content := " in ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "A", next := 59499, root := ~, start := 59485, stop := 59498 ), rec( content := ".\n T\ he ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ual", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "E", next := 59520, root := ~, start := 59509, stop := 59519 ), rec( content := " is some\ times called the ", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omplement", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "E", next := 59562, root := ~, start := 59545, stop := 59561 ), rec( content := ".", count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "P", next := 59567, root := ~, start := 59563, stop := 59566 ), rec( content := "\n\n \ ", count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "D\ igraphDual", count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "C", next := 59591, root := ~, start := 59573, stop := 59590 ), rec( content := " returns\ the dual of the digraph ", count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "A", next := 59638, root := ~, start := 59624, stop := 59637 ), rec( content := ". If\n \ ", count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "A", next := 59661, root := ~, start := 59647, stop := 59660 ), rec( content := " is an i\ mmutable digraph, then a new immutable digraph is\n returned. Otherwise, th\ e mutable digraph ", count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "A", next := 59778, root := ~, start := 59764, stop := 59777 ), rec( content := " is chan\ ged in-place\n into its dual.\n ", count := [ 3, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 3], [], [4, 6], [5], [],\n> [7, 8, 9], [], [], []]);\n\ \ngap> DigraphDual(D);\n\ngap> D := CycleDigraph(IsMutableDigraph, \ 3);\n\ngap> DigraphDual(D);\n\ngap> D;\n\n", count := [ 3, 3, 10, 7 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 7 ], mathmode := "Text", name := "Example", next := 60244, root := ~, start := 59822, stop := 60243 ), rec( content := "\n ", count := [ 3, 3, 10, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 10, 5 ], mathmode := "Text", name := "Description", next := 60261, root := ~, start := 59270, stop := 60260 ) ], count := [ 3, 3, 10, 1 ], mathmode := "Text", name := "ManSection", next := 60275, root := ~, start := 59133, stop := 60274 ), rec( content := "\n\n ", count := [ 3, 3, 10, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphSymmetri\ cClosure" ), content := 0, count := [ 3, 3, 11, 2 ], mathmode := "Text", name := "Oper", next := 60348, root := ~, start := 60296, stop := 60347 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphSymmetri\ cClosureAttr" ), content := 0, count := [ 3, 3, 11, 4 ], mathmode := "Text", name := "Attr", next := 60407, root := ~, start := 60351, stop := 60406 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "Returns", next := 60439, root := ~, start := 60410, stop := 60438 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "A", next := 60477, root := ~, start := 60463, stop := 60476 ), rec( content := " is a di\ graph, then this attribute gives the minimal\n symmetric digraph which has \ the same vertices and contains all the edges of\n ", count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "A", next := 60628, root := ~, start := 60614, stop := 60627 ), rec( content := ".", count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "P", next := 60633, root := ~, start := 60629, stop := 60632 ), rec( content := "\n \n\ A digraph is ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ymmetric", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "E", next := 60672, root := ~, start := 60656, stop := 60671 ), rec( content := " if its \ adjacency matrix \n ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Adjacen\ cyMatrix" ), content := 0, count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "Ref", next := 60731, root := ~, start := 60702, stop := 60730 ), rec( content := " is symm\ etric. For a digraph with multiple\n edges this means that there are the sa\ me number of edges from a vertex\n ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "C", next := 60861, root := ~, start := 60853, stop := 60860 ), rec( content := " to a ve\ rtex ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "C", next := 60882, root := ~, start := 60874, stop := 60881 ), rec( content := " as ther\ e are from ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "C", next := 60909, root := ~, start := 60901, stop := 60908 ), rec( content := " to ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "C", next := 60921, root := ~, start := 60913, stop := 60920 ), rec( content := "; \n \ see ", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymme\ tricDigraph" ), content := 0, count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "Ref", next := 60964, root := ~, start := 60932, stop := 60963 ), rec( content := ".", count := [ 3, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 11, 7 ], mathmode := "Text", name := "P", next := 60969, root := ~, start := 60965, stop := 60968 ), rec( content := "\n\n \ If ", count := [ 3, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 7 ], mathmode := "Text", name := "A", next := 60992, root := ~, start := 60978, stop := 60991 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the mutable d\ igraph ", count := [ 3, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 7 ], mathmode := "Text", name := "A", next := 61098, root := ~, start := 61084, stop := 61097 ), rec( content := " is chan\ ged in-place into its\n symmetric closure.\n", count := [ 3, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2, 3], [2, 4], [1], [3, 4]]);\n\ngap> D := DigraphSymmetricClosure(D);\n\ngap> IsSymmetricDigraph(D);\ntrue\nga\ p> List(OutNeighbours(D), AsSet);\n[ [ 1, 2, 3 ], [ 1, 2, 4 ], [ 1, 4 ], [ 2, \ 3, 4 ] ]\ngap> D := Digraph([[2, 2], [1]]);\n\ngap> D := DigraphSymmetricClosure(D);\n\ngap> OutNeighbours(D);\n[ [ 2, 2 ], [ \ 1, 1 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphSymmetricClosure(D);\n\ngap> D;\n\n", count := [ 3, 3, 11, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 11, 8 ], mathmode := "Text", name := "Example", next := 61939, root := ~, start := 61151, stop := 61938 ), rec( content := "\n ", count := [ 3, 3, 11, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 11, 5 ], mathmode := "Text", name := "Description", next := 61956, root := ~, start := 60442, stop := 61955 ) ], count := [ 3, 3, 11, 1 ], mathmode := "Text", name := "ManSection", next := 61970, root := ~, start := 60281, stop := 61969 ), rec( content := "\n\n ", count := [ 3, 3, 11, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphTransiti\ veClosure" ), content := 0, count := [ 3, 3, 12, 2 ], mathmode := "Text", name := "Oper", next := 62044, root := ~, start := 61991, stop := 62043 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphTransiti\ veClosureAttr" ), content := 0, count := [ 3, 3, 12, 4 ], mathmode := "Text", name := "Attr", next := 62104, root := ~, start := 62047, stop := 62103 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphReflexiv\ eTransitiveClosure" ), content := 0, count := [ 3, 3, 12, 6 ], mathmode := "Text", name := "Oper", next := 62169, root := ~, start := 62107, stop := 62168 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphReflexiv\ eTransitiveClosureAttr" ), content := 0, count := [ 3, 3, 12, 8 ], mathmode := "Text", name := "Attr", next := 62238, root := ~, start := 62172, stop := 62237 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "Returns", next := 62270, root := ~, start := 62241, stop := 62269 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "A", next := 62308, root := ~, start := 62294, stop := 62307 ), rec( content := " is a di\ graph with no multiple edges, then these\n attributes return the (reflexive\ ) transitive closure of ", count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "A", next := 62431, root := ~, start := 62417, stop := 62430 ), rec( content := ".", count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "P", next := 62436, root := ~, start := 62432, stop := 62435 ), rec( content := "\n\n \ A digraph is ", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ eflexive", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "E", next := 62471, root := ~, start := 62455, stop := 62470 ), rec( content := " if it h\ as a loop at every vertex, and it is\n ", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ ransitive", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "E", next := 62537, root := ~, start := 62520, stop := 62536 ), rec( content := " if when\ ever ", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i,j]", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "C", next := 62562, root := ~, start := 62550, stop := 62561 ), rec( content := " and ", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ j,k]", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "C", next := 62579, root := ~, start := 62567, stop := 62578 ), rec( content := " are edg\ es of\n ", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "A", next := 62611, root := ~, start := 62597, stop := 62610 ), rec( content := ", ", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i,k]", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "C", next := 62625, root := ~, start := 62613, stop := 62624 ), rec( content := " is also\ an edge. The ", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(\ reflexive)\n transitive closure", count := [ 3, 3, 12, 10 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "E", next := 62691, root := ~, start := 62648, stop := 62690 ), rec( content := " of a di\ graph ", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "A", next := 62719, root := ~, start := 62705, stop := 62718 ), rec( content := " is the \ least\n (reflexive and) transitive digraph containing ", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "A", next := 62797, root := ~, start := 62783, stop := 62796 ), rec( content := ".", count := [ 3, 3, 12, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 12, 11 ], mathmode := "Text", name := "P", next := 62802, root := ~, start := 62798, stop := 62801 ), rec( content := "\n\n \ If ", count := [ 3, 3, 12, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 12, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 11 ], mathmode := "Text", name := "A", next := 62825, root := ~, start := 62811, stop := 62824 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the mutable d\ igraph ", count := [ 3, 3, 12, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 12, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 11 ], mathmode := "Text", name := "A", next := 62931, root := ~, start := 62917, stop := 62930 ), rec( content := " is chan\ ged in-place into its\n (reflexive) transitive closure.", count := [ 3, 3, 12, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "P", next := 63000, root := ~, start := 62996, stop := 62999 ), rec( content := "\n\n \ Let ", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "M", next := 63018, root := ~, start := 63010, stop := 63017 ), rec( content := " be the \ number of vertices of ", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "A", next := 63062, root := ~, start := 63048, stop := 63061 ), rec( content := ", and le\ t\n ", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "M", next := 63084, root := ~, start := 63076, stop := 63083 ), rec( content := " be the \ number of edges. For an arbitrary digraph, these\n attributes will use a v\ ersion of the Floyd-Warshall algorithm, with\n complexity ", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (n^3)", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "M", next := 63242, root := ~, start := 63229, stop := 63241 ), rec( content := ".\n\n \ However, for a topologically sortable digraph [see ", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ TopologicalSort" ), content := 0, count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "Ref", next := 63342, root := ~, start := 63300, stop := 63341 ), rec( content := "], these\ attributes will use methods\n with complexity ", count := [ 3, 3, 12, 12 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m + n + m \\cdot n)", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "M", next := 63426, root := ~, start := 63399, stop := 63425 ), rec( content := " when th\ is is faster.", count := [ 3, 3, 12, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 12, 13 ], mathmode := "Text", name := "P", next := 63451, root := ~, start := 63447, stop := 63450 ), rec( content := "\n\n \ ", count := [ 3, 3, 12, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDiSparse6String(\".H`eOWR`Ul^\");\n\ngap> IsReflexiveDigraph(D) or IsTransitiveDigraph(D);\ \nfalse\ngap> OutNeighbours(D);\n[ [ 4, 6 ], [ 1, 3 ], [ ], [ 5 ], [ ], [ 7,\ 8, 9 ], [ ], [ ], \n [ ] ]\ngap> T := DigraphTransitiveClosure(D);\n\ngap> OutNeighbours(T);\n[\ [ 4, 6, 5, 7, 8, 9 ], [ 1, 3, 4, 5, 6, 7, 8, 9 ], [ ], [ 5 ], \n [ ], [ 7,\ 8, 9 ], [ ], [ ], [ ] ]\ngap> RT := DigraphReflexiveTransitiveClosure(D);\ \n\ngap> OutNeighbours(R\ T);\n[ [ 4, 6, 5, 7, 8, 9, 1 ], [ 1, 3, 4, 5, 6, 7, 8, 9, 2 ], [ 3 ], \n [ 5,\ 4 ], [ 5 ], [ 7, 8, 9, 6 ], [ 7 ], [ 8 ], [ 9 ] ]\ngap> D := CycleDigraph(IsM\ utableDigraph, 3);\n\ngap> DigraphRe\ flexiveTransitiveClosure(D);\n\ngap>\ D;\n\n", count := [ 3, 3, 12, 14 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 12, 14 ], mathmode := "Text", name := "Example", next := 64447, root := ~, start := 63457, stop := 64446 ), rec( content := "\n ", count := [ 3, 3, 12, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 12, 9 ], mathmode := "Text", name := "Description", next := 64464, root := ~, start := 62273, stop := 64463 ) ], count := [ 3, 3, 12, 1 ], mathmode := "Text", name := "ManSection", next := 64478, root := ~, start := 61976, stop := 64477 ), rec( content := "\n\n ", count := [ 3, 3, 12, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphTransiti\ veReduction" ), content := 0, count := [ 3, 3, 13, 2 ], mathmode := "Text", name := "Oper", next := 64554, root := ~, start := 64499, stop := 64553 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphTransiti\ veReductionAttr" ), content := 0, count := [ 3, 3, 13, 4 ], mathmode := "Text", name := "Attr", next := 64616, root := ~, start := 64557, stop := 64615 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphReflexiv\ eTransitiveReduction" ), content := 0, count := [ 3, 3, 13, 6 ], mathmode := "Text", name := "Oper", next := 64683, root := ~, start := 64619, stop := 64682 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphReflexiv\ eTransitiveReductionAttr" ), content := 0, count := [ 3, 3, 13, 8 ], mathmode := "Text", name := "Attr", next := 64754, root := ~, start := 64686, stop := 64753 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "Returns", next := 64786, root := ~, start := 64757, stop := 64785 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "A", next := 64824, root := ~, start := 64810, stop := 64823 ), rec( content := " is a to\ pologically sortable digraph\n [see ", count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ TopologicalSort" ), content := 0, count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "Ref", next := 64906, root := ~, start := 64870, stop := 64905 ), rec( content := "]\n w\ ith no multiple edges, then these operations return the\n (reflexive) tran\ sitive reduction of ", count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "A", next := 65024, root := ~, start := 65010, stop := 65023 ), rec( content := ".", count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "P", next := 65029, root := ~, start := 65025, stop := 65028 ), rec( content := "\n\n \ The (reflexive) transitive reduction of such a digraph is the unique\n leas\ t subgraph such that the (reflexive) transitive closure of the\n subgraph i\ s equal to the (reflexive) transitive closure of ", count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "A", next := 65252, root := ~, start := 65238, stop := 65251 ), rec( content := "\n [s\ ee ", count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ ReflexiveTransitiveClosure" ), content := 0, count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "Ref", next := 65309, root := ~, start := 65262, stop := 65308 ), rec( content := "].\n \ In order words, it is the least subgraph of ", count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "A", next := 65374, root := ~, start := 65360, stop := 65373 ), rec( content := " which\n\ retains the same reachability as ", count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "A", next := 65432, root := ~, start := 65418, stop := 65431 ), rec( content := ".", count := [ 3, 3, 13, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 13, 11 ], mathmode := "Text", name := "P", next := 65437, root := ~, start := 65433, stop := 65436 ), rec( content := "\n\n \ If ", count := [ 3, 3, 13, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 13, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 11 ], mathmode := "Text", name := "A", next := 65460, root := ~, start := 65446, stop := 65459 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the mutable d\ igraph ", count := [ 3, 3, 13, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 13, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 11 ], mathmode := "Text", name := "A", next := 65566, root := ~, start := 65552, stop := 65565 ), rec( content := " is chan\ ged in-place into its\n (reflexive) transitive reduction.", count := [ 3, 3, 13, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "P", next := 65637, root := ~, start := 65633, stop := 65636 ), rec( content := "\n\n \ Let ", count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "M", next := 65655, root := ~, start := 65647, stop := 65654 ), rec( content := " be the \ number of vertices of an arbitrary digraph, and let\n ", count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "M", next := 65731, root := ~, start := 65723, stop := 65730 ), rec( content := " be the \ number of edges.\n Then these operations\n use methods with complexity " , count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m + n + m \\cdot n)", count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "M", next := 65841, root := ~, start := 65814, stop := 65840 ), rec( content := ".\n " , count := [ 3, 3, 13, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 13, 13 ], mathmode := "Text", name := "P", next := 65851, root := ~, start := 65847, stop := 65850 ), rec( content := "\n ", count := [ 3, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2, 3], [3], [3]]);;\ngap> DigraphHasLoops(D);\ntrue\ng\ ap> D1 := DigraphReflexiveTransitiveReduction(D);\n\ngap> DigraphHasLoops(D1);\nfalse\ngap> OutNeighbours(D1);\n\ [ [ 2 ], [ 3 ], [ ] ]\ngap> D2 := DigraphTransitiveReduction(D);\n\ngap> DigraphHasLoops(D2);\ntrue\ngap> OutNe\ ighbours(D2);\n[ [ 2, 1 ], [ 3 ], [ 3 ] ]\ngap> DigraphReflexiveTransitiveClos\ ure(D)\n> = DigraphReflexiveTransitiveClosure(D1);\ntrue\ngap> DigraphTransit\ iveClosure(D)\n> = DigraphTransitiveClosure(D2);\ntrue\ngap> D := Digraph(IsM\ utableDigraph, [[1], [1], [1, 2, 3]]);\n\ngap> DigraphReflexiveTransitiveReduction(D);\n\ngap> D;\n\n", count := [ 3, 3, 13, 14 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 13, 14 ], mathmode := "Text", name := "Example", next := 66711, root := ~, start := 65856, stop := 66710 ), rec( content := "\n ", count := [ 3, 3, 13, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 13, 9 ], mathmode := "Text", name := "Description", next := 66728, root := ~, start := 64789, stop := 66727 ) ], count := [ 3, 3, 13, 1 ], mathmode := "Text", name := "ManSection", next := 66742, root := ~, start := 64484, stop := 66741 ), rec( content := "\n\n ", count := [ 3, 3, 13, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph[, label \ ]", Name := "DigraphAddVertex" ), content := 0, count := [ 3, 3, 14, 2 ], mathmode := "Text", name := "Oper", next := 66818, root := ~, start := 66763, stop := 66817 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 3 ], mathmode := "Text", name := "Returns", next := 66850, root := ~, start := 66821, stop := 66849 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ operation returns a digraph constructed from ", count := [ 3, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 3 ], mathmode := "Text", name := "A", next := 66934, root := ~, start := 66920, stop := 66933 ), rec( content := " by addi\ ng a\n single new vertex, and no new edges. ", count := [ 3, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "P", next := 66992, root := ~, start := 66988, stop := 66991 ), rec( content := "\n\n \ If the optional second argument ", count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ abel", count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "A", next := 67042, root := ~, start := 67030, stop := 67041 ), rec( content := " is a ", count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " object,\ \n then the new vertex will be labelled ", count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ abel", count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "A", next := 67115, root := ~, start := 67103, stop := 67114 ), rec( content := ".\n " , count := [ 3, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "P", next := 67125, root := ~, start := 67121, stop := 67124 ), rec( content := "\n\n \ If ", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "A", next := 67148, root := ~, start := 67134, stop := 67147 ), rec( content := " belongs\ to ", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "Ref", next := 67190, root := ~, start := 67160, stop := 67189 ), rec( content := ", then t\ he\n vertex is added directly to ", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "A", next := 67247, root := ~, start := 67233, stop := 67246 ), rec( content := ". If ", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "A", next := 67266, root := ~, start := 67252, stop := 67265 ), rec( content := " belongs\ to\n ", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "Ref", next := 67314, root := ~, start := 67282, stop := 67313 ), rec( content := ", an imm\ utable copy of ", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "A", next := 67351, root := ~, start := 67337, stop := 67350 ), rec( content := " with\n \ the additional vertex is returned.", count := [ 3, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 14, 6 ], mathmode := "Text", name := "P", next := 67399, root := ~, start := 67395, stop := 67398 ), rec( content := "\n\n \ ", count := [ 3, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(3);\n\n\ gap> new := DigraphAddVertex(D);\n\ \ngap> D = new;\nfalse\ngap> DigraphVertices(new);\n[ 1 .. 4 ]\ngap> new := Di\ graphAddVertex(D, Group([(1, 2)]));\n\ngap> DigraphVertexLabels(new);\n[ 1, 2, 3, Group([ (1,2) ]) ]\ngap> D := \ CompleteBipartiteDigraph(IsMutableDigraph, 2, 3);\n\ngap> new := DigraphAddVertex(D);\n\ngap> D = new;\ntrue\n", count := [ 3, 3, 14, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 14, 7 ], mathmode := "Text", name := "Example", next := 68004, root := ~, start := 67405, stop := 68003 ), rec( content := "\n ", count := [ 3, 3, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 14, 3 ], mathmode := "Text", name := "Description", next := 68021, root := ~, start := 66853, stop := 68020 ) ], count := [ 3, 3, 14, 1 ], mathmode := "Text", name := "ManSection", next := 68035, root := ~, start := 66748, stop := 68034 ), rec( content := "\n\n ", count := [ 3, 3, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, m", Label := "for a digraph \ and an integer", Name := "DigraphAddVertices" ), content := 0, count := [ 3, 3, 15, 2 ], mathmode := "Text", name := "Oper", next := 68147, root := ~, start := 68056, stop := 68146 ), rec( attributes := rec( Arg := "digraph, labels" , Label := "for a digraph \ and a list of labels", Name := "DigraphAddVertices" ), content := 0, count := [ 3, 3, 15, 4 ], mathmode := "Text", name := "Oper", next := 68252, root := ~, start := 68150, stop := 68251 ), rec( content := " The 3-argument \ version is deliberately undocumented. It is redundant,\n but it is inclu\ ded for backwards compatibility. ", count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "Returns", next := 68420, root := ~, start := 68391, stop := 68419 ), rec( attributes := rec( ), content := [ rec( content := "\n For\ a non-negative integer ", count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "A", next := 68476, root := ~, start := 68468, stop := 68475 ), rec( content := ", this o\ peration returns a digraph\n constructed from ", count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "A", next := 68546, root := ~, start := 68532, stop := 68545 ), rec( content := " by addi\ ng ", count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "A", next := 68565, root := ~, start := 68557, stop := 68564 ), rec( content := " new ver\ tices.\n ", count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "P", next := 68588, root := ~, start := 68584, stop := 68587 ), rec( content := "\n\n \ Otherwise, if ", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ abels", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "A", next := 68621, root := ~, start := 68608, stop := 68620 ), rec( content := " is a li\ st\n consisting of ", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "C", next := 68658, root := ~, start := 68650, stop := 68657 ), rec( content := " ", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " objects\ , then this operation returns a\n digraph constructed from ", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "A", next := 68747, root := ~, start := 68733, stop := 68746 ), rec( content := " by addi\ ng ", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "C", next := 68766, root := ~, start := 68758, stop := 68765 ), rec( content := " new ver\ tices,\n which are labelled according to this list.\n ", count := [ 3, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "P", next := 68836, root := ~, start := 68832, stop := 68835 ), rec( content := "\n\n \ If ", count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "A", next := 68859, root := ~, start := 68845, stop := 68858 ), rec( content := " belongs\ to ", count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "Ref", next := 68901, root := ~, start := 68871, stop := 68900 ), rec( content := ", then t\ he\n vertices are added directly to ", count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "A", next := 68961, root := ~, start := 68947, stop := 68960 ), rec( content := ", which \ is changed in-place.\n If ", count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "A", next := 69011, root := ~, start := 68997, stop := 69010 ), rec( content := " belongs\ to ", count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "Ref", next := 69055, root := ~, start := 69023, stop := 69054 ), rec( content := ", then t\ he\n result is returned as an immutable digraph.\n ", count := [ 3, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 15, 8 ], mathmode := "Text", name := "P", next := 69122, root := ~, start := 69118, stop := 69121 ), rec( content := "\n\n \ ", count := [ 3, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(3);\n\n\ gap> new := DigraphAddVertices(D, 3);\n\ngap> DigraphVertices(new);\n[ 1 .. 6 ]\ngap> new := DigraphAddVertices(\ D, [Group([(1, 2)]), \"d\"]);\n\ng\ ap> DigraphVertexLabels(new);\n[ 1, 2, 3, Group([ (1,2) ]), \"d\" ]\ngap> Digr\ aphAddVertices(D, 0) = D;\ntrue\ngap> D := CompleteBipartiteDigraph(IsMutableD\ igraph, 2, 3);\n\ngap> new := Digra\ phAddVertices(D, 4);\n\ngap> D = ne\ w;\ntrue\n", count := [ 3, 3, 15, 9 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 9 ], mathmode := "Text", name := "Example", next := 69771, root := ~, start := 69128, stop := 69770 ), rec( content := "\n ", count := [ 3, 3, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 15, 5 ], mathmode := "Text", name := "Description", next := 69788, root := ~, start := 68423, stop := 69787 ) ], count := [ 3, 3, 15, 1 ], mathmode := "Text", name := "ManSection", next := 69802, root := ~, start := 68041, stop := 69801 ), rec( content := "\n\n ", count := [ 3, 3, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, edge", Label := "for a digraph \ and an edge", Name := "DigraphAddEdge" ), content := 0, count := [ 3, 3, 16, 2 ], mathmode := "Text", name := "Oper", next := 69910, root := ~, start := 69823, stop := 69909 ), rec( attributes := rec( Arg := "digraph, src, ra\ n", Label := "for a digraph, source, and range", Name := "DigraphAddEdge" ), content := 0, count := [ 3, 3, 16, 4 ], mathmode := "Text", name := "Oper", next := 70011, root := ~, start := 69913, stop := 70010 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "Returns", next := 70043, root := ~, start := 70014, stop := 70042 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70078, root := ~, start := 70067, stop := 70077 ), rec( content := " is a pa\ ir of vertices of ", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70118, root := ~, start := 70104, stop := 70117 ), rec( content := ", or ", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70133, root := ~, start := 70123, stop := 70132 ), rec( content := " and\n \ ", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70152, root := ~, start := 70142, stop := 70151 ), rec( content := " are ver\ tices of ", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70183, root := ~, start := 70169, stop := 70182 ), rec( content := ",\n t\ hen this operation returns a digraph constructed from ", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70258, root := ~, start := 70244, stop := 70257 ), rec( content := "\n by\ adding a new edge with source ", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70307, root := ~, start := 70296, stop := 70306 ), rec( attributes := rec( ), content := [ rec( content := "[\ 1]", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "C", next := 70317, root := ~, start := 70307, stop := 70316 ), rec( content := " [", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70329, root := ~, start := 70319, stop := 70328 ), rec( content := "] and ra\ nge\n ", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70356, root := ~, start := 70345, stop := 70355 ), rec( attributes := rec( ), content := [ rec( content := "[\ 2]", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "C", next := 70366, root := ~, start := 70356, stop := 70365 ), rec( content := " [", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "A", next := 70378, root := ~, start := 70368, stop := 70377 ), rec( content := "].\n \ ", count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := 0, count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "P", next := 70389, root := ~, start := 70385, stop := 70388 ), rec( content := "\n \n\ If ", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "A", next := 70416, root := ~, start := 70402, stop := 70415 ), rec( content := " belongs\ to ", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "Ref", next := 70458, root := ~, start := 70428, stop := 70457 ), rec( content := ", then t\ he edge\n is added directly to ", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "A", next := 70513, root := ~, start := 70499, stop := 70512 ), rec( content := ". If ", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "A", next := 70532, root := ~, start := 70518, stop := 70531 ), rec( content := " belongs\ to ", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "Ref", next := 70582, root := ~, start := 70544, stop := 70581 ), rec( content := ", then a\ n immutable copy of ", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "A", next := 70624, root := ~, start := 70610, stop := 70623 ), rec( content := " with th\ e\n additional edge is returned. ", count := [ 3, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 16, 7 ], mathmode := "Text", name := "P", next := 70672, root := ~, start := 70668, stop := 70671 ), rec( content := "\n\n \ ", count := [ 3, 3, 16, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D1 := Digraph([[2], [3], []]);\n\ngap> DigraphEdges(D1);\n[ [ 1, 2 ], [ 2, 3 ] ]\ngap> D2 := DigraphAddEdg\ e(D1, [3, 1]);\n\ngap> DigraphEdge\ s(D2);\n[ [ 1, 2 ], [ 2, 3 ], [ 3, 1 ] ]\ngap> D3 := DigraphAddEdge(D2, [2, 3]\ );\n\ngap> DigraphEdges(D3);\ \n[ [ 1, 2 ], [ 2, 3 ], [ 2, 3 ], [ 3, 1 ] ]\ngap> D := CycleDigraph(IsMutable\ Digraph, 4);\n\ngap> new := DigraphA\ ddEdge(D, [1, 3]);\n\ngap> DigraphEd\ ges(new);\n[ [ 1, 2 ], [ 1, 3 ], [ 2, 3 ], [ 3, 4 ], [ 4, 1 ] ]\ngap> D = new;\ \ntrue\n", count := [ 3, 3, 16, 8 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 8 ], mathmode := "Text", name := "Example", next := 71398, root := ~, start := 70678, stop := 71397 ), rec( content := "\n ", count := [ 3, 3, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 16, 5 ], mathmode := "Text", name := "Description", next := 71415, root := ~, start := 70046, stop := 71414 ) ], count := [ 3, 3, 16, 1 ], mathmode := "Text", name := "ManSection", next := 71429, root := ~, start := 69808, stop := 71428 ), rec( content := "\n\n ", count := [ 3, 3, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, edge", Name := "DigraphAddEdgeO\ rbit" ), content := 0, count := [ 3, 3, 17, 2 ], mathmode := "Text", name := "Oper", next := 71504, root := ~, start := 71450, stop := 71503 ), rec( attributes := rec( ), content := [ rec( content := "\n A n\ ew digraph.\n ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "Returns", next := 71548, root := ~, start := 71507, stop := 71547 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation returns a new digraph with the same vertices and edges as\n ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "A", next := 71660, root := ~, start := 71646, stop := 71659 ), rec( content := " and wit\ h additional edges consisting of the orbit of the\n edge ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "A", next := 71738, root := ~, start := 71727, stop := 71737 ), rec( content := " under t\ he action of the ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Group" ), content := 0, count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "Ref", next := 71789, root := ~, start := 71763, stop := 71788 ), rec( content := " of\n \ ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "A", next := 71811, root := ~, start := 71797, stop := 71810 ), rec( content := ". If ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "A", next := 71828, root := ~, start := 71817, stop := 71827 ), rec( content := " is alre\ ady an edge in ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "A", next := 71865, root := ~, start := 71851, stop := 71864 ), rec( content := ", then\n\ ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "A", next := 71890, root := ~, start := 71876, stop := 71889 ), rec( content := " is retu\ rned unchanged. The argument ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "A", next := 71941, root := ~, start := 71927, stop := 71940 ), rec( content := " must be\ \n an immutable digraph.\n ", count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 17, 4 ], mathmode := "Text", name := "P", next := 71984, root := ~, start := 71980, stop := 71983 ), rec( content := "\n\n \ An edge is simply a pair of vertices of ", count := [ 3, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 4 ], mathmode := "Text", name := "A", next := 72044, root := ~, start := 72030, stop := 72043 ), rec( content := ".\n\n \ ", count := [ 3, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := CayleyDigraph(DihedralGroup(8));\n\ngap> gr2 := DigraphAddEdgeOrbit(gr1, [1, 8]);\n\ngap> DigraphEdges(gr1);\n[ [ 1, 2 ], [ 1, 3 ],\ [ 1, 4 ], [ 2, 1 ], [ 2, 8 ], [ 2, 6 ], \n [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [ 4\ , 6 ], [ 4, 7 ], [ 4, 1 ], \n [ 5, 3 ], [ 5, 2 ], [ 5, 8 ], [ 6, 4 ], [ 6, 5 \ ], [ 6, 2 ], \n [ 7, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 7 ], [ 8, 6 ], [ 8, 5 ] ]\ \ngap> DigraphEdges(gr2);\n[ [ 1, 2 ], [ 1, 3 ], [ 1, 4 ], [ 1, 8 ], [ 2, 1 ],\ [ 2, 8 ], \n [ 2, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [ 3, 2 ], \n \ [ 4, 6 ], [ 4, 7 ], [ 4, 1 ], [ 4, 5 ], [ 5, 3 ], [ 5, 2 ], \n [ 5, 8 ], [ 5\ , 4 ], [ 6, 4 ], [ 6, 5 ], [ 6, 2 ], [ 6, 7 ], \n [ 7, 8 ], [ 7, 1 ], [ 7, 3 \ ], [ 7, 6 ], [ 8, 7 ], [ 8, 6 ], \n [ 8, 5 ], [ 8, 1 ] ]\ngap> gr3 := Digraph\ RemoveEdgeOrbit(gr2, [1, 8]);\n\n\ gap> gr3 = gr1;\ntrue\n", count := [ 3, 3, 17, 5 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 5 ], mathmode := "Text", name := "Example", next := 73020, root := ~, start := 72051, stop := 73019 ), rec( content := "\n ", count := [ 3, 3, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 17, 3 ], mathmode := "Text", name := "Description", next := 73037, root := ~, start := 71551, stop := 73036 ) ], count := [ 3, 3, 17, 1 ], mathmode := "Text", name := "ManSection", next := 73051, root := ~, start := 71435, stop := 73050 ), rec( content := "\n\n ", count := [ 3, 3, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, edges", Name := "DigraphAddEdges\ " ), content := 0, count := [ 3, 3, 18, 2 ], mathmode := "Text", name := "Oper", next := 73123, root := ~, start := 73072, stop := 73122 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "Returns", next := 73155, root := ~, start := 73126, stop := 73154 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "A", next := 73191, root := ~, start := 73179, stop := 73190 ), rec( content := " is a (p\ ossibly empty) list of pairs of vertices of\n ", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "A", next := 73261, root := ~, start := 73247, stop := 73260 ), rec( content := ", then t\ his operation returns a digraph constructed from\n ", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "A", next := 73336, root := ~, start := 73322, stop := 73335 ), rec( content := " by addi\ ng the edges specified by ", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "A", next := 73382, root := ~, start := 73370, stop := 73381 ), rec( content := ". More\\ n precisely, for every ", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "C", next := 73426, root := ~, start := 73415, stop := 73425 ), rec( content := " in ", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "A", next := 73442, root := ~, start := 73430, stop := 73441 ), rec( content := ", a new \ edge\n will be added with source ", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge[1]", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "C", next := 73499, root := ~, start := 73485, stop := 73498 ), rec( content := " and ran\ ge ", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges[2]", count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "C", next := 73525, root := ~, start := 73510, stop := 73524 ), rec( content := ".\n " , count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "P", next := 73535, root := ~, start := 73531, stop := 73534 ), rec( content := "\n\n \ If an edge is included in ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "A", next := 73579, root := ~, start := 73567, stop := 73578 ), rec( content := " with mu\ ltiplicity ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "C", next := 73606, root := ~, start := 73598, stop := 73605 ), rec( content := ",\n t\ hen it will be added ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "C", next := 73642, root := ~, start := 73634, stop := 73641 ), rec( content := " times.\\ n\n If ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "A", next := 73672, root := ~, start := 73658, stop := 73671 ), rec( content := " belongs\ to ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "Ref", next := 73714, root := ~, start := 73684, stop := 73713 ), rec( content := ", then t\ he edges\n are added directly to ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "A", next := 73771, root := ~, start := 73757, stop := 73770 ), rec( content := ". If ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "A", next := 73790, root := ~, start := 73776, stop := 73789 ), rec( content := " belongs\ to ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "Ref", next := 73840, root := ~, start := 73802, stop := 73839 ), rec( content := ", then t\ he result is returned as an immutable\n digraph.\n ", count := [ 3, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 18, 5 ], mathmode := "Text", name := "P", next := 73907, root := ~, start := 73903, stop := 73906 ), rec( content := "\n\n \ ", count := [ 3, 3, 18, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> func := function(n)\n> local source, range, i;\n> source := [];\n> ra\ nge := [];\n> for i in [1 .. n - 2] do\n> Add(source, i);\n> Add(range\ , i + 1);\n> od;\n> return Digraph(n, source, range);\n> end;;\ngap> D := fu\ nc(1024);\n\ngap> new := Dig\ raphAddEdges(D,\n> [[1023, 1024], [1, 1024], [1023, 1024], [1024, 1]]);\n\ngap> D = new;\nfalse\ngap>\ D2 := DigraphMutableCopy(func(1024));\n\ngap> new := DigraphAddEdges(D2,\n> [[1023, 1024], [1, 1024], [1023\ , 1024], [1024, 1]]);\n\n\ gap> D2 = new;\ntrue\n", count := [ 3, 3, 18, 6 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 6 ], mathmode := "Text", name := "Example", next := 74644, root := ~, start := 73913, stop := 74643 ), rec( content := "\n ", count := [ 3, 3, 18, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 18, 3 ], mathmode := "Text", name := "Description", next := 74661, root := ~, start := 73158, stop := 74660 ) ], count := [ 3, 3, 18, 1 ], mathmode := "Text", name := "ManSection", next := 74675, root := ~, start := 73057, stop := 74674 ), rec( content := "\n\n ", count := [ 3, 3, 18, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, v", Name := "DigraphRemoveVe\ rtex" ), content := 0, count := [ 3, 3, 19, 2 ], mathmode := "Text", name := "Oper", next := 74747, root := ~, start := 74696, stop := 74746 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "Returns", next := 74779, root := ~, start := 74750, stop := 74778 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "A", next := 74811, root := ~, start := 74803, stop := 74810 ), rec( content := " is a ve\ rtex of ", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "A", next := 74841, root := ~, start := 74827, stop := 74840 ), rec( content := ", then t\ his operation returns a\n digraph constructed from ", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "A", next := 74916, root := ~, start := 74902, stop := 74915 ), rec( content := " by remo\ ving vertex ", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "A", next := 74944, root := ~, start := 74936, stop := 74943 ), rec( content := ",\n a\ long with any edge whose source or range vertex is ", count := [ 3, 3, 19, 3 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "A", next := 75010, root := ~, start := 75002, stop := 75009 ), rec( content := ".", count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "P", next := 75015, root := ~, start := 75011, stop := 75014 ), rec( content := "\n\n \ If ", count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "A", next := 75038, root := ~, start := 75024, stop := 75037 ), rec( content := " has ", count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "C", next := 75051, root := ~, start := 75043, stop := 75050 ), rec( content := " vertice\ s, then the vertices of the returned\n digraph are ", count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1..n-1]", count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "C", next := 75127, root := ~, start := 75112, stop := 75126 ), rec( content := ", but th\ e original labels can be\n accessed via ", count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "Ref", next := 75210, root := ~, start := 75177, stop := 75209 ), rec( content := ". ", count := [ 3, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "P", next := 75216, root := ~, start := 75212, stop := 75215 ), rec( content := "\n\n \ If ", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "A", next := 75239, root := ~, start := 75225, stop := 75238 ), rec( content := " belongs\ to ", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "Ref", next := 75281, root := ~, start := 75251, stop := 75280 ), rec( content := ", then t\ he\n vertex is removed directly from ", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "A", next := 75342, root := ~, start := 75328, stop := 75341 ), rec( content := ". If ", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "A", next := 75361, root := ~, start := 75347, stop := 75360 ), rec( content := " belongs\ \n to ", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "Ref", next := 75409, root := ~, start := 75377, stop := 75408 ), rec( content := ", an imm\ utable copy of ", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "A", next := 75446, root := ~, start := 75432, stop := 75445 ), rec( content := "\n wi\ thout the vertex is returned.", count := [ 3, 3, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 19, 6 ], mathmode := "Text", name := "P", next := 75486, root := ~, start := 75482, stop := 75485 ), rec( content := "\n\n \ ", count := [ 3, 3, 19, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\"a\", \"b\", \"c\"],\n> [\"a\", \"a\", \ \"b\", \"c\", \"c\"],\n> [\"b\", \"c\", \"a\", \"a\", \"c\"])\ ;\n\ngap> DigraphVertexLabels(D);\ \n[ \"a\", \"b\", \"c\" ]\ngap> DigraphEdges(D);\n[ [ 1, 2 ], [ 1, 3 ], [ 2, 1\ ], [ 3, 1 ], [ 3, 3 ] ]\ngap> new := DigraphRemoveVertex(D, 2);\n\ngap> DigraphVertexLabels(new);\n[ \"a\", \"c\ \" ]\ngap> D := CycleDigraph(IsMutableDigraph, 5);\n\ngap> new := DigraphRemoveVertex(D, 1);\n\ngap> DigraphVertexLabels(D);\n[ 2, 3, 4, 5 ]\ngap> D =\ new;\ntrue\n", count := [ 3, 3, 19, 7 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 7 ], mathmode := "Text", name := "Example", next := 76180, root := ~, start := 75492, stop := 76179 ), rec( content := "\n ", count := [ 3, 3, 19, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 19, 3 ], mathmode := "Text", name := "Description", next := 76197, root := ~, start := 74782, stop := 76196 ) ], count := [ 3, 3, 19, 1 ], mathmode := "Text", name := "ManSection", next := 76211, root := ~, start := 74681, stop := 76210 ), rec( content := "\n\n ", count := [ 3, 3, 19, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, verts", Name := "DigraphRemoveVe\ rtices" ), content := 0, count := [ 3, 3, 20, 2 ], mathmode := "Text", name := "Oper", next := 76289, root := ~, start := 76232, stop := 76288 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "Returns", next := 76321, root := ~, start := 76292, stop := 76320 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "v\ erts", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "A", next := 76357, root := ~, start := 76345, stop := 76356 ), rec( content := " is a (p\ ossibly empty) duplicate-free list of vertices of\n ", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "A", next := 76433, root := ~, start := 76419, stop := 76432 ), rec( content := ", then t\ his operation returns a digraph constructed from\n ", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "A", next := 76508, root := ~, start := 76494, stop := 76507 ), rec( content := " by remo\ ving every vertex in ", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ erts", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "A", next := 76549, root := ~, start := 76537, stop := 76548 ), rec( content := ", along \ with any edge\n whose source or range vertex is in ", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ erts", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "A", next := 76622, root := ~, start := 76610, stop := 76621 ), rec( content := ".", count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "P", next := 76627, root := ~, start := 76623, stop := 76626 ), rec( content := "\n\n \ If ", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "A", next := 76650, root := ~, start := 76636, stop := 76649 ), rec( content := " has ", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "C", next := 76663, root := ~, start := 76655, stop := 76662 ), rec( content := " vertice\ s, then the vertices of the new\n digraph are ", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. n-Length(", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "vert\ s", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 4 ], mathmode := \ "Text", name := "A", next := 76749, root := ~, start := 76737, stop := 76748 ) , rec( content := "\ )]", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "C", next := 76755, root := ~, start := 76719, stop := 76754 ), rec( content := ", but th\ e\n original labels can be accessed via ", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "Ref", next := 76838, root := ~, start := 76805, stop := 76837 ), rec( content := ". ", count := [ 3, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "P", next := 76844, root := ~, start := 76840, stop := 76843 ), rec( content := "\n\n \ If ", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "A", next := 76867, root := ~, start := 76853, stop := 76866 ), rec( content := " belongs\ to ", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "Ref", next := 76909, root := ~, start := 76879, stop := 76908 ), rec( content := ", then t\ he\n vertices are removed directly from ", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "A", next := 76973, root := ~, start := 76959, stop := 76972 ), rec( content := ". If ", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "A", next := 76992, root := ~, start := 76978, stop := 76991 ), rec( content := " belongs\ \n to ", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "Ref", next := 77040, root := ~, start := 77008, stop := 77039 ), rec( content := ", an imm\ utable copy of ", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "A", next := 77077, root := ~, start := 77063, stop := 77076 ), rec( content := "\n wi\ thout the vertices is returned.", count := [ 3, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 20, 6 ], mathmode := "Text", name := "P", next := 77119, root := ~, start := 77115, stop := 77118 ), rec( content := "\n\n \ ", count := [ 3, 3, 20, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3], [1, 3, 5], [1], [1, 2, 4], [2, 3, 5]]);\n\ngap> SetDigraphVertexLabels(D, [\"a\", \"b\ \", \"c\", \"d\", \"e\"]);\ngap> new := DigraphRemoveVertices(D, [2, 4]);\n\ngap> DigraphVertexLabels(new);\n[ \ \"a\", \"c\", \"e\" ]\ngap> D := CycleDigraph(IsMutableDigraph, 5);\n\ngap> new := DigraphRemoveVertices(D, [1, 3]\ );\n\ngap> DigraphVertexLabels(D);\n[\ 2, 4, 5 ]\ngap> D = new;\ntrue\n", count := [ 3, 3, 20, 7 ], name := "PCDATA" , root := ~ ) ], count := [ 3, 3, 20, 7 ], mathmode := "Text", name := "Example", next := 77702, root := ~, start := 77125, stop := 77701 ), rec( content := "\n ", count := [ 3, 3, 20, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 20, 3 ], mathmode := "Text", name := "Description", next := 77719, root := ~, start := 76324, stop := 77718 ) ], count := [ 3, 3, 20, 1 ], mathmode := "Text", name := "ManSection", next := 77733, root := ~, start := 76217, stop := 77732 ), rec( content := "\n\n ", count := [ 3, 3, 20, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, edge", Label := "for a digraph \ and an edge", Name := "DigraphRemoveEdge" ), content := 0, count := [ 3, 3, 21, 2 ], mathmode := "Text", name := "Oper", next := 77844, root := ~, start := 77754, stop := 77843 ), rec( attributes := rec( Arg := "digraph, src, ra\ n", Label := "for a digraph, source, and range", Name := "DigraphRemoveEdge" ) , content := 0, count := [ 3, 3, 21, 4 ], mathmode := "Text", name := "Oper", next := 77948, root := ~, start := 77847, stop := 77947 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "Returns", next := 77980, root := ~, start := 77951, stop := 77979 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "A", next := 78018, root := ~, start := 78004, stop := 78017 ), rec( content := " is a di\ graph with no multiple edges and ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "A", next := 78070, root := ~, start := 78059, stop := 78069 ), rec( content := " is a\n \ pair of vertices of ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "A", next := 78114, root := ~, start := 78100, stop := 78113 ), rec( content := ", or ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "A", next := 78129, root := ~, start := 78119, stop := 78128 ), rec( content := " and ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "A", next := 78144, root := ~, start := 78134, stop := 78143 ), rec( content := " are\n \ vertices of ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "A", next := 78179, root := ~, start := 78165, stop := 78178 ), rec( content := ", then t\ his operation returns a digraph\n constructed from ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "A", next := 78254, root := ~, start := 78240, stop := 78253 ), rec( content := " by remo\ ving the edge specified by\n ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "A", next := 78304, root := ~, start := 78293, stop := 78303 ), rec( content := " or ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ src, ran]", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "A", next := 78325, root := ~, start := 78308, stop := 78324 ), rec( content := ". ", count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "P", next := 78331, root := ~, start := 78327, stop := 78330 ), rec( content := " \n\n \ If ", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "A", next := 78356, root := ~, start := 78342, stop := 78355 ), rec( content := " belongs\ to ", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "Ref", next := 78404, root := ~, start := 78368, stop := 78403 ), rec( content := ", then t\ he edge is removed directly from\n ", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "A", next := 78463, root := ~, start := 78449, stop := 78462 ), rec( content := ". If ", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "A", next := 78482, root := ~, start := 78468, stop := 78481 ), rec( content := " belongs\ to ", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "Ref", next := 78532, root := ~, start := 78494, stop := 78531 ), rec( content := ", an imm\ utable copy of ", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "A", next := 78569, root := ~, start := 78555, stop := 78568 ), rec( content := " without\ \n the edge is returned.\n ", count := [ 3, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "P", next := 78612, root := ~, start := 78608, stop := 78611 ), rec( content := "\n\n \ Note that if ", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "A", next := 78645, root := ~, start := 78631, stop := 78644 ), rec( content := " belongs\ to ", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "Ref", next := 78689, root := ~, start := 78657, stop := 78688 ), rec( content := ",\n t\ hen a new copy of ", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "A", next := 78728, root := ~, start := 78714, stop := 78727 ), rec( content := " will be\ returned even if ", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "A", next := 78765, root := ~, start := 78754, stop := 78764 ), rec( content := " or \n \ ", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ src, ran]", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "A", next := 78791, root := ~, start := 78774, stop := 78790 ), rec( content := " does no\ t define an edge of ", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "A", next := 78833, root := ~, start := 78819, stop := 78832 ), rec( content := ".", count := [ 3, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 21, 8 ], mathmode := "Text", name := "P", next := 78838, root := ~, start := 78834, stop := 78837 ), rec( content := "\n\n \ ", count := [ 3, 3, 21, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(250000);\n\ngap> D := DigraphRemoveEdge(D, [250000, 1]);\n\ngap> new := DigraphRemoveEdge(D, [25000, 2]);;\nga\ p> new = D;\ntrue\ngap> IsIdenticalObj(new, D);\nfalse\ngap> D := DigraphMutab\ leCopy(D);;\ngap> new := DigraphRemoveEdge(D, 2500, 2);;\ngap> IsIdenticalObj(\ new, D);\ntrue\n", count := [ 3, 3, 21, 9 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 9 ], mathmode := "Text", name := "Example", next := 79268, root := ~, start := 78844, stop := 79267 ), rec( content := "\n ", count := [ 3, 3, 21, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 21, 5 ], mathmode := "Text", name := "Description", next := 79285, root := ~, start := 77983, stop := 79284 ) ], count := [ 3, 3, 21, 1 ], mathmode := "Text", name := "ManSection", next := 79299, root := ~, start := 77739, stop := 79298 ), rec( content := "\n\n ", count := [ 3, 3, 21, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, edge", Name := "DigraphRemoveEd\ geOrbit" ), content := 0, count := [ 3, 3, 22, 2 ], mathmode := "Text", name := "Oper", next := 79377, root := ~, start := 79320, stop := 79376 ), rec( attributes := rec( ), content := [ rec( content := "\n A n\ ew digraph.\n ", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "Returns", next := 79421, root := ~, start := 79380, stop := 79420 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation returns a new digraph with the same vertices as\n ", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "A", next := 79523, root := ~, start := 79509, stop := 79522 ), rec( content := " and wit\ h the orbit of the edge ", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "A", next := 79566, root := ~, start := 79555, stop := 79565 ), rec( content := " (under \ the action\n of the ", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Group" ), content := 0, count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "Ref", next := 79622, root := ~, start := 79596, stop := 79621 ), rec( content := " of ", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "A", next := 79640, root := ~, start := 79626, stop := 79639 ), rec( content := ") remove\ d.\n If ", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "A", next := 79669, root := ~, start := 79658, stop := 79668 ), rec( content := " is not \ an edge in ", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "A", next := 79702, root := ~, start := 79688, stop := 79701 ), rec( content := ", then " , count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "A", next := 79723, root := ~, start := 79709, stop := 79722 ), rec( content := " is\n \ returned unchanged. The argument ", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "A", next := 79778, root := ~, start := 79764, stop := 79777 ), rec( content := " must be\ an immutable\n digraph.\n ", count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 22, 4 ], mathmode := "Text", name := "P", next := 79821, root := ~, start := 79817, stop := 79820 ), rec( content := "\n\n \ An edge is simply a pair of vertices of ", count := [ 3, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 4 ], mathmode := "Text", name := "A", next := 79881, root := ~, start := 79867, stop := 79880 ), rec( content := ".\n " , count := [ 3, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := CayleyDigraph(DihedralGroup(8));\n\ngap> gr2 := DigraphAddEdgeOrbit(gr1, [1, 8]);\n\ngap> DigraphEdges(gr1);\n[ [ 1, 2 ], [ 1, 3 ],\ [ 1, 4 ], [ 2, 1 ], [ 2, 8 ], [ 2, 6 ], \n [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [ 4\ , 6 ], [ 4, 7 ], [ 4, 1 ], \n [ 5, 3 ], [ 5, 2 ], [ 5, 8 ], [ 6, 4 ], [ 6, 5 \ ], [ 6, 2 ], \n [ 7, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 7 ], [ 8, 6 ], [ 8, 5 ] ]\ \ngap> DigraphEdges(gr2);\n[ [ 1, 2 ], [ 1, 3 ], [ 1, 4 ], [ 1, 8 ], [ 2, 1 ],\ [ 2, 8 ], \n [ 2, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [ 3, 2 ], \n \ [ 4, 6 ], [ 4, 7 ], [ 4, 1 ], [ 4, 5 ], [ 5, 3 ], [ 5, 2 ], \n [ 5, 8 ], [ 5\ , 4 ], [ 6, 4 ], [ 6, 5 ], [ 6, 2 ], [ 6, 7 ], \n [ 7, 8 ], [ 7, 1 ], [ 7, 3 \ ], [ 7, 6 ], [ 8, 7 ], [ 8, 6 ], \n [ 8, 5 ], [ 8, 1 ] ]\ngap> gr3 := Digraph\ RemoveEdgeOrbit(gr2, [1, 8]);\n\n\ gap> gr3 = gr1;\ntrue\n", count := [ 3, 3, 22, 5 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 5 ], mathmode := "Text", name := "Example", next := 80856, root := ~, start := 79887, stop := 80855 ), rec( content := "\n ", count := [ 3, 3, 22, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 22, 3 ], mathmode := "Text", name := "Description", next := 80873, root := ~, start := 79424, stop := 80872 ) ], count := [ 3, 3, 22, 1 ], mathmode := "Text", name := "ManSection", next := 80887, root := ~, start := 79305, stop := 80886 ), rec( content := "\n\n ", count := [ 3, 3, 22, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, edges", Name := "DigraphRemoveEd\ ges" ), content := 0, count := [ 3, 3, 23, 2 ], mathmode := "Text", name := "Oper", next := 80962, root := ~, start := 80908, stop := 80961 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 3 ], mathmode := "Text", name := "Returns", next := 80994, root := ~, start := 80965, stop := 80993 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ one of the following holds:\n ", count := [ 3, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 3, 3, 23, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "digraph", count := [ 3, 3, 23, 5 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 5 ], mathmode := "Te\ xt", name := "A", next := 81092, root := ~, start := 81078, stop := 81091 ), rec( cont\ ent := " is a digraph with no multiple edges, and\n ", count := [ 3, 3,\ 23, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "edges", count := [ 3, 3, 23, 5 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 5 ], math\ mode := "Text", name := "A", next := 81154, root := ~, start := 81142, stop :=\ 81153 ), rec( content := " is a list of pairs of vertices of ", count := [ 3,\ 3, 23, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribute\ s := rec( ), content := [ rec( content := "digraph", count := [ 3, 3, 23, 5 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 5 ] , math\ mode := "Text", name := "A", next := 81203, root := ~, start := 81189, stop :=\ 81202 ), rec( content := ", or\n ", count := [ 3, 3, 23, 5 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 5 ], name := "Ite\ m", next := 81221, root := ~, start := 81063, stop := 81220 ), rec( attributes :\ = rec( ), content := [ rec( content := " ", count := [ 3, 3, 23, 7 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conten\ t := [ rec( content := "digraph", count := [ 3, 3, 23, 7 ], mathmode := "Text"\ , name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 7 ], mathmode := "Text\ ", name := "A", next := 81249, root := ~, start := 81235, stop := 81248 ), rec( cont\ ent := " is a digraph and ", count := [ 3, 3, 23, 7 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "edges", count := [ 3, 3, 23, 7 ], mathmode := "Text", name := "PCDATA",\ root := ~ ) ], count := [ 3, 3, 23, 7 ], mathmode := "Text", name := "A", next\ := 81279, root := ~, start := 81267, stop := 81278 ), rec( content := " is an\ empty list ", count := [ 3, 3, 23, 7 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 3, 3, 23, 7 ], name := "Item", next := 81304, root := ~, start := 812\ 28, stop := 81303 ) ], count := [ 3, 3, 23, 4 ], mathmode := "Text", name := "List", next := 81316, root := ~, start := 81050, stop := 81315 ), rec( content := "\n\n \ then this operation returns a digraph constructed from ", count := [ 3, 3, 23, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 23, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 9 ], mathmode := "Text", name := "A", next := 81391, root := ~, start := 81377, stop := 81390 ), rec( content := "\n by\ removing all of the edges specified by ", count := [ 3, 3, 23, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 3, 23, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 9 ], mathmode := "Text", name := "A", next := 81450, root := ~, start := 81438, stop := 81449 ), rec( content := "\n (s\ ee ", count := [ 3, 3, 23, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and an edge", Oper := "DigraphRemoveEdge" ), content := 0, count := [ 3, 3, 23, 9 ], mathmode := "Text", name := "Ref", next := 81525, root := ~, start := 81460, stop := 81524 ), rec( content := ").\n \ ", count := [ 3, 3, 23, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := 0, count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "P", next := 81536, root := ~, start := 81532, stop := 81535 ), rec( content := "\n\n \ If ", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "A", next := 81559, root := ~, start := 81545, stop := 81558 ), rec( content := " belongs\ to ", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "Ref", next := 81601, root := ~, start := 81571, stop := 81600 ), rec( content := ", then t\ he edge\n is removed directly from ", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "A", next := 81660, root := ~, start := 81646, stop := 81659 ), rec( content := ". If ", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "A", next := 81679, root := ~, start := 81665, stop := 81678 ), rec( content := " belongs\ to ", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "Ref", next := 81729, root := ~, start := 81691, stop := 81728 ), rec( content := ", the ed\ ge is removed from an immutable copy of\n ", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "A", next := 81795, root := ~, start := 81781, stop := 81794 ), rec( content := " and thi\ s new digraph is returned.", count := [ 3, 3, 23, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "P", next := 81833, root := ~, start := 81829, stop := 81832 ), rec( content := "\n\n \ Note that if ", count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "A", next := 81864, root := ~, start := 81852, stop := 81863 ), rec( content := " is empt\ y, then this operation\n will always return ", count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "A", next := 81932, root := ~, start := 81918, stop := 81931 ), rec( content := " rather \ than a copy. Also, if any element\n of ", count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "A", next := 81993, root := ~, start := 81981, stop := 81992 ), rec( content := " is inva\ lid (i.e. does not define an edge of ", count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "A", next := 82052, root := ~, start := 82038, stop := 82051 ), rec( content := ")\n t\ hen that element will simply be ignored.\n\n ", count := [ 3, 3, 23, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(250000);\n\ngap> D := DigraphRemoveEdges(D, [[250000, 1]]);\n\ngap> D := DigraphMutableCopy(D);\n\ngap> new := DigraphRemoveEdges(D, [[1\ , 2], [2, 3], [3, 100]]);\n\ngap> new = D;\ntrue\n", count := [ 3, 3, 23, 12 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 12 ], mathmode := "Text", name := "Example", next := 82540, root := ~, start := 82105, stop := 82539 ), rec( content := "\n ", count := [ 3, 3, 23, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 23, 3 ], mathmode := "Text", name := "Description", next := 82557, root := ~, start := 80997, stop := 82556 ) ], count := [ 3, 3, 23, 1 ], mathmode := "Text", name := "ManSection", next := 82571, root := ~, start := 80893, stop := 82570 ), rec( content := "\n\n ", count := [ 3, 3, 23, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphRemoveLo\ ops" ), content := 0, count := [ 3, 3, 24, 2 ], mathmode := "Text", name := "Oper", next := 82639, root := ~, start := 82592, stop := 82638 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphRemoveLo\ opsAttr" ), content := 0, count := [ 3, 3, 24, 4 ], mathmode := "Text", name := "Attr", next := 82693, root := ~, start := 82642, stop := 82692 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "Returns", next := 82725, root := ~, start := 82696, stop := 82724 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "A", next := 82763, root := ~, start := 82749, stop := 82762 ), rec( content := " is a di\ graph, then this operation returns a\n digraph constructed from ", count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "A", next := 82852, root := ~, start := 82838, stop := 82851 ), rec( content := " by remo\ ving every loop. A loop\n is an edge with equal source and range.", count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 24, 6 ], mathmode := "Text", name := "P", next := 82931, root := ~, start := 82927, stop := 82930 ), rec( content := "\n\n \ If ", count := [ 3, 3, 24, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 24, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 24, 6 ], mathmode := "Text", name := "A", next := 82954, root := ~, start := 82940, stop := 82953 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the loops are\ removed from the mutable digraph ", count := [ 3, 3, 24, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 24, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 24, 6 ], mathmode := "Text", name := "A", next := 83087, root := ~, start := 83073, stop := 83086 ), rec( content := "\n in\ -place.\n ", count := [ 3, 3, 24, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2, 4], [1, 4], [3, 4], [1, 4, 5], [1, 5]]);\n\ngap> DigraphRemoveLoops(D);\n\ngap> D := Digraph(IsMutableDigraph, [[1, 2]\ , [1]]);\n\ngap> DigraphRemoveLoops(\ D);\n\ngap> D;\n\n", count := [ 3, 3, 24, 7 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 24, 7 ], mathmode := "Text", name := "Example", next := 83541, root := ~, start := 83106, stop := 83540 ), rec( content := "\n ", count := [ 3, 3, 24, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 24, 5 ], mathmode := "Text", name := "Description", next := 83558, root := ~, start := 82728, stop := 83557 ) ], count := [ 3, 3, 24, 1 ], mathmode := "Text", name := "ManSection", next := 83572, root := ~, start := 82577, stop := 83571 ), rec( content := "\n\n ", count := [ 3, 3, 24, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphRemoveAl\ lMultipleEdges" ), content := 0, count := [ 3, 3, 25, 2 ], mathmode := "Text", name := "Oper", next := 83651, root := ~, start := 83593, stop := 83650 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphRemoveAl\ lMultipleEdgesAttr" ), content := 0, count := [ 3, 3, 25, 4 ], mathmode := "Text", name := "Attr", next := 83716, root := ~, start := 83654, stop := 83715 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "Returns", next := 83748, root := ~, start := 83719, stop := 83747 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "A", next := 83786, root := ~, start := 83772, stop := 83785 ), rec( content := " is a di\ graph, then this operation returns a\n digraph constructed from ", count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "A", next := 83875, root := ~, start := 83861, stop := 83874 ), rec( content := " by remo\ ving all multiple edges.\n The result is the largest subdigraph of ", count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "A", next := 83966, root := ~, start := 83952, stop := 83965 ), rec( content := " which d\ oes not\n contain multiple edges.", count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 25, 6 ], mathmode := "Text", name := "P", next := 84013, root := ~, start := 84009, stop := 84012 ), rec( content := "\n\n \ If ", count := [ 3, 3, 25, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 25, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 25, 6 ], mathmode := "Text", name := "A", next := 84036, root := ~, start := 84022, stop := 84035 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the multiple \ edges of the mutable digraph ", count := [ 3, 3, 25, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 25, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 25, 6 ], mathmode := "Text", name := "A", next := 84164, root := ~, start := 84150, stop := 84163 ), rec( content := " are\n \ removed in-place.\n ", count := [ 3, 3, 25, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D1 := Digraph([[1, 2, 3, 2], [1, 1, 3], [2, 2, 2]]);\n\ngap> D2 := DigraphRemoveAllMultipleEdges(D1)\ ;\n\ngap> OutNeighbours(D2);\n[ [ \ 1, 2, 3 ], [ 1, 3 ], [ 2 ] ]\ngap> D := Digraph(IsMutableDigraph, [[2, 2], [1]\ ]);\n\ngap> DigraphRemoveAllMul\ tipleEdges(D);\n\ngap> D;\n\n", count := [ 3, 3, 25, 7 ], name := "PCDAT\ A", root := ~ ) ], count := [ 3, 3, 25, 7 ], mathmode := "Text", name := "Example", next := 84717, root := ~, start := 84195, stop := 84716 ), rec( content := "\n ", count := [ 3, 3, 25, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 25, 5 ], mathmode := "Text", name := "Description", next := 84734, root := ~, start := 83751, stop := 84733 ) ], count := [ 3, 3, 25, 1 ], mathmode := "Text", name := "ManSection", next := 84748, root := ~, start := 83578, stop := 84747 ), rec( content := "\n\n ", count := [ 3, 3, 25, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, edges", Label := "for a digraph \ and a list of edges", Name := "DigraphReverseEdges" ), content := 0, count := [ 3, 3, 26, 2 ], mathmode := "Text", name := "Oper", next := 84870, root := ~, start := 84769, stop := 84869 ), rec( attributes := rec( Arg := "digraph, edge", Label := "for a digraph \ and an edge", Name := "DigraphReverseEdge" ), content := 0, count := [ 3, 3, 26, 4 ], mathmode := "Text", name := "Oper", next := 84964, root := ~, start := 84873, stop := 84963 ), rec( attributes := rec( Arg := "digraph, src, ra\ n", Label := "for a digraph, source, and range", Name := "DigraphReverseEdge" ), content := 0, count := [ 3, 3, 26, 6 ], mathmode := "Text", name := "Oper", next := 85069, root := ~, start := 84967, stop := 85068 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "Returns", next := 85101, root := ~, start := 85072, stop := 85100 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "A", next := 85139, root := ~, start := 85125, stop := 85138 ), rec( content := " is a di\ graph without multiple edges, and ", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "A", next := 85193, root := ~, start := 85181, stop := 85192 ), rec( content := " is a\n \ list of pairs of vertices of ", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "A", next := 85246, root := ~, start := 85232, stop := 85245 ), rec( content := " (the en\ tries of each pair\n corresponding to the source and the range of an edge, \ respectively),\n then ", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphReverseEdges", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "C", next := 85381, root := ~, start := 85355, stop := 85380 ), rec( content := " returns\ a digraph constructed from\n ", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "A", next := 85435, root := ~, start := 85421, stop := 85434 ), rec( content := " by reve\ rsing the orientation of every edge specified by\n ", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dges", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "A", next := 85508, root := ~, start := 85496, stop := 85507 ), rec( content := ". If onl\ y one edge is to be reversed, then\n ", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphReverseEdge", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "C", next := 85580, root := ~, start := 85555, stop := 85579 ), rec( content := " can be \ used instead. In this case, the second\n argument should just be a single v\ ertex-pair, or the second and third\n arguments should be the source and ra\ nge of an edge respectively. ", count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 26, 8 ], mathmode := "Text", name := "P", next := 85775, root := ~, start := 85771, stop := 85774 ), rec( content := "\n\n \ Note that even though ", count := [ 3, 3, 26, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 26, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 8 ], mathmode := "Text", name := "A", next := 85817, root := ~, start := 85803, stop := 85816 ), rec( content := " cannot \ have multiple edges, the\n output may have multiple edges. ", count := [ 3, 3, 26, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "P", next := 85890, root := ~, start := 85886, stop := 85889 ), rec( content := "\n\n \ If ", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "A", next := 85913, root := ~, start := 85899, stop := 85912 ), rec( content := " belongs\ to ", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "Ref", next := 85955, root := ~, start := 85925, stop := 85954 ), rec( content := ", then t\ he edges\n are reversed in ", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "A", next := 86006, root := ~, start := 85992, stop := 86005 ), rec( content := ". If ", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "A", next := 86025, root := ~, start := 86011, stop := 86024 ), rec( content := " belongs\ to ", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "Ref", next := 86075, root := ~, start := 86037, stop := 86074 ), rec( content := ", an imm\ utable copy of ", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "A", next := 86112, root := ~, start := 86098, stop := 86111 ), rec( content := " with th\ e\n specified edges reversed is returned.", count := [ 3, 3, 26, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 26, 10 ], mathmode := "Text", name := "P", next := 86167, root := ~, start := 86163, stop := 86166 ), rec( content := "\n ", count := [ 3, 3, 26, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDiSparse6String(\".Tg?i@s?t_e?_qEsC\");\n\ngap> DigraphEdges(D);\n[ [ 1, 2 ], [ 1, 7 ], [\ 1, 8 ], [ 5, 21 ], [ 7, 19 ], [ 9, 1 ], \n [ 11, 2 ], [ 21, 1 ] ]\ngap> new \ := DigraphReverseEdge(D, [7, 19]);\n\ngap> DigraphEdges(new);\n[ [ 1, 2 ], [ 1, 7 ], [ 1, 8 ], [ 5, 21 ], [ 9, \ 1 ], [ 11, 2 ], \n [ 19, 7 ], [ 21, 1 ] ]\ngap> D2 := DigraphMutableCopy(new)\ ;;\ngap> new := DigraphReverseEdges(D2, [[19, 7]]);;\ngap> D2 = new;\ntrue\nga\ p> D = new;\ntrue\n", count := [ 3, 3, 26, 11 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 11 ], mathmode := "Text", name := "Example", next := 86750, root := ~, start := 86172, stop := 86749 ), rec( content := "\n ", count := [ 3, 3, 26, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 26, 7 ], mathmode := "Text", name := "Description", next := 86767, root := ~, start := 85104, stop := 86766 ) ], count := [ 3, 3, 26, 1 ], mathmode := "Text", name := "ManSection", next := 86781, root := ~, start := 84754, stop := 86780 ), rec( content := "\n\n ", count := [ 3, 3, 26, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "D1, D2, ...", Label := "for an\n ar\ bitrary number of digraphs", Name := "DigraphDisjointUnion" ), content := 0, count := [ 3, 3, 27, 2 ], mathmode := "Text", name := "Func", next := 86903, root := ~, start := 86802, stop := 86902 ), rec( attributes := rec( Arg := "list", Label := "for a list of \ digraphs", Name := "DigraphDisjointUnion" ), content := 0, count := [ 3, 3, 27, 4 ], mathmode := "Text", name := "Func", next := 86983, root := ~, start := 86906, stop := 86982 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "Returns", next := 87015, root := ~, start := 86986, stop := 87014 ), rec( attributes := rec( ), content := [ rec( content := "\n In \ the first form, if ", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "A", next := 87067, root := ~, start := 87058, stop := 87066 ), rec( content := ", ", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 2", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "A", next := 87078, root := ~, start := 87069, stop := 87077 ), rec( content := ", etc. a\ re digraphs, then\n ", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDisjointUnion", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "C", next := 87135, root := ~, start := 87108, stop := 87134 ), rec( content := " returns\ their disjoint union.\n\n In the second form, if ", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "A", next := 87205, root := ~, start := 87194, stop := 87204 ), rec( content := " is a no\ n-empty list of digraphs, then\n ", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDisjointUnion", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "C", next := 87275, root := ~, start := 87248, stop := 87274 ), rec( content := " returns\ the disjoint union of the digraphs\n contained in the list. ", count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 27, 6 ], mathmode := "Text", name := "P", next := 87351, root := ~, start := 87347, stop := 87350 ), rec( content := "\n\n \ For a disjoint union of digraphs, the vertex set is the disjoint union of\n \ the vertex sets, and the edge list is the disjoint union of the edge lists.\n\ ", count := [ 3, 3, 27, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "P", next := 87519, root := ~, start := 87515, stop := 87518 ), rec( content := "\n\n \ More specifically, for a collection of digraphs ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 87582, root := ~, start := 87573, stop := 87581 ), rec( content := ", ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 2", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 87593, root := ~, start := 87584, stop := 87592 ), rec( content := ",\n " , count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ ..", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87609, root := ~, start := 87599, stop := 87608 ), rec( content := ", the di\ sjoint union with have\n ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphNrVertices(", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87669, root := ~, start := 87644, stop := 87668 ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 87678, root := ~, start := 87669, stop := 87677 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87686, root := ~, start := 87678, stop := 87685 ), rec( content := " ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "+\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87695, root := ~, start := 87687, stop := 87694 ), rec( content := "\n ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphNrVertices(", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87725, root := ~, start := 87700, stop := 87724 ), rec( attributes := rec( ), content := [ rec( content := "D\ 2", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 87734, root := ~, start := 87725, stop := 87733 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87742, root := ~, start := 87734, stop := 87741 ), rec( content := " ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "+\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87751, root := ~, start := 87743, stop := 87750 ), rec( content := " ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ ..", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87762, root := ~, start := 87752, stop := 87761 ), rec( content := " vertice\ s.\n The edges of ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 87799, root := ~, start := 87790, stop := 87798 ), rec( content := " will re\ main unchanged, whilst the edges of the\n ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87859, root := ~, start := 87851, stop := 87858 ), rec( content := "th digra\ ph, ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 87879, root := ~, start := 87871, stop := 87878 ), rec( attributes := rec( ), content := [ rec( content := "[\ i]", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 87889, root := ~, start := 87879, stop := 87888 ), rec( content := ", will b\ e changed so that they\n belong to the vertices of the disjoint union corre\ sponding to\n ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 87998, root := ~, start := 87990, stop := 87997 ), rec( attributes := rec( ), content := [ rec( content := "[\ i]", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 88008, root := ~, start := 87998, stop := 88007 ), rec( content := ". In pa\ rticular, the edges of ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 88047, root := ~, start := 88039, stop := 88046 ), rec( attributes := rec( ), content := [ rec( content := "[\ i]", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 88057, root := ~, start := 88047, stop := 88056 ), rec( content := " will\n \ have their source and range increased by\n ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphNrVertices(", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 88137, root := ~, start := 88112, stop := 88136 ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 88146, root := ~, start := 88137, stop := 88145 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 88154, root := ~, start := 88146, stop := 88153 ), rec( content := " ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "+\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 88163, root := ~, start := 88155, stop := 88162 ), rec( content := " ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ ..", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 88174, root := ~, start := 88164, stop := 88173 ), rec( content := " ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "+\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 88183, root := ~, start := 88175, stop := 88182 ), rec( content := "\n ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphNrVertices(", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 88213, root := ~, start := 88188, stop := 88212 ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "A", next := 88221, root := ~, start := 88213, stop := 88220 ), rec( attributes := rec( ), content := [ rec( content := "[\ i-1])", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "C", next := 88234, root := ~, start := 88221, stop := 88233 ), rec( content := ".\n\n \ ", count := [ 3, 3, 27, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 27, 8 ], mathmode := "Text", name := "P", next := 88245, root := ~, start := 88241, stop := 88244 ), rec( content := "\n\n \ Note that previously set ", count := [ 3, 3, 27, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 3, 3, 27, 8 ], mathmode := "Text", name := "Ref", next := 88309, root := ~, start := 88276, stop := 88308 ), rec( content := " will be\ lost.", count := [ 3, 3, 27, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "P", next := 88327, root := ~, start := 88323, stop := 88326 ), rec( content := "\n\n \ If the first digraph ", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "A", next := 88363, root := ~, start := 88354, stop := 88362 ), rec( content := " [", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist[1]", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "A", next := 88379, root := ~, start := 88365, stop := 88378 ), rec( content := "] belong\ s to ", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "Ref", next := 88426, root := ~, start := 88392, stop := 88425 ), rec( content := ", then " , count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "A", next := 88442, root := ~, start := 88433, stop := 88441 ), rec( content := " [", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist[1]", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "A", next := 88458, root := ~, start := 88444, stop := 88457 ), rec( content := "] is mod\ ified in\n place to contain the appropriate vertices and edges. If ", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "A", next := 88549, root := ~, start := 88535, stop := 88548 ), rec( content := " belongs\ \n to ", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "Ref", next := 88597, root := ~, start := 88565, stop := 88596 ), rec( content := ", a new \ immutable digraph containing the\n appropriate vertices and edges is return\ ed.\n", count := [ 3, 3, 27, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D1 := CycleDigraph(3);\n\ngap> \ OutNeighbours(D1);\n[ [ 2 ], [ 3 ], [ 1 ] ]\ngap> D2 := CompleteDigraph(3);\n<\ immutable complete digraph with 3 vertices>\ngap> OutNeighbours(D2);\n[ [ 2, 3\ ], [ 1, 3 ], [ 1, 2 ] ]\ngap> union := DigraphDisjointUnion(D1, D2);\n\ngap> OutNeighbours(union);\n[ [ 2 ], [ \ 3 ], [ 1 ], [ 5, 6 ], [ 4, 6 ], [ 4, 5 ] ]\n", count := [ 3, 3, 27, 10 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 27, 10 ], mathmode := "Text", name := "Example", next := 89139, root := ~, start := 88686, stop := 89138 ), rec( content := "\n ", count := [ 3, 3, 27, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 27, 5 ], mathmode := "Text", name := "Description", next := 89156, root := ~, start := 87018, stop := 89155 ) ], count := [ 3, 3, 27, 1 ], mathmode := "Text", name := "ManSection", next := 89170, root := ~, start := 86787, stop := 89169 ), rec( content := "\n\n ", count := [ 3, 3, 27, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "D1, D2, ...", Label := "for a positive\ number of digraphs", Name := "DigraphEdgeUnion" ), content := 0, count := [ 3, 3, 28, 2 ], mathmode := "Text", name := "Func", next := 89286, root := ~, start := 89191, stop := 89285 ), rec( attributes := rec( Arg := "list", Label := "for a list of \ digraphs", Name := "DigraphEdgeUnion" ), content := 0, count := [ 3, 3, 28, 4 ], mathmode := "Text", name := "Func", next := 89362, root := ~, start := 89289, stop := 89361 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "Returns", next := 89394, root := ~, start := 89365, stop := 89393 ), rec( attributes := rec( ), content := [ rec( content := "\n In \ the first form, if ", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "A", next := 89446, root := ~, start := 89437, stop := 89445 ), rec( content := ", ", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 2", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "A", next := 89457, root := ~, start := 89448, stop := 89456 ), rec( content := ", etc. a\ re digraphs, then\n ", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEdgeUnion", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "C", next := 89510, root := ~, start := 89487, stop := 89509 ), rec( content := " returns\ their edge union.\n\n In the second form, if ", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "A", next := 89576, root := ~, start := 89565, stop := 89575 ), rec( content := " is a no\ n-empty list of digraphs, then\n ", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEdgeUnion", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "C", next := 89642, root := ~, start := 89619, stop := 89641 ), rec( content := " returns\ the edge union of the digraphs contained\n in the list. ", count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "P", next := 89714, root := ~, start := 89710, stop := 89713 ), rec( content := "\n\n \ The vertex set of the edge union of a collection of digraphs is the\n ", count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ nion", count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "E", next := 89804, root := ~, start := 89792, stop := 89803 ), rec( content := " of the \ vertex sets, whilst the edge list of the edge union is\n the ", count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ oncatenation", count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "E", next := 89895, root := ~, start := 89875, stop := 89894 ), rec( content := " of the \ edge lists. The number of vertices of the\n edge union is equal to the ", count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ aximum", count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "E", next := 89991, root := ~, start := 89977, stop := 89990 ), rec( content := " number \ of vertices of one of the\n digraphs, whilst the number of edges of the edg\ e union will equal the\n ", count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ um", count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "E", next := 90113, root := ~, start := 90103, stop := 90112 ), rec( content := " of the \ number of edges of each digraph. ", count := [ 3, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 28, 7 ], mathmode := "Text", name := "P", next := 90158, root := ~, start := 90154, stop := 90157 ), rec( content := "\n\n \ Note that previously set ", count := [ 3, 3, 28, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 3, 3, 28, 7 ], mathmode := "Text", name := "Ref", next := 90222, root := ~, start := 90189, stop := 90221 ), rec( content := " will be\ lost.\n ", count := [ 3, 3, 28, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "P", next := 90245, root := ~, start := 90241, stop := 90244 ), rec( content := "\n\n \ If the first digraph ", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "A", next := 90281, root := ~, start := 90272, stop := 90280 ), rec( content := " [", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist[1]", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "A", next := 90297, root := ~, start := 90283, stop := 90296 ), rec( content := "] belong\ s to ", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "Ref", next := 90344, root := ~, start := 90310, stop := 90343 ), rec( content := ", then " , count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "A", next := 90360, root := ~, start := 90351, stop := 90359 ), rec( content := " [", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist[1]", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "A", next := 90376, root := ~, start := 90362, stop := 90375 ), rec( content := "] is mod\ ified in\n place to contain the appropriate vertices and edges. If ", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "A", next := 90467, root := ~, start := 90453, stop := 90466 ), rec( content := " belongs\ \n to ", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "Ref", next := 90515, root := ~, start := 90483, stop := 90514 ), rec( content := ", a new \ immutable digraph containing the\n appropriate vertices and edges is return\ ed.\n", count := [ 3, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(10);\n\ngap>\ DigraphEdgeUnion(D, D);\n\ \ngap> D1 := Digraph([[2], [1]]);\n\ngap> D2 := Digraph([[2, 3], [2], [1]]);\n\ngap> union := DigraphEdgeUnion(D1, D2);\n\ngap> OutNeighbours(union);\n[ [ 2, 2, 3 ], [ 1, 2 ],\ [ 1 ] ]\ngap> union = DigraphByEdges(\n> Concatenation(DigraphEdges(D1), Digr\ aphEdges(D2)));\ntrue\n", count := [ 3, 3, 28, 9 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 9 ], mathmode := "Text", name := "Example", next := 91188, root := ~, start := 90604, stop := 91187 ), rec( content := "\n ", count := [ 3, 3, 28, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 28, 5 ], mathmode := "Text", name := "Description", next := 91205, root := ~, start := 89397, stop := 91204 ) ], count := [ 3, 3, 28, 1 ], mathmode := "Text", name := "ManSection", next := 91219, root := ~, start := 89176, stop := 91218 ), rec( content := "\n\n ", count := [ 3, 3, 28, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "D1, D2, ...", Label := "for a positive\ number of digraphs", Name := "DigraphJoin" ), content := 0, count := [ 3, 3, 29, 2 ], mathmode := "Text", name := "Func", next := 91330, root := ~, start := 91240, stop := 91329 ), rec( attributes := rec( Arg := "list", Label := "for a list of \ digraphs", Name := "DigraphJoin" ), content := 0, count := [ 3, 3, 29, 4 ], mathmode := "Text", name := "Func", next := 91401, root := ~, start := 91333, stop := 91400 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "Returns", next := 91433, root := ~, start := 91404, stop := 91432 ), rec( attributes := rec( ), content := [ rec( content := "\n In \ the first form, if ", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "A", next := 91485, root := ~, start := 91476, stop := 91484 ), rec( content := ", ", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 2", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "A", next := 91496, root := ~, start := 91487, stop := 91495 ), rec( content := ", etc. a\ re digraphs, then\n ", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphJoin", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "C", next := 91544, root := ~, start := 91526, stop := 91543 ), rec( content := " returns\ their join.\n\n In the second form, if ", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "A", next := 91604, root := ~, start := 91593, stop := 91603 ), rec( content := " is a no\ n-empty list of digraphs,\n then ", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphJoin", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "C", next := 91665, root := ~, start := 91647, stop := 91664 ), rec( content := " returns\ the join of the digraphs contained in the\n list. ", count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "P", next := 91730, root := ~, start := 91726, stop := 91729 ), rec( content := "\n\n \ The join of a collection of digraphs ", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "A", next := 91782, root := ~, start := 91773, stop := 91781 ), rec( content := ", ", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 2", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "A", next := 91793, root := ~, start := 91784, stop := 91792 ), rec( content := ", ", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ ..", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "C", next := 91805, root := ~, start := 91795, stop := 91804 ), rec( content := " is\n \ formed by first taking the ", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ DisjointUnion", Label := "for a list of digraphs" ), content := 0, count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "Ref", next := 91911, root := ~, start := 91840, stop := 91910 ), rec( content := " of the \ collection.\n\n In the disjoint union, if ", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ \\neq j", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "M", next := 91977, root := ~, start := 91962, stop := 91976 ), rec( content := " then th\ ere are no edges between\n vertices corresponding to digraphs ", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "A", next := 92057, root := ~, start := 92049, stop := 92056 ), rec( attributes := rec( ), content := [ rec( content := "[\ i]", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "C", next := 92067, root := ~, start := 92057, stop := 92066 ), rec( content := " and\n \ ", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "A", next := 92084, root := ~, start := 92076, stop := 92083 ), rec( attributes := rec( ), content := [ rec( content := "[\ j]", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "C", next := 92094, root := ~, start := 92084, stop := 92093 ), rec( content := " in the \ collection; the join is created by including\n all such edges.", count := [ 3, 3, 29, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 29, 7 ], mathmode := "Text", name := "P", next := 92170, root := ~, start := 92166, stop := 92169 ), rec( content := "\n\n \ For example, the join of two empty digraphs is a complete bipartite\n digra\ ph.", count := [ 3, 3, 29, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 29, 8 ], mathmode := "Text", name := "P", next := 92260, root := ~, start := 92256, stop := 92259 ), rec( content := "\n\n \ Note that previously set ", count := [ 3, 3, 29, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 3, 3, 29, 8 ], mathmode := "Text", name := "Ref", next := 92324, root := ~, start := 92291, stop := 92323 ), rec( content := " will be\ lost.\n ", count := [ 3, 3, 29, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "P", next := 92347, root := ~, start := 92343, stop := 92346 ), rec( content := "\n\n \ If the first digraph ", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "A", next := 92383, root := ~, start := 92374, stop := 92382 ), rec( content := " [", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist[1]", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "A", next := 92399, root := ~, start := 92385, stop := 92398 ), rec( content := "] belong\ s to ", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "Ref", next := 92446, root := ~, start := 92412, stop := 92445 ), rec( content := ", then " , count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "A", next := 92462, root := ~, start := 92453, stop := 92461 ), rec( content := " [", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist[1]", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "A", next := 92478, root := ~, start := 92464, stop := 92477 ), rec( content := "] is mod\ ified in\n place to contain the appropriate vertices and edges. If ", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "A", next := 92569, root := ~, start := 92555, stop := 92568 ), rec( content := " belongs\ \n to ", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "Ref", next := 92617, root := ~, start := 92585, stop := 92616 ), rec( content := ", a new \ immutable digraph containing the\n appropriate vertices and edges is return\ ed.\n", count := [ 3, 3, 29, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(3);\n\n\ gap> IsCompleteDigraph(DigraphJoin(D, D));\ntrue\ngap> D2 := CycleDigraph(3);\ \n\ngap> DigraphJoin(D, D2);\n\n", count := [ 3, 3, 29, 10 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 29, 10 ], mathmode := "Text", name := "Example", next := 93002, root := ~, start := 92706, stop := 93001 ), rec( content := "\n ", count := [ 3, 3, 29, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 29, 5 ], mathmode := "Text", name := "Description", next := 93019, root := ~, start := 91436, stop := 93018 ) ], count := [ 3, 3, 29, 1 ], mathmode := "Text", name := "ManSection", next := 93033, root := ~, start := 91225, stop := 93032 ), rec( content := "\n\n ", count := [ 3, 3, 29, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "gr1, gr2, ...", Label := "for a positive\ number of digraphs", Name := "DigraphCartesianProduct" ), content := 0, count := [ 3, 3, 30, 2 ], mathmode := "Text", name := "Func", next := 93158, root := ~, start := 93054, stop := 93157 ), rec( attributes := rec( Arg := "list", Label := "for a list of \ digraphs", Name := "DigraphCartesianProduct" ), content := 0, count := [ 3, 3, 30, 4 ], mathmode := "Text", name := "Func", next := 93245, root := ~, start := 93161, stop := 93244 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "Returns", next := 93277, root := ~, start := 93248, stop := 93276 ), rec( attributes := rec( ), content := [ rec( content := "\n In \ the first form, if ", count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r1", count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "A", next := 93330, root := ~, start := 93320, stop := 93329 ), rec( content := ", ", count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r2", count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "A", next := 93342, root := ~, start := 93332, stop := 93341 ), rec( content := ", etc. a\ re digraphs, then\n ", count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphCartesianProduct", count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "C", next := 93402, root := ~, start := 93372, stop := 93401 ), rec( content := " returns\ a digraph isomorphic to their\n Cartesian product.\n ", count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 30, 6 ], mathmode := "Text", name := "P", next := 93472, root := ~, start := 93468, stop := 93471 ), rec( content := "\n\n \ In the second form, if ", count := [ 3, 3, 30, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 3, 30, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 6 ], mathmode := "Text", name := "A", next := 93512, root := ~, start := 93501, stop := 93511 ), rec( content := " is a no\ n-empty list of digraphs,\n then ", count := [ 3, 3, 30, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphCartesianProduct", count := [ 3, 3, 30, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 30, 6 ], mathmode := "Text", name := "C", next := 93585, root := ~, start := 93555, stop := 93584 ), rec( content := " returns\ a digraph isomorphic to the \n Cartesian product of the digraphs contained\ in the list.\n ", count := [ 3, 3, 30, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "P", next := 93692, root := ~, start := 93688, stop := 93691 ), rec( content := "\n \n \ Mathematically, the Cartesian product of two digraphs ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 93761, root := ~, start := 93753, stop := 93760 ), rec( content := ", ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 93771, root := ~, start := 93763, stop := 93770 ), rec( content := "\n is\ a digraph with vertex set ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ artesian(DigraphVertices(G),\n DigraphVertices(H))", count := [ 3, 3, 30, 7 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 93865, root := ~, start := 93805, stop := 93864 ), rec( content := " such th\ at there is an edge from ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u, u']", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 93912, root := ~, start := 93898, stop := 93911 ), rec( content := " to\n \ ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ v, v']", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 93934, root := ~, start := 93920, stop := 93933 ), rec( content := " iff ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ u = v ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 93953, root := ~, start := 93939, stop := 93952 ), rec( content := " and the\ re is an edge from ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ '", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 93989, root := ~, start := 93980, stop := 93988 ), rec( content := " to\n \ ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ '", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 94006, root := ~, start := 93997, stop := 94005 ), rec( content := " in ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 94018, root := ~, start := 94010, stop := 94017 ), rec( content := " or ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ u' = v'", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 94037, root := ~, start := 94022, stop := 94036 ), rec( content := " and the\ re is an edge from\n ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 94076, root := ~, start := 94068, stop := 94075 ), rec( content := " to ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 94088, root := ~, start := 94080, stop := 94087 ), rec( content := " in ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "C", next := 94100, root := ~, start := 94092, stop := 94099 ), rec( content := ".\n " , count := [ 3, 3, 30, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "P", next := 94110, root := ~, start := 94106, stop := 94109 ), rec( content := "\n\n \ Due to technical reasons, the digraph ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "C", next := 94162, root := ~, start := 94154, stop := 94161 ), rec( content := " returne\ d by\n ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphCartesianProduct", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "C", next := 94209, root := ~, start := 94179, stop := 94208 ), rec( content := " has ver\ tex set\n ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. DigraphNrVertices(G)*DigraphNrVertices(H)]", count := [ 3, 3, 30, 8 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "C", next := 94285, root := ~, start := 94229, stop := 94284 ), rec( content := " instead\ , and the\n exact\n method of encoding pairs of vertices into integers \ is implementation\n specific. The original vertex pair can be somewhat reg\ ained by using\n ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ CartesianProductProjections" ), content := 0, count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "Ref", next := 94513, root := ~, start := 94465, stop := 94512 ), rec( content := ". In add\ ition,\n ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "Ref", next := 94565, root := ~, start := 94532, stop := 94564 ), rec( content := " are pre\ served: if vertex pair\n ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u,u']", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "C", next := 94613, root := ~, start := 94600, stop := 94612 ), rec( content := " was enc\ oded as ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "C", next := 94637, root := ~, start := 94629, stop := 94636 ), rec( content := " then th\ e vertex label of ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "C", next := 94671, root := ~, start := 94663, stop := 94670 ), rec( content := "\n wi\ ll be the pair of vertex labels of ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "C", next := 94721, root := ~, start := 94713, stop := 94720 ), rec( content := " and ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ '", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "C", next := 94735, root := ~, start := 94726, stop := 94734 ), rec( content := " i.e.\n \ ", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphVertexLabel(D,i) = [DigraphVertexLabel(G,u),\n DigraphVertexLabel(H\ ,u')]", count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "C", next := 94835, root := ~, start := 94745, stop := 94834 ), rec( content := ".\n " , count := [ 3, 3, 30, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "P", next := 94845, root := ~, start := 94841, stop := 94844 ), rec( content := "\n\n \ As the Cartesian product is associative, the Cartesian product of a collection\ \n of digraphs ", count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r1", count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "A", next := 94957, root := ~, start := 94947, stop := 94956 ), rec( content := ", ", count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r2", count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "A", next := 94969, root := ~, start := 94959, stop := 94968 ), rec( content := ", ", count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ ..", count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "C", next := 94981, root := ~, start := 94971, stop := 94980 ), rec( content := " is comp\ uted in the obvious \n fashion. \n ", count := [ 3, 3, 30, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 30, 10 ], mathmode := "Text", name := "P", next := 95032, root := ~, start := 95028, stop := 95031 ), rec( content := "\n\n", count := [ 3, 3, 30, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := ChainDigraph(4);\n\ngap> \ gr2 := CycleDigraph(3);\n\ngap> gr3 :\ = DigraphCartesianProduct(gr, gr2);\n\ngap> IsIsomorphicDigraph(gr3, \n> Digraph([[2, 5], [3, 6], [4, 7], [8],\ \n> [6, 9], [7, 10], [8, 11], [12],\n> [10, 1], [11, 2], [1\ 2, 3], [4]]));\ntrue\n", count := [ 3, 3, 30, 11 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 11 ], mathmode := "Text", name := "Example", next := 95466, root := ~, start := 95034, stop := 95465 ), rec( content := "\n ", count := [ 3, 3, 30, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 30, 5 ], mathmode := "Text", name := "Description", next := 95483, root := ~, start := 93280, stop := 95482 ) ], count := [ 3, 3, 30, 1 ], mathmode := "Text", name := "ManSection", next := 95497, root := ~, start := 93039, stop := 95496 ), rec( content := "\n\n ", count := [ 3, 3, 30, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "gr1, gr2, ...", Label := "for a positive\ number of digraphs", Name := "DigraphDirectProduct" ), content := 0, count := [ 3, 3, 31, 2 ], mathmode := "Text", name := "Func", next := 95619, root := ~, start := 95518, stop := 95618 ), rec( attributes := rec( Arg := "list", Label := "for a list of \ digraphs", Name := "DigraphDirectProduct" ), content := 0, count := [ 3, 3, 31, 4 ], mathmode := "Text", name := "Func", next := 95703, root := ~, start := 95622, stop := 95702 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "Returns", next := 95735, root := ~, start := 95706, stop := 95734 ), rec( attributes := rec( ), content := [ rec( content := "\n In \ the first form, if ", count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r1", count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "A", next := 95788, root := ~, start := 95778, stop := 95787 ), rec( content := ", ", count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r2", count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "A", next := 95800, root := ~, start := 95790, stop := 95799 ), rec( content := ", etc. a\ re digraphs, then\n ", count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDirectProduct", count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "C", next := 95857, root := ~, start := 95830, stop := 95856 ), rec( content := " returns\ a digraph isomorphic to their direct\n product.\n ", count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 31, 6 ], mathmode := "Text", name := "P", next := 95924, root := ~, start := 95920, stop := 95923 ), rec( content := "\n\n \ In the second form, if ", count := [ 3, 3, 31, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 3, 31, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 6 ], mathmode := "Text", name := "A", next := 95964, root := ~, start := 95953, stop := 95963 ), rec( content := " is a no\ n-empty list of digraphs, then\n ", count := [ 3, 3, 31, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDirectProduct", count := [ 3, 3, 31, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 31, 6 ], mathmode := "Text", name := "C", next := 96034, root := ~, start := 96007, stop := 96033 ), rec( content := " returns\ a digraph isomorphic to the direct\n product of the digraphs contained in \ the list.\n ", count := [ 3, 3, 31, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "P", next := 96137, root := ~, start := 96133, stop := 96136 ), rec( content := "\n\n \ Mathematically, the direct product of two digraphs ", count := [ 3, 3, 31, 7 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96202, root := ~, start := 96194, stop := 96201 ), rec( content := ", ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96212, root := ~, start := 96204, stop := 96211 ), rec( content := " is a\n \ digraph with vertex set ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ artesian(DigraphVertices(G),\n DigraphVertices(H))", count := [ 3, 3, 31, 7 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96306, root := ~, start := 96246, stop := 96305 ), rec( content := " such th\ at there is an edge from ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u, u']", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96353, root := ~, start := 96339, stop := 96352 ), rec( content := "\n to\ ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ v, v']", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96375, root := ~, start := 96361, stop := 96374 ), rec( content := " iff the\ re is an edge from ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96410, root := ~, start := 96402, stop := 96409 ), rec( content := " to ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96422, root := ~, start := 96414, stop := 96421 ), rec( content := " in\n \ ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96438, root := ~, start := 96430, stop := 96437 ), rec( content := " and an \ edge from ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ '", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96465, root := ~, start := 96456, stop := 96464 ), rec( content := " to ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ '", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96478, root := ~, start := 96469, stop := 96477 ), rec( content := " in ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "C", next := 96490, root := ~, start := 96482, stop := 96489 ), rec( content := ". \n \ ", count := [ 3, 3, 31, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := 0, count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "P", next := 96501, root := ~, start := 96497, stop := 96500 ), rec( content := " \n\n \ Due to technical reasons, the digraph ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "C", next := 96554, root := ~, start := 96546, stop := 96553 ), rec( content := " returne\ d by\n ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDirectProduct", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "C", next := 96598, root := ~, start := 96571, stop := 96597 ), rec( content := " has ver\ tex set\n ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. DigraphNrVertices(G)*DigraphNrVertices(H)]", count := [ 3, 3, 31, 8 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "C", next := 96674, root := ~, start := 96618, stop := 96673 ), rec( content := " instead\ , and the\n exact method of encoding pairs of vertices into integers is imp\ lementation\n specific. The original vertex pair can be somewhat regained \ by using\n ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ DirectProductProjections" ), content := 0, count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "Ref", next := 96894, root := ~, start := 96849, stop := 96893 ), rec( content := ". In add\ ition\n ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "Ref", next := 96945, root := ~, start := 96912, stop := 96944 ), rec( content := " are pre\ served: if vertex pair\n ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u,u']", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "C", next := 96993, root := ~, start := 96980, stop := 96992 ), rec( content := " was enc\ oded as ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "C", next := 97017, root := ~, start := 97009, stop := 97016 ), rec( content := " then th\ e vertex label of ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "C", next := 97051, root := ~, start := 97043, stop := 97050 ), rec( content := "\n wi\ ll be the pair of vertex labels of ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "C", next := 97101, root := ~, start := 97093, stop := 97100 ), rec( content := " and ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ '", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "C", next := 97115, root := ~, start := 97106, stop := 97114 ), rec( content := " i.e.\n \ ", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphVertexLabel(D,i) = [DigraphVertexLabel(G,u),\n DigraphVertexLabel(H,u\ ')]", count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "C", next := 97213, root := ~, start := 97125, stop := 97212 ), rec( content := ".\n " , count := [ 3, 3, 31, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "P", next := 97223, root := ~, start := 97219, stop := 97222 ), rec( content := "\n\n \ As the direct product is associative, the direct product of a collection \n \ of digraphs ", count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r1", count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "A", next := 97329, root := ~, start := 97319, stop := 97328 ), rec( content := ", ", count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r2", count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "A", next := 97341, root := ~, start := 97331, stop := 97340 ), rec( content := ", ", count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ ..", count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "C", next := 97353, root := ~, start := 97343, stop := 97352 ), rec( content := " is comp\ uted in the obvious \n fashion. \n ", count := [ 3, 3, 31, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 31, 10 ], mathmode := "Text", name := "P", next := 97404, root := ~, start := 97400, stop := 97403 ), rec( content := "\n\n", count := [ 3, 3, 31, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := ChainDigraph(4);\n\ngap> \ gr2 := CycleDigraph(3);\n\ngap> gr3 :\ = DigraphDirectProduct(gr, gr2);\n\ngap> IsIsomorphicDigraph(gr3, \n> Digraph([[6], [7], [8], [], \n> \ [10], [11], [12], [],\n> [2], [3], [4], []]));\ntrue\n", count := [ 3, 3, 31, 11 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 31, 11 ], mathmode := "Text", name := "Example", next := 97801, root := ~, start := 97406, stop := 97800 ), rec( content := "\n ", count := [ 3, 3, 31, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 31, 5 ], mathmode := "Text", name := "Description", next := 97818, root := ~, start := 95738, stop := 97817 ) ], count := [ 3, 3, 31, 1 ], mathmode := "Text", name := "ManSection", next := 97832, root := ~, start := 95503, stop := 97831 ), rec( content := "\n\n ", count := [ 3, 3, 31, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphCartesia\ nProductProjections" ), content := 0, count := [ 3, 3, 32, 2 ], mathmode := "Text", name := "Attr", next := 97916, root := ~, start := 97853, stop := 97915 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ transformations.", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "Returns", next := 97964, root := ~, start := 97919, stop := 97963 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "A", next := 98002, root := ~, start := 97988, stop := 98001 ), rec( content := " is a Ca\ rtesian product digraph, \n ", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph = DigraphCartesianProduct(gr_1, gr_2, ... )", count := [ 3, 3, 32, 3 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "C", next := 98098, root := ~, start := 98040, stop := 98097 ), rec( content := ", then\n\ ", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphCartesianProductProjections", count := [ 3, 3, 32, 3 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "C", next := 98150, root := ~, start := 98109, stop := 98149 ), rec( content := " returns\ a list ", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roj", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "C", next := 98177, root := ~, start := 98166, stop := 98176 ), rec( content := "\n su\ ch that ", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roj[i]", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "C", next := 98206, root := ~, start := 98192, stop := 98205 ), rec( content := " is the \ projection onto the ", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "C", next := 98242, root := ~, start := 98234, stop := 98241 ), rec( content := "-th\n \ coordinate of the product.\n ", count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "P", next := 98285, root := ~, start := 98281, stop := 98284 ), rec( content := "\n\n \ A projection is an idempotent endomorphism of ", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "A", next := 98351, root := ~, start := 98337, stop := 98350 ), rec( content := ". If\n \ ", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r1, gr2, ...", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "C", next := 98380, root := ~, start := 98360, stop := 98379 ), rec( content := " are all\ loopless digraphs, then the induced \n subdigraph of ", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "A", next := 98458, root := ~, start := 98444, stop := 98457 ), rec( content := " on the \ image of ", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roj[i]", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "C", next := 98489, root := ~, start := 98475, stop := 98488 ), rec( content := " is \n \ isomorphic to ", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r_i", count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "C", next := 98523, root := ~, start := 98512, stop := 98522 ), rec( content := ".\n " , count := [ 3, 3, 32, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 32, 5 ], mathmode := "Text", name := "P", next := 98533, root := ~, start := 98529, stop := 98532 ), rec( content := "\n\n \ Currently this attribute is only set upon creating an immutable \n digraph \ via ", count := [ 3, 3, 32, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphCartesianProduct", count := [ 3, 3, 32, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 32, 5 ], mathmode := "Text", name := "C", next := 98650, root := ~, start := 98620, stop := 98649 ), rec( content := " and the\ re is no way \n of calculating it for other digraphs.\n ", count := [ 3, 3, 32, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 32, 6 ], mathmode := "Text", name := "P", next := 98722, root := ~, start := 98718, stop := 98721 ), rec( content := "\n\n \ For more information see\n ", count := [ 3, 3, 32, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ CartesianProduct", Label := "for a list of digraphs" ), content := 0, count := [ 3, 3, 32, 6 ], mathmode := "Text", name := "Ref", next := 98825, root := ~, start := 98757, stop := 98824 ), rec( content := " \n\n \ ", count := [ 3, 3, 32, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphCartesianProduct(ChainDigraph(3), CycleDigraph(4),\n> Digrap\ h([[2], [2]]));;\ngap> HasDigraphCartesianProductProjections(D);\ntrue\ngap> p\ roj := DigraphCartesianProductProjections(D);; Length(proj);\n3\ngap> IsIdempo\ tent(proj[2]);\ntrue\ngap> RankOfTransformation(proj[3]);\n2\ngap> S := ImageS\ etOfTransformation(proj[2]);;\ngap> IsIsomorphicDigraph(CycleDigraph(4), Induc\ edSubdigraph(D, S));\ntrue\n", count := [ 3, 3, 32, 7 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 7 ], mathmode := "Text", name := "Example", next := 99268, root := ~, start := 98832, stop := 99267 ), rec( content := "\n ", count := [ 3, 3, 32, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 32, 3 ], mathmode := "Text", name := "Description", next := 99285, root := ~, start := 97967, stop := 99284 ) ], count := [ 3, 3, 32, 1 ], mathmode := "Text", name := "ManSection", next := 99299, root := ~, start := 97838, stop := 99298 ), rec( content := "\n\n ", count := [ 3, 3, 32, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphDirectPr\ oductProjections" ), content := 0, count := [ 3, 3, 33, 2 ], mathmode := "Text", name := "Attr", next := 99380, root := ~, start := 99320, stop := 99379 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ transformations.", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "Returns", next := 99428, root := ~, start := 99383, stop := 99427 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "A", next := 99466, root := ~, start := 99452, stop := 99465 ), rec( content := " is a di\ rect product digraph, \n ", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph = DigraphDirectProduct(gr_1, gr_2, ... )", count := [ 3, 3, 33, 3 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "C", next := 99556, root := ~, start := 99501, stop := 99555 ), rec( content := ", then\n\ ", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDirectProductProjections", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "C", next := 99605, root := ~, start := 99567, stop := 99604 ), rec( content := " returns\ a list ", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roj", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "C", next := 99632, root := ~, start := 99621, stop := 99631 ), rec( content := "\n su\ ch that ", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roj[i]", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "C", next := 99661, root := ~, start := 99647, stop := 99660 ), rec( content := " is the \ projection onto the ", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "C", next := 99697, root := ~, start := 99689, stop := 99696 ), rec( content := "-th\n \ coordinate of the product.\n ", count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "P", next := 99740, root := ~, start := 99736, stop := 99739 ), rec( content := "\n\n \ A projection is an idempotent endomorphism of ", count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "A", next := 99806, root := ~, start := 99792, stop := 99805 ), rec( content := ". If\n \ ", count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r1, gr2, ...", count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "C", next := 99835, root := ~, start := 99815, stop := 99834 ), rec( content := " are all\ loopless digraphs, then the image \n of ", count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "A", next := 99900, root := ~, start := 99886, stop := 99899 ), rec( content := " under " , count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roj[i]", count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "C", next := 99921, root := ~, start := 99907, stop := 99920 ), rec( content := " is isom\ orphic to ", count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ r_i", count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "C", next := 99950, root := ~, start := 99939, stop := 99949 ), rec( content := ".\n " , count := [ 3, 3, 33, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 33, 5 ], mathmode := "Text", name := "P", next := 99960, root := ~, start := 99956, stop := 99959 ), rec( content := "\n\n \ Currently this attribute is only set upon creating an immutable\n digraph v\ ia ", count := [ 3, 3, 33, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDirectProduct", count := [ 3, 3, 33, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 33, 5 ], mathmode := "Text", name := "C", next := 100073, root := ~, start := 100046, stop := 100072 ), rec( content := " and the\ re is no way of \n calculating it for other digraphs.\n ", count := [ 3, 3, 33, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 33, 6 ], mathmode := "Text", name := "P", next := 100145, root := ~, start := 100141, stop := 100144 ), rec( content := "\n\n \ For more information, see\n ", count := [ 3, 3, 33, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ DirectProduct", Label := "for a list of digraphs" ), content := 0, count := [ 3, 3, 33, 6 ], mathmode := "Text", name := "Ref", next := 100246, root := ~, start := 100181, stop := 100245 ), rec( content := " \n\n \ ", count := [ 3, 3, 33, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphDirectProduct(ChainDigraph(3), CycleDigraph(4),\n> Digraph([\ [2], [2]]));;\ngap> HasDigraphDirectProductProjections(D);\ntrue\ngap> proj :=\ DigraphDirectProductProjections(D);; Length(proj);\n3\ngap> IsIdempotent(proj\ [2]);\ntrue\ngap> RankOfTransformation(proj[3]);\n2\ngap> P := DigraphRemoveAl\ lMultipleEdges(\n> ReducedDigraph(OnDigraphs(D, proj[2])));; \ngap> IsIsomorph\ icDigraph(CycleDigraph(4), P);\ntrue\n", count := [ 3, 3, 33, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 33, 7 ], mathmode := "Text", name := "Example", next := 100698, root := ~, start := 100253, stop := 100697 ), rec( content := "\n ", count := [ 3, 3, 33, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 33, 3 ], mathmode := "Text", name := "Description", next := 100715, root := ~, start := 99431, stop := 100714 ) ], count := [ 3, 3, 33, 1 ], mathmode := "Text", name := "ManSection", next := 100729, root := ~, start := 99305, stop := 100728 ), rec( content := "\n\n ", count := [ 3, 3, 33, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "LineDigraph" ), content := 0, count := [ 3, 3, 34, 2 ], mathmode := "Text", name := "Oper", next := 100790, root := ~, start := 100750, stop := 100789 ), rec( attributes := rec( Arg := "digraph", Name := "EdgeDigraph" ), content := 0, count := [ 3, 3, 34, 4 ], mathmode := "Text", name := "Oper", next := 100833, root := ~, start := 100793, stop := 100832 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "Returns", next := 100865, root := ~, start := 100836, stop := 100864 ), rec( attributes := rec( ), content := [ rec( content := "\n Giv\ en a digraph ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "A", next := 100916, root := ~, start := 100902, stop := 100915 ), rec( content := ", the op\ eration returns the digraph\n obtained by associating a vertex with each ed\ ge of ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "A", next := 101021, root := ~, start := 101007, stop := 101020 ), rec( content := ", and\n \ creating an edge from a vertex ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "K", next := 101070, root := ~, start := 101062, stop := 101069 ), rec( content := " to a ve\ rtex ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "K", next := 101091, root := ~, start := 101083, stop := 101090 ), rec( content := " if and \ only\n if the terminal vertex of the edge associated with ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "K", next := 101167, root := ~, start := 101159, stop := 101166 ), rec( content := " is the \ start\n vertex of the edge associated with ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "K", next := 101228, root := ~, start := 101220, stop := 101227 ), rec( content := ".", count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 34, 6 ], mathmode := "Text", name := "P", next := 101233, root := ~, start := 101229, stop := 101232 ), rec( content := "\n\n \ Note that the returned digraph is always a new immutable digraph, and the\n \ argument ", count := [ 3, 3, 34, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 34, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 6 ], mathmode := "Text", name := "A", next := 101340, root := ~, start := 101326, stop := 101339 ), rec( content := " is neve\ r modified.\n ", count := [ 3, 3, 34, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> LineDigraph(CompleteDigraph(3));\n\ngap> LineDigraph(ChainDigraph(3));\n\n", count := [ 3, 3, 34, 7 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 7 ], mathmode := "Text", name := "Example", next := 101559, root := ~, start := 101364, stop := 101558 ), rec( content := "\n ", count := [ 3, 3, 34, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 34, 5 ], mathmode := "Text", name := "Description", next := 101576, root := ~, start := 100868, stop := 101575 ) ], count := [ 3, 3, 34, 1 ], mathmode := "Text", name := "ManSection", next := 101590, root := ~, start := 100735, stop := 101589 ), rec( content := "\n\n ", count := [ 3, 3, 34, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "LineUndirectedD\ igraph" ), content := 0, count := [ 3, 3, 35, 2 ], mathmode := "Text", name := "Oper", next := 101661, root := ~, start := 101611, stop := 101660 ), rec( attributes := rec( Arg := "digraph", Name := "EdgeUndirectedD\ igraph" ), content := 0, count := [ 3, 3, 35, 4 ], mathmode := "Text", name := "Oper", next := 101714, root := ~, start := 101664, stop := 101713 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "Returns", next := 101746, root := ~, start := 101717, stop := 101745 ), rec( attributes := rec( ), content := [ rec( content := "\n Giv\ en a symmetric digraph ", count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "A", next := 101807, root := ~, start := 101793, stop := 101806 ), rec( content := ", the op\ eration returns the\n symmetric digraph obtained by associating a vertex wi\ th each edge of\n ", count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "A", next := 101926, root := ~, start := 101912, stop := 101925 ), rec( content := ", ignori\ ng directions and multiplicites, and adding an edge\n between two vertices \ if and only if the corresponding edges have a vertex in\n common.", count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 35, 6 ], mathmode := "Text", name := "P", next := 102082, root := ~, start := 102078, stop := 102081 ), rec( content := "\n\n \ Note that the returned digraph is always a new immutable digraph, and the\n \ argument ", count := [ 3, 3, 35, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 35, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 35, 6 ], mathmode := "Text", name := "A", next := 102189, root := ~, start := 102175, stop := 102188 ), rec( content := " is neve\ r modified.\n ", count := [ 3, 3, 35, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> LineUndirectedDigraph(CompleteDigraph(3));\n\ngap> LineUndirectedDigraph(DigraphSymmetricClosure(ChainDigr\ aph(3)));\n\n", count := [ 3, 3, 35, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 35, 7 ], mathmode := "Text", name := "Example", next := 102453, root := ~, start := 102213, stop := 102452 ), rec( content := "\n ", count := [ 3, 3, 35, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 35, 5 ], mathmode := "Text", name := "Description", next := 102470, root := ~, start := 101749, stop := 102469 ) ], count := [ 3, 3, 35, 1 ], mathmode := "Text", name := "ManSection", next := 102484, root := ~, start := 101596, stop := 102483 ), rec( content := "\n\n ", count := [ 3, 3, 35, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DoubleDigraph" ), content := 0, count := [ 3, 3, 36, 2 ], mathmode := "Text", name := "Oper", next := 102547, root := ~, start := 102505, stop := 102546 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "Returns", next := 102579, root := ~, start := 102550, stop := 102578 ), rec( attributes := rec( ), content := [ rec( content := "\n Let\ ", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "A", next := 102618, root := ~, start := 102604, stop := 102617 ), rec( content := " be a di\ graph with vertex set ", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "V\ ", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "C", next := 102656, root := ~, start := 102648, stop := 102655 ), rec( content := ". This f\ unction\n returns the double digraph of ", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "A", next := 102720, root := ~, start := 102706, stop := 102719 ), rec( content := ". The ve\ rtex set of the double\n digraph is the orginal vertex set together with a \ duplicate. The edges are\n ", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u_1, v_2]", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "C", next := 102851, root := ~, start := 102834, stop := 102850 ), rec( content := " and ", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u_2, v_1]", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "C", next := 102873, root := ~, start := 102856, stop := 102872 ), rec( content := " if and \ only if ", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u, v]", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "C", next := 102902, root := ~, start := 102889, stop := 102901 ), rec( content := " is an\n\ edge in ", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "A", next := 102935, root := ~, start := 102921, stop := 102934 ), rec( content := ", togeth\ er with the original edges and their\n duplicates.", count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "P", next := 102999, root := ~, start := 102995, stop := 102998 ), rec( content := "\n\n \ If ", count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "A", next := 103022, root := ~, start := 103008, stop := 103021 ), rec( content := " is muta\ ble, then ", count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "A", next := 103054, root := ~, start := 103040, stop := 103053 ), rec( content := " is modi\ fied in-place. If\n ", count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "A", next := 103098, root := ~, start := 103084, stop := 103097 ), rec( content := " is immu\ table, then a new immutable digraph constructed as\n described above is ret\ urned.\n ", count := [ 3, 3, 36, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gamma := Digraph([[2], [3], [1]]);\n\ngap> DoubleDigraph(gamma);\n\n", count := [ 3, 3, 36, 5 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 5 ], mathmode := "Text", name := "Example", next := 103384, root := ~, start := 103194, stop := 103383 ), rec( content := "\n ", count := [ 3, 3, 36, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 36, 3 ], mathmode := "Text", name := "Description", next := 103401, root := ~, start := 102582, stop := 103400 ) ], count := [ 3, 3, 36, 1 ], mathmode := "Text", name := "ManSection", next := 103415, root := ~, start := 102490, stop := 103414 ), rec( content := "\n\n ", count := [ 3, 3, 36, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "BipartiteDouble\ Digraph" ), content := 0, count := [ 3, 3, 37, 2 ], mathmode := "Text", name := "Oper", next := 103487, root := ~, start := 103436, stop := 103486 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "Returns", next := 103519, root := ~, start := 103490, stop := 103518 ), rec( attributes := rec( ), content := [ rec( content := "\n Let\ ", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "A", next := 103558, root := ~, start := 103544, stop := 103557 ), rec( content := " be a di\ graph with vertex set ", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "V\ ", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "C", next := 103596, root := ~, start := 103588, stop := 103595 ), rec( content := ". This f\ unction\n returns the bipartite double digraph of ", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "A", next := 103670, root := ~, start := 103656, stop := 103669 ), rec( content := ". The ve\ rtex set of\n the double digraph is the original vertex set together with a\ duplicate. The\n edges are ", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u_1, v_2]", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "C", next := 103802, root := ~, start := 103785, stop := 103801 ), rec( content := " and ", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u_2, v_1]", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "C", next := 103824, root := ~, start := 103807, stop := 103823 ), rec( content := " if and \ only if ", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ u,\n v]", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "C", next := 103859, root := ~, start := 103840, stop := 103858 ), rec( content := " is an e\ dge in ", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "A", next := 103888, root := ~, start := 103874, stop := 103887 ), rec( content := ". The re\ sulting graph is bipartite,\n since the orignal edges are not included in t\ he resulting digraph.", count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "P", next := 103998, root := ~, start := 103994, stop := 103997 ), rec( content := "\n\n \ If ", count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "A", next := 104021, root := ~, start := 104007, stop := 104020 ), rec( content := " is muta\ ble, then ", count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "A", next := 104053, root := ~, start := 104039, stop := 104052 ), rec( content := " is modi\ fied in-place. If\n ", count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "A", next := 104097, root := ~, start := 104083, stop := 104096 ), rec( content := " is immu\ table, then a new immutable digraph constructed as\n described above is ret\ urned.\n ", count := [ 3, 3, 37, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gamma := Digraph([[2], [3], [1]]);\n\ngap> BipartiteDoubleDigraph(gamma);\n\n", count := [ 3, 3, 37, 5 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 5 ], mathmode := "Text", name := "Example", next := 104391, root := ~, start := 104193, stop := 104390 ), rec( content := "\n ", count := [ 3, 3, 37, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 37, 3 ], mathmode := "Text", name := "Description", next := 104408, root := ~, start := 103522, stop := 104407 ) ], count := [ 3, 3, 37, 1 ], mathmode := "Text", name := "ManSection", next := 104422, root := ~, start := 103421, stop := 104421 ), rec( content := "\n\n ", count := [ 3, 3, 37, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphAddAllLo\ ops" ), content := 0, count := [ 3, 3, 38, 2 ], mathmode := "Text", name := "Oper", next := 104490, root := ~, start := 104443, stop := 104489 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphAddAllLo\ opsAttr" ), content := 0, count := [ 3, 3, 38, 4 ], mathmode := "Text", name := "Attr", next := 104544, root := ~, start := 104493, stop := 104543 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "Returns", next := 104576, root := ~, start := 104547, stop := 104575 ), rec( attributes := rec( ), content := [ rec( content := "\n For\ a digraph ", count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "A", next := 104625, root := ~, start := 104611, stop := 104624 ), rec( content := " this op\ eration returns a new digraph constructed\n from ", count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "A", next := 104698, root := ~, start := 104684, stop := 104697 ), rec( content := ", such t\ hat a loop is added for every vertex which did not\n have a loop in ", count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "A", next := 104790, root := ~, start := 104776, stop := 104789 ), rec( content := ".", count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 38, 6 ], mathmode := "Text", name := "P", next := 104795, root := ~, start := 104791, stop := 104794 ), rec( content := "\n\n \ If ", count := [ 3, 3, 38, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 38, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 38, 6 ], mathmode := "Text", name := "A", next := 104818, root := ~, start := 104804, stop := 104817 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the loops are\ added to the loopless vertices of the mutable digraph\n ", count := [ 3, 3, 38, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 38, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 38, 6 ], mathmode := "Text", name := "A", next := 104976, root := ~, start := 104962, stop := 104975 ), rec( content := " in-plac\ e.\n ", count := [ 3, 3, 38, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := EmptyDigraph(13);\n\ngap>\ D := DigraphAddAllLoops(D);\n\ngap> OutNeighbours(D);\n[ [ 1 ], [ 2 ], [ 3 ], [ 4 ], [ 5 ], [ 6 ], \ [ 7 ], [ 8 ], [ 9 ], \n [ 10 ], [ 11 ], [ 12 ], [ 13 ] ]\ngap> D := Digraph([\ [1, 2, 3], [1, 3], [1]]);\n\ngap> \ D := DigraphAddAllLoops(D);\n\ngap> OutNeighbours(D);\n[ [ 1, 2, 3 ], [ 1, 3, 2 ], [ 1, 3 ] ]\ngap> D \ := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphAddAllLoops(D);\n\n\ gap> D;\n\n", count := [ 3, 3, 38, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 38, 7 ], mathmode := "Text", name := "Example", next := 105758, root := ~, start := 104991, stop := 105757 ), rec( content := "\n ", count := [ 3, 3, 38, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 38, 5 ], mathmode := "Text", name := "Description", next := 105775, root := ~, start := 104579, stop := 105774 ) ], count := [ 3, 3, 38, 1 ], mathmode := "Text", name := "ManSection", next := 105789, root := ~, start := 104428, stop := 105788 ), rec( content := "\n\n ", count := [ 3, 3, 38, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, i", Label := "for digraph an\ d int", Name := "DistanceDigraph" ), content := 0, count := [ 3, 3, 39, 2 ], mathmode := "Text", name := "Oper", next := 105893, root := ~, start := 105810, stop := 105892 ), rec( attributes := rec( Arg := "digraph, list", Label := "for digraph an\ d list", Name := "DistanceDigraph" ), content := 0, count := [ 3, 3, 39, 4 ], mathmode := "Text", name := "Oper", next := 105983, root := ~, start := 105896, stop := 105982 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "Returns", next := 106015, root := ~, start := 105986, stop := 106014 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ first argument is a digraph, the second argument is a non-negative\n integ\ er or a list of positive integers. This operation returns a digraph on\n th\ e same set of vertices as ", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "A", next := 106233, root := ~, start := 106219, stop := 106232 ), rec( content := ", with t\ wo vertices being adjacent\n if and only if the distance between them in ", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "A", next := 106330, root := ~, start := 106316, stop := 106329 ), rec( content := " equals \ ", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "A", next := 106346, root := ~, start := 106338, stop := 106345 ), rec( content := "\n or\ is a number in ", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "A", next := 106380, root := ~, start := 106369, stop := 106379 ), rec( content := ". See " , count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and two vertices", Oper := "DigraphShortestDistance" ), content := 0, count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "Ref", next := 106467, root := ~, start := 106387, stop := 106466 ), rec( content := ". ", count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "P", next := 106473, root := ~, start := 106469, stop := 106472 ), rec( content := "\n\n \ If ", count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "A", next := 106496, root := ~, start := 106482, stop := 106495 ), rec( content := " is muta\ ble, then ", count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "A", next := 106528, root := ~, start := 106514, stop := 106527 ), rec( content := " is modi\ fied in-place. If\n ", count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "A", next := 106572, root := ~, start := 106558, stop := 106571 ), rec( content := " is immu\ table, then a new immutable digraph constructed as\n described above is ret\ urned.\n ", count := [ 3, 3, 39, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph := DigraphFromSparse6String(\n> \":]n?AL`BC_DEbEF`GIaGHdIJeGKcKL\ _@McDHfILaBJfHMjKM\");\n\ngap> D\ istanceDigraph(digraph, 1);\n\ng\ ap> DistanceDigraph(digraph, [1, 2]);\n\n", count := [ 3, 3, 39, 7 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 7 ], mathmode := "Text", name := "Example", next := 107012, root := ~, start := 106668, stop := 107011 ), rec( content := "\n ", count := [ 3, 3, 39, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 39, 5 ], mathmode := "Text", name := "Description", next := 107029, root := ~, start := 106018, stop := 107028 ) ], count := [ 3, 3, 39, 1 ], mathmode := "Text", name := "ManSection", next := 107043, root := ~, start := 105795, stop := 107042 ), rec( content := "\n\n ", count := [ 3, 3, 39, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, k", Name := "DigraphClosure"\ ), content := 0, count := [ 3, 3, 40, 2 ], mathmode := "Text", name := "Oper", next := 107110, root := ~, start := 107064, stop := 107109 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "Returns", next := 107142, root := ~, start := 107113, stop := 107141 ), rec( attributes := rec( ), content := [ rec( content := "\n Giv\ en a symmetric loopless digraph with no multiple edges ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "A", next := 107235, root := ~, start := 107221, stop := 107234 ), rec( content := ",\n t\ he ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "k", count := [ 3, 3, 40, 3 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := \ "Text", name := "A", next := 107256, root := ~, start := 107248, stop := 10725\ 5 ), rec( content := "-closure of ", count := [ 3, 3, 40, 3 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "digraph", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "A", next := 1072\ 82, root := ~, start := 107268, stop := 107281 ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "E", next := 107286, root := ~, start := 107245, stop := 107285 ), rec( content := " is defi\ ned to be the unique\n smallest symmetric loopless digraph ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "C", next := 107363, root := ~, start := 107355, stop := 107362 ), rec( content := " with no\ multiple edges on the\n vertices of ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "A", next := 107424, root := ~, start := 107410, stop := 107423 ), rec( content := " that co\ ntains all the edges of ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "A", next := 107470, root := ~, start := 107456, stop := 107469 ), rec( content := "\n an\ d satsifies the property that the sum of the degrees of every two\n non-adj\ acenct vertices in ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "C", next := 107581, root := ~, start := 107573, stop := 107580 ), rec( content := " is less\ than ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "A", next := 107603, root := ~, start := 107595, stop := 107602 ), rec( content := ". See ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymme\ tricDigraph" ), content := 0, count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "Ref", next := 107645, root := ~, start := 107609, stop := 107644 ), rec( content := ", ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digraph\ HasLoops" ), content := 0, count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "Ref", next := 107676, root := ~, start := 107647, stop := 107675 ), rec( content := ", ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMulti\ Digraph" ), content := 0, count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "Ref", next := 107710, root := ~, start := 107678, stop := 107709 ), rec( content := ", and ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "OutDegr\ eeOfVertex" ), content := 0, count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "Ref", next := 107747, root := ~, start := 107716, stop := 107746 ), rec( content := ". ", count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "P", next := 107753, root := ~, start := 107749, stop := 107752 ), rec( content := "\n\n \ The operation ", count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphClosure", count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "C", next := 107794, root := ~, start := 107773, stop := 107793 ), rec( content := " returns\ the ", count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "A", next := 107815, root := ~, start := 107807, stop := 107814 ), rec( content := "-closure\ of\n ", count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "A", next := 107845, root := ~, start := 107831, stop := 107844 ), rec( content := ".\n " , count := [ 3, 3, 40, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(6);\n\n\ gap> D := DigraphRemoveEdges(D, [[1, 2], [2, 1]]);\n\ngap> closure := DigraphClosure(D, 6);\n\ngap> IsCompleteDigraph(closure);\ntrue\n", count := [ 3, 3, 40, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 40, 5 ], mathmode := "Text", name := "Example", next := 108177, root := ~, start := 107851, stop := 108176 ), rec( content := "\n ", count := [ 3, 3, 40, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 40, 3 ], mathmode := "Text", name := "Description", next := 108194, root := ~, start := 107145, stop := 108193 ) ], count := [ 3, 3, 40, 1 ], mathmode := "Text", name := "ManSection", next := 108208, root := ~, start := 107049, stop := 108207 ), rec( content := "\n\n ", count := [ 3, 3, 40, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphMycielsk\ ian" ), content := 0, count := [ 3, 3, 41, 2 ], mathmode := "Text", name := "Oper", next := 108276, root := ~, start := 108229, stop := 108275 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphMycielsk\ ianAttr" ), content := 0, count := [ 3, 3, 41, 4 ], mathmode := "Text", name := "Attr", next := 108330, root := ~, start := 108279, stop := 108329 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "Returns", next := 108362, root := ~, start := 108333, stop := 108361 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "A", next := 108400, root := ~, start := 108386, stop := 108399 ), rec( content := " is a sy\ mmetric digraph, then\n ", count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphMycielskian", count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "C", next := 108459, root := ~, start := 108434, stop := 108458 ), rec( content := " returns\ the Mycielskian of ", count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "A", next := 108501, root := ~, start := 108487, stop := 108500 ), rec( content := ".", count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 41, 6 ], mathmode := "Text", name := "P", next := 108506, root := ~, start := 108502, stop := 108505 ), rec( content := "\n \n\ The Mycielskian of a symmetric digraph is a larger symmetric digraph\n \ constructed from it, which has a larger chromatic number. For further\n inf\ ormation, see ", count := [ 3, 3, 41, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttps://en.wikipedia.org/wiki/Mycielskian", count := [ 3, 3, 41, 6 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 41, 6 ], mathmode := "Text", name := "URL", next := 108732, root := ~, start := 108680, stop := 108731 ), rec( content := ".", count := [ 3, 3, 41, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 41, 7 ], mathmode := "Text", name := "P", next := 108737, root := ~, start := 108733, stop := 108736 ), rec( content := "\n\n \ If ", count := [ 3, 3, 41, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 41, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 41, 7 ], mathmode := "Text", name := "A", next := 108760, root := ~, start := 108746, stop := 108759 ), rec( content := " is immu\ table, then a new immutable digraph is returned.\n Otherwise, the mutable d\ igraph ", count := [ 3, 3, 41, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 3, 3, 41, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 41, 7 ], mathmode := "Text", name := "A", next := 108866, root := ~, start := 108852, stop := 108865 ), rec( content := " is chan\ ged in-place into\n its Mycielskian.", count := [ 3, 3, 41, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 3, 41, 8 ], mathmode := "Text", name := "P", next := 108916, root := ~, start := 108912, stop := 108915 ), rec( content := "\n\n \ ", count := [ 3, 3, 41, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(2);\n\ngap> C\ hromaticNumber(D);\n2\ngap> D := DigraphMycielskian(D);\n\ngap> ChromaticNumber(D);\n3\ngap> D := DigraphMyciel\ skian(D);\n\ngap> ChromaticNumbe\ r(D);\n4\ngap> D := CompleteBipartiteDigraph(IsMutable, 2, 3);\n\ngap> DigraphMycielskian(D);\n\ngap> D;\n\n", count := [ 3, 3, 41, 9 ], name := "PCDATA", root := ~ ) ], count := [ 3, 3, 41, 9 ], mathmode := "Text", name := "Example", next := 109486, root := ~, start := 108922, stop := 109485 ), rec( content := "\n ", count := [ 3, 3, 41, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 41, 5 ], mathmode := "Text", name := "Description", next := 109503, root := ~, start := 108365, stop := 109502 ) ], count := [ 3, 3, 41, 1 ], mathmode := "Text", name := "ManSection", next := 109517, root := ~, start := 108214, stop := 109516 ), rec( content := "\n\n ", count := [ 3, 3, 41, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 3, 0, 1 ], mathmode := "Text", name := "Section", next := 109531, root := ~, start := 43611, stop := 109530 ), rec( content := "\n\n ", count := [ 3, 3, 41, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Random digraphs", count := [ 3, 4, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 0, 2 ], mathmode := "Text", name := "Heading", next := 109578, root := ~, start := 109544, stop := 109577 ), rec( content := "\n ", count := [ 3, 4, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]n[, p]", Name := "RandomDigraph" ), content := 0, count := [ 3, 4, 1, 2 ], mathmode := "Text", name := "Oper", next := 109647, root := ~, start := 109598, stop := 109646 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "Returns", next := 109679, root := ~, start := 109650, stop := 109678 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ the optional first argument ", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "A", next := 109742, root := ~, start := 109731, stop := 109741 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "A", next := 109888, root := ~, start := 109877, stop := 109887 ), rec( content := " is ", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "Ref", next := 109922, root := ~, start := 109892, stop := 109921 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "A", next := 109990, root := ~, start := 109979, stop := 109989 ), rec( content := " is ", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "Ref", next := 110030, root := ~, start := 109994, stop := 110029 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "A", next := 110115, root := ~, start := 110104, stop := 110114 ), rec( content := " is not \ present, then ", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "Ref", next := 110175, root := ~, start := 110137, stop := 110174 ), rec( content := " is used\ by default.", count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 4, 1, 4 ], mathmode := "Text", name := "P", next := 110199, root := ~, start := 110195, stop := 110198 ), rec( content := "\n\n \ If ", count := [ 3, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 4 ], mathmode := "Text", name := "A", next := 110216, root := ~, start := 110208, stop := 110215 ), rec( content := " is a po\ sitive integer, then this function returns a random\n digraph with ", count := [ 3, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 4 ], mathmode := "Text", name := "A", next := 110301, root := ~, start := 110293, stop := 110300 ), rec( content := " vertice\ s and without multiple edges. The result\n may or may not have loops.", count := [ 3, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "P", next := 110384, root := ~, start := 110380, stop := 110383 ), rec( content := "\n\n \ If the optional second argument ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "A", next := 110430, root := ~, start := 110422, stop := 110429 ), rec( content := " is a fl\ oat with value\n ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "0\ \\leq ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "M", next := 110471, root := ~, start := 110457, stop := 110470 ), rec( content := " ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ p ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "A", next := 110482, root := ~, start := 110472, stop := 110481 ), rec( content := " ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ \\leq 1", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "M", next := 110497, root := ~, start := 110483, stop := 110496 ), rec( content := ", then a\ n edge will exist between each\n pair of vertices with probability approxim\ ately ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "A", next := 110596, root := ~, start := 110588, stop := 110595 ), rec( content := ".\n I\ f ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "A", next := 110613, root := ~, start := 110605, stop := 110612 ), rec( content := " is not \ specified, then a random probability will be assumed\n (chosen with uniform\ probability).\n ", count := [ 3, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> RandomDigraph(1000);\n\ngap> RandomDigraph(10000, 0.023);\n\ngap> RandomDigraph(IsMutableDigraph, 1000, 1 / 2);\n\n", count := [ 3, 4, 1, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 4, 1, 6 ], mathmode := "Text", name := "Log", next := 111011, root := ~, start := 110717, stop := 111010 ), rec( content := "\n ", count := [ 3, 4, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 1, 3 ], mathmode := "Text", name := "Description", next := 111028, root := ~, start := 109682, stop := 111027 ) ], count := [ 3, 4, 1, 1 ], mathmode := "Text", name := "ManSection", next := 111042, root := ~, start := 109583, stop := 111041 ), rec( content := "\n\n ", count := [ 3, 4, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "n[, m]", Name := "RandomMultiDigr\ aph" ), content := 0, count := [ 3, 4, 2, 2 ], mathmode := "Text", name := "Oper", next := 111109, root := ~, start := 111063, stop := 111108 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "Returns", next := 111141, root := ~, start := 111112, stop := 111140 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "A", next := 111173, root := ~, start := 111165, stop := 111172 ), rec( content := " is a po\ sitive integer, then this function returns a random\n digraph with ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "A", next := 111258, root := ~, start := 111250, stop := 111257 ), rec( content := " vertice\ s. If the optional second argument\n ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "A", next := 111313, root := ~, start := 111305, stop := 111312 ), rec( content := " is a po\ sitive integer, then the digraph will have ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "A", next := 111372, root := ~, start := 111364, stop := 111371 ), rec( content := "\n ed\ ges. If ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "A", next := 111395, root := ~, start := 111387, stop := 111394 ), rec( content := " is not \ specified, then the number of edges will be\n chosen randomly (with uniform\ probability) from the range\n ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "C", next := 111526, root := ~, start := 111513, stop := 111525 ), rec( attributes := rec( ), content := [ rec( content := "{\ n \\choose 2}", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "M", next := 111546, root := ~, start := 111526, stop := 111545 ), rec( attributes := rec( ), content := [ rec( content := "]\ ", count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "C", next := 111554, root := ~, start := 111546, stop := 111553 ), rec( content := ".\n " , count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 4, 2, 4 ], mathmode := "Text", name := "P", next := 111564, root := ~, start := 111560, stop := 111563 ), rec( content := "\n\n \ The method used by this function chooses each edge from the set of\n all po\ ssible edges with uniform probability. No effort is made to avoid\n creatin\ g multiple edges, so it is possible (but not guaranteed) that the\n result \ will have multiple edges. The result may or may not have loops.", count := [ 3, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 4, 2, 5 ], mathmode := "Text", name := "P", next := 111868, root := ~, start := 111864, stop := 111867 ), rec( content := "\n ", count := [ 3, 4, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> RandomMultiDigraph(1000);\n\ngap> RandomMultiDigraph(1000, 950);\n\n", count := [ 3, 4, 2, 6 ], name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 6 ], mathmode := "Text", name := "Log", next := 112077, root := ~, start := 111873, stop := 112076 ), rec( content := "\n ", count := [ 3, 4, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 2, 3 ], mathmode := "Text", name := "Description", next := 112094, root := ~, start := 111144, stop := 112093 ) ], count := [ 3, 4, 2, 1 ], mathmode := "Text", name := "ManSection", next := 112108, root := ~, start := 111048, stop := 112107 ), rec( content := "\n\n ", count := [ 3, 4, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]n", Name := "RandomTournamen\ t" ), content := 0, count := [ 3, 4, 3, 2 ], mathmode := "Text", name := "Oper", next := 112176, root := ~, start := 112129, stop := 112175 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "Returns", next := 112208, root := ~, start := 112179, stop := 112207 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ the optional first argument ", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "A", next := 112271, root := ~, start := 112260, stop := 112270 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "A", next := 112417, root := ~, start := 112406, stop := 112416 ), rec( content := " is ", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "Ref", next := 112451, root := ~, start := 112421, stop := 112450 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "A", next := 112519, root := ~, start := 112508, stop := 112518 ), rec( content := " is ", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "Ref", next := 112559, root := ~, start := 112523, stop := 112558 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "A", next := 112644, root := ~, start := 112633, stop := 112643 ), rec( content := " is not \ present, then ", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "Ref", next := 112704, root := ~, start := 112666, stop := 112703 ), rec( content := " is used\ by default.", count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "P", next := 112728, root := ~, start := 112724, stop := 112727 ), rec( content := "\n\n \ If ", count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "A", next := 112745, root := ~, start := 112737, stop := 112744 ), rec( content := " is a no\ n-negative integer, this function returns a random\n tournament with ", count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "A", next := 112832, root := ~, start := 112824, stop := 112831 ), rec( content := " vertice\ s. See ", count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsTourn\ ament" ), content := 0, count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "Ref", next := 112873, root := ~, start := 112847, stop := 112872 ), rec( content := ". ", count := [ 3, 4, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 4, 3, 5 ], mathmode := "Text", name := "P", next := 112879, root := ~, start := 112875, stop := 112878 ), rec( content := "\n ", count := [ 3, 4, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> RandomTournament(10);\n\ngap> Ran\ domTournament(IsMutableDigraph, 10);\n\n", count := [ 3, 4, 3, 6 ], name := "PCDATA", root := ~ ) ], count := [ 3, 4, 3, 6 ], mathmode := "Text", name := "Log", next := 113071, root := ~, start := 112884, stop := 113070 ), rec( content := "\n ", count := [ 3, 4, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 3, 3 ], mathmode := "Text", name := "Description", next := 113088, root := ~, start := 112211, stop := 113087 ) ], count := [ 3, 4, 3, 1 ], mathmode := "Text", name := "ManSection", next := 113102, root := ~, start := 112114, stop := 113101 ), rec( content := "\n\n ", count := [ 3, 4, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "n", Name := "RandomLattice" ), content := 0, count := [ 3, 4, 4, 2 ], mathmode := "Text", name := "Oper", next := 113159, root := ~, start := 113123, stop := 113158 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "Returns", next := 113191, root := ~, start := 113162, stop := 113190 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ the optional first argument ", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "A", next := 113254, root := ~, start := 113243, stop := 113253 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "A", next := 113400, root := ~, start := 113389, stop := 113399 ), rec( content := " is ", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "Ref", next := 113434, root := ~, start := 113404, stop := 113433 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "A", next := 113502, root := ~, start := 113491, stop := 113501 ), rec( content := " is ", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "Ref", next := 113542, root := ~, start := 113506, stop := 113541 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "A", next := 113627, root := ~, start := 113616, stop := 113626 ), rec( content := " is not \ present, then ", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "Ref", next := 113687, root := ~, start := 113649, stop := 113686 ), rec( content := " is used\ by default.", count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "P", next := 113711, root := ~, start := 113707, stop := 113710 ), rec( content := "\n\n \ If ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "A", next := 113728, root := ~, start := 113720, stop := 113727 ), rec( content := " is a po\ sitive integer, this function return a random lattice\n with ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "C", next := 113807, root := ~, start := 113799, stop := 113806 ), rec( content := " vertice\ s, where it is guaranteed that ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "C", next := 113854, root := ~, start := 113846, stop := 113853 ), rec( content := " is betw\ een\n ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "A", next := 113878, root := ~, start := 113870, stop := 113877 ), rec( content := " and ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "2\ * ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 4, 4, 4 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 4 ], mathmode := \ "Text", name := "A", next := 113898, root := ~, start := 113890, stop := 11389\ 7 ) ], count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "C", next := 113902, root := ~, start := 113883, stop := 113901 ), rec( content := ". See ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsLatti\ ceDigraph" ), content := 0, count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "Ref", next := 113938, root := ~, start := 113908, stop := 113937 ), rec( content := ". ", count := [ 3, 4, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 4, 4, 5 ], mathmode := "Text", name := "P", next := 113944, root := ~, start := 113940, stop := 113943 ), rec( content := "\n ", count := [ 3, 4, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> RandomLattice(10);\n\ngap> RandomLattice(IsMutableDigraph, 10);\n\n", count := [ 3, 4, 4, 6 ], name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 6 ], mathmode := "Text", name := "Log", next := 114139, root := ~, start := 113949, stop := 114138 ), rec( content := "\n ", count := [ 3, 4, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 4, 3 ], mathmode := "Text", name := "Description", next := 114156, root := ~, start := 113194, stop := 114155 ) ], count := [ 3, 4, 4, 1 ], mathmode := "Text", name := "ManSection", next := 114170, root := ~, start := 113108, stop := 114169 ), rec( content := "\n\n ", count := [ 3, 4, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 4, 0, 1 ], mathmode := "Text", name := "Section", next := 114184, root := ~, start := 109535, stop := 114183 ) , rec( content := "\n\n ", count := [ 3, 4, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Standard examples\ ", count := [ 3, 5, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 0, 2 ], mathmode := "Text", name := "Heading", next := 114233, root := ~, start := 114197, stop := 114232 ), rec( content := "\n ", count := [ 3, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]n", Name := "ChainDigraph" ) , content := 0, count := [ 3, 5, 1, 2 ], mathmode := "Text", name := "Oper", next := 114296, root := ~, start := 114253, stop := 114295 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "Returns", next := 114328, root := ~, start := 114299, stop := 114327 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "A", next := 114360, root := ~, start := 114352, stop := 114359 ), rec( content := " is a po\ sitive integer, this function returns a chain\n with ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "A", next := 114431, root := ~, start := 114423, stop := 114430 ), rec( content := " vertice\ s and ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "n", count := [ 3, 5, 1, 3 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := \ "Text", name := "A", next := 114456, root := ~, start := 114448, stop := 11445\ 5 ), rec( content := " - 1", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "C", next := 114464, root := ~, start := 114445, stop := 114463 ), rec( content := " edges.\\ n Specifically,\n for each vertex ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "C", next := 114518, root := ~, start := 114510, stop := 114517 ), rec( content := " (with " , count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "C", next := 114533, root := ~, start := 114525, stop := 114532 ), rec( content := " < ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "C", next := 114547, root := ~, start := 114539, stop := 114546 ), rec( content := "), there\ is a directed\n edge with source ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "C", next := 114599, root := ~, start := 114591, stop := 114598 ), rec( content := " and ran\ ge ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ + 1", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "C", next := 114622, root := ~, start := 114610, stop := 114621 ), rec( content := ". ", count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "P", next := 114628, root := ~, start := 114624, stop := 114627 ), rec( content := "\n\n \ If the optional first argument ", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "A", next := 114676, root := ~, start := 114665, stop := 114675 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "A", next := 114822, root := ~, start := 114811, stop := 114821 ), rec( content := " is ", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "Ref", next := 114856, root := ~, start := 114826, stop := 114855 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "A", next := 114924, root := ~, start := 114913, stop := 114923 ), rec( content := " is ", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "Ref", next := 114964, root := ~, start := 114928, stop := 114963 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "A", next := 115049, root := ~, start := 115038, stop := 115048 ), rec( content := " is not \ present, then ", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "Ref", next := 115109, root := ~, start := 115071, stop := 115108 ), rec( content := " is used\ by default.", count := [ 3, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 1, 5 ], mathmode := "Text", name := "P", next := 115133, root := ~, start := 115129, stop := 115132 ), rec( content := "\n\n \ The ", count := [ 3, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ ReflexiveTransitiveClosure" ), content := 0, count := [ 3, 5, 1, 5 ], mathmode := "Text", name := "Ref", next := 115190, root := ~, start := 115143, stop := 115189 ), rec( content := " of a ch\ ain represents a\n total order.\n ", count := [ 3, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> ChainDigraph(42);\n\ngap> Chai\ nDigraph(IsMutableDigraph, 10);\n\n\ ", count := [ 3, 5, 1, 6 ], name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 6 ], mathmode := "Text", name := "Example", next := 115419, root := ~, start := 115236, stop := 115418 ), rec( content := "\n ", count := [ 3, 5, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 1, 3 ], mathmode := "Text", name := "Description", next := 115436, root := ~, start := 114331, stop := 115435 ) ], count := [ 3, 5, 1, 1 ], mathmode := "Text", name := "ManSection", next := 115450, root := ~, start := 114238, stop := 115449 ), rec( content := "\n\n ", count := [ 3, 5, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]n", Name := "CompleteDigraph\ " ), content := 0, count := [ 3, 5, 2, 2 ], mathmode := "Text", name := "Oper", next := 115517, root := ~, start := 115471, stop := 115516 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "Returns", next := 115549, root := ~, start := 115520, stop := 115548 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "A", next := 115581, root := ~, start := 115573, stop := 115580 ), rec( content := " is a no\ n-negative integer, this function returns the complete\n digraph with ", count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "A", next := 115669, root := ~, start := 115661, stop := 115668 ), rec( content := " vertice\ s. See ", count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsCompl\ eteDigraph" ), content := 0, count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "Ref", next := 115715, root := ~, start := 115684, stop := 115714 ), rec( content := ". ", count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "P", next := 115721, root := ~, start := 115717, stop := 115720 ), rec( content := "\n\n \ If the optional first argument ", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "A", next := 115769, root := ~, start := 115758, stop := 115768 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "A", next := 115915, root := ~, start := 115904, stop := 115914 ), rec( content := " is ", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "Ref", next := 115949, root := ~, start := 115919, stop := 115948 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "A", next := 116017, root := ~, start := 116006, stop := 116016 ), rec( content := " is ", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "Ref", next := 116057, root := ~, start := 116021, stop := 116056 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "A", next := 116142, root := ~, start := 116131, stop := 116141 ), rec( content := " is not \ present, then ", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "Ref", next := 116202, root := ~, start := 116164, stop := 116201 ), rec( content := " is used\ by default.\n ", count := [ 3, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> CompleteDigraph(20);\n\ngap\ > CompleteDigraph(IsMutableDigraph, 10);\n\n", count := [ 3, 5, 2, 5 ], name := "PCDATA", root := ~ ) ], count := [ 3, 5, 2, 5 ], mathmode := "Text", name := "Example", next := 116420, root := ~, start := 116227, stop := 116419 ), rec( content := "\n ", count := [ 3, 5, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 2, 3 ], mathmode := "Text", name := "Description", next := 116437, root := ~, start := 115552, stop := 116436 ) ], count := [ 3, 5, 2, 1 ], mathmode := "Text", name := "ManSection", next := 116451, root := ~, start := 115456, stop := 116450 ), rec( content := "\n\n ", count := [ 3, 5, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]m, n", Name := "CompleteBiparti\ teDigraph" ), content := 0, count := [ 3, 5, 3, 2 ], mathmode := "Text", name := "Oper", next := 116530, root := ~, start := 116472, stop := 116529 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "Returns", next := 116562, root := ~, start := 116533, stop := 116561 ), rec( attributes := rec( ), content := [ rec( content := "\n A c\ omplete bipartite digraph is a digraph whose vertices\n can be partitioned \ into two non-empty vertex sets, such there exists\n a unique edge with sour\ ce ", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "C", next := 116751, root := ~, start := 116743, stop := 116750 ), rec( content := " and ran\ ge ", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "C", next := 116770, root := ~, start := 116762, stop := 116769 ), rec( content := " if and \ only if\n ", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "C", next := 116798, root := ~, start := 116790, stop := 116797 ), rec( content := " and ", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "C", next := 116811, root := ~, start := 116803, stop := 116810 ), rec( content := " lie in \ different vertex sets. ", count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "P", next := 116846, root := ~, start := 116842, stop := 116845 ), rec( content := "\n\n \ If ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "A", next := 116863, root := ~, start := 116855, stop := 116862 ), rec( content := " and ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "A", next := 116876, root := ~, start := 116868, stop := 116875 ), rec( content := " are pos\ itive integers, this function\n returns the complete bipartite digraph with\ vertex sets of sizes\n ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "A", next := 116995, root := ~, start := 116987, stop := 116994 ), rec( content := " (contai\ ning the vertices ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. m]", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "C", next := 117036, root := ~, start := 117021, stop := 117035 ), rec( content := ") and\n \ ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "A", next := 117054, root := ~, start := 117046, stop := 117053 ), rec( content := " (contai\ ning the vertices ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ m + 1 .. m + n]", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "C", next := 117103, root := ~, start := 117080, stop := 117102 ), rec( content := ").\n \ ", count := [ 3, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "P", next := 117114, root := ~, start := 117110, stop := 117113 ), rec( content := "\n\n \ If the optional first argument ", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "A", next := 117162, root := ~, start := 117151, stop := 117161 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "A", next := 117308, root := ~, start := 117297, stop := 117307 ), rec( content := " is ", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "Ref", next := 117342, root := ~, start := 117312, stop := 117341 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "A", next := 117410, root := ~, start := 117399, stop := 117409 ), rec( content := " is ", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "Ref", next := 117450, root := ~, start := 117414, stop := 117449 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "A", next := 117535, root := ~, start := 117524, stop := 117534 ), rec( content := " is not \ present, then ", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "Ref", next := 117595, root := ~, start := 117557, stop := 117594 ), rec( content := " is used\ by default.\n\n ", count := [ 3, 5, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> CompleteBipartiteDigraph(2, 3);\n\ngap> CompleteBipartiteDigraph(IsMutableDigraph\ , 3, 2);\n\n", count := [ 3, 5, 3, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 3, 6 ], mathmode := "Text", name := "Example", next := 117859, root := ~, start := 117621, stop := 117858 ), rec( content := "\n ", count := [ 3, 5, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 3, 3 ], mathmode := "Text", name := "Description", next := 117876, root := ~, start := 116565, stop := 117875 ) ], count := [ 3, 5, 3, 1 ], mathmode := "Text", name := "ManSection", next := 117890, root := ~, start := 116457, stop := 117889 ), rec( content := "\n\n ", count := [ 3, 5, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]orders", Name := "CompleteMultipa\ rtiteDigraph" ), content := 0, count := [ 3, 5, 4, 2 ], mathmode := "Text", name := "Oper", next := 117980, root := ~, start := 117915, stop := 117979 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "Returns", next := 118014, root := ~, start := 117985, stop := 118013 ), rec( attributes := rec( ), content := [ rec( content := "\n F\ or a list ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ rders", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "A", next := 118063, root := ~, start := 118050, stop := 118062 ), rec( content := " of ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "C", next := 118075, root := ~, start := 118067, stop := 118074 ), rec( content := " positiv\ e integers,\n this function returns the digraph containing ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "C", next := 118154, root := ~, start := 118146, stop := 118153 ), rec( content := " indepen\ dent sets\n of vertices of orders ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "l", count := [ 3, 5, 4, 3 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 3 ], mathmode := \ "Text", name := "A", next := 118212, root := ~, start := 118204, stop := 11821\ 1 ), rec( content := "[1] .. ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 3 ], mathmode := \ "Text", name := "A", next := 118227, root := ~, start := 118219, stop := 11822\ 6 ), rec( content := "[n]]", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "C", next := 118235, root := ~, start := 118200, stop := 118234 ), rec( content := ". Moreov\ er,\n each vertex is adjacent to every other not contained in the\n \ same independent set.\n ", count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "P", next := 118351, root := ~, start := 118347, stop := 118350 ), rec( content := "\n\n \ If the optional first argument ", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "A", next := 118401, root := ~, start := 118390, stop := 118400 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digrap\ h being created will\n belong to. For example, if ", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "A", next := 118551, root := ~, start := 118540, stop := 118550 ), rec( content := " is ", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "Ref", next := 118585, root := ~, start := 118555, stop := 118584 ), rec( content := ",\n \ then the digraph being created will be mutable, if ", count := [ 3, 5, 4, 4 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "A", next := 118655, root := ~, start := 118644, stop := 118654 ), rec( content := " is ", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "Ref", next := 118697, root := ~, start := 118659, stop := 118696 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "A", next := 118784, root := ~, start := 118773, stop := 118783 ), rec( content := " is not \ present, then ", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "Ref", next := 118846, root := ~, start := 118806, stop := 118845 ), rec( content := " is used\ by default.\n ", count := [ 3, 5, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> CompleteMultipartiteDigraph([5, 4, 2]);\n\ngap> CompleteMultipartiteDigraph(IsMuta\ bleDigraph, [5, 4, 2]);\n\n", count := [ 3, 5, 4, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 4, 5 ], mathmode := "Text", name := "Example", next := 119127, root := ~, start := 118873, stop := 119126 ), rec( content := "\n ", count := [ 3, 5, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 4, 3 ], mathmode := "Text", name := "Description", next := 119144, root := ~, start := 118019, stop := 119143 ) ], count := [ 3, 5, 4, 1 ], mathmode := "Text", name := "ManSection", next := 119158, root := ~, start := 117898, stop := 119157 ), rec( content := "\n\n ", count := [ 3, 5, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]n", Name := "CycleDigraph" ) , content := 0, count := [ 3, 5, 5, 2 ], mathmode := "Text", name := "Oper", next := 119222, root := ~, start := 119179, stop := 119221 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "Returns", next := 119254, root := ~, start := 119225, stop := 119253 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "A", next := 119286, root := ~, start := 119278, stop := 119285 ), rec( content := " is a po\ sitive integer, this function returns a ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ycle", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "E", next := 119346, root := ~, start := 119334, stop := 119345 ), rec( content := "\n di\ graph with ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "A", next := 119372, root := ~, start := 119364, stop := 119371 ), rec( content := " vertice\ s and ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "A", next := 119394, root := ~, start := 119386, stop := 119393 ), rec( content := " edges. \ Specifically,\n for each vertex ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "C", next := 119444, root := ~, start := 119436, stop := 119443 ), rec( content := " (with " , count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "C", next := 119459, root := ~, start := 119451, stop := 119458 ), rec( content := " < ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "C", next := 119473, root := ~, start := 119465, stop := 119472 ), rec( content := "), there\ is a directed\n edge with source ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "C", next := 119525, root := ~, start := 119517, stop := 119524 ), rec( content := " and ran\ ge ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ + 1", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "C", next := 119548, root := ~, start := 119536, stop := 119547 ), rec( content := ". In add\ ition, there is\n an edge with source ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "C", next := 119604, root := ~, start := 119596, stop := 119603 ), rec( content := " and ran\ ge ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "C", next := 119623, root := ~, start := 119615, stop := 119622 ), rec( content := ". ", count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "P", next := 119629, root := ~, start := 119625, stop := 119628 ), rec( content := "\n\n \ If the optional first argument ", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "A", next := 119677, root := ~, start := 119666, stop := 119676 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "A", next := 119823, root := ~, start := 119812, stop := 119822 ), rec( content := " is ", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "Ref", next := 119857, root := ~, start := 119827, stop := 119856 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "A", next := 119925, root := ~, start := 119914, stop := 119924 ), rec( content := " is ", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "Ref", next := 119965, root := ~, start := 119929, stop := 119964 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "A", next := 120050, root := ~, start := 120039, stop := 120049 ), rec( content := " is not \ present, then ", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "Ref", next := 120108, root := ~, start := 120072, stop := 120107 ), rec( content := " is used\ by default.\n ", count := [ 3, 5, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> CycleDigraph(1);\n\ngap> CycleD\ igraph(123);\n\ngap> CycleDigraph(I\ sMutableDigraph, 10);\n\n", count := [ 3, 5, 5, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 5, 5 ], mathmode := "Text", name := "Example", next := 120381, root := ~, start := 120131, stop := 120380 ), rec( content := "\n ", count := [ 3, 5, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 5, 3 ], mathmode := "Text", name := "Description", next := 120398, root := ~, start := 119257, stop := 120397 ) ], count := [ 3, 5, 5, 1 ], mathmode := "Text", name := "ManSection", next := 120412, root := ~, start := 119164, stop := 120411 ), rec( content := "\n\n ", count := [ 3, 5, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]n", Name := "EmptyDigraph" ) , content := 0, count := [ 3, 5, 6, 2 ], mathmode := "Text", name := "Oper", next := 120476, root := ~, start := 120433, stop := 120475 ), rec( attributes := rec( Arg := "[filt, ]n", Name := "NullDigraph" ), content := 0, count := [ 3, 5, 6, 4 ], mathmode := "Text", name := "Oper", next := 120521, root := ~, start := 120479, stop := 120520 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "Returns", next := 120553, root := ~, start := 120524, stop := 120552 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "A", next := 120585, root := ~, start := 120577, stop := 120584 ), rec( content := " is a no\ n-negative integer, this function returns the\n ", count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ mpty", count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "E", next := 120655, root := ~, start := 120643, stop := 120654 ), rec( content := " or ", count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ull", count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "E", next := 120670, root := ~, start := 120659, stop := 120669 ), rec( content := " digraph\ with ", count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "A", next := 120692, root := ~, start := 120684, stop := 120691 ), rec( content := " vertice\ s. An empty\n digraph is one with no edges.\n ", count := [ 3, 5, 6, 5 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "P", next := 120754, root := ~, start := 120750, stop := 120753 ), rec( content := "\n \ \n If the optional first argument ", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "A", next := 120808, root := ~, start := 120797, stop := 120807 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "A", next := 120954, root := ~, start := 120943, stop := 120953 ), rec( content := " is ", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "Ref", next := 120988, root := ~, start := 120958, stop := 120987 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "A", next := 121056, root := ~, start := 121045, stop := 121055 ), rec( content := " is ", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "Ref", next := 121096, root := ~, start := 121060, stop := 121095 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "A", next := 121181, root := ~, start := 121170, stop := 121180 ), rec( content := " is not \ present, then ", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "Ref", next := 121241, root := ~, start := 121203, stop := 121240 ), rec( content := " is used\ by default.", count := [ 3, 5, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 6, 7 ], mathmode := "Text", name := "P", next := 121265, root := ~, start := 121261, stop := 121264 ), rec( content := "\n\n \ ", count := [ 3, 5, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "N\ ullDigraph", count := [ 3, 5, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 7 ], mathmode := "Text", name := "C", next := 121289, root := ~, start := 121271, stop := 121288 ), rec( content := " is a sy\ nonym for ", count := [ 3, 5, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "E\ mptyDigraph", count := [ 3, 5, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 7 ], mathmode := "Text", name := "C", next := 121326, root := ~, start := 121307, stop := 121325 ), rec( content := ".\n\n \ ", count := [ 3, 5, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> EmptyDigraph(20);\n\ngap> Null\ Digraph(10);\n\ngap> EmptyDigraph(Is\ MutableDigraph, 10);\n", count := [ 3, 5, 6, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 6, 8 ], mathmode := "Text", name := "Example", next := 121577, root := ~, start := 121333, stop := 121576 ), rec( content := "\n ", count := [ 3, 5, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 6, 5 ], mathmode := "Text", name := "Description", next := 121594, root := ~, start := 120556, stop := 121593 ) ], count := [ 3, 5, 6, 1 ], mathmode := "Text", name := "ManSection", next := 121608, root := ~, start := 120418, stop := 121607 ), rec( content := "\n\n ", count := [ 3, 5, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]n, k", Name := "JohnsonDigraph"\ ), content := 0, count := [ 3, 5, 7, 2 ], mathmode := "Text", name := "Oper", next := 121677, root := ~, start := 121629, stop := 121676 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "Returns", next := 121709, root := ~, start := 121680, stop := 121708 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "A", next := 121741, root := ~, start := 121733, stop := 121740 ), rec( content := " and ", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "A", next := 121754, root := ~, start := 121746, stop := 121753 ), rec( content := " are non\ -negative integers, then this operation\n returns a symmetric digraph which\ corresponds to the undirected ", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "J\ ohnson\n graph", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "E", next := 121894, root := ~, start := 121870, stop := 121893 ), rec( content := " ", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "J\ (n, k)", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "M", next := 121909, root := ~, start := 121895, stop := 121908 ), rec( content := ". ", count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "P", next := 121915, root := ~, start := 121911, stop := 121914 ), rec( content := "\n\n \ If the optional first argument ", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "A", next := 121963, root := ~, start := 121952, stop := 121962 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "A", next := 122109, root := ~, start := 122098, stop := 122108 ), rec( content := " is ", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "Ref", next := 122143, root := ~, start := 122113, stop := 122142 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "A", next := 122211, root := ~, start := 122200, stop := 122210 ), rec( content := " is ", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "Ref", next := 122251, root := ~, start := 122215, stop := 122250 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "A", next := 122336, root := ~, start := 122325, stop := 122335 ), rec( content := " is not \ present, then ", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "Ref", next := 122396, root := ~, start := 122358, stop := 122395 ), rec( content := " is used\ by default.", count := [ 3, 5, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "P", next := 122420, root := ~, start := 122416, stop := 122419 ), rec( content := "\n\n \ The ", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "J\ ohnson graph", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "E", next := 122450, root := ~, start := 122430, stop := 122449 ), rec( content := " ", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "J\ (n, k)", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "M", next := 122465, root := ~, start := 122451, stop := 122464 ), rec( content := " has ver\ tices given by all the\n ", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "A", next := 122508, root := ~, start := 122500, stop := 122507 ), rec( content := "-subsets\ of the range ", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1 .. ", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 5, 7, 5 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 5 ], mathmode := \ "Text", name := "A", next := 122547, root := ~, start := 122539, stop := 12254\ 6 ), rec( content := "]", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "C", next := 122552, root := ~, start := 122530, stop := 122551 ), rec( content := ", and tw\ o vertices are\n connected by an edge iff their intersection has size ", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "k", count := [ 3, 5, 7, 5 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 5 ], mathmode := \ "Text", name := "A", next := 122645, root := ~, start := 122637, stop := 12264\ 4 ), rec( content := " - 1", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "M", next := 122653, root := ~, start := 122634, stop := 122652 ), rec( content := ".\n\n \ ", count := [ 3, 5, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := JohnsonDigraph(3, 1);\n\ngap> OutNeighbours(gr);\n[ [ 2, 3 ], [ 1, 3 ], [ 1, 2 ] ]\ngap> g\ r := JohnsonDigraph(4, 2);\n\ngap> OutNeighbours(gr);\n[ [ 2, 3, 4, 5 ], [ 1, 3, 4, 6 ], [ 1, 2, 5, 6\ ], [ 1, 2, 5, 6 ], \n [ 1, 3, 4, 6 ], [ 2, 3, 4, 5 ] ]\ngap> JohnsonDigraph(\ 1, 0);\n\ngap> JohnsonDigraph(IsMutable\ Digraph, 1, 0);\n\n", count := [ 3, 5, 7, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 7, 6 ], mathmode := "Text", name := "Example", next := 123202, root := ~, start := 122660, stop := 123201 ), rec( content := "\n ", count := [ 3, 5, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 7, 3 ], mathmode := "Text", name := "Description", next := 123219, root := ~, start := 121712, stop := 123218 ) ], count := [ 3, 5, 7, 1 ], mathmode := "Text", name := "ManSection", next := 123233, root := ~, start := 121614, stop := 123232 ), rec( content := "\n\n ", count := [ 3, 5, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt]", Name := "PetersenGraph" ), content := 0, count := [ 3, 5, 8, 2 ], mathmode := "Text", name := "Oper", next := 123295, root := ~, start := 123254, stop := 123294 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 5, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 8, 3 ], mathmode := "Text", name := "Returns", next := 123327, root := ~, start := 123298, stop := 123326 ), rec( attributes := rec( ), content := [ rec( content := "\n\n F\ rom ", count := [ 3, 5, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttps://en.wikipedia.org/wiki/Petersen_graph", count := [ 3, 5, 8, 3 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 8, 3 ], mathmode := "Text", name := "URL", next := 123409, root := ~, start := 123354, stop := 123408 ), rec( content := ":", count := [ 3, 5, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 8, 4 ], mathmode := "Text", name := "P", next := 123414, root := ~, start := 123410, stop := 123413 ), rec( content := "\n\n \ ", count := [ 3, 5, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "T\ he Petersen graph is an undirected graph with 10 vertices and 15 edges.\n I\ t is a small graph that serves as a useful example and counterexample for\n \ many problems in graph theory. The Petersen graph is named after Julius\n \ Petersen, who in 1898 constructed it to be the smallest bridgeless cubic\n \ graph with no three-edge-coloring.", count := [ 3, 5, 8, 4 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 8, 4 ], mathmode := "Text", name := "Q", next := 123770, root := ~, start := 123420, stop := 123769 ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "P", next := 123774, root := ~, start := 123770, stop := 123773 ), rec( content := "\n \n\ If the optional first argument ", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "A", next := 123826, root := ~, start := 123815, stop := 123825 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "A", next := 123972, root := ~, start := 123961, stop := 123971 ), rec( content := " is ", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "Ref", next := 124006, root := ~, start := 123976, stop := 124005 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "A", next := 124074, root := ~, start := 124063, stop := 124073 ), rec( content := " is ", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "Ref", next := 124114, root := ~, start := 124078, stop := 124113 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "A", next := 124199, root := ~, start := 124188, stop := 124198 ), rec( content := " is not \ present, then ", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "Ref", next := 124259, root := ~, start := 124221, stop := 124258 ), rec( content := " is used\ by default.", count := [ 3, 5, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 8, 6 ], mathmode := "Text", name := "P", next := 124283, root := ~, start := 124279, stop := 124282 ), rec( content := "\n\n \ See also ", count := [ 3, 5, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "General\ isedPetersenGraph" ), content := 0, count := [ 3, 5, 8, 6 ], mathmode := "Text", name := "Ref", next := 124336, root := ~, start := 124298, stop := 124335 ), rec( content := ".\n\n", count := [ 3, 5, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> ChromaticNumber(PetersenGraph());\n3\ngap> PetersenGraph(IsMutableDigrap\ h);\n\n", count := [ 3, 5, 8, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 8, 7 ], mathmode := "Text", name := "Example", next := 124495, root := ~, start := 124339, stop := 124494 ), rec( content := "\n ", count := [ 3, 5, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 8, 3 ], mathmode := "Text", name := "Description", next := 124512, root := ~, start := 123330, stop := 124511 ) ], count := [ 3, 5, 8, 1 ], mathmode := "Text", name := "ManSection", next := 124526, root := ~, start := 123239, stop := 124525 ), rec( content := "\n\n ", count := [ 3, 5, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]n, k", Name := "GeneralisedPete\ rsenGraph" ), content := 0, count := [ 3, 5, 9, 2 ], mathmode := "Text", name := "Oper", next := 124605, root := ~, start := 124547, stop := 124604 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "Returns", next := 124637, root := ~, start := 124608, stop := 124636 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "A", next := 124669, root := ~, start := 124661, stop := 124668 ), rec( content := " is a po\ sitive integer and ", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "A", next := 124704, root := ~, start := 124696, stop := 124703 ), rec( content := " is a no\ n-negative\n integer less than ", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "n", count := [ 3, 5, 9, 3 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 3 ], mathmode := \ "Text", name := "A", next := 124756, root := ~, start := 124748, stop := 12475\ 5 ), rec( content := " / 2", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "C", next := 124764, root := ~, start := 124745, stop := 124763 ), rec( content := ", then t\ his operation returns\n the ", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ eneralised Petersen graph", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "E", next := 124835, root := ~, start := 124802, stop := 124834 ), rec( content := " ", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ PG(", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 3, 5, 9, 3 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 3 ], mathmode := \ "Text", name := "A", next := 124851, root := ~, start := 124843, stop := 12485\ 0 ), rec( content := ", k)", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "M", next := 124859, root := ~, start := 124836, stop := 124858 ), rec( content := ". ", count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 9, 4 ], mathmode := "Text", name := "P", next := 124865, root := ~, start := 124861, stop := 124864 ), rec( content := "\n\n \ From\n ", count := [ 3, 5, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttps://en.wikipedia.org/wiki/Generalized_Petersen_graph", count := [ 3, 5, 9, 4 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 4 ], mathmode := "Text", name := "URL", next := 124947, root := ~, start := 124880, stop := 124946 ), rec( content := ":\n " , count := [ 3, 5, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 9, 5 ], mathmode := "Text", name := "P", next := 124957, root := ~, start := 124953, stop := 124956 ), rec( content := "\n\n \ ", count := [ 3, 5, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "T\ he generalized Petersen graphs are a family of cubic\n graphs formed by con\ necting the vertices of a regular polygon to the\n corresponding vertices o\ f a star polygon. They include the Petersen graph\n and generalize one of t\ he ways of constructing the Petersen graph. The\n generalized Petersen grap\ h family was introduced in 1950 by H. S. M.\n Coxeter and was given its nam\ e in 1969 by Mark Watkins.", count := [ 3, 5, 9, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 9, 5 ], mathmode := "Text", name := "Q", next := 125382, root := ~, start := 124963, stop := 125381 ), rec( content := "\n ", count := [ 3, 5, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "P", next := 125391, root := ~, start := 125387, stop := 125390 ), rec( content := "\n\n \ If the optional first argument ", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "A", next := 125439, root := ~, start := 125428, stop := 125438 ), rec( content := " is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if ", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "A", next := 125585, root := ~, start := 125574, stop := 125584 ), rec( content := " is ", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "Ref", next := 125619, root := ~, start := 125589, stop := 125618 ), rec( content := ",\n t\ hen the digraph being created will be mutable, if ", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "A", next := 125687, root := ~, start := 125676, stop := 125686 ), rec( content := " is ", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "Ref", next := 125727, root := ~, start := 125691, stop := 125726 ), rec( content := ", then t\ he digraph will be immutable. \n If the optional first argument ", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "A", next := 125812, root := ~, start := 125801, stop := 125811 ), rec( content := " is not \ present, then ", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "Ref", next := 125872, root := ~, start := 125834, stop := 125871 ), rec( content := " is used\ by default.", count := [ 3, 5, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 3, 5, 9, 7 ], mathmode := "Text", name := "P", next := 125896, root := ~, start := 125892, stop := 125895 ), rec( content := "\n\n \ See also ", count := [ 3, 5, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Peterse\ nGraph" ), content := 0, count := [ 3, 5, 9, 7 ], mathmode := "Text", name := "Ref", next := 125938, root := ~, start := 125911, stop := 125937 ), rec( content := ".\n\n", count := [ 3, 5, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> GeneralisedPetersenGraph(7, 2);\n\ngap> GeneralisedPetersenGraph(40, 1);\n\ngap> D := GeneralisedPetersenGraph(5, 2\ );\n\ngap> IsIsomorphi\ cDigraph(D, PetersenGraph());\ntrue\ngap> GeneralisedPetersenGraph(IsMutableDi\ graph, 9, 4);\n\n", count := [ 3, 5, 9, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 3, 5, 9, 8 ], mathmode := "Text", name := "Example", next := 126413, root := ~, start := 125941, stop := 126412 ), rec( content := "\n ", count := [ 3, 5, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 9, 3 ], mathmode := "Text", name := "Description", next := 126430, root := ~, start := 124640, stop := 126429 ) ], count := [ 3, 5, 9, 1 ], mathmode := "Text", name := "ManSection", next := 126444, root := ~, start := 124532, stop := 126443 ), rec( content := "\n\n ", count := [ 3, 5, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 5, 0, 1 ], mathmode := "Text", name := "Section", next := 126458, root := ~, start := 114188, stop := 126457 ) , rec( content := "\n\n", count := [ 3, 5, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 3, 0, 0, 1 ], mathmode := "Text", name := "Chapter", next := 126470, root := ~, start := 19211, stop := 126469 ), rec( content := "\n ", count := [ 3, 5, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " creating ", count := [ 3, 5, 9, 9 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 3, 5, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Operators" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Operators", count := [ 4, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 126547, root := ~, start := 126519, stop := 126546 ) , rec( content := "\n\n ", count := [ 4, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Operators for dig\ raphs", count := [ 4, 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 126601, root := ~, start := 126560, stop := 126600 ), rec( content := "\n ", count := [ 4, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "digraph1", count := [ 4, 1, 0, 4 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 4 ], mathmode := \ "Text", name := "A", next := 126642, root := ~, start := 126627, stop := 12664\ 1 ), rec( content := " = ", count := [ 4, 1, 0, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 4, 1, 0, 4 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 4, 1, 0, 4 ], mathmode := "Text", name := "A", next := 1266\ 60, root := ~, start := 126645, stop := 126659 ) ], count := [ 4, 1, 0, 4 ], mathmode := "Text", name := "C", next := 126664, root := ~, start := 126624, stop := 126663 ) ], count := [ 4, 1, 0, 4 ], name := "Mark", next := 126671, root := ~, start := 126618, stop := 126670 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "=" ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "=", count := [ 4, 1, 0, 5 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 5 ], mathmode := \ "Text", name := "C", next := 126714, root := ~, start := 126706, stop := 12671\ 3 ), rec( content := " (for digraphs)", count := [ 4, 1, 0, 5 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "Index", next := 126737, root := ~, start := 126691, stop := 126736 ), rec( content := "\n \ returns ", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "K", next := 126764, root := ~, start := 126753, stop := 126763 ), rec( content := " if ", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "A", next := 126783, root := ~, start := 126768, stop := 126782 ), rec( content := " and ", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "A", next := 126803, root := ~, start := 126788, stop := 126802 ), rec( content := " have th\ e same\n vertices, and ", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEdges(", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "digraph1", count := [ 4, 1, 0, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 5 ], mathmode := \ "Text", name := "A", next := 126870, root := ~, start := 126855, stop := 12686\ 9 ), rec( content := ") =\n DigraphEdges(", count := [ 4, 1, 0, 5 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph2", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "A", next := 1269\ 11, root := ~, start := 126896, stop := 126910 ), rec( content := ")", count := [ 4, 1, 0, 5 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "C", next := 126916, root := ~, start := 126839, stop := 126915 ), rec( content := ", up to \ some re-ordering of the edge\n lists. ", count := [ 4, 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 4, 1, 0, 6 ], mathmode := "Text", name := "P", next := 126971, root := ~, start := 126967, stop := 126970 ), rec( content := "\n\n \ Note that this operator does not compare the vertex labels\n of ", count := [ 4, 1, 0, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 4, 1, 0, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 6 ], mathmode := "Text", name := "A", next := 127064, root := ~, start := 127049, stop := 127063 ), rec( content := " and ", count := [ 4, 1, 0, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 4, 1, 0, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 6 ], mathmode := "Text", name := "A", next := 127084, root := ~, start := 127069, stop := 127083 ), rec( content := ".\n \ ", count := [ 4, 1, 0, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 5 ], name := "Item", next := 127098, root := ~, start := 126677, stop := 127097 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "digraph1", count := [ 4, 1, 0, 7 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 7 ], mathmode := \ "Text", name := "A", next := 127129, root := ~, start := 127114, stop := 12712\ 8 ), rec( content := " < ", count := [ 4, 1, 0, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 4, 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 4, 1, 0, 7 ], mathmode := "Text", name := "A", next := 1271\ 50, root := ~, start := 127135, stop := 127149 ) ], count := [ 4, 1, 0, 7 ], mathmode := "Text", name := "C", next := 127154, root := ~, start := 127111, stop := 127153 ) ], count := [ 4, 1, 0, 7 ], name := "Mark", next := 127161, root := ~, start := 127105, stop := 127160 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ 4, 1, 0, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "<" ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "<", count := [ 4, 1, 0, 8 ], mathmode \ := "Text", name := "PCDATA", next := 6, root := ~ ) ], count := [ 4, 1, 0, 8 ] , mathmode := \ "Text", name := "C", next := 127210, root := ~, start := 127199, stop := 12720\ 9 ), rec( content := " (for digraphs)", count := [ 4, 1, 0, 8 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 8 ], mathmode := "Text", name := "Index", next := 127233, root := ~, start := 127181, stop := 127232 ), rec( content := "\n\n \ This operator returns ", count := [ 4, 1, 0, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 4, 1, 0, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 8 ], mathmode := "Text", name := "K", next := 127275, root := ~, start := 127264, stop := 127274 ), rec( content := " if one \ of the following holds:\n\n ", count := [ 4, 1, 0, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n The number ", count := [ \ 4, 1, 0, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "n_1", count := [ 4, 1, 0, 10 ], \ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 10 ], math\ mode := "Text", name := "M", next := 127370, root := ~, start := 127360, stop \ := 127369 ), rec( content := " of vertices in ", count := [ 4, 1, 0, 10 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "digraph1", count := [ 4, 1, 0, 10 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 10 ], mathmode := "T\ ext", name := "A", next := 127401, root := ~, start := 127386, stop := 127400 ), rec( cont\ ent := " is less than\n the number ", count := [ 4, 1, 0, 10 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "n_2", count := [ 4, 1, 0, 10 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 10 ], mathmode := "Text", name\ := "M", next := 127447, root := ~, start := 127437, stop := 127446 ), rec( cont\ ent := " of vertices in ", count := [ 4, 1, 0, 10 ], mathmode := "Text", name \ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conten\ t := "digraph2", count := [ 4, 1, 0, 10 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 4, 1, 0, 10 ], mathmode := "Text", name := "A", next\ := 127478, root := ~, start := 127463, stop := 127477 ), rec( content := ";\n\ ", count := [ 4, 1, 0, 10 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 4, 1, 0, 10 ], name := "Item", next := 127496, root := ~, start := 127\ 331, stop := 127495 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n ", count := [ 4, 1, 0, 12 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n_\ 1 = n_2", count := [ 4, 1, 0, 12 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 4, 1, 0, 12 ], mathmode := "Text", name := "M", next := \ 127540, root := ~, start := 127524, stop := 127539 ), rec( content := ", and t\ he number ", count := [ 4, 1, 0, 12 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "m_1", count\ := [ 4, 1, 0, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 4, 1, 0, 12 ], mathmode := "Text", name := "M", next := 127567, root :=\ ~, start := 127557, stop := 127566 ), rec( content := " of edges in\n \ ", count := [ 4, 1, 0, 12 ], mathmode := "Text", name := "PCDATA", root := \ ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph1", coun\ t := [ 4, 1, 0, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 4, 1, 0, 12 ], mathmode := "Text", name := "A", next := 127606, root :=\ ~, start := 127591, stop := 127605 ), rec( content := " is less than the numb\ er ", count := [ 4, 1, 0, 12 ], mathmode := "Text", name := "PCDATA", root := \ ~ ), rec( attributes := rec( ), content := [ rec( content := "m_2", count := \ [ 4, 1, 0, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :=\ [ 4, 1, 0, 12 ], mathmode := "Text", name := "M", next := 127641, root := ~, star\ t := 127631, stop := 127640 ), rec( content := " of edges in\n ", coun\ t := [ 4, 1, 0, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "digraph2", count := [ 4, 1, 0\ , 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, \ 0, 12 ], mathmode := "Text", name := "A", next := 127680, root := ~, start := \ 127665, stop := 127679 ), rec( content := ";\n ", count := [ 4, 1, 0, \ 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 12 ], name := "Ite\ m", next := 127698, root := ~, start := 127506, stop := 127697 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n ", count := [ 4, 1, 0, 1\ 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec\ ( ), content := [ rec( content := "n_1 = n_2", count := [ 4, 1, 0, 14 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 14 ], math\ mode := "Text", name := "M", next := 127742, root := ~, start := 127726, stop \ := 127741 ), rec( content := ", ", count := [ 4, 1, 0, 14 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec\ ( content := "m_1 = m_2", count := [ 4, 1, 0, 14 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 14 ], mathmode := "Text", name \ := "M", next := 127760, root := ~, start := 127744, stop := 127759 ), rec( cont\ ent := ", and\n ", count := [ 4, 1, 0, 14 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "DigraphEdges(", count := [ 4, 1, 0, 14 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :=\ "digraph1", count := [ 4, 1, 0, 14 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 4, 1, 0, 14 ], mathmode := "Text", name := "A", next \ := 127808, root := ~, start := 127793, stop := 127807 ), rec( content := ")", \ count := [ 4, 1, 0, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 4, 1, 0, 14 ], mathmode := "Text", name := "C", next := 127813, root :=\ ~, start := 127777, stop := 127812 ), rec( content := " is less than\n \ ", count := [ 4, 1, 0, 14 ], mathmode := "Text", name := "PCDATA", root :=\ ~ ), rec( attributes := rec( ), content := [ rec( content := "DigraphEdges("\ , count := [ 4, 1, 0, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ),\ rec( attributes := rec( ), content := [ rec( content := "digraph2", count :=\ [ 4, 1, 0, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :\ = [ 4, 1, 0, 14 ], mathmode := "Text", name := "A", next := 127869, root := ~,\ start := 127854, stop := 127868 ), rec( content := ")", count := [ 4, 1, 0, 1\ 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, \ 14 ], mathmode := "Text", name := "C", next := 127874, root := ~, start := 127\ 838, stop := 127873 ), rec( content := " after having both of these sets\n \ have been sorted with respect to the lexicographical order.\n " , coun\ t := [ 4, 1, 0, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 14 ], name := "Ite\ m", next := 127994, root := ~, start := 127708, stop := 127993 ) ], count := [ 4, 1, 0, 9 ], mathmode := "Text", name := "List", next := 128009, root := ~, start := 127315, stop := 128008 ), rec( content := "\n " , count := [ 4, 1, 0, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 8 ], name := "Item", next := 128022, root := ~, start := 127167, stop := 128021 ) ], count := [ 4, 1, 0, 4 ], mathmode := "Text", name := "List", next := 128033, root := ~, start := 126606, stop := 128032 ), rec( content := "\n\n ", count := [ 4, 1, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "super, sub", Name := "IsSubdigraph" ) , content := 0, count := [ 4, 1, 1, 2 ], mathmode := "Text", name := "Oper", next := 128097, root := ~, start := 128053, stop := 128096 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "K", next := 128120, root := ~, start := 128109, stop := 128119 ), rec( content := " or ", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "K", next := 128136, root := ~, start := 128124, stop := 128135 ), rec( content := ".", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "Returns", next := 128147, root := ~, start := 128100, stop := 128146 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "A", next := 128183, root := ~, start := 128171, stop := 128182 ), rec( content := " and ", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ub", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "A", next := 128198, root := ~, start := 128188, stop := 128197 ), rec( content := " are dig\ raphs, then this operation returns\n ", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "K", next := 128256, root := ~, start := 128245, stop := 128255 ), rec( content := " if ", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ub", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "A", next := 128270, root := ~, start := 128260, stop := 128269 ), rec( content := " is a su\ bdigraph of ", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "A", next := 128302, root := ~, start := 128290, stop := 128301 ), rec( content := ", and ", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "K", next := 128320, root := ~, start := 128308, stop := 128319 ), rec( content := "\n if\ it is not. ", count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "P", next := 128343, root := ~, start := 128339, stop := 128342 ), rec( content := "\n\n \ A digraph ", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ub", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "A", next := 128369, root := ~, start := 128359, stop := 128368 ), rec( content := " is a ", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ubdigraph", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "E", next := 128392, root := ~, start := 128375, stop := 128391 ), rec( content := " of a di\ graph ", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "A", next := 128418, root := ~, start := 128406, stop := 128417 ), rec( content := " if\n \ ", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "s\ ub", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "A", next := 128436, root := ~, start := 128426, stop := 128435 ), rec( content := " and ", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "A", next := 128453, root := ~, start := 128441, stop := 128452 ), rec( content := " share t\ he same number of vertices, and the\n collection of edges of ", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "A", next := 128536, root := ~, start := 128524, stop := 128535 ), rec( content := " (includ\ ing repeats) contains the\n collection of edges of ", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ub", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "A", next := 128607, root := ~, start := 128597, stop := 128606 ), rec( content := " (includ\ ing repeats). ", count := [ 4, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "P", next := 128634, root := ~, start := 128630, stop := 128633 ), rec( content := "\n\n \ In other words, ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ub", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "A", next := 128666, root := ~, start := 128656, stop := 128665 ), rec( content := " is a su\ bdigraph of ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "A", next := 128698, root := ~, start := 128686, stop := 128697 ), rec( content := " if and \ only if\n ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphNrVertices(", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "su\ b", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := \ "Text", name := "A", next := 128749, root := ~, start := 128739, stop := 12874\ 8 ), rec( content := ") = DigraphNrVertices(", count := [ 4, 1, 1, 5 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "super", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "A", next := 1287\ 83, root := ~, start := 128771, stop := 128782 ), rec( content := ")", count := [ 4, 1, 1, 5 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "C", next := 128788, root := ~, start := 128718, stop := 128787 ), rec( content := ", and\n \ for each pair of vertices ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "C", next := 128832, root := ~, start := 128824, stop := 128831 ), rec( content := " and ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "C", next := 128845, root := ~, start := 128837, stop := 128844 ), rec( content := ", there \ are at least as many\n edges of the form ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i, j]", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "C", next := 128909, root := ~, start := 128896, stop := 128908 ), rec( content := " in ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "A", next := 128925, root := ~, start := 128913, stop := 128924 ), rec( content := " as ther\ e are in ", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ub", count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "A", next := 128952, root := ~, start := 128942, stop := 128951 ), rec( content := ".\n " , count := [ 4, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 4, 1, 1, 6 ], mathmode := "Text", name := "P", next := 128962, root := ~, start := 128958, stop := 128961 ), rec( content := "\n\n \ ", count := [ 4, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> g := Digraph([[2, 3], [1], [2, 3]]);\n\ngap> h := Digraph([[2, 3], [], [2]]);\n\ngap> IsSubdigraph(g, h);\ntrue\ngap> IsSubdigraph(h, g);\nf\ alse\ngap> IsSubdigraph(CompleteDigraph(4), CycleDigraph(4));\ntrue\ngap> IsSu\ bdigraph(CycleDigraph(4), ChainDigraph(4));\ntrue\ngap> g := Digraph([[2, 2], \ [1]]);\n\ngap> h := Digraph([\ [2], [1]]);\n\ngap> IsSubdigraph(g\ , h);\ntrue\ngap> IsSubdigraph(h, g);\nfalse", count := [ 4, 1, 1, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 4, 1, 1, 7 ], mathmode := "Text", name := "Example", next := 129570, root := ~, start := 128968, stop := 129569 ), rec( content := "\n ", count := [ 4, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 1, 3 ], mathmode := "Text", name := "Description", next := 129587, root := ~, start := 128150, stop := 129586 ) ], count := [ 4, 1, 1, 1 ], mathmode := "Text", name := "ManSection", next := 129601, root := ~, start := 128038, stop := 129600 ), rec( content := "\n\n ", count := [ 4, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "super, sub", Name := "IsUndirectedSpa\ nningTree" ), content := 0, count := [ 4, 1, 2, 2 ], mathmode := "Text", name := "Oper", next := 129677, root := ~, start := 129621, stop := 129676 ), rec( attributes := rec( Arg := "super, sub", Name := "IsUndirectedSpa\ nningForest" ), content := 0, count := [ 4, 1, 2, 4 ], mathmode := "Text", name := "Oper", next := 129738, root := ~, start := 129680, stop := 129737 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "K", next := 129761, root := ~, start := 129750, stop := 129760 ), rec( content := " or ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "K", next := 129777, root := ~, start := 129765, stop := 129776 ), rec( content := ".", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "Returns", next := 129788, root := ~, start := 129741, stop := 129787 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ operation ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sUndirectedSpanningTree", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "C", next := 129854, root := ~, start := 129823, stop := 129853 ), rec( content := " returns\ ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "K", next := 129874, root := ~, start := 129863, stop := 129873 ), rec( content := " if the\\ n digraph ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ub", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "A", next := 129904, root := ~, start := 129894, stop := 129903 ), rec( content := " is an u\ ndirected spanning tree of the digraph\n ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "A", next := 129967, root := ~, start := 129955, stop := 129966 ), rec( content := ", and th\ e operation ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sUndirectedSpanningForest", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "C", next := 130020, root := ~, start := 129987, stop := 130019 ), rec( content := " returns\ \n ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "K", next := 130044, root := ~, start := 130033, stop := 130043 ), rec( content := " if the \ digraph ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ub", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "A", next := 130070, root := ~, start := 130060, stop := 130069 ), rec( content := " is an u\ ndirected spanning forest of\n the digraph ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "A", next := 130135, root := ~, start := 130123, stop := 130134 ), rec( content := ". ", count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "P", next := 130141, root := ~, start := 130137, stop := 130140 ), rec( content := "\n\n \ An ", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ndirected spanning tree", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "E", next := 130181, root := ~, start := 130150, stop := 130180 ), rec( content := " of a di\ graph ", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "A", next := 130207, root := ~, start := 130195, stop := 130206 ), rec( content := " is a su\ bdigraph\n of ", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "A", next := 130243, root := ~, start := 130231, stop := 130242 ), rec( content := " that is\ an undirected tree (see ", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsSubdi\ graph" ), content := 0, count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "Ref", next := 130303, root := ~, start := 130276, stop := 130302 ), rec( content := "\n an\ d ", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsUndir\ ectedTree" ), content := 0, count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "Ref", next := 130343, root := ~, start := 130312, stop := 130342 ), rec( content := "). Note \ that a digraph whose ", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Maximal\ SymmetricSubdigraph" ), content := 0, count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "Ref", next := 130418, root := ~, start := 130372, stop := 130417 ), rec( content := " is not \ connected has no undirected\n spanning trees (see ", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsConne\ ctedDigraph" ), content := 0, count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "Ref", next := 130510, root := ~, start := 130478, stop := 130509 ), rec( content := "). ", count := [ 4, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "P", next := 130517, root := ~, start := 130513, stop := 130516 ), rec( content := "\n\n \ An ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ndirected spanning forest", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "E", next := 130559, root := ~, start := 130526, stop := 130558 ), rec( content := " of a di\ graph ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "A", next := 130585, root := ~, start := 130573, stop := 130584 ), rec( content := " is a\n \ subdigraph of ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "A", next := 130621, root := ~, start := 130609, stop := 130620 ), rec( content := " that is\ an undirected forest (see ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsSubdi\ graph" ), content := 0, count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "Ref", next := 130688, root := ~, start := 130656, stop := 130687 ), rec( content := " and ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsUndir\ ectedForest" ), content := 0, count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "Ref", next := 130725, root := ~, start := 130693, stop := 130724 ), rec( content := "), and i\ s not\n contained in any larger such subdigraph of ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "A", next := 130798, root := ~, start := 130786, stop := 130797 ), rec( content := ". Equiv\ alently, an\n undirected spanning forest is a subdigraph of ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "A", next := 130880, root := ~, start := 130868, stop := 130879 ), rec( content := " whose c\ onnected\n components coincide with those of the ", count := [ 4, 1, 2, 7 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Maximal\ SymmetricSubdigraph" ), content := 0, count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "Ref", next := 130985, root := ~, start := 130939, stop := 130984 ), rec( content := " of ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ uper", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "A", next := 131001, root := ~, start := 130989, stop := 131000 ), rec( content := " (see ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ ConnectedComponents" ), content := 0, count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "Ref", next := 131053, root := ~, start := 131007, stop := 131052 ), rec( content := "). ", count := [ 4, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 4, 1, 2, 8 ], mathmode := "Text", name := "P", next := 131060, root := ~, start := 131056, stop := 131059 ), rec( content := "\n\n \ Note that an undirected spanning tree is an undirected spanning forest that\n \ is connected.\n\n ", count := [ 4, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(4);\n\n\ gap> tree := Digraph([[3], [4], [1, 4], [2, 3]]);\n\ngap> IsSubdigraph(D, tree) and IsUndirectedTree(tree);\ntru\ e\ngap> IsUndirectedSpanningTree(D, tree);\ntrue\ngap> forest := EmptyDigraph(\ 4);\n\ngap> IsSubdigraph(D, forest) a\ nd IsUndirectedForest(forest);\ntrue\ngap> IsUndirectedSpanningForest(D, fores\ t);\nfalse\ngap> IsSubdigraph(tree, forest);\ntrue\ngap> D := DigraphDisjointU\ nion(CycleDigraph(2), CycleDigraph(2));\n\ngap> IsUndirectedTree(D);\nfalse\ngap> IsUndirectedForest(D) and IsUn\ directedSpanningForest(D, D);\ntrue", count := [ 4, 1, 2, 9 ], name := "PCDATA\ ", root := ~ ) ], count := [ 4, 1, 2, 9 ], mathmode := "Text", name := "Example", next := 131912, root := ~, start := 131165, stop := 131911 ), rec( content := "\n ", count := [ 4, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 2, 5 ], mathmode := "Text", name := "Description", next := 131929, root := ~, start := 129791, stop := 131928 ) ], count := [ 4, 1, 2, 1 ], mathmode := "Text", name := "ManSection", next := 131943, root := ~, start := 129606, stop := 131942 ), rec( content := "\n\n ", count := [ 4, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 1, 0, 1 ], mathmode := "Text", name := "Section", next := 131957, root := ~, start := 126551, stop := 131956 ) , rec( content := "\n", count := [ 4, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 4, 0, 0, 1 ], mathmode := "Text", name := "Chapter", next := 131968, root := ~, start := 126492, stop := 131967 ), rec( content := "\n ", count := [ 4, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " operators/hashs ", count := [ 4, 1, 2, 10 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 4, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Attributes and operations" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Attributes and operations\ ", count := [ 5, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 132084, root := ~, start := 132040, stop := 132083 ), rec( content := "\n ", count := [ 5, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Vertices and edge\ s", count := [ 5, 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 132133, root := ~, start := 132096, stop := 132132 ), rec( content := "\n ", count := [ 5, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphVertices\ " ), content := 0, count := [ 5, 1, 1, 2 ], mathmode := "Text", name := "Attr", next := 132197, root := ~, start := 132153, stop := 132196 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ integers.", count := [ 5, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 1, 3 ], mathmode := "Text", name := "Returns", next := 132238, root := ~, start := 132200, stop := 132237 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns the vertices of the digraph ", count := [ 5, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 1, 3 ], mathmode := "Text", name := "A", next := 132309, root := ~, start := 132295, stop := 132308 ), rec( content := ". ", count := [ 5, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 1, 4 ], mathmode := "Text", name := "P", next := 132315, root := ~, start := 132311, stop := 132314 ), rec( content := "\n\n \ Note that the vertices of a digraph are always a range of\n positive intege\ rs from ", count := [ 5, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 5, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 1, 4 ], mathmode := "Text", name := "C", next := 132414, root := ~, start := 132406, stop := 132413 ), rec( content := " to the \ number of vertices of the graph.\n ", count := [ 5, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([\"a\", \"b\", \"c\"],\n> [\"a\", \"b\", \ \"b\"],\n> [\"b\", \"c\", \"a\"]);\n\ngap> DigraphVertices(gr);\n[ 1 .. 3 ]\ngap> gr := Digraph\ ([1, 2, 3, 4, 5, 7],\n> [1, 2, 2, 4, 4],\n> \ [2, 7, 5, 3, 7]);\n\ngap> DigraphV\ ertices(gr);\n[ 1 .. 6 ]\ngap> DigraphVertices(RandomDigraph(100));\n[ 1 .. 10\ 0 ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphVertices(D);\n[ 1 .. 3 ]\n", count := [ 5, 1, 1, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 1, 5 ], mathmode := "Text", name := "Example", next := 133055, root := ~, start := 132459, stop := 133054 ), rec( content := "\n ", count := [ 5, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 1, 3 ], mathmode := "Text", name := "Description", next := 133072, root := ~, start := 132241, stop := 133071 ) ], count := [ 5, 1, 1, 1 ], mathmode := "Text", name := "ManSection", next := 133086, root := ~, start := 132138, stop := 133085 ), rec( content := "\n\n ", count := [ 5, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphNrVertic\ es" ), content := 0, count := [ 5, 1, 2, 2 ], mathmode := "Text", name := "Attr", next := 133153, root := ~, start := 133107, stop := 133152 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r.", count := [ 5, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 2, 3 ], mathmode := "Text", name := "Returns", next := 133186, root := ~, start := 133156, stop := 133185 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns the number of vertices of the digraph ", count := [ 5, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 2, 3 ], mathmode := "Text", name := "A", next := 133267, root := ~, start := 133253, stop := 133266 ), rec( content := ". ", count := [ 5, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 2, 4 ], mathmode := "Text", name := "P", next := 133273, root := ~, start := 133269, stop := 133272 ), rec( content := "\n\n \ ", count := [ 5, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([\"a\", \"b\", \"c\"],\n> [\"a\", \"b\", \ \"b\"],\n> [\"b\", \"c\", \"a\"]);\n\ngap> DigraphNrVertices(gr);\n3\ngap> gr := Digraph([1, 2,\ 3, 4, 5, 7],\n> [1, 2, 2, 4, 4],\n> [2, 7, \ 5, 3, 7]);\n\ngap> DigraphNrVertic\ es(gr);\n6\ngap> DigraphNrVertices(RandomDigraph(100));\n100\ngap> D := CycleD\ igraph(IsMutableDigraph, 3);\n\ngap>\ DigraphNrVertices(D);\n3\n", count := [ 5, 1, 2, 5 ], name := "PCDATA", root := ~ ) ], count := [ 5, 1, 2, 5 ], mathmode := "Text", name := "Example", next := 133847, root := ~, start := 133279, stop := 133846 ), rec( content := "\n ", count := [ 5, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 2, 3 ], mathmode := "Text", name := "Description", next := 133864, root := ~, start := 133189, stop := 133863 ) ], count := [ 5, 1, 2, 1 ], mathmode := "Text", name := "ManSection", next := 133878, root := ~, start := 133092, stop := 133877 ), rec( content := "\n\n ", count := [ 5, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphEdges" ) , content := 0, count := [ 5, 1, 3, 2 ], mathmode := "Text", name := "Attr", next := 133940, root := ~, start := 133899, stop := 133939 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ lists.", count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "Returns", next := 133978, root := ~, start := 133943, stop := 133977 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEdges", count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "C", next := 134018, root := ~, start := 133999, stop := 134017 ), rec( content := " returns\ a list of edges of the digraph ", count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "A", next := 134072, root := ~, start := 134058, stop := 134071 ), rec( content := ",\n w\ here each edge is a pair of elements of ", count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Vertices" ), content := 0, count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "Ref", next := 134148, root := ~, start := 134119, stop := 134147 ), rec( content := " of\n \ the form ", count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ source,range]", count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "C", next := 134186, root := ~, start := 134165, stop := 134185 ), rec( content := ".\n " , count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "P", next := 134196, root := ~, start := 134192, stop := 134195 ), rec( content := "\n\n \ The entries of ", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEdges(", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "C", next := 134237, root := ~, start := 134217, stop := 134236 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "A", next := 134251, root := ~, start := 134237, stop := 134250 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "C", next := 134259, root := ~, start := 134251, stop := 134258 ), rec( content := " are in \ one-to-one\n corresponence with the edges of ", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "A", next := 134328, root := ~, start := 134314, stop := 134327 ), rec( content := ". Hence\ \n ", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEdges(", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "C", next := 134361, root := ~, start := 134341, stop := 134360 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "A", next := 134375, root := ~, start := 134361, stop := 134374 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "C", next := 134383, root := ~, start := 134375, stop := 134382 ), rec( content := " is dupl\ icate-free if and only if\n ", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "A", next := 134435, root := ~, start := 134421, stop := 134434 ), rec( content := " contain\ s no multiple edges. ", count := [ 5, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 3, 5 ], mathmode := "Text", name := "P", next := 134468, root := ~, start := 134464, stop := 134467 ), rec( content := "\n\n \ The entries of ", count := [ 5, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEdges", count := [ 5, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 5 ], mathmode := "Text", name := "C", next := 134508, root := ~, start := 134489, stop := 134507 ), rec( content := " are gua\ ranteed to be sorted by their\n first component (i.e. by the source of each\ edge), but they are not\n necessarily then sorted by the second component.\ \n ", count := [ 5, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := DigraphFromDiSparse6String(\".DaXbOe?EAM@G~\");\n\ngap> edges := ShallowCopy(DigraphEdges(gr))\ ;; Sort(edges);\ngap> edges;\n[ [ 1, 1 ], [ 1, 3 ], [ 1, 3 ], [ 1, 4 ], [ 1, 5\ ], [ 2, 1 ], \n [ 2, 2 ], [ 2, 3 ], [ 2, 5 ], [ 3, 2 ], [ 3, 4 ], [ 3, 5 ], \ \n [ 4, 2 ], [ 4, 4 ], [ 4, 5 ], [ 5, 1 ] ]\ngap> D := CycleDigraph(IsMutable\ Digraph, 3);\n\ngap> DigraphEdges(D)\ ;\n[ [ 1, 2 ], [ 2, 3 ], [ 3, 1 ] ]\n", count := [ 5, 1, 3, 6 ], name := "PCDA\ TA", root := ~ ) ], count := [ 5, 1, 3, 6 ], mathmode := "Text", name := "Example", next := 135198, root := ~, start := 134675, stop := 135197 ), rec( content := "\n ", count := [ 5, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 3, 3 ], mathmode := "Text", name := "Description", next := 135215, root := ~, start := 133981, stop := 135214 ) ], count := [ 5, 1, 3, 1 ], mathmode := "Text", name := "ManSection", next := 135229, root := ~, start := 133884, stop := 135228 ), rec( content := "\n\n ", count := [ 5, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphNrEdges"\ ), content := 0, count := [ 5, 1, 4, 2 ], mathmode := "Text", name := "Attr", next := 135293, root := ~, start := 135250, stop := 135292 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r.", count := [ 5, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 4, 3 ], mathmode := "Text", name := "Returns", next := 135326, root := ~, start := 135296, stop := 135325 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the number of edges of the digraph ", count := [ 5, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 4, 3 ], mathmode := "Text", name := "A", next := 135418, root := ~, start := 135404, stop := 135417 ), rec( content := ".\n " , count := [ 5, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([\n> [1, 3, 4, 5], [1, 2, 3, 5], [2, 4, 5], [2, 4, 5], [1]\ ]);;\ngap> DigraphNrEdges(gr);\n15\ngap> gr := Digraph([\"a\", \"b\", \"c\"],\ \n> [\"a\", \"b\", \"b\"],\n> [\"b\", \"a\",\ \"a\"]);\n\ngap> DigraphNrEd\ ges(gr);\n3\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphNrEdges(D);\n3\n", count := [ 5, 1, 4, 4 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 4, 4 ], mathmode := "Text", name := "Example", next := 135865, root := ~, start := 135424, stop := 135864 ), rec( content := "\n ", count := [ 5, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 4, 3 ], mathmode := "Text", name := "Description", next := 135882, root := ~, start := 135329, stop := 135881 ) ], count := [ 5, 1, 4, 1 ], mathmode := "Text", name := "ManSection", next := 135896, root := ~, start := 135235, stop := 135895 ), rec( content := "\n\n ", count := [ 5, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphSinks" ) , content := 0, count := [ 5, 1, 5, 2 ], mathmode := "Text", name := "Attr", next := 135958, root := ~, start := 135917, stop := 135957 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ vertices.", count := [ 5, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 5, 3 ], mathmode := "Text", name := "Returns", next := 135999, root := ~, start := 135961, stop := 135998 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns a list of the sinks of the digraph\n ", count := [ 5, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 5, 3 ], mathmode := "Text", name := "A", next := 136095, root := ~, start := 136081, stop := 136094 ), rec( content := ".\n A\ sink of a digraph is a vertex with out-degree zero.\n See ", count := [ 5, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "OutDegr\ eeOfVertex" ), content := 0, count := [ 5, 1, 5, 3 ], mathmode := "Text", name := "Ref", next := 136194, root := ~, start := 136163, stop := 136193 ), rec( content := ".\n " , count := [ 5, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[3, 5, 2, 2], [3], [], [5, 2, 5, 3], []]);\n\ngap> DigraphSinks(gr);\n[ 3, 5 ]\ngap> D\ := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphSinks(D);\n[ ]\n", count := [ 5, 1, 5, 4 ], name := "PCDATA\ ", root := ~ ) ], count := [ 5, 1, 5, 4 ], mathmode := "Text", name := "Example", next := 136492, root := ~, start := 136200, stop := 136491 ), rec( content := "\n ", count := [ 5, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 5, 3 ], mathmode := "Text", name := "Description", next := 136509, root := ~, start := 136002, stop := 136508 ) ], count := [ 5, 1, 5, 1 ], mathmode := "Text", name := "ManSection", next := 136523, root := ~, start := 135902, stop := 136522 ), rec( content := "\n\n ", count := [ 5, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphSources"\ ), content := 0, count := [ 5, 1, 6, 2 ], mathmode := "Text", name := "Attr", next := 136587, root := ~, start := 136544, stop := 136586 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ vertices.", count := [ 5, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 6, 3 ], mathmode := "Text", name := "Returns", next := 136628, root := ~, start := 136590, stop := 136627 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns an immutable list of the sources of the digraph\n ", count := [ 5, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 6, 3 ], mathmode := "Text", name := "A", next := 136737, root := ~, start := 136723, stop := 136736 ), rec( content := ".\n A\ source of a digraph is a vertex with in-degree zero.\n See ", count := [ 5, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "InDegre\ eOfVertex" ), content := 0, count := [ 5, 1, 6, 3 ], mathmode := "Text", name := "Ref", next := 136836, root := ~, start := 136806, stop := 136835 ), rec( content := ".\n " , count := [ 5, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[3, 5, 2, 2], [3], [], [5, 2, 5, 3], []]);\n\ngap> DigraphSources(gr);\n[ 1, 4 ]\ngap>\ D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphSources(D);\n[ ]\n", count := [ 5, 1, 6, 4 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 6, 4 ], mathmode := "Text", name := "Example", next := 137138, root := ~, start := 136842, stop := 137137 ), rec( content := "\n ", count := [ 5, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 6, 3 ], mathmode := "Text", name := "Description", next := 137155, root := ~, start := 136631, stop := 137154 ) ], count := [ 5, 1, 6, 1 ], mathmode := "Text", name := "ManSection", next := 137169, root := ~, start := 136529, stop := 137168 ), rec( content := "\n\n ", count := [ 5, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphTopologi\ calSort" ), content := 0, count := [ 5, 1, 7, 2 ], mathmode := "Text", name := "Attr", next := 137241, root := ~, start := 137190, stop := 137240 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ positive integers, or ", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "K", next := 137296, root := ~, start := 137285, stop := 137295 ), rec( content := ".", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "Returns", next := 137307, root := ~, start := 137244, stop := 137306 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "A", next := 137345, root := ~, start := 137331, stop := 137344 ), rec( content := " is a di\ graph whose only directed cycles are loops, then\n ", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphTopologicalSort", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "C", next := 137435, root := ~, start := 137406, stop := 137434 ), rec( content := " returns\ the vertices of ", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "A", next := 137474, root := ~, start := 137460, stop := 137473 ), rec( content := " ordered\ \n so that every edge's source appears no earlier in the list than its rang\ e.\n If the digraph ", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "A", next := 137595, root := ~, start := 137581, stop := 137594 ), rec( content := " contain\ s directed cycles of length greater\n than ", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "M", next := 137656, root := ~, start := 137648, stop := 137655 ), rec( content := ", then t\ his operation returns ", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "K", next := 137697, root := ~, start := 137686, stop := 137696 ), rec( content := ".\n " , count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 7, 4 ], mathmode := "Text", name := "P", next := 137707, root := ~, start := 137703, stop := 137706 ), rec( content := "\n\n \ See section ", count := [ 5, 1, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 5, 1, 7, 4 ], mathmode := "Text", name := "Ref", next := 137769, root := ~, start := 137725, stop := 137768 ), rec( content := " for the\ definition\n of a directed cycle, and the definition of a loop.\n\n ", count := [ 5, 1, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "P", next := 137853, root := ~, start := 137849, stop := 137852 ), rec( content := "\n\n \ The method used for this attribute has complexity ", count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m+n)", count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "M", next := 137922, root := ~, start := 137909, stop := 137921 ), rec( content := " where\n\ ", count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "M", next := 137941, root := ~, start := 137933, stop := 137940 ), rec( content := " is the \ number of edges (counting multiple edges as one) and\n ", count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "M", next := 138014, root := ~, start := 138006, stop := 138013 ), rec( content := " is the \ number of vertices in the digraph. ", count := [ 5, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 7, 6 ], mathmode := "Text", name := "P", next := 138061, root := ~, start := 138057, stop := 138060 ), rec( content := "\n ", count := [ 5, 1, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\n> [2, 3], [], [4, 6], [5], [], [7, 8, 9], [], [], []]);\ \n\ngap> DigraphTopologicalSort(D)\ ;\n[ 2, 5, 4, 7, 8, 9, 6, 3, 1 ]\ngap> D := Digraph(IsMutableDigraph, [[2, 3],\ [3], [4], []]);\n\ngap> DigraphTopo\ logicalSort(D);\n[ 4, 3, 2, 1 ]\n", count := [ 5, 1, 7, 7 ], name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 7 ], mathmode := "Text", name := "Example", next := 138432, root := ~, start := 138066, stop := 138431 ), rec( content := "\n ", count := [ 5, 1, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 7, 3 ], mathmode := "Text", name := "Description", next := 138449, root := ~, start := 137310, stop := 138448 ) ], count := [ 5, 1, 7, 1 ], mathmode := "Text", name := "ManSection", next := 138463, root := ~, start := 137175, stop := 138462 ), rec( content := "\n\n ", count := [ 5, 1, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, i", Name := "DigraphVertexLa\ bel" ), content := 0, count := [ 5, 1, 8, 2 ], mathmode := "Text", name := "Oper", next := 138536, root := ~, start := 138484, stop := 138535 ), rec( attributes := rec( Arg := "digraph, i, obj" , Name := "SetDigraphVerte\ xLabel" ), content := 0, count := [ 5, 1, 8, 4 ], mathmode := "Text", name := "Oper", next := 138598, root := ~, start := 138539, stop := 138597 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "A", next := 138636, root := ~, start := 138622, stop := 138635 ), rec( content := " is a di\ graph, then the first operation returns the label\n of the vertex ", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "A", next := 138720, root := ~, start := 138712, stop := 138719 ), rec( content := ". The se\ cond operation can be used to set the label\n of the vertex ", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "A", next := 138798, root := ~, start := 138790, stop := 138797 ), rec( content := " in ", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "A", next := 138816, root := ~, start := 138802, stop := 138815 ), rec( content := " to the \ arbitrary ", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " object\\ n ", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ bj", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "A", next := 138861, root := ~, start := 138851, stop := 138860 ), rec( content := ". ", count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 8, 6 ], mathmode := "Text", name := "P", next := 138868, root := ~, start := 138864, stop := 138867 ), rec( content := "\n\n \ The label of a vertex can be changed an arbitrary number of times. If no\n \ label has been set for the vertex ", count := [ 5, 1, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 6 ], mathmode := "Text", name := "A", next := 138993, root := ~, start := 138985, stop := 138992 ), rec( content := ", then t\ he default value is\n ", count := [ 5, 1, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 6 ], mathmode := "Text", name := "A", next := 139033, root := ~, start := 139025, stop := 139032 ), rec( content := ". ", count := [ 5, 1, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 8, 7 ], mathmode := "Text", name := "P", next := 139039, root := ~, start := 139035, stop := 139038 ), rec( content := "\n\n \ If ", count := [ 5, 1, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 7 ], mathmode := "Text", name := "A", next := 139062, root := ~, start := 139048, stop := 139061 ), rec( content := " is a di\ graph created from a record with a component\n ", count := [ 5, 1, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertices", count := [ 5, 1, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 7 ], mathmode := "Text", name := "C", next := 139134, root := ~, start := 139119, stop := 139133 ), rec( content := ", then t\ he labels of the vertices are set to the value of\n this component.", count := [ 5, 1, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 8, 8 ], mathmode := "Text", name := "P", next := 139215, root := ~, start := 139211, stop := 139214 ), rec( content := "\n\n \ Induced subdigraphs, and some other operations which create new digraphs from\ \n old ones, inherit their labels from their parents.\n\n ", count := [ 5, 1, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDigraph6String(\"&DHUEe_\");\n\ngap> DigraphVertexLabel(D, 3);\n3\ngap> D := Digraph([\"a\ \", \"b\", \"c\"], [], []);\n\ngap> D\ igraphVertexLabel(D, 2);\n\"b\"\ngap> SetDigraphVertexLabel(D, 2, \"d\");\ngap\ > DigraphVertexLabel(D, 2);\n\"d\"\ngap> D := InducedSubdigraph(D, [1, 2]);\n<\ immutable empty digraph with 2 vertices>\ngap> DigraphVertexLabel(D, 2);\n\"d\ \"\ngap> D := Digraph(IsMutableDigraph, [\"e\", \"f\", \"g\"], [], []);\n\ngap> DigraphVertexLabel(D, 1);\n\"e\"\ngap\ > SetDigraphVertexLabel(D, 1, \"h\");\ngap> DigraphVertexLabel(D, 1);\n\"h\"\n\ gap> InducedSubdigraph(D, [1, 2]);\n\ng\ ap> DigraphVertexLabel(D, 1);\n\"h\"\n", count := [ 5, 1, 8, 9 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 8, 9 ], mathmode := "Text", name := "Example", next := 140151, root := ~, start := 139359, stop := 140150 ), rec( content := "\n ", count := [ 5, 1, 8, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 8, 5 ], mathmode := "Text", name := "Description", next := 140168, root := ~, start := 138601, stop := 140167 ) ], count := [ 5, 1, 8, 1 ], mathmode := "Text", name := "ManSection", next := 140182, root := ~, start := 138469, stop := 140181 ), rec( content := "\n\n ", count := [ 5, 1, 8, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphVertexLa\ bels" ), content := 0, count := [ 5, 1, 9, 2 ], mathmode := "Text", name := "Oper", next := 140251, root := ~, start := 140203, stop := 140250 ), rec( attributes := rec( Arg := "digraph, list", Name := "SetDigraphVerte\ xLabels" ), content := 0, count := [ 5, 1, 9, 4 ], mathmode := "Text", name := "Oper", next := 140311, root := ~, start := 140254, stop := 140310 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "A", next := 140349, root := ~, start := 140335, stop := 140348 ), rec( content := " is a di\ graph, then ", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphVertexLabels", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "C", next := 140395, root := ~, start := 140369, stop := 140394 ), rec( content := " returns\ a\n copy of the labels of the vertices in ", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "A", next := 140462, root := ~, start := 140448, stop := 140461 ), rec( content := ".\n " , count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ etDigraphVertexLabels", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "C", next := 140497, root := ~, start := 140468, stop := 140496 ), rec( content := " can be \ used to set the labels of the vertices\n in ", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "A", next := 140565, root := ~, start := 140551, stop := 140564 ), rec( content := " to the \ list of\n arbitrary ", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " objects\ ", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "A", next := 140620, root := ~, start := 140609, stop := 140619 ), rec( content := ". ", count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 9, 6 ], mathmode := "Text", name := "P", next := 140626, root := ~, start := 140622, stop := 140625 ), rec( content := "\n\n \ The label of a vertex can be changed an arbitrary number of times. If no\n \ label has been set for the vertex ", count := [ 5, 1, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 6 ], mathmode := "Text", name := "A", next := 140751, root := ~, start := 140743, stop := 140750 ), rec( content := ", then t\ he default value is\n ", count := [ 5, 1, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 6 ], mathmode := "Text", name := "A", next := 140791, root := ~, start := 140783, stop := 140790 ), rec( content := ". ", count := [ 5, 1, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 9, 7 ], mathmode := "Text", name := "P", next := 140797, root := ~, start := 140793, stop := 140796 ), rec( content := "\n\n \ If ", count := [ 5, 1, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 7 ], mathmode := "Text", name := "A", next := 140820, root := ~, start := 140806, stop := 140819 ), rec( content := " is a di\ graph created from a record with a component\n ", count := [ 5, 1, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertices", count := [ 5, 1, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 7 ], mathmode := "Text", name := "C", next := 140892, root := ~, start := 140877, stop := 140891 ), rec( content := ", then t\ he labels of the vertices are set to the value of\n this component.", count := [ 5, 1, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 9, 8 ], mathmode := "Text", name := "P", next := 140973, root := ~, start := 140969, stop := 140972 ), rec( content := "\n\n \ Induced subdigraphs, and other operations which create new digraphs from\n \ old ones, inherit their labels from their parents.\n\n ", count := [ 5, 1, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDigraph6String(\"&DHUEe_\");\n\ngap> DigraphVertexLabels(D);\n[ 1 .. 5 ]\ngap> D := Digra\ ph([\"a\", \"b\", \"c\"], [], []);\n\ \ngap> DigraphVertexLabels(D);\n[ \"a\", \"b\", \"c\" ]\ngap> SetDigraphVertex\ Label(D, 2, \"d\");\ngap> DigraphVertexLabels(D);\n[ \"a\", \"d\", \"c\" ]\nga\ p> D := InducedSubdigraph(D, [1, 3]);\n\ngap> DigraphVertexLabels(D);\n[ \"a\", \"c\" ]\ngap> D := Digraph(IsMutabl\ eDigraph, [\"e\", \"f\", \"g\"], [], []);\n\ngap> SetDigraphVertexLabels(D, [\"h\", \"i\", \"j\"]);\ngap> DigraphVert\ exLabels(D);\n[ \"h\", \"i\", \"j\" ]\ngap> InducedSubdigraph(D, [1, 3]);\n\ngap> DigraphVertexLabels(D);\n[ \"h\", \ \"j\" ]\n", count := [ 5, 1, 9, 9 ], name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 9 ], mathmode := "Text", name := "Example", next := 141936, root := ~, start := 141112, stop := 141935 ), rec( content := "\n ", count := [ 5, 1, 9, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 9, 5 ], mathmode := "Text", name := "Description", next := 141953, root := ~, start := 140314, stop := 141952 ) ], count := [ 5, 1, 9, 1 ], mathmode := "Text", name := "ManSection", next := 141967, root := ~, start := 140188, stop := 141966 ), rec( content := "\n\n ", count := [ 5, 1, 9, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, i, j", Name := "DigraphEdgeLabe\ l" ), content := 0, count := [ 5, 1, 10, 2 ], mathmode := "Text", name := "Oper", next := 142041, root := ~, start := 141988, stop := 142040 ), rec( attributes := rec( Arg := "digraph, i, j, o\ bj", Name := "SetDigraphEdgeLabel" ), content := 0, count := [ 5, 1, 10, 4 ], mathmode := "Text", name := "Oper", next := 142105, root := ~, start := 142044, stop := 142104 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "A", next := 142143, root := ~, start := 142129, stop := 142142 ), rec( content := " is a di\ graph without multiple edges, then the first\n operation returns the label \ of the edge from vertex ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "A", next := 142260, root := ~, start := 142252, stop := 142259 ), rec( content := " to vert\ ex\n ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "A", next := 142283, root := ~, start := 142275, stop := 142282 ), rec( content := ". The s\ econd operation can be used to set the label of the edge\n between vertex " , count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "A", next := 142375, root := ~, start := 142367, stop := 142374 ), rec( content := " and ver\ tex ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "A", next := 142395, root := ~, start := 142387, stop := 142394 ), rec( content := " to the \ arbitrary ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " object\\ n ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ bj", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "A", next := 142440, root := ~, start := 142430, stop := 142439 ), rec( content := ". ", count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 10, 6 ], mathmode := "Text", name := "P", next := 142446, root := ~, start := 142442, stop := 142445 ), rec( content := "\n\n \ The label of an edge can be changed an arbitrary number of times. If no\n l\ abel has been set for the edge, then the default value is ", count := [ 5, 1, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 5, 1, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 10, 6 ], mathmode := "Text", name := "A", next := 142595, root := ~, start := 142587, stop := 142594 ), rec( content := ". ", count := [ 5, 1, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 10, 7 ], mathmode := "Text", name := "P", next := 142601, root := ~, start := 142597, stop := 142600 ), rec( content := "\n\n \ Induced subdigraphs, and some other operations which create new digraphs from\ \n old ones, inherit their edge labels from their parents.\n\n See also \ ", count := [ 5, 1, 10, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( Oper := "Digraph\ EdgeLabels" ), content := 0, count := [ 5, 1, 10, 7 ], mathmode := "Text", name := "Ref", next := 142790, root := ~, start := 142759, stop := 142789 ), rec( content := ".\n\n \ ", count := [ 5, 1, 10, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDigraph6String(\"&DHUEe_\");\n\ngap> DigraphEdgeLabel(D, 3, 1);\n1\ngap> SetDigraphEdgeLa\ bel(D, 2, 5, [42]);\ngap> DigraphEdgeLabel(D, 2, 5);\n[ 42 ]\ngap> D := Induce\ dSubdigraph(D, [2, 5]);\n\ngap> Di\ graphEdgeLabel(D, 1, 2);\n[ 42 ]\ngap> D := ChainDigraph(IsMutableDigraph, 5);\ \n\ngap> DigraphEdgeLabel(D, 2, 3);\ \n1\ngap> SetDigraphEdgeLabel(D, 4, 5, [1729]);\ngap> DigraphEdgeLabel(D, 4, 5\ );\n[ 1729 ]\ngap> InducedSubdigraph(D, [4, 5]);\n\ngap> DigraphEdgeLabel(D, 1, 2);\n[ 1729 ]\n", count := [ 5, 1, 10, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 10, 8 ], mathmode := "Text", name := "Example", next := 143485, root := ~, start := 142797, stop := 143484 ), rec( content := "\n ", count := [ 5, 1, 10, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 10, 5 ], mathmode := "Text", name := "Description", next := 143502, root := ~, start := 142108, stop := 143501 ) ], count := [ 5, 1, 10, 1 ], mathmode := "Text", name := "ManSection", next := 143516, root := ~, start := 141973, stop := 143515 ), rec( content := "\n\n ", count := [ 5, 1, 10, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphEdgeLabe\ ls" ), content := 0, count := [ 5, 1, 11, 2 ], mathmode := "Text", name := "Oper", next := 143583, root := ~, start := 143537, stop := 143582 ), rec( attributes := rec( Arg := "digraph, labels" , Label := "for a digraph \ and a list of lists", Name := "SetDigraphEdgeLabels" ), content := 0, count := [ 5, 1, 11, 4 ], mathmode := "Text", name := "Oper", next := 143689, root := ~, start := 143586, stop := 143688 ), rec( attributes := rec( Arg := "digraph, func", Label := "for a digraph \ and a function", Name := "SetDigraphEdgeLabels" ), content := 0, count := [ 5, 1, 11, 6 ], mathmode := "Text", name := "Oper", next := 143788, root := ~, start := 143692, stop := 143787 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "A", next := 143826, root := ~, start := 143812, stop := 143825 ), rec( content := " is a di\ graph without multiple edges, then\n ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEdgeLabels", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 143897, root := ~, start := 143873, stop := 143896 ), rec( content := " returns\ a copy of the labels of the edges\n in ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "A", next := 143961, root := ~, start := 143947, stop := 143960 ), rec( content := " as a li\ st of lists ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ abels", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 143994, root := ~, start := 143981, stop := 143993 ), rec( content := " such th\ at\n ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ abels[i][j]", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144028, root := ~, start := 144009, stop := 144027 ), rec( content := " is the \ label on the edge from vertex ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144074, root := ~, start := 144066, stop := 144073 ), rec( content := "\n to\ vertex ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ utNeighbours(digraph)[i][j]", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144124, root := ~, start := 144089, stop := 144123 ), rec( content := ".\n\n \ ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ etDigraphEdgeLabels", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144158, root := ~, start := 144131, stop := 144157 ), rec( content := " can be \ used to set the labels of the edges in\n ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "A", next := 144223, root := ~, start := 144209, stop := 144222 ), rec( content := " without\ multiple edges to the list ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ abels", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "A", next := 144272, root := ~, start := 144259, stop := 144271 ), rec( content := " of list\ s of\n arbitrary ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " objects\ such that ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist[i][j]", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144340, root := ~, start := 144323, stop := 144339 ), rec( content := " is the \ label on the edge\n from vertex ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144390, root := ~, start := 144382, stop := 144389 ), rec( content := " to the \ vertex ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ utNeighbours(digraph>[i][j]", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144440, root := ~, start := 144405, stop := 144439 ), rec( content := ".\n\n \ Alternatively ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ etDigraphEdgeLabels", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144488, root := ~, start := 144461, stop := 144487 ), rec( content := " can be \ called with binary function\n ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ unc", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "A", next := 144539, root := ~, start := 144528, stop := 144538 ), rec( content := " that as\ its second argument that when passed two vertices ", count := [ 5, 1, 11, 7 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144606, root := ~, start := 144598, stop := 144605 ), rec( content := "\n an\ d ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144623, root := ~, start := 144615, stop := 144622 ), rec( content := " returns\ the label for the edge between vertex ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144678, root := ~, start := 144670, stop := 144677 ), rec( content := " and ver\ tex\n ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "C", next := 144702, root := ~, start := 144694, stop := 144701 ), rec( content := ". ", count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 11, 8 ], mathmode := "Text", name := "P", next := 144708, root := ~, start := 144704, stop := 144707 ), rec( content := "\n\n \ The label of an edge can be changed an arbitrary number of times. If no\n l\ abel has been set for an edge, then the default value is ", count := [ 5, 1, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 5, 1, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 8 ], mathmode := "Text", name := "C", next := 144856, root := ~, start := 144848, stop := 144855 ), rec( content := ". ", count := [ 5, 1, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 11, 9 ], mathmode := "Text", name := "P", next := 144862, root := ~, start := 144858, stop := 144861 ), rec( content := "\n\n \ Induced subdigraphs, and some other operations which create new digraphs\n \ from old ones, inherit their labels from their parents.\n\n ", count := [ 5, 1, 11, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDigraph6String(\"&DHUEe_\");\n\ngap> DigraphEdgeLabels(D);\n[ [ 1 ], [ 1, 1, 1 ], [ 1 ], \ [ 1, 1, 1 ], [ 1, 1, 1 ] ]\ngap> SetDigraphEdgeLabel(D, 2, 1, \"d\");\ngap> Di\ graphEdgeLabels(D);\n[ [ 1 ], [ \"d\", 1, 1 ], [ 1 ], [ 1, 1, 1 ], [ 1, 1, 1 ]\ ]\ngap> D := InducedSubdigraph(D, [1, 2, 3]);\n\ngap> DigraphEdgeLabels(D);\n[ [ 1 ], [ \"d\", 1 ], [ 1 ] ]\nga\ p> OutNeighbours(D);\n[ [ 3 ], [ 1, 3 ], [ 1 ] ]\ngap> D := CompleteBipartiteD\ igraph(IsMutableDigraph, 2, 3);\n\n\ gap> DigraphEdgeLabels(D);\n[ [ 1, 1, 1 ], [ 1, 1, 1 ], [ 1, 1 ], [ 1, 1 ], [ \ 1, 1 ] ]\ngap> SetDigraphEdgeLabel(D, 2, 4, \"a\");\ngap> DigraphEdgeLabels(D)\ ;\n[ [ 1, 1, 1 ], [ 1, \"a\", 1 ], [ 1, 1 ], [ 1, 1 ], [ 1, 1 ] ]\ngap> Induce\ dSubdigraph(D, [1, 2, 3, 4]);\n\ngap\ > DigraphEdgeLabels(D);\n[ [ 1, 1 ], [ 1, \"a\" ], [ 1, 1 ], [ 1, 1 ] ]\ngap> \ OutNeighbors(D);\n[ [ 3, 4 ], [ 3, 4 ], [ 1, 2 ], [ 1, 2 ] ]\n", count := [ 5, 1, 11, 10 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 11, 10 ], mathmode := "Text", name := "Example", next := 146073, root := ~, start := 145006, stop := 146072 ), rec( content := "\n ", count := [ 5, 1, 11, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 11, 7 ], mathmode := "Text", name := "Description", next := 146090, root := ~, start := 143791, stop := 146089 ) ], count := [ 5, 1, 11, 1 ], mathmode := "Text", name := "ManSection", next := 146104, root := ~, start := 143522, stop := 146103 ), rec( content := "\n\n ", count := [ 5, 1, 11, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex" , Name := "DigraphInEdges"\ ), content := 0, count := [ 5, 1, 12, 2 ], mathmode := "Text", name := "Oper", next := 146176, root := ~, start := 146125, stop := 146175 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ edges.", count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "Returns", next := 146214, root := ~, start := 146179, stop := 146213 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphInEdges", count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "C", next := 146256, root := ~, start := 146235, stop := 146255 ), rec( content := " returns\ the list of all edges of ", count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "A", next := 146304, root := ~, start := 146290, stop := 146303 ), rec( content := "\n wh\ ich have ", count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "A", next := 146333, root := ~, start := 146320, stop := 146332 ), rec( content := " as thei\ r range.\n ", count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 2], [3, 3], [4, 4], [1, 1]]);\n\ngap> DigraphInEdges(D, 2);\n[ [ 1, 2 ], [ 1, 2 ] ]\ \n", count := [ 5, 1, 12, 4 ], name := "PCDATA", root := ~ ) ], count := [ 5, 1, 12, 4 ], mathmode := "Text", name := "Example", next := 146539, root := ~, start := 146354, stop := 146538 ), rec( content := "\n ", count := [ 5, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 12, 3 ], mathmode := "Text", name := "Description", next := 146556, root := ~, start := 146217, stop := 146555 ) ], count := [ 5, 1, 12, 1 ], mathmode := "Text", name := "ManSection", next := 146570, root := ~, start := 146110, stop := 146569 ), rec( content := "\n\n ", count := [ 5, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex" , Name := "DigraphOutEdges\ " ), content := 0, count := [ 5, 1, 13, 2 ], mathmode := "Text", name := "Oper", next := 146643, root := ~, start := 146591, stop := 146642 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ edges.", count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "Returns", next := 146681, root := ~, start := 146646, stop := 146680 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphOutEdges", count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "C", next := 146724, root := ~, start := 146702, stop := 146723 ), rec( content := " returns\ the list of all edges of ", count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "A", next := 146772, root := ~, start := 146758, stop := 146771 ), rec( content := "\n wh\ ich have ", count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "A", next := 146801, root := ~, start := 146788, stop := 146800 ), rec( content := " as thei\ r source.\n ", count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 2], [3, 3], [4, 4], [1, 1]]);\n\ngap> DigraphOutEdges(D, 2);\n[ [ 2, 3 ], [ 2, 3 ] \ ]\n", count := [ 5, 1, 13, 4 ], name := "PCDATA", root := ~ ) ], count := [ 5, 1, 13, 4 ], mathmode := "Text", name := "Example", next := 147009, root := ~, start := 146823, stop := 147008 ), rec( content := "\n ", count := [ 5, 1, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 13, 3 ], mathmode := "Text", name := "Description", next := 147026, root := ~, start := 146684, stop := 147025 ) ], count := [ 5, 1, 13, 1 ], mathmode := "Text", name := "ManSection", next := 147040, root := ~, start := 146576, stop := 147039 ), rec( content := "\n\n ", count := [ 5, 1, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, list", Label := "for digraph an\ d list", Name := "IsDigraphEdge" ), content := 0, count := [ 5, 1, 14, 2 ], mathmode := "Text", name := "Oper", next := 147146, root := ~, start := 147061, stop := 147145 ), rec( attributes := rec( Arg := "digraph, u, v", Label := "for digraph an\ d two pos ints", Name := "IsDigraphEdge" ), content := 0, count := [ 5, 1, 14, 4 ], mathmode := "Text", name := "Oper", next := 147242, root := ~, start := 147149, stop := 147241 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "K", next := 147265, root := ~, start := 147254, stop := 147264 ), rec( content := " or ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "K", next := 147281, root := ~, start := 147269, stop := 147280 ), rec( content := ".", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "Returns", next := 147292, root := ~, start := 147245, stop := 147291 ), rec( attributes := rec( ), content := [ rec( content := "\n In \ the first form, this function returns ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "K", next := 147365, root := ~, start := 147354, stop := 147364 ), rec( content := " if and \ only if the list\n ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "A", next := 147405, root := ~, start := 147394, stop := 147404 ), rec( content := " specifi\ es an edge in the digraph ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "A", next := 147453, root := ~, start := 147439, stop := 147452 ), rec( content := ". Speci\ fically,\n this operation returns ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "K", next := 147508, root := ~, start := 147497, stop := 147507 ), rec( content := " if ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "A", next := 147523, root := ~, start := 147512, stop := 147522 ), rec( content := " is a pa\ ir of positive\n integers where ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "A", next := 147576, root := ~, start := 147565, stop := 147575 ), rec( attributes := rec( ), content := [ rec( content := "[\ 1]", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "C", next := 147586, root := ~, start := 147576, stop := 147585 ), rec( content := " is the \ source and ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "A", next := 147616, root := ~, start := 147605, stop := 147615 ), rec( attributes := rec( ), content := [ rec( content := "[\ 2]", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "C", next := 147626, root := ~, start := 147616, stop := 147625 ), rec( content := "\n is\ the range of an edge in ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "A", next := 147672, root := ~, start := 147658, stop := 147671 ), rec( content := ", and ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "K", next := 147690, root := ~, start := 147678, stop := 147689 ), rec( content := " otherwi\ se. ", count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "P", next := 147706, root := ~, start := 147702, stop := 147705 ), rec( content := "\n\n \ The second form simply returns ", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "K", next := 147754, root := ~, start := 147743, stop := 147753 ), rec( content := " if ", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ ", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes :\ = rec( ), content := [ rec( content := "u", count := [ 5, 1, 14, 6 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 6 ], mathmode := \ "Text", name := "A", next := 147770, root := ~, start := 147762, stop := 14776\ 9 ), rec( content := ", ", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 6 ], mathmode := \ "Text", name := "A", next := 147780, root := ~, start := 147772, stop := 14777\ 9 ), rec( content := "]", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "C", next := 147785, root := ~, start := 147758, stop := 147784 ), rec( content := " is\n \ an edge in ", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "A", next := 147818, root := ~, start := 147804, stop := 147817 ), rec( content := ", and ", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "K", next := 147836, root := ~, start := 147824, stop := 147835 ), rec( content := " otherwi\ se.\n\n", count := [ 5, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 2], [6], [], [3], [], [1]]);\n\ngap> IsDigraphEdge(D, [1, 1]);\nfalse\ngap> IsDigra\ phEdge(D, [1, 2]);\ntrue\ngap> IsDigraphEdge(D, [1, 8]);\nfalse\n", count := [ 5, 1, 14, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 14, 7 ], mathmode := "Text", name := "Example", next := 148093, root := ~, start := 147849, stop := 148092 ), rec( content := "\n ", count := [ 5, 1, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 14, 5 ], mathmode := "Text", name := "Description", next := 148110, root := ~, start := 147295, stop := 148109 ) ], count := [ 5, 1, 14, 1 ], mathmode := "Text", name := "ManSection", next := 148124, root := ~, start := 147046, stop := 148123 ), rec( content := "\n\n ", count := [ 5, 1, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, list", Name := "IsMatching" ), content := 0, count := [ 5, 1, 15, 2 ], mathmode := "Text", name := "Oper", next := 148190, root := ~, start := 148145, stop := 148189 ), rec( attributes := rec( Arg := "digraph, list", Name := "IsMaximalMatchi\ ng" ), content := 0, count := [ 5, 1, 15, 4 ], mathmode := "Text", name := "Oper", next := 148245, root := ~, start := 148193, stop := 148244 ), rec( attributes := rec( Arg := "digraph, list", Name := "IsMaximumMatchi\ ng" ), content := 0, count := [ 5, 1, 15, 6 ], mathmode := "Text", name := "Oper", next := 148300, root := ~, start := 148248, stop := 148299 ), rec( attributes := rec( Arg := "digraph, list", Name := "IsPerfectMatchi\ ng" ), content := 0, count := [ 5, 1, 15, 8 ], mathmode := "Text", name := "Oper", next := 148355, root := ~, start := 148303, stop := 148354 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "K", next := 148378, root := ~, start := 148367, stop := 148377 ), rec( content := " or ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "K", next := 148394, root := ~, start := 148382, stop := 148393 ), rec( content := ".", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "Returns", next := 148405, root := ~, start := 148358, stop := 148404 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "A", next := 148443, root := ~, start := 148429, stop := 148442 ), rec( content := " is a di\ graph and ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "A", next := 148472, root := ~, start := 148461, stop := 148471 ), rec( content := " is a li\ st of pairs of\n vertices of ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "A", next := 148525, root := ~, start := 148511, stop := 148524 ), rec( content := ", then " , count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sMatching", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "C", next := 148549, root := ~, start := 148532, stop := 148548 ), rec( content := " returns\ ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "K", next := 148569, root := ~, start := 148558, stop := 148568 ), rec( content := " if\n \ ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "A", next := 148588, root := ~, start := 148577, stop := 148587 ), rec( content := " is a ma\ tching of ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "A", next := 148620, root := ~, start := 148606, stop := 148619 ), rec( content := ". The o\ peration\n ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sMaximalMatching", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "C", next := 148665, root := ~, start := 148641, stop := 148664 ), rec( content := " returns\ ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "K", next := 148685, root := ~, start := 148674, stop := 148684 ), rec( content := " if ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "A", next := 148700, root := ~, start := 148689, stop := 148699 ), rec( content := " is a ma\ ximal \n matching, ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sMaximumMatching", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "C", next := 148753, root := ~, start := 148729, stop := 148752 ), rec( content := " returns\ ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "K", next := 148773, root := ~, start := 148762, stop := 148772 ), rec( content := " if ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "A", next := 148788, root := ~, start := 148777, stop := 148787 ), rec( content := " is a\n \ maximum matching and ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sPerfectMatching", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "C", next := 148843, root := ~, start := 148819, stop := 148842 ), rec( content := " returns\ ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "K", next := 148863, root := ~, start := 148852, stop := 148862 ), rec( content := " if \n \ ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "A", next := 148883, root := ~, start := 148872, stop := 148882 ), rec( content := " is a pe\ rfect, matching of ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "A", next := 148924, root := ~, start := 148910, stop := 148923 ), rec( content := ", respec\ tively. \n Otherwise, each of these operations return ", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "K", next := 149001, root := ~, start := 148989, stop := 149000 ), rec( content := ".\n " , count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "P", next := 149011, root := ~, start := 149007, stop := 149010 ), rec( content := "\n\n \ A ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ atching", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "E", next := 149034, root := ~, start := 149019, stop := 149033 ), rec( content := " ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "M\ ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "C", next := 149043, root := ~, start := 149035, stop := 149042 ), rec( content := " of a di\ graph ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "A", next := 149071, root := ~, start := 149057, stop := 149070 ), rec( content := " is a su\ bset of the\n edges of ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "A", next := 149118, root := ~, start := 149104, stop := 149117 ), rec( content := ", i.e. " , count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEdges(", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA" , root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "digraph", count := [ 5, 1, 15, 10 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := \ "Text", name := "A", next := 149155, root := ~, start := 149141, stop := 14915\ 4 ), rec( content := ")", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "C", next := 149160, root := ~, start := 149125, stop := 149159 ), rec( content := ", such\n\ that no pair of distinct edges in ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "M\ ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "C", next := 149213, root := ~, start := 149205, stop := 149212 ), rec( content := " are inc\ ident to the same vertex\n of ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "A", next := 149267, root := ~, start := 149253, stop := 149266 ), rec( content := ". Note \ that this definition allows a matching to contain\n loops. See ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digraph\ HasLoops" ), content := 0, count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "Ref", next := 149371, root := ~, start := 149341, stop := 149370 ), rec( content := ". The m\ atching ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "M\ ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "C", next := 149395, root := ~, start := 149387, stop := 149394 ), rec( content := " is\n \ ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ aximal", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "E", next := 149417, root := ~, start := 149403, stop := 149416 ), rec( content := " if it i\ s contained in no larger matching of the digraph,\n is ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ aximum", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "E", next := 149496, root := ~, start := 149482, stop := 149495 ), rec( content := " if it h\ as the greatest cardinality among all matchings and\n is ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ erfect", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "E", next := 149577, root := ~, start := 149563, stop := 149576 ), rec( content := " if ever\ y vertex of the digraph is incident to an edge in\n the matching. Every ma\ ximum or perfect matching is maximal. Note, however,\n that not every perfe\ ct matching of digraphs with loops is maximum.\n\n ", count := [ 5, 1, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2], [1, 2], [2, 3, 4], [3, 5], [1]]);\n\ngap> IsMatching(D, [[2, 1], [3, 2]]);\nfalse\n\ gap> edges := [[3, 2]];;\ngap> IsMatching(D, edges);\ntrue\ngap> IsMaximalMatc\ hing(D, edges);\nfalse\ngap> edges := [[2, 1], [3, 4]];;\ngap> IsMaximalMatchi\ ng(D, edges);\ntrue\ngap> IsPerfectMatching(D, edges);\nfalse\ngap> edges := [\ [1, 2], [3, 3], [4, 5]];;\ngap> IsPerfectMatching(D, edges);\ntrue\ngap> IsMax\ imumMatching(D, edges);\nfalse\ngap> edges := [[1, 1], [2, 2], [3, 3], [4, 5]]\ ;;\ngap> IsMaximumMatching(D, edges);\ntrue\n", count := [ 5, 1, 15, 11 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 15, 11 ], mathmode := "Text", name := "Example", next := 150391, root := ~, start := 149791, stop := 150390 ), rec( content := "\n ", count := [ 5, 1, 15, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 15, 9 ], mathmode := "Text", name := "Description", next := 150408, root := ~, start := 148408, stop := 150407 ) ], count := [ 5, 1, 15, 1 ], mathmode := "Text", name := "ManSection", next := 150422, root := ~, start := 148130, stop := 150421 ), rec( content := "\n\n ", count := [ 5, 1, 15, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphMaximalM\ atching" ), content := 0, count := [ 5, 1, 16, 2 ], mathmode := "Text", name := "Attr", next := 150494, root := ~, start := 150443, stop := 150493 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ pairs of vertices.", count := [ 5, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 16, 3 ], mathmode := "Text", name := "Returns", next := 150544, root := ~, start := 150497, stop := 150543 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns a maximal matching of the digraph ", count := [ 5, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 16, 3 ], mathmode := "Text", name := "A", next := 150635, root := ~, start := 150621, stop := 150634 ), rec( content := ".\n " , count := [ 5, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 16, 4 ], mathmode := "Text", name := "P", next := 150645, root := ~, start := 150641, stop := 150644 ), rec( content := "\n\n \ For the definition of a maximal matching, see ", count := [ 5, 1, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsMaxim\ alMatching" ), content := 0, count := [ 5, 1, 16, 4 ], mathmode := "Text", name := "Ref", next := 150728, root := ~, start := 150697, stop := 150727 ), rec( content := ". \n\n \ ", count := [ 5, 1, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDiSparse6String(\".IeAoXCJU@|SHAe?d\");\n\ngap> M := DigraphMaximalMatching(D);; IsMaxim\ alMatching(D, M);\ntrue\ngap> D := RandomDigraph(100);;\ngap> IsMaximalMatchin\ g(D, DigraphMaximalMatching(D));\ntrue\ngap> D := GeneralisedPetersenGraph(IsM\ utableDigraph, 9, 2);\n\ngap> IsMa\ ximalMatching(D, DigraphMaximalMatching(D));\ntrue\n", count := [ 5, 1, 16, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 16, 5 ], mathmode := "Text", name := "Example", next := 151196, root := ~, start := 150736, stop := 151195 ), rec( content := "\n ", count := [ 5, 1, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 16, 3 ], mathmode := "Text", name := "Description", next := 151213, root := ~, start := 150547, stop := 151212 ) ], count := [ 5, 1, 16, 1 ], mathmode := "Text", name := "ManSection", next := 151227, root := ~, start := 150428, stop := 151226 ), rec( content := "\n\n ", count := [ 5, 1, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphMaximumM\ atching" ), content := 0, count := [ 5, 1, 17, 2 ], mathmode := "Text", name := "Attr", next := 151299, root := ~, start := 151248, stop := 151298 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ pairs of vertices.", count := [ 5, 1, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 17, 3 ], mathmode := "Text", name := "Returns", next := 151349, root := ~, start := 151302, stop := 151348 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns a maximum matching of the digraph ", count := [ 5, 1, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 17, 3 ], mathmode := "Text", name := "A", next := 151440, root := ~, start := 151426, stop := 151439 ), rec( content := ".\n " , count := [ 5, 1, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "P", next := 151450, root := ~, start := 151446, stop := 151449 ), rec( content := "\n\n \ For the definition of a maximum matching, see ", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsMaxim\ umMatching" ), content := 0, count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "Ref", next := 151533, root := ~, start := 151502, stop := 151532 ), rec( content := ".\n I\ f ", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "A", next := 151556, root := ~, start := 151542, stop := 151555 ), rec( content := " is bipa\ rtite (see ", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsBipar\ titeDigraph" ), content := 0, count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "Ref", next := 151607, root := ~, start := 151575, stop := 151606 ), rec( content := "), then \ \n the algorithm used has complexity ", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m*sqrt(n))", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "C", next := 151673, root := ~, start := 151654, stop := 151672 ), rec( content := ". Otherw\ ise for general \n graphs the complexity is ", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m*n*log(n))", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "C", next := 151747, root := ~, start := 151727, stop := 151746 ), rec( content := ". Here " , count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "C", next := 151762, root := ~, start := 151754, stop := 151761 ), rec( content := " is the \ number of vertices \n and ", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "C", next := 151806, root := ~, start := 151798, stop := 151805 ), rec( content := " is the \ number of edges.\n\n ", count := [ 5, 1, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDigraph6String(\"&I@EA_A?AdDp[_c??OO\");\n\ngap> M := DigraphMaximumMatching(D);; IsMaxi\ malMatching(D, M);\ntrue\ngap> Length(M);\n5\ngap> D := Digraph([[5, 6, 7, 8],\ [6, 7, 8], [7, 8], [8], \n> [], [], [], []]);;\ngap> M := Di\ graphMaximumMatching(D);\n[ [ 1, 5 ], [ 2, 6 ], [ 3, 7 ], [ 4, 8 ] ]\ngap> D :\ = GeneralisedPetersenGraph(IsMutableDigraph, 9, 2);\n\ngap> M := DigraphMaximumMatching(D);;\ngap> IsMaximalMatc\ hing(D, M);\ntrue\ngap> Length(M);\n9\n", count := [ 5, 1, 17, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 1, 17, 5 ], mathmode := "Text", name := "Example", next := 152433, root := ~, start := 151836, stop := 152432 ), rec( content := "\n ", count := [ 5, 1, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 17, 3 ], mathmode := "Text", name := "Description", next := 152450, root := ~, start := 151352, stop := 152449 ) ], count := [ 5, 1, 17, 1 ], mathmode := "Text", name := "ManSection", next := 152464, root := ~, start := 151233, stop := 152463 ), rec( content := "\n\n ", count := [ 5, 1, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 1, 0, 1 ], mathmode := "Text", name := "Section", next := 152478, root := ~, start := 132087, stop := 152477 ) , rec( content := "\n\n ", count := [ 5, 1, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Neighbours and de\ gree", count := [ 5, 2, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 0, 2 ], mathmode := "Text", name := "Heading", next := 152531, root := ~, start := 152491, stop := 152530 ), rec( content := "\n ", count := [ 5, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "AdjacencyMatrix\ " ), content := 0, count := [ 5, 2, 1, 2 ], mathmode := "Text", name := "Attr", next := 152595, root := ~, start := 152551, stop := 152594 ), rec( attributes := rec( Arg := "digraph", Name := "AdjacencyMatrix\ MutableCopy" ), content := 0, count := [ 5, 2, 1, 4 ], mathmode := "Text", name := "Oper", next := 152653, root := ~, start := 152598, stop := 152652 ), rec( attributes := rec( ), content := [ rec( content := "A square \ matrix of non-negative integers.", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "Returns", next := 152716, root := ~, start := 152656, stop := 152715 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the adjacency matrix ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "C", next := 152790, root := ~, start := 152780, stop := 152789 ), rec( content := " of the \ digraph\n ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "A", next := 152824, root := ~, start := 152810, stop := 152823 ), rec( content := ".\n T\ he value of the matrix entry ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at[i][j]", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "C", next := 152876, root := ~, start := 152860, stop := 152875 ), rec( content := " is the \ number of edges\n in ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "A", next := 152921, root := ~, start := 152907, stop := 152920 ), rec( content := " with so\ urce ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "C", next := 152942, root := ~, start := 152934, stop := 152941 ), rec( content := " and ran\ ge ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "C", next := 152961, root := ~, start := 152953, stop := 152960 ), rec( content := ". If ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "A", next := 152980, root := ~, start := 152966, stop := 152979 ), rec( content := "\n ha\ s no vertices, then the empty list is returned. ", count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "P", next := 153039, root := ~, start := 153035, stop := 153038 ), rec( content := "\n\n \ The function ", count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ djacencyMatrix", count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "C", next := 153080, root := ~, start := 153058, stop := 153079 ), rec( content := " returns\ an immutable list of\n lists, whereas the function ", count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ djacencyMatrixMutableCopy", count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "C", next := 153175, root := ~, start := 153142, stop := 153174 ), rec( content := " returns\ a copy\n of ", count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ djacencyMatrix", count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "C", next := 153220, root := ~, start := 153198, stop := 153219 ), rec( content := " that is\ a mutable list of mutable lists. ", count := [ 5, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 1, 7 ], mathmode := "Text", name := "P", next := 153266, root := ~, start := 153262, stop := 153265 ), rec( content := "\n\n \ ", count := [ 5, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([\n> [2, 2, 2], [1, 3, 6, 8, 9, 10], [4, 6, 8],\n> [1, 2, \ 3, 9], [3, 3], [3, 5, 6, 10], [1, 2, 7],\n> [1, 2, 3, 10, 5, 6, 10], [1, 3, 4,\ 5, 8, 10],\n> [2, 3, 4, 6, 7, 10]]);\n\ngap> mat := AdjacencyMatrix(gr);;\ngap> Display(mat);\n[ [ 0, \ 3, 0, 0, 0, 0, 0, 0, 0, 0 ],\n [ 1, 0, 1, 0, 0, 1, 0, 1, 1, \ 1 ],\n [ 0, 0, 0, 1, 0, 1, 0, 1, 0, 0 ],\n [ 1, 1, 1, 0, 0, \ 0, 0, 0, 1, 0 ],\n [ 0, 0, 2, 0, 0, 0, 0, 0, 0, 0 ],\n [ 0, \ 0, 1, 0, 1, 1, 0, 0, 0, 1 ],\n [ 1, 1, 0, 0, 0, 0, 1, 0, 0,\ 0 ],\n [ 1, 1, 1, 0, 1, 1, 0, 0, 0, 2 ],\n [ 1, 0, 1, 1, 1,\ 0, 0, 1, 0, 1 ],\n [ 0, 1, 1, 1, 0, 1, 1, 0, 0, 1 ] ]\ngap> D\ := CycleDigraph(IsMutableDigraph, 3);\n\ngap> Display(AdjacencyMatrix(D));\n[ [ 0, 1, 0 ],\n [ 0, 0, 1 ],\ \n [ 1, 0, 0 ] ]\n", count := [ 5, 2, 1, 8 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 8 ], mathmode := "Text", name := "Example", next := 154236, root := ~, start := 153272, stop := 154235 ), rec( content := "\n ", count := [ 5, 2, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 1, 5 ], mathmode := "Text", name := "Description", next := 154253, root := ~, start := 152719, stop := 154252 ) ], count := [ 5, 2, 1, 1 ], mathmode := "Text", name := "ManSection", next := 154267, root := ~, start := 152536, stop := 154266 ), rec( content := "\n\n ", count := [ 5, 2, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "CharacteristicP\ olynomial" ), content := 0, count := [ 5, 2, 2, 2 ], mathmode := "Text", name := "Attr", next := 154341, root := ~, start := 154288, stop := 154340 ), rec( attributes := rec( ), content := [ rec( content := "A polynom\ ial with integer coefficients.", count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "Returns", next := 154402, root := ~, start := 154344, stop := 154401 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the characteristic polynomial of the digraph\n ", count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "A", next := 154509, root := ~, start := 154495, stop := 154508 ), rec( content := ". That i\ s it returns the characteristic polynomial\n of the adjacency matrix of t\ he digraph ", count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "A", next := 154619, root := ~, start := 154605, stop := 154618 ), rec( content := "\n ", count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\n> [2, 2, 2], [1, 3, 6, 8, 9, 10], [4, 6, 8],\n> [1, 2, 3\ , 9], [3, 3], [3, 5, 6, 10], [1, 2, 7],\n> [1, 2, 3, 10, 5, 6, 10], [1, 3, 4, \ 5, 8, 10],\n> [2, 3, 4, 6, 7, 10]]);\n\ngap> CharacteristicPolynomial(D);\nx_1^10-3*x_1^9-7*x_1^8-x_1^7+1\ 4*x_1^6+x_1^5-26*x_1^4+51*x_1^3-10*x_1^2\\\n+18*x_1-30\ngap> D := CompleteDigr\ aph(5);\n\ngap> CharacteristicPoly\ nomial(D);\nx_1^5-10*x_1^3-20*x_1^2-15*x_1-4\ngap> D := CycleDigraph(IsMutable\ Digraph, 3);\n\ngap> CharacteristicP\ olynomial(D);\nx_1^3-1\n", count := [ 5, 2, 2, 4 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 2, 4 ], mathmode := "Text", name := "Example", next := 155285, root := ~, start := 154624, stop := 155284 ), rec( content := "\n ", count := [ 5, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 2, 3 ], mathmode := "Text", name := "Description", next := 155302, root := ~, start := 154405, stop := 155301 ) ], count := [ 5, 2, 2, 1 ], mathmode := "Text", name := "ManSection", next := 155316, root := ~, start := 154273, stop := 155315 ), rec( content := "\n\n ", count := [ 5, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "BooleanAdjacenc\ yMatrix" ), content := 0, count := [ 5, 2, 3, 2 ], mathmode := "Text", name := "Attr", next := 155388, root := ~, start := 155337, stop := 155387 ), rec( attributes := rec( Arg := "digraph", Name := "BooleanAdjacenc\ yMatrixMutableCopy" ), content := 0, count := [ 5, 2, 3, 4 ], mathmode := "Text", name := "Oper", next := 155453, root := ~, start := 155391, stop := 155452 ), rec( attributes := rec( ), content := [ rec( content := "A square \ matrix of booleans.", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "Returns", next := 155503, root := ~, start := 155456, stop := 155502 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "A", next := 155541, root := ~, start := 155527, stop := 155540 ), rec( content := " is a di\ graph with a positive number of vertices\n ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "C", next := 155602, root := ~, start := 155594, stop := 155601 ), rec( content := ", then " , count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ ooleanAdjacencyMatrix(", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "C", next := 155639, root := ~, start := 155609, stop := 155638 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "A", next := 155653, root := ~, start := 155639, stop := 155652 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "C", next := 155661, root := ~, start := 155653, stop := 155660 ), rec( content := "\n re\ turns the boolean adjacency matrix ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "C", next := 155713, root := ~, start := 155703, stop := 155712 ), rec( content := " of ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "A", next := 155731, root := ~, start := 155717, stop := 155730 ), rec( content := ". The\n\ value of the matrix entry ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at[j][i]", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "C", next := 155784, root := ~, start := 155768, stop := 155783 ), rec( content := " is ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "K", next := 155799, root := ~, start := 155788, stop := 155798 ), rec( content := " if and \ only if\n there exists an edge in ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "A", next := 155857, root := ~, start := 155843, stop := 155856 ), rec( content := " with so\ urce ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "C", next := 155878, root := ~, start := 155870, stop := 155877 ), rec( content := " and ran\ ge\n ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "C", next := 155901, root := ~, start := 155893, stop := 155900 ), rec( content := ". If ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "A", next := 155921, root := ~, start := 155907, stop := 155920 ), rec( content := " has no \ vertices, then the empty list is\n returned. ", count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 3, 6 ], mathmode := "Text", name := "P", next := 155980, root := ~, start := 155976, stop := 155979 ), rec( content := "\n\n \ Note that the boolean adjacency matrix loses information about multiple\n e\ dges. ", count := [ 5, 2, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "P", next := 156074, root := ~, start := 156070, stop := 156073 ), rec( content := "\n\n \ The attribute ", count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ ooleanAdjacencyMatrix", count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "C", next := 156123, root := ~, start := 156094, stop := 156122 ), rec( content := " returns\ an immutable list of\n immutable lists, whereas the function\n ", count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ ooleanAdjacencyMatrixMutableCopy", count := [ 5, 2, 3, 7 ], mathmode := "Text" , name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "C", next := 156239, root := ~, start := 156199, stop := 156238 ), rec( content := " returns\ a copy of the\n ", count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ ooleanAdjacencyMatrix", count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "C", next := 156295, root := ~, start := 156266, stop := 156294 ), rec( content := " that is\ a mutable list of mutable lists. ", count := [ 5, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 3, 8 ], mathmode := "Text", name := "P", next := 156341, root := ~, start := 156337, stop := 156340 ), rec( content := "\n ", count := [ 5, 2, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[3, 4], [2, 3], [1, 2, 4], [4]]);\n\ngap> PrintArray(BooleanAdjacencyMatrix(gr));\n[ [ fal\ se, false, true, true ],\n [ false, true, true, false ],\n [ tr\ ue, true, false, true ],\n [ false, false, false, true ] ]\ngap> gr\ := CycleDigraph(4);;\ngap> PrintArray(BooleanAdjacencyMatrix(gr));\n[ [ fals\ e, true, false, false ],\n [ false, false, true, false ],\n [ fals\ e, false, false, true ],\n [ true, false, false, false ] ]\ngap> Boo\ leanAdjacencyMatrix(EmptyDigraph(0));\n[ ]\ngap> D := CycleDigraph(IsMutableD\ igraph, 3);\n\ngap> PrintArray(Boole\ anAdjacencyMatrix(D));\n[ [ false, true, false ],\n [ false, false, t\ rue ],\n [ true, false, false ] ]\n", count := [ 5, 2, 3, 9 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 3, 9 ], mathmode := "Text", name := "Example", next := 157176, root := ~, start := 156346, stop := 157175 ), rec( content := "\n ", count := [ 5, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 3, 5 ], mathmode := "Text", name := "Description", next := 157193, root := ~, start := 155506, stop := 157192 ) ], count := [ 5, 2, 3, 1 ], mathmode := "Text", name := "ManSection", next := 157207, root := ~, start := 155322, stop := 157206 ), rec( content := "\n\n ", count := [ 5, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphAdjacenc\ yFunction" ), content := 0, count := [ 5, 2, 4, 2 ], mathmode := "Text", name := "Attr", next := 157281, root := ~, start := 157228, stop := 157280 ), rec( attributes := rec( ), content := [ rec( content := "A functio\ n.", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "Returns", next := 157314, root := ~, start := 157284, stop := 157313 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "A", next := 157352, root := ~, start := 157338, stop := 157351 ), rec( content := " is a di\ graph, then ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphAdjacencyFunction", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "C", next := 157403, root := ~, start := 157372, stop := 157402 ), rec( content := " returns\ \n a function which takes two integer parameters ", count := [ 5, 2, 4, 3 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ , y", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "C", next := 157473, root := ~, start := 157462, stop := 157472 ), rec( content := " and ret\ urns\n ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "K", next := 157501, root := ~, start := 157490, stop := 157500 ), rec( content := " if ther\ e exists an edge from vertex ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "C", next := 157546, root := ~, start := 157538, stop := 157545 ), rec( content := " to vert\ ex ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "y\ ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "C", next := 157565, root := ~, start := 157557, stop := 157564 ), rec( content := "\n in\ ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "A", next := 157587, root := ~, start := 157573, stop := 157586 ), rec( content := " and ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "K", next := 157604, root := ~, start := 157592, stop := 157603 ), rec( content := " if not.\ \n\n ", count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph := Digraph([[1, 2], [3], []]);\n\ngap> foo := DigraphAdjacencyFunction(digraph);\nfunction( u, v )\ ... end\ngap> foo(1, 1);\ntrue\ngap> foo(1, 2);\ntrue\ngap> foo(1, 3);\nfalse\ \ngap> foo(3, 1);\nfalse\ngap> gr := Digraph([\"a\", \"b\", \"c\"],\n> \ [\"a\", \"b\", \"b\"],\n> [\"b\", \"a\", \"a\"]);\n\ \ngap> foo := DigraphAdjacenc\ yFunction(gr);\nfunction( u, v ) ... end\ngap> foo(1, 2);\ntrue\ngap> foo(3, 2\ );\nfalse\ngap> foo(3, 1);\nfalse\ngap> D := CycleDigraph(IsMutableDigraph, 3)\ ;\n\ngap> foo := DigraphAdjacencyFun\ ction(D);\nfunction( u, v ) ... end\ngap> foo(1, 2);\ntrue\ngap> foo(2, 1);\nf\ alse\n", count := [ 5, 2, 4, 4 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 4 ], mathmode := "Text", name := "Example", next := 158385, root := ~, start := 157618, stop := 158384 ), rec( content := "\n ", count := [ 5, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 4, 3 ], mathmode := "Text", name := "Description", next := 158402, root := ~, start := 157317, stop := 158401 ) ], count := [ 5, 2, 4, 1 ], mathmode := "Text", name := "ManSection", next := 158416, root := ~, start := 157213, stop := 158415 ), rec( content := "\n\n ", count := [ 5, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphRange" ) , content := 0, count := [ 5, 2, 5, 2 ], mathmode := "Text", name := "Attr", next := 158478, root := ~, start := 158437, stop := 158477 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphSource" ), content := 0, count := [ 5, 2, 5, 4 ], mathmode := "Text", name := "Attr", next := 158523, root := ~, start := 158481, stop := 158522 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ positive integers.", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "Returns", next := 158573, root := ~, start := 158526, stop := 158572 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphRange", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "C", next := 158613, root := ~, start := 158594, stop := 158612 ), rec( content := " and ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphSource", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "C", next := 158638, root := ~, start := 158618, stop := 158637 ), rec( content := " return \ the range and source of\n the digraph ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "A", next := 158700, root := ~, start := 158686, stop := 158699 ), rec( content := ". More p\ recisely, position ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "C", next := 158735, root := ~, start := 158727, stop := 158734 ), rec( content := " in\n \ ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "D\ igraphRange(", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "digraph", count := [ 5, 2, 5, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := \ "Text", name := "A", next := 158773, root := ~, start := 158759, stop := 15877\ 2 ), rec( content := ")", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "C", next := 158778, root := ~, start := 158743, stop := 158777 ), rec( content := " is the \ range of the ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "C", next := 158807, root := ~, start := 158799, stop := 158806 ), rec( content := "th edge \ of\n ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "A", next := 158836, root := ~, start := 158822, stop := 158835 ), rec( content := ".\n\n \ ", count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([\n> [2, 1, 3, 5], [1, 3, 4], [2, 3], [2], [1, 2, 3, 4]]);\ \n\ngap> DigraphRange(gr);\n[ 2, \ 1, 3, 5, 1, 3, 4, 2, 3, 2, 1, 2, 3, 4 ]\ngap> DigraphSource(gr);\n[ 1, 1, 1, 1\ , 2, 2, 2, 3, 3, 4, 5, 5, 5, 5 ]\ngap> DigraphEdges(gr);\n[ [ 1, 2 ], [ 1, 1 ]\ , [ 1, 3 ], [ 1, 5 ], [ 2, 1 ], [ 2, 3 ], \n [ 2, 4 ], [ 3, 2 ], [ 3, 3 ], [ \ 4, 2 ], [ 5, 1 ], [ 5, 2 ], \n [ 5, 3 ], [ 5, 4 ] ]\ngap> D := CycleDigraph(I\ sMutableDigraph, 3);\n\ngap> Digraph\ Range(D);\n[ 2, 3, 1 ]\ngap> DigraphSource(D);\n[ 1, 2, 3 ]\n", count := [ 5, 2, 5, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 5, 6 ], mathmode := "Text", name := "Example", next := 159464, root := ~, start := 158843, stop := 159463 ), rec( content := "\n ", count := [ 5, 2, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 5, 5 ], mathmode := "Text", name := "Description", next := 159481, root := ~, start := 158576, stop := 159480 ) ], count := [ 5, 2, 5, 1 ], mathmode := "Text", name := "ManSection", next := 159495, root := ~, start := 158422, stop := 159494 ), rec( content := "\n\n ", count := [ 5, 2, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "OutNeighbours" ), content := 0, count := [ 5, 2, 6, 2 ], mathmode := "Text", name := "Attr", next := 159558, root := ~, start := 159516, stop := 159557 ), rec( attributes := rec( Arg := "digraph", Name := "OutNeighbors" ) , content := 0, count := [ 5, 2, 6, 4 ], mathmode := "Text", name := "Attr", next := 159602, root := ~, start := 159561, stop := 159601 ), rec( attributes := rec( Arg := "digraph", Name := "OutNeighboursMu\ tableCopy" ), content := 0, count := [ 5, 2, 6, 6 ], mathmode := "Text", name := "Oper", next := 159658, root := ~, start := 159605, stop := 159657 ), rec( attributes := rec( Arg := "digraph", Name := "OutNeighborsMut\ ableCopy" ), content := 0, count := [ 5, 2, 6, 8 ], mathmode := "Text", name := "Oper", next := 159713, root := ~, start := 159661, stop := 159712 ), rec( attributes := rec( ), content := [ rec( content := "The adjac\ encies of a digraph.", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "Returns", next := 159764, root := ~, start := 159716, stop := 159763 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the list ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "C", next := 159826, root := ~, start := 159816, stop := 159825 ), rec( content := " of out-\ neighbours of each vertex\n of the digraph ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "A", next := 159893, root := ~, start := 159879, stop := 159892 ), rec( content := ".\n M\ ore specifically, a vertex ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "C", next := 159935, root := ~, start := 159927, stop := 159934 ), rec( content := " appears\ in ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut[i]", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "C", next := 159960, root := ~, start := 159947, stop := 159959 ), rec( content := " each ti\ me\n there exists an edge with source ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "C", next := 160016, root := ~, start := 160008, stop := 160015 ), rec( content := " and ran\ ge ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "C", next := 160035, root := ~, start := 160027, stop := 160034 ), rec( content := " in\n \ ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "A", next := 160057, root := ~, start := 160043, stop := 160056 ), rec( content := ". ", count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "P", next := 160063, root := ~, start := 160059, stop := 160062 ), rec( content := "\n\n \ The function ", count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ utNeighbours", count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "C", next := 160102, root := ~, start := 160082, stop := 160101 ), rec( content := " returns\ an immutable list of\n lists, whereas the function ", count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ utNeighboursMutableCopy", count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "C", next := 160195, root := ~, start := 160164, stop := 160194 ), rec( content := " returns\ a copy\n of ", count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ utNeighbours", count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "C", next := 160238, root := ~, start := 160218, stop := 160237 ), rec( content := " which i\ s a mutable list of mutable lists. ", count := [ 5, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 6, 11 ], mathmode := "Text", name := "P", next := 160285, root := ~, start := 160281, stop := 160284 ), rec( content := "\n\n \ ", count := [ 5, 2, 6, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([\"a\", \"b\", \"c\"],\n> [\"a\", \"b\", \ \"b\"],\n> [\"b\", \"a\", \"c\"]);\n\ngap> OutNeighbours(gr);\n[ [ 2 ], [ 1, 3 ], [ ] ]\ngap> \ gr := Digraph([[1, 2, 3], [2, 1], [3]]);\n\ngap> OutNeighbours(gr);\n[ [ 1, 2, 3 ], [ 2, 1 ], [ 3 ] ]\ngap> gr :\ = DigraphByAdjacencyMatrix([\n> [1, 2, 1],\n> [1, 1, 0],\n> [0, 0, 1]]);\n<\ immutable multidigraph with 3 vertices, 7 edges>\ngap> OutNeighbours(gr);\n[ [\ 1, 2, 2, 3 ], [ 1, 2 ], [ 3 ] ]\ngap> OutNeighboursMutableCopy(gr);\n[ [ 1, 2\ , 2, 3 ], [ 1, 2 ], [ 3 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> OutNeighbours(D);\n[ [ 2 ], [ 3 \ ], [ 1 ] ]\n", count := [ 5, 2, 6, 12 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 12 ], mathmode := "Text", name := "Example", next := 161073, root := ~, start := 160291, stop := 161072 ), rec( content := "\n ", count := [ 5, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 6, 9 ], mathmode := "Text", name := "Description", next := 161090, root := ~, start := 159767, stop := 161089 ) ], count := [ 5, 2, 6, 1 ], mathmode := "Text", name := "ManSection", next := 161104, root := ~, start := 159501, stop := 161103 ), rec( content := "\n\n ", count := [ 5, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "InNeighbours" ) , content := 0, count := [ 5, 2, 7, 2 ], mathmode := "Text", name := "Attr", next := 161166, root := ~, start := 161125, stop := 161165 ), rec( attributes := rec( Arg := "digraph", Name := "InNeighbors" ), content := 0, count := [ 5, 2, 7, 4 ], mathmode := "Text", name := "Attr", next := 161209, root := ~, start := 161169, stop := 161208 ), rec( attributes := rec( Arg := "digraph", Name := "InNeighboursMut\ ableCopy" ), content := 0, count := [ 5, 2, 7, 6 ], mathmode := "Text", name := "Oper", next := 161264, root := ~, start := 161212, stop := 161263 ), rec( attributes := rec( Arg := "digraph", Name := "InNeighborsMuta\ bleCopy" ), content := 0, count := [ 5, 2, 7, 8 ], mathmode := "Text", name := "Oper", next := 161318, root := ~, start := 161267, stop := 161317 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ lists of vertices.", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "Returns", next := 161368, root := ~, start := 161321, stop := 161367 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the list ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nn", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "C", next := 161430, root := ~, start := 161420, stop := 161429 ), rec( content := " of in-n\ eighbours of each vertex\n of the digraph ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "A", next := 161496, root := ~, start := 161482, stop := 161495 ), rec( content := ".\n M\ ore specifically, a vertex ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "C", next := 161538, root := ~, start := 161530, stop := 161537 ), rec( content := " appears\ in ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nn[i]", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "C", next := 161563, root := ~, start := 161550, stop := 161562 ), rec( content := " each ti\ me\n there exists an edge with source ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "C", next := 161619, root := ~, start := 161611, stop := 161618 ), rec( content := " and ran\ ge ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "C", next := 161638, root := ~, start := 161630, stop := 161637 ), rec( content := " in\n \ ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "A", next := 161660, root := ~, start := 161646, stop := 161659 ), rec( content := ". ", count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "P", next := 161666, root := ~, start := 161662, stop := 161665 ), rec( content := "\n\n \ The function ", count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ nNeighbours", count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "C", next := 161704, root := ~, start := 161685, stop := 161703 ), rec( content := " returns\ an immutable list of\n lists, whereas the function ", count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ nNeighboursMutableCopy", count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "C", next := 161796, root := ~, start := 161766, stop := 161795 ), rec( content := " returns\ a copy\n of ", count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ nNeighbours", count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "C", next := 161838, root := ~, start := 161819, stop := 161837 ), rec( content := " which i\ s a mutable list of mutable lists. ", count := [ 5, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 7, 11 ], mathmode := "Text", name := "P", next := 161885, root := ~, start := 161881, stop := 161884 ), rec( content := "\n\n \ Note that each entry of ", count := [ 5, 2, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nn", count := [ 5, 2, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 11 ], mathmode := "Text", name := "C", next := 161925, root := ~, start := 161915, stop := 161924 ), rec( content := " is sort\ ed into ascending order. ", count := [ 5, 2, 7, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 7, 12 ], mathmode := "Text", name := "P", next := 161962, root := ~, start := 161958, stop := 161961 ), rec( content := "\n\n \ ", count := [ 5, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([\"a\", \"b\", \"c\"],\n> [\"a\", \"b\", \ \"b\"],\n> [\"b\", \"a\", \"c\"]);\n\ngap> InNeighbours(gr);\n[ [ 2 ], [ 1 ], [ 2 ] ]\ngap> gr \ := Digraph([[1, 2, 3], [2, 1], [3]]);\n\ngap> InNeighbours(gr);\n[ [ 1, 2 ], [ 1, 2 ], [ 1, 3 ] ]\ngap> gr := Di\ graphByAdjacencyMatrix([\n> [1, 2, 1],\n> [1, 1, 0],\n> [0, 0, 1]]);\n\ngap> InNeighbours(gr);\n[ [ 1, 2\ ], [ 1, 1, 2 ], [ 1, 3 ] ]\ngap> InNeighboursMutableCopy(gr);\n[ [ 1, 2 ], [ \ 1, 1, 2 ], [ 1, 3 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> InNeighbours(D);\n[ [ 3 ], [ 1 ], [ 2 \ ] ]\n", count := [ 5, 2, 7, 13 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 13 ], mathmode := "Text", name := "Example", next := 162743, root := ~, start := 161968, stop := 162742 ), rec( content := "\n ", count := [ 5, 2, 7, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 7, 9 ], mathmode := "Text", name := "Description", next := 162760, root := ~, start := 161371, stop := 162759 ) ], count := [ 5, 2, 7, 1 ], mathmode := "Text", name := "ManSection", next := 162774, root := ~, start := 161110, stop := 162773 ), rec( content := "\n\n ", count := [ 5, 2, 7, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "OutDegrees" ), content := 0, count := [ 5, 2, 8, 2 ], mathmode := "Text", name := "Attr", next := 162834, root := ~, start := 162795, stop := 162833 ), rec( attributes := rec( Arg := "digraph", Name := "OutDegreeSequen\ ce" ), content := 0, count := [ 5, 2, 8, 4 ], mathmode := "Text", name := "Attr", next := 162883, root := ~, start := 162837, stop := 162882 ), rec( attributes := rec( Arg := "digraph", Name := "OutDegreeSet" ) , content := 0, count := [ 5, 2, 8, 6 ], mathmode := "Text", name := "Attr", next := 162927, root := ~, start := 162886, stop := 162926 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ non-negative integers.", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "Returns", next := 162981, root := ~, start := 162930, stop := 162980 ), rec( attributes := rec( ), content := [ rec( content := "\n\n G\ iven a digraph ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "A", next := 163033, root := ~, start := 163019, stop := 163032 ), rec( content := " with ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "M", next := 163047, root := ~, start := 163039, stop := 163046 ), rec( content := " vertice\ s, the function\n ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ utDegrees", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "C", next := 163092, root := ~, start := 163075, stop := 163091 ), rec( content := " returns\ an immutable list ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "C", next := 163129, root := ~, start := 163119, stop := 163128 ), rec( content := " of leng\ th ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "M", next := 163148, root := ~, start := 163140, stop := 163147 ), rec( content := ", such t\ hat\n for a vertex ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "C", next := 163185, root := ~, start := 163177, stop := 163184 ), rec( content := " in ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "A", next := 163203, root := ~, start := 163189, stop := 163202 ), rec( content := ", the va\ lue of ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut[i]", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "C", next := 163231, root := ~, start := 163218, stop := 163230 ), rec( content := " is the\\ n out-degree of vertex ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "C", next := 163272, root := ~, start := 163264, stop := 163271 ), rec( content := ".\n S\ ee ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "OutDegr\ eeOfVertex" ), content := 0, count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "Ref", next := 163313, root := ~, start := 163282, stop := 163312 ), rec( content := ". ", count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 8, 8 ], mathmode := "Text", name := "P", next := 163319, root := ~, start := 163315, stop := 163318 ), rec( content := "\n\n \ The function ", count := [ 5, 2, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ utDegreeSequence", count := [ 5, 2, 8, 8 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 5, 2, 8, 8 ], mathmode := "Text", name := "C", next := 163362, root := ~, start := 163338, stop := 163361 ), rec( content := " returns\ the same list,\n after it has been sorted into non-increasing order. ", count := [ 5, 2, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 8, 9 ], mathmode := "Text", name := "P", next := 163446, root := ~, start := 163442, stop := 163445 ), rec( content := "\n\n \ The function ", count := [ 5, 2, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ utDegreeSet", count := [ 5, 2, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 9 ], mathmode := "Text", name := "C", next := 163484, root := ~, start := 163465, stop := 163483 ), rec( content := " returns\ the same list, sorted into\n increasing order with duplicate entries remov\ ed. ", count := [ 5, 2, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 8, 10 ], mathmode := "Text", name := "P", next := 163577, root := ~, start := 163573, stop := 163576 ), rec( content := "\n\n \ ", count := [ 5, 2, 8, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 3, 2, 2], [], [2, 1], []]);\n\ngap> OutDegrees(D);\n[ 4, 0, 2, 0 ]\ngap> OutDegreeS\ equence(D);\n[ 4, 2, 0, 0 ]\ngap> OutDegreeSet(D);\n[ 0, 2, 4 ]\ngap> D := Cyc\ leDigraph(IsMutableDigraph, 3);\n\ng\ ap> OutDegrees(D);\n[ 1, 1, 1 ]\n", count := [ 5, 2, 8, 11 ], name := "PCDATA" , root := ~ ) ], count := [ 5, 2, 8, 11 ], mathmode := "Text", name := "Example", next := 163947, root := ~, start := 163583, stop := 163946 ), rec( content := "\n ", count := [ 5, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 8, 7 ], mathmode := "Text", name := "Description", next := 163964, root := ~, start := 162984, stop := 163963 ) ], count := [ 5, 2, 8, 1 ], mathmode := "Text", name := "ManSection", next := 163978, root := ~, start := 162780, stop := 163977 ), rec( content := "\n\n ", count := [ 5, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "InDegrees" ), content := 0, count := [ 5, 2, 9, 2 ], mathmode := "Text", name := "Attr", next := 164037, root := ~, start := 163999, stop := 164036 ), rec( attributes := rec( Arg := "digraph", Name := "InDegreeSequenc\ e" ), content := 0, count := [ 5, 2, 9, 4 ], mathmode := "Text", name := "Attr", next := 164085, root := ~, start := 164040, stop := 164084 ), rec( attributes := rec( Arg := "digraph", Name := "InDegreeSet" ), content := 0, count := [ 5, 2, 9, 6 ], mathmode := "Text", name := "Attr", next := 164128, root := ~, start := 164088, stop := 164127 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ non-negative integers.", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "Returns", next := 164182, root := ~, start := 164131, stop := 164181 ), rec( attributes := rec( ), content := [ rec( content := "\n\n G\ iven a digraph ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "A", next := 164234, root := ~, start := 164220, stop := 164233 ), rec( content := " with ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "M", next := 164248, root := ~, start := 164240, stop := 164247 ), rec( content := " vertice\ s, the function\n ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ nDegrees", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "C", next := 164292, root := ~, start := 164276, stop := 164291 ), rec( content := " returns\ an immutable list ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nn", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "C", next := 164329, root := ~, start := 164319, stop := 164328 ), rec( content := " of leng\ th ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "M", next := 164348, root := ~, start := 164340, stop := 164347 ), rec( content := ", such t\ hat\n for a vertex ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "C", next := 164385, root := ~, start := 164377, stop := 164384 ), rec( content := " in ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "A", next := 164403, root := ~, start := 164389, stop := 164402 ), rec( content := ", the va\ lue of ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nn[i]", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "C", next := 164431, root := ~, start := 164418, stop := 164430 ), rec( content := " is\n \ the in-degree of vertex ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "C", next := 164471, root := ~, start := 164463, stop := 164470 ), rec( content := ".\n S\ ee ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "InDegre\ eOfVertex" ), content := 0, count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "Ref", next := 164511, root := ~, start := 164481, stop := 164510 ), rec( content := ". ", count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 9, 8 ], mathmode := "Text", name := "P", next := 164517, root := ~, start := 164513, stop := 164516 ), rec( content := "\n\n \ The function ", count := [ 5, 2, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ nDegreeSequence", count := [ 5, 2, 9, 8 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 5, 2, 9, 8 ], mathmode := "Text", name := "C", next := 164559, root := ~, start := 164536, stop := 164558 ), rec( content := " returns\ the same list,\n after it has been sorted into non-increasing order. ", count := [ 5, 2, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 9, 9 ], mathmode := "Text", name := "P", next := 164643, root := ~, start := 164639, stop := 164642 ), rec( content := "\n\n \ The function ", count := [ 5, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ nDegreeSet", count := [ 5, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 9 ], mathmode := "Text", name := "C", next := 164680, root := ~, start := 164662, stop := 164679 ), rec( content := " returns\ the same list, sorted into\n increasing order with duplicate entries remov\ ed. ", count := [ 5, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 9, 10 ], mathmode := "Text", name := "P", next := 164773, root := ~, start := 164769, stop := 164772 ), rec( content := "\n\n \ ", count := [ 5, 2, 9, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 3, 2, 2, 4], [], [2, 1, 4], []]);\n\ngap> InDegrees(D);\n[ 2, 3, 1, 2 ]\ngap> InDeg\ reeSequence(D);\n[ 3, 2, 2, 1 ]\ngap> InDegreeSet(D);\n[ 1, 2, 3 ]\ngap> D := \ CycleDigraph(IsMutableDigraph, 3);\n\ \ngap> InDegrees(D);\n[ 1, 1, 1 ]\n", count := [ 5, 2, 9, 11 ], name := "PCDAT\ A", root := ~ ) ], count := [ 5, 2, 9, 11 ], mathmode := "Text", name := "Example", next := 165145, root := ~, start := 164779, stop := 165144 ), rec( content := "\n ", count := [ 5, 2, 9, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 9, 7 ], mathmode := "Text", name := "Description", next := 165162, root := ~, start := 164185, stop := 165161 ) ], count := [ 5, 2, 9, 1 ], mathmode := "Text", name := "ManSection", next := 165176, root := ~, start := 163984, stop := 165175 ), rec( content := "\n\n ", count := [ 5, 2, 9, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex" , Name := "OutDegreeOfVert\ ex" ), content := 0, count := [ 5, 2, 10, 2 ], mathmode := "Text", name := "Oper", next := 165251, root := ~, start := 165197, stop := 165250 ), rec( attributes := rec( ), content := [ rec( content := "The non-n\ egative integer.", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "Returns", next := 165298, root := ~, start := 165254, stop := 165297 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation returns the out-degree of the vertex ", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "A", next := 165384, root := ~, start := 165371, stop := 165383 ), rec( content := " in the\\ n digraph ", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "A", next := 165418, root := ~, start := 165404, stop := 165417 ), rec( content := ".\n T\ he out-degree of ", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "A", next := 165455, root := ~, start := 165442, stop := 165454 ), rec( content := " is the \ number of edges in ", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "A", next := 165496, root := ~, start := 165482, stop := 165495 ), rec( content := "\n wh\ ose source is ", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "A", next := 165530, root := ~, start := 165517, stop := 165529 ), rec( content := ".\n " , count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 10, 4 ], mathmode := "Text", name := "P", next := 165540, root := ~, start := 165536, stop := 165539 ), rec( content := "\n ", count := [ 5, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\n> [2, 2, 1], [1, 4], [2, 2, 4, 2], [1, 1, 2, 2, 1, 2, 2]\ ]);\n\ngap> OutDegreeOfVerte\ x(D, 1);\n3\ngap> OutDegreeOfVertex(D, 2);\n2\ngap> OutDegreeOfVertex(D, 3);\n\ 4\ngap> OutDegreeOfVertex(D, 4);\n7\n", count := [ 5, 2, 10, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 10, 5 ], mathmode := "Text", name := "Example", next := 165836, root := ~, start := 165545, stop := 165835 ), rec( content := "\n ", count := [ 5, 2, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 10, 3 ], mathmode := "Text", name := "Description", next := 165853, root := ~, start := 165301, stop := 165852 ) ], count := [ 5, 2, 10, 1 ], mathmode := "Text", name := "ManSection", next := 165867, root := ~, start := 165182, stop := 165866 ), rec( content := "\n\n ", count := [ 5, 2, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex" , Name := "OutNeighboursOf\ Vertex" ), content := 0, count := [ 5, 2, 11, 2 ], mathmode := "Text", name := "Oper", next := 165946, root := ~, start := 165888, stop := 165945 ), rec( attributes := rec( Arg := "digraph, vertex" , Name := "OutNeighborsOfV\ ertex" ), content := 0, count := [ 5, 2, 11, 4 ], mathmode := "Text", name := "Oper", next := 166006, root := ~, start := 165949, stop := 166005 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ vertices.", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "Returns", next := 166047, root := ~, start := 166009, stop := 166046 ), rec( attributes := rec( ), content := [ rec( content := "\n\n T\ his operation returns the list ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "C", next := 166111, root := ~, start := 166101, stop := 166110 ), rec( content := " of vert\ ices of the digraph\n ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "A", next := 166157, root := ~, start := 166143, stop := 166156 ), rec( content := ".\n A\ vertex ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "C", next := 166180, root := ~, start := 166172, stop := 166179 ), rec( content := " appears\ in the list ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "C", next := 166211, root := ~, start := 166201, stop := 166210 ), rec( content := " each ti\ me there exists an\n edge with source ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "A", next := 166273, root := ~, start := 166260, stop := 166272 ), rec( content := " and ran\ ge ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "C", next := 166292, root := ~, start := 166284, stop := 166291 ), rec( content := " in ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "A", next := 166310, root := ~, start := 166296, stop := 166309 ), rec( content := "; in\n \ particular, this means that ", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "C", next := 166357, root := ~, start := 166347, stop := 166356 ), rec( content := " may con\ tain duplicates.", count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 11, 6 ], mathmode := "Text", name := "P", next := 166385, root := ~, start := 166381, stop := 166384 ), rec( content := "\n ", count := [ 5, 2, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\n> [2, 2, 3], [1, 3, 4], [2, 2, 3], [1, 1, 2, 2, 1, 2, 2]\ ]);\n\ngap> OutNeighboursOfV\ ertex(D, 1);\n[ 2, 2, 3 ]\ngap> OutNeighboursOfVertex(D, 3);\n[ 2, 2, 3 ]\n", count := [ 5, 2, 11, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 2, 11, 7 ], mathmode := "Text", name := "Example", next := 166645, root := ~, start := 166390, stop := 166644 ), rec( content := "\n ", count := [ 5, 2, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 11, 5 ], mathmode := "Text", name := "Description", next := 166662, root := ~, start := 166050, stop := 166661 ) ], count := [ 5, 2, 11, 1 ], mathmode := "Text", name := "ManSection", next := 166676, root := ~, start := 165873, stop := 166675 ), rec( content := "\n\n ", count := [ 5, 2, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex" , Name := "InDegreeOfVerte\ x" ), content := 0, count := [ 5, 2, 12, 2 ], mathmode := "Text", name := "Oper", next := 166750, root := ~, start := 166697, stop := 166749 ), rec( attributes := rec( ), content := [ rec( content := "A non-neg\ ative integer.", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "Returns", next := 166795, root := ~, start := 166753, stop := 166794 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation returns the in-degree of the vertex ", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "A", next := 166880, root := ~, start := 166867, stop := 166879 ), rec( content := " in the\\ n digraph ", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "A", next := 166914, root := ~, start := 166900, stop := 166913 ), rec( content := ".\n T\ he in-degree of ", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "A", next := 166950, root := ~, start := 166937, stop := 166949 ), rec( content := " is the \ number of edges in ", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "A", next := 166991, root := ~, start := 166977, stop := 166990 ), rec( content := "\n wh\ ose range is ", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "A", next := 167024, root := ~, start := 167011, stop := 167023 ), rec( content := ".\n " , count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\n> [2, 2, 1], [1, 4], [2, 2, 4, 2], [1, 1, 2, 2, 1, 2, 2]\ ]);\n\ngap> InDegreeOfVertex\ (D, 1);\n5\ngap> InDegreeOfVertex(D, 2);\n9\ngap> InDegreeOfVertex(D, 3);\n0\n\ gap> InDegreeOfVertex(D, 4);\n2\n", count := [ 5, 2, 12, 4 ], name := "PCDATA" , root := ~ ) ], count := [ 5, 2, 12, 4 ], mathmode := "Text", name := "Example", next := 167317, root := ~, start := 167030, stop := 167316 ), rec( content := "\n ", count := [ 5, 2, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 12, 3 ], mathmode := "Text", name := "Description", next := 167334, root := ~, start := 166798, stop := 167333 ) ], count := [ 5, 2, 12, 1 ], mathmode := "Text", name := "ManSection", next := 167348, root := ~, start := 166682, stop := 167347 ), rec( content := "\n\n ", count := [ 5, 2, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex" , Name := "InNeighboursOfV\ ertex" ), content := 0, count := [ 5, 2, 13, 2 ], mathmode := "Text", name := "Oper", next := 167426, root := ~, start := 167369, stop := 167425 ), rec( attributes := rec( Arg := "digraph, vertex" , Name := "InNeighborsOfVe\ rtex" ), content := 0, count := [ 5, 2, 13, 4 ], mathmode := "Text", name := "Oper", next := 167485, root := ~, start := 167429, stop := 167484 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ postitive vertices.", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "Returns", next := 167536, root := ~, start := 167488, stop := 167535 ), rec( attributes := rec( ), content := [ rec( content := "\n\n T\ his operation returns the list ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nn", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "C", next := 167600, root := ~, start := 167590, stop := 167599 ), rec( content := " of vert\ ices of the digraph\n ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "A", next := 167646, root := ~, start := 167632, stop := 167645 ), rec( content := ".\n A\ vertex ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "C", next := 167669, root := ~, start := 167661, stop := 167668 ), rec( content := " appears\ in the list ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nn", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "C", next := 167700, root := ~, start := 167690, stop := 167699 ), rec( content := " each ti\ me there exists an\n edge with source ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "C", next := 167757, root := ~, start := 167749, stop := 167756 ), rec( content := " and ran\ ge ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "A", next := 167781, root := ~, start := 167768, stop := 167780 ), rec( content := " in ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "A", next := 167799, root := ~, start := 167785, stop := 167798 ), rec( content := "; in\n \ particular, this means that ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nn", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "C", next := 167846, root := ~, start := 167836, stop := 167845 ), rec( content := " may con\ tain duplicates. ", count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 13, 6 ], mathmode := "Text", name := "P", next := 167875, root := ~, start := 167871, stop := 167874 ), rec( content := "\n\n \ ", count := [ 5, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\n> [2, 2, 3], [1, 3, 4], [2, 2, 3], [1, 1, 2, 2, 1, 2, 2]\ ]);\n\ngap> InNeighboursOfVe\ rtex(D, 1);\n[ 2, 4, 4, 4 ]\ngap> InNeighboursOfVertex(D, 2);\n[ 1, 1, 3, 3, 4\ , 4, 4, 4 ]\n", count := [ 5, 2, 13, 7 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 7 ], mathmode := "Text", name := "Example", next := 168152, root := ~, start := 167881, stop := 168151 ), rec( content := "\n ", count := [ 5, 2, 13, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 13, 5 ], mathmode := "Text", name := "Description", next := 168169, root := ~, start := 167539, stop := 168168 ) ], count := [ 5, 2, 13, 1 ], mathmode := "Text", name := "ManSection", next := 168183, root := ~, start := 167354, stop := 168182 ), rec( content := "\n\n ", count := [ 5, 2, 13, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphLoops" ) , content := 0, count := [ 5, 2, 14, 2 ], mathmode := "Text", name := "Attr", next := 168245, root := ~, start := 168204, stop := 168244 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ vertices.", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "Returns", next := 168286, root := ~, start := 168248, stop := 168285 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "A", next := 168324, root := ~, start := 168310, stop := 168323 ), rec( content := " is a di\ graph, then ", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphLoops", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "C", next := 168363, root := ~, start := 168344, stop := 168362 ), rec( content := " returns\ the list\n consisting of the ", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Vertices" ), content := 0, count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "Ref", next := 168432, root := ~, start := 168403, stop := 168431 ), rec( content := " of ", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "A", next := 168450, root := ~, start := 168436, stop := 168449 ), rec( content := "\n at\ which there is a loop. See ", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digraph\ HasLoops" ), content := 0, count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "Ref", next := 168514, root := ~, start := 168485, stop := 168513 ), rec( content := ". ", count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 14, 4 ], mathmode := "Text", name := "P", next := 168520, root := ~, start := 168516, stop := 168519 ), rec( content := "\n\n \ ", count := [ 5, 2, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2], [3], []]);\n\ngap> DigraphHasLoops(D);\nfalse\ngap> DigraphLoops(D);\n[ ]\ngap> D := D\ igraph([[3, 5], [1], [2, 4, 3], [4], [2, 1]]);\n\ngap> DigraphLoops(D);\n[ 3, 4 ]\ngap> D := Digraph(IsMutableDi\ graph, [[1], [1]]);\n\ngap> DigraphL\ oops(D);\n[ 1 ]\n", count := [ 5, 2, 14, 5 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 14, 5 ], mathmode := "Text", name := "Example", next := 168950, root := ~, start := 168526, stop := 168949 ), rec( content := "\n ", count := [ 5, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 14, 3 ], mathmode := "Text", name := "Description", next := 168967, root := ~, start := 168289, stop := 168966 ) ], count := [ 5, 2, 14, 1 ], mathmode := "Text", name := "ManSection", next := 168981, root := ~, start := 168189, stop := 168980 ), rec( content := "\n\n ", count := [ 5, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, u, v", Name := "PartialOrderDig\ raphMeetOfVertices" ), content := 0, count := [ 5, 2, 15, 2 ], mathmode := "Text", name := "Oper", next := 169074, root := ~, start := 169002, stop := 169073 ), rec( attributes := rec( Arg := "digraph, u, v", Name := "PartialOrderDig\ raphJoinOfVertices" ), content := 0, count := [ 5, 2, 15, 4 ], mathmode := "Text", name := "Oper", next := 169149, root := ~, start := 169077, stop := 169148 ), rec( attributes := rec( ), content := [ rec( content := "A positiv\ e integer or ", count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "K", next := 169194, root := ~, start := 169183, stop := 169193 ) ], count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "Returns", next := 169204, root := ~, start := 169152, stop := 169203 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ the first argument is a partial order digraph ", count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsParti\ alOrderDigraph" ), content := 0, count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "Ref", next := 169315, root := ~, start := 169276, stop := 169314 ), rec( content := " then th\ ese operations return the meet, or\n the join, of the two input vertices. I\ f the meet (or join) is does not\n exist then ", count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "K", next := 169459, root := ~, start := 169448, stop := 169458 ), rec( content := " is retu\ rned. The meet (or join) is guaranteed to\n exist when the first argument s\ atisfies\n ", count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMeetS\ emilatticeDigraph" ), content := 0, count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "Ref", next := 169595, root := ~, start := 169557, stop := 169594 ), rec( content := " (or\n \ ", count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsJoinS\ emilatticeDigraph" ), content := 0, count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "Ref", next := 169643, root := ~, start := 169605, stop := 169642 ), rec( content := ") - see \ the documentation for these\n properties for the definition of the meet (or\ the join).\n\n ", count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1], [1, 2], [1, 3], [1, 2, 3, 4]]);\n\ngap> PartialOrderDigraphMeetOfVertices(D, 2, 3);\n4\ \ngap> PartialOrderDigraphJoinOfVertices(D, 2, 3);\n1\ngap> PartialOrderDigrap\ hMeetOfVertices(D, 1, 2);\n2\ngap> PartialOrderDigraphJoinOfVertices(D, 3, 4);\ \n3\ngap> D := Digraph([[1], [2], [1, 2, 3], [1, 2, 4]]);\n\ngap> PartialOrderDigraphMeetOfVertices(D, 3, 4);\nf\ ail\ngap> PartialOrderDigraphJoinOfVertices(D, 3, 4);\nfail\ngap> PartialOrder\ DigraphMeetOfVertices(D, 1, 2);\nfail\ngap> PartialOrderDigraphJoinOfVertices(\ D, 1, 2);\nfail\n", count := [ 5, 2, 15, 6 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 15, 6 ], mathmode := "Text", name := "Example", next := 170396, root := ~, start := 169745, stop := 170395 ), rec( content := "\n ", count := [ 5, 2, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 15, 5 ], mathmode := "Text", name := "Description", next := 170413, root := ~, start := 169209, stop := 170412 ) ], count := [ 5, 2, 15, 1 ], mathmode := "Text", name := "ManSection", next := 170427, root := ~, start := 168987, stop := 170426 ), rec( content := "\n\n ", count := [ 5, 2, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DegreeMatrix" ) , content := 0, count := [ 5, 2, 16, 2 ], mathmode := "Text", name := "Attr", next := 170489, root := ~, start := 170448, stop := 170488 ), rec( attributes := rec( ), content := [ rec( content := "A square \ matrix of non-negative integers.", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "Returns", next := 170552, root := ~, start := 170492, stop := 170551 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the outdegree matrix ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "C", next := 170626, root := ~, start := 170616, stop := 170625 ), rec( content := " of the \ digraph\n ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "A", next := 170660, root := ~, start := 170646, stop := 170659 ), rec( content := ". The va\ lue of the ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "C", next := 170687, root := ~, start := 170679, stop := 170686 ), rec( content := "th diago\ nal matrix entry is the\n outdegree of the vertex ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "C", next := 170755, root := ~, start := 170747, stop := 170754 ), rec( content := " in ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "A", next := 170773, root := ~, start := 170759, stop := 170772 ), rec( content := ". All of\ f-diagonal entries \n are ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "0\ ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "C", next := 170817, root := ~, start := 170809, stop := 170816 ), rec( content := ".\n I\ f ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "A", next := 170840, root := ~, start := 170826, stop := 170839 ), rec( content := " has no \ vertices, then the empty list is returned. ", count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 16, 4 ], mathmode := "Text", name := "P", next := 170895, root := ~, start := 170891, stop := 170894 ), rec( content := "\n\n \ See ", count := [ 5, 2, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "OutDegr\ ees" ), content := 0, count := [ 5, 2, 16, 4 ], mathmode := "Text", name := "Ref", next := 170929, root := ~, start := 170905, stop := 170928 ), rec( content := " for mor\ e information.\n ", count := [ 5, 2, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2, 3], [4], [1, 3, 4], []]);\n\ngap> PrintArray(DegreeMatrix(D));\n[ [ 3, 0, 0, 0 ],\ \n [ 0, 1, 0, 0 ],\n [ 0, 0, 3, 0 ],\n [ 0, 0, 0, 0 ] ]\ngap> D\ := CycleDigraph(5);;\ngap> PrintArray(DegreeMatrix(D));\n[ [ 1, 0, 0, 0, \ 0 ],\n [ 0, 1, 0, 0, 0 ],\n [ 0, 0, 1, 0, 0 ],\n [ 0, 0, 0, \ 1, 0 ],\n [ 0, 0, 0, 0, 1 ] ]\ngap> DegreeMatrix(EmptyDigraph(0));\n[ \ ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> Display(DegreeMatrix(D));\n[ [ 1, 0, 0 ],\n [ 0, 1, \ 0 ],\n [ 0, 0, 1 ] ]\n", count := [ 5, 2, 16, 5 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 5 ], mathmode := "Text", name := "Example", next := 171616, root := ~, start := 170956, stop := 171615 ), rec( content := "\n ", count := [ 5, 2, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 16, 3 ], mathmode := "Text", name := "Description", next := 171633, root := ~, start := 170555, stop := 171632 ) ], count := [ 5, 2, 16, 1 ], mathmode := "Text", name := "ManSection", next := 171647, root := ~, start := 170433, stop := 171646 ), rec( content := "\n\n ", count := [ 5, 2, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "LaplacianMatrix\ " ), content := 0, count := [ 5, 2, 17, 2 ], mathmode := "Text", name := "Attr", next := 171712, root := ~, start := 171668, stop := 171711 ), rec( attributes := rec( ), content := [ rec( content := "A square \ matrix of integers.", count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "Returns", next := 171762, root := ~, start := 171715, stop := 171761 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the outdegree Laplacian matrix ", count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at", count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "C", next := 171846, root := ~, start := 171836, stop := 171845 ), rec( content := " of the\\ n digraph ", count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "A", next := 171880, root := ~, start := 171866, stop := 171879 ), rec( content := ". The ou\ tdegree Laplacian matrix is defined as\n ", count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ egreeMatrix(digraph) - AdjacencyMatrix(digraph)", count := [ 5, 2, 17, 3 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "C", next := 171986, root := ~, start := 171931, stop := 171985 ), rec( content := ". If\n \ ", count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "A", next := 172010, root := ~, start := 171996, stop := 172009 ), rec( content := " has no \ vertices, then the empty list is returned. ", count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 2, 17, 4 ], mathmode := "Text", name := "P", next := 172065, root := ~, start := 172061, stop := 172064 ), rec( content := "\n\n \ See ", count := [ 5, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "DegreeM\ atrix" ), content := 0, count := [ 5, 2, 17, 4 ], mathmode := "Text", name := "Ref", next := 172101, root := ~, start := 172075, stop := 172100 ), rec( content := " and ", count := [ 5, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Adjacen\ cyMatrix" ), content := 0, count := [ 5, 2, 17, 4 ], mathmode := "Text", name := "Ref", next := 172135, root := ~, start := 172106, stop := 172134 ), rec( content := " for mor\ e\n information.\n ", count := [ 5, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[1, 2, 3], [4], [1, 3, 4], []]);\n\ngap> PrintArray(LaplacianMatrix(gr));\n[ [ 2, -1, -\ 1, 0 ],\n [ 0, 1, 0, -1 ],\n [ -1, 0, 2, -1 ],\n [ 0, 0,\ 0, 0 ] ]\ngap> LaplacianMatrix(EmptyDigraph(0));\n[ ]\ngap> D := CycleDi\ graph(IsMutableDigraph, 3);\n\ngap> \ Display(LaplacianMatrix(D));\n[ [ 1, -1, 0 ],\n [ 0, 1, -1 ],\n [ \ -1, 0, 1 ] ]\n", count := [ 5, 2, 17, 5 ], name := "PCDATA", root := ~ ) ], count := [ 5, 2, 17, 5 ], mathmode := "Text", name := "Example", next := 172669, root := ~, start := 172166, stop := 172668 ), rec( content := "\n ", count := [ 5, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 17, 3 ], mathmode := "Text", name := "Description", next := 172686, root := ~, start := 171765, stop := 172685 ) ], count := [ 5, 2, 17, 1 ], mathmode := "Text", name := "ManSection", next := 172700, root := ~, start := 171653, stop := 172699 ), rec( content := "\n\n ", count := [ 5, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 2, 0, 1 ], mathmode := "Text", name := "Section", next := 172714, root := ~, start := 152482, stop := 172713 ) , rec( content := "\n\n ", count := [ 5, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Reachability and \ connectivity", count := [ 5, 3, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 0, 2 ], mathmode := "Text", name := "Heading", next := 172775, root := ~, start := 172727, stop := 172774 ), rec( content := "\n ", count := [ 5, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphDiameter\ " ), content := 0, count := [ 5, 3, 1, 2 ], mathmode := "Text", name := "Attr", next := 172839, root := ~, start := 172795, stop := 172838 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r or ", count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "C", next := 172876, root := ~, start := 172865, stop := 172875 ), rec( content := ".", count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "Returns", next := 172887, root := ~, start := 172842, stop := 172886 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the diameter of the digraph ", count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "A", next := 172972, root := ~, start := 172958, stop := 172971 ), rec( content := ".\n " , count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "P", next := 172982, root := ~, start := 172978, stop := 172981 ), rec( content := "\n\n \ If a digraph ", count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "A", next := 173015, root := ~, start := 173001, stop := 173014 ), rec( content := " is stro\ ngly connected and has at least 1\n vertex, then the ", count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ iameter", count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "E", next := 173093, root := ~, start := 173078, stop := 173092 ), rec( content := " is the \ maximum shortest distance between\n any pair of distinct vertices. Otherwis\ e then the diameter of\n ", count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "A", next := 173219, root := ~, start := 173205, stop := 173218 ), rec( content := " is unde\ fined, and this function returns the value\n ", count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "C", next := 173285, root := ~, start := 173274, stop := 173284 ), rec( content := ". ", count := [ 5, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 1, 5 ], mathmode := "Text", name := "P", next := 173291, root := ~, start := 173287, stop := 173290 ), rec( content := "\n\n \ See ", count := [ 5, 3, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ ShortestDistances" ), content := 0, count := [ 5, 3, 1, 5 ], mathmode := "Text", name := "Ref", next := 173339, root := ~, start := 173301, stop := 173338 ), rec( content := ". ", count := [ 5, 3, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 1, 6 ], mathmode := "Text", name := "P", next := 173345, root := ~, start := 173341, stop := 173344 ), rec( content := "\n ", count := [ 5, 3, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2], [3], [4, 5], [5], [1, 2, 3, 4, 5]]);\n\ngap> DigraphDiameter(D);\n3\ngap> D := ChainDi\ graph(2);\n\ngap> DigraphDiameter(D);\ \nfail\ngap> IsStronglyConnectedDigraph(D);\nfalse\ngap> D := GeneralisedPeter\ senGraph(IsMutableDigraph, 6, 2);\n\ngap> DigraphDiameter(D);\n4\n", count := [ 5, 3, 1, 7 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1, 7 ], mathmode := "Text", name := "Example", next := 173789, root := ~, start := 173350, stop := 173788 ), rec( content := "\n ", count := [ 5, 3, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1, 3 ], mathmode := "Text", name := "Description", next := 173806, root := ~, start := 172890, stop := 173805 ) ], count := [ 5, 3, 1, 1 ], mathmode := "Text", name := "ManSection", next := 173820, root := ~, start := 172780, stop := 173819 ), rec( content := "\n\n ", count := [ 5, 3, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, u, v", Label := "for a digraph \ and two vertices", Name := "DigraphShortestDistance" ), content := 0, count := [ 5, 3, 2, 2 ], mathmode := "Text", name := "Oper", next := 173946, root := ~, start := 173841, stop := 173945 ), rec( attributes := rec( Arg := "digraph, list", Label := "for a digraph \ and a list", Name := "DigraphShortestDistance" ), content := 0, count := [ 5, 3, 2, 4 ], mathmode := "Text", name := "Oper", next := 174048, root := ~, start := 173949, stop := 174047 ), rec( attributes := rec( Arg := "digraph, list1, \ list2", Label := "for a digraph, a list, and a list", Name := "DigraphShortest\ Distance" ), content := 0, count := [ 5, 3, 2, 6 ], mathmode := "Text", name := "Oper", next := 174167, root := ~, start := 174051, stop := 174166 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r or ", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "K", next := 174204, root := ~, start := 174193, stop := 174203 ) ], count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "Returns", next := 174214, root := ~, start := 174170, stop := 174213 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ there is a directed path in the digraph ", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "A", next := 174292, root := ~, start := 174278, stop := 174291 ), rec( content := " between\ vertex\n ", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "A", next := 174320, root := ~, start := 174312, stop := 174319 ), rec( content := " and ver\ tex ", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "A", next := 174340, root := ~, start := 174332, stop := 174339 ), rec( content := ", then t\ his operation returns the length of the\n shortest such directed path. If \ no such directed path exists, then this\n operation returns ", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "K", next := 174498, root := ~, start := 174487, stop := 174497 ), rec( content := ". See se\ ction ", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "Ref", next := 174562, root := ~, start := 174512, stop := 174561 ), rec( content := " for the\ definition of a directed path. ", count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "P", next := 174606, root := ~, start := 174602, stop := 174605 ), rec( content := "\n\n \ If the second form is used, then ", count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "A", next := 174656, root := ~, start := 174645, stop := 174655 ), rec( content := " should \ be a list of length two,\n containing two positive integers which correspon\ d to the vertices ", count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "A", next := 174767, root := ~, start := 174759, stop := 174766 ), rec( content := "\n an\ d ", count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "A", next := 174784, root := ~, start := 174776, stop := 174783 ), rec( content := ". ", count := [ 5, 3, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 2, 9 ], mathmode := "Text", name := "P", next := 174790, root := ~, start := 174786, stop := 174789 ), rec( content := "\n\n \ Note that as usual, a vertex is considered to be at distance 0 from\n itsel\ f .", count := [ 5, 3, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "P", next := 174880, root := ~, start := 174876, stop := 174879 ), rec( content := "\n\n \ If the third form is used, then ", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist1", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "A", next := 174930, root := ~, start := 174918, stop := 174929 ), rec( content := " and ", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist2", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "A", next := 174947, root := ~, start := 174935, stop := 174946 ), rec( content := " are bot\ h lists\n of vertices. The shortest directed path between ", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist1", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "A", next := 175027, root := ~, start := 175015, stop := 175026 ), rec( content := " and\n \ ", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist2", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "A", next := 175048, root := ~, start := 175036, stop := 175047 ), rec( content := " is then\ the length of the shortest directed path which starts\n with a vertex in " , count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist1", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "A", next := 175144, root := ~, start := 175132, stop := 175143 ), rec( content := " and ter\ minates at a vertex in ", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist2", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "A", next := 175187, root := ~, start := 175175, stop := 175186 ), rec( content := ", if\n \ such directed path exists. If ", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist1", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "A", next := 175238, root := ~, start := 175226, stop := 175237 ), rec( content := " and ", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist2", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "A", next := 175255, root := ~, start := 175243, stop := 175254 ), rec( content := " have no\ n-empty\n intersection, the operation returns ", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "0\ ", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "C", next := 175319, root := ~, start := 175311, stop := 175318 ), rec( content := ".", count := [ 5, 3, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 2, 11 ], mathmode := "Text", name := "P", next := 175324, root := ~, start := 175320, stop := 175323 ), rec( content := "\n ", count := [ 5, 3, 2, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2], [3], [1, 4], [1, 3], [5]]);\n\ngap> DigraphShortestDistance(D, 1, 3);\n2\ngap> DigraphS\ hortestDistance(D, [3, 3]);\n0\ngap> DigraphShortestDistance(D, 5, 2);\nfail\n\ gap> DigraphShortestDistance(D, [1, 2], [4, 5]);\n2\ngap> DigraphShortestDista\ nce(D, [1, 3], [3, 5]);\n0\n", count := [ 5, 3, 2, 12 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 12 ], mathmode := "Text", name := "Example", next := 175688, root := ~, start := 175329, stop := 175687 ), rec( content := "\n ", count := [ 5, 3, 2, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 2, 7 ], mathmode := "Text", name := "Description", next := 175705, root := ~, start := 174217, stop := 175704 ) ], count := [ 5, 3, 2, 1 ], mathmode := "Text", name := "ManSection", next := 175719, root := ~, start := 173826, stop := 175718 ), rec( content := "\n\n ", count := [ 5, 3, 2, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphShortest\ Distances" ), content := 0, count := [ 5, 3, 3, 2 ], mathmode := "Text", name := "Attr", next := 175793, root := ~, start := 175740, stop := 175792 ), rec( attributes := rec( ), content := [ rec( content := "A square \ matrix.", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "Returns", next := 175831, root := ~, start := 175796, stop := 175830 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "A", next := 175869, root := ~, start := 175855, stop := 175868 ), rec( content := " is a di\ graph with ", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "M", next := 175896, root := ~, start := 175888, stop := 175895 ), rec( content := " vertice\ s, then this\n function returns an ", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ \\times n", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "M", next := 175958, root := ~, start := 175941, stop := 175957 ), rec( content := " matrix \ ", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "C", next := 175976, root := ~, start := 175966, stop := 175975 ), rec( content := ", where \ each entry is\n either a non-negative integer, or ", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "K", next := 176047, root := ~, start := 176036, stop := 176046 ), rec( content := ". If ", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ = 0", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "M", next := 176065, root := ~, start := 176053, stop := 176064 ), rec( content := ", then a\ n\n empty list is returned. ", count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "P", next := 176107, root := ~, start := 176103, stop := 176106 ), rec( content := "\n\n \ If there is a directed path from vertex ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "C", next := 176161, root := ~, start := 176153, stop := 176160 ), rec( content := " to vert\ ex ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "C", next := 176180, root := ~, start := 176172, stop := 176179 ), rec( content := ", then\n\ the value of ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at[i][j]", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "C", next := 176220, root := ~, start := 176204, stop := 176219 ), rec( content := " is the \ length of the shortest such directed\n path. If no such directed path exist\ s, then the value of ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at[i][j]", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "C", next := 176342, root := ~, start := 176326, stop := 176341 ), rec( content := " is\n \ ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "C", next := 176361, root := ~, start := 176350, stop := 176360 ), rec( content := ". We us\ e the convention that the distance from every vertex to\n itself is ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "0\ ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "C", next := 176447, root := ~, start := 176439, stop := 176446 ), rec( content := ", i.e. " , count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at[i][i] = 0", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "C", next := 176474, root := ~, start := 176454, stop := 176473 ), rec( content := " for all\ vertices ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "C", next := 176500, root := ~, start := 176492, stop := 176499 ), rec( content := ".\n " , count := [ 5, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 3, 5 ], mathmode := "Text", name := "P", next := 176510, root := ~, start := 176506, stop := 176509 ), rec( content := "\n\n \ The method used in this function is a version of the Floyd-Warshall\n algor\ ithm, and has complexity ", count := [ 5, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (n^3)", count := [ 5, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 5 ], mathmode := "Text", name := "M", next := 176631, root := ~, start := 176618, stop := 176630 ), rec( content := ".\n\n \ ", count := [ 5, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2], [3], [1, 2], [4]]);\n\ngap> mat := DigraphShortestDistances(D);;\ngap> PrintArray(ma\ t);\n[ [ 0, 1, 2, fail ],\n [ 2, 0, 1, fail ],\n [\ 1, 1, 0, fail ],\n [ fail, fail, fail, 0 ] ]\ngap> D := \ CycleDigraph(IsMutableDigraph, 3);\n\ \ngap> DigraphShortestDistances(D);\n[ [ 0, 1, 2 ], [ 2, 0, 1 ], [ 1, 2, 0 ] ]\ \n", count := [ 5, 3, 3, 6 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 6 ], mathmode := "Text", name := "Example", next := 177127, root := ~, start := 176638, stop := 177126 ), rec( content := "\n ", count := [ 5, 3, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 3, 3 ], mathmode := "Text", name := "Description", next := 177144, root := ~, start := 175834, stop := 177143 ) ], count := [ 5, 3, 3, 1 ], mathmode := "Text", name := "ManSection", next := 177158, root := ~, start := 175725, stop := 177157 ), rec( content := "\n\n ", count := [ 5, 3, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, v", Name := "DigraphLongestD\ istanceFromVertex" ), content := 0, count := [ 5, 3, 4, 2 ], mathmode := "Text", name := "Oper", next := 177243, root := ~, start := 177179, stop := 177242 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r, or ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "K", next := 177285, root := ~, start := 177270, stop := 177284 ), rec( content := ".", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "Returns", next := 177296, root := ~, start := 177246, stop := 177295 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "A", next := 177334, root := ~, start := 177320, stop := 177333 ), rec( content := " is a di\ graph and ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "A", next := 177360, root := ~, start := 177352, stop := 177359 ), rec( content := " is a ve\ rtex in ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "A", next := 177390, root := ~, start := 177376, stop := 177389 ), rec( content := ",\n t\ hen this operation returns the length of the longest directed walk in\n ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "A", next := 177485, root := ~, start := 177471, stop := 177484 ), rec( content := " which b\ egins at vertex ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "A", next := 177517, root := ~, start := 177509, stop := 177516 ), rec( content := ". See s\ ection ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "Ref", next := 177582, root := ~, start := 177532, stop := 177581 ), rec( content := " for the\ definitions of directed\n walk, directed cycle, and loop.\n ", count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 4, 4 ], mathmode := "Text", name := "P", next := 177659, root := ~, start := 177655, stop := 177658 ), rec( content := "\n\n \ ", count := [ 5, 3, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n If there exists a directed w\ alk starting at vertex ", count := [ 5, 3, 4, 6 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "v", count := [ 5, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root :=\ ~ ) ], count := [ 5, 3, 4, 6 ], mathmode := "Text", name := "A", next := 1777\ 52, root := ~, start := 177744, stop := 177751 ), rec( content := "\n w\ hich traverses a loop or a directed cycle,\n then we consider there to \ be a walk of infinite length from ", count := [ 5, 3, 4, 6 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ re\ c( content := "v", count := [ 5, 3, 4, 6 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 5, 3, 4, 6 ], mathmode := "Text", name := "A", next\ := 177881, root := ~, start := 177873, stop := 177880 ), rec( content := "\n \ (realised by repeatedly traversing the loop/directed cycle),\n a\ nd so the result is ", count := [ 5, 3, 4, 6 ], mathmode := "Text", name := "P\ CDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := \ "infinity", count := [ 5, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 5, 3, 4, 6 ], mathmode := "Text", name := "K", next := \ 177995, root := ~, start := 177980, stop := 177994 ), rec( content := ".\n \ To disallow walks using loops, try using\n ", count := [ 5, 3, 4, 6\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ Oper := "DigraphRemoveLoops" ), content := 0, count := [ 5, 3, 4, 6 ], mathmo\ de := "Text", name := "Ref", next := 178086, root := ~, start := 178054, stop \ := 178085 ), rec( content := ":", count := [ 5, 3, 4, 6 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ \ 5, 3, 4, 7 ], mathmode := "Text", name := "P", next := 178091, root := ~, star\ t := 178087, stop := 178090 ), rec( content := "\n\n ", count := [ 5, 3\ , 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "DigraphLongestDistanceFromVertex(Digr\ aphRemoveLoops(", count := [ 5, 3, 4, 7 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digr\ aph", count := [ 5, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~\ ) ], count := [ 5, 3, 4, 7 ], mathmode := "Text", name := "A", next := 178170\ , root := ~, start := 178156, stop := 178169 ), rec( content := ",", count := \ [ 5, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attrib\ utes := rec( ), content := [ rec( content := "v", count := [ 5, 3, 4, 7 ], ma\ thmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 7 ], ma\ thmode := "Text", name := "A", next := 178179, root := ~, start := 178171, sto\ p := 178178 ), rec( content := "))", count := [ 5, 3, 4, 7 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 7 ], mathmode := "Tex\ t", name := "C", next := 178185, root := ~, start := 178101, stop := 178184 ), rec( cont\ ent := ".\n ", count := [ 5, 3, 4, 7 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 5, 3, 4, 6 ], name := "Item", next := 178200, root := ~, start := 177\ 678, stop := 178199 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n Otherwise, if all directed walks\n starting at vertex ", coun\ t := [ 5, 3, 4, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "v", count := [ 5, 3, 4, 9 ], \ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 9 ], math\ mode := "Text", name := "A", next := 178291, root := ~, start := 178283, stop \ := 178290 ), rec( content := " have finite length,\n then the length of\ the longest such walk is returned.\n ", count := [ 5, 3, 4, 9 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 9 ], name := "Ite\ m", next := 178387, root := ~, start := 178208, stop := 178386 ) ], count := [ 5, 3, 4, 5 ], mathmode := "Text", name := "List", next := 178399, root := ~, start := 177665, stop := 178398 ), rec( content := "\n\n \ Note that the result is ", count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "0\ ", count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "C", next := 178437, root := ~, start := 178429, stop := 178436 ), rec( content := " if and \ only if ", count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "A", next := 178461, root := ~, start := 178453, stop := 178460 ), rec( content := " is a si\ nk of\n ", count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "A", next := 178493, root := ~, start := 178479, stop := 178492 ), rec( content := ". See " , count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Sinks" ), content := 0, count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "Ref", next := 178526, root := ~, start := 178500, stop := 178525 ), rec( content := ".\n\n", count := [ 5, 3, 4, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2], [3, 4], [], [5], [], [6]]);\n\ngap> DigraphLongestDistanceFromVertex(D, 1);\n3\ngap> Di\ graphLongestDistanceFromVertex(D, 3);\n0\ngap> 3 in DigraphSinks(D);\ntrue\nga\ p> DigraphLongestDistanceFromVertex(D, 6);\ninfinity\n", count := [ 5, 3, 4, 12 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 4, 12 ], mathmode := "Text", name := "Example", next := 178838, root := ~, start := 178529, stop := 178837 ), rec( content := "\n ", count := [ 5, 3, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 4, 3 ], mathmode := "Text", name := "Description", next := 178855, root := ~, start := 177299, stop := 178854 ) ], count := [ 5, 3, 4, 1 ], mathmode := "Text", name := "ManSection", next := 178869, root := ~, start := 177164, stop := 178868 ), rec( content := "\n\n ", count := [ 5, 3, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex,\ distance", Label := "for a digraph, a pos int, and an int", Name := "DigraphDistance\ Set" ), content := 0, count := [ 5, 3, 5, 2 ], mathmode := "Text", name := "Oper", next := 179000, root := ~, start := 178890, stop := 178999 ), rec( attributes := rec( Arg := "digraph, vertex,\ distances", Label := "for a digraph, a pos int, and a list", Name := "DigraphDistance\ Set" ), content := 0, count := [ 5, 3, 5, 4 ], mathmode := "Text", name := "Oper", next := 179114, root := ~, start := 179003, stop := 179113 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ vertices", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "Returns", next := 179154, root := ~, start := 179117, stop := 179153 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation returns the list of all vertices in digraph ", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "A", next := 179248, root := ~, start := 179234, stop := 179247 ), rec( content := "\n su\ ch that the shortest distance to a vertex ", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "A", next := 179310, root := ~, start := 179297, stop := 179309 ), rec( content := " is\n \ ", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ istance", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "A", next := 179333, root := ~, start := 179318, stop := 179332 ), rec( content := " or is i\ n the list ", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ istances", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "A", next := 179368, root := ~, start := 179352, stop := 179367 ), rec( content := ". ", count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "P", next := 179374, root := ~, start := 179370, stop := 179373 ), rec( content := "\n\n \ ", count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "A", next := 179394, root := ~, start := 179380, stop := 179393 ), rec( content := " should \ be a digraph, ", count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "A", next := 179429, root := ~, start := 179416, stop := 179428 ), rec( content := " should \ be a positive\n integer, ", count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ istance", count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "A", next := 179479, root := ~, start := 179464, stop := 179478 ), rec( content := " should \ be a non-negative integer, and\n ", count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ istances", count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "A", next := 179538, root := ~, start := 179522, stop := 179537 ), rec( content := " should \ be a list of non-negative integers.\n\n ", count := [ 5, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2], [3], [1, 4], [1, 3]]);\n\ngap> DigraphDistanceSet(D, 2, [1, 2]);\n[ 3, 1, 4 ]\ngap> Dig\ raphDistanceSet(D, 3, 1);\n[ 1, 4 ]\ngap> DigraphDistanceSet(D, 2, 0);\n[ 2 ]\ \n", count := [ 5, 3, 5, 7 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 7 ], mathmode := "Text", name := "Example", next := 179845, root := ~, start := 179587, stop := 179844 ), rec( content := "\n ", count := [ 5, 3, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 5, 5 ], mathmode := "Text", name := "Description", next := 179862, root := ~, start := 179157, stop := 179861 ) ], count := [ 5, 3, 5, 1 ], mathmode := "Text", name := "ManSection", next := 179876, root := ~, start := 178875, stop := 179875 ), rec( content := "\n\n ", count := [ 5, 3, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphGirth" ) , content := 0, count := [ 5, 3, 6, 2 ], mathmode := "Text", name := "Attr", next := 179938, root := ~, start := 179897, stop := 179937 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r, or ", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "K", next := 179980, root := ~, start := 179965, stop := 179979 ), rec( content := ".", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "Returns", next := 179991, root := ~, start := 179941, stop := 179990 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s attribute returns the ", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ irth", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "E", next := 180051, root := ~, start := 180039, stop := 180050 ), rec( content := " of the \ digraph ", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "A", next := 180081, root := ~, start := 180067, stop := 180080 ), rec( content := ".\n T\ he ", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ irth", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "E", next := 180103, root := ~, start := 180091, stop := 180102 ), rec( content := " of a di\ graph is the length of its shortest simple circuit.\n See section ", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "Ref", next := 180223, root := ~, start := 180179, stop := 180222 ), rec( content := " for the\ definitions\n of simple circuit, directed cycle, and loop.\n ", count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "P", next := 180301, root := ~, start := 180297, stop := 180300 ), rec( content := "\n\n \ If ", count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "A", next := 180324, root := ~, start := 180310, stop := 180323 ), rec( content := " has no \ directed cycles, then this function will return\n ", count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "K", next := 180399, root := ~, start := 180384, stop := 180398 ), rec( content := ". If ", count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "A", next := 180419, root := ~, start := 180405, stop := 180418 ), rec( content := " contain\ s a loop, then this function will\n return ", count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "C", next := 180480, root := ~, start := 180472, stop := 180479 ), rec( content := ".\n " , count := [ 5, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "P", next := 180490, root := ~, start := 180486, stop := 180489 ), rec( content := "\n\n \ In the worst case, the method used in this function is a version of the\n F\ loyd-Warshall algorithm, and has complexity ", count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (", count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 5, 3, 6, 5 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 5 ], mathmode := \ "Text", name := "A", next := 180630, root := ~, start := 180622, stop := 18062\ 9 ), rec( content := " ^ 3)", count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "C", next := 180639, root := ~, start := 180617, stop := 180638 ), rec( content := ", where\\ n ", count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "A", next := 180659, root := ~, start := 180651, stop := 180658 ), rec( content := " is the \ number of vertices in ", count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "A", next := 180703, root := ~, start := 180689, stop := 180702 ), rec( content := ". If th\ e digraph has\n known automorphisms [see ", count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Group" ), content := 0, count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "Ref", next := 180780, root := ~, start := 180754, stop := 180779 ), rec( content := "], then \ the performance\n is likely to be better.\n ", count := [ 5, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 6, 6 ], mathmode := "Text", name := "P", next := 180840, root := ~, start := 180836, stop := 180839 ), rec( content := "\n\n \ For symmetric digraphs, see also ", count := [ 5, 3, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ UndirectedGirth" ), content := 0, count := [ 5, 3, 6, 6 ], mathmode := "Text", name := "Ref", next := 180915, root := ~, start := 180879, stop := 180914 ), rec( content := ". ", count := [ 5, 3, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 6, 7 ], mathmode := "Text", name := "P", next := 180921, root := ~, start := 180917, stop := 180920 ), rec( content := "\n ", count := [ 5, 3, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1], [1]]);\n\ \ngap> DigraphGirth(D);\n1\ngap> D := Digraph([[2, 3], [3], [4], []]);\n\ngap> DigraphGirth(D);\ninfinity\ngap> \ D := Digraph([[2, 3], [3], [4], [1]]);\n\ngap> DigraphGirth(D);\n3\ngap> D := GeneralisedPetersenGraph(IsMutable\ Digraph, 6, 2);\n\ngap> DigraphGir\ th(D);\n2\n", count := [ 5, 3, 6, 8 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 8 ], mathmode := "Text", name := "Example", next := 181419, root := ~, start := 180926, stop := 181418 ), rec( content := "\n ", count := [ 5, 3, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 6, 3 ], mathmode := "Text", name := "Description", next := 181436, root := ~, start := 179994, stop := 181435 ) ], count := [ 5, 3, 6, 1 ], mathmode := "Text", name := "ManSection", next := 181450, root := ~, start := 179882, stop := 181449 ), rec( content := "\n\n ", count := [ 5, 3, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphOddGirth\ " ), content := 0, count := [ 5, 3, 7, 2 ], mathmode := "Text", name := "Attr", next := 181515, root := ~, start := 181471, stop := 181514 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r, or ", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "K", next := 181557, root := ~, start := 181542, stop := 181556 ), rec( content := ".", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "Returns", next := 181568, root := ~, start := 181518, stop := 181567 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s attribute returns the ", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ dd girth", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "E", next := 181632, root := ~, start := 181616, stop := 181631 ), rec( content := " of the \ digraph ", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "A", next := 181662, root := ~, start := 181648, stop := 181661 ), rec( content := ".\n T\ he ", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ dd girth", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "E", next := 181688, root := ~, start := 181672, stop := 181687 ), rec( content := " of a di\ graph is the length of its shortest simple\n circuit of odd length. See Se\ ction ", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "Ref", next := 181827, root := ~, start := 181779, stop := 181826 ), rec( content := " for the\ definitions of simple circuit, directed\n cycle, and loop.\n ", count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "P", next := 181905, root := ~, start := 181901, stop := 181904 ), rec( content := "\n\n \ If ", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "A", next := 181928, root := ~, start := 181914, stop := 181927 ), rec( content := " has no \ directed cycles of odd length, then this function\n will return ", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "K", next := 182017, root := ~, start := 182002, stop := 182016 ), rec( content := ", even i\ f ", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "A", next := 182041, root := ~, start := 182027, stop := 182040 ), rec( content := " has a d\ irected cycle\n of even length. If ", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "A", next := 182101, root := ~, start := 182087, stop := 182100 ), rec( content := " contain\ s a loop, then this function\n will return ", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "C", next := 182162, root := ~, start := 182154, stop := 182161 ), rec( content := ".\n " , count := [ 5, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 7, 5 ], mathmode := "Text", name := "P", next := 182172, root := ~, start := 182168, stop := 182171 ), rec( content := "\n\n \ See also ", count := [ 5, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Girth" ), content := 0, count := [ 5, 3, 7, 5 ], mathmode := "Text", name := "Ref", next := 182213, root := ~, start := 182187, stop := 182212 ), rec( content := ". ", count := [ 5, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 7, 6 ], mathmode := "Text", name := "P", next := 182219, root := ~, start := 182215, stop := 182218 ), rec( content := "\n ", count := [ 5, 3, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2], [3, 1], [1]]);\n\ngap> DigraphOddGirth(D);\n3\ngap> D := CycleDigraph(4);\n\ngap> DigraphOddGirth(D);\ninfinity\ngap> D := D\ igraph([[2], [3], [], [3], [4]]);\n\ngap> DigraphOddGirth(D);\ninfinity\ngap> D := CycleDigraph(IsMutableDigraph\ , 4);\n\ngap> DigraphDisjointUnion(D\ , CycleDigraph(5));\n\ngap> DigraphO\ ddGirth(D);\n5\n", count := [ 5, 3, 7, 7 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 7 ], mathmode := "Text", name := "Example", next := 182799, root := ~, start := 182224, stop := 182798 ), rec( content := "\n ", count := [ 5, 3, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 7, 3 ], mathmode := "Text", name := "Description", next := 182816, root := ~, start := 181571, stop := 182815 ) ], count := [ 5, 3, 7, 1 ], mathmode := "Text", name := "ManSection", next := 182830, root := ~, start := 181456, stop := 182829 ), rec( content := "\n\n ", count := [ 5, 3, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphUndirect\ edGirth" ), content := 0, count := [ 5, 3, 8, 2 ], mathmode := "Text", name := "Attr", next := 182902, root := ~, start := 182851, stop := 182901 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r or ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "K", next := 182943, root := ~, start := 182928, stop := 182942 ), rec( content := ".", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "Returns", next := 182954, root := ~, start := 182905, stop := 182953 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "A", next := 182992, root := ~, start := 182978, stop := 182991 ), rec( content := " is a sy\ mmetric digraph, then this function returns the\n girth of ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "A", next := 183075, root := ~, start := 183061, stop := 183074 ), rec( content := " when tr\ eated as an undirected graph (i.e. each pair\n of edges ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i, j]", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "M", next := 183154, root := ~, start := 183141, stop := 183153 ), rec( content := " and ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ j, i]", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "M", next := 183172, root := ~, start := 183159, stop := 183171 ), rec( content := " is trea\ ted as a single edge between\n ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "M", next := 183221, root := ~, start := 183213, stop := 183220 ), rec( content := " and ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "M", next := 183234, root := ~, start := 183226, stop := 183233 ), rec( content := "). ", count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 8, 4 ], mathmode := "Text", name := "P", next := 183241, root := ~, start := 183237, stop := 183240 ), rec( content := "\n\n \ The ", count := [ 5, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ irth", count := [ 5, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 4 ], mathmode := "Text", name := "E", next := 183263, root := ~, start := 183251, stop := 183262 ), rec( content := " of an u\ ndirected graph is the length of its shortest simple\n cycle, i.e. the shor\ test non-trivial path starting and ending at the same\n vertex and passing \ through no vertex or edge more than once. ", count := [ 5, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 8, 5 ], mathmode := "Text", name := "P", next := 183471, root := ~, start := 183467, stop := 183470 ), rec( content := "\n\n \ If ", count := [ 5, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 5 ], mathmode := "Text", name := "A", next := 183494, root := ~, start := 183480, stop := 183493 ), rec( content := " has no \ cycles, then this function will return\n ", count := [ 5, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 5, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 5 ], mathmode := "Text", name := "K", next := 183560, root := ~, start := 183545, stop := 183559 ), rec( content := ". ", count := [ 5, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 8, 6 ], mathmode := "Text", name := "P", next := 183566, root := ~, start := 183562, stop := 183565 ), rec( content := "\n ", count := [ 5, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 4], [1, 3], [2, 4], [1, 3]]);\n\ngap> DigraphUndirectedGirth(D);\n4\ngap> D := Digraph([\ [2], [1, 3], [2]]);\n\ngap> Digrap\ hUndirectedGirth(D);\ninfinity\ngap> D := Digraph([[1], [], [4], [3]]);\n\ngap> DigraphUndirectedGirth(D);\n1\ng\ ap> D := GeneralisedPetersenGraph(IsMutableDigraph, 9, 2);\n\ngap> DigraphUndirectedGirth(D);\n5\n", count := [ 5, 3, 8, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 8, 7 ], mathmode := "Text", name := "Example", next := 184118, root := ~, start := 183571, stop := 184117 ), rec( content := "\n ", count := [ 5, 3, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 8, 3 ], mathmode := "Text", name := "Description", next := 184135, root := ~, start := 182957, stop := 184134 ) ], count := [ 5, 3, 8, 1 ], mathmode := "Text", name := "ManSection", next := 184149, root := ~, start := 182836, stop := 184148 ), rec( content := "\n\n ", count := [ 5, 3, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphConnecte\ dComponents" ), content := 0, count := [ 5, 3, 9, 2 ], mathmode := "Text", name := "Attr", next := 184225, root := ~, start := 184170, stop := 184224 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphNrConnec\ tedComponents" ), content := 0, count := [ 5, 3, 9, 4 ], mathmode := "Text", name := "Attr", next := 184285, root := ~, start := 184228, stop := 184284 ), rec( attributes := rec( ), content := [ rec( content := "A record.\ ", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "Returns", next := 184316, root := ~, start := 184288, stop := 184315 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the record ", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "w\ cc", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "C", next := 184380, root := ~, start := 184370, stop := 184379 ), rec( content := " corresp\ onding to the weakly\n connected components of the digraph ", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "A", next := 184463, root := ~, start := 184449, stop := 184462 ), rec( content := ". Two v\ ertices of\n ", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "A", next := 184500, root := ~, start := 184486, stop := 184499 ), rec( content := " are in \ the same weakly connected component whenever they are\n equal, or there exi\ sts a directed path (ignoring the orientation of edges)\n between them. Mo\ re formally, two vertices are in the same weakly connected\n component of " , count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "A", next := 184752, root := ~, start := 184738, stop := 184751 ), rec( content := " if and \ only if they are in the same strongly\n connected component (see ", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ StronglyConnectedComponents" ), content := 0, count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "Ref", next := 184875, root := ~, start := 184827, stop := 184874 ), rec( content := ")\n o\ f the ", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ SymmetricClosure" ), content := 0, count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "Ref", next := 184925, root := ~, start := 184888, stop := 184924 ), rec( content := " of ", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "A", next := 184943, root := ~, start := 184929, stop := 184942 ), rec( content := ". ", count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 9, 6 ], mathmode := "Text", name := "P", next := 184950, root := ~, start := 184946, stop := 184949 ), rec( content := "\n\n \ The set of weakly connected components is a partition of\n the vertex set o\ f ", count := [ 5, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 6 ], mathmode := "Text", name := "A", next := 185049, root := ~, start := 185035, stop := 185048 ), rec( content := ". ", count := [ 5, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "P", next := 185055, root := ~, start := 185051, stop := 185054 ), rec( content := "\n\n \ The record ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "w\ cc", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "C", next := 185082, root := ~, start := 185072, stop := 185081 ), rec( content := " has 2 c\ omponents: ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omps", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "C", next := 185113, root := ~, start := 185101, stop := 185112 ), rec( content := " and ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ d", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "C", next := 185127, root := ~, start := 185118, stop := 185126 ), rec( content := ".\n T\ he component ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omps", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "C", next := 185159, root := ~, start := 185147, stop := 185158 ), rec( content := " is a li\ st of the weakly connected components\n of ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "A", next := 185227, root := ~, start := 185213, stop := 185226 ), rec( content := " (each o\ f which is a list of vertices).\n The component ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ d", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "C", next := 185294, root := ~, start := 185285, stop := 185293 ), rec( content := " is a li\ st such that the vertex ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "C", next := 185334, root := ~, start := 185326, stop := 185333 ), rec( content := " is an\n\ element of the weakly connected component ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omps[id[i]]", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "C", next := 185406, root := ~, start := 185387, stop := 185405 ), rec( content := ". ", count := [ 5, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "P", next := 185412, root := ~, start := 185408, stop := 185411 ), rec( content := "\n\n \ The method used in this function has complexity ", count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m+n)", count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "M", next := 185480, root := ~, start := 185467, stop := 185479 ), rec( content := ", where\\ n ", count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "M", next := 185500, root := ~, start := 185492, stop := 185499 ), rec( content := " is the \ number of edges and\n ", count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "M", next := 185540, root := ~, start := 185532, stop := 185539 ), rec( content := " is the \ number of vertices in the digraph. ", count := [ 5, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "P", next := 185587, root := ~, start := 185583, stop := 185586 ), rec( content := "\n\n \ ", count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphNrConnectedComponents(", count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ) ], count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "A", next := 1856\ 39, root := ~, start := 185625, stop := 185638 ), rec( content := ")", count := [ 5, 3, 9, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "C", next := 185644, root := ~, start := 185593, stop := 185643 ), rec( content := " is simp\ ly a shortcut\n for ", count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "L\ ength(DigraphConnectedComponents(", count := [ 5, 3, 9, 9 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "digraph", count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "A", next := 1857\ 25, root := ~, start := 185711, stop := 185724 ), rec( content := ").comps)", count := [ 5, 3, 9, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "C", next := 185737, root := ~, start := 185674, stop := 185736 ), rec( content := ",\n a\ nd is no more efficient.\n\n ", count := [ 5, 3, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[2], [3, 1], []]);\n\ngap> DigraphConnectedComponents(gr);\nrec( comps := [ [ 1, 2, 3 ] ], \ id := [ 1, 1, 1 ] )\ngap> gr := Digraph([[1], [1, 2], []]);\n\ngap> DigraphConnectedComponents(gr);\nrec( comps \ := [ [ 1, 2 ], [ 3 ] ], id := [ 1, 1, 2 ] )\ngap> DigraphNrConnectedComponents\ (gr);\n2\ngap> gr := EmptyDigraph(0);\n\ngap> DigraphConnectedComponents(gr);\nrec( comps := [ ], id := [ ] )\nga\ p> D := CycleDigraph(IsMutableDigraph, 2);\n\ngap> G := CycleDigraph(3);\n\ngap> DigraphDisjointUnion(D, G);\n\ngap> DigraphConnectedComponents(D);\nrec( comps := [ [ 1, 2 ], [ 3, 4, 5 ] \ ], id := [ 1, 1, 2, 2, 2 ] )\n", count := [ 5, 3, 9, 10 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 10 ], mathmode := "Text", name := "Example", next := 186671, root := ~, start := 185774, stop := 186670 ), rec( content := "\n ", count := [ 5, 3, 9, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 9, 5 ], mathmode := "Text", name := "Description", next := 186688, root := ~, start := 184319, stop := 186687 ) ], count := [ 5, 3, 9, 1 ], mathmode := "Text", name := "ManSection", next := 186702, root := ~, start := 184155, stop := 186701 ), rec( content := "\n\n ", count := [ 5, 3, 9, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex" , Name := "DigraphConnecte\ dComponent" ), content := 0, count := [ 5, 3, 10, 2 ], mathmode := "Text", name := "Oper", next := 186785, root := ~, start := 186723, stop := 186784 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ vertices.", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "Returns", next := 186826, root := ~, start := 186788, stop := 186825 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "A", next := 186863, root := ~, start := 186850, stop := 186862 ), rec( content := " is a ve\ rtex in the digraph ", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "A", next := 186905, root := ~, start := 186891, stop := 186904 ), rec( content := ", then\n\ this operation returns the connected component of ", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "A", next := 186979, root := ~, start := 186966, stop := 186978 ), rec( content := "\n in\ ", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "A", next := 187001, root := ~, start := 186987, stop := 187000 ), rec( content := ".\n S\ ee ", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ ConnectedComponents" ), content := 0, count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "Ref", next := 187051, root := ~, start := 187011, stop := 187050 ), rec( content := " for mor\ e information.\n ", count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3], [2], [1, 2], [4]]);\n\ngap> DigraphConnectedComponent(D, 3);\n[ 1, 2, 3 ]\ngap> Digraph\ ConnectedComponent(D, 2);\n[ 1, 2, 3 ]\ngap> DigraphConnectedComponent(D, 4);\ \n[ 4 ]\n", count := [ 5, 3, 10, 4 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 10, 4 ], mathmode := "Text", name := "Example", next := 187343, root := ~, start := 187078, stop := 187342 ), rec( content := "\n ", count := [ 5, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 10, 3 ], mathmode := "Text", name := "Description", next := 187360, root := ~, start := 186829, stop := 187359 ) ], count := [ 5, 3, 10, 1 ], mathmode := "Text", name := "ManSection", next := 187374, root := ~, start := 186708, stop := 187373 ), rec( content := "\n\n ", count := [ 5, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphStrongly\ ConnectedComponents" ), content := 0, count := [ 5, 3, 11, 2 ], mathmode := "Text", name := "Attr", next := 187458, root := ~, start := 187395, stop := 187457 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphNrStrong\ lyConnectedComponents" ), content := 0, count := [ 5, 3, 11, 4 ], mathmode := "Text", name := "Attr", next := 187526, root := ~, start := 187461, stop := 187525 ), rec( attributes := rec( ), content := [ rec( content := "A record.\ ", count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "Returns", next := 187557, root := ~, start := 187529, stop := 187556 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the record ", count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ cc", count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "C", next := 187621, root := ~, start := 187611, stop := 187620 ), rec( content := " corresp\ onding to the strongly\n connected components of the digraph ", count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "A", next := 187706, root := ~, start := 187692, stop := 187705 ), rec( content := ". Two v\ ertices of\n ", count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "A", next := 187743, root := ~, start := 187729, stop := 187742 ), rec( content := " are in \ the same strongly connected component whenever they\n are equal, or there i\ s a directed path from each vertex to the other. The\n set of strongly con\ nected components is a partition of the vertex set of\n ", count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "A", next := 187977, root := ~, start := 187963, stop := 187976 ), rec( content := ".\n " , count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "P", next := 187987, root := ~, start := 187983, stop := 187986 ), rec( content := "\n\n \ The record ", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ cc", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "C", next := 188014, root := ~, start := 188004, stop := 188013 ), rec( content := " has 2 c\ omponents: ", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omps", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "C", next := 188045, root := ~, start := 188033, stop := 188044 ), rec( content := " and ", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ d", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "C", next := 188059, root := ~, start := 188050, stop := 188058 ), rec( content := ".\n T\ he component ", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omps", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "C", next := 188091, root := ~, start := 188079, stop := 188090 ), rec( content := " is a li\ st of the strongly connected components\n of ", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "A", next := 188160, root := ~, start := 188146, stop := 188159 ), rec( content := " (each o\ f which is a list of vertices).\n The component ", count := [ 5, 3, 11, 6 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ d", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "C", next := 188227, root := ~, start := 188218, stop := 188226 ), rec( content := " is a li\ st such that the vertex ", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "C", next := 188267, root := ~, start := 188259, stop := 188266 ), rec( content := " is an\n\ element of the strongly connected component ", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omps[id[i]]", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "C", next := 188341, root := ~, start := 188322, stop := 188340 ), rec( content := ". ", count := [ 5, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "P", next := 188347, root := ~, start := 188343, stop := 188346 ), rec( content := "\n\n \ The method used in this function is a non-recursive version of Gabow's\n Al\ gorithm ", count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "Gab00" ) , content := 0, count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "Cite", next := 188457, root := ~, start := 188438, stop := 188456 ), rec( content := " and has\ complexity ", count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m+n)", count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "M", next := 188490, root := ~, start := 188477, stop := 188489 ), rec( content := " where\n\ ", count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "M", next := 188509, root := ~, start := 188501, stop := 188508 ), rec( content := " is the \ number of edges (counting multiple edges as one) and\n ", count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "M", next := 188582, root := ~, start := 188574, stop := 188581 ), rec( content := " is the \ number of vertices in the digraph. ", count := [ 5, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "P", next := 188629, root := ~, start := 188625, stop := 188628 ), rec( content := "\n\n \ ", count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "D\ igraphNrStronglyConnectedComponents(", count := [ 5, 3, 11, 8 ], mathmode := "\ Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph", count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "A", next := 1886\ 89, root := ~, start := 188675, stop := 188688 ), rec( content := ")", count := [ 5, 3, 11, 8 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "C", next := 188694, root := ~, start := 188635, stop := 188693 ), rec( content := " is simp\ ly a\n shortcut for\n ", count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "L\ ength(DigraphStronglyConnectedComponents(", count := [ 5, 3, 11, 8 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph", count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "A", next := 1887\ 87, root := ~, start := 188773, stop := 188786 ), rec( content := ").comps)", count := [ 5, 3, 11, 8 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "C", next := 188799, root := ~, start := 188728, stop := 188798 ), rec( content := ",\n a\ nd is no more efficient.\n\n ", count := [ 5, 3, 11, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[2], [3, 1], []]);\n\ngap> DigraphStronglyConnectedComponents(gr);\nrec( comps := [ [ 3 ], \ [ 1, 2 ] ], id := [ 2, 2, 1 ] )\ngap> DigraphNrStronglyConnectedComponents(gr)\ ;\n2\ngap> D := DigraphDisjointUnion(CycleDigraph(4), CycleDigraph(5));\n\ngap> DigraphStronglyConnectedComponen\ ts(D);\nrec( comps := [ [ 1, 2, 3, 4 ], [ 5, 6, 7, 8, 9 ] ], \n id := [ 1, 1,\ 1, 1, 2, 2, 2, 2, 2 ] )\ngap> DigraphNrStronglyConnectedComponents(D);\n2\nga\ p> D := CycleDigraph(IsMutableDigraph, 2);\n\ngap> G := CycleDigraph(3);\n\ngap> DigraphDisjointUnion(D, G);\n\ngap> DigraphStronglyConnectedComponents(D);\nrec( comps := [ [ 1, 2 ], [ 3,\ 4, 5 ] ], id := [ 1, 1, 2, 2, 2 ] )\n", count := [ 5, 3, 11, 9 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 11, 9 ], mathmode := "Text", name := "Example", next := 189742, root := ~, start := 188836, stop := 189741 ), rec( content := "\n ", count := [ 5, 3, 11, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 11, 5 ], mathmode := "Text", name := "Description", next := 189759, root := ~, start := 187560, stop := 189758 ) ], count := [ 5, 3, 11, 1 ], mathmode := "Text", name := "ManSection", next := 189773, root := ~, start := 187380, stop := 189772 ), rec( content := "\n\n ", count := [ 5, 3, 11, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex" , Name := "DigraphStrongly\ ConnectedComponent" ), content := 0, count := [ 5, 3, 12, 2 ], mathmode := "Text", name := "Oper", next := 189864, root := ~, start := 189794, stop := 189863 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ vertices.", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "Returns", next := 189905, root := ~, start := 189867, stop := 189904 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "A", next := 189942, root := ~, start := 189929, stop := 189941 ), rec( content := " is a ve\ rtex in the digraph ", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "A", next := 189984, root := ~, start := 189970, stop := 189983 ), rec( content := ", then\n\ this operation returns the strongly connected component of ", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "A", next := 190067, root := ~, start := 190054, stop := 190066 ), rec( content := "\n in\ ", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "A", next := 190089, root := ~, start := 190075, stop := 190088 ), rec( content := ".\n S\ ee ", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ StronglyConnectedComponents" ), content := 0, count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "Ref", next := 190147, root := ~, start := 190099, stop := 190146 ), rec( content := " for mor\ e information.\n ", count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3], [2], [1, 2], [3]]);\n\ngap> DigraphStronglyConnectedComponent(D, 3);\n[ 1, 3 ]\ngap> Di\ graphStronglyConnectedComponent(D, 2);\n[ 2 ]\ngap> DigraphStronglyConnectedCo\ mponent(D, 4);\n[ 4 ]\n", count := [ 5, 3, 12, 4 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 12, 4 ], mathmode := "Text", name := "Example", next := 190454, root := ~, start := 190174, stop := 190453 ), rec( content := "\n ", count := [ 5, 3, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 12, 3 ], mathmode := "Text", name := "Description", next := 190471, root := ~, start := 189908, stop := 190470 ) ], count := [ 5, 3, 12, 1 ], mathmode := "Text", name := "ManSection", next := 190485, root := ~, start := 189779, stop := 190484 ), rec( content := "\n\n ", count := [ 5, 3, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphBicompon\ ents" ), content := 0, count := [ 5, 3, 13, 2 ], mathmode := "Text", name := "Attr", next := 190554, root := ~, start := 190506, stop := 190553 ), rec( attributes := rec( ), content := [ rec( content := "A pair of\ lists of vertices, or ", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "K", next := 190609, root := ~, start := 190598, stop := 190608 ), rec( content := ".", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "Returns", next := 190620, root := ~, start := 190557, stop := 190619 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "A", next := 190658, root := ~, start := 190644, stop := 190657 ), rec( content := " is a bi\ partite digraph, i.e. if it satisfies ", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsBipar\ titeDigraph" ), content := 0, count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "Ref", next := 190742, root := ~, start := 190704, stop := 190741 ), rec( content := ", then " , count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphBicomponents", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "C", next := 190775, root := ~, start := 190749, stop := 190774 ), rec( content := " returns\ a\n pair of bicomponents of ", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "A", next := 190828, root := ~, start := 190814, stop := 190827 ), rec( content := ". Otherw\ ise,\n ", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphBicomponents", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "C", next := 190871, root := ~, start := 190845, stop := 190870 ), rec( content := " returns\ ", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "K", next := 190891, root := ~, start := 190880, stop := 190890 ), rec( content := ".", count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "P", next := 190896, root := ~, start := 190892, stop := 190895 ), rec( content := "\n\n \ For a bipartite digraph, the vertices can be partitioned into two non-empty\n \ sets such that the source and range of any edge are in distinct sets. The\n\ parts of this partition are called ", count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "b\ icomponents", count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "E", next := 191114, root := ~, start := 191095, stop := 191113 ), rec( content := " of ", count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "A", next := 191132, root := ~, start := 191118, stop := 191131 ), rec( content := ".\n E\ quivalently, a pair of bicomponents of ", count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "A", next := 191192, root := ~, start := 191178, stop := 191191 ), rec( content := " consist\ s of the\n color-classes of a 2-coloring of ", count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "A", next := 191260, root := ~, start := 191246, stop := 191259 ), rec( content := ". ", count := [ 5, 3, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 13, 5 ], mathmode := "Text", name := "P", next := 191266, root := ~, start := 191262, stop := 191265 ), rec( content := "\n\n \ For a bipartite digraph with at least 3 vertices, there is a unique pair of\n \ bicomponents of bipartite if and only if the digraph is connected. See ", count := [ 5, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsConne\ ctedDigraph" ), content := 0, count := [ 5, 3, 13, 5 ], mathmode := "Text", name := "Ref", next := 191461, root := ~, start := 191423, stop := 191460 ), rec( content := " for mor\ e information.\n ", count := [ 5, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(3);\n\ngap> D\ igraphBicomponents(D);\nfail\ngap> D := ChainDigraph(5);\n\ngap> DigraphBicomponents(D);\n[ [ 1, 3, 5 ], [ 2, 4 ] ]\ \ngap> D := Digraph([[5], [1, 4], [5], [5], []]);\n\ngap> DigraphBicomponents(D);\n[ [ 1, 3, 4 ], [ 2, 5 ] ]\nga\ p> D := CompleteBipartiteDigraph(IsMutableDigraph, 2, 3);\n\ngap> DigraphBicomponents(D);\n[ [ 1, 2 ], [ 3, 4, 5 \ ] ]\n", count := [ 5, 3, 13, 6 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 6 ], mathmode := "Text", name := "Example", next := 192054, root := ~, start := 191488, stop := 192053 ), rec( content := "\n ", count := [ 5, 3, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 13, 3 ], mathmode := "Text", name := "Description", next := 192071, root := ~, start := 190623, stop := 192070 ) ], count := [ 5, 3, 13, 1 ], mathmode := "Text", name := "ManSection", next := 192085, root := ~, start := 190491, stop := 192084 ), rec( content := "\n\n ", count := [ 5, 3, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "ArticulationPoi\ nts" ), content := 0, count := [ 5, 3, 14, 2 ], mathmode := "Text", name := "Attr", next := 192153, root := ~, start := 192106, stop := 192152 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ vertices.", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "Returns", next := 192194, root := ~, start := 192156, stop := 192193 ), rec( attributes := rec( ), content := [ rec( content := "\n\n A\ connected digraph is ", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "b\ iconnected", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "E", next := 192257, root := ~, start := 192239, stop := 192256 ), rec( content := " if it i\ s still connected (in the\n sense of ", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsConne\ ctedDigraph" ), content := 0, count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "Ref", next := 192336, root := ~, start := 192304, stop := 192335 ), rec( content := ") when a\ ny vertex is removed. \n If the digraph ", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "A", next := 192400, root := ~, start := 192386, stop := 192399 ), rec( content := " is not \ biconnected but is connected, then any\n vertex ", count := [ 5, 3, 14, 3 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "C", next := 192466, root := ~, start := 192458, stop := 192465 ), rec( content := " of ", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "A", next := 192484, root := ~, start := 192470, stop := 192483 ), rec( content := " whose r\ emoval makes the resulting digraph\n disconnected is called an ", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ rticulation point", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "E", next := 192582, root := ~, start := 192557, stop := 192581 ), rec( content := ".", count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "P", next := 192587, root := ~, start := 192583, stop := 192586 ), rec( content := "\n\n \ ", count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "A\ rticulationPoints", count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "C", next := 192618, root := ~, start := 192593, stop := 192617 ), rec( content := " returns\ a list of the articulation points of\n ", count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "A", next := 192682, root := ~, start := 192668, stop := 192681 ), rec( content := ", if any\ , and, in particular, returns the empty list if\n ", count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "A", next := 192756, root := ~, start := 192742, stop := 192755 ), rec( content := " is not \ connected. ", count := [ 5, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 14, 5 ], mathmode := "Text", name := "P", next := 192779, root := ~, start := 192775, stop := 192778 ), rec( content := "\n\n \ Multiple edges and loops are ignored by this method. ", count := [ 5, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "P", next := 192842, root := ~, start := 192838, stop := 192841 ), rec( content := "\n\n \ The method used in this operation has complexity ", count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m+n)", count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "M", next := 192910, root := ~, start := 192897, stop := 192909 ), rec( content := " where\n\ ", count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "M", next := 192929, root := ~, start := 192921, stop := 192928 ), rec( content := " is the \ number of edges (counting multiple edges as one, and not\n counting loops) \ and ", count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "M", next := 193026, root := ~, start := 193018, stop := 193025 ), rec( content := " is the \ number of vertices in the digraph.\n\n See also ", count := [ 5, 3, 14, 6 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsBicon\ nectedDigraph" ), content := 0, count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "Ref", next := 193117, root := ~, start := 193083, stop := 193116 ), rec( content := ".\n", count := [ 5, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> ArticulationPoints(CycleDigraph(5));\n[ ]\ngap> D := Digraph([[2, 7], [\ 3, 5], [4], [2], [6], [1], []]);;\ngap> ArticulationPoints(D);\n[ 2, 1 ]\ngap>\ ArticulationPoints(ChainDigraph(5));\n[ 4, 3, 2 ]\ngap> ArticulationPoints(Nu\ llDigraph(5));\n[ ]\ngap> D := ChainDigraph(IsMutableDigraph, 4);\n\ngap> ArticulationPoints(D);\n[ 3, 2 ]\n", count := [ 5, 3, 14, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 14, 7 ], mathmode := "Text", name := "Example", next := 193522, root := ~, start := 193119, stop := 193521 ), rec( content := "\n ", count := [ 5, 3, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 14, 3 ], mathmode := "Text", name := "Description", next := 193539, root := ~, start := 192197, stop := 193538 ) ], count := [ 5, 3, 14, 1 ], mathmode := "Text", name := "ManSection", next := 193553, root := ~, start := 192091, stop := 193552 ), rec( content := "\n\n ", count := [ 5, 3, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphPeriod" ), content := 0, count := [ 5, 3, 15, 2 ], mathmode := "Text", name := "Attr", next := 193616, root := ~, start := 193574, stop := 193615 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r.", count := [ 5, 3, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 15, 3 ], mathmode := "Text", name := "Returns", next := 193649, root := ~, start := 193619, stop := 193648 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the period of the digraph ", count := [ 5, 3, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 15, 3 ], mathmode := "Text", name := "A", next := 193732, root := ~, start := 193718, stop := 193731 ), rec( content := ".", count := [ 5, 3, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "P", next := 193737, root := ~, start := 193733, stop := 193736 ), rec( content := "\n\n \ If a digraph ", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "A", next := 193770, root := ~, start := 193756, stop := 193769 ), rec( content := " has at \ least one directed cycle, then the period\n is the greatest positive intege\ r which divides the lengths of all directed\n cycles of ", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "A", next := 193927, root := ~, start := 193913, stop := 193926 ), rec( content := ". If ", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "A", next := 193947, root := ~, start := 193933, stop := 193946 ), rec( content := " has no \ directed cycles, then\n this function returns ", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "0\ ", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "M", next := 194011, root := ~, start := 194003, stop := 194010 ), rec( content := ". See s\ ection ", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "Ref", next := 194076, root := ~, start := 194026, stop := 194075 ), rec( content := " for the\ definition of a directed cycle. ", count := [ 5, 3, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "P", next := 194121, root := ~, start := 194117, stop := 194120 ), rec( content := "\n\n \ A digraph with a period of ", count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "M", next := 194162, root := ~, start := 194154, stop := 194161 ), rec( content := " is said\ to be ", count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ periodic", count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "E", next := 194193, root := ~, start := 194177, stop := 194192 ), rec( content := ". See\n\ ", count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsAperi\ odicDigraph" ), content := 0, count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "Ref", next := 194236, root := ~, start := 194204, stop := 194235 ), rec( content := ". ", count := [ 5, 3, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 15, 6 ], mathmode := "Text", name := "P", next := 194242, root := ~, start := 194238, stop := 194241 ), rec( content := "\n ", count := [ 5, 3, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[6], [1], [2], [3], [4, 4], [5]]);\n\ngap> DigraphPeriod(D);\n6\ngap> D := Digraph([[2]\ , [3, 5], [4], [5], [1, 2]]);\n\ng\ ap> DigraphPeriod(D);\n1\ngap> D := ChainDigraph(2);\n\ngap> DigraphPeriod(D);\n0\ngap> IsAcyclicDigraph(D);\ntrue\ \ngap> D := GeneralisedPetersenGraph(IsMutableDigraph, 5, 2);\n\ngap> DigraphPeriod(D);\n1\n", count := [ 5, 3, 15, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 15, 7 ], mathmode := "Text", name := "Example", next := 194785, root := ~, start := 194247, stop := 194784 ), rec( content := "\n ", count := [ 5, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 15, 3 ], mathmode := "Text", name := "Description", next := 194802, root := ~, start := 193652, stop := 194801 ) ], count := [ 5, 3, 15, 1 ], mathmode := "Text", name := "ManSection", next := 194816, root := ~, start := 193559, stop := 194815 ), rec( content := "\n\n ", count := [ 5, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, func, n\ opath, edge", Name := "DigraphFloydWarshall" ), content := 0, count := [ 5, 3, 16, 2 ], mathmode := "Text", name := "Oper", next := 194906, root := ~, start := 194837, stop := 194905 ), rec( attributes := rec( ), content := [ rec( content := "A matrix.\ ", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "Returns", next := 194937, root := ~, start := 194909, stop := 194936 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "A", next := 194975, root := ~, start := 194961, stop := 194974 ), rec( content := " is a di\ graph with ", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "M", next := 195002, root := ~, start := 194994, stop := 195001 ), rec( content := " vertice\ s, then\n this operation returns an ", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ \\times n", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "M", next := 195065, root := ~, start := 195048, stop := 195064 ), rec( content := " matrix \ ", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "m\ at", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "C", next := 195083, root := ~, start := 195073, stop := 195082 ), rec( content := " contain\ ing\n the output of a generalised version of the Floyd-Warshall algorithm,\ \n applied to ", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "A", next := 195197, root := ~, start := 195183, stop := 195196 ), rec( content := ". ", count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "P", next := 195203, root := ~, start := 195199, stop := 195202 ), rec( content := "\n\n \ The operation ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphFloydWarshall", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "C", next := 195250, root := ~, start := 195223, stop := 195249 ), rec( content := " is cust\ omised by the arguments\n ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ unc", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "A", next := 195297, root := ~, start := 195286, stop := 195296 ), rec( content := ", ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ opath", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "A", next := 195312, root := ~, start := 195299, stop := 195311 ), rec( content := ", and ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "A", next := 195329, root := ~, start := 195318, stop := 195328 ), rec( content := ".\n T\ he arguments ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ opath", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "A", next := 195362, root := ~, start := 195349, stop := 195361 ), rec( content := " and ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "A", next := 195378, root := ~, start := 195367, stop := 195377 ), rec( content := " can be \ arbitrary ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " objects\ .\n The argument ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ unc", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "A", next := 195439, root := ~, start := 195428, stop := 195438 ), rec( content := " must be\ a function which accepts 4 arguments:\n the matrix ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "C", next := 195511, root := ~, start := 195501, stop := 195510 ), rec( content := ", follow\ ed by 3 postive integers. The function\n ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ unc", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "A", next := 195573, root := ~, start := 195562, stop := 195572 ), rec( content := " is wher\ e the work to calculate the desired outcome must be\n performed. ", count := [ 5, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "P", next := 195652, root := ~, start := 195648, stop := 195651 ), rec( content := "\n\n \ This method initialises the matrix ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "C", next := 195703, root := ~, start := 195693, stop := 195702 ), rec( content := " by sett\ ing entry\n ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at[i][j]", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "C", next := 195741, root := ~, start := 195725, stop := 195740 ), rec( content := " to equa\ l ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "A", next := 195762, root := ~, start := 195751, stop := 195761 ), rec( content := " if ther\ e is an edge with source\n ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "C", next := 195807, root := ~, start := 195799, stop := 195806 ), rec( content := " and ran\ ge ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "C", next := 195826, root := ~, start := 195818, stop := 195825 ), rec( content := ", and by\ setting entry ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at[i][j]", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "C", next := 195865, root := ~, start := 195849, stop := 195864 ), rec( content := " to equa\ l\n ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ opath", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "A", next := 195892, root := ~, start := 195879, stop := 195891 ), rec( content := " otherwi\ se.\n The final part of ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphFloydWarshall", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "C", next := 195953, root := ~, start := 195926, stop := 195952 ), rec( content := " then ca\ lls the function\n ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ unc", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "A", next := 195993, root := ~, start := 195982, stop := 195992 ), rec( content := " inside \ three nested for loops, over the vertices of\n ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "A", next := 196064, root := ~, start := 196050, stop := 196063 ), rec( content := ": ", count := [ 5, 3, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 16, 6 ], mathmode := "Text", name := "P", next := 196070, root := ~, start := 196066, stop := 196069 ), rec( content := "\n\n", count := [ 5, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ nfor i in DigraphsVertices(digraph) do\n for j in DigraphsVertices(digraph) d\ o\n for k in DigraphsVertices(digraph) do\n func(mat, i, j, k);\n o\ d;\n od;\nod;\n", count := [ 5, 3, 16, 7 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 7 ], mathmode := "Text", name := "Listing", next := 196268, root := ~, start := 196072, stop := 196267 ), rec( content := "\n\n \ The matrix ", count := [ 5, 3, 16, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ at", count := [ 5, 3, 16, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 8 ], mathmode := "Text", name := "C", next := 196295, root := ~, start := 196285, stop := 196294 ), rec( content := " is then\ returned as the result. An example of using\n ", count := [ 5, 3, 16, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphFloydWarshall", count := [ 5, 3, 16, 8 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 16, 8 ], mathmode := "Text", name := "C", next := 196379, root := ~, start := 196352, stop := 196378 ), rec( content := " to calc\ ulate the shortest (non-zero) distances\n between the vertices of a digraph\ is shown below: ", count := [ 5, 3, 16, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 16, 9 ], mathmode := "Text", name := "P", next := 196485, root := ~, start := 196481, stop := 196484 ), rec( content := "\n\n \ ", count := [ 5, 3, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDigraph6String(\"&EAHQeDB\");\n\ngap> func := function(mat, i, j, k)\n> if mat[i][k] <>\ -1 and mat[k][j] <> -1 then\n> if (mat[i][j] = -1) or (mat[i][j] > mat[i]\ [k] + mat[k][j]) then\n> mat[i][j] := mat[i][k] + mat[k][j];\n> fi;\ \n> fi;\n> end;\nfunction( mat, i, j, k ) ... end\ngap> shortest_distances :\ = DigraphFloydWarshall(D, func, -1, 1);;\ngap> Display(shortest_distances);\n[\ [ 3, -1, -1, 2, 1, 2 ],\n [ 4, 2, 1, 3, 2, 1 ],\n [ \ 3, 1, 2, 2, 1, 2 ],\n [ 1, -1, -1, 1, 1, 2 ],\n [ 2, \ -1, -1, 1, 2, 1 ],\n [ 3, -1, -1, 2, 1, 1 ] ]\n", count := [ 5, 3, 16, 10 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 16, 10 ], mathmode := "Text", name := "Example", next := 197191, root := ~, start := 196491, stop := 197190 ), rec( content := "\n ", count := [ 5, 3, 16, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 16, 3 ], mathmode := "Text", name := "Description", next := 197208, root := ~, start := 194940, stop := 197207 ) ], count := [ 5, 3, 16, 1 ], mathmode := "Text", name := "ManSection", next := 197222, root := ~, start := 194822, stop := 197221 ), rec( content := "\n\n ", count := [ 5, 3, 16, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, u, v", Name := "IsReachable" ), content := 0, count := [ 5, 3, 17, 2 ], mathmode := "Text", name := "Oper", next := 197289, root := ~, start := 197243, stop := 197288 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "K", next := 197312, root := ~, start := 197301, stop := 197311 ), rec( content := " or ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "K", next := 197328, root := ~, start := 197316, stop := 197327 ), rec( content := ".", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "Returns", next := 197339, root := ~, start := 197292, stop := 197338 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation returns ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "K", next := 197394, root := ~, start := 197383, stop := 197393 ), rec( content := " if ther\ e exists a non-trivial directed\n walk from vertex ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "A", next := 197463, root := ~, start := 197455, stop := 197462 ), rec( content := " to vert\ ex ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "A", next := 197482, root := ~, start := 197474, stop := 197481 ), rec( content := " in the \ digraph ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "A", next := 197512, root := ~, start := 197498, stop := 197511 ), rec( content := ",\n a\ nd ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "K", next := 197534, root := ~, start := 197522, stop := 197533 ), rec( content := " if ther\ e does not exist such a directed walk. See section\n ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "Ref", next := 197642, root := ~, start := 197598, stop := 197641 ), rec( content := " for the\ definition of a\n non-trivial directed walk.\n ", count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "P", next := 197706, root := ~, start := 197702, stop := 197705 ), rec( content := "\n\n \ The method for ", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sReachable", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "C", next := 197745, root := ~, start := 197727, stop := 197744 ), rec( content := " has wor\ st case complexity of ", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m +\n n)", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "M", next := 197796, root := ~, start := 197775, stop := 197795 ), rec( content := " where " , count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "M", next := 197811, root := ~, start := 197803, stop := 197810 ), rec( content := " is the \ number of edges and ", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "M", next := 197847, root := ~, start := 197839, stop := 197846 ), rec( content := " the num\ ber of\n vertices in ", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "A", next := 197892, root := ~, start := 197878, stop := 197891 ), rec( content := ".\n\n", count := [ 5, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2], [3], [2, 3]]);\n\ngap> IsReachable(D, 1, 3);\ntrue\ngap> IsReachable(D, 2, 1);\nfalse\n\ gap> IsReachable(D, 3, 3);\ntrue\ngap> IsReachable(D, 1, 1);\nfalse\n", count := [ 5, 3, 17, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 17, 5 ], mathmode := "Text", name := "Example", next := 198141, root := ~, start := 197895, stop := 198140 ), rec( content := "\n ", count := [ 5, 3, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 17, 3 ], mathmode := "Text", name := "Description", next := 198158, root := ~, start := 197342, stop := 198157 ) ], count := [ 5, 3, 17, 1 ], mathmode := "Text", name := "ManSection", next := 198172, root := ~, start := 197228, stop := 198171 ), rec( content := "\n\n ", count := [ 5, 3, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, u, v", Name := "DigraphPath" ), content := 0, count := [ 5, 3, 18, 2 ], mathmode := "Text", name := "Oper", next := 198239, root := ~, start := 198193, stop := 198238 ), rec( attributes := rec( ), content := [ rec( content := "A pair of\ lists, or ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "K", next := 198282, root := ~, start := 198271, stop := 198281 ), rec( content := ".", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "Returns", next := 198293, root := ~, start := 198242, stop := 198292 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ there exists a non-trivial directed path (or a non-trivial cycle, in the\n \ case that ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "A", next := 198412, root := ~, start := 198404, stop := 198411 ), rec( content := " ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "=\ ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "C", next := 198421, root := ~, start := 198413, stop := 198420 ), rec( content := " ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "A", next := 198430, root := ~, start := 198422, stop := 198429 ), rec( content := ") from v\ ertex ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "A", next := 198452, root := ~, start := 198444, stop := 198451 ), rec( content := " to vert\ ex\n ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "A", next := 198475, root := ~, start := 198467, stop := 198474 ), rec( content := " in the \ digraph ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "A", next := 198505, root := ~, start := 198491, stop := 198504 ), rec( content := ", then t\ his operation returns such a\n directed path (or directed cycle). Otherwise\ , this operation returns\n ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "K", next := 198630, root := ~, start := 198619, stop := 198629 ), rec( content := ". See S\ ection ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Text", Subsect := "Defi\ nitions" ), content := 0, count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "Ref", next := 198686, root := ~, start := 198645, stop := 198685 ), rec( content := " for the\ \n definition of a directed path and a directed cycle.\n ", count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "P", next := 198759, root := ~, start := 198755, stop := 198758 ), rec( content := "\n\n \ A directed path (or directed cycle) of non-zero length ", count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ -1", count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "C", next := 198830, root := ~, start := 198820, stop := 198829 ), rec( content := ",\n " , count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(\ v_1, e_1, v_2, e_2, ..., e_{n-1}, v_n)", count := [ 5, 3, 18, 4 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "M", next := 198882, root := ~, start := 198836, stop := 198881 ), rec( content := ",\n i\ s represented by a pair of lists ", count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ v,a]", count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "C", next := 198934, root := ~, start := 198922, stop := 198933 ), rec( content := " as foll\ ows:\n\n ", count := [ 5, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 5, 3, 18, 6 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "v", count := [ 5, 3, 18, 6 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 6 ], mathmode := "Text", name\ := "C", next := 198988, root := ~, start := 198980, stop := 198987 ), rec( cont\ ent := " is the list ", count := [ 5, 3, 18, 6 ], mathmode := "Text", name := \ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :\ = "[v_1, v_2, ..., v_n]", count := [ 5, 3, 18, 6 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 6 ], mathmode := "Text", name \ := "M", next := 199028, root := ~, start := 199001, stop := 199027 ), rec( cont\ ent := ".\n ", count := [ 5, 3, 18, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 18, 6 ], name := "Item", next := 199043, root := ~, start := 198\ 965, stop := 199042 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n ", count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "a", count :\ = [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count \ := [ 5, 3, 18, 8 ], mathmode := "Text", name := "C", next := 199073, root := ~ , star\ t := 199065, stop := 199072 ), rec( content := " is the list of positive integ\ ers ", count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA", root :=\ ~ ), rec( attributes := rec( ), content := [ rec( content := "[a_1, a_2, ...\ , a_{n-1}]", count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "M", next \ := 199138, root := ~, start := 199107, stop := 199137 ), rec( content := "\n \ where for each each ", count := [ 5, 3, 18, 8 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "i < n", count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA",\ root := ~ ) ], count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "M", next\ := 199182, root := ~, start := 199167, stop := 199181 ), rec( content := ", " , coun\ t := [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "a_i", count := [ 5, 3, 18, 8 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 8\ ], mathmode := "Text", name := "M", next := 199194, root := ~, start := 19918\ 4, stop := 199193 ), rec( content := " is the position of\n ", count :=\ [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "v_{i+1}", count := [ 5, 3, 18\ , 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 1\ 8, 8 ], mathmode := "Text", name := "M", next := 199236, root := ~, start := 1\ 99222, stop := 199235 ), rec( content := " in\n ", count := [ 5, 3, 18,\ 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "OutNeighboursOfVertex(", count := [ 5, 3,\ 18, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3\ , 18, 8 ], mathmode := "Text", name := "C", next := 199277, root := ~, start :\ = 199248, stop := 199276 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph", count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "A", next\ := 199291, root := ~, start := 199277, stop := 199290 ), rec( attributes := re\ c( ), content := [ rec( content := ",", count := [ 5, 3, 18, 8 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 8 ], mathmode :\ = "Text", name := "C", next := 199299, root := ~, start := 199291, stop := 199\ 298 ), rec( attributes := rec( ), content := [ rec( content := "v_i", count :\ = [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count \ := [ 5, 3, 18, 8 ], mathmode := "Text", name := "M", next := 199309, root := ~ , star\ t := 199299, stop := 199308 ), rec( attributes := rec( ), content := [ rec( c\ ontent := ")", count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA",\ root := ~ ) ], count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "C", next\ := 199317, root := ~, start := 199309, stop := 199316 ), rec( content := "\n \ corresponding to the edge ", count := [ 5, 3, 18, 8 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ re\ c( content := "e_i", count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "M\ ", next := 199362, root := ~, start := 199352, stop := 199361 ), rec( content \ := ". This is can be useful if the\n position of a vertex in a list of\ out-neighours is significant, for\n example in orbit digraphs.\n \ ", count := [ 5, 3, 18, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 8 ], name := "Ite\ m", next := 199518, root := ~, start := 199050, stop := 199517 ) ], count := [ 5, 3, 18, 5 ], mathmode := "Text", name := "List", next := 199530, root := ~, start := 198952, stop := 199529 ), rec( content := "\n\n \ The method for ", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphPath", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "C", next := 199569, root := ~, start := 199551, stop := 199568 ), rec( content := " has wor\ st case complexity of ", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m +\n n)", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "M", next := 199620, root := ~, start := 199599, stop := 199619 ), rec( content := " where " , count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "M", next := 199635, root := ~, start := 199627, stop := 199634 ), rec( content := " is the \ number of edges and ", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "M", next := 199671, root := ~, start := 199663, stop := 199670 ), rec( content := " the num\ ber of\n vertices in ", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "A", next := 199716, root := ~, start := 199702, stop := 199715 ), rec( content := ".\n\n", count := [ 5, 3, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2], [3], [2, 3]]);\n\ngap> DigraphPath(D, 1, 3);\n[ [ 1, 2, 3 ], [ 1, 1 ] ]\ngap> DigraphPa\ th(D, 2, 1);\nfail\ngap> DigraphPath(D, 3, 3);\n[ [ 3, 3 ], [ 2 ] ]\ngap> Digr\ aphPath(D, 1, 1);\nfail\n", count := [ 5, 3, 18, 11 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 11 ], mathmode := "Text", name := "Example", next := 199999, root := ~, start := 199719, stop := 199998 ), rec( content := "\n ", count := [ 5, 3, 18, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 18, 3 ], mathmode := "Text", name := "Description", next := 200016, root := ~, start := 198296, stop := 200015 ) ], count := [ 5, 3, 18, 1 ], mathmode := "Text", name := "ManSection", next := 200030, root := ~, start := 198178, stop := 200029 ), rec( content := "\n\n ", count := [ 5, 3, 18, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, u, v", Name := "DigraphShortest\ Path" ), content := 0, count := [ 5, 3, 19, 2 ], mathmode := "Text", name := "Oper", next := 200105, root := ~, start := 200051, stop := 200104 ), rec( attributes := rec( ), content := [ rec( content := "A pair of\ lists, or ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "K", next := 200148, root := ~, start := 200137, stop := 200147 ), rec( content := ".", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "Returns", next := 200159, root := ~, start := 200108, stop := 200158 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns the shortest directed path in the digraph digraph from the vertex\n ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "A", next := 200266, root := ~, start := 200258, stop := 200265 ), rec( content := " to the \ vertex ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "A", next := 200289, root := ~, start := 200281, stop := 200288 ), rec( content := ", if suc\ h a path exists. If ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "u", count := [ 5, 3, 19, 3 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 3 ], mathmode := \ "Text", name := "A", next := 200328, root := ~, start := 200320, stop := 20032\ 7 ), rec( content := " =\n ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 3 ], mathmode := \ "Text", name := "A", next := 200343, root := ~, start := 200335, stop := 20034\ 2 ) ], count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "C", next := 200347, root := ~, start := 200317, stop := 200346 ), rec( content := ", then t\ he shortest non-trivial cycle is returned, again, if it\n exists. Otherwise\ , this operation returns ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "K", next := 200468, root := ~, start := 200457, stop := 200467 ), rec( content := ". See S\ ection\n ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Text", Subsect := "Defi\ nitions" ), content := 0, count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "Ref", next := 200528, root := ~, start := 200487, stop := 200527 ), rec( content := " for the\ definition of a directed\n path and a directed cycle.\n ", count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "P", next := 200601, root := ~, start := 200597, stop := 200600 ), rec( content := "\n\n \ See ", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Path" ), content := 0, count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "Ref", next := 200636, root := ~, start := 200611, stop := 200635 ), rec( content := " for det\ ails on the output.\n\n The method for ", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphShortestPath", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "C", next := 200710, root := ~, start := 200684, stop := 200709 ), rec( content := " has wor\ st case complexity of\n ", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m + n)", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "M", next := 200759, root := ~, start := 200744, stop := 200758 ), rec( content := " where " , count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "M", next := 200774, root := ~, start := 200766, stop := 200773 ), rec( content := " is the \ number of edges and ", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "M", next := 200810, root := ~, start := 200802, stop := 200809 ), rec( content := " the\n \ number of vertices in ", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "A", next := 200855, root := ~, start := 200841, stop := 200854 ), rec( content := ".\n\n", count := [ 5, 3, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2], [3], [2, 4], [1], [2, 4]]);\n\ngap> DigraphShortestPath(D, 5, 1);\n[ [ 5, 4, 1 ], [ \ 2, 1 ] ]\ngap> DigraphShortestPath(D, 3, 3);\n[ [ 3, 2, 3 ], [ 1, 1 ] ]\ngap> \ DigraphShortestPath(D, 5, 5);\nfail\ngap> DigraphShortestPath(D, 1, 1);\n[ [ 1\ , 1 ], [ 1 ] ]\n", count := [ 5, 3, 19, 5 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 5 ], mathmode := "Text", name := "Example", next := 201207, root := ~, start := 200858, stop := 201206 ), rec( content := "\n ", count := [ 5, 3, 19, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 19, 3 ], mathmode := "Text", name := "Description", next := 201224, root := ~, start := 200162, stop := 201223 ) ], count := [ 5, 3, 19, 1 ], mathmode := "Text", name := "ManSection", next := 201238, root := ~, start := 200036, stop := 201237 ), rec( content := "\n\n ", count := [ 5, 3, 19, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, u, v", Name := "IteratorOfPaths\ " ), content := 0, count := [ 5, 3, 20, 2 ], mathmode := "Text", name := "Oper", next := 201309, root := ~, start := 201259, stop := 201308 ), rec( attributes := rec( ), content := [ rec( content := "An iterat\ or.", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "Returns", next := 201343, root := ~, start := 201312, stop := 201342 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "A", next := 201381, root := ~, start := 201367, stop := 201380 ), rec( content := " is a di\ graph or a list of adjacencies which defines a\n digraph - see ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "OutNeig\ hbours" ), content := 0, count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "Ref", next := 201481, root := ~, start := 201454, stop := 201480 ), rec( content := " - then \ this operation returns an\n iterator of the non-trivial directed paths (or \ directed cycles, in the case\n that ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "A", next := 201612, root := ~, start := 201604, stop := 201611 ), rec( content := " ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "=\ ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "C", next := 201621, root := ~, start := 201613, stop := 201620 ), rec( content := " ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "A", next := 201630, root := ~, start := 201622, stop := 201629 ), rec( content := ") in ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "A", next := 201649, root := ~, start := 201635, stop := 201648 ), rec( content := " from th\ e vertex ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "A", next := 201674, root := ~, start := 201666, stop := 201673 ), rec( content := "\n to\ the vertex ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "A", next := 201701, root := ~, start := 201693, stop := 201700 ), rec( content := ".\n " , count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 20, 4 ], mathmode := "Text", name := "P", next := 201711, root := ~, start := 201707, stop := 201710 ), rec( content := "\n\n \ See ", count := [ 5, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Path" ), content := 0, count := [ 5, 3, 20, 4 ], mathmode := "Text", name := "Ref", next := 201746, root := ~, start := 201721, stop := 201745 ), rec( content := " for mor\ e information about the repesentation\n of a directed path or directed cycl\ e which is used, and see ", count := [ 5, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Sect := "Iterators" ), content := 0, count := [ 5, 3, 20, 4 ], mathmode := "Text", name := "Ref", next := 201900, root := ~, start := 201856, stop := 201899 ), rec( content := " for mor\ e information about iterators.\n See Section ", count := [ 5, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Text", Subsect := "Defi\ nitions" ), content := 0, count := [ 5, 3, 20, 4 ], mathmode := "Text", name := "Ref", next := 201996, root := ~, start := 201955, stop := 201995 ), rec( content := " for the\ definition of\n a directed path and a directed cycle.\n ", count := [ 5, 3, 20, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 20, 5 ], mathmode := "Text", name := "P", next := 202069, root := ~, start := 202065, stop := 202068 ), rec( content := "\n\n", count := [ 5, 3, 20, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 4, 4, 2], [3, 5], [2, 3], [1, 2], [4]]);\n\ngap> iter := IteratorOfPaths(D, 1, 4);\ \n\ngap> NextIterator(iter);\n[ [ 1, 4 ], [ 2 ] ]\ngap> NextIterator\ (iter);\n[ [ 1, 4 ], [ 3 ] ]\ngap> NextIterator(iter);\n[ [ 1, 2, 5, 4 ], [ 4,\ 2, 1 ] ]\ngap> IsDoneIterator(iter);\ntrue\ngap> iter := IteratorOfPaths(D, 4\ , 3);\n\ngap> NextIterator(iter);\n[ [ 4, 1, 2, 3 ], [ 1, 4, 1 ] ]\n\ ", count := [ 5, 3, 20, 6 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 6 ], mathmode := "Text", name := "Example", next := 202554, root := ~, start := 202071, stop := 202553 ), rec( content := "\n ", count := [ 5, 3, 20, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 20, 3 ], mathmode := "Text", name := "Description", next := 202571, root := ~, start := 201346, stop := 202570 ) ], count := [ 5, 3, 20, 1 ], mathmode := "Text", name := "ManSection", next := 202585, root := ~, start := 201244, stop := 202584 ), rec( content := "\n\n ", count := [ 5, 3, 20, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphAllSimpl\ eCircuits" ), content := 0, count := [ 5, 3, 21, 2 ], mathmode := "Text", name := "Attr", next := 202659, root := ~, start := 202606, stop := 202658 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ lists of vertices.", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "Returns", next := 202709, root := ~, start := 202662, stop := 202708 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "A", next := 202747, root := ~, start := 202733, stop := 202746 ), rec( content := " is a di\ graph, then ", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphAllSimpleCircuits", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "C", next := 202798, root := ~, start := 202767, stop := 202797 ), rec( content := "\n re\ turns a list of the ", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ imple circuits", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "E", next := 202847, root := ~, start := 202825, stop := 202846 ), rec( content := " in ", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "A", next := 202865, root := ~, start := 202851, stop := 202864 ), rec( content := ". ", count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 21, 4 ], mathmode := "Text", name := "P", next := 202871, root := ~, start := 202867, stop := 202870 ), rec( content := "\n\n \ See section ", count := [ 5, 3, 21, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 5, 3, 21, 4 ], mathmode := "Text", name := "Ref", next := 202933, root := ~, start := 202889, stop := 202932 ), rec( content := " for the\ definition\n of a simple circuit, and related notions. Note that a loop is\ a simple\n circuit. ", count := [ 5, 3, 21, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "P", next := 203045, root := ~, start := 203041, stop := 203044 ), rec( content := "\n\n \ For a digraph without multiple edges, a simple circuit is uniquely\n determ\ ined by its subsequence of vertices. However this is not the case for\n a m\ ultidigraph. The attribute ", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphAllSimpleCircuits", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "C", next := 203264, root := ~, start := 203233, stop := 203263 ), rec( content := " ignores\ \n multiple edges, and identifies a simple circuit using only its subsequen\ ce\n of vertices. For example, although the simple circuits ", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(\ v, e, v)", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "M", next := 203427, root := ~, start := 203411, stop := 203426 ), rec( content := " and\n \ ", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(\ v, e', v)", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "M", next := 203453, root := ~, start := 203436, stop := 203452 ), rec( content := " (for di\ stinct edges ", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ ", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "M", next := 203482, root := ~, start := 203474, stop := 203481 ), rec( content := " and ", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ '", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "M", next := 203496, root := ~, start := 203487, stop := 203495 ), rec( content := ") are\n \ mathematically distinct, ", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphAllSimpleCircuits", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "C", next := 203562, root := ~, start := 203531, stop := 203561 ), rec( content := " conside\ rs them to\n be the same. ", count := [ 5, 3, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "P", next := 203602, root := ~, start := 203598, stop := 203601 ), rec( content := "\n\n \ With this approach, a directed circuit of length ", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "C", next := 203665, root := ~, start := 203657, stop := 203664 ), rec( content := " can be \ determined\n by a list of its first ", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "C", next := 203719, root := ~, start := 203711, stop := 203718 ), rec( content := " vertice\ s. Thus a simple circuit ", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(\ v_1,\n e_1, v_2, e_2, ..., e_{n-1}, v_n, e_{n+1}, v_1)", count := [ 5, 3, 21, 6 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "M", next := 203818, root := ~, start := 203752, stop := 203817 ), rec( content := " can be \ represented as\n the list ", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ v_1, \\ldots, v_n]", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "M", next := 203879, root := ~, start := 203854, stop := 203878 ), rec( content := ", or any\ cyclic permutation thereof. For\n each simple circuit of ", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "A", next := 203962, root := ~, start := 203948, stop := 203961 ), rec( content := ",\n " , count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphAllSimpleCircuits(", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "A", next := 2040\ 10, root := ~, start := 203996, stop := 204009 ), rec( content := ")", count := [ 5, 3, 21, 6 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "C", next := 204015, root := ~, start := 203968, stop := 204014 ), rec( content := " include\ s precisely one such\n list to represent the circuit. ", count := [ 5, 3, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 21, 7 ], mathmode := "Text", name := "P", next := 204084, root := ~, start := 204080, stop := 204083 ), rec( content := "\n\n \ ", count := [ 5, 3, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[], [3], [2, 4], [5, 4], [4]]);\n\ngap> DigraphAllSimpleCircuits(D);\n[ [ 4 ], [ 4, 5 ], [ 2\ , 3 ] ]\ngap> D := ChainDigraph(10);;\ngap> DigraphAllSimpleCircuits(D);\n[ ]\ \ngap> D := Digraph([[3], [1], [1]]);\n\ngap> DigraphAllSimpleCircuits(D);\n[ [ 1, 3 ] ]\ngap> D := Digraph([[1,\ 1]]);\n\ngap> DigraphAllSimple\ Circuits(D);\n[ [ 1 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphAllSimpleCircuits(D);\n[ [ 1,\ 2, 3 ] ]\n", count := [ 5, 3, 21, 8 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 8 ], mathmode := "Text", name := "Example", next := 204737, root := ~, start := 204090, stop := 204736 ), rec( content := "\n ", count := [ 5, 3, 21, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 21, 3 ], mathmode := "Text", name := "Description", next := 204754, root := ~, start := 202712, stop := 204753 ) ], count := [ 5, 3, 21, 1 ], mathmode := "Text", name := "ManSection", next := 204768, root := ~, start := 202591, stop := 204767 ), rec( content := "\n\n ", count := [ 5, 3, 21, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphLongestS\ impleCircuit" ), content := 0, count := [ 5, 3, 22, 2 ], mathmode := "Text", name := "Attr", next := 204845, root := ~, start := 204789, stop := 204844 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ vertices, or ", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "K", next := 204891, root := ~, start := 204880, stop := 204890 ), rec( content := ".", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "Returns", next := 204902, root := ~, start := 204848, stop := 204901 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "A", next := 204940, root := ~, start := 204926, stop := 204939 ), rec( content := " is a di\ graph, then ", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphLongestSimpleCircuit", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "C", next := 204994, root := ~, start := 204960, stop := 204993 ), rec( content := "\n re\ turns the longest ", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ imple circuit", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "E", next := 205040, root := ~, start := 205019, stop := 205039 ), rec( content := " in ", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "A", next := 205058, root := ~, start := 205044, stop := 205057 ), rec( content := ". See se\ ction\n ", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "Ref", next := 205120, root := ~, start := 205076, stop := 205119 ), rec( content := " for the\ definition of simple\n circuit, and the definition of length for a simple \ circuit.", count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "P", next := 205217, root := ~, start := 205213, stop := 205216 ), rec( content := "\n\n \ This attribute computes\n ", count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphAllSimpleCircuits(", count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "C", next := 205283, root := ~, start := 205251, stop := 205282 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "A", next := 205297, root := ~, start := 205283, stop := 205296 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "C", next := 205305, root := ~, start := 205297, stop := 205304 ), rec( content := " to find\ all the\n simple circuits of ", count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "A", next := 205359, root := ~, start := 205345, stop := 205358 ), rec( content := ", and re\ turns one of maximal length. A\n simple circuit is represented as a list o\ f vertices, in the same way as\n described in ", count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ AllSimpleCircuits" ), content := 0, count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "Ref", next := 205530, root := ~, start := 205492, stop := 205529 ), rec( content := ".", count := [ 5, 3, 22, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "P", next := 205535, root := ~, start := 205531, stop := 205534 ), rec( content := "\n\n \ If ", count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "A", next := 205558, root := ~, start := 205544, stop := 205557 ), rec( content := " has no \ simple circuits, then this attribute returns\n ", count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "K", next := 205626, root := ~, start := 205615, stop := 205625 ), rec( content := ". If ", count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "A", next := 205646, root := ~, start := 205632, stop := 205645 ), rec( content := " has mul\ tiple simple circuits of maximal\n length, then this attribute returns one \ of them.", count := [ 5, 3, 22, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 22, 6 ], mathmode := "Text", name := "P", next := 205743, root := ~, start := 205739, stop := 205742 ), rec( content := "\n\n \ ", count := [ 5, 3, 22, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[], [3], [2, 4], [5, 4], [4]]);;\ngap> DigraphLongestSimpl\ eCircuit(D);\n[ 4, 5 ]\ngap> D := ChainDigraph(10);;\ngap> DigraphLongestSimpl\ eCircuit(D);\nfail\ngap> D := Digraph([[3], [1], [1, 4], [1, 1]]);;\ngap> Digr\ aphLongestSimpleCircuit(D);\n[ 1, 3, 4 ]\ngap> D := GeneralisedPetersenGraph(I\ sMutableDigraph, 4, 1);\n\ngap> Dig\ raphLongestSimpleCircuit(D);\n[ 1, 2, 3, 4, 8, 7, 6, 5 ]\n", count := [ 5, 3, 22, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 22, 7 ], mathmode := "Text", name := "Example", next := 206215, root := ~, start := 205749, stop := 206214 ), rec( content := "\n ", count := [ 5, 3, 22, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 22, 3 ], mathmode := "Text", name := "Description", next := 206232, root := ~, start := 204905, stop := 206231 ) ], count := [ 5, 3, 22, 1 ], mathmode := "Text", name := "ManSection", next := 206246, root := ~, start := 204774, stop := 206245 ), rec( content := "\n\n ", count := [ 5, 3, 22, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vertex" , Name := "DigraphLayers" ), content := 0, count := [ 5, 3, 23, 2 ], mathmode := "Text", name := "Oper", next := 206317, root := ~, start := 206267, stop := 206316 ), rec( attributes := rec( ), content := [ rec( content := "A list.", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "Returns", next := 206346, root := ~, start := 206320, stop := 206345 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation returns a list ", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "K", next := 206408, root := ~, start := 206397, stop := 206407 ), rec( content := " such th\ at ", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist[i]", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "K", next := 206433, root := ~, start := 206419, stop := 206432 ), rec( content := " is the\\ n list of vertices whose minimum distance from the vertex ", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "A", next := 206514, root := ~, start := 206501, stop := 206513 ), rec( content := " in\n \ ", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "A", next := 206536, root := ~, start := 206522, stop := 206535 ), rec( content := " is ", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ - 1", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "K", next := 206552, root := ~, start := 206540, stop := 206551 ), rec( content := ". Vertex\ ", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "A", next := 206574, root := ~, start := 206561, stop := 206573 ), rec( content := " is\n \ assumed to be at distance ", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "0\ ", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "K", next := 206616, root := ~, start := 206608, stop := 206615 ), rec( content := " from it\ self.\n ", count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(4);;\ngap> DigraphLayers(D, 1);\n[ [ 1 ], [ 2, 3, 4\ ] ]\n", count := [ 5, 3, 23, 4 ], name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 4 ], mathmode := "Text", name := "Example", next := 206746, root := ~, start := 206634, stop := 206745 ), rec( content := "\n ", count := [ 5, 3, 23, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 23, 3 ], mathmode := "Text", name := "Description", next := 206763, root := ~, start := 206349, stop := 206762 ) ], count := [ 5, 3, 23, 1 ], mathmode := "Text", name := "ManSection", next := 206777, root := ~, start := 206252, stop := 206776 ), rec( content := "\n\n ", count := [ 5, 3, 23, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphDegenera\ cy" ), content := 0, count := [ 5, 3, 24, 2 ], mathmode := "Text", name := "Attr", next := 206844, root := ~, start := 206798, stop := 206843 ), rec( attributes := rec( ), content := [ rec( content := "A non-neg\ ative integer, or ", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "K", next := 206894, root := ~, start := 206883, stop := 206893 ), rec( content := ".", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "Returns", next := 206905, root := ~, start := 206847, stop := 206904 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "A", next := 206943, root := ~, start := 206929, stop := 206942 ), rec( content := " is a sy\ mmetric digraph without multiple edges - see\n ", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymme\ tricDigraph" ), content := 0, count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "Ref", next := 207032, root := ~, start := 207000, stop := 207031 ), rec( content := " and ", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMulti\ Digraph" ), content := 0, count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "Ref", next := 207065, root := ~, start := 207037, stop := 207064 ), rec( content := " - then\\ n this attribute returns the degeneracy of ", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "A", next := 207132, root := ~, start := 207118, stop := 207131 ), rec( content := ". ", count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "P", next := 207138, root := ~, start := 207134, stop := 207137 ), rec( content := "\n\n \ The degeneracy of a digraph is the least integer ", count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "C", next := 207201, root := ~, start := 207193, stop := 207200 ), rec( content := " such\n \ that every induced of ", count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "A", next := 207247, root := ~, start := 207233, stop := 207246 ), rec( content := " contain\ s a vertex whose number of\n neighbours (excluding itself) is at most ", count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "C", next := 207335, root := ~, start := 207327, stop := 207334 ), rec( content := ". Note t\ hat this means\n that loops are ignored.", count := [ 5, 3, 24, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 24, 5 ], mathmode := "Text", name := "P", next := 207389, root := ~, start := 207385, stop := 207388 ), rec( content := "\n\n \ If ", count := [ 5, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 5 ], mathmode := "Text", name := "A", next := 207412, root := ~, start := 207398, stop := 207411 ), rec( content := " is not \ symmetric or has multiple edges then this\n attribute returns ", count := [ 5, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 5 ], mathmode := "Text", name := "K", next := 207495, root := ~, start := 207484, stop := 207494 ), rec( content := ".\n " , count := [ 5, 3, 24, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphSymmetricClosure(ChainDigraph(5));;\ngap> DigraphDegeneracy(\ D);\n1\ngap> D := CompleteDigraph(5);;\ngap> DigraphDegeneracy(D);\n4\ngap> D \ := Digraph([[1], [2, 4, 5], [3, 4], [2, 3, 4], [2], []]);\n\ngap> DigraphDegeneracy(D);\n1\ngap> D := Generalis\ edPetersenGraph(IsMutableDigraph, 10, 3);\n\ngap> DigraphDegeneracy(D);\n3\n", count := [ 5, 3, 24, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 24, 6 ], mathmode := "Text", name := "Example", next := 207950, root := ~, start := 207501, stop := 207949 ), rec( content := "\n ", count := [ 5, 3, 24, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 24, 3 ], mathmode := "Text", name := "Description", next := 207967, root := ~, start := 206908, stop := 207966 ) ], count := [ 5, 3, 24, 1 ], mathmode := "Text", name := "ManSection", next := 207981, root := ~, start := 206783, stop := 207980 ), rec( content := "\n\n ", count := [ 5, 3, 24, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphDegenera\ cyOrdering" ), content := 0, count := [ 5, 3, 25, 2 ], mathmode := "Text", name := "Attr", next := 208056, root := ~, start := 208002, stop := 208055 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ integers, or ", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "K", next := 208102, root := ~, start := 208091, stop := 208101 ), rec( content := ".", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "Returns", next := 208113, root := ~, start := 208059, stop := 208112 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "A", next := 208151, root := ~, start := 208137, stop := 208150 ), rec( content := " is a di\ graph for which\n ", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDegeneracy(", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "C", next := 208204, root := ~, start := 208179, stop := 208203 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "A", next := 208218, root := ~, start := 208204, stop := 208217 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "C", next := 208226, root := ~, start := 208218, stop := 208225 ), rec( content := " is a no\ n-negative integer\n ", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "C", next := 208265, root := ~, start := 208257, stop := 208264 ), rec( content := " - see " , count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Degeneracy" ), content := 0, count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "Ref", next := 208303, root := ~, start := 208272, stop := 208302 ), rec( content := " - then \ this attribute\n returns a degeneracy ordering of the vertices of the verti\ ces of\n ", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "A", next := 208413, root := ~, start := 208399, stop := 208412 ), rec( content := ".", count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "P", next := 208418, root := ~, start := 208414, stop := 208417 ), rec( content := "\n\n \ A degeneracy ordering of ", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "A", next := 208463, root := ~, start := 208449, stop := 208462 ), rec( content := " is a li\ st ", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ rdering", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "C", next := 208489, root := ~, start := 208474, stop := 208488 ), rec( content := " of the\\ n vertices of ", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "A", next := 208527, root := ~, start := 208513, stop := 208526 ), rec( content := " ordered\ such that for any\n position ", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "C", next := 208575, root := ~, start := 208567, stop := 208574 ), rec( content := " of the \ list, the vertex ", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ rdering[i]", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "C", next := 208618, root := ~, start := 208600, stop := 208617 ), rec( content := " has at \ most\n ", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "k\ ", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "C", next := 208643, root := ~, start := 208635, stop := 208642 ), rec( content := " neighbo\ urs in later position of the list.", count := [ 5, 3, 25, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "P", next := 208689, root := ~, start := 208685, stop := 208688 ), rec( content := "\n\n \ If ", count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDegeneracy(", count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "C", next := 208723, root := ~, start := 208698, stop := 208722 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "A", next := 208737, root := ~, start := 208723, stop := 208736 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "C", next := 208745, root := ~, start := 208737, stop := 208744 ), rec( content := " returns\ ", count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "K", next := 208765, root := ~, start := 208754, stop := 208764 ), rec( content := ",\n t\ hen this attribute returns ", count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "K", next := 208810, root := ~, start := 208799, stop := 208809 ), rec( content := ".\n " , count := [ 5, 3, 25, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphSymmetricClosure(ChainDigraph(5));;\ngap> DigraphDegeneracyO\ rdering(D);\n[ 5, 4, 3, 2, 1 ]\ngap> D := CompleteDigraph(5);;\ngap> DigraphDe\ generacyOrdering(D);\n[ 5, 4, 3, 2, 1 ]\ngap> D := Digraph([[1], [2, 4, 5], [3\ , 4], [2, 3, 4], [2], []]);\n\nga\ p> DigraphDegeneracyOrdering(D);\n[ 1, 6, 5, 2, 4, 3 ]\ngap> D := GeneralisedP\ etersenGraph(IsMutableDigraph, 3, 1);\n\ngap> DigraphDegeneracyOrdering(D);\n[ 6, 5, 4, 1, 3, 2 ]\n", count := [ 5, 3, 25, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 25, 6 ], mathmode := "Text", name := "Example", next := 209365, root := ~, start := 208816, stop := 209364 ), rec( content := "\n ", count := [ 5, 3, 25, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 25, 3 ], mathmode := "Text", name := "Description", next := 209382, root := ~, start := 208116, stop := 209381 ) ], count := [ 5, 3, 25, 1 ], mathmode := "Text", name := "ManSection", next := 209396, root := ~, start := 207987, stop := 209395 ), rec( content := "\n\n ", count := [ 5, 3, 25, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "HamiltonianPath\ " ), content := 0, count := [ 5, 3, 26, 2 ], mathmode := "Text", name := "Attr", next := 209461, root := ~, start := 209417, stop := 209460 ), rec( attributes := rec( ), content := [ rec( content := "A list or\ ", count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "K", next := 209494, root := ~, start := 209483, stop := 209493 ), rec( content := ".", count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "Returns", next := 209505, root := ~, start := 209464, stop := 209504 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns a Hamiltonian path if one exists, ", count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "K", next := 209579, root := ~, start := 209568, stop := 209578 ), rec( content := " if not.\ ", count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := 0, count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "P", next := 209591, root := ~, start := 209587, stop := 209590 ), rec( content := "\n\n \ A ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ amiltonian path", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "E", next := 209622, root := ~, start := 209599, stop := 209621 ), rec( content := " of a di\ graph with ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "C", next := 209649, root := ~, start := 209641, stop := 209648 ), rec( content := " vertice\ s is directed\n cycle of length ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "C", next := 209699, root := ~, start := 209691, stop := 209698 ), rec( content := ". If ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "A", next := 209718, root := ~, start := 209704, stop := 209717 ), rec( content := " is a di\ graph that contains a\n Hamiltonian path, then this function returns one, d\ escribed in the form\n used by ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ AllSimpleCircuits" ), content := 0, count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "Ref", next := 209874, root := ~, start := 209836, stop := 209873 ), rec( content := ". Note i\ f ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "A", next := 209898, root := ~, start := 209884, stop := 209897 ), rec( content := " has\n \ 0 or 1 vertices, then ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ amiltonianPath", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "C", next := 209951, root := ~, start := 209929, stop := 209950 ), rec( content := " returns\ ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ ]", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "C", next := 209969, root := ~, start := 209960, stop := 209968 ), rec( content := " or\n \ ", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1]", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "C", next := 209987, root := ~, start := 209977, stop := 209986 ), rec( content := ", respec\ tively.", count := [ 5, 3, 26, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 26, 5 ], mathmode := "Text", name := "P", next := 210006, root := ~, start := 210002, stop := 210005 ), rec( content := "\n\n \ The method used in this attribute has the same worst case complexity as\n " , count := [ 5, 3, 26, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Monomorphism" ), content := 0, count := [ 5, 3, 26, 5 ], mathmode := "Text", name := "Ref", next := 210121, root := ~, start := 210088, stop := 210120 ), rec( content := ".\n\n \ ", count := [ 5, 3, 26, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[]]);\n\ngap> Hamil\ tonianPath(D);\n[ 1 ]\ngap> D := Digraph([[2], [1]]);\n\ngap> HamiltonianPath(D);\n[ 1, 2 ]\ngap> D := Digraph([\ [3], [], [2]]);\n\ngap> Hamiltonia\ nPath(D);\nfail\ngap> D := Digraph([[2], [3], [1]]);\n\ngap> HamiltonianPath(D);\n[ 1, 2, 3 ]\ngap> D := General\ isedPetersenGraph(IsMutableDigraph, 5, 2);\n\ngap> HamiltonianPath(D);\nfail\n", count := [ 5, 3, 26, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 26, 6 ], mathmode := "Text", name := "Example", next := 210729, root := ~, start := 210128, stop := 210728 ), rec( content := "\n ", count := [ 5, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 26, 3 ], mathmode := "Text", name := "Description", next := 210746, root := ~, start := 209508, stop := 210745 ) ], count := [ 5, 3, 26, 1 ], mathmode := "Text", name := "ManSection", next := 210760, root := ~, start := 209402, stop := 210759 ), rec( content := "\n\n ", count := [ 5, 3, 26, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "NrSpanningTrees\ " ), content := 0, count := [ 5, 3, 27, 2 ], mathmode := "Text", name := "Attr", next := 210825, root := ~, start := 210781, stop := 210824 ), rec( attributes := rec( ), content := [ rec( content := "An intege\ r.", count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "Returns", next := 210858, root := ~, start := 210828, stop := 210857 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns the number of spanning trees of the symmetric digraph\n ", count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "A", next := 210959, root := ~, start := 210945, stop := 210958 ), rec( content := ".\n " , count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "N\ rSpanningTrees", count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "C", next := 210987, root := ~, start := 210965, stop := 210986 ), rec( content := " will re\ turn an error if ", count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "A", next := 211026, root := ~, start := 211012, stop := 211025 ), rec( content := " is not \ a\n symmetric digraph. ", count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 27, 4 ], mathmode := "Text", name := "P", next := 211063, root := ~, start := 211059, stop := 211062 ), rec( content := " \n\n \ See ", count := [ 5, 3, 27, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymme\ tricDigraph" ), content := 0, count := [ 5, 3, 27, 4 ], mathmode := "Text", name := "Ref", next := 211106, root := ~, start := 211074, stop := 211105 ), rec( content := " and\n \ ", count := [ 5, 3, 27, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsUndir\ ectedSpanningTree" ), content := 0, count := [ 5, 3, 27, 4 ], mathmode := "Text", name := "Ref", next := 211154, root := ~, start := 211115, stop := 211153 ), rec( content := " for mor\ e information. \n\n ", count := [ 5, 3, 27, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(5);\n\n\ gap> NrSpanningTrees(D);\n125\ngap> D := DigraphSymmetricClosure(CycleDigraph(\ 24));;\ngap> NrSpanningTrees(D);\n24\ngap> NrSpanningTrees(EmptyDigraph(0));\n\ 0\ngap> D := GeneralisedPetersenGraph(IsMutableDigraph, 9, 2);\n\ngap> NrSpanningTrees(D);\n1134225\n", count := [ 5, 3, 27, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 27, 5 ], mathmode := "Text", name := "Example", next := 211580, root := ~, start := 211183, stop := 211579 ), rec( content := "\n ", count := [ 5, 3, 27, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 27, 3 ], mathmode := "Text", name := "Description", next := 211597, root := ~, start := 210861, stop := 211596 ) ], count := [ 5, 3, 27, 1 ], mathmode := "Text", name := "ManSection", next := 211611, root := ~, start := 210766, stop := 211610 ), rec( content := "\n\n ", count := [ 5, 3, 27, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, source,\ target", Label := "for a source and target", Name := "DigraphDijkstra" ), content := 0, count := [ 5, 3, 28, 2 ], mathmode := "Text", name := "Oper", next := 211724, root := ~, start := 211632, stop := 211723 ), rec( attributes := rec( Arg := "digraph, source" , Label := "for a source", Name := "DigraphDijkstra\ " ), content := 0, count := [ 5, 3, 28, 4 ], mathmode := "Text", name := "Oper", next := 211800, root := ~, start := 211727, stop := 211799 ), rec( attributes := rec( ), content := [ rec( content := "Two lists\ .", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "Returns", next := 211832, root := ~, start := 211803, stop := 211831 ), rec( attributes := rec( ), content := [ rec( content := "\n If ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 211868, root := ~, start := 211854, stop := 211867 ), rec( content := " is a di\ graph and ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ource", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 211899, root := ~, start := 211886, stop := 211898 ), rec( content := " and ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ arget", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 211917, root := ~, start := 211904, stop := 211916 ), rec( content := " are\n \ vertices of ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 211951, root := ~, start := 211937, stop := 211950 ), rec( content := ", then " , count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDijkstra", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "C", next := 211980, root := ~, start := 211958, stop := 211979 ), rec( content := " calcula\ tes the\n length of the shortest path from ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ource", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 212044, root := ~, start := 212031, stop := 212043 ), rec( content := " to ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ arget", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 212061, root := ~, start := 212048, stop := 212060 ), rec( content := " and ret\ urns\n two lists. Each element of the first list is the distance of the\n co\ rresponding element from ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ource", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 212183, root := ~, start := 212170, stop := 212182 ), rec( content := ". If a \ vertex was not visited in\n the process of calculating the shortest distance \ to ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ arget", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 212284, root := ~, start := 212271, stop := 212283 ), rec( content := " or if\n\ there is no path connecting that vertex with ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ource", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 212351, root := ~, start := 212338, stop := 212350 ), rec( content := ", then\n\ the corresponding distance is ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "K", next := 212405, root := ~, start := 212390, stop := 212404 ), rec( content := ". Each \ element of the\n second list gives the previous vertex in the shortest path\n\ from ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ource", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 212509, root := ~, start := 212496, stop := 212508 ), rec( content := " to the \ corresponding vertex. For\n ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ource", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "A", next := 212559, root := ~, start := 212546, stop := 212558 ), rec( content := " and for\ any vertices that remained unvisited this\n will be ", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "-\ 1", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "C", next := 212631, root := ~, start := 212622, stop := 212630 ), rec( content := ".", count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "P", next := 212636, root := ~, start := 212632, stop := 212635 ), rec( content := "\n\n \ If the optional second argument ", count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ arget", count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "A", next := 212687, root := ~, start := 212674, stop := 212686 ), rec( content := " is not \ present, then\n ", count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphDijkstra", count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "C", next := 212735, root := ~, start := 212713, stop := 212734 ), rec( content := " returns\ the shortest path from ", count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ource", count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "A", next := 212780, root := ~, start := 212767, stop := 212779 ), rec( content := " to\n \ every vertex that is reachable from ", count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ource", count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "A", next := 212837, root := ~, start := 212824, stop := 212836 ), rec( content := ".\n\n " , count := [ 5, 3, 28, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> mat := [[0, 1, 1], [0, 0, 1], [0, 0, 0]];\n[ [ 0, 1, 1 ], [ 0, 0, 1 ], [\ 0, 0, 0 ] ]\ngap> D := DigraphByAdjacencyMatrix(mat);\n\ngap> DigraphDijkstra(D, 2, 3);\n[ [ infinity, 0, 1 ], \ [ -1, -1, 2 ] ]\ngap> DigraphDijkstra(D, 1, 3);\n[ [ 0, 1, 1 ], [ -1, 1, 1 ] ]\ \ngap> DigraphDijkstra(D, 1, 2);\n[ [ 0, 1, 1 ], [ -1, 1, 1 ] ]\n", count := [ 5, 3, 28, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 3, 28, 7 ], mathmode := "Text", name := "Example", next := 213240, root := ~, start := 212842, stop := 213239 ), rec( content := "\n", count := [ 5, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 28, 5 ], mathmode := "Text", name := "Description", next := 213255, root := ~, start := 211835, stop := 213254 ) ], count := [ 5, 3, 28, 1 ], mathmode := "Text", name := "ManSection", next := 213269, root := ~, start := 211617, stop := 213268 ), rec( content := "\n\n ", count := [ 5, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 3, 0, 1 ], mathmode := "Text", name := "Section", next := 213283, root := ~, start := 172718, stop := 213282 ) , rec( content := "\n\n ", count := [ 5, 3, 28, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Cayley graphs of \ groups", count := [ 5, 4, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 0, 2 ], mathmode := "Text", name := "Heading", next := 213338, root := ~, start := 213296, stop := 213337 ), rec( content := "\n ", count := [ 5, 4, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "GroupOfCayleyDi\ graph" ), content := 0, count := [ 5, 4, 1, 2 ], mathmode := "Text", name := "Attr", next := 213407, root := ~, start := 213358, stop := 213406 ), rec( attributes := rec( Arg := "digraph", Name := "SemigroupOfCayl\ eyDigraph" ), content := 0, count := [ 5, 4, 1, 4 ], mathmode := "Text", name := "Attr", next := 213463, root := ~, start := 213410, stop := 213462 ), rec( attributes := rec( ), content := [ rec( content := "A group o\ r semigroup.", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "Returns", next := 213506, root := ~, start := 213466, stop := 213505 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "A", next := 213544, root := ~, start := 213530, stop := 213543 ), rec( content := " is an i\ mmutable Cayley graph of a group ", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "C", next := 213593, root := ~, start := 213585, stop := 213592 ), rec( content := " and\n \ ", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "A", next := 213616, root := ~, start := 213602, stop := 213615 ), rec( content := " belongs\ to the category ", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsCayle\ yDigraph" ), content := 0, count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "Ref", next := 213670, root := ~, start := 213641, stop := 213669 ), rec( content := ", then\n\ ", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ roupOfCayleyDigraph", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "C", next := 213708, root := ~, start := 213681, stop := 213707 ), rec( content := " returns\ ", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "C", next := 213725, root := ~, start := 213717, stop := 213724 ), rec( content := ".\n " , count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "P", next := 213735, root := ~, start := 213731, stop := 213734 ), rec( content := "\n\n \ If ", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "A", next := 213758, root := ~, start := 213744, stop := 213757 ), rec( content := " is a Ca\ yley graph of a semigroup ", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ ", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "C", next := 213800, root := ~, start := 213792, stop := 213799 ), rec( content := " and\n \ ", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "A", next := 213823, root := ~, start := 213809, stop := 213822 ), rec( content := " belongs\ to the category ", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsCayle\ yDigraph" ), content := 0, count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "Ref", next := 213877, root := ~, start := 213848, stop := 213876 ), rec( content := ", then\n\ ", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ emigroupOfCayleyDigraph", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "C", next := 213919, root := ~, start := 213888, stop := 213918 ), rec( content := " returns\ ", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "S\ ", count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "C", next := 213936, root := ~, start := 213928, stop := 213935 ), rec( content := ".\n " , count := [ 5, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 4, 1, 7 ], mathmode := "Text", name := "P", next := 213946, root := ~, start := 213942, stop := 213945 ), rec( content := "\n\n \ See also ", count := [ 5, 4, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Generat\ orsOfCayleyDigraph" ), content := 0, count := [ 5, 4, 1, 7 ], mathmode := "Text", name := "Ref", next := 214000, root := ~, start := 213961, stop := 213999 ), rec( content := ".\n " , count := [ 5, 4, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> G := DihedralGroup(IsPermGroup, 8);\nGroup([ (1,2,3,4), (2,4) ])\ngap> d\ igraph := CayleyDigraph(G);\n\nga\ p> GroupOfCayleyDigraph(digraph) = G;\ntrue\n", count := [ 5, 4, 1, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 4, 1, 8 ], mathmode := "Text", name := "Example", next := 214232, root := ~, start := 214006, stop := 214231 ), rec( content := "\n ", count := [ 5, 4, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 1, 5 ], mathmode := "Text", name := "Description", next := 214249, root := ~, start := 213509, stop := 214248 ) ], count := [ 5, 4, 1, 1 ], mathmode := "Text", name := "ManSection", next := 214263, root := ~, start := 213343, stop := 214262 ), rec( content := "\n\n ", count := [ 5, 4, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "GeneratorsOfCay\ leyDigraph" ), content := 0, count := [ 5, 4, 2, 2 ], mathmode := "Text", name := "Attr", next := 214338, root := ~, start := 214284, stop := 214337 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ generators.", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "Returns", next := 214381, root := ~, start := 214341, stop := 214380 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "A", next := 214419, root := ~, start := 214405, stop := 214418 ), rec( content := " is an i\ mmutable Cayley graph of a group or semigroup with\n respect to a set of ge\ nerators ", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ens", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "C", next := 214524, root := ~, start := 214513, stop := 214523 ), rec( content := " and ", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "A", next := 214543, root := ~, start := 214529, stop := 214542 ), rec( content := " belongs\ to\n the category ", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsCayle\ yDigraph" ), content := 0, count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "Ref", next := 214601, root := ~, start := 214572, stop := 214600 ), rec( content := ", then\n\ ", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ eneratorsOfCayleyDigraph", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "C", next := 214644, root := ~, start := 214612, stop := 214643 ), rec( content := " return \ the list of generators ", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ens", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "C", next := 214686, root := ~, start := 214675, stop := 214685 ), rec( content := "\n ov\ er which ", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "A", next := 214716, root := ~, start := 214702, stop := 214715 ), rec( content := " is defi\ ned.\n ", count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 4, 2, 4 ], mathmode := "Text", name := "P", next := 214737, root := ~, start := 214733, stop := 214736 ), rec( content := "\n\n \ See also ", count := [ 5, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "GroupOf\ CayleyDigraph" ), content := 0, count := [ 5, 4, 2, 4 ], mathmode := "Text", name := "Ref", next := 214786, root := ~, start := 214752, stop := 214785 ), rec( content := " \n o\ r ", count := [ 5, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Semigro\ upOfCayleyDigraph" ), content := 0, count := [ 5, 4, 2, 4 ], mathmode := "Text", name := "Ref", next := 214833, root := ~, start := 214795, stop := 214832 ), rec( content := ".\n " , count := [ 5, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> G := DihedralGroup(IsPermGroup, 8);\nGroup([ (1,2,3,4), (2,4) ])\ngap> d\ igraph := CayleyDigraph(G);\n\nga\ p> GeneratorsOfCayleyDigraph(digraph) = GeneratorsOfGroup(G);\ntrue\ngap> digr\ aph := CayleyDigraph(G, [()]);\n\n\ gap> GeneratorsOfCayleyDigraph(digraph) = [()];\ntrue", count := [ 5, 4, 2, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 4, 2, 5 ], mathmode := "Text", name := "Example", next := 215226, root := ~, start := 214839, stop := 215225 ), rec( content := "\n ", count := [ 5, 4, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 2, 3 ], mathmode := "Text", name := "Description", next := 215243, root := ~, start := 214384, stop := 215242 ) ], count := [ 5, 4, 2, 1 ], mathmode := "Text", name := "ManSection", next := 215257, root := ~, start := 214269, stop := 215256 ), rec( content := "\n\n ", count := [ 5, 4, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 4, 0, 1 ], mathmode := "Text", name := "Section", next := 215271, root := ~, start := 213287, stop := 215270 ) , rec( content := "\n\n ", count := [ 5, 4, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Associated semigr\ oups", count := [ 5, 5, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 0, 2 ], mathmode := "Text", name := "Heading", next := 215324, root := ~, start := 215284, stop := 215323 ), rec( content := "\n ", count := [ 5, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "filt, digraph", Label := "for a filter a\ nd a digraph", Name := "AsSemigroup" ), content := 0, count := [ 5, 5, 1, 2 ], mathmode := "Text", name := "Oper", next := 215435, root := ~, start := 215348, stop := 215434 ), rec( attributes := rec( Arg := "filt, digraph", Name := "AsMonoid" ), content := 0, count := [ 5, 5, 1, 4 ], mathmode := "Text", name := "Oper", next := 215483, root := ~, start := 215440, stop := 215482 ), rec( attributes := rec( ), content := [ rec( content := "A semilat\ tice of partial perms.", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "Returns", next := 215538, root := ~, start := 215488, stop := 215537 ), rec( attributes := rec( ), content := [ rec( content := "\n T\ he operation ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sSemigroup", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "C", next := 215595, root := ~, start := 215577, stop := 215594 ), rec( content := " require\ s that ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "A", next := 215621, root := ~, start := 215610, stop := 215620 ), rec( content := " be equa\ l to\n ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Filt := "IsPartialPermSemigroup" ), content := 0, count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "Ref", next := 215691, root := ~, start := 215640, stop := 215690 ), rec( content := ".\n \ If ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "A", next := 215716, root := ~, start := 215702, stop := 215715 ), rec( content := " is a\n \ ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsJoinS\ emilatticeDigraph" ), content := 0, count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "Ref", next := 215766, root := ~, start := 215728, stop := 215765 ), rec( content := " or ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsLatti\ ceDigraph" ), content := 0, count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "Ref", next := 215800, root := ~, start := 215770, stop := 215799 ), rec( content := "\n \ then ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sSemigroup", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "C", next := 215830, root := ~, start := 215812, stop := 215829 ), rec( content := " returns\ a semigroup of partial perms which is\n isomorphic to the semigroup whos\ e elements are the vertices of\n ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "A", next := 215966, root := ~, start := 215952, stop := 215965 ), rec( content := " with th\ e binary operation\n ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Partial\ OrderDigraphJoinOfVertices" ), content := 0, count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "Ref", next := 216046, root := ~, start := 215999, stop := 216045 ), rec( content := ".\n \ If ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "A", next := 216071, root := ~, start := 216057, stop := 216070 ), rec( content := "\n \ satisfies ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMeetS\ emilatticeDigraph" ), content := 0, count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "Ref", next := 216127, root := ~, start := 216089, stop := 216126 ), rec( content := " but not\ \n ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsJoinS\ emilatticeDigraph" ), content := 0, count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "Ref", next := 216180, root := ~, start := 216142, stop := 216179 ), rec( content := " then\n \ ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sSemigroup", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "C", next := 216210, root := ~, start := 216192, stop := 216209 ), rec( content := " returns\ a semigroup of partial perms which is\n isomorphic to the semigroup whos\ e elements are the vertices of\n ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "A", next := 216346, root := ~, start := 216332, stop := 216345 ), rec( content := " with th\ e binary operation\n ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Partial\ OrderDigraphMeetOfVertices" ), content := 0, count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "Ref", next := 216426, root := ~, start := 216379, stop := 216425 ), rec( content := ".\n \ ", count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := 0, count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "P", next := 216438, root := ~, start := 216434, stop := 216437 ), rec( content := "\n\n \ The operation ", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sMonoid", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "C", next := 216475, root := ~, start := 216460, stop := 216474 ), rec( content := " behaves\ similarly to ", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sSemigroup", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "C", next := 216515, root := ~, start := 216497, stop := 216514 ), rec( content := "\n \ except that ", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "A", next := 216545, root := ~, start := 216534, stop := 216544 ), rec( content := " may als\ o be equal to\n ", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Filt := "IsPartialPermMonoid" ), content := 0, count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "Ref", next := 216621, root := ~, start := 216573, stop := 216620 ), rec( content := ",\n \ ", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "A", next := 216643, root := ~, start := 216629, stop := 216642 ), rec( content := " must sa\ tisfy ", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsLatti\ ceDigraph" ), content := 0, count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "Ref", next := 216687, root := ~, start := 216657, stop := 216686 ), rec( content := ", and th\ e\n output satisfies ", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Filt := "IsMonoid" ), content := 0, count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "Ref", next := 216757, root := ~, start := 216720, stop := 216756 ), rec( content := ". ", count := [ 5, 5, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 5, 1, 7 ], mathmode := "Text", name := "P", next := 216763, root := ~, start := 216759, stop := 216762 ), rec( content := "\n\n \ The output of both of these operations is guaranteed to be of minimal\n \ degree (see ", count := [ 5, 5, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "DegreeO\ fPartialPermSemigroup", BookName := "ref" ), content := 0, count := [ 5, 5, 1, 7 ], mathmode := "Text", name := "Ref", next := 216916, root := ~, start := 216859, stop := 216915 ), rec( content := ").\n \ Furthermore the ", count := [ 5, 5, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Generat\ orsOfSemigroup", BookName := "ref" ), content := 0, count := [ 5, 5, 1, 7 ], mathmode := "Text", name := "Ref", next := 216991, root := ~, start := 216941, stop := 216990 ), rec( content := " of\n \ the output is guaranteed to be the unique generating set of minimal size.\n\ ", count := [ 5, 5, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> di := Digraph([[1], [1, 2], [1, 3], [1, 4], [1, 2, 3, 5]]);\n\ngap> S := AsSemigroup(IsPartialPermSemigro\ up, di);\n\ngap> ForAll(El\ ements(S), IsIdempotent);\ntrue\ngap> IsInverseSemigroup(S);\ntrue\ngap> Size(\ S);\n5\ngap> di := Digraph([[1], [1, 2], [1, 2, 3]]);\n\ngap> M := AsMonoid(IsPartialPermMonoid, di);\n\ngap> Size(M);\n3", count := [ 5, 5, 1, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 5, 1, 8 ], mathmode := "Text", name := "Example", next := 217623, root := ~, start := 217081, stop := 217622 ), rec( content := "\n ", count := [ 5, 5, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 1, 5 ], mathmode := "Text", name := "Description", next := 217642, root := ~, start := 215543, stop := 217641 ) ], count := [ 5, 5, 1, 1 ], mathmode := "Text", name := "ManSection", next := 217658, root := ~, start := 215331, stop := 217657 ), rec( content := "\n\n ", count := [ 5, 5, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "filt, Y, gps, ho\ ms", Label := "for a filter, semilattice digraph, and two lists", Name := "AsSemigroup" ), content := 0, count := [ 5, 5, 2, 2 ], mathmode := "Text", name := "Oper", next := 217797, root := ~, start := 217683, stop := 217796 ), rec( attributes := rec( ), content := [ rec( content := " A Cliffo\ rd semigroup of partial perms. ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "Returns", next := 217861, root := ~, start := 217802, stop := 217860 ), rec( attributes := rec( ), content := [ rec( content := "\n T\ he operation ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sSemigroup", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "C", next := 217918, root := ~, start := 217900, stop := 217917 ), rec( content := " require\ s that ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "A", next := 217944, root := ~, start := 217933, stop := 217943 ), rec( content := " be equa\ l to\n ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Filt := "IsPartialPermSemigroup" ), content := 0, count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "Ref", next := 218014, root := ~, start := 217963, stop := 218013 ), rec( content := ".\n \ If ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Y\ ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "A", next := 218033, root := ~, start := 218025, stop := 218032 ), rec( content := " is a ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsJoinS\ emilatticeDigraph" ), content := 0, count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "Ref", next := 218077, root := ~, start := 218039, stop := 218076 ), rec( content := " or\n \ ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMeetS\ emilatticeDigraph" ), content := 0, count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "Ref", next := 218125, root := ~, start := 218087, stop := 218124 ), rec( content := ",\n \ ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "g\ ps", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "A", next := 218143, root := ~, start := 218133, stop := 218142 ), rec( content := " is a li\ st of groups corresponding to each vertex, and\n ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ oms", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "A", next := 218215, root := ~, start := 218204, stop := 218214 ), rec( content := " is a li\ st containing for each edge ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "(\ i, j)", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "C", next := 218264, root := ~, start := 218251, stop := 218263 ), rec( content := " in\n \ the transitive reduction of ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "A", next := 218316, root := ~, start := 218302, stop := 218315 ), rec( content := " a tripl\ e ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i, j, hom]", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "C", next := 218344, root := ~, start := 218326, stop := 218343 ), rec( content := "\n \ where ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ om", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "C", next := 218367, root := ~, start := 218357, stop := 218366 ), rec( content := " is a gr\ oup homomorphism from ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ps[i]", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "C", next := 218410, root := ~, start := 218397, stop := 218409 ), rec( content := " to\n \ ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ps[j]", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "C", next := 218433, root := ~, start := 218420, stop := 218432 ), rec( content := ", and th\ e diagram of homomorphisms commutes, then\n ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ sSemigroup", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "C", next := 218507, root := ~, start := 218489, stop := 218506 ), rec( content := " returns\ a semigroup of partial perms which is\n isomorphic to the strong semilat\ tice of groups ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ [Y; gps; homs]", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "M", next := 218629, root := ~, start := 218607, stop := 218628 ), rec( content := ".\n \ ", count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> G1 := AlternatingGroup(4);;\ngap> G2 := SymmetricGroup(2);;\ngap> G3 := \ SymmetricGroup(3);;\ngap> gr := Digraph([[1, 3], [2, 3], [3]]);;\ngap> sgn := \ function(x)\n> if SignPerm(x) = 1 then\n> return ();\n> fi;\n> return (1, 2);\ \n> end;;\ngap> hom13 := GroupHomomorphismByFunction(G1, G3, sgn);;\ngap> hom2\ 3 := GroupHomomorphismByFunction(G2, G3, sgn);;\ngap> T := AsSemigroup(IsParti\ alPermSemigroup,\n> gr,\n> [G1, G2, G3], [[1, 3, hom13], [2, 3, hom23]]);;\nga\ p> Size(T);\n20\ngap> D := GreensDClasses(T);;\ngap> List(D, x -> Size(x));\n[\ 6, 12, 2 ]\n", count := [ 5, 5, 2, 4 ], name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 4 ], mathmode := "Text", name := "Example", next := 219206, root := ~, start := 218637, stop := 219205 ), rec( content := "\n ", count := [ 5, 5, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 2, 3 ], mathmode := "Text", name := "Description", next := 219225, root := ~, start := 217866, stop := 219224 ) ], count := [ 5, 5, 2, 1 ], mathmode := "Text", name := "ManSection", next := 219241, root := ~, start := 217666, stop := 219240 ), rec( content := "\n\n ", count := [ 5, 5, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 5, 0, 1 ], mathmode := "Text", name := "Section", next := 219255, root := ~, start := 215275, stop := 219254 ) , rec( content := "\n\n ", count := [ 5, 5, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Planarity", count := [ 5, 6, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 0, 2 ], mathmode := "Text", name := "Heading", next := 219296, root := ~, start := 219268, stop := 219295 ), rec( content := "\n ", count := [ 5, 6, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "KuratowskiPlana\ rSubdigraph" ), content := 0, count := [ 5, 6, 1, 2 ], mathmode := "Text", name := "Attr", next := 219371, root := ~, start := 219316, stop := 219370 ), rec( attributes := rec( ), content := [ rec( content := "A list or\ ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "K", next := 219404, root := ~, start := 219393, stop := 219403 ), rec( content := ".", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "Returns", next := 219415, root := ~, start := 219374, stop := 219414 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "K\ uratowskiPlanarSubdigraph", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "C", next := 219469, root := ~, start := 219436, stop := 219468 ), rec( content := " returns\ the immutable list of\n lists of out-neighbours of a (not necessarily indu\ ced) subdigraph of the\n digraph ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "A", next := 219603, root := ~, start := 219589, stop := 219602 ), rec( content := " that wi\ tnesses the fact that ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "A", next := 219647, root := ~, start := 219633, stop := 219646 ), rec( content := " is not\\ n planar, or ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "K", next := 219681, root := ~, start := 219670, stop := 219680 ), rec( content := " if ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "A", next := 219699, root := ~, start := 219685, stop := 219698 ), rec( content := " is plan\ ar. In other words,\n ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "K\ uratowskiPlanarSubdigraph", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "C", next := 219765, root := ~, start := 219732, stop := 219764 ), rec( content := " returns\ the out-neighbours of a\n subdigraph of ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "A", next := 219830, root := ~, start := 219816, stop := 219829 ), rec( content := " that is\ homeomorphic to the complete graph\n with ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "5\ ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "C", next := 219891, root := ~, start := 219883, stop := 219890 ), rec( content := " vertice\ s, or to the complete bipartite graph with vertex sets\n of sizes ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "3\ ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "C", next := 219975, root := ~, start := 219967, stop := 219974 ), rec( content := " and ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "3\ ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "C", next := 219988, root := ~, start := 219980, stop := 219987 ), rec( content := ". ", count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 1, 4 ], mathmode := "Text", name := "P", next := 219994, root := ~, start := 219990, stop := 219993 ), rec( content := "\n \n\ The directions and multiplicities of any edges in ", count := [ 5, 6, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 4 ], mathmode := "Text", name := "A", next := 220068, root := ~, start := 220054, stop := 220067 ), rec( content := " are\n \ ignored when considering whether or not ", count := [ 5, 6, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 4 ], mathmode := "Text", name := "A", next := 220131, root := ~, start := 220117, stop := 220130 ), rec( content := " is plan\ ar. ", count := [ 5, 6, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 1, 5 ], mathmode := "Text", name := "P", next := 220147, root := ~, start := 220143, stop := 220146 ), rec( content := "\n\n \ See also ", count := [ 5, 6, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsPlana\ rDigraph" ), content := 0, count := [ 5, 6, 1, 5 ], mathmode := "Text", name := "Ref", next := 220191, root := ~, start := 220162, stop := 220190 ), rec( content := "\n an\ d ", count := [ 5, 6, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Subdigr\ aphHomeomorphicToK33" ), content := 0, count := [ 5, 6, 1, 5 ], mathmode := "Text", name := "Ref", next := 220241, root := ~, start := 220200, stop := 220240 ), rec( content := ".\n " , count := [ 5, 6, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 1, 6 ], mathmode := "Text", name := "P", next := 220251, root := ~, start := 220247, stop := 220250 ), rec( content := "\n \n\ This method uses the reference implementation in\n ", count := [ 5, 6, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "edge-addition-planarity-suite" ), content := [ rec( content := \ "https://github.com/graph-algorithms/edge-addition-planarity-suite", count := [ \ 5, 6, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 6 ], mathmode := \ "Text", name := "URL", next := 140, root := ~, start := 17, stop := 139 ) ], count := [ 5, 6, 1, 6 ], name := "Alt", next := 146, root := ~, start := 1, stop := 145 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "edge-addition-planarity-suite", count \ := [ 5, 6, 1, 6 ], name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 6 ], name := "Pac\ kage", next := 218, root := ~, start := 170, stop := 217 ) ], count := [ 5, 6, 1, 6 ], mathmode := "Text", name := "Alt", next := 224, root := ~, start := 146, stop := 223 ), rec( content := " by John\ Boyer of the algorithms described\n in ", count := [ 5, 6, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "BM06" ), content := 0, count := [ 5, 6, 1, 6 ], mathmode := "Text", name := "Cite", next := 220413, root := ~, start := 220395, stop := 220412 ), rec( content := ".\n\n", count := [ 5, 6, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], \n> [1, 7, 11], [4\ , 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> KuratowskiPlanarSubdigraph(D);\nfail\ngap> D := Digra\ ph([[2, 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], \n> [2, 5, 8, 9], [1, 2, 3\ , 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10], \n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, \ 9], [2, 3, 5, 6, 7, 8], [3, 5]]);\n\ngap> IsPlanarDigraph(D);\nfalse\ngap> KuratowskiPlanarSubdigraph(D);\n[ [\ 2, 9, 7 ], [ 3 ], [ 6 ], [ 5, 9 ], [ 6 ], [ ], [ 4 ], \n [ 7, 9, 3 ], [ ],\ [ ] ]\ngap> D := Digraph(IsMutableDigraph, [[3, 5, 10], [8, 9, 10], [1, 4],\ \n> [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> KuratowskiPlanarSubdigraph(D)\ ;\nfail\ngap> D := Digraph(IsMutableDigraph, [[2, 4, 7, 9, 10],\n> [1, 3, 4, 6\ , 9, 10], [6, 10], [2, 5, 8, 9],\n> [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9,\ 10],\n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]);\n\ \ngap> IsPlanarDigraph(D);\nfalse\ \ngap> KuratowskiPlanarSubdigraph(D);\n[ [ 2, 9, 7 ], [ 3 ], [ 6 ], [ 5, 9 ], \ [ 6 ], [ ], [ 4 ], \n [ 7, 9, 3 ], [ ], [ ] ]\n", count := [ 5, 6, 1, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 1, 7 ], mathmode := "Text", name := "Example", next := 221715, root := ~, start := 220416, stop := 221714 ), rec( content := "\n ", count := [ 5, 6, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 1, 3 ], mathmode := "Text", name := "Description", next := 221732, root := ~, start := 219418, stop := 221731 ) ], count := [ 5, 6, 1, 1 ], mathmode := "Text", name := "ManSection", next := 221746, root := ~, start := 219301, stop := 221745 ), rec( content := "\n\n ", count := [ 5, 6, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "KuratowskiOuter\ PlanarSubdigraph" ), content := 0, count := [ 5, 6, 2, 2 ], mathmode := "Text", name := "Attr", next := 221827, root := ~, start := 221767, stop := 221826 ), rec( attributes := rec( ), content := [ rec( content := "A list or\ ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "K", next := 221860, root := ~, start := 221849, stop := 221859 ), rec( content := ".", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "Returns", next := 221871, root := ~, start := 221830, stop := 221870 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "K\ uratowskiOuterPlanarSubdigraph", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "C", next := 221930, root := ~, start := 221892, stop := 221929 ), rec( content := " returns\ the immutable list of\n immutable lists of out-neighbours of a (not necess\ arily induced)\n subdigraph of the digraph ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "A", next := 222074, root := ~, start := 222060, stop := 222073 ), rec( content := " that wi\ tnesses the fact\n that ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "A", next := 222122, root := ~, start := 222108, stop := 222121 ), rec( content := " is not \ outer planar, or ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "K", next := 222158, root := ~, start := 222147, stop := 222157 ), rec( content := " if\n \ ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "A", next := 222180, root := ~, start := 222166, stop := 222179 ), rec( content := " is oute\ r planar. In other words,\n ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "K\ uratowskiOuterPlanarSubdigraph", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "C", next := 222257, root := ~, start := 222219, stop := 222256 ), rec( content := " returns\ the out-neighbours of a\n subdigraph of ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "A", next := 222322, root := ~, start := 222308, stop := 222321 ), rec( content := " that is\ homeomorphic to the complete graph\n with ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "4\ ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "C", next := 222383, root := ~, start := 222375, stop := 222382 ), rec( content := " vertice\ s, or to the complete bipartite graph with vertex sets\n of sizes ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "2\ ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "C", next := 222467, root := ~, start := 222459, stop := 222466 ), rec( content := " and ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "3\ ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "C", next := 222480, root := ~, start := 222472, stop := 222479 ), rec( content := ". ", count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 2, 4 ], mathmode := "Text", name := "P", next := 222486, root := ~, start := 222482, stop := 222485 ), rec( content := "\n \n\ The directions and multiplicities of any edges in ", count := [ 5, 6, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 4 ], mathmode := "Text", name := "A", next := 222560, root := ~, start := 222546, stop := 222559 ), rec( content := " are\n \ ignored when considering whether or not ", count := [ 5, 6, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 4 ], mathmode := "Text", name := "A", next := 222623, root := ~, start := 222609, stop := 222622 ), rec( content := " is oute\ r planar. \n ", count := [ 5, 6, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 2, 5 ], mathmode := "Text", name := "P", next := 222650, root := ~, start := 222646, stop := 222649 ), rec( content := "\n\n \ See also \n ", count := [ 5, 6, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsOuter\ PlanarDigraph" ), content := 0, count := [ 5, 6, 2, 5 ], mathmode := "Text", name := "Ref", next := 222704, root := ~, start := 222670, stop := 222703 ), rec( content := ",\n " , count := [ 5, 6, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Subdigr\ aphHomeomorphicToK4" ), content := 0, count := [ 5, 6, 2, 5 ], mathmode := "Text", name := "Ref", next := 222750, root := ~, start := 222710, stop := 222749 ), rec( content := ", and \n\ ", count := [ 5, 6, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Subdigr\ aphHomeomorphicToK23" ), content := 0, count := [ 5, 6, 2, 5 ], mathmode := "Text", name := "Ref", next := 222802, root := ~, start := 222761, stop := 222801 ), rec( content := ".\n " , count := [ 5, 6, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 2, 6 ], mathmode := "Text", name := "P", next := 222812, root := ~, start := 222808, stop := 222811 ), rec( content := "\n\n \ This method uses the reference implementation in\n ", count := [ 5, 6, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "edge-addition-planarity-suite" ), content := [ rec( content := \ "https://github.com/graph-algorithms/edge-addition-planarity-suite", count := [ \ 5, 6, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 6 ], mathmode := \ "Text", name := "URL", next := 140, root := ~, start := 17, stop := 139 ) ], count := [ 5, 6, 2, 6 ], name := "Alt", next := 146, root := ~, start := 1, stop := 145 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "edge-addition-planarity-suite", count \ := [ 5, 6, 2, 6 ], name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 6 ], name := "Pac\ kage", next := 218, root := ~, start := 170, stop := 217 ) ], count := [ 5, 6, 2, 6 ], mathmode := "Text", name := "Alt", next := 224, root := ~, start := 146, stop := 223 ), rec( content := " by John\ Boyer of the algorithms described\n in ", count := [ 5, 6, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "BM06" ), content := 0, count := [ 5, 6, 2, 6 ], mathmode := "Text", name := "Cite", next := 222970, root := ~, start := 222952, stop := 222969 ), rec( content := ".\n\n", count := [ 5, 6, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], \n> [1, 7, 11], [4\ , 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> KuratowskiOuterPlanarSubdigraph(D);\n[ [ 3, 5, 10 ], \ [ 9, 8, 10 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ]\ ]\ngap> D := Digraph([[2, 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], \n> [2,\ 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10], \n> [3, 4, 5, 6, 9,\ 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]);\n\ngap> IsOuterPlanarDigraph(D);\nfalse\ngap> KuratowskiO\ uterPlanarSubdigraph(D);\n[ [ ], [ ], [ ], [ 8, 9 ], [ ], [ ], [ 9, 4 ], \ [ 7, 9 ], [ ], \n [ ] ]\ngap> D := Digraph(IsMutableDigraph, [[3, 5, 10], [\ 8, 9, 10], [1, 4],\n> [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1,\ 2], [5, 9]]);\n\ngap> KuratowskiO\ uterPlanarSubdigraph(D);\n[ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [ 6 ], [ 11 ], \ [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> D := Digraph(IsMutableDigra\ ph, [[2, 4, 7, 9, 10],\n> [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9],\n> [1, 2\ , 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10],\n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7\ , 9], [2, 3, 5, 6, 7, 8], [3, 5]]);\n\ngap> IsOuterPlanarDigraph(D);\nfalse\ngap> KuratowskiOuterPlanarSubdigrap\ h(D);\n[ [ ], [ ], [ ], [ 8, 9 ], [ ], [ ], [ 9, 4 ], [ 7, 9 ], [ ], \n \ [ ] ]", count := [ 5, 6, 2, 7 ], name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 7 ], mathmode := "Text", name := "Example", next := 224463, root := ~, start := 222973, stop := 224462 ), rec( content := "\n ", count := [ 5, 6, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 2, 3 ], mathmode := "Text", name := "Description", next := 224480, root := ~, start := 221874, stop := 224479 ) ], count := [ 5, 6, 2, 1 ], mathmode := "Text", name := "ManSection", next := 224494, root := ~, start := 221752, stop := 224493 ), rec( content := "\n\n ", count := [ 5, 6, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "PlanarEmbedding\ " ), content := 0, count := [ 5, 6, 3, 2 ], mathmode := "Text", name := "Attr", next := 224559, root := ~, start := 224515, stop := 224558 ), rec( attributes := rec( ), content := [ rec( content := "A list or\ ", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "K", next := 224592, root := ~, start := 224581, stop := 224591 ), rec( content := ".", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "Returns", next := 224603, root := ~, start := 224562, stop := 224602 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "A", next := 224641, root := ~, start := 224627, stop := 224640 ), rec( content := " is a pl\ anar digraph, then \n ", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "P\ lanarEmbedding", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "C", next := 224695, root := ~, start := 224673, stop := 224694 ), rec( content := " returns\ the immutable list of lists of\n out-neighbours of a subdigraph of ", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "A", next := 224787, root := ~, start := 224773, stop := 224786 ), rec( content := " such th\ at each vertex's\n neighbours are given in clockwise order. If ", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "A", next := 224874, root := ~, start := 224860, stop := 224873 ), rec( content := " is not \ planar,\n then ", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "K", next := 224910, root := ~, start := 224899, stop := 224909 ), rec( content := " is retu\ rned. ", count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 3, 4 ], mathmode := "Text", name := "P", next := 224928, root := ~, start := 224924, stop := 224927 ), rec( content := "\n \n\ The directions and multiplicities of any edges in ", count := [ 5, 6, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 4 ], mathmode := "Text", name := "A", next := 225002, root := ~, start := 224988, stop := 225001 ), rec( content := " are\n \ ignored by ", count := [ 5, 6, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "P\ lanarEmbedding", count := [ 5, 6, 3, 4 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 5, 6, 3, 4 ], mathmode := "Text", name := "C", next := 225044, root := ~, start := 225022, stop := 225043 ), rec( content := ".\n " , count := [ 5, 6, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 3, 5 ], mathmode := "Text", name := "P", next := 225054, root := ~, start := 225050, stop := 225053 ), rec( content := "\n\n \ See also \n ", count := [ 5, 6, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsPlana\ rDigraph" ), content := 0, count := [ 5, 6, 3, 5 ], mathmode := "Text", name := "Ref", next := 225103, root := ~, start := 225074, stop := 225102 ), rec( content := ".\n " , count := [ 5, 6, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 3, 6 ], mathmode := "Text", name := "P", next := 225113, root := ~, start := 225109, stop := 225112 ), rec( content := "\n\n \ This method uses the reference implementation in\n ", count := [ 5, 6, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "edge-addition-planarity-suite" ), content := [ rec( content := \ "https://github.com/graph-algorithms/edge-addition-planarity-suite", count := [ \ 5, 6, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 6 ], mathmode := \ "Text", name := "URL", next := 140, root := ~, start := 17, stop := 139 ) ], count := [ 5, 6, 3, 6 ], name := "Alt", next := 146, root := ~, start := 1, stop := 145 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "edge-addition-planarity-suite", count \ := [ 5, 6, 3, 6 ], name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 6 ], name := "Pac\ kage", next := 218, root := ~, start := 170, stop := 217 ) ], count := [ 5, 6, 3, 6 ], mathmode := "Text", name := "Alt", next := 224, root := ~, start := 146, stop := 223 ), rec( content := " by John\ Boyer of the algorithms described\n in ", count := [ 5, 6, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "BM06" ), content := 0, count := [ 5, 6, 3, 6 ], mathmode := "Text", name := "Cite", next := 225271, root := ~, start := 225253, stop := 225270 ), rec( content := ".\n\n", count := [ 5, 6, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], \n> [1, 7, 11], [4\ , 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> PlanarEmbedding(D);\n[ [ 3, 10, 5 ], [ 10, 8, 9 ], [ \ 4 ], [ 6 ], [ 11, 7 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> D :=\ Digraph([[2, 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], \n> [2, 5, 8, 9], [1\ , 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10], \n> [3, 4, 5, 6, 9, 10], [3, 4, \ 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]);\n\ngap> PlanarEmbedding(D);\nfail\ngap> D := Digraph(IsMutableDigraph,\ [[3, 5, 10], [8, 9, 10], [1, 4],\n> [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7\ ], [2, 11], [1, 2], [5, 9]]);\n\ng\ ap> PlanarEmbedding(D);\n[ [ 3, 10, 5 ], [ 10, 8, 9 ], [ 4 ], [ 6 ], [ 11, 7 ]\ , [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> D := Digraph(IsMutableDig\ raph, [[2, 4, 7, 9, 10],\n> [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9],\n> [1,\ 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10],\n> [3, 4, 5, 6, 9, 10], [3, 4, 5,\ 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]);\n\ngap> PlanarEmbedding(D);\nfail\n", count := [ 5, 6, 3, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 3, 7 ], mathmode := "Text", name := "Example", next := 226489, root := ~, start := 225274, stop := 226488 ), rec( content := "\n ", count := [ 5, 6, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 3, 3 ], mathmode := "Text", name := "Description", next := 226506, root := ~, start := 224606, stop := 226505 ) ], count := [ 5, 6, 3, 1 ], mathmode := "Text", name := "ManSection", next := 226520, root := ~, start := 224500, stop := 226519 ), rec( content := "\n\n ", count := [ 5, 6, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "OuterPlanarEmbe\ dding" ), content := 0, count := [ 5, 6, 4, 2 ], mathmode := "Text", name := "Attr", next := 226590, root := ~, start := 226541, stop := 226589 ), rec( attributes := rec( ), content := [ rec( content := "A list or\ ", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "K", next := 226623, root := ~, start := 226612, stop := 226622 ), rec( content := ".", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "Returns", next := 226634, root := ~, start := 226593, stop := 226633 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "A", next := 226672, root := ~, start := 226658, stop := 226671 ), rec( content := " is an o\ uter planar digraph, then\n ", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ uterPlanarEmbedding", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "C", next := 226737, root := ~, start := 226710, stop := 226736 ), rec( content := " returns\ the immutable list of lists\n of out-neighbours of a subdigraph of ", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "A", next := 226829, root := ~, start := 226815, stop := 226828 ), rec( content := " such th\ at each\n vertex's neighbours are given in clockwise order. If ", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "A", next := 226916, root := ~, start := 226902, stop := 226915 ), rec( content := " is not\\ n outer planar, then ", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "K", next := 226958, root := ~, start := 226947, stop := 226957 ), rec( content := " is retu\ rned. ", count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 4, 4 ], mathmode := "Text", name := "P", next := 226976, root := ~, start := 226972, stop := 226975 ), rec( content := "\n \n\ The directions and multiplicities of any edges in ", count := [ 5, 6, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 4 ], mathmode := "Text", name := "A", next := 227050, root := ~, start := 227036, stop := 227049 ), rec( content := " are\n \ ignored by ", count := [ 5, 6, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ uterPlanarEmbedding", count := [ 5, 6, 4, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 4, 4 ], mathmode := "Text", name := "C", next := 227097, root := ~, start := 227070, stop := 227096 ), rec( content := ".\n " , count := [ 5, 6, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 4, 5 ], mathmode := "Text", name := "P", next := 227107, root := ~, start := 227103, stop := 227106 ), rec( content := "\n\n \ See also ", count := [ 5, 6, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsOuter\ PlanarDigraph" ), content := 0, count := [ 5, 6, 4, 5 ], mathmode := "Text", name := "Ref", next := 227156, root := ~, start := 227122, stop := 227155 ), rec( content := ".\n " , count := [ 5, 6, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 4, 6 ], mathmode := "Text", name := "P", next := 227166, root := ~, start := 227162, stop := 227165 ), rec( content := "\n\n \ This method uses the reference implementation in\n ", count := [ 5, 6, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "edge-addition-planarity-suite" ), content := [ rec( content := \ "https://github.com/graph-algorithms/edge-addition-planarity-suite", count := [ \ 5, 6, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 6 ], mathmode := \ "Text", name := "URL", next := 140, root := ~, start := 17, stop := 139 ) ], count := [ 5, 6, 4, 6 ], name := "Alt", next := 146, root := ~, start := 1, stop := 145 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "edge-addition-planarity-suite", count \ := [ 5, 6, 4, 6 ], name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 6 ], name := "Pac\ kage", next := 218, root := ~, start := 170, stop := 217 ) ], count := [ 5, 6, 4, 6 ], mathmode := "Text", name := "Alt", next := 224, root := ~, start := 146, stop := 223 ), rec( content := " by John\ Boyer of the algorithms described\n in ", count := [ 5, 6, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "BM06" ), content := 0, count := [ 5, 6, 4, 6 ], mathmode := "Text", name := "Cite", next := 227324, root := ~, start := 227306, stop := 227323 ), rec( content := ".\n\n", count := [ 5, 6, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], \n> [1, 7, 11], [4\ , 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> OuterPlanarEmbedding(D);\nfail\ngap> D := Digraph([[2\ , 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], \n> [2, 5, 8, 9], [1, 2, 3, 4, 6\ , 7, 9, 10], [3, 4, 5, 7, 9, 10], \n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2\ , 3, 5, 6, 7, 8], [3, 5]]);\n\ng\ ap> OuterPlanarEmbedding(D);\nfail\ngap> OuterPlanarEmbedding(CompleteBipartit\ eDigraph(2, 2));\n[ [ 3, 4 ], [ 4, 3 ], [ ], [ ] ]\ngap> D := Digraph(IsMuta\ bleDigraph, [[3, 5, 10], [8, 9, 10], [1, 4],\n> [3, 6], [1, 7, 11], [4, 7], [6\ , 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> OuterPlanarEmbedding(D);\nfail\ngap> D := Digraph(IsMutableDigr\ aph, [[2, 4, 7, 9, 10],\n> [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9],\n> [1, \ 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10],\n> [3, 4, 5, 6, 9, 10], [3, 4, 5, \ 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]);\n\ngap> OuterPlanarEmbedding(D);\nfail\ngap> OuterPlanarEmbedding(CompleteB\ ipartiteDigraph(2, 2));\n[ [ 3, 4 ], [ 4, 3 ], [ ], [ ] ]\n", count := [ 5, 6, 4, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 4, 7 ], mathmode := "Text", name := "Example", next := 228562, root := ~, start := 227327, stop := 228561 ), rec( content := "\n ", count := [ 5, 6, 4, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 4, 3 ], mathmode := "Text", name := "Description", next := 228579, root := ~, start := 226637, stop := 228578 ) ], count := [ 5, 6, 4, 1 ], mathmode := "Text", name := "ManSection", next := 228593, root := ~, start := 226526, stop := 228592 ), rec( content := "\n\n ", count := [ 5, 6, 4, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "SubdigraphHomeo\ morphicToK23" ), content := 0, count := [ 5, 6, 5, 2 ], mathmode := "Text", name := "Attr", next := 228670, root := ~, start := 228614, stop := 228669 ), rec( attributes := rec( Arg := "digraph", Name := "SubdigraphHomeo\ morphicToK33" ), content := 0, count := [ 5, 6, 5, 4 ], mathmode := "Text", name := "Attr", next := 228729, root := ~, start := 228673, stop := 228728 ), rec( attributes := rec( Arg := "digraph", Name := "SubdigraphHomeo\ morphicToK4" ), content := 0, count := [ 5, 6, 5, 6 ], mathmode := "Text", name := "Attr", next := 228787, root := ~, start := 228732, stop := 228786 ), rec( attributes := rec( ), content := [ rec( content := "A list or\ ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "K", next := 228820, root := ~, start := 228809, stop := 228819 ), rec( content := ".", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "Returns", next := 228831, root := ~, start := 228790, stop := 228830 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ se attributes return the immutable list of lists of\n out-neighbours of a s\ ubdigraph of the digraph ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "A", next := 228971, root := ~, start := 228957, stop := 228970 ), rec( content := " which i\ s\n homeomorphic to one of the following:\n the complete bipartite graph\ with vertex sets of sizes ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "2\ ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "C", next := 229090, root := ~, start := 229082, stop := 229089 ), rec( content := " and\n \ ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "3\ ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "C", next := 229107, root := ~, start := 229099, stop := 229106 ), rec( content := "; the co\ mplete bipartite graph with vertex sets of sizes ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "3\ ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "C", next := 229172, root := ~, start := 229164, stop := 229171 ), rec( content := "\n an\ d ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "3\ ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "C", next := 229189, root := ~, start := 229181, stop := 229188 ), rec( content := "; or the\ complete graph with ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "4\ ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "C", next := 229226, root := ~, start := 229218, stop := 229225 ), rec( content := " vertice\ s. If\n ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "A", next := 229258, root := ~, start := 229244, stop := 229257 ), rec( content := " has no \ such subdigraphs, then ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "K", next := 229300, root := ~, start := 229289, stop := 229299 ), rec( content := " is retu\ rned. \n ", count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 5, 8 ], mathmode := "Text", name := "P", next := 229323, root := ~, start := 229319, stop := 229322 ), rec( content := "\n\n \ See also ", count := [ 5, 6, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsPlana\ rDigraph" ), content := 0, count := [ 5, 6, 5, 8 ], mathmode := "Text", name := "Ref", next := 229367, root := ~, start := 229338, stop := 229366 ), rec( content := " and ", count := [ 5, 6, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsOuter\ PlanarDigraph" ), content := 0, count := [ 5, 6, 5, 8 ], mathmode := "Text", name := "Ref", next := 229412, root := ~, start := 229372, stop := 229411 ), rec( content := " for mor\ e details.", count := [ 5, 6, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 5, 6, 5, 9 ], mathmode := "Text", name := "P", next := 229434, root := ~, start := 229430, stop := 229433 ), rec( content := "\n\n \ This method uses the reference implementation in\n ", count := [ 5, 6, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "edge-addition-planarity-suite" ), content := [ rec( content := \ "https://github.com/graph-algorithms/edge-addition-planarity-suite", count := [ \ 5, 6, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 9 ], mathmode := \ "Text", name := "URL", next := 140, root := ~, start := 17, stop := 139 ) ], count := [ 5, 6, 5, 9 ], name := "Alt", next := 146, root := ~, start := 1, stop := 145 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "edge-addition-planarity-suite", count \ := [ 5, 6, 5, 9 ], name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 9 ], name := "Pac\ kage", next := 218, root := ~, start := 170, stop := 217 ) ], count := [ 5, 6, 5, 9 ], mathmode := "Text", name := "Alt", next := 224, root := ~, start := 146, stop := 223 ), rec( content := " by John\ Boyer of the algorithms described\n in ", count := [ 5, 6, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "BM06" ), content := 0, count := [ 5, 6, 5, 9 ], mathmode := "Text", name := "Cite", next := 229592, root := ~, start := 229574, stop := 229591 ), rec( content := ".\n\n", count := [ 5, 6, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 7, 11], \n> [4\ , 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> SubdigraphHomeomorphicToK4(D);\n[ [ 3, 5, 10 ], [ 9, \ 8, 10 ], [ 4 ], [ 6 ], [ 7, 11 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ \ngap> SubdigraphHomeomorphicToK23(D);\n[ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [\ 6 ], [ 11 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> D := Digraph(\ [[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 11], \n> [4, 7], [6, 8], [2, 7],\ [2, 11], [1, 2], [5, 9]]);\n\ng\ ap> SubdigraphHomeomorphicToK4(D);\nfail\ngap> SubdigraphHomeomorphicToK23(D);\ \n[ [ 3, 10, 5 ], [ 10, 8, 9 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ], \n [ ], \ [ 11 ], [ ], [ ] ]\ngap> SubdigraphHomeomorphicToK33(D);\nfail\ngap> Subdigr\ aphHomeomorphicToK23(NullDigraph(0));\nfail\ngap> SubdigraphHomeomorphicToK33(\ CompleteDigraph(5));\nfail\ngap> SubdigraphHomeomorphicToK33(CompleteBipartite\ Digraph(3, 3));\n[ [ 4, 6, 5 ], [ 4, 5, 6 ], [ 6, 5, 4 ], [ ], [ ], [ ] ]\n\ gap> SubdigraphHomeomorphicToK4(CompleteDigraph(3));\nfail\ngap> D := Digraph(\ IsMutableDigraph, [[3, 5, 10], [8, 9, 10], [1, 4],\n> [3, 6], [1, 7, 11], [4, \ 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> SubdigraphHomeomorphicToK4(D);\n[ [ 3, 5, 10 ], [ 9, 8, 1\ 0 ], [ 4 ], [ 6 ], [ 7, 11 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\nga\ p> SubdigraphHomeomorphicToK23(D);\n[ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [ 6 ]\ , [ 11 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> D := Digraph(IsMu\ tableDigraph, [[3, 5, 10], [8, 9, 10], [1, 4],\n> [3, 6], [1, 11], [4, 7], [6,\ 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> SubdigraphHomeomorphicToK4(D);\nfail\ngap> SubdigraphHomeomorphi\ cToK23(D);\n[ [ 3, 10, 5 ], [ 10, 8, 9 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ], \ \n [ ], [ 11 ], [ ], [ ] ]\ngap> SubdigraphHomeomorphicToK33(D);\nfail\nga\ p> SubdigraphHomeomorphicToK23(NullDigraph(0));\nfail\ngap> SubdigraphHomeomor\ phicToK33(CompleteDigraph(5));\nfail\ngap> SubdigraphHomeomorphicToK33(Complet\ eBipartiteDigraph(3, 3));\n[ [ 4, 6, 5 ], [ 4, 5, 6 ], [ 6, 5, 4 ], [ ], [ ]\ , [ ] ]\ngap> SubdigraphHomeomorphicToK4(CompleteDigraph(3));\nfail\n", count := [ 5, 6, 5, 10 ], name := "PCD\ ATA", root := ~ ) ], count := [ 5, 6, 5, 10 ], mathmode := "Text", name := "Example", next := 231904, root := ~, start := 229595, stop := 231903 ), rec( content := "\n ", count := [ 5, 6, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 5, 7 ], mathmode := "Text", name := "Description", next := 231921, root := ~, start := 228834, stop := 231920 ) ], count := [ 5, 6, 5, 1 ], mathmode := "Text", name := "ManSection", next := 231935, root := ~, start := 228599, stop := 231934 ), rec( content := "\n\n ", count := [ 5, 6, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 6, 0, 1 ], mathmode := "Text", name := "Section", next := 231949, root := ~, start := 219259, stop := 231948 ) , rec( content := "\n\n", count := [ 5, 6, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 5, 0, 0, 1 ], mathmode := "Text", name := "Chapter", next := 231961, root := ~, start := 131997, stop := 231960 ), rec( content := "\n ", count := [ 5, 6, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " attributes, operations ", count := [ 5, 6, 5, 11 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 5, 6, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Properties of digraphs" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Properties of digraphs", count := [ 6, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 232078, root := ~, start := 232037, stop := 232077 ) , rec( content := "\n\n ", count := [ 6, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Edge properties", count := [ 6, 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 232125, root := ~, start := 232091, stop := 232124 ), rec( content := "\n ", count := [ 6, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphHasLoops\ " ), content := 0, count := [ 6, 1, 1, 2 ], mathmode := "Text", name := "Prop", next := 232189, root := ~, start := 232145, stop := 232188 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "K", next := 232212, root := ~, start := 232201, stop := 232211 ), rec( content := " or ", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "K", next := 232228, root := ~, start := 232216, stop := 232227 ), rec( content := ".", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "Returns", next := 232239, root := ~, start := 232192, stop := 232238 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns ", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "K", next := 232279, root := ~, start := 232268, stop := 232278 ), rec( content := " if the \ digraph ", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "A", next := 232309, root := ~, start := 232295, stop := 232308 ), rec( content := " has loo\ ps, and\n ", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "K", next := 232341, root := ~, start := 232329, stop := 232340 ), rec( content := " if it d\ oes not. A loop is an edge with equal source and range.\n ", count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 1, 4 ], mathmode := "Text", name := "P", next := 232413, root := ~, start := 232409, stop := 232412 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 1, 4 ], mathmode := "Text", name := "A", next := 232455, root := ~, start := 232441, stop := 232454 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n", count := [ 6, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2], [2]]);\n\ngap> DigraphEdges(D);\n[ [ 1, 1 ], [ 1, 2 ], [ 2, 2 ] ]\ngap> DigraphHasLo\ ops(D);\ntrue\ngap> D := Digraph([[2, 3], [1], [2]]);\n\ngap> DigraphEdges(D);\n[ [ 1, 2 ], [ 1, 3 ], [ 2, 1 ], \ [ 3, 2 ] ]\ngap> DigraphHasLoops(D);\nfalse\ngap> D := CompleteDigraph(IsMutab\ leDigraph, 4);\n\ngap> DigraphHasLo\ ops(D);\nfalse", count := [ 6, 1, 1, 5 ], name := "PCDATA", root := ~ ) ], count := [ 6, 1, 1, 5 ], mathmode := "Text", name := "Example", next := 233050, root := ~, start := 232552, stop := 233049 ), rec( content := "\n ", count := [ 6, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 1, 3 ], mathmode := "Text", name := "Description", next := 233067, root := ~, start := 232242, stop := 233066 ) ], count := [ 6, 1, 1, 1 ], mathmode := "Text", name := "ManSection", next := 233081, root := ~, start := 232130, stop := 233080 ), rec( content := "\n\n ", count := [ 6, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsAntiSymmetric\ Digraph" ), content := 0, count := [ 6, 1, 2, 2 ], mathmode := "Text", name := "Prop", next := 233153, root := ~, start := 233102, stop := 233152 ), rec( attributes := rec( Arg := "digraph", Name := "IsAntisymmetric\ Digraph" ), content := 0, count := [ 6, 1, 2, 4 ], mathmode := "Text", name := "Prop", next := 233207, root := ~, start := 233156, stop := 233206 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "K", next := 233230, root := ~, start := 233219, stop := 233229 ), rec( content := " or ", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "K", next := 233246, root := ~, start := 233234, stop := 233245 ), rec( content := ".", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "Returns", next := 233257, root := ~, start := 233210, stop := 233256 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "K", next := 233306, root := ~, start := 233295, stop := 233305 ), rec( content := " if the \ digraph ", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "A", next := 233336, root := ~, start := 233322, stop := 233335 ), rec( content := "\n is\ antisymmetric, and ", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "K", next := 233375, root := ~, start := 233363, stop := 233374 ), rec( content := " if it i\ s not.\n ", count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "P", next := 233398, root := ~, start := 233394, stop := 233397 ), rec( content := "\n\n \ A digraph is ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ ntisymmetric", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "E", next := 233437, root := ~, start := 233417, stop := 233436 ), rec( content := " if when\ ever there is an edge with source\n ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "C", next := 233491, root := ~, start := 233483, stop := 233490 ), rec( content := " and ran\ ge ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "C", next := 233510, root := ~, start := 233502, stop := 233509 ), rec( content := ", and an\ edge with source ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "C", next := 233544, root := ~, start := 233536, stop := 233543 ), rec( content := " and ran\ ge\n ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "C", next := 233567, root := ~, start := 233559, stop := 233566 ), rec( content := ", then t\ he vertices ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "C", next := 233595, root := ~, start := 233587, stop := 233594 ), rec( content := " and ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "C", next := 233608, root := ~, start := 233600, stop := 233607 ), rec( content := " are equ\ al.\n ", count := [ 6, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 2, 7 ], mathmode := "Text", name := "P", next := 233628, root := ~, start := 233624, stop := 233627 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 7 ], mathmode := "Text", name := "A", next := 233670, root := ~, start := 233656, stop := 233669 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := Digraph([[2], [1, 3], [2, 3]]);\n\ngap> IsAntisymmetricDigraph(gr1);\nfalse\ngap> DigraphEdges(gr1)\ {[1, 2]};\n[ [ 1, 2 ], [ 2, 1 ] ]\ngap> gr2 := Digraph([[1, 2], [3, 3], [1]]);\ \n\ngap> IsAntisymmetricDigra\ ph(gr2);\ntrue\ngap> DigraphEdges(gr2);\n[ [ 1, 1 ], [ 1, 2 ], [ 2, 3 ], [ 2, \ 3 ], [ 3, 1 ] ]\n", count := [ 6, 1, 2, 8 ], name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 8 ], mathmode := "Text", name := "Example", next := 234197, root := ~, start := 233771, stop := 234196 ), rec( content := "\n ", count := [ 6, 1, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 2, 5 ], mathmode := "Text", name := "Description", next := 234214, root := ~, start := 233260, stop := 234213 ) ], count := [ 6, 1, 2, 1 ], mathmode := "Text", name := "ManSection", next := 234228, root := ~, start := 233087, stop := 234227 ), rec( content := "\n\n ", count := [ 6, 1, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsBipartiteDigr\ aph" ), content := 0, count := [ 6, 1, 3, 2 ], mathmode := "Text", name := "Prop", next := 234296, root := ~, start := 234249, stop := 234295 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "K", next := 234319, root := ~, start := 234308, stop := 234318 ), rec( content := " or ", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "K", next := 234335, root := ~, start := 234323, stop := 234334 ), rec( content := ".", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "Returns", next := 234346, root := ~, start := 234299, stop := 234345 ), rec( attributes := rec( ), content := [ rec( content := "\n This \ property is ", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "K", next := 234393, root := ~, start := 234382, stop := 234392 ), rec( content := " if the \ digraph ", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "A", next := 234423, root := ~, start := 234409, stop := 234422 ), rec( content := " is bipa\ rtite, and\n ", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "K", next := 234456, root := ~, start := 234444, stop := 234455 ), rec( content := " if it i\ s not. A digraph is bipartite if and only if the\n vertices of ", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "A", next := 234542, root := ~, start := 234528, stop := 234541 ), rec( content := " can be \ partitioned into two non-empty sets such\n that the source and range of any e\ dge of ", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "A", next := 234648, root := ~, start := 234634, stop := 234647 ), rec( content := " lie in \ distinct sets.\n Equivalently, a digraph is bipartite if and only if it is 2-\ colorable; see\n ", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ GreedyColouring", Label := "for a digraph" ), content := 0, count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "Ref", next := 234808, root := ~, start := 234750, stop := 234807 ), rec( content := ". ", count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 3, 4 ], mathmode := "Text", name := "P", next := 234814, root := ~, start := 234810, stop := 234813 ), rec( content := "\n\n Se\ e also ", count := [ 6, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Bicomponents" ), content := 0, count := [ 6, 1, 3, 4 ], mathmode := "Text", name := "Ref", next := 234860, root := ~, start := 234827, stop := 234859 ), rec( content := ".\n " , count := [ 6, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 3, 5 ], mathmode := "Text", name := "P", next := 234870, root := ~, start := 234866, stop := 234869 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 5 ], mathmode := "Text", name := "A", next := 234912, root := ~, start := 234898, stop := 234911 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := ChainDigraph(4);\n\ngap> I\ sBipartiteDigraph(D);\ntrue\ngap> D := CycleDigraph(3);\n\ngap> IsBipartiteDigraph(D);\nfalse\ngap> D := CompleteBi\ partiteDigraph(IsMutableDigraph, 5, 4);\n\ngap> IsBipartiteDigraph(D);\ntrue", count := [ 6, 1, 3, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 3, 6 ], mathmode := "Text", name := "Example", next := 235385, root := ~, start := 235012, stop := 235384 ), rec( content := "\n ", count := [ 6, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 3, 3 ], mathmode := "Text", name := "Description", next := 235402, root := ~, start := 234349, stop := 235401 ) ], count := [ 6, 1, 3, 1 ], mathmode := "Text", name := "ManSection", next := 235416, root := ~, start := 234234, stop := 235415 ), rec( content := "\n\n ", count := [ 6, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsCompleteBipar\ titeDigraph" ), content := 0, count := [ 6, 1, 4, 2 ], mathmode := "Text", name := "Prop", next := 235492, root := ~, start := 235437, stop := 235491 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "K", next := 235515, root := ~, start := 235504, stop := 235514 ), rec( content := " or ", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "K", next := 235531, root := ~, start := 235519, stop := 235530 ), rec( content := ".", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "Returns", next := 235542, root := ~, start := 235495, stop := 235541 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns ", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "K", next := 235582, root := ~, start := 235571, stop := 235581 ), rec( content := " if the \ digraph ", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "A", next := 235612, root := ~, start := 235598, stop := 235611 ), rec( content := " is a co\ mplete bipartite\n digraph, and ", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "K", next := 235666, root := ~, start := 235654, stop := 235665 ), rec( content := " if it i\ s not. ", count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "P", next := 235685, root := ~, start := 235681, stop := 235684 ), rec( content := "\n\n \ A digraph is a ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omplete bipartite digraph", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "E", next := 235739, root := ~, start := 235706, stop := 235738 ), rec( content := " if it i\ s bipartite, see\n ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsBipar\ titeDigraph" ), content := 0, count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "Ref", next := 235800, root := ~, start := 235768, stop := 235799 ), rec( content := ", and th\ ere exists a unique edge with\n source ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "C", next := 235857, root := ~, start := 235849, stop := 235856 ), rec( content := " and ran\ ge ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "C", next := 235876, root := ~, start := 235868, stop := 235875 ), rec( content := " if and \ only if ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "C", next := 235900, root := ~, start := 235892, stop := 235899 ), rec( content := " and ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "C", next := 235913, root := ~, start := 235905, stop := 235912 ), rec( content := " lie\n \ in different bicomponents of ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "A", next := 235965, root := ~, start := 235951, stop := 235964 ), rec( content := ", see ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Bicomponents" ), content := 0, count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "Ref", next := 236010, root := ~, start := 235971, stop := 236009 ), rec( content := ". ", count := [ 6, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "P", next := 236016, root := ~, start := 236012, stop := 236015 ), rec( content := "\n\n \ Equivalently, a bipartite digraph with bicomponents of size ", count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "M", next := 236090, root := ~, start := 236082, stop := 236089 ), rec( content := " and\n \ ", count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "M", next := 236107, root := ~, start := 236099, stop := 236106 ), rec( content := " is comp\ lete precisely when it has ", count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "2\ mn", count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "M", next := 236152, root := ~, start := 236142, stop := 236151 ), rec( content := " edges, \ none of which\n are multiple edges. ", count := [ 6, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 4, 6 ], mathmode := "Text", name := "P", next := 236202, root := ~, start := 236198, stop := 236201 ), rec( content := "\n\n \ See also ", count := [ 6, 1, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Complet\ eBipartiteDigraph" ), content := 0, count := [ 6, 1, 4, 6 ], mathmode := "Text", name := "Ref", next := 236255, root := ~, start := 236217, stop := 236254 ), rec( content := ".\n " , count := [ 6, 1, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 4, 7 ], mathmode := "Text", name := "P", next := 236265, root := ~, start := 236261, stop := 236264 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 7 ], mathmode := "Text", name := "A", next := 236307, root := ~, start := 236293, stop := 236306 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 1, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(2);\n\ngap> I\ sCompleteBipartiteDigraph(D);\ntrue\ngap> D := CycleDigraph(4);\n\ngap> IsBipartiteDigraph(D);\ntrue\ngap> IsComple\ teBipartiteDigraph(D);\nfalse\ngap> D := CompleteBipartiteDigraph(IsMutableDig\ raph, 5, 4);\n\ngap> IsCompleteBipa\ rtiteDigraph(D);\ntrue", count := [ 6, 1, 4, 8 ], name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 8 ], mathmode := "Text", name := "Example", next := 236838, root := ~, start := 236408, stop := 236837 ), rec( content := "\n ", count := [ 6, 1, 4, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 4, 3 ], mathmode := "Text", name := "Description", next := 236855, root := ~, start := 235545, stop := 236854 ) ], count := [ 6, 1, 4, 1 ], mathmode := "Text", name := "ManSection", next := 236869, root := ~, start := 235422, stop := 236868 ), rec( content := "\n\n ", count := [ 6, 1, 4, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsCompleteDigra\ ph" ), content := 0, count := [ 6, 1, 5, 2 ], mathmode := "Text", name := "Prop", next := 236936, root := ~, start := 236890, stop := 236935 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "K", next := 236959, root := ~, start := 236948, stop := 236958 ), rec( content := " or ", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "K", next := 236975, root := ~, start := 236963, stop := 236974 ), rec( content := ".", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "Returns", next := 236986, root := ~, start := 236939, stop := 236985 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns ", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "K", next := 237026, root := ~, start := 237015, stop := 237025 ), rec( content := " if the \ digraph ", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "A", next := 237056, root := ~, start := 237042, stop := 237055 ), rec( content := " is comp\ lete, and\n ", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "K", next := 237090, root := ~, start := 237078, stop := 237089 ), rec( content := " if it i\ s not. ", count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "P", next := 237109, root := ~, start := 237105, stop := 237108 ), rec( content := "\n\n \ A digraph is ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omplete", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "E", next := 237143, root := ~, start := 237128, stop := 237142 ), rec( content := " if it h\ as no loops, and for all\n ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ istinct", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "E", next := 237195, root := ~, start := 237180, stop := 237194 ), rec( content := " vertice\ s ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "C", next := 237213, root := ~, start := 237205, stop := 237212 ), rec( content := " and ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "C", next := 237226, root := ~, start := 237218, stop := 237225 ), rec( content := ",\n t\ here is exactly one edge with source ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "C", next := 237278, root := ~, start := 237270, stop := 237277 ), rec( content := " and ran\ ge ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "C", next := 237297, root := ~, start := 237289, stop := 237296 ), rec( content := ".\n\n \ Equivalently, a digraph with ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "M", next := 237341, root := ~, start := 237333, stop := 237340 ), rec( content := " vertice\ s is complete precisely when\n it has ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ (n - 1)", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "M", next := 237404, root := ~, start := 237389, stop := 237403 ), rec( content := " edges, \ no loops, and no multiple edges.\n ", count := [ 6, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 5, 5 ], mathmode := "Text", name := "P", next := 237453, root := ~, start := 237449, stop := 237452 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 5 ], mathmode := "Text", name := "A", next := 237495, root := ~, start := 237481, stop := 237494 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 3], [1, 3], [1, 2]]);\n\ngap> IsCompleteDigraph(D);\ntrue\ngap> D := Digraph([[2, 2], [1\ ]]);\n\ngap> IsCompleteDigrap\ h(D);\nfalse\ngap> D := CompleteBipartiteDigraph(IsMutableDigraph, 5, 4);\n\ngap> IsCompleteDigraph(D);\nfalse", count := [ 6, 1, 5, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 5, 6 ], mathmode := "Text", name := "Example", next := 238003, root := ~, start := 237596, stop := 238002 ), rec( content := "\n ", count := [ 6, 1, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 5, 3 ], mathmode := "Text", name := "Description", next := 238020, root := ~, start := 236989, stop := 238019 ) ], count := [ 6, 1, 5, 1 ], mathmode := "Text", name := "ManSection", next := 238034, root := ~, start := 236875, stop := 238033 ), rec( content := "\n\n ", count := [ 6, 1, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsCompleteMulti\ partiteDigraph" ), content := 0, count := [ 6, 1, 6, 2 ], mathmode := "Text", name := "Prop", next := 238113, root := ~, start := 238055, stop := 238112 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "K", next := 238136, root := ~, start := 238125, stop := 238135 ), rec( content := " or ", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "K", next := 238152, root := ~, start := 238140, stop := 238151 ), rec( content := ".", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "Returns", next := 238163, root := ~, start := 238116, stop := 238162 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property returns ", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "K", next := 238217, root := ~, start := 238206, stop := 238216 ), rec( content := " if ", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "A", next := 238235, root := ~, start := 238221, stop := 238234 ), rec( content := " is a co\ mplete\n multipartite digraph, and ", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "K", next := 238292, root := ~, start := 238280, stop := 238291 ), rec( content := " if not.\ ", count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := 0, count := [ 6, 1, 6, 4 ], mathmode := "Text", name := "P", next := 238305, root := ~, start := 238301, stop := 238304 ), rec( content := "\n\n \ A digraph is a ", count := [ 6, 1, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ omplete multipartite digraph", count := [ 6, 1, 6, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 6, 4 ], mathmode := "Text", name := "E", next := 238362, root := ~, start := 238326, stop := 238361 ), rec( content := " if and \ only if\n its vertices can be partitioned into at least two maximal indepen\ dent sets,\n where every possible edge between these independent sets occur\ s in the\n digraph exactly once.\n ", count := [ 6, 1, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 6, 5 ], mathmode := "Text", name := "P", next := 238567, root := ~, start := 238563, stop := 238566 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 6, 5 ], mathmode := "Text", name := "A", next := 238609, root := ~, start := 238595, stop := 238608 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteMultipartiteDigraph([2, 4, 6]);\n\ngap> IsCompleteMultipartiteDigraph\ (D);\ntrue\ngap> D := CompleteBipartiteDigraph(IsMutableDigraph, 5, 4);\n\ngap> IsCompleteMultipartiteDigraph(D);\ \ntrue", count := [ 6, 1, 6, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 1, 6, 6 ], mathmode := "Text", name := "Example", next := 239052, root := ~, start := 238710, stop := 239051 ), rec( content := "\n ", count := [ 6, 1, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 6, 3 ], mathmode := "Text", name := "Description", next := 239069, root := ~, start := 238166, stop := 239068 ) ], count := [ 6, 1, 6, 1 ], mathmode := "Text", name := "ManSection", next := 239083, root := ~, start := 238040, stop := 239082 ), rec( content := "\n\n ", count := [ 6, 1, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsEmptyDigraph"\ ), content := 0, count := [ 6, 1, 7, 2 ], mathmode := "Text", name := "Prop", next := 239147, root := ~, start := 239104, stop := 239146 ), rec( attributes := rec( Arg := "digraph", Name := "IsNullDigraph" ), content := 0, count := [ 6, 1, 7, 4 ], mathmode := "Text", name := "Prop", next := 239192, root := ~, start := 239150, stop := 239191 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "K", next := 239215, root := ~, start := 239204, stop := 239214 ), rec( content := " or ", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "K", next := 239231, root := ~, start := 239219, stop := 239230 ), rec( content := ".", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "Returns", next := 239242, root := ~, start := 239195, stop := 239241 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns ", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "K", next := 239282, root := ~, start := 239271, stop := 239281 ), rec( content := " if the \ digraph ", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "A", next := 239312, root := ~, start := 239298, stop := 239311 ), rec( content := " is empt\ y, and\n ", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "K", next := 239343, root := ~, start := 239331, stop := 239342 ), rec( content := " if it i\ s not. A digraph is ", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ mpty", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "E", next := 239383, root := ~, start := 239371, stop := 239382 ), rec( content := " if it h\ as no\n edges.", count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 7, 6 ], mathmode := "Text", name := "P", next := 239411, root := ~, start := 239407, stop := 239410 ), rec( content := "\n\n \ ", count := [ 6, 1, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sNullDigraph", count := [ 6, 1, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 6 ], mathmode := "Text", name := "C", next := 239437, root := ~, start := 239417, stop := 239436 ), rec( content := " is a sy\ nonym for ", count := [ 6, 1, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sEmptyDigraph", count := [ 6, 1, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 6 ], mathmode := "Text", name := "C", next := 239476, root := ~, start := 239455, stop := 239475 ), rec( content := ".\n " , count := [ 6, 1, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 7, 7 ], mathmode := "Text", name := "P", next := 239486, root := ~, start := 239482, stop := 239485 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 7 ], mathmode := "Text", name := "A", next := 239528, root := ~, start := 239514, stop := 239527 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 1, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[], []]);\n\ngap>\ IsEmptyDigraph(D);\ntrue\ngap> IsNullDigraph(D);\ntrue\ngap> D := Digraph([[]\ , [1]]);\n\ngap> IsEmptyDigraph(D);\ \nfalse\ngap> IsNullDigraph(D);\nfalse", count := [ 6, 1, 7, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 7, 8 ], mathmode := "Text", name := "Example", next := 239921, root := ~, start := 239629, stop := 239920 ), rec( content := "\n ", count := [ 6, 1, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 7, 5 ], mathmode := "Text", name := "Description", next := 239938, root := ~, start := 239245, stop := 239937 ) ], count := [ 6, 1, 7, 1 ], mathmode := "Text", name := "ManSection", next := 239952, root := ~, start := 239089, stop := 239951 ), rec( content := "\n\n ", count := [ 6, 1, 7, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsEquivalenceDi\ graph" ), content := 0, count := [ 6, 1, 8, 2 ], mathmode := "Text", name := "Prop", next := 240022, root := ~, start := 239973, stop := 240021 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "K", next := 240045, root := ~, start := 240034, stop := 240044 ), rec( content := " or ", count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "K", next := 240061, root := ~, start := 240049, stop := 240060 ), rec( content := ".", count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "Returns", next := 240072, root := ~, start := 240025, stop := 240071 ), rec( attributes := rec( ), content := [ rec( content := "\n A d\ igraph is an equivalence digraph if and only if the digraph satisifies\n al\ l of ", count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsRefle\ xiveDigraph" ), content := 0, count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "Ref", next := 240210, root := ~, start := 240178, stop := 240209 ), rec( content := ",\n " , count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymme\ tricDigraph" ), content := 0, count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "Ref", next := 240248, root := ~, start := 240216, stop := 240247 ), rec( content := " and ", count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsTrans\ itiveDigraph" ), content := 0, count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "Ref", next := 240286, root := ~, start := 240253, stop := 240285 ), rec( content := ".\n A\ partial order ", count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "A", next := 240322, root := ~, start := 240308, stop := 240321 ), rec( content := " corresp\ onds to an equivalence relation.\n ", count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 8, 4 ], mathmode := "Text", name := "P", next := 240371, root := ~, start := 240367, stop := 240370 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 8, 4 ], mathmode := "Text", name := "A", next := 240413, root := ~, start := 240399, stop := 240412 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n", count := [ 6, 1, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 3], [2], [1, 3]]);\n\ngap> IsEquivalenceDigraph(D);\ntrue\n", count := [ 6, 1, 8, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 8, 5 ], mathmode := "Text", name := "Example", next := 240664, root := ~, start := 240510, stop := 240663 ), rec( content := "\n ", count := [ 6, 1, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 8, 3 ], mathmode := "Text", name := "Description", next := 240681, root := ~, start := 240075, stop := 240680 ) ], count := [ 6, 1, 8, 1 ], mathmode := "Text", name := "ManSection", next := 240695, root := ~, start := 239958, stop := 240694 ), rec( content := "\n\n ", count := [ 6, 1, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsFunctionalDig\ raph" ), content := 0, count := [ 6, 1, 9, 2 ], mathmode := "Text", name := "Prop", next := 240764, root := ~, start := 240716, stop := 240763 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "K", next := 240787, root := ~, start := 240776, stop := 240786 ), rec( content := " or ", count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "K", next := 240803, root := ~, start := 240791, stop := 240802 ), rec( content := ".", count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "Returns", next := 240814, root := ~, start := 240767, stop := 240813 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "K", next := 240863, root := ~, start := 240852, stop := 240862 ), rec( content := " if the \ digraph ", count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "A", next := 240893, root := ~, start := 240879, stop := 240892 ), rec( content := " is\n \ functional. ", count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 9, 4 ], mathmode := "Text", name := "P", next := 240917, root := ~, start := 240913, stop := 240916 ), rec( content := "\n\n \ A digraph is ", count := [ 6, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ unctional", count := [ 6, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 9, 4 ], mathmode := "Text", name := "E", next := 240953, root := ~, start := 240936, stop := 240952 ), rec( content := " if ever\ y vertex is the source of a\n unique edge.\n ", count := [ 6, 1, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 9, 5 ], mathmode := "Text", name := "P", next := 241014, root := ~, start := 241010, stop := 241013 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 9, 5 ], mathmode := "Text", name := "A", next := 241056, root := ~, start := 241042, stop := 241055 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 1, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := Digraph([[3], [2], [2], [1], [6], [5]]);\n\ngap> IsFunctionalDigraph(gr1);\ntrue\ngap> gr2 := Digra\ ph([[1, 2], [1]]);\n\ngap> IsFunct\ ionalDigraph(gr2);\nfalse\ngap> gr3 := Digraph(3, [1, 2, 3], [2, 3, 1]);\n\ngap> IsFunctionalDigraph(gr3);\ntrue\ \n", count := [ 6, 1, 9, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 1, 9, 6 ], mathmode := "Text", name := "Example", next := 241567, root := ~, start := 241156, stop := 241566 ), rec( content := "\n ", count := [ 6, 1, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 9, 3 ], mathmode := "Text", name := "Description", next := 241584, root := ~, start := 240817, stop := 241583 ) ], count := [ 6, 1, 9, 1 ], mathmode := "Text", name := "ManSection", next := 241598, root := ~, start := 240701, stop := 241597 ), rec( content := "\n\n ", count := [ 6, 1, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsMultiDigraph"\ ), content := 0, count := [ 6, 1, 10, 2 ], mathmode := "Text", name := "Prop", next := 241662, root := ~, start := 241619, stop := 241661 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "K", next := 241685, root := ~, start := 241674, stop := 241684 ), rec( content := " or ", count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "K", next := 241701, root := ~, start := 241689, stop := 241700 ), rec( content := ".", count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "Returns", next := 241712, root := ~, start := 241665, stop := 241711 ), rec( attributes := rec( ), content := [ rec( content := "\n A " , count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ultidigraph", count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "E", next := 241754, root := ~, start := 241735, stop := 241753 ), rec( content := " is one \ that has at least two\n edges with equal source and range.", count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 10, 4 ], mathmode := "Text", name := "P", next := 241826, root := ~, start := 241822, stop := 241825 ), rec( content := "\n\n \ If the argument ", count := [ 6, 1, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 10, 4 ], mathmode := "Text", name := "A", next := 241862, root := ~, start := 241848, stop := 241861 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 1, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\"a\", \"b\", \"c\"], [\"a\", \"b\", \"b\"], [\"b\", \"c\"\ , \"a\"]);\n\ngap> IsMultiDigraph(\ D);\nfalse\ngap> D := DigraphFromDigraph6String(\"&Bug\");\n\ngap> IsDuplicateFree(DigraphEdges(D));\ntrue\ngap>\ IsMultiDigraph(D);\nfalse\ngap> D := Digraph([[1, 2, 3, 2], [2, 1], [3]]);\n<\ immutable multidigraph with 3 vertices, 7 edges>\ngap> IsDuplicateFree(Digraph\ Edges(D));\nfalse\ngap> IsMultiDigraph(D);\ntrue\ngap> D := DigraphMutableCopy\ (D); \n\ngap> IsMultiDigraph(D)\ ;\ntrue", count := [ 6, 1, 10, 5 ], name := "PCDATA", root := ~ ) ], count := [ 6, 1, 10, 5 ], mathmode := "Text", name := "Example", next := 242586, root := ~, start := 241963, stop := 242585 ), rec( content := "\n ", count := [ 6, 1, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 10, 3 ], mathmode := "Text", name := "Description", next := 242603, root := ~, start := 241715, stop := 242602 ) ], count := [ 6, 1, 10, 1 ], mathmode := "Text", name := "ManSection", next := 242617, root := ~, start := 241604, stop := 242616 ), rec( content := "\n\n ", count := [ 6, 1, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsReflexiveDigr\ aph" ), content := 0, count := [ 6, 1, 11, 2 ], mathmode := "Text", name := "Prop", next := 242685, root := ~, start := 242638, stop := 242684 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "K", next := 242708, root := ~, start := 242697, stop := 242707 ), rec( content := " or ", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "K", next := 242724, root := ~, start := 242712, stop := 242723 ), rec( content := ".", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "Returns", next := 242735, root := ~, start := 242688, stop := 242734 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "K", next := 242784, root := ~, start := 242773, stop := 242783 ), rec( content := " if the \ digraph ", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "A", next := 242814, root := ~, start := 242800, stop := 242813 ), rec( content := " is\n \ reflexive, and ", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "K", next := 242849, root := ~, start := 242837, stop := 242848 ), rec( content := " if it i\ s not.\n A digraph is ", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ eflexive", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "E", next := 242897, root := ~, start := 242881, stop := 242896 ), rec( content := " if it h\ as a loop at every vertex. ", count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 11, 4 ], mathmode := "Text", name := "P", next := 242936, root := ~, start := 242932, stop := 242935 ), rec( content := "\n ", count := [ 6, 1, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 11, 5 ], mathmode := "Text", name := "P", next := 242945, root := ~, start := 242941, stop := 242944 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 5 ], mathmode := "Text", name := "A", next := 242987, root := ~, start := 242973, stop := 242986 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 1, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2], [2]]);\n\ngap> IsReflexiveDigraph(D);\ntrue\ngap> D := Digraph([[3, 1], [4, 2], [3],\ [2, 1]]);\n\ngap> IsReflexiveDigr\ aph(D);\nfalse\n", count := [ 6, 1, 11, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 6 ], mathmode := "Text", name := "Example", next := 243360, root := ~, start := 243087, stop := 243359 ), rec( content := "\n ", count := [ 6, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 11, 3 ], mathmode := "Text", name := "Description", next := 243377, root := ~, start := 242738, stop := 243376 ) ], count := [ 6, 1, 11, 1 ], mathmode := "Text", name := "ManSection", next := 243391, root := ~, start := 242623, stop := 243390 ), rec( content := "\n\n ", count := [ 6, 1, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsSymmetricDigr\ aph" ), content := 0, count := [ 6, 1, 12, 2 ], mathmode := "Text", name := "Prop", next := 243459, root := ~, start := 243412, stop := 243458 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "K", next := 243482, root := ~, start := 243471, stop := 243481 ), rec( content := " or ", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "K", next := 243498, root := ~, start := 243486, stop := 243497 ), rec( content := ".", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "Returns", next := 243509, root := ~, start := 243462, stop := 243508 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "K", next := 243558, root := ~, start := 243547, stop := 243557 ), rec( content := " if the \ digraph ", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "A", next := 243588, root := ~, start := 243574, stop := 243587 ), rec( content := "\n is\ symmetric, and ", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "K", next := 243623, root := ~, start := 243611, stop := 243622 ), rec( content := " if it i\ s not.", count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "P", next := 243641, root := ~, start := 243637, stop := 243640 ), rec( content := "\n\n \ A ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ymmetric digraph", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "E", next := 243673, root := ~, start := 243649, stop := 243672 ), rec( content := " is one \ where for each non-loop edge, having\n source ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243737, root := ~, start := 243729, stop := 243736 ), rec( content := " and ran\ ge ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243756, root := ~, start := 243748, stop := 243755 ), rec( content := ", there \ is a corresponding edge with\n source ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243812, root := ~, start := 243804, stop := 243811 ), rec( content := " and ran\ ge ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243831, root := ~, start := 243823, stop := 243830 ), rec( content := ". If th\ ere are ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243855, root := ~, start := 243847, stop := 243854 ), rec( content := " edges w\ ith\n source ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243886, root := ~, start := 243878, stop := 243885 ), rec( content := " and ran\ ge ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243905, root := ~, start := 243897, stop := 243904 ), rec( content := ", then t\ here must be precisely ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243944, root := ~, start := 243936, stop := 243943 ), rec( content := "\n ed\ ges with source ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243975, root := ~, start := 243967, stop := 243974 ), rec( content := " and ran\ ge ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "C", next := 243994, root := ~, start := 243986, stop := 243993 ), rec( content := ". In ot\ her words, a symmetric\n digraph has a symmetric adjacency matrix ", count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Adjacen\ cyMatrix" ), content := 0, count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "Ref", next := 244099, root := ~, start := 244070, stop := 244098 ), rec( content := ".\n " , count := [ 6, 1, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 12, 5 ], mathmode := "Text", name := "P", next := 244109, root := ~, start := 244105, stop := 244108 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 5 ], mathmode := "Text", name := "A", next := 244151, root := ~, start := 244137, stop := 244150 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 1, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := Digraph([[2], [1, 3], [2, 3]]);\n\ngap> IsSymmetricDigraph(gr1);\ntrue\ngap> adj1 := AdjacencyMatri\ x(gr1);;\ngap> Display(adj1);\n[ [ 0, 1, 0 ],\n [ 1, 0, 1 ],\n [ 0, \ 1, 1 ] ]\ngap> adj1 = TransposedMat(adj1);\ntrue\ngap> gr1 = DigraphReverse(g\ r1);\ntrue\ngap> gr2 := Digraph([[2, 3], [1, 3], [2, 3]]);\n\ngap> IsSymmetricDigraph(gr2);\nfalse\ngap> adj2 :=\ AdjacencyMatrix(gr2);;\ngap> Display(adj2);\n[ [ 0, 1, 1 ],\n [ 1, 0, \ 1 ],\n [ 0, 1, 1 ] ]\ngap> adj2 = TransposedMat(adj2);\nfalse\n", count := [ 6, 1, 12, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 12, 6 ], mathmode := "Text", name := "Example", next := 244871, root := ~, start := 244251, stop := 244870 ), rec( content := "\n ", count := [ 6, 1, 12, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 12, 3 ], mathmode := "Text", name := "Description", next := 244888, root := ~, start := 243512, stop := 244887 ) ], count := [ 6, 1, 12, 1 ], mathmode := "Text", name := "ManSection", next := 244902, root := ~, start := 243397, stop := 244901 ), rec( content := "\n\n ", count := [ 6, 1, 12, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsTournament" ) , content := 0, count := [ 6, 1, 13, 2 ], mathmode := "Text", name := "Prop", next := 244964, root := ~, start := 244923, stop := 244963 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "K", next := 244987, root := ~, start := 244976, stop := 244986 ), rec( content := " or ", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "K", next := 245003, root := ~, start := 244991, stop := 245002 ), rec( content := ".", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "Returns", next := 245014, root := ~, start := 244967, stop := 245013 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "K", next := 245063, root := ~, start := 245052, stop := 245062 ), rec( content := " if the \ digraph ", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "A", next := 245093, root := ~, start := 245079, stop := 245092 ), rec( content := " is a to\ urnament,\n and ", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "K", next := 245131, root := ~, start := 245119, stop := 245130 ), rec( content := " if it i\ s not. ", count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 13, 4 ], mathmode := "Text", name := "P", next := 245150, root := ~, start := 245146, stop := 245149 ), rec( content := "\n\n \ A tournament is an orientation of a complete (undirected) graph.\n Specific\ ally, a tournament is a digraph which has a unique directed edge\n (of some\ orientation) between any pair of distinct vertices, and no loops.\n ", count := [ 6, 1, 13, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 13, 5 ], mathmode := "Text", name := "P", next := 245385, root := ~, start := 245381, stop := 245384 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 13, 5 ], mathmode := "Text", name := "A", next := 245427, root := ~, start := 245413, stop := 245426 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 1, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 3, 4], [3, 4], [4], []]);\n\ngap> IsTournament(D);\ntrue\ngap> D := Digraph([[2], [1], [\ 3]]);\n\ngap> IsTournament(D);\nfa\ lse\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> IsTournament(D);\ntrue\ngap> DigraphRemoveEdge(D, 1, 2);\ \n\ngap> IsTournament(D);\nfalse\n", count := [ 6, 1, 13, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 13, 6 ], mathmode := "Text", name := "Example", next := 246008, root := ~, start := 245527, stop := 246007 ), rec( content := "\n ", count := [ 6, 1, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 13, 3 ], mathmode := "Text", name := "Description", next := 246025, root := ~, start := 245017, stop := 246024 ) ], count := [ 6, 1, 13, 1 ], mathmode := "Text", name := "ManSection", next := 246039, root := ~, start := 244908, stop := 246038 ), rec( content := "\n\n ", count := [ 6, 1, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsTransitiveDig\ raph" ), content := 0, count := [ 6, 1, 14, 2 ], mathmode := "Text", name := "Prop", next := 246108, root := ~, start := 246060, stop := 246107 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "K", next := 246131, root := ~, start := 246120, stop := 246130 ), rec( content := " or ", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "K", next := 246147, root := ~, start := 246135, stop := 246146 ), rec( content := ".", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "Returns", next := 246158, root := ~, start := 246111, stop := 246157 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "K", next := 246207, root := ~, start := 246196, stop := 246206 ), rec( content := " if the \ digraph ", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "A", next := 246237, root := ~, start := 246223, stop := 246236 ), rec( content := "\n is\ transitive, and ", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "K", next := 246273, root := ~, start := 246261, stop := 246272 ), rec( content := " if it i\ s not.\n\n A digraph is ", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ ransitive", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "E", next := 246323, root := ~, start := 246306, stop := 246322 ), rec( content := " if when\ ever ", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i, j ]", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "C", next := 246351, root := ~, start := 246336, stop := 246350 ), rec( content := " and\n \ ", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ j, k ]", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "C", next := 246375, root := ~, start := 246360, stop := 246374 ), rec( content := " are edg\ es of the digraph, then ", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i, k ]", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "C", next := 246422, root := ~, start := 246407, stop := 246421 ), rec( content := " is also\ an\n edge of the digraph. ", count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "P", next := 246463, root := ~, start := 246459, stop := 246462 ), rec( content := "\n\n \ Let ", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "M", next := 246481, root := ~, start := 246473, stop := 246480 ), rec( content := " be the \ number of vertices of an arbitrary digraph, and let\n ", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "M", next := 246557, root := ~, start := 246549, stop := 246556 ), rec( content := " be the \ number of edges.\n For general digraphs, the methods used for this property\ use a version\n of the Floyd-Warshall algorithm, and have complexity ", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (n^3)", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "M", next := 246727, root := ~, start := 246714, stop := 246726 ), rec( content := ".\n\n \ However for digraphs which are topologically sortable\n [", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ TopologicalSort" ), content := 0, count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "Ref", next := 246829, root := ~, start := 246793, stop := 246828 ), rec( content := "], then \ methods with\n complexity ", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m + n + m \\cdot n)", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "M", next := 246892, root := ~, start := 246865, stop := 246891 ), rec( content := " will be\ used when appropriate.\n ", count := [ 6, 1, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 14, 5 ], mathmode := "Text", name := "P", next := 246932, root := ~, start := 246928, stop := 246931 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 5 ], mathmode := "Text", name := "A", next := 246974, root := ~, start := 246960, stop := 246973 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 1, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 14, 6 ], mathmode := "Text", name := "P", next := 247078, root := ~, start := 247074, stop := 247077 ), rec( content := "\n ", count := [ 6, 1, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 2], [3], [3]]);\n\ngap> IsTransitiveDigraph(D);\nfalse\ngap> gr2 := Digraph([[1, 2, 3], \ [3], [3]]);\n\ngap> IsTransitiveDi\ graph(gr2);\ntrue\ngap> gr2 = DigraphTransitiveClosure(D);\ntrue\ngap> gr3 := \ Digraph([[1, 2, 2, 3], [3, 3], [3]]);\n\ngap> IsTransitiveDigraph(gr3);\ntrue\n", count := [ 6, 1, 14, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 14, 7 ], mathmode := "Text", name := "Example", next := 247540, root := ~, start := 247083, stop := 247539 ), rec( content := "\n ", count := [ 6, 1, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 14, 3 ], mathmode := "Text", name := "Description", next := 247557, root := ~, start := 246161, stop := 247556 ) ], count := [ 6, 1, 14, 1 ], mathmode := "Text", name := "ManSection", next := 247571, root := ~, start := 246045, stop := 247570 ), rec( content := "\n\n ", count := [ 6, 1, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsPreorderDigra\ ph" ), content := 0, count := [ 6, 1, 15, 2 ], mathmode := "Text", name := "Prop", next := 247638, root := ~, start := 247592, stop := 247637 ), rec( attributes := rec( Arg := "digraph", Name := "IsQuasiorderDig\ raph" ), content := 0, count := [ 6, 1, 15, 4 ], mathmode := "Text", name := "Prop", next := 247689, root := ~, start := 247641, stop := 247688 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "K", next := 247712, root := ~, start := 247701, stop := 247711 ), rec( content := " or ", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "K", next := 247728, root := ~, start := 247716, stop := 247727 ), rec( content := ".", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "Returns", next := 247739, root := ~, start := 247692, stop := 247738 ), rec( attributes := rec( ), content := [ rec( content := "\n A d\ igraph is a preorder digraph if and only if the digraph satisifies both\n " , count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsRefle\ xiveDigraph" ), content := 0, count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "Ref", next := 247871, root := ~, start := 247839, stop := 247870 ), rec( content := " and ", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsTrans\ itiveDigraph" ), content := 0, count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "Ref", next := 247909, root := ~, start := 247876, stop := 247908 ), rec( content := ".\n A\ preorder digraph (or quasiorder digraph) ", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "A", next := 247972, root := ~, start := 247958, stop := 247971 ), rec( content := " corresp\ onds to\n the preorder relation ", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ \leq", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "M", next := 248025, root := ~, start := 248014, stop := 248024 ), rec( content := " defined\ by ", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ \\leq y", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "M", next := 248052, root := ~, start := 248037, stop := 248051 ), rec( content := " if and \ only\n if ", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ x, y]", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "C", next := 248085, root := ~, start := 248072, stop := 248084 ), rec( content := " is an e\ dge of ", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "A", next := 248114, root := ~, start := 248100, stop := 248113 ), rec( content := ".\n " , count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 15, 6 ], mathmode := "Text", name := "P", next := 248124, root := ~, start := 248120, stop := 248123 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 6 ], mathmode := "Text", name := "A", next := 248166, root := ~, start := 248152, stop := 248165 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n", count := [ 6, 1, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1], [2, 3], [2, 3]]);\n\ngap> IsPreorderDigraph(D);\ntrue\ngap> D := Digraph([[1 .. 4], [1 \ .. 4], [1 .. 4], [1 .. 4]]);\n\ng\ ap> IsPreorderDigraph(D);\ntrue\ngap> D := Digraph([[2], [3], [4], [5], [1]]);\ \n\ngap> IsPreorderDigraph(D);\nfa\ lse\ngap> D := Digraph([[1], [1, 2], [2, 3]]);\n\ngap> IsQuasiorderDigraph(D);\nfalse\n", count := [ 6, 1, 15, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 15, 7 ], mathmode := "Text", name := "Example", next := 248799, root := ~, start := 248263, stop := 248798 ), rec( content := "\n ", count := [ 6, 1, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 15, 5 ], mathmode := "Text", name := "Description", next := 248816, root := ~, start := 247742, stop := 248815 ) ], count := [ 6, 1, 15, 1 ], mathmode := "Text", name := "ManSection", next := 248830, root := ~, start := 247577, stop := 248829 ), rec( content := "\n\n ", count := [ 6, 1, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsPartialOrderD\ igraph" ), content := 0, count := [ 6, 1, 16, 2 ], mathmode := "Text", name := "Prop", next := 248901, root := ~, start := 248851, stop := 248900 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "K", next := 248924, root := ~, start := 248913, stop := 248923 ), rec( content := " or ", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "K", next := 248940, root := ~, start := 248928, stop := 248939 ), rec( content := ".", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "Returns", next := 248951, root := ~, start := 248904, stop := 248950 ), rec( attributes := rec( ), content := [ rec( content := "\n A d\ igraph is a partial order digraph if and only if the digraph satisifies\n a\ ll of ", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsRefle\ xiveDigraph" ), content := 0, count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "Ref", next := 249090, root := ~, start := 249058, stop := 249089 ), rec( content := ",\n " , count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsAntis\ ymmetricDigraph" ), content := 0, count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "Ref", next := 249132, root := ~, start := 249096, stop := 249131 ), rec( content := " and ", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsTrans\ itiveDigraph" ), content := 0, count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "Ref", next := 249170, root := ~, start := 249137, stop := 249169 ), rec( content := ".\n A\ partial order ", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "A", next := 249206, root := ~, start := 249192, stop := 249205 ), rec( content := " corresp\ onds\n to the partial order relation ", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ \leq", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "M", next := 249264, root := ~, start := 249253, stop := 249263 ), rec( content := " defined\ by ", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ \\leq y", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "M", next := 249291, root := ~, start := 249276, stop := 249290 ), rec( content := " if and\\ n only if ", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ x, y]", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "C", next := 249324, root := ~, start := 249311, stop := 249323 ), rec( content := " is an e\ dge of ", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "A", next := 249353, root := ~, start := 249339, stop := 249352 ), rec( content := ".\n " , count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 16, 4 ], mathmode := "Text", name := "P", next := 249363, root := ~, start := 249359, stop := 249362 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 4 ], mathmode := "Text", name := "A", next := 249405, root := ~, start := 249391, stop := 249404 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n", count := [ 6, 1, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 3], [2, 3], [3]]);\n\ngap> IsPartialOrderDigraph(D);\ntrue\ngap> D := CycleDigraph(5);\n\ \ngap> IsPartialOrderDigraph(D);\nfal\ se\ngap> D := Digraph([[1, 1], [1, 1, 2], [3], [3, 3, 4, 4]]);\n\ngap> IsPartialOrderDigraph(D);\ntrue\n", count := [ 6, 1, 16, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 16, 5 ], mathmode := "Text", name := "Example", next := 249909, root := ~, start := 249502, stop := 249908 ), rec( content := "\n ", count := [ 6, 1, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 16, 3 ], mathmode := "Text", name := "Description", next := 249926, root := ~, start := 248954, stop := 249925 ) ], count := [ 6, 1, 16, 1 ], mathmode := "Text", name := "ManSection", next := 249940, root := ~, start := 248836, stop := 249939 ), rec( content := "\n\n ", count := [ 6, 1, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsMeetSemilatti\ ceDigraph" ), content := 0, count := [ 6, 1, 17, 2 ], mathmode := "Text", name := "Prop", next := 250014, root := ~, start := 249961, stop := 250013 ), rec( attributes := rec( Arg := "digraph", Name := "IsJoinSemilatti\ ceDigraph" ), content := 0, count := [ 6, 1, 17, 4 ], mathmode := "Text", name := "Prop", next := 250070, root := ~, start := 250017, stop := 250069 ), rec( attributes := rec( Arg := "digraph", Name := "IsLatticeDigrap\ h" ), content := 0, count := [ 6, 1, 17, 6 ], mathmode := "Text", name := "Prop", next := 250118, root := ~, start := 250073, stop := 250117 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "K", next := 250141, root := ~, start := 250130, stop := 250140 ), rec( content := " or ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "K", next := 250157, root := ~, start := 250145, stop := 250156 ), rec( content := ".", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "Returns", next := 250168, root := ~, start := 250121, stop := 250167 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sMeetSemilatticeDigraph", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "C", next := 250220, root := ~, start := 250189, stop := 250219 ), rec( content := " returns\ ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "K", next := 250240, root := ~, start := 250229, stop := 250239 ), rec( content := " if the \ digraph\n ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "A", next := 250274, root := ~, start := 250260, stop := 250273 ), rec( content := " is a me\ et semilattice; ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sJoinSemilatticeDigraph", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "C", next := 250329, root := ~, start := 250298, stop := 250328 ), rec( content := "\n re\ turns ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "K", next := 250353, root := ~, start := 250342, stop := 250352 ), rec( content := " if the \ digraph ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "A", next := 250383, root := ~, start := 250369, stop := 250382 ), rec( content := " is a jo\ in semilattice;\n and ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sLatticeDigraph", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "C", next := 250439, root := ~, start := 250416, stop := 250438 ), rec( content := " returns\ ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "K", next := 250459, root := ~, start := 250448, stop := 250458 ), rec( content := " if the \ digraph\n ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "A", next := 250493, root := ~, start := 250479, stop := 250492 ), rec( content := " is both\ a meet and a join semilattice.\n ", count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "P", next := 250541, root := ~, start := 250537, stop := 250540 ), rec( content := "\n\n \ For a partial order digraph ", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsParti\ alOrderDigraph" ), content := 0, count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "Ref", next := 250610, root := ~, start := 250575, stop := 250609 ), rec( content := " the\n \ corresponding partial order is the relation ", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ \leq", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "M", next := 250674, root := ~, start := 250663, stop := 250673 ), rec( content := ", define\ d by\n ", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ \\leq y", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "M", next := 250706, root := ~, start := 250691, stop := 250705 ), rec( content := " if and \ only if ", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ x, y]", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "C", next := 250735, root := ~, start := 250722, stop := 250734 ), rec( content := " is an e\ dge.\n A digraph is a ", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ eet semilattice", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "E", next := 250790, root := ~, start := 250767, stop := 250789 ), rec( content := " if it i\ s a partial order and every\n pair of vertices has a greatest lower bound (\ meet) with respect to the\n aforementioned relation. A ", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ oin semilattice", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "E", next := 250955, root := ~, start := 250932, stop := 250954 ), rec( content := " is a pa\ rtial order where\n every pair of vertices has a least upper bound (join) w\ ith respect to\n the relation.\n ", count := [ 6, 1, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 1, 17, 9 ], mathmode := "Text", name := "P", next := 251081, root := ~, start := 251077, stop := 251080 ), rec( content := "\n \ \n If the argument ", count := [ 6, 1, 17, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 1, 17, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 9 ], mathmode := "Text", name := "A", next := 251123, root := ~, start := 251109, stop := 251122 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 1, 17, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 3], [2, 3], [3]]);\n\ngap> IsMeetSemilatticeDigraph(D);\nfalse\ngap> IsJoinSemilatticeDi\ graph(D);\ntrue\ngap> IsLatticeDigraph(D);\nfalse\ngap> D := Digraph([[1], [2]\ , [1 .. 3]]);\n\ngap> IsJoinSemila\ tticeDigraph(D);\nfalse\ngap> IsMeetSemilatticeDigraph(D);\ntrue\ngap> IsLatti\ ceDigraph(D);\nfalse\ngap> D := Digraph([[1 .. 4], [2, 4], [3, 4], [4]]);\n\ngap> IsMeetSemilatticeDigraph(D);\n\ true\ngap> IsJoinSemilatticeDigraph(D);\ntrue\ngap> IsLatticeDigraph(D);\ntrue\ \ngap> D := Digraph([[1, 1, 1], [1, 1, 2, 2],\n> [1, 3, 3], \ [1, 2, 3, 3, 4]]);\n\ngap> I\ sMeetSemilatticeDigraph(D);\ntrue\ngap> IsJoinSemilatticeDigraph(D);\ntrue\nga\ p> IsLatticeDigraph(D);\ntrue\n", count := [ 6, 1, 17, 10 ], name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 10 ], mathmode := "Text", name := "Example", next := 252111, root := ~, start := 251224, stop := 252110 ), rec( content := "\n ", count := [ 6, 1, 17, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 17, 7 ], mathmode := "Text", name := "Description", next := 252128, root := ~, start := 250171, stop := 252127 ) ], count := [ 6, 1, 17, 1 ], mathmode := "Text", name := "ManSection", next := 252142, root := ~, start := 249946, stop := 252141 ), rec( content := "\n\n ", count := [ 6, 1, 17, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 1, 0, 1 ], mathmode := "Text", name := "Section", next := 252156, root := ~, start := 232082, stop := 252155 ) , rec( content := "\n\n ", count := [ 6, 1, 17, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Regularity", count := [ 6, 2, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 0, 2 ], mathmode := "Text", name := "Heading", next := 252198, root := ~, start := 252169, stop := 252197 ), rec( content := "\n ", count := [ 6, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsInRegularDigr\ aph" ), content := 0, count := [ 6, 2, 1, 2 ], mathmode := "Text", name := "Prop", next := 252265, root := ~, start := 252218, stop := 252264 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "K", next := 252288, root := ~, start := 252277, stop := 252287 ), rec( content := " or ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "K", next := 252304, root := ~, start := 252292, stop := 252303 ), rec( content := ".", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "Returns", next := 252315, root := ~, start := 252268, stop := 252314 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "K", next := 252364, root := ~, start := 252353, stop := 252363 ), rec( content := " if ther\ e is an integer ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "C", next := 252396, root := ~, start := 252388, stop := 252395 ), rec( content := " such th\ at\n for every vertex ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "C", next := 252436, root := ~, start := 252428, stop := 252435 ), rec( content := " of digr\ aph ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "A", next := 252462, root := ~, start := 252448, stop := 252461 ), rec( content := " there a\ re exactly\n ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "C", next := 252493, root := ~, start := 252485, stop := 252492 ), rec( content := " edges t\ erminating in ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "C", next := 252523, root := ~, start := 252515, stop := 252522 ), rec( content := ".\n\n \ See also ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsOutRe\ gularDigraph" ), content := 0, count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "Ref", next := 252572, root := ~, start := 252539, stop := 252571 ), rec( content := " and\n \ ", count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsRegul\ arDigraph" ), content := 0, count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "Ref", next := 252611, root := ~, start := 252581, stop := 252610 ), rec( content := ".\n " , count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 2, 1, 4 ], mathmode := "Text", name := "P", next := 252621, root := ~, start := 252617, stop := 252620 ), rec( content := "\n \ \n If the argument ", count := [ 6, 2, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 4 ], mathmode := "Text", name := "A", next := 252663, root := ~, start := 252649, stop := 252662 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 2, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> IsInRegularDigraph(CompleteDigraph(4));\ntrue\ngap> IsInRegularDigraph(C\ hainDigraph(4));\nfalse\n", count := [ 6, 2, 1, 5 ], name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 5 ], mathmode := "Text", name := "Example", next := 252893, root := ~, start := 252763, stop := 252892 ), rec( content := "\n ", count := [ 6, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 1, 3 ], mathmode := "Text", name := "Description", next := 252910, root := ~, start := 252318, stop := 252909 ) ], count := [ 6, 2, 1, 1 ], mathmode := "Text", name := "ManSection", next := 252924, root := ~, start := 252203, stop := 252923 ), rec( content := "\n\n ", count := [ 6, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsOutRegularDig\ raph" ), content := 0, count := [ 6, 2, 2, 2 ], mathmode := "Text", name := "Prop", next := 252993, root := ~, start := 252945, stop := 252992 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "K", next := 253016, root := ~, start := 253005, stop := 253015 ), rec( content := " or ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "K", next := 253032, root := ~, start := 253020, stop := 253031 ), rec( content := ".", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "Returns", next := 253043, root := ~, start := 252996, stop := 253042 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "K", next := 253092, root := ~, start := 253081, stop := 253091 ), rec( content := " if ther\ e is an integer ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "C", next := 253124, root := ~, start := 253116, stop := 253123 ), rec( content := " such th\ at\n for every vertex ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "C", next := 253164, root := ~, start := 253156, stop := 253163 ), rec( content := " of digr\ aph ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "A", next := 253190, root := ~, start := 253176, stop := 253189 ), rec( content := " there a\ re exactly\n ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "C", next := 253221, root := ~, start := 253213, stop := 253220 ), rec( content := " edges s\ tarting at ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "C", next := 253248, root := ~, start := 253240, stop := 253247 ), rec( content := ".\n " , count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 2, 2, 4 ], mathmode := "Text", name := "P", next := 253258, root := ~, start := 253254, stop := 253257 ), rec( content := "\n\n \ See also ", count := [ 6, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsInReg\ ularDigraph" ), content := 0, count := [ 6, 2, 2, 4 ], mathmode := "Text", name := "Ref", next := 253305, root := ~, start := 253273, stop := 253304 ), rec( content := " and\n \ ", count := [ 6, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsRegul\ arDigraph" ), content := 0, count := [ 6, 2, 2, 4 ], mathmode := "Text", name := "Ref", next := 253344, root := ~, start := 253314, stop := 253343 ), rec( content := ".\n " , count := [ 6, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 2, 2, 5 ], mathmode := "Text", name := "P", next := 253354, root := ~, start := 253350, stop := 253353 ), rec( content := "\n \ \n If the argument ", count := [ 6, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 5 ], mathmode := "Text", name := "A", next := 253396, root := ~, start := 253382, stop := 253395 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> IsOutRegularDigraph(CompleteDigraph(4));\ntrue\ngap> IsOutRegularDigraph\ (ChainDigraph(4));\nfalse\n", count := [ 6, 2, 2, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 6 ], mathmode := "Text", name := "Example", next := 253628, root := ~, start := 253496, stop := 253627 ), rec( content := "\n ", count := [ 6, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 2, 3 ], mathmode := "Text", name := "Description", next := 253645, root := ~, start := 253046, stop := 253644 ) ], count := [ 6, 2, 2, 1 ], mathmode := "Text", name := "ManSection", next := 253659, root := ~, start := 252930, stop := 253658 ), rec( content := "\n\n ", count := [ 6, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsRegularDigrap\ h" ), content := 0, count := [ 6, 2, 3, 2 ], mathmode := "Text", name := "Prop", next := 253725, root := ~, start := 253680, stop := 253724 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "K", next := 253748, root := ~, start := 253737, stop := 253747 ), rec( content := " or ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "K", next := 253764, root := ~, start := 253752, stop := 253763 ), rec( content := ".", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "Returns", next := 253775, root := ~, start := 253728, stop := 253774 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "K", next := 253824, root := ~, start := 253813, stop := 253823 ), rec( content := " if ther\ e is an integer ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "C", next := 253856, root := ~, start := 253848, stop := 253855 ), rec( content := " such th\ at\n for every vertex ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "C", next := 253896, root := ~, start := 253888, stop := 253895 ), rec( content := " of digr\ aph ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "A", next := 253922, root := ~, start := 253908, stop := 253921 ), rec( content := " there a\ re exactly\n ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "C", next := 253953, root := ~, start := 253945, stop := 253952 ), rec( content := " edges s\ tarting and terminating at ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "C", next := 253996, root := ~, start := 253988, stop := 253995 ), rec( content := ". In oth\ er words,\n the property is ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "K", next := 254045, root := ~, start := 254034, stop := 254044 ), rec( content := " if ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "A", next := 254063, root := ~, start := 254049, stop := 254062 ), rec( content := " is both\ in-regular and\n and out-regular.\n\n See also ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsInReg\ ularDigraph" ), content := 0, count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "Ref", next := 254154, root := ~, start := 254122, stop := 254153 ), rec( content := " and\n \ ", count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsOutRe\ gularDigraph" ), content := 0, count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "Ref", next := 254196, root := ~, start := 254163, stop := 254195 ), rec( content := ".\n " , count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 2, 3, 4 ], mathmode := "Text", name := "P", next := 254206, root := ~, start := 254202, stop := 254205 ), rec( content := "\n \ \n If the argument ", count := [ 6, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 4 ], mathmode := "Text", name := "A", next := 254248, root := ~, start := 254234, stop := 254247 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 2, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> IsRegularDigraph(CompleteDigraph(4));\ntrue\ngap> IsRegularDigraph(Chain\ Digraph(4));\nfalse\n", count := [ 6, 2, 3, 5 ], name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 5 ], mathmode := "Text", name := "Example", next := 254474, root := ~, start := 254348, stop := 254473 ), rec( content := "\n ", count := [ 6, 2, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 3, 3 ], mathmode := "Text", name := "Description", next := 254491, root := ~, start := 253778, stop := 254490 ) ], count := [ 6, 2, 3, 1 ], mathmode := "Text", name := "ManSection", next := 254505, root := ~, start := 253665, stop := 254504 ), rec( content := "\n\n ", count := [ 6, 2, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsDistanceRegul\ arDigraph" ), content := 0, count := [ 6, 2, 4, 2 ], mathmode := "Text", name := "Prop", next := 254579, root := ~, start := 254526, stop := 254578 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "K", next := 254602, root := ~, start := 254591, stop := 254601 ), rec( content := " or ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "K", next := 254618, root := ~, start := 254606, stop := 254617 ), rec( content := ".", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "Returns", next := 254629, root := ~, start := 254582, stop := 254628 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "A", next := 254667, root := ~, start := 254653, stop := 254666 ), rec( content := " is a co\ nnected symmetric graph, this property returns\n ", count := [ 6, 2, 4, 3 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "K", next := 254737, root := ~, start := 254726, stop := 254736 ), rec( content := " if for \ any two vertices ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 254770, root := ~, start := 254762, stop := 254769 ), rec( content := " and ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 254783, root := ~, start := 254775, stop := 254782 ), rec( content := " of ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "A", next := 254801, root := ~, start := 254787, stop := 254800 ), rec( content := "\n an\ d any two integers ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 254835, root := ~, start := 254827, stop := 254834 ), rec( content := " and ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 254848, root := ~, start := 254840, stop := 254847 ), rec( content := " between\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "0\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 254865, root := ~, start := 254857, stop := 254864 ), rec( content := " and the\ \n diameter of ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "A", next := 254904, root := ~, start := 254890, stop := 254903 ), rec( content := ", the nu\ mber of vertices at distance ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 254949, root := ~, start := 254941, stop := 254948 ), rec( content := "\n fr\ om ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 254967, root := ~, start := 254959, stop := 254966 ), rec( content := " and dis\ tance ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 254989, root := ~, start := 254981, stop := 254988 ), rec( content := " from ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 255003, root := ~, start := 254995, stop := 255002 ), rec( content := " depends\ only on\n ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 255032, root := ~, start := 255024, stop := 255031 ), rec( content := ", ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 255042, root := ~, start := 255034, stop := 255041 ), rec( content := ", and th\ e distance between vertices ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 255086, root := ~, start := 255078, stop := 255085 ), rec( content := " and\n \ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "C", next := 255103, root := ~, start := 255095, stop := 255102 ), rec( content := ".", count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "P", next := 255108, root := ~, start := 255104, stop := 255107 ), rec( content := "\n\n \ Alternatively, a distance regular graph is a graph for which there exist\n \ integers ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "b\ _i", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255210, root := ~, start := 255200, stop := 255209 ), rec( content := ", ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ _i", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255222, root := ~, start := 255212, stop := 255221 ), rec( content := ", and ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255236, root := ~, start := 255228, stop := 255235 ), rec( content := " such th\ at for any two\n vertices ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255280, root := ~, start := 255272, stop := 255279 ), rec( content := ", ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255290, root := ~, start := 255282, stop := 255289 ), rec( content := " in ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "A", next := 255308, root := ~, start := 255294, stop := 255307 ), rec( content := " which a\ re distance ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255336, root := ~, start := 255328, stop := 255335 ), rec( content := "\n ap\ art, there are exactly ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "b\ _i", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255376, root := ~, start := 255366, stop := 255375 ), rec( content := " neighbo\ rs of ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255398, root := ~, start := 255390, stop := 255397 ), rec( content := " which a\ re at\n distance ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ - 1", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255437, root := ~, start := 255425, stop := 255436 ), rec( content := " away fr\ om ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255456, root := ~, start := 255448, stop := 255455 ), rec( content := ", and ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ _i", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255472, root := ~, start := 255462, stop := 255471 ), rec( content := " neighbo\ rs of\n ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255498, root := ~, start := 255490, stop := 255497 ), rec( content := " which a\ re at distance ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ + 1", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255533, root := ~, start := 255521, stop := 255532 ), rec( content := " away fr\ om ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "C", next := 255552, root := ~, start := 255544, stop := 255551 ), rec( content := ". This\n\ definition is used to check whether ", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "A", next := 255613, root := ~, start := 255599, stop := 255612 ), rec( content := " is dist\ ance regular.", count := [ 6, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 2, 4, 5 ], mathmode := "Text", name := "P", next := 255638, root := ~, start := 255634, stop := 255637 ), rec( content := "\n\n \ In the case where ", count := [ 6, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 5 ], mathmode := "Text", name := "A", next := 255676, root := ~, start := 255662, stop := 255675 ), rec( content := " is not \ symmetric or not connected, the\n property is ", count := [ 6, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 5 ], mathmode := "Text", name := "K", next := 255744, root := ~, start := 255732, stop := 255743 ), rec( content := ".\n " , count := [ 6, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 2, 4, 6 ], mathmode := "Text", name := "P", next := 255754, root := ~, start := 255750, stop := 255753 ), rec( content := "\n \ \n If the argument ", count := [ 6, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 6 ], mathmode := "Text", name := "A", next := 255796, root := ~, start := 255782, stop := 255795 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphSymmetricClosure(ChainDigraph(5));;\ngap> IsDistanceRegularD\ igraph(D);\nfalse\ngap> D := Digraph([[2, 3, 4], [1, 3, 4], [1, 2, 4], [1, 2, \ 3]]);\n\ngap> IsDistanceRegularDi\ graph(D);\ntrue\n", count := [ 6, 2, 4, 7 ], name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 7 ], mathmode := "Text", name := "Example", next := 256172, root := ~, start := 255897, stop := 256171 ), rec( content := "\n ", count := [ 6, 2, 4, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 4, 3 ], mathmode := "Text", name := "Description", next := 256189, root := ~, start := 254632, stop := 256188 ) ], count := [ 6, 2, 4, 1 ], mathmode := "Text", name := "ManSection", next := 256203, root := ~, start := 254511, stop := 256202 ), rec( content := "\n\n ", count := [ 6, 2, 4, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 2, 0, 1 ], mathmode := "Text", name := "Section", next := 256217, root := ~, start := 252160, stop := 256216 ) , rec( content := "\n\n ", count := [ 6, 2, 4, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Connectivity and \ cycles", count := [ 6, 3, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 0, 2 ], mathmode := "Text", name := "Heading", next := 256272, root := ~, start := 256230, stop := 256271 ), rec( content := "\n ", count := [ 6, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsAcyclicDigrap\ h" ), content := 0, count := [ 6, 3, 1, 2 ], mathmode := "Text", name := "Prop", next := 256337, root := ~, start := 256292, stop := 256336 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "K", next := 256360, root := ~, start := 256349, stop := 256359 ), rec( content := " or ", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "K", next := 256376, root := ~, start := 256364, stop := 256375 ), rec( content := ".", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "Returns", next := 256387, root := ~, start := 256340, stop := 256386 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "K", next := 256436, root := ~, start := 256425, stop := 256435 ), rec( content := " if the \ digraph ", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "A", next := 256466, root := ~, start := 256452, stop := 256465 ), rec( content := " is acyc\ lic, and\n ", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "K", next := 256499, root := ~, start := 256487, stop := 256498 ), rec( content := " if it i\ s not. A digraph is ", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ cyclic", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "E", next := 256541, root := ~, start := 256527, stop := 256540 ), rec( content := " if ever\ y directed\n cycle on the digraph is trivial. See section ", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "Ref", next := 256659, root := ~, start := 256609, stop := 256658 ), rec( content := " for the\ definition of a directed cycle, and of a trivial\n directed cycle.", count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "P", next := 256740, root := ~, start := 256736, stop := 256739 ), rec( content := "\n\n \ The method used in this operation has complexity ", count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m+n)", count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "M", next := 256808, root := ~, start := 256795, stop := 256807 ), rec( content := " where\n\ ", count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "M", next := 256827, root := ~, start := 256819, stop := 256826 ), rec( content := " is the \ number of edges (counting multiple edges as one) and\n ", count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "M", next := 256900, root := ~, start := 256892, stop := 256899 ), rec( content := " is the \ number of vertices in the digraph. ", count := [ 6, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 1, 5 ], mathmode := "Text", name := "P", next := 256947, root := ~, start := 256943, stop := 256946 ), rec( content := "\n\n \ If the argument ", count := [ 6, 3, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 5 ], mathmode := "Text", name := "A", next := 256983, root := ~, start := 256969, stop := 256982 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 3, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> Petersen := Graph(SymmetricGroup(5), [[1, 2]], OnSets,\n> function(x, y)\ \n> return IsEmpty(Intersection(x, y));\n> end);;\ngap> D := Digraph(Peterse\ n);\n\ngap> IsAcyclicDigraph(D);\ \nfalse\ngap> D := DigraphFromDiSparse6String(\n> \".b_OGCIDBaPGkULEbQHCeRIdrH\ cuZMfRyDAbPhTi|zF\");\n\ngap> Is\ AcyclicDigraph(D);\ntrue\ngap> IsAcyclicDigraph(ChainDigraph(10));\ntrue\ngap>\ D := CompleteDigraph(IsMutableDigraph, 4);\n\ngap> IsAcyclicDigraph(D);\nfalse\ngap> IsAcyclicDigraph(CycleDigra\ ph(10));\nfalse", count := [ 6, 3, 1, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 6 ], mathmode := "Text", name := "Example", next := 257732, root := ~, start := 257084, stop := 257731 ), rec( content := "\n ", count := [ 6, 3, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 1, 3 ], mathmode := "Text", name := "Description", next := 257749, root := ~, start := 256390, stop := 257748 ) ], count := [ 6, 3, 1, 1 ], mathmode := "Text", name := "ManSection", next := 257763, root := ~, start := 256277, stop := 257762 ), rec( content := "\n\n ", count := [ 6, 3, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsChainDigraph"\ ), content := 0, count := [ 6, 3, 2, 2 ], mathmode := "Text", name := "Prop", next := 257827, root := ~, start := 257784, stop := 257826 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "K", next := 257850, root := ~, start := 257839, stop := 257849 ), rec( content := " or ", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "K", next := 257866, root := ~, start := 257854, stop := 257865 ), rec( content := ".", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "Returns", next := 257877, root := ~, start := 257830, stop := 257876 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sChainDigraph", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "C", next := 257919, root := ~, start := 257898, stop := 257918 ), rec( content := " returns\ ", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "K", next := 257939, root := ~, start := 257928, stop := 257938 ), rec( content := " if the \ digraph ", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "A", next := 257969, root := ~, start := 257955, stop := 257968 ), rec( content := " is\n \ isomorphic to the chain digraph with the same number of vertices as\n ", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "A", next := 258063, root := ~, start := 258049, stop := 258062 ), rec( content := ", and ", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "K", next := 258081, root := ~, start := 258069, stop := 258080 ), rec( content := " if it i\ s not; see ", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "ChainDi\ graph" ), content := 0, count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "Ref", next := 258132, root := ~, start := 258100, stop := 258131 ), rec( content := ".", count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 2, 4 ], mathmode := "Text", name := "P", next := 258137, root := ~, start := 258133, stop := 258136 ), rec( content := "\n\n \ A digraph is a ", count := [ 6, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ hain", count := [ 6, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 4 ], mathmode := "Text", name := "E", next := 258170, root := ~, start := 258158, stop := 258169 ), rec( content := " if and \ only if it is a directed tree, in which\n every vertex has out degree at mo\ st one; see ", count := [ 6, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsDirec\ tedTree" ), content := 0, count := [ 6, 3, 2, 4 ], mathmode := "Text", name := "Ref", next := 258295, root := ~, start := 258267, stop := 258294 ), rec( content := "\n an\ d ", count := [ 6, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "OutDegr\ ees" ), content := 0, count := [ 6, 3, 2, 4 ], mathmode := "Text", name := "Ref", next := 258328, root := ~, start := 258304, stop := 258327 ), rec( content := ".\n " , count := [ 6, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 2, 5 ], mathmode := "Text", name := "P", next := 258338, root := ~, start := 258334, stop := 258337 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 5 ], mathmode := "Text", name := "A", next := 258380, root := ~, start := 258366, stop := 258379 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n", count := [ 6, 3, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 3], [2, 3], [3]]);\n\ngap> IsChainDigraph(D);\nfalse\ngap> D := ChainDigraph(5);\n\ngap> IsChainDigraph(D);\ntrue\ngap> D := \ DigraphReverse(D);\n\ngap> IsChain\ Digraph(D);\ntrue\ngap> D := ChainDigraph(IsMutableDigraph, 5);\n\ngap> IsChainDigraph(D);\ntrue\ngap> DigraphReve\ rse(D);\n\ngap> IsChainDigraph(D);\n\ true", count := [ 6, 3, 2, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 6 ], mathmode := "Text", name := "Example", next := 259039, root := ~, start := 258477, stop := 259038 ), rec( content := "\n ", count := [ 6, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 2, 3 ], mathmode := "Text", name := "Description", next := 259056, root := ~, start := 257880, stop := 259055 ) ], count := [ 6, 3, 2, 1 ], mathmode := "Text", name := "ManSection", next := 259070, root := ~, start := 257769, stop := 259069 ), rec( content := "\n\n ", count := [ 6, 3, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsConnectedDigr\ aph" ), content := 0, count := [ 6, 3, 3, 2 ], mathmode := "Text", name := "Prop", next := 259138, root := ~, start := 259091, stop := 259137 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "K", next := 259161, root := ~, start := 259150, stop := 259160 ), rec( content := " or ", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "K", next := 259177, root := ~, start := 259165, stop := 259176 ), rec( content := ".", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "Returns", next := 259188, root := ~, start := 259141, stop := 259187 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "K", next := 259237, root := ~, start := 259226, stop := 259236 ), rec( content := " if the \ digraph ", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "A", next := 259267, root := ~, start := 259253, stop := 259266 ), rec( content := "\n is\ weakly connected and ", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "K", next := 259308, root := ~, start := 259296, stop := 259307 ), rec( content := " if it i\ s not. A digraph\n ", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "A", next := 259352, root := ~, start := 259338, stop := 259351 ), rec( content := " is ", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "w\ eakly connected", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "E", next := 259379, root := ~, start := 259356, stop := 259378 ), rec( content := " if it i\ s possible to travel\n from any vertex to any other vertex by traversing ed\ ges in either\n direction (possibly against the orientation of some of them\ ). ", count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "P", next := 259548, root := ~, start := 259544, stop := 259547 ), rec( content := "\n\n \ The method used in this function has complexity ", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m)", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "M", next := 259613, root := ~, start := 259602, stop := 259612 ), rec( content := " if the\\ n digraph's ", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Source" ), content := 0, count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "Ref", next := 259662, root := ~, start := 259635, stop := 259661 ), rec( content := " attribu\ te is set, otherwise it has\n complexity ", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m+n)", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "M", next := 259726, root := ~, start := 259713, stop := 259725 ), rec( content := " (where\\ n ", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "M", next := 259746, root := ~, start := 259738, stop := 259745 ), rec( content := " is the \ number of edges and\n ", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "M", next := 259786, root := ~, start := 259778, stop := 259785 ), rec( content := " is the \ number of vertices of the digraph).\n ", count := [ 6, 3, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 3, 5 ], mathmode := "Text", name := "P", next := 259838, root := ~, start := 259834, stop := 259837 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 5 ], mathmode := "Text", name := "A", next := 259880, root := ~, start := 259866, stop := 259879 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2], [3], []]);;\ngap> IsConnectedDigraph(D);\ntrue\ngap> \ D := Digraph([[1, 3], [4], [3], []]);;\ngap> IsConnectedDigraph(D);\nfalse\nga\ p> D := Digraph(IsMutableDigraph, [[2], [3], []]);;\ngap> IsConnectedDigraph(D\ );\ntrue\ngap> D := Digraph(IsMutableDigraph, [[1, 3], [4], [3], []]);;\ngap> \ IsConnectedDigraph(D);\nfalse", count := [ 6, 3, 3, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 6 ], mathmode := "Text", name := "Example", next := 260342, root := ~, start := 259981, stop := 260341 ), rec( content := "\n ", count := [ 6, 3, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 3, 3 ], mathmode := "Text", name := "Description", next := 260359, root := ~, start := 259191, stop := 260358 ) ], count := [ 6, 3, 3, 1 ], mathmode := "Text", name := "ManSection", next := 260373, root := ~, start := 259076, stop := 260372 ), rec( content := "\n\n ", count := [ 6, 3, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsBiconnectedDi\ graph" ), content := 0, count := [ 6, 3, 4, 2 ], mathmode := "Text", name := "Prop", next := 260443, root := ~, start := 260394, stop := 260442 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "K", next := 260466, root := ~, start := 260455, stop := 260465 ), rec( content := " or ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "K", next := 260482, root := ~, start := 260470, stop := 260481 ), rec( content := ".", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "Returns", next := 260493, root := ~, start := 260446, stop := 260492 ), rec( attributes := rec( ), content := [ rec( content := "\n A c\ onnected digraph is ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "b\ iconnected", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "E", next := 260555, root := ~, start := 260537, stop := 260554 ), rec( content := " if it i\ s still connected (in the\n sense of ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsConne\ ctedDigraph" ), content := 0, count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "Ref", next := 260634, root := ~, start := 260602, stop := 260633 ), rec( content := ") when a\ ny vertex is removed. \n ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sBiconnectedDigraph", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "C", next := 260696, root := ~, start := 260669, stop := 260695 ), rec( content := " returns\ ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "K", next := 260716, root := ~, start := 260705, stop := 260715 ), rec( content := " if the \ digraph\n ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "A", next := 260750, root := ~, start := 260736, stop := 260749 ), rec( content := " is bico\ nnected, and ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "K", next := 260783, root := ~, start := 260771, stop := 260782 ), rec( content := " if it i\ s not. In\n particular, ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sBiconnectedDigraph", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "C", next := 260844, root := ~, start := 260817, stop := 260843 ), rec( content := " returns\ ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "K", next := 260865, root := ~, start := 260853, stop := 260864 ), rec( content := " if\n \ ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "A", next := 260887, root := ~, start := 260873, stop := 260886 ), rec( content := " is not \ connected. ", count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 4, 4 ], mathmode := "Text", name := "P", next := 260910, root := ~, start := 260906, stop := 260909 ), rec( content := "\n\n \ Multiple edges and loops are ignored by this method. ", count := [ 6, 3, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "P", next := 260973, root := ~, start := 260969, stop := 260972 ), rec( content := "\n\n \ The method used in this operation has complexity ", count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m+n)", count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "M", next := 261041, root := ~, start := 261028, stop := 261040 ), rec( content := " where\n\ ", count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "M", next := 261060, root := ~, start := 261052, stop := 261059 ), rec( content := " is the \ number of edges (counting multiple edges as one, and not\n counting loops) \ and ", count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "M", next := 261157, root := ~, start := 261149, stop := 261156 ), rec( content := " is the \ number of vertices in the digraph.\n ", count := [ 6, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 4, 6 ], mathmode := "Text", name := "P", next := 261208, root := ~, start := 261204, stop := 261207 ), rec( content := "\n\n \ See also ", count := [ 6, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Articul\ ationPoints" ), content := 0, count := [ 6, 3, 4, 6 ], mathmode := "Text", name := "Ref", next := 261255, root := ~, start := 261223, stop := 261254 ), rec( content := ".\n " , count := [ 6, 3, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 4, 7 ], mathmode := "Text", name := "P", next := 261265, root := ~, start := 261261, stop := 261264 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 7 ], mathmode := "Text", name := "A", next := 261307, root := ~, start := 261293, stop := 261306 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n", count := [ 6, 3, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> IsBiconnectedDigraph(Digraph([[1, 3], [2, 3], [3]]));\nfalse\ngap> IsBic\ onnectedDigraph(CycleDigraph(5));\ntrue\ngap> D := Digraph([[1, 1], [1, 1, 2],\ [3], [3, 3, 4, 4]]);;\ngap> IsBiconnectedDigraph(D);\nfalse\ngap> D := Comple\ teBipartiteDigraph(IsMutableDigraph, 5, 4);\n\ngap> IsBiconnectedDigraph(D);\ntrue", count := [ 6, 3, 4, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 3, 4, 8 ], mathmode := "Text", name := "Example", next := 261783, root := ~, start := 261403, stop := 261782 ), rec( content := "\n ", count := [ 6, 3, 4, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 4, 3 ], mathmode := "Text", name := "Description", next := 261800, root := ~, start := 260496, stop := 261799 ) ], count := [ 6, 3, 4, 1 ], mathmode := "Text", name := "ManSection", next := 261814, root := ~, start := 260379, stop := 261813 ), rec( content := "\n\n ", count := [ 6, 3, 4, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsStronglyConne\ ctedDigraph" ), content := 0, count := [ 6, 3, 5, 2 ], mathmode := "Text", name := "Prop", next := 261890, root := ~, start := 261835, stop := 261889 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "K", next := 261913, root := ~, start := 261902, stop := 261912 ), rec( content := " or ", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "K", next := 261929, root := ~, start := 261917, stop := 261928 ), rec( content := ".", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "Returns", next := 261940, root := ~, start := 261893, stop := 261939 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "K", next := 261989, root := ~, start := 261978, stop := 261988 ), rec( content := " if the \ digraph ", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "A", next := 262019, root := ~, start := 262005, stop := 262018 ), rec( content := " is stro\ ngly\n connected and ", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "K", next := 262062, root := ~, start := 262050, stop := 262061 ), rec( content := " if it i\ s not. ", count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "P", next := 262081, root := ~, start := 262077, stop := 262080 ), rec( content := "\n\n \ A digraph ", count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "A", next := 262111, root := ~, start := 262097, stop := 262110 ), rec( content := " is ", count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ trongly connected", count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "E", next := 262140, root := ~, start := 262115, stop := 262139 ), rec( content := " if ther\ e is a directed\n path from every vertex to every other vertex. See sectio\ n ", count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "Ref", next := 262277, root := ~, start := 262227, stop := 262276 ), rec( content := " for the\ definition of a directed\n path. ", count := [ 6, 3, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "P", next := 262328, root := ~, start := 262324, stop := 262327 ), rec( content := "\n\n \ The method used in this operation is based on Gabow's Algorithm ", count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "Gab00" ) , content := 0, count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "Cite", next := 262423, root := ~, start := 262398, stop := 262422 ), rec( content := " and has\ complexity ", count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ (m+n)", count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "M", next := 262456, root := ~, start := 262443, stop := 262455 ), rec( content := ", where \ ", count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ", count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "M", next := 262472, root := ~, start := 262464, stop := 262471 ), rec( content := " is\n \ the number of edges (counting multiple edges as one) and ", count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "M", next := 262545, root := ~, start := 262537, stop := 262544 ), rec( content := " is the\\ n number of vertices in the digraph.\n ", count := [ 6, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 5, 6 ], mathmode := "Text", name := "P", next := 262600, root := ~, start := 262596, stop := 262599 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 6 ], mathmode := "Text", name := "A", next := 262642, root := ~, start := 262628, stop := 262641 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 3, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(250000);\n\ngap> IsStronglyConnectedDigraph(D);\ntrue\ngap> D := DigraphRemoveEdges(D,\ [[250000, 1]]);\n\ngap>\ IsStronglyConnectedDigraph(D);\nfalse\ngap> D := CycleDigraph(IsMutableDigrap\ h, 250000);\n\ngap> IsStro\ nglyConnectedDigraph(D);\ntrue\ngap> DigraphRemoveEdge(D, [250000, 1]);\n\ngap> IsStronglyConnectedDigra\ ph(D);\nfalse\n", count := [ 6, 3, 5, 7 ], name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 7 ], mathmode := "Text", name := "Example", next := 263319, root := ~, start := 262743, stop := 263318 ), rec( content := "\n ", count := [ 6, 3, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 5, 3 ], mathmode := "Text", name := "Description", next := 263336, root := ~, start := 261943, stop := 263335 ) ], count := [ 6, 3, 5, 1 ], mathmode := "Text", name := "ManSection", next := 263350, root := ~, start := 261820, stop := 263349 ), rec( content := "\n\n ", count := [ 6, 3, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsAperiodicDigr\ aph" ), content := 0, count := [ 6, 3, 6, 2 ], mathmode := "Text", name := "Prop", next := 263418, root := ~, start := 263371, stop := 263417 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "K", next := 263441, root := ~, start := 263430, stop := 263440 ), rec( content := " or ", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "K", next := 263457, root := ~, start := 263445, stop := 263456 ), rec( content := ".", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "Returns", next := 263468, root := ~, start := 263421, stop := 263467 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property is ", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "K", next := 263517, root := ~, start := 263506, stop := 263516 ), rec( content := " if the \ digraph ", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "A", next := 263547, root := ~, start := 263533, stop := 263546 ), rec( content := "\n is\ aperiodic, i.e. if its ", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Period" ), content := 0, count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "Ref", next := 263607, root := ~, start := 263578, stop := 263606 ), rec( content := " is equa\ l to 1.\n Otherwise, the property is ", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "K", next := 263666, root := ~, start := 263654, stop := 263665 ), rec( content := ".\n " , count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 6, 4 ], mathmode := "Text", name := "P", next := 263676, root := ~, start := 263672, stop := 263675 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 6, 4 ], mathmode := "Text", name := "A", next := 263718, root := ~, start := 263704, stop := 263717 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n ", count := [ 6, 3, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[6], [1], [2], [3], [4, 4], [5]]);\n\ngap> IsAperiodicDigraph(D);\nfalse\ngap> D := Dig\ raph([[2], [3, 5], [4], [5], [1, 2]]);\n\ngap> IsAperiodicDigraph(D);\ntrue\ngap> D := Digraph(IsMutableDigraph,\ [[2], [3, 5], [4], [5], [1, 2]]);\n\ \ngap> IsAperiodicDigraph(D);\ntrue", count := [ 6, 3, 6, 5 ], name := "PCDATA\ ", root := ~ ) ], count := [ 6, 3, 6, 5 ], mathmode := "Text", name := "Example", next := 264263, root := ~, start := 263818, stop := 264262 ), rec( content := "\n ", count := [ 6, 3, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 6, 3 ], mathmode := "Text", name := "Description", next := 264280, root := ~, start := 263471, stop := 264279 ) ], count := [ 6, 3, 6, 1 ], mathmode := "Text", name := "ManSection", next := 264294, root := ~, start := 263356, stop := 264293 ), rec( content := "\n\n ", count := [ 6, 3, 6, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsDirectedTree"\ ), content := 0, count := [ 6, 3, 7, 2 ], mathmode := "Text", name := "Prop", next := 264358, root := ~, start := 264315, stop := 264357 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "K", next := 264381, root := ~, start := 264370, stop := 264380 ), rec( content := " or ", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "K", next := 264397, root := ~, start := 264385, stop := 264396 ), rec( content := ".", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "Returns", next := 264408, root := ~, start := 264361, stop := 264407 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns ", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "K", next := 264448, root := ~, start := 264437, stop := 264447 ), rec( content := " if the \ digraph ", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "A", next := 264478, root := ~, start := 264464, stop := 264477 ), rec( content := " is a di\ rected tree, and\n ", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "K", next := 264519, root := ~, start := 264507, stop := 264518 ), rec( content := " if it i\ s not. ", count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 7, 4 ], mathmode := "Text", name := "P", next := 264538, root := ~, start := 264534, stop := 264537 ), rec( content := "\n\n \ A ", count := [ 6, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ irected tree", count := [ 6, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 4 ], mathmode := "Text", name := "E", next := 264566, root := ~, start := 264546, stop := 264565 ), rec( content := " is an a\ cyclic digraph with precisely 1 source,\n such that no two vertices share a\ n out-neighbour.\n Note the empty digraph is not considered a directed\n \ tree as it has no source. ", count := [ 6, 3, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 7, 5 ], mathmode := "Text", name := "P", next := 264758, root := ~, start := 264754, stop := 264757 ), rec( content := "\n\n \ See also ", count := [ 6, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Sources" ), content := 0, count := [ 6, 3, 7, 5 ], mathmode := "Text", name := "Ref", next := 264801, root := ~, start := 264773, stop := 264800 ), rec( content := ".\n " , count := [ 6, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 7, 6 ], mathmode := "Text", name := "P", next := 264811, root := ~, start := 264807, stop := 264810 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 6 ], mathmode := "Text", name := "A", next := 264853, root := ~, start := 264839, stop := 264852 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 3, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[], [2]]);\n\ng\ ap> IsDirectedTree(D);\nfalse\ngap> D := Digraph([[3], [3], []]);\n\ngap> IsDirectedTree(D);\nfalse\ngap> D := D\ igraph([[2], [3], []]);\n\ngap> Is\ DirectedTree(D);\ntrue\ngap> D := Digraph([[2, 3], [6], [4, 5], [], [], []]);\ \n\ngap> IsDirectedTree(D);\ntrue\ \n", count := [ 6, 3, 7, 7 ], name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 7 ], mathmode := "Text", name := "Example", next := 265437, root := ~, start := 264954, stop := 265436 ), rec( content := "\n ", count := [ 6, 3, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 7, 3 ], mathmode := "Text", name := "Description", next := 265454, root := ~, start := 264411, stop := 265453 ) ], count := [ 6, 3, 7, 1 ], mathmode := "Text", name := "ManSection", next := 265468, root := ~, start := 264300, stop := 265467 ), rec( content := "\n\n ", count := [ 6, 3, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsUndirectedTre\ e" ), content := 0, count := [ 6, 3, 8, 2 ], mathmode := "Text", name := "Prop", next := 265534, root := ~, start := 265489, stop := 265533 ), rec( attributes := rec( Arg := "digraph", Name := "IsUndirectedFor\ est" ), content := 0, count := [ 6, 3, 8, 4 ], mathmode := "Text", name := "Prop", next := 265584, root := ~, start := 265537, stop := 265583 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "K", next := 265607, root := ~, start := 265596, stop := 265606 ), rec( content := " or ", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "K", next := 265623, root := ~, start := 265611, stop := 265622 ), rec( content := ".", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "Returns", next := 265634, root := ~, start := 265587, stop := 265633 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ property ", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sUndirectedTree", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "C", next := 265691, root := ~, start := 265668, stop := 265690 ), rec( content := " returns\ ", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "K", next := 265711, root := ~, start := 265700, stop := 265710 ), rec( content := " if the \ digraph\n ", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "A", next := 265745, root := ~, start := 265731, stop := 265744 ), rec( content := " is an u\ ndirected tree, and the property\n ", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sUndirectedForest", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "C", next := 265815, root := ~, start := 265790, stop := 265814 ), rec( content := " returns\ ", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "K", next := 265835, root := ~, start := 265824, stop := 265834 ), rec( content := " if ", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "A", next := 265853, root := ~, start := 265839, stop := 265852 ), rec( content := " is an\n\ undirected forest; otherwise, these properties return ", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "K", next := 265930, root := ~, start := 265918, stop := 265929 ), rec( content := ". ", count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "P", next := 265936, root := ~, start := 265932, stop := 265935 ), rec( content := "\n\n \ An ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ndirected tree", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "E", next := 265967, root := ~, start := 265945, stop := 265966 ), rec( content := " is a sy\ mmetric digraph without loops, in which for\n any pair of distinct vertices\ ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "C", next := 266061, root := ~, start := 266053, stop := 266060 ), rec( content := " and ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "C", next := 266074, root := ~, start := 266066, stop := 266073 ), rec( content := ", there \ is exactly one\n directed path from ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "C", next := 266128, root := ~, start := 266120, stop := 266127 ), rec( content := " to ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "C", next := 266140, root := ~, start := 266132, stop := 266139 ), rec( content := ". See ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymme\ tricDigraph" ), content := 0, count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "Ref", next := 266184, root := ~, start := 266146, stop := 266183 ), rec( content := " and ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digraph\ HasLoops" ), content := 0, count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "Ref", next := 266218, root := ~, start := 266189, stop := 266217 ), rec( content := ", and se\ e\n section ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "Ref", next := 266284, root := ~, start := 266240, stop := 266283 ), rec( content := " for the\ definition of\n directed path. This definition implies that an undirected \ tree has\n no multiple edges. ", count := [ 6, 3, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 8, 7 ], mathmode := "Text", name := "P", next := 266405, root := ~, start := 266401, stop := 266404 ), rec( content := "\n\n \ An ", count := [ 6, 3, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ndirected forest", count := [ 6, 3, 8, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 6, 3, 8, 7 ], mathmode := "Text", name := "E", next := 266438, root := ~, start := 266414, stop := 266437 ), rec( content := " is a di\ graph, each of whose connected components\n is an undirected tree. In other\ words, an undirected forest is isomorphic to\n a disjoint union of undirec\ ted trees. See ", count := [ 6, 3, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ ConnectedComponents" ), content := 0, count := [ 6, 3, 8, 7 ], mathmode := "Text", name := "Ref", next := 266662, root := ~, start := 266615, stop := 266661 ), rec( content := " and ", count := [ 6, 3, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ DisjointUnion", Label := "for a list of digraphs" ), content := 0, count := [ 6, 3, 8, 7 ], mathmode := "Text", name := "Ref", next := 266739, root := ~, start := 266667, stop := 266738 ), rec( content := ". In par\ ticular, every\n undirected tree is an undirected forest. ", count := [ 6, 3, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 8, 8 ], mathmode := "Text", name := "P", next := 266811, root := ~, start := 266807, stop := 266810 ), rec( content := "\n\n \ Please note that the digraph with zero vertices is considered to be neither\n \ an undirected tree nor an undirected forest.\n ", count := [ 6, 3, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 8, 9 ], mathmode := "Text", name := "P", next := 266950, root := ~, start := 266946, stop := 266949 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 9 ], mathmode := "Text", name := "A", next := 266992, root := ~, start := 266978, stop := 266991 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 3, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3], [3], [1, 2]]);\n\ngap> IsUndirectedTree(D);\ntrue\ngap> IsSymmetricDigraph(D) and not D\ igraphHasLoops(D);\ntrue\ngap> D := Digraph([[3], [5], [1, 4], [3], [2]]);\n\ngap> IsConnectedDigraph(D);\nfalse\ \ngap> IsUndirectedTree(D);\nfalse\ngap> IsUndirectedForest(D);\ntrue\ngap> D \ := Digraph([[1, 2], [1], [2]]);\n\ \ngap> IsUndirectedTree(D) or IsUndirectedForest(D);\nfalse\ngap> IsSymmetricD\ igraph(D) or not DigraphHasLoops(D);\nfalse", count := [ 6, 3, 8, 10 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 3, 8, 10 ], mathmode := "Text", name := "Example", next := 267693, root := ~, start := 267093, stop := 267692 ), rec( content := "\n ", count := [ 6, 3, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 8, 5 ], mathmode := "Text", name := "Description", next := 267710, root := ~, start := 265637, stop := 267709 ) ], count := [ 6, 3, 8, 1 ], mathmode := "Text", name := "ManSection", next := 267724, root := ~, start := 265474, stop := 267723 ), rec( content := "\n\n ", count := [ 6, 3, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsEulerianDigra\ ph" ), content := 0, count := [ 6, 3, 9, 2 ], mathmode := "Text", name := "Prop", next := 267791, root := ~, start := 267745, stop := 267790 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "K", next := 267814, root := ~, start := 267803, stop := 267813 ), rec( content := " or ", count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "K", next := 267830, root := ~, start := 267818, stop := 267829 ), rec( content := ".", count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "Returns", next := 267841, root := ~, start := 267794, stop := 267840 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property returns true if the digraph ", count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "A", next := 267918, root := ~, start := 267904, stop := 267917 ), rec( content := " is Eule\ rian.\n ", count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 9, 4 ], mathmode := "Text", name := "P", next := 267940, root := ~, start := 267936, stop := 267939 ), rec( content := "\n\n \ A connected digraph is called ", count := [ 6, 3, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "E\ ulerian", count := [ 6, 3, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 9, 4 ], mathmode := "Text", name := "E", next := 267991, root := ~, start := 267976, stop := 267990 ), rec( content := " if ther\ e exists a directed\n circuit on the digraph which includes every edge exac\ tly once. See\n section ", count := [ 6, 3, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 6, 3, 9, 4 ], mathmode := "Text", name := "Ref", next := 268147, root := ~, start := 268103, stop := 268146 ), rec( content := " for the\ definition of\n a directed circuit. Note that the empty digraph with at mo\ st one vertex is\n considered to be Eulerian.\n ", count := [ 6, 3, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 9, 5 ], mathmode := "Text", name := "P", next := 268288, root := ~, start := 268284, stop := 268287 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 9, 5 ], mathmode := "Text", name := "A", next := 268330, root := ~, start := 268316, stop := 268329 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[]]);\n\ngap> IsEul\ erianDigraph(D);\ntrue\ngap> D := Digraph([[2], []]);\n\ngap> IsEulerianDigraph(D);\nfalse\ngap> D := Digraph([[3\ ], [], [2]]);\n\ngap> IsEulerianDi\ graph(D);\nfalse\ngap> D := Digraph([[2], [3], [1]]);\n\ngap> IsEulerianDigraph(D);\ntrue\n", count := [ 6, 3, 9, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 3, 9, 6 ], mathmode := "Text", name := "Example", next := 268893, root := ~, start := 268431, stop := 268892 ), rec( content := "\n ", count := [ 6, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 9, 3 ], mathmode := "Text", name := "Description", next := 268910, root := ~, start := 267844, stop := 268909 ) ], count := [ 6, 3, 9, 1 ], mathmode := "Text", name := "ManSection", next := 268924, root := ~, start := 267730, stop := 268923 ), rec( content := "\n\n ", count := [ 6, 3, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsHamiltonianDi\ graph" ), content := 0, count := [ 6, 3, 10, 2 ], mathmode := "Text", name := "Prop", next := 268994, root := ~, start := 268945, stop := 268993 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "K", next := 269017, root := ~, start := 269006, stop := 269016 ), rec( content := " or ", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "K", next := 269033, root := ~, start := 269021, stop := 269032 ), rec( content := ".", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "Returns", next := 269044, root := ~, start := 268997, stop := 269043 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "A", next := 269082, root := ~, start := 269068, stop := 269081 ), rec( content := " is Hami\ ltonian, then this property returns\n ", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "K", next := 269141, root := ~, start := 269130, stop := 269140 ), rec( content := ", and ", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "K", next := 269159, root := ~, start := 269147, stop := 269158 ), rec( content := " if it i\ s not. ", count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "P", next := 269178, root := ~, start := 269174, stop := 269177 ), rec( content := "\n\n \ A digraph with ", count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "C", next := 269207, root := ~, start := 269199, stop := 269206 ), rec( content := " vertice\ s is ", count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ amiltonian", count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "E", next := 269238, root := ~, start := 269220, stop := 269237 ), rec( content := " if it h\ as a\n directed cycle of length ", count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "C", next := 269288, root := ~, start := 269280, stop := 269287 ), rec( content := ". See Se\ ction ", count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Style := "Number\ ", Subsect := "Definitions" ), content := 0, count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "Ref", next := 269351, root := ~, start := 269302, stop := 269350 ), rec( content := " for the\ definition of a directed cycle.\n Note the empty digraphs on 0 and 1 verti\ ces are considered to be\n Hamiltonian.", count := [ 6, 3, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 10, 5 ], mathmode := "Text", name := "P", next := 269481, root := ~, start := 269477, stop := 269480 ), rec( content := "\n\n \ The method used in this operation has the worst case complexity as\n ", count := [ 6, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Monomorphism" ), content := 0, count := [ 6, 3, 10, 5 ], mathmode := "Text", name := "Ref", next := 269591, root := ~, start := 269558, stop := 269590 ), rec( content := ".\n " , count := [ 6, 3, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 10, 6 ], mathmode := "Text", name := "P", next := 269601, root := ~, start := 269597, stop := 269600 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 6 ], mathmode := "Text", name := "A", next := 269643, root := ~, start := 269629, stop := 269642 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 3, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> g := Digraph([[]]);\n\ngap> IsHam\ iltonianDigraph(g);\ntrue\ngap> g := Digraph([[2], [1]]);\n\ngap> IsHamiltonianDigraph(g);\ntrue\ngap> g := Digr\ aph([[3], [], [2]]);\n\ngap> IsHam\ iltonianDigraph(g);\nfalse\ngap> g := Digraph([[2], [3], [1]]);\n\ngap> IsHamiltonianDigraph(g);\ntrue\n", count := [ 6, 3, 10, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 3, 10, 7 ], mathmode := "Text", name := "Example", next := 270219, root := ~, start := 269744, stop := 270218 ), rec( content := "\n ", count := [ 6, 3, 10, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 10, 3 ], mathmode := "Text", name := "Description", next := 270236, root := ~, start := 269047, stop := 270235 ) ], count := [ 6, 3, 10, 1 ], mathmode := "Text", name := "ManSection", next := 270250, root := ~, start := 268930, stop := 270249 ), rec( content := "\n\n ", count := [ 6, 3, 10, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsCycleDigraph"\ ), content := 0, count := [ 6, 3, 11, 2 ], mathmode := "Text", name := "Prop", next := 270314, root := ~, start := 270271, stop := 270313 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "K", next := 270337, root := ~, start := 270326, stop := 270336 ), rec( content := " or ", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "K", next := 270353, root := ~, start := 270341, stop := 270352 ), rec( content := ".", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "Returns", next := 270364, root := ~, start := 270317, stop := 270363 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sCycleDigraph", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "C", next := 270406, root := ~, start := 270385, stop := 270405 ), rec( content := " returns\ ", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "K", next := 270426, root := ~, start := 270415, stop := 270425 ), rec( content := " if the \ digraph ", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "A", next := 270456, root := ~, start := 270442, stop := 270455 ), rec( content := " is\n \ isomorphic to the cycle digraph with the same number of vertices as\n ", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "A", next := 270550, root := ~, start := 270536, stop := 270549 ), rec( content := ", and ", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "K", next := 270568, root := ~, start := 270556, stop := 270567 ), rec( content := " if it i\ s not; see ", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "CycleDi\ graph" ), content := 0, count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "Ref", next := 270619, root := ~, start := 270587, stop := 270618 ), rec( content := ".", count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 11, 4 ], mathmode := "Text", name := "P", next := 270624, root := ~, start := 270620, stop := 270623 ), rec( content := "\n\n \ A digraph is a ", count := [ 6, 3, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ycle", count := [ 6, 3, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 4 ], mathmode := "Text", name := "E", next := 270657, root := ~, start := 270645, stop := 270656 ), rec( content := " if and \ only if it is strongly connected and has\n the same number of edges as vert\ ices. \n ", count := [ 6, 3, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 3, 11, 5 ], mathmode := "Text", name := "P", next := 270757, root := ~, start := 270753, stop := 270756 ), rec( content := "\n \ \n If the argument ", count := [ 6, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 5 ], mathmode := "Text", name := "A", next := 270799, root := ~, start := 270785, stop := 270798 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n", count := [ 6, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[1, 3], [2, 3], [3]]);\n\ngap> IsCycleDigraph(D);\nfalse\ngap> D := CycleDigraph(5);\n\ngap> IsCycleDigraph(D);\ntrue\ngap> D := \ OnDigraphs(D, (1, 2, 3));\n\ngap> \ D = CycleDigraph(5);\nfalse\ngap> IsCycleDigraph(D);\ntrue", count := [ 6, 3, 11, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 3, 11, 6 ], mathmode := "Text", name := "Example", next := 271284, root := ~, start := 270896, stop := 271283 ), rec( content := "\n ", count := [ 6, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 11, 3 ], mathmode := "Text", name := "Description", next := 271301, root := ~, start := 270367, stop := 271300 ) ], count := [ 6, 3, 11, 1 ], mathmode := "Text", name := "ManSection", next := 271315, root := ~, start := 270256, stop := 271314 ), rec( content := "\n\n ", count := [ 6, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 3, 0, 1 ], mathmode := "Text", name := "Section", next := 271329, root := ~, start := 256221, stop := 271328 ) , rec( content := "\n \n ", count := [ 6, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Planarity", count := [ 6, 4, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 0, 2 ], mathmode := "Text", name := "Heading", next := 271372, root := ~, start := 271344, stop := 271371 ), rec( content := "\n ", count := [ 6, 4, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsPlanarDigraph\ " ), content := 0, count := [ 6, 4, 1, 2 ], mathmode := "Text", name := "Prop", next := 271436, root := ~, start := 271392, stop := 271435 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "K", next := 271459, root := ~, start := 271448, stop := 271458 ), rec( content := " or ", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "K", next := 271475, root := ~, start := 271463, stop := 271474 ), rec( content := ".", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "Returns", next := 271486, root := ~, start := 271439, stop := 271485 ), rec( attributes := rec( ), content := [ rec( content := "\n A " , count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ lanar", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "E", next := 271522, root := ~, start := 271509, stop := 271521 ), rec( content := " digraph\ is a digraph that can be embedded in the plane in\n such a way that its ed\ ges do not intersect. A digraph is planar if and only\n if it does not have\ a subdigraph that is homeomorphic to either the\n complete graph on ", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "5\ ", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "C", next := 271763, root := ~, start := 271755, stop := 271762 ), rec( content := " vertice\ s or the complete bipartite graph with\n vertex sets of sizes ", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "3\ ", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "C", next := 271843, root := ~, start := 271835, stop := 271842 ), rec( content := " and ", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "3\ ", count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "C", next := 271856, root := ~, start := 271848, stop := 271855 ), rec( content := ".\n " , count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "P", next := 271866, root := ~, start := 271862, stop := 271865 ), rec( content := "\n \n\ ", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sPlanarDigraph", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "C", next := 271898, root := ~, start := 271876, stop := 271897 ), rec( content := " returns\ ", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "K", next := 271918, root := ~, start := 271907, stop := 271917 ), rec( content := " if the \ digraph ", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "A", next := 271948, root := ~, start := 271934, stop := 271947 ), rec( content := " is\n \ planar and ", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "K", next := 271979, root := ~, start := 271967, stop := 271978 ), rec( content := " if it i\ s not. The directions and multiplicities of\n any edges in ", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "A", next := 272062, root := ~, start := 272048, stop := 272061 ), rec( content := " are ign\ ored by ", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sPlanarDigraph", count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "C", next := 272100, root := ~, start := 272078, stop := 272099 ), rec( content := ".\n " , count := [ 6, 4, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 4, 1, 5 ], mathmode := "Text", name := "P", next := 272110, root := ~, start := 272106, stop := 272109 ), rec( content := " \n\n \ See also ", count := [ 6, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsOuter\ PlanarDigraph" ), content := 0, count := [ 6, 4, 1, 5 ], mathmode := "Text", name := "Ref", next := 272160, root := ~, start := 272126, stop := 272159 ), rec( content := ".\n " , count := [ 6, 4, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 4, 1, 6 ], mathmode := "Text", name := "P", next := 272170, root := ~, start := 272166, stop := 272169 ), rec( content := "\n\n \ This method uses the reference implementation in\n ", count := [ 6, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "edge-addition-planarity-suite" ), content := [ rec( content := \ "https://github.com/graph-algorithms/edge-addition-planarity-suite", count := [ \ 6, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 6 ], mathmode := \ "Text", name := "URL", next := 140, root := ~, start := 17, stop := 139 ) ], count := [ 6, 4, 1, 6 ], name := "Alt", next := 146, root := ~, start := 1, stop := 145 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "edge-addition-planarity-suite", count \ := [ 6, 4, 1, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 6 ], name := "Pac\ kage", next := 218, root := ~, start := 170, stop := 217 ) ], count := [ 6, 4, 1, 6 ], mathmode := "Text", name := "Alt", next := 224, root := ~, start := 146, stop := 223 ), rec( content := " by John\ Boyer of the algorithms described\n in ", count := [ 6, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "BM06" ), content := 0, count := [ 6, 4, 1, 6 ], mathmode := "Text", name := "Cite", next := 272328, root := ~, start := 272310, stop := 272327 ), rec( content := ".\n\n \ ", count := [ 6, 4, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> IsPlanarDigraph(CompleteDigraph(4));\ntrue\ngap> IsPlanarDigraph(Complet\ eDigraph(5));\nfalse\ngap> IsPlanarDigraph(CompleteBipartiteDigraph(2, 3));\nt\ rue\ngap> IsPlanarDigraph(CompleteBipartiteDigraph(3, 3));\nfalse\ngap> IsPlan\ arDigraph(CompleteDigraph(IsMutableDigraph, 4));\ntrue\ngap> IsPlanarDigraph(C\ ompleteDigraph(IsMutableDigraph, 5));\nfalse\ngap> IsPlanarDigraph(CompleteBip\ artiteDigraph(IsMutableDigraph, 2, 3));\ntrue\ngap> IsPlanarDigraph(CompleteBi\ partiteDigraph(IsMutableDigraph, 3, 3));\nfalse\n", count := [ 6, 4, 1, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 4, 1, 7 ], mathmode := "Text", name := "Example", next := 272867, root := ~, start := 272335, stop := 272866 ), rec( content := "\n ", count := [ 6, 4, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 1, 3 ], mathmode := "Text", name := "Description", next := 272884, root := ~, start := 271489, stop := 272883 ) ], count := [ 6, 4, 1, 1 ], mathmode := "Text", name := "ManSection", next := 272898, root := ~, start := 271377, stop := 272897 ), rec( content := "\n\n ", count := [ 6, 4, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsOuterPlanarDi\ graph" ), content := 0, count := [ 6, 4, 2, 2 ], mathmode := "Text", name := "Prop", next := 272968, root := ~, start := 272919, stop := 272967 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "K", next := 272991, root := ~, start := 272980, stop := 272990 ), rec( content := " or ", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "K", next := 273007, root := ~, start := 272995, stop := 273006 ), rec( content := ".", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "Returns", next := 273018, root := ~, start := 272971, stop := 273017 ), rec( attributes := rec( ), content := [ rec( content := "\n An \ ", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ uter planar", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "E", next := 273061, root := ~, start := 273042, stop := 273060 ), rec( content := " digraph\ is a digraph that can be embedded in the\n plane in such a way that its ed\ ges do not intersect, and all vertices\n belong to the unbounded face of th\ e embedding. A digraph is outer planar\n if and only if it does not have a\ subdigraph that is homeomorphic to either\n the complete graph on ", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "4\ ", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "C", next := 273377, root := ~, start := 273369, stop := 273376 ), rec( content := " vertice\ s or the complete bipartite graph\n with vertex sets of sizes ", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "2\ ", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "C", next := 273457, root := ~, start := 273449, stop := 273456 ), rec( content := " and ", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "3\ ", count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "C", next := 273470, root := ~, start := 273462, stop := 273469 ), rec( content := ".\n " , count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "P", next := 273480, root := ~, start := 273476, stop := 273479 ), rec( content := "\n \n\ ", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sOuterPlanarDigraph", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "C", next := 273517, root := ~, start := 273490, stop := 273516 ), rec( content := " returns\ ", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "K", next := 273537, root := ~, start := 273526, stop := 273536 ), rec( content := " if the \ digraph\n ", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "A", next := 273571, root := ~, start := 273557, stop := 273570 ), rec( content := " is oute\ r planar and ", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "K", next := 273604, root := ~, start := 273592, stop := 273603 ), rec( content := " if it i\ s not. The\n directions and multiplicities of any edges in ", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "A", next := 273687, root := ~, start := 273673, stop := 273686 ), rec( content := " are ign\ ored by\n ", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sPlanarDigraph", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "C", next := 273729, root := ~, start := 273707, stop := 273728 ), rec( content := ". ", count := [ 6, 4, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 4, 2, 5 ], mathmode := "Text", name := "P", next := 273736, root := ~, start := 273732, stop := 273735 ), rec( content := "\n\n \ See also ", count := [ 6, 4, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsPlana\ rDigraph" ), content := 0, count := [ 6, 4, 2, 5 ], mathmode := "Text", name := "Ref", next := 273780, root := ~, start := 273751, stop := 273779 ), rec( content := ".\n\n \ This method uses the reference implementation in\n ", count := [ 6, 4, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "edge-addition-planarity-suite" ), content := [ rec( content := \ "https://github.com/graph-algorithms/edge-addition-planarity-suite", count := [ \ 6, 4, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 5 ], mathmode := \ "Text", name := "URL", next := 140, root := ~, start := 17, stop := 139 ) ], count := [ 6, 4, 2, 5 ], name := "Alt", next := 146, root := ~, start := 1, stop := 145 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "edge-addition-planarity-suite", count \ := [ 6, 4, 2, 5 ], name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 5 ], name := "Pac\ kage", next := 218, root := ~, start := 170, stop := 217 ) ], count := [ 6, 4, 2, 5 ], mathmode := "Text", name := "Alt", next := 224, root := ~, start := 146, stop := 223 ), rec( content := " by John\ Boyer of the algorithms described\n in ", count := [ 6, 4, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "BM06" ), content := 0, count := [ 6, 4, 2, 5 ], mathmode := "Text", name := "Cite", next := 273939, root := ~, start := 273921, stop := 273938 ), rec( content := ".\n\n", count := [ 6, 4, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> IsOuterPlanarDigraph(CompleteDigraph(4));\nfalse\ngap> IsOuterPlanarDigr\ aph(CompleteDigraph(5));\nfalse\ngap> IsOuterPlanarDigraph(CompleteBipartiteDi\ graph(2, 3));\nfalse\ngap> IsOuterPlanarDigraph(CompleteBipartiteDigraph(3, 3)\ );\nfalse\ngap> IsOuterPlanarDigraph(CycleDigraph(10));\ntrue\ngap> IsOuterPla\ narDigraph(CompleteDigraph(IsMutableDigraph, 4));\nfalse\ngap> IsOuterPlanarDi\ graph(CompleteDigraph(IsMutableDigraph, 5));\nfalse\ngap> IsOuterPlanarDigraph\ (CompleteBipartiteDigraph(IsMutableDigraph,\n> \ 2, 3));\nfalse\ngap> IsOuterPlanarDigraph(CompleteBipartiteD\ igraph(IsMutableDigraph,\n> 3\ , 3));\nfalse\ngap> IsOuterPlanarDigraph(CycleDigraph(IsMutableDigraph, 10));\ \ntrue\n\n", count := [ 6, 4, 2, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 6 ], mathmode := "Text", name := "Example", next := 274739, root := ~, start := 273942, stop := 274738 ), rec( content := "\n ", count := [ 6, 4, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 2, 3 ], mathmode := "Text", name := "Description", next := 274756, root := ~, start := 273021, stop := 274755 ) ], count := [ 6, 4, 2, 1 ], mathmode := "Text", name := "ManSection", next := 274770, root := ~, start := 272904, stop := 274769 ), rec( content := "\n\n ", count := [ 6, 4, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 4, 0, 1 ], mathmode := "Text", name := "Section", next := 274784, root := ~, start := 271335, stop := 274783 ) , rec( content := "\n\n ", count := [ 6, 4, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Homomorphisms and\ transformations", count := [ 6, 5, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 0, 2 ], mathmode := "Text", name := "Heading", next := 274849, root := ~, start := 274797, stop := 274848 ), rec( content := "\n ", count := [ 6, 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsDigraphCore" ), content := 0, count := [ 6, 5, 1, 2 ], mathmode := "Text", name := "Prop", next := 274911, root := ~, start := 274869, stop := 274910 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "K", next := 274934, root := ~, start := 274923, stop := 274933 ), rec( content := " or ", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "K", next := 274950, root := ~, start := 274938, stop := 274949 ), rec( content := ".", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "Returns", next := 274961, root := ~, start := 274914, stop := 274960 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s property returns ", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "K", next := 275015, root := ~, start := 275004, stop := 275014 ), rec( content := " if ", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "A", next := 275033, root := ~, start := 275019, stop := 275032 ), rec( content := " is a co\ re,\n and ", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "K", next := 275065, root := ~, start := 275053, stop := 275064 ), rec( content := " if it i\ s not.", count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "P", next := 275083, root := ~, start := 275079, stop := 275082 ), rec( content := "\n\n \ A digraph ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "C", next := 275107, root := ~, start := 275099, stop := 275106 ), rec( content := " is a ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ore", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "E", next := 275124, root := ~, start := 275113, stop := 275123 ), rec( content := " if and \ only if it has no proper\n subdigraphs ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "C", next := 275181, root := ~, start := 275173, stop := 275180 ), rec( content := " such th\ at there exists a homomorphism from ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "C", next := 275233, root := ~, start := 275225, stop := 275232 ), rec( content := "\n to\ ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "A\ ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "C", next := 275249, root := ~, start := 275241, stop := 275248 ), rec( content := ". In oth\ er words, a digraph ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "C", next := 275285, root := ~, start := 275277, stop := 275284 ), rec( content := " is a co\ re if and only if\n every endomorphism on ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "C", next := 275345, root := ~, start := 275337, stop := 275344 ), rec( content := " is an a\ utomorphism on ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "C", next := 275376, root := ~, start := 275368, stop := 275375 ), rec( content := ".\n " , count := [ 6, 5, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 5, 1, 5 ], mathmode := "Text", name := "P", next := 275386, root := ~, start := 275382, stop := 275385 ), rec( content := "\n \ \n If the argument ", count := [ 6, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 5 ], mathmode := "Text", name := "A", next := 275428, root := ~, start := 275414, stop := 275427 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 5, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(6);\n\n\ gap> IsDigraphCore(D);\ntrue\ngap> D := DigraphSymmetricClosure(CycleDigraph(6\ ));\n\ngap> DigraphHomo\ morphism(D, CompleteDigraph(2));\nTransformation( [ 1, 2, 1, 2, 1, 2 ] )\ngap>\ IsDigraphCore(D);\nfalse\n", count := [ 6, 5, 1, 6 ], name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 6 ], mathmode := "Text", name := "Example", next := 275889, root := ~, start := 275529, stop := 275888 ), rec( content := "\n ", count := [ 6, 5, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 1, 3 ], mathmode := "Text", name := "Description", next := 275906, root := ~, start := 274964, stop := 275905 ) ], count := [ 6, 5, 1, 1 ], mathmode := "Text", name := "ManSection", next := 275920, root := ~, start := 274854, stop := 275919 ), rec( content := "\n\n ", count := [ 6, 5, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsEdgeTransitiv\ e" ), content := 0, count := [ 6, 5, 2, 2 ], mathmode := "Text", name := "Prop", next := 275986, root := ~, start := 275941, stop := 275985 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "K", next := 276009, root := ~, start := 275998, stop := 276008 ), rec( content := " or ", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "K", next := 276025, root := ~, start := 276013, stop := 276024 ), rec( content := ".", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "Returns", next := 276036, root := ~, start := 275989, stop := 276035 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "A", next := 276074, root := ~, start := 276060, stop := 276073 ), rec( content := " is a di\ graph without multiple edges, then\n ", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sEdgeTransitive", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "C", next := 276144, root := ~, start := 276121, stop := 276143 ), rec( content := " returns\ ", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "K", next := 276164, root := ~, start := 276153, stop := 276163 ), rec( content := " if ", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "A", next := 276182, root := ~, start := 276168, stop := 276181 ), rec( content := "\n is\ edge transitive, and ", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "K", next := 276223, root := ~, start := 276211, stop := 276222 ), rec( content := " otherwi\ se. A digraph is\n ", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge transitive", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "E", next := 276274, root := ~, start := 276252, stop := 276273 ), rec( content := " if its \ automorphism group acts\n transitively on its edges (via the action\n ", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Func := "OnPairs" ), content := 0, count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "Ref", next := 276392, root := ~, start := 276356, stop := 276391 ), rec( content := ").\n \ ", count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 5, 2, 4 ], mathmode := "Text", name := "P", next := 276403, root := ~, start := 276399, stop := 276402 ), rec( content := "\n \ \n If the argument ", count := [ 6, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 2, 4 ], mathmode := "Text", name := "A", next := 276445, root := ~, start := 276431, stop := 276444 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 5, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> IsEdgeTransitive(CompleteDigraph(2));\ntrue\ngap> IsEdgeTransitive(Chain\ Digraph(3));\nfalse\ngap> IsEdgeTransitive(Digraph([[2], [3, 3, 3], []]));\nEr\ ror, the argument must be a digraph with no multiple edges,\n", count := [ 6, 5, 2, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 6, 5, 2, 5 ], mathmode := "Text", name := "Example", next := 276792, root := ~, start := 276546, stop := 276791 ), rec( content := "\n ", count := [ 6, 5, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 2, 3 ], mathmode := "Text", name := "Description", next := 276809, root := ~, start := 276039, stop := 276808 ) ], count := [ 6, 5, 2, 1 ], mathmode := "Text", name := "ManSection", next := 276823, root := ~, start := 275926, stop := 276822 ), rec( content := "\n\n ", count := [ 6, 5, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "IsVertexTransit\ ive" ), content := 0, count := [ 6, 5, 3, 2 ], mathmode := "Text", name := "Prop", next := 276891, root := ~, start := 276844, stop := 276890 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "K", next := 276914, root := ~, start := 276903, stop := 276913 ), rec( content := " or ", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "K", next := 276930, root := ~, start := 276918, stop := 276929 ), rec( content := ".", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "Returns", next := 276941, root := ~, start := 276894, stop := 276940 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "A", next := 276979, root := ~, start := 276965, stop := 276978 ), rec( content := " is a di\ graph, then ", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sVertexTransitive", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "C", next := 277024, root := ~, start := 276999, stop := 277023 ), rec( content := " returns\ \n ", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "K", next := 277048, root := ~, start := 277037, stop := 277047 ), rec( content := " if ", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "A", next := 277066, root := ~, start := 277052, stop := 277065 ), rec( content := " is vert\ ex transitive, and ", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "K", next := 277105, root := ~, start := 277093, stop := 277104 ), rec( content := "\n ot\ herwise. A digraph is ", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex transitive", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "E", next := 277158, root := ~, start := 277134, stop := 277157 ), rec( content := " if its \ automorphism group\n acts transitively on its vertices.\n ", count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 6, 5, 3, 4 ], mathmode := "Text", name := "P", next := 277232, root := ~, start := 277228, stop := 277231 ), rec( content := "\n \ \n If the argument ", count := [ 6, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 6, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 4 ], mathmode := "Text", name := "A", next := 277274, root := ~, start := 277260, stop := 277273 ), rec( content := " is muta\ ble, then the return value of\n this property is recomputed every time it i\ s called. \n\n ", count := [ 6, 5, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> IsVertexTransitive(CompleteDigraph(2));\ntrue\ngap> IsVertexTransitive(C\ hainDigraph(3));\nfalse\n", count := [ 6, 5, 3, 5 ], name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 5 ], mathmode := "Text", name := "Example", next := 277505, root := ~, start := 277375, stop := 277504 ), rec( content := "\n ", count := [ 6, 5, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 3, 3 ], mathmode := "Text", name := "Description", next := 277522, root := ~, start := 276944, stop := 277521 ) ], count := [ 6, 5, 3, 1 ], mathmode := "Text", name := "ManSection", next := 277536, root := ~, start := 276829, stop := 277535 ), rec( content := "\n\n ", count := [ 6, 5, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 5, 0, 1 ], mathmode := "Text", name := "Section", next := 277550, root := ~, start := 274788, stop := 277549 ) , rec( content := "\n\n \n", count := [ 6, 5, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 6, 0, 0, 1 ], mathmode := "Text", name := "Chapter", next := 277565, root := ~, start := 231997, stop := 277564 ), rec( content := "\n ", count := [ 6, 5, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " properties ", count := [ 6, 5, 3, 6 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 6, 5, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Homomorphisms" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Homomorphisms", count := [ 7, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 277652, root := ~, start := 277620, stop := 277651 ) , rec( content := "\n ", count := [ 7, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := "Let $E_a=(E_a^0,E_a^1,\\ra_a,\\s\ o_a)$ and $E_b=(E_b^0,E_b^1,\\ra_b,\\so_b)$ be two\ngraphs, and let $\\phi_0 :\ E_a^0 \\to E_b^0$ and $\\phi_1 : E_a^1 \\to E_b^1$ be\nfunctions. Then the pa\ ir $\\phi = (\\phi_0, \\phi_1)$ is a \\emph{graph homomorphism\nfrom} $E_a$ \\\ emph{to} $E_b$ if $\\phi_0(\\so_a(e)) = \\so_b(\\phi_1(e))$ and\n$\\phi_0(\\ra\ _a(e)) = \\ra_b(\\phi_1(e))$ for every $e \\in E_a^1$. If $\\phi_0$ and\n$\\ph\ i_1$ are in addition bijective, then $\\phi$ is a \\emph{graph isomorphism\nfr\ om} $E_a$ \\emph{to} $E_b$. In this case we say that $E_a$ and $E_b$ are\n\\em\ ph{isomorphic} and write $E_a \\cong E_b$.", count := [ 7, 0, 0, 3 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n\n ", count := [ 7, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Acting on digraph\ s", count := [ 7, 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 278296, root := ~, start := 278259, stop := 278295 ), rec( content := "\n ", count := [ 7, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, perm", Label := "for a digraph \ and a perm", Name := "OnDigraphs" ), content := 0, count := [ 7, 1, 1, 2 ], mathmode := "Text", name := "Oper", next := 278398, root := ~, start := 278316, stop := 278397 ), rec( attributes := rec( Arg := "digraph, trans", Label := "for a digraph \ and a transformation", Name := "OnDigraphs" ), content := 0, count := [ 7, 1, 1, 4 ], mathmode := "Text", name := "Oper", next := 278494, root := ~, start := 278401, stop := 278493 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "Returns", next := 278526, root := ~, start := 278497, stop := 278525 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "A", next := 278564, root := ~, start := 278550, stop := 278563 ), rec( content := " is a di\ graph, and the second argument ", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ erm", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "A", next := 278614, root := ~, start := 278603, stop := 278613 ), rec( content := " is a\n \ ", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ermutation", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "E", next := 278642, root := ~, start := 278624, stop := 278641 ), rec( content := " of the \ vertices of ", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "A", next := 278676, root := ~, start := 278662, stop := 278675 ), rec( content := ", then t\ his operation\n returns a digraph constructed by relabelling the vertices o\ f\n ", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "A", next := 278781, root := ~, start := 278767, stop := 278780 ), rec( content := " accordi\ ng to ", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ erm", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "A", next := 278806, root := ~, start := 278795, stop := 278805 ), rec( content := ". Note \ that for an automorphism\n ", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "C", next := 278851, root := ~, start := 278843, stop := 278850 ), rec( content := " of a di\ graph, we have ", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ nDigraphs(", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "digraph", count := [ 7, 1, 1, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := \ "Text", name := "A", next := 278902, root := ~, start := 278888, stop := 27890\ 1 ), rec( content := ", f) =\n ", count := [ 7, 1, 1, 5 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "C", next := 278917, root := ~, start := 278874, stop := 278916 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "A", next := 278931, root := ~, start := 278917, stop := 278930 ), rec( content := ".\n " , count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "P", next := 278941, root := ~, start := 278937, stop := 278940 ), rec( content := "\n\n \ If the second argument is a ", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ ransformation", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "E", next := 278996, root := ~, start := 278975, stop := 278995 ), rec( content := " ", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rans", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "A", next := 279009, root := ~, start := 278997, stop := 279008 ), rec( content := " of the\\ n vertices of ", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "A", next := 279047, root := ~, start := 279033, stop := 279046 ), rec( content := ", then t\ his operation returns a digraph\n constructed by transforming the source an\ d range of each edge according to\n ", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rans", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "A", next := 279182, root := ~, start := 279170, stop := 279181 ), rec( content := ". Thus a\ vertex which does not appear in the image of\n ", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rans", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "A", next := 279252, root := ~, start := 279240, stop := 279251 ), rec( content := " will be\ isolated in the returned digraph, and the returned\n digraph may contain m\ ultiple edges, even if ", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "A", next := 279374, root := ~, start := 279360, stop := 279373 ), rec( content := " does no\ t.\n If ", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rans", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "A", next := 279404, root := ~, start := 279392, stop := 279403 ), rec( content := " is math\ ematically a permutation, then the result coincides\n with ", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ nDigraphs(", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "digraph", count := [ 7, 1, 1, 6 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := \ "Text", name := "A", next := 279501, root := ~, start := 279487, stop := 27950\ 0 ), rec( content := ", AsPermutation(", count := [ 7, 1, 1, 6 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "trans", count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "A", next := 2795\ 29, root := ~, start := 279517, stop := 279528 ), rec( content := "))", count := [ 7, 1, 1, 6 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "C", next := 279535, root := ~, start := 279473, stop := 279534 ), rec( content := ".\n " , count := [ 7, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 1, 1, 7 ], mathmode := "Text", name := "P", next := 279545, root := ~, start := 279541, stop := 279544 ), rec( content := "\n\n \ The ", count := [ 7, 1, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 7, 1, 1, 7 ], mathmode := "Text", name := "Ref", next := 279588, root := ~, start := 279555, stop := 279587 ), rec( content := " of ", count := [ 7, 1, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 7 ], mathmode := "Text", name := "A", next := 279606, root := ~, start := 279592, stop := 279605 ), rec( content := " will no\ t be retained\n in the returned digraph. ", count := [ 7, 1, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "P", next := 279661, root := ~, start := 279657, stop := 279660 ), rec( content := "\n\n \ If ", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "A", next := 279684, root := ~, start := 279670, stop := 279683 ), rec( content := " belongs\ to ", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "Ref", next := 279726, root := ~, start := 279696, stop := 279725 ), rec( content := ", then\n\ relabelling of the vertices is performed directly on ", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "A", next := 279804, root := ~, start := 279790, stop := 279803 ), rec( content := ".\n I\ f ", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "A", next := 279827, root := ~, start := 279813, stop := 279826 ), rec( content := " belongs\ to ", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "Ref", next := 279871, root := ~, start := 279839, stop := 279870 ), rec( content := ", an imm\ utable\n copy of ", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "A", next := 279912, root := ~, start := 279898, stop := 279911 ), rec( content := " with th\ e vertices relabelled is returned.", count := [ 7, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 1, 1, 9 ], mathmode := "Text", name := "P", next := 279958, root := ~, start := 279954, stop := 279957 ), rec( content := "\n\n \ ", count := [ 7, 1, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[3], [1, 3, 5], [1], [1, 2, 4], [2, 3, 5]]);\n\ngap> new := OnDigraphs(D, (1, 2));\n\ngap> OutNeighbours(new);\n[ [ 2, 3, 5 \ ], [ 3 ], [ 2 ], [ 2, 1, 4 ], [ 1, 3, 5 ] ]\ngap> D := Digraph([[2], [], [2]])\ ;\n\ngap> t := Transformation([1, \ 2, 1]);;\ngap> new := OnDigraphs(D, t);\n\ngap> OutNeighbours(new);\n[ [ 2, 2 ], [ ], [ ] ]\ngap> ForAll(\ DigraphEdges(D),\n> e -> IsDigraphEdge(new, [e[1] ^ t, e[2] ^ t]));\ntrue\n", count := [ 7, 1, 1, 10 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 1, 1, 10 ], mathmode := "Text", name := "Example", next := 280601, root := ~, start := 279964, stop := 280600 ), rec( content := "\n ", count := [ 7, 1, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 1, 5 ], mathmode := "Text", name := "Description", next := 280618, root := ~, start := 278529, stop := 280617 ) ], count := [ 7, 1, 1, 1 ], mathmode := "Text", name := "ManSection", next := 280632, root := ~, start := 278301, stop := 280631 ), rec( content := "\n\n ", count := [ 7, 1, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, pair", Name := "OnMultiDigraphs\ " ), content := 0, count := [ 7, 1, 2, 2 ], mathmode := "Text", name := "Oper", next := 280703, root := ~, start := 280653, stop := 280702 ), rec( attributes := rec( Arg := "digraph, perm1, \ perm2", Label := "for a digraph, perm, and perm", Name := "OnMultiDigraphs" ), content := 0, count := [ 7, 1, 2, 4 ], mathmode := "Text", name := "Oper", next := 280806, root := ~, start := 280706, stop := 280805 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "Returns", next := 280838, root := ~, start := 280809, stop := 280837 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "A", next := 280876, root := ~, start := 280862, stop := 280875 ), rec( content := " is a di\ graph, and ", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ air", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "A", next := 280906, root := ~, start := 280895, stop := 280905 ), rec( content := " is a pa\ ir consisting of a\n permutation of the vertices and a permutation of the e\ dges of\n ", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "A", next := 281017, root := ~, start := 281003, stop := 281016 ), rec( content := ", then t\ his operation returns a digraph\n constructed by relabelling the vertices a\ nd edges of ", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "A", next := 281128, root := ~, start := 281114, stop := 281127 ), rec( content := "\n ac\ cording to ", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ erm[1]", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "A", next := 281160, root := ~, start := 281146, stop := 281159 ), rec( content := " and ", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ erm[2]", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "A", next := 281179, root := ~, start := 281165, stop := 281178 ), rec( content := ", respec\ tively. ", count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "P", next := 281199, root := ~, start := 281195, stop := 281198 ), rec( content := "\n\n \ In its second form, ", count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ nMultiDigraphs", count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "C", next := 281247, root := ~, start := 281225, stop := 281246 ), rec( content := " returns\ a digraph with vertices\n and edges permuted by ", count := [ 7, 1, 2, 6 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ erm1", count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "A", next := 281318, root := ~, start := 281306, stop := 281317 ), rec( content := " and ", count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ erm2", count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "A", next := 281335, root := ~, start := 281323, stop := 281334 ), rec( content := ", respec\ tively. ", count := [ 7, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "P", next := 281355, root := ~, start := 281351, stop := 281354 ), rec( content := "\n\n \ Note that ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ nDigraphs(", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "digraph", count := [ 7, 1, 2, 7 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := \ "Text", name := "A", next := 281399, root := ~, start := 281385, stop := 28139\ 8 ), rec( content := ",\n perm)=OnMultiDigraphs(", count := [ 7, 1, 2, 7 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "A", next := 2814\ 43, root := ~, start := 281429, stop := 281442 ), rec( content := ", [perm, ()\ ])", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "C", next := 281460, root := ~, start := 281371, stop := 281459 ), rec( content := " where " , count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ erm", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "C", next := 281478, root := ~, start := 281467, stop := 281477 ), rec( content := " is\n \ a permutation of the vertices of ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "A", next := 281533, root := ~, start := 281519, stop := 281532 ), rec( content := ". If you\ are only interested\n in the action of a permutation on the vertices of a \ digraph, then you can\n use ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ nDigraphs", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "C", next := 281665, root := ~, start := 281648, stop := 281664 ), rec( content := " instead\ of ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ nMultiDigraphs", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "C", next := 281699, root := ~, start := 281677, stop := 281698 ), rec( content := ".\n\n \ If ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "A", next := 281723, root := ~, start := 281709, stop := 281722 ), rec( content := " belongs\ to ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "Ref", next := 281765, root := ~, start := 281735, stop := 281764 ), rec( content := ", then\n\ relabelling of the vertices is performed directly on ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "A", next := 281843, root := ~, start := 281829, stop := 281842 ), rec( content := ".\n I\ f ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "A", next := 281866, root := ~, start := 281852, stop := 281865 ), rec( content := " belongs\ to ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "Ref", next := 281910, root := ~, start := 281878, stop := 281909 ), rec( content := ", an imm\ utable\n copy of ", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "A", next := 281951, root := ~, start := 281937, stop := 281950 ), rec( content := " with th\ e vertices relabelled is returned.", count := [ 7, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 1, 2, 8 ], mathmode := "Text", name := "P", next := 281997, root := ~, start := 281993, stop := 281996 ), rec( content := "\n\n \ ", count := [ 7, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D1 := Digraph([\n> [3, 6, 3], [], [3], [9, 10], [9], [], [], [10, 4, 10\ ], [], []]);\n\ngap> p := B\ lissCanonicalLabelling(D1);\n[ (1,7)(3,6)(4,10)(5,9), () ]\ngap> D2 := OnMulti\ Digraphs(D1, p);\n\ngap> Ou\ tNeighbours(D2);\n[ [ ], [ ], [ ], [ ], [ ], [ 6 ], [ 6, 3, 6 ], [ 4, 10,\ 4 ], \n [ 5 ], [ 5, 4 ] ]", count := [ 7, 1, 2, 9 ], name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 9 ], mathmode := "Text", name := "Example", next := 282442, root := ~, start := 282003, stop := 282441 ), rec( content := "\n ", count := [ 7, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 2, 5 ], mathmode := "Text", name := "Description", next := 282459, root := ~, start := 280841, stop := 282458 ) ], count := [ 7, 1, 2, 1 ], mathmode := "Text", name := "ManSection", next := 282473, root := ~, start := 280638, stop := 282472 ), rec( content := "\n\n ", count := [ 7, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 1, 0, 1 ], mathmode := "Text", name := "Section", next := 282487, root := ~, start := 278250, stop := 282486 ) , rec( content := "\n\n ", count := [ 7, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Isomorphisms and canonical lab\ ellings" ), content := [ rec( content := "\n ", count := [ 7, 2, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Isomorphisms and \ canonical labellings", count := [ 7, 2, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 2 ], mathmode := "Text", name := "Heading", next := 282607, root := ~, start := 282551, stop := 282606 ), rec( content := "\n From version 0.11.\ 0 of ", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " it is possible to use e\ ither ", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "bliss" ), content := [ rec( content := "http://ww\ w.tcs.tkk.fi/Software/bliss/", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 0, 3 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], name := "Package", next := 131, root := ~, start := 107, stop := 130 ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " or\n ", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "nauty" ), content := [ rec( content := "http://pa\ llini.di.uniroma1.it/", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 0, 3 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], name := "Package", next := 124, root := ~, start := 100, stop := 123 ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " (via ", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "NautyTracesInte\ rface" ), content := [ rec( content := "https://github.com/gap-packages/NautyT\ racesInterface", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 0, 3 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ) , rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "NautyTrac\ esInterface", count := [ 7, 2, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], name := "Package", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := ") to calculate canonical\ labellings and\n automorphism groups of digraphs; see ", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "JK07" ), content := 0, count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "Cite", next := 282824, root := ~, start := 282806, stop := 282823 ), rec( content := " and ", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Key := "MP14" ), content := 0, count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "Cite", next := 282853, root := ~, start := 282829, stop := 282852 ), rec( content := " for more details about \ ", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "bliss" ), content := [ rec( content := "http://ww\ w.tcs.tkk.fi/Software/bliss/", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 0, 3 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], name := "Package", next := 131, root := ~, start := 107, stop := 130 ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " and ", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "nauty" ), content := [ rec( content := "http://pa\ llini.di.uniroma1.it/", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 0, 3 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes := rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 3 ], name := "Package", next := 124, root := ~, start := 100, stop := 123 ) ], count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := ",\n respectively. \n\\ n ", count := [ 7, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "", Name := "DigraphsUseNaut\ y" ), content := 0, count := [ 7, 2, 1, 2 ], mathmode := "Text", name := "Func", next := 282975, root := ~, start := 282937, stop := 282974 ), rec( attributes := rec( Arg := "", Name := "DigraphsUseBlis\ s" ), content := 0, count := [ 7, 2, 1, 4 ], mathmode := "Text", name := "Func", next := 283016, root := ~, start := 282978, stop := 283015 ), rec( attributes := rec( ), content := [ rec( content := "Nothing." , count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "Returns", next := 283046, root := ~, start := 283019, stop := 283045 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ se functions can be used to specify whether ", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 1, 5 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 1, 5 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 5 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " or ", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 1, 5 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 1, 5 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 5 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " should \ be\n used by default by ", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ". If ", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 7, 2, 1, 5 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 5 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 1, 5 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 7, 2\ , 1, 5 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 5 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " is not \ available,\n then these functions do nothing. Otherwise, by calling\n ", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphsUseNauty", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "C", next := 283308, root := ~, start := 283285, stop := 283307 ), rec( content := " subsequ\ ent computations will default to using\n ", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 1, 5 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 1, 5 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 5 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " rather \ than ", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 1, 5 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 1, 5 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 5 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := ", where \ possible.\n ", count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "P", next := 283412, root := ~, start := 283408, stop := 283411 ), rec( content := "\n\n \ You can call these functions at any point in a ", count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ AP", count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := " session\ , as many\n times as you like, it is guaranteed that existing digraphs rema\ in\n valid, and that comparison of existing digraphs and newly created digr\ aphs\n via\n ", count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs", Oper := "IsIsomorphicDigraph" ), content := 0, count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "Ref", next := 283703, root := ~, start := 283649, stop := 283702 ), rec( content := ",\n " , count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs and homogeneous lists", Oper := "IsIsomorphicDigraph" ), content := 0, count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "Ref", next := 283791, root := ~, start := 283709, stop := 283790 ), rec( content := ",\n " , count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "Ref", next := 283851, root := ~, start := 283797, stop := 283850 ), rec( content := ", and\n \ ", count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs and homogeneous lists", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "Ref", next := 283943, root := ~, start := 283861, stop := 283942 ), rec( content := " are als\ o valid.", count := [ 7, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "P", next := 283963, root := ~, start := 283959, stop := 283962 ), rec( content := "\n\n \ It is also possible to compute the automorphism group of a specific digraph\n \ using both ", count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 1, 7 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 1, 7 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 7 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " and ", count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 1, 7 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 1, 7 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 7 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " using " , count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "NautyAu\ tomorphismGroup" ), content := 0, count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "Ref", next := 284122, root := ~, start := 284086, stop := 284121 ), rec( content := "\n an\ d ", count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "BlissAu\ tomorphismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "Ref", next := 284189, root := ~, start := 284131, stop := 284188 ), rec( content := ", respec\ tively.\n ", count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 1, 5 ], mathmode := "Text", name := "Description", next := 284221, root := ~, start := 283049, stop := 284220 ) ], count := [ 7, 2, 1, 1 ], mathmode := "Text", name := "ManSection", next := 284235, root := ~, start := 282922, stop := 284234 ), rec( content := "\n\n ", count := [ 7, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Label := "for a digraph" , Name := "AutomorphismGro\ up" ), content := 0, count := [ 7, 2, 2, 2 ], mathmode := "Text", name := "Attr", next := 284324, root := ~, start := 284256, stop := 284323 ), rec( attributes := rec( ), content := [ rec( content := "A permuta\ tion group.", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "Returns", next := 284366, root := ~, start := 284327, stop := 284365 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "A", next := 284404, root := ~, start := 284390, stop := 284403 ), rec( content := " is a di\ graph, then this attribute contains the group of\n automorphisms of ", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "A", next := 284496, root := ~, start := 284482, stop := 284495 ), rec( content := ". An ", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ utomorphism", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "E", next := 284521, root := ~, start := 284502, stop := 284520 ), rec( content := " of ", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "A", next := 284539, root := ~, start := 284525, stop := 284538 ), rec( content := "\n is\ an isomorphism from ", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "A", next := 284581, root := ~, start := 284567, stop := 284580 ), rec( content := " to itse\ lf. See ", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "Ref", next := 284658, root := ~, start := 284597, stop := 284657 ), rec( content := " for mor\ e information\n about isomorphisms of digraphs. ", count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 2, 4 ], mathmode := "Text", name := "P", next := 284720, root := ~, start := 284716, stop := 284719 ), rec( content := "\n\n \ If ", count := [ 7, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 4 ], mathmode := "Text", name := "A", next := 284743, root := ~, start := 284729, stop := 284742 ), rec( content := " is not \ a multidigraph then the automorphism group is\n returned as a group of perm\ utations on the set of vertices of\n ", count := [ 7, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 4 ], mathmode := "Text", name := "A", next := 284881, root := ~, start := 284867, stop := 284880 ), rec( content := ". ", count := [ 7, 2, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "P", next := 284887, root := ~, start := 284883, stop := 284886 ), rec( content := "\n\n \ If ", count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "A", next := 284910, root := ~, start := 284896, stop := 284909 ), rec( content := " is a mu\ ltidigraph then the automorphism group is returned\n as the direct product \ of a group of permutations on the set of vertices of\n ", count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "A", next := 285066, root := ~, start := 285052, stop := 285065 ), rec( content := " with a \ group of permutations on the set of edges of\n ", count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "A", next := 285137, root := ~, start := 285123, stop := 285136 ), rec( content := ". These \ groups can be accessed using ", count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Label := "for a domain and a positive integer", Oper := "Projection" ), content := 0, count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "Ref", next := 285263, root := ~, start := 285174, stop := 285262 ), rec( content := " on the\\ n returned group.", count := [ 7, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "P", next := 285294, root := ~, start := 285290, stop := 285293 ), rec( content := "\n\n \ By default, the automorphism group is found using ", count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 2, 6 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 2, 6 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 6 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila\n and Petteri Kaski. If ", count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 7, 2, 2, 6 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 6 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 2, 6 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 7, 2\ , 2, 6 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 6 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " is avai\ lable, then ", count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 2, 6 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 2, 6 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 6 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by\n \ Brendan Mckay and Adolfo Piperno can be used instead; see\n ", count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "BlissAu\ tomorphismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "Ref", next := 285579, root := ~, start := 285521, stop := 285578 ), rec( content := ", \n \ ", count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "NautyAu\ tomorphismGroup" ), content := 0, count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "Ref", next := 285622, root := ~, start := 285586, stop := 285621 ), rec( content := ", ", count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseBliss" ), content := 0, count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "Ref", next := 285654, root := ~, start := 285624, stop := 285653 ), rec( content := ",\n a\ nd ", count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseNauty" ), content := 0, count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "Ref", next := 285694, root := ~, start := 285664, stop := 285693 ), rec( content := ".\n " , count := [ 7, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 2, 7 ], mathmode := "Text", name := "P", next := 285704, root := ~, start := 285700, stop := 285703 ), rec( content := "\n\n \ If the argument ", count := [ 7, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 7 ], mathmode := "Text", name := "A", next := 285740, root := ~, start := 285726, stop := 285739 ), rec( content := " is muta\ ble, then the return value of\n this attribute is recomputed every time it \ is called. \n\n ", count := [ 7, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> johnson := DigraphFromGraph6String(\"E}lw\");\n\ngap> G := AutomorphismGroup(johnson);\nGroup([ (3,4), (2\ ,3)(4,5), (1,2)(5,6) ])\ngap> cycle := CycleDigraph(9);\n\ngap> G := AutomorphismGroup(cycle);\nGroup([ (1,2,3,4,5,\ 6,7,8,9) ])\ngap> IsCyclic(G) and Size(G) = 9;\ntrue", count := [ 7, 2, 2, 8 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 2, 8 ], mathmode := "Text", name := "Example", next := 286226, root := ~, start := 285842, stop := 286225 ), rec( content := "\n ", count := [ 7, 2, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 2, 3 ], mathmode := "Text", name := "Description", next := 286245, root := ~, start := 284369, stop := 286244 ) ], count := [ 7, 2, 2, 1 ], mathmode := "Text", name := "ManSection", next := 286261, root := ~, start := 284241, stop := 286260 ), rec( content := "\n\n ", count := [ 7, 2, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Label := "for a digraph" , Name := "BlissAutomorphi\ smGroup" ), content := 0, count := [ 7, 2, 3, 2 ], mathmode := "Text", name := "Attr", next := 286355, root := ~, start := 286282, stop := 286354 ), rec( attributes := rec( Arg := "digraph, vertex_\ colours", Label := "for a digraph and homogenous list", Name := "BlissAutomorphi\ smGroup" ), content := 0, count := [ 7, 2, 3, 4 ], mathmode := "Text", name := "Oper", next := 286472, root := ~, start := 286358, stop := 286471 ), rec( attributes := rec( Arg := "digraph, vertex_\ colours, edge_colours", Label := "for a digraph, homogenous list, and list", Name := "BlissAutomorphi\ smGroup" ), content := 0, count := [ 7, 2, 3, 6 ], mathmode := "Text", name := "Oper", next := 286610, root := ~, start := 286475, stop := 286609 ), rec( attributes := rec( ), content := [ rec( content := "A permuta\ tion group.", count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "Returns", next := 286652, root := ~, start := 286613, stop := 286651 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "A", next := 286690, root := ~, start := 286676, stop := 286689 ), rec( content := " is a di\ graph, then this attribute contains the group of\n automorphisms of ", count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "A", next := 286782, root := ~, start := 286768, stop := 286781 ), rec( content := " as calc\ ulated using ", count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 3, 7 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 3, 7 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 7 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila\n and Petteri Kaski. ", count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "P", next := 286856, root := ~, start := 286852, stop := 286855 ), rec( content := "\n\n \ The attribute ", count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 2, 3, 8 ] , mathmode := "Text", name := "Ref", next := 286929, root := ~, start := 286876, stop := 286928 ), rec( content := " and\n \ operation ", count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and a homogeneous list", Oper := "AutomorphismGroup" ), content := 0, count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "Ref", next := 287031, root := ~, start := 286948, stop := 287030 ), rec( content := " returns\ \n the value of either ", count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ lissAutomorphismGroup", count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "C", next := 287093, root := ~, start := 287064, stop := 287092 ), rec( content := " or ", count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "NautyAu\ tomorphismGroup" ), content := 0, count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "Ref", next := 287139, root := ~, start := 287097, stop := 287138 ), rec( content := ". These \ groups are, of course, equal but\n their generating sets may differ. ", count := [ 7, 2, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "P", next := 287222, root := ~, start := 287218, stop := 287221 ), rec( content := "\n Th\ e attribute ", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph, homogeneous list, and list" ), content := 0, count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "Ref", next := 287329, root := ~, start := 287241, stop := 287328 ), rec( content := " returns\ the value of\n ", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ lissAutomorphismGroup", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "C", next := 287384, root := ~, start := 287355, stop := 287383 ), rec( content := " as it i\ s not implemented for ", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 3, 9 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 3, 9 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 9 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " The \n \ requirements for the optional arguments ", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ertex_colours", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "A", next := 287492, root := ~, start := 287471, stop := 287491 ), rec( content := " and \n \ ", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge_colours", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "A", next := 287521, root := ~, start := 287502, stop := 287520 ), rec( content := " are doc\ umented in ", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph, homogeneous list, and list" ), content := 0, count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "Ref", next := 287628, root := ~, start := 287540, stop := 287627 ), rec( content := ".\n\n \ See also ", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseBliss" ), content := 0, count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "Ref", next := 287674, root := ~, start := 287644, stop := 287673 ), rec( content := ", and ", count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseNauty" ), content := 0, count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "Ref", next := 287710, root := ~, start := 287680, stop := 287709 ), rec( content := ".\n " , count := [ 7, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 3, 10 ], mathmode := "Text", name := "P", next := 287720, root := ~, start := 287716, stop := 287719 ), rec( content := "\n\n \ If the argument ", count := [ 7, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 10 ], mathmode := "Text", name := "A", next := 287756, root := ~, start := 287742, stop := 287755 ), rec( content := " is muta\ ble, then the return value of\n this attribute is recomputed every time it \ is called. \n\n ", count := [ 7, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> G := BlissAutomorphismGroup(JohnsonDigraph(5, 2));;\ngap> IsSymmetricGro\ up(G);\ntrue\ngap> Size(G);\n120", count := [ 7, 2, 3, 11 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 11 ], mathmode := "Text", name := "Example", next := 287995, root := ~, start := 287858, stop := 287994 ), rec( content := "\n ", count := [ 7, 2, 3, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 3, 7 ], mathmode := "Text", name := "Description", next := 288014, root := ~, start := 286655, stop := 288013 ) ], count := [ 7, 2, 3, 1 ], mathmode := "Text", name := "ManSection", next := 288030, root := ~, start := 286267, stop := 288029 ), rec( content := "\n\n ", count := [ 7, 2, 3, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph[, vert_c\ olours]", Name := "NautyAutomorphismGroup" ), content := 0, count := [ 7, 2, 4, 2 ], mathmode := "Text", name := "Attr", next := 288118, root := ~, start := 288051, stop := 288117 ), rec( attributes := rec( ), content := [ rec( content := "A permuta\ tion group.", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "Returns", next := 288160, root := ~, start := 288121, stop := 288159 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "A", next := 288198, root := ~, start := 288184, stop := 288197 ), rec( content := " is a di\ graph, then this attribute contains the group of\n automorphisms of ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "A", next := 288290, root := ~, start := 288276, stop := 288289 ), rec( content := " as calc\ ulated using ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 4, 3 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 4, 3 ], name \ := "PCDATA", root := ~ ) ], count := [ 7, 2, 4, 3 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by\n \ Brendan Mckay and Adolfo Piperno via ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 7, 2, 4, 3 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 4, 3 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 4, 3 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 7, 2\ , 4, 3 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 4, 3 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := ".\n\n \ ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( content := " FIXME b\ e more explicit about what the second arg is ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "XMLCOMMENT" , root := ~ ), rec( content := "\n\n \ The attribute ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 2, 4, 3 ] , mathmode := "Text", name := "Ref", next := 288525, root := ~, start := 288472, stop := 288524 ), rec( content := " and\n \ operation ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and a homogeneous list", Oper := "AutomorphismGroup" ), content := 0, count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "Ref", next := 288627, root := ~, start := 288544, stop := 288626 ), rec( content := " returns\ \n the value of either ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "N\ autyAutomorphismGroup", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "C", next := 288689, root := ~, start := 288660, stop := 288688 ), rec( content := " or ", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "BlissAu\ tomorphismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "Ref", next := 288758, root := ~, start := 288694, stop := 288757 ), rec( content := ".\n T\ hese groups are, of course, equal but their generating sets may differ.", count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 4, 4 ], mathmode := "Text", name := "P", next := 288840, root := ~, start := 288836, stop := 288839 ), rec( content := "\n\n \ See also ", count := [ 7, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseBliss" ), content := 0, count := [ 7, 2, 4, 4 ], mathmode := "Text", name := "Ref", next := 288885, root := ~, start := 288855, stop := 288884 ), rec( content := ", and ", count := [ 7, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseNauty" ), content := 0, count := [ 7, 2, 4, 4 ], mathmode := "Text", name := "Ref", next := 288921, root := ~, start := 288891, stop := 288920 ), rec( content := ".\n " , count := [ 7, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 4, 5 ], mathmode := "Text", name := "P", next := 288931, root := ~, start := 288927, stop := 288930 ), rec( content := "\n\n \ If the argument ", count := [ 7, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 4, 5 ], mathmode := "Text", name := "A", next := 288967, root := ~, start := 288953, stop := 288966 ), rec( content := " is muta\ ble, then the return value of\n this attribute is recomputed every time it \ is called. \n\n ", count := [ 7, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> NautyAutomorphismGroup(JohnsonDigraph(5, 2));\nGroup([ (3,4)(6,7)(8,9), \ (2,3)(5,6)(9,10), (2,5)(3,6)(4,7),\n (1,2)(6,8)(7,9) ])", count := [ 7, 2, 4, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 4, 6 ], mathmode := "Text", name := "Log", next := 289223, root := ~, start := 289069, stop := 289222 ), rec( content := "\n ", count := [ 7, 2, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 4, 3 ], mathmode := "Text", name := "Description", next := 289242, root := ~, start := 288163, stop := 289241 ) ], count := [ 7, 2, 4, 1 ], mathmode := "Text", name := "ManSection", next := 289258, root := ~, start := 288036, stop := 289257 ), rec( content := "\n\n ", count := [ 7, 2, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vert_co\ lours", Label := "for a digraph and a homogeneous list", Name := "AutomorphismGro\ up" ), content := 0, count := [ 7, 2, 5, 2 ], mathmode := "Text", name := "Oper", next := 289388, root := ~, start := 289279, stop := 289387 ), rec( attributes := rec( ), content := [ rec( content := "A permuta\ tion group.", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "Returns", next := 289430, root := ~, start := 289391, stop := 289429 ), rec( attributes := rec( ), content := [ rec( content := "\n\n T\ his operation computes the automorphism group of a vertex-coloured digraph.\n \ A vertex-coloured digraph can be specified by its underlying digraph\n " , count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "A", next := 289620, root := ~, start := 289606, stop := 289619 ), rec( content := " and its\ colouring ", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ert_colours", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "A", next := 289658, root := ~, start := 289639, stop := 289657 ), rec( content := ". Let ", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "C", next := 289672, root := ~, start := 289664, stop := 289671 ), rec( content := " be the\\ n number of vertices of ", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "A", next := 289720, root := ~, start := 289706, stop := 289719 ), rec( content := ". The co\ louring ", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ert_colours", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "A", next := 289755, root := ~, start := 289736, stop := 289754 ), rec( content := " may\n \ have one of the following two forms:\n\n ", count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n a list of ", count := [ 7, 2\ , 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 7, 2, 5, 5 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 5 ], mathmode\ := "Text", name := "C", next := 289852, root := ~, start := 289844, stop := 2\ 89851 ), rec( content := " integers, where ", count := [ 7, 2, 5, 5 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conten\ t := [ rec( content := "vert_colours", count := [ 7, 2, 5, 5 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 5 ], mathmode := "T\ ext", name := "A", next := 289888, root := ~, start := 289869, stop := 289887 ), rec( attr\ ibutes := rec( ), content := [ rec( content := "[i]", count := [ 7, 2, 5, 5 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 5 ] , math\ mode := "Text", name := "C", next := 289898, root := ~, start := 289888, stop \ := 289897 ), rec( content := " is the\n colour of vertex ", count := [ \ 7, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := [ rec( content := "i", count := [ 7, 2, 5, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 5 ], math\ mode := "Text", name := "C", next := 289939, root := ~, start := 289931, stop \ := 289938 ), rec( content := ", using the colours ", count := [ 7, 2, 5, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "[1 .. m]", count := [ 7, 2, 5, 5 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 5 ], mathmode := "Tex\ t", name := "C", next := 289974, root := ~, start := 289959, stop := 289973 ), rec( cont\ ent := " for some\n ", count := [ 7, 2, 5, 5 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "m <= n", count := [ 7, 2, 5, 5 ], mathmode := "Text", name := "PCDATA",\ root := ~ ) ], count := [ 7, 2, 5, 5 ], mathmode := "Text", name := "C", next\ := 290008, root := ~, start := 289992, stop := 290007 ), rec( content := "; o\ r\n ", count := [ 7, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 5, 5 ], name := "Item", next := 290026, root := ~, start := 289\ 819, stop := 290025 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n a list of non-empty disjoint lists whose union is\n ", coun\ t := [ 7, 2, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "DigraphVertices(", count := [\ 7, 2, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "digraph", count := [ 7, 2, 5, 7 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 7 \ ], mathmode := "Text", name := "A", next := 290139, root := ~, start := 290125\ , stop := 290138 ), rec( content := ")", count := [ 7, 2, 5, 7 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 7 ], mathmode := \ "Text", name := "C", next := 290144, root := ~, start := 290106, stop := 29014\ 3 ), rec( content := ", such that\n ", count := [ 7, 2, 5, 7 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conten\ t := [ rec( content := "vert_colours", count := [ 7, 2, 5, 7 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 7 ], mathmode := "T\ ext", name := "A", next := 290183, root := ~, start := 290164, stop := 290182 ), rec( attr\ ibutes := rec( ), content := [ rec( content := "[i]", count := [ 7, 2, 5, 7 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 7 ] , math\ mode := "Text", name := "C", next := 290193, root := ~, start := 290183, stop \ := 290192 ), rec( content := " is the list of all vertices with colour\n \ ", count := [ 7, 2, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "i", count := [ 7, 2, 5, 7 ], \ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 7 ], math\ mode := "Text", name := "C", next := 290250, root := ~, start := 290242, stop \ := 290249 ), rec( content := ".\n ", count := [ 7, 2, 5, 7 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 7 ], name := "Ite\ m", next := 290265, root := ~, start := 290033, stop := 290264 ) ], count := [ 7, 2, 5, 4 ], mathmode := "Text", name := "List", next := 290277, root := ~, start := 289806, stop := 290276 ), rec( content := "\n\n \ The ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ utomorphism group", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "E", next := 290312, root := ~, start := 290287, stop := 290311 ), rec( content := " of a co\ loured digraph ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "A", next := 290349, root := ~, start := 290335, stop := 290348 ), rec( content := " with\n \ colouring ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ert_colours", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "A", next := 290388, root := ~, start := 290369, stop := 290387 ), rec( content := " is the \ group consisting of its automorphisms; an\n ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ utomorphism", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "E", next := 290461, root := ~, start := 290442, stop := 290460 ), rec( content := " of ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "A", next := 290479, root := ~, start := 290465, stop := 290478 ), rec( content := " is an i\ somorphism of coloured\n digraphs from ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "A", next := 290542, root := ~, start := 290528, stop := 290541 ), rec( content := " to itse\ lf. This group is equal to the\n subgroup of ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ utomorphismGroup(", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "di\ graph", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root :=\ ~ ) ], count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "A", next := 2906\ 33, root := ~, start := 290619, stop := 290632 ), rec( content := ")", count := [ 7, 2, 5, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "C", next := 290638, root := ~, start := 290598, stop := 290637 ), rec( content := " consist\ ing of those\n automorphisms that preserve the colouring specified by ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ert_colours", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "A", next := 290737, root := ~, start := 290718, stop := 290736 ), rec( content := ". See\n \ ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 2, 5, 9 ] , mathmode := "Text", name := "Ref", next := 290801, root := ~, start := 290747, stop := 290800 ), rec( content := ", and se\ e ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs and homogeneous lists", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "Ref", next := 290894, root := ~, start := 290811, stop := 290893 ), rec( content := "\n fo\ r more information about isomorphisms of coloured digraphs. ", count := [ 7, 2, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 5, 10 ], mathmode := "Text", name := "P", next := 290965, root := ~, start := 290961, stop := 290964 ), rec( content := "\n\n \ If ", count := [ 7, 2, 5, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 10 ], mathmode := "Text", name := "A", next := 290988, root := ~, start := 290974, stop := 290987 ), rec( content := " is not \ a multidigraph then the automorphism group is\n returned as a group of perm\ utations on the set of vertices of\n ", count := [ 7, 2, 5, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 10 ], mathmode := "Text", name := "A", next := 291126, root := ~, start := 291112, stop := 291125 ), rec( content := ". ", count := [ 7, 2, 5, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "P", next := 291132, root := ~, start := 291128, stop := 291131 ), rec( content := "\n\n \ If ", count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "A", next := 291155, root := ~, start := 291141, stop := 291154 ), rec( content := " is a mu\ ltidigraph then the automorphism group is returned\n as the direct product \ of a group of permutations on the set of vertices of\n ", count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "A", next := 291311, root := ~, start := 291297, stop := 291310 ), rec( content := " with a \ group of permutations on the set of edges of\n ", count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "A", next := 291382, root := ~, start := 291368, stop := 291381 ), rec( content := ". These \ groups can be accessed using ", count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Label := "for a domain and a positive integer", Oper := "Projection" ), content := 0, count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "Ref", next := 291508, root := ~, start := 291419, stop := 291507 ), rec( content := " on the\\ n returned group.", count := [ 7, 2, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "P", next := 291539, root := ~, start := 291535, stop := 291538 ), rec( content := "\n\n \ By default, the automorphism group is found using ", count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 5, 12 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 5, 12 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 12 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila\n and Petteri Kaski. If ", count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 7, 2, 5, 12 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 12 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 5, 12 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 7, 2\ , 5, 12 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 12 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " is avai\ lable, then ", count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 5, 12 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 5, 12 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 12 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by\n \ Brendan Mckay and Adolfo Piperno can be used instead; see\n ", count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "BlissAu\ tomorphismGroup", Label := "for a digraph and homogenous list" ), content := 0, count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "Ref", next := 291850, root := ~, start := 291766, stop := 291849 ), rec( content := ",\n " , count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "NautyAu\ tomorphismGroup" ), content := 0, count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "Ref", next := 291892, root := ~, start := 291856, stop := 291891 ), rec( content := ", ", count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseBliss" ), content := 0, count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "Ref", next := 291924, root := ~, start := 291894, stop := 291923 ), rec( content := ",\n a\ nd ", count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseNauty" ), content := 0, count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "Ref", next := 291964, root := ~, start := 291934, stop := 291963 ), rec( content := ".\n\n " , count := [ 7, 2, 5, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> cycle := CycleDigraph(9);\n\nga\ p> G := AutomorphismGroup(cycle);;\ngap> IsCyclic(G) and Size(G) = 9;\ntrue\ng\ ap> colours := [[1, 4, 7], [2, 5, 8], [3, 6, 9]];;\ngap> H := AutomorphismGrou\ p(cycle, colours);;\ngap> Size(H);\n3\ngap> H = AutomorphismGroup(cycle, [1, 2\ , 3, 1, 2, 3, 1, 2, 3]);\ntrue\ngap> H = SubgroupByProperty(G, p -> OnTuplesSe\ ts(colours, p) = colours);\ntrue\ngap> IsTrivial(AutomorphismGroup(cycle, [1, \ 1, 2, 2, 2, 2, 2, 2, 2]));\ntrue", count := [ 7, 2, 5, 13 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 13 ], mathmode := "Text", name := "Example", next := 292486, root := ~, start := 291969, stop := 292485 ), rec( content := "\n ", count := [ 7, 2, 5, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 5, 3 ], mathmode := "Text", name := "Description", next := 292503, root := ~, start := 289433, stop := 292502 ) ], count := [ 7, 2, 5, 1 ], mathmode := "Text", name := "ManSection", next := 292517, root := ~, start := 289264, stop := 292516 ), rec( content := "\n\n ", count := [ 7, 2, 5, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, vert_co\ lours, edge_colours", Label := "for a digraph, homogeneous list, and list", Name := "AutomorphismGro\ up" ), content := 0, count := [ 7, 2, 6, 2 ], mathmode := "Text", name := "Oper", next := 292670, root := ~, start := 292538, stop := 292669 ), rec( attributes := rec( ), content := [ rec( content := "A permuta\ tion group.", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "Returns", next := 292712, root := ~, start := 292673, stop := 292711 ), rec( attributes := rec( ), content := [ rec( content := "\n\n T\ his operation computes the automorphism group of a vertex- and/or\n edge-co\ loured digraph.\n A coloured digraph can be specified by its underlying dig\ raph\n ", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "A", next := 292912, root := ~, start := 292898, stop := 292911 ), rec( content := " and col\ ourings ", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ert_colours", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "A", next := 292947, root := ~, start := 292928, stop := 292946 ), rec( content := ", ", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge_colours", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "A", next := 292968, root := ~, start := 292949, stop := 292967 ), rec( content := ".\n L\ et ", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "C", next := 292986, root := ~, start := 292978, stop := 292985 ), rec( content := " be the \ number of vertices of ", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "A", next := 293030, root := ~, start := 293016, stop := 293029 ), rec( content := ". The co\ lourings\n must have the following forms:\n\n ", count := [ 7, 2, 6, 3 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 6, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "vert_colours", count := [ 7, 2, 6, 5 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 5 ], mathmode := \ "Text", name := "A", next := 293134, root := ~, start := 293115, stop := 29313\ 3 ), rec( content := " must be ", count := [ 7, 2, 6, 5 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "fail", count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "K", next :\ = 293154, root := ~, start := 293143, stop := 293153 ), rec( content := " or a\ list of ", count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "n", count :\ = [ 7, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :\ = [ 7, 2, 6, 5 ], mathmode := "Text", name := "C", next := 293176, root := ~, star\ t := 293168, stop := 293175 ), rec( content := " integers,\n where ", coun\ t := [ 7, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "vert_colours", count := [ 7, \ 2, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, \ 2, 6, 5 ], mathmode := "Text", name := "A", next := 293220, root := ~, start :\ = 293201, stop := 293219 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "[i]", count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "C", next :\ = 293230, root := ~, start := 293220, stop := 293229 ), rec( content := " is t\ he colour of vertex ", count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "P\ CDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := \ "i", count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ \ ) ], count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "C", next := 293263, root\ := ~, start := 293255, stop := 293262 ), rec( content := ",\n using th\ e colours ", count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "[1 .. m]", \ count := [ 7, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 2, 6, 5 ], mathmode := "Text", name := "C", next := 293306, root := \ ~, start := 293291, stop := 293305 ), rec( content := " for some ", count := [ \ 7, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := [ rec( content := "m <= n", count := [ 7, 2, 6, 5 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 5 ], math\ mode := "Text", name := "C", next := 293332, root := ~, start := 293316, stop \ := 293331 ), rec( content := ";\n ", count := [ 7, 2, 6, 5 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 5 ], name := "Ite\ m", next := 293347, root := ~, start := 293100, stop := 293346 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 6, 7 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "edge_colours", count := [ 7, 2, 6, 7 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 7 ], mathmode := \ "Text", name := "A", next := 293388, root := ~, start := 293369, stop := 29338\ 7 ), rec( content := " must be ", count := [ 7, 2, 6, 7 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "fail", count := [ 7, 2, 6, 7 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 7, 2, 6, 7 ], mathmode := "Text", name := "K", next :\ = 293408, root := ~, start := 293397, stop := 293407 ), rec( content := " or a\ list of ", count := [ 7, 2, 6, 7 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "n", count :\ = [ 7, 2, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :\ = [ 7, 2, 6, 7 ], mathmode := "Text", name := "C", next := 293430, root := ~, star\ t := 293422, stop := 293429 ), rec( content := " lists of\n integers of\ the same shape as ", count := [ 7, 2, 6, 7 ], mathmode := "Text", name := "PC\ DATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\ OutNeighbours(digraph)", count := [ 7, 2, 6, 7 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 7 ], mathmode := "Text", name := \ "C", next := 293507, root := ~, start := 293478, stop := 293506 ), rec( conten\ t := ", where\n ", count := [ 7, 2, 6, 7 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "edge_colours", count := [ 7, 2, 6, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 2, 6, 7 ], mathmode := "Text", name := "A", next\ := 293542, root := ~, start := 293523, stop := 293541 ), rec( attributes := re\ c( ), content := [ rec( content := "[i][j]", count := [ 7, 2, 6, 7 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 7 ], mathmod\ e := "Text", name := "C", next := 293555, root := ~, start := 293542, stop := \ 293554 ), rec( content := " is the colour of the edge\n ", count := [ 7\ , 2, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribute\ s := rec( ), content := [ rec( content := "OutNeighbours(digraph)[i][j]", cou\ nt := [ 7, 2, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 2, 6, 7 ], mathmode := "Text", name := "C", next := 293625, root := \ ~, start := 293590, stop := 293624 ), rec( content := ", using the colours ", coun\ t := [ 7, 2, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "[1 .. k]", count := [ 7, 2, 6\ , 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6\ , 7 ], mathmode := "Text", name := "C", next := 293660, root := ~, start := 29\ 3645, stop := 293659 ), rec( content := "\n for some ", count := [ 7, 2\ , 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "k <= n", count := [ 7, 2, 6, 7 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 7 ], math\ mode := "Text", name := "C", next := 293694, root := ~, start := 293678, stop \ := 293693 ), rec( content := ";\n ", count := [ 7, 2, 6, 7 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 7 ], name := "Ite\ m", next := 293709, root := ~, start := 293354, stop := 293708 ) ], count := [ 7, 2, 6, 4 ], mathmode := "Text", name := "List", next := 293721, root := ~, start := 293087, stop := 293720 ), rec( content := "\n\n \ Giving ", count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ert_colours", count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "A", next := 293753, root := ~, start := 293734, stop := 293752 ), rec( content := " [", count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ dge_colours", count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "A", next := 293774, root := ~, start := 293755, stop := 293773 ), rec( content := "] as ", count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "C", next := 293790, root := ~, start := 293779, stop := 293789 ), rec( content := " is\n \ equivalent to setting all vertices [edges] to be the same colour. ", count := [ 7, 2, 6, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "P", next := 293868, root := ~, start := 293864, stop := 293867 ), rec( content := "\n\n \ Unlike ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "Ref", next := 293934, root := ~, start := 293881, stop := 293933 ), rec( content := ", it is\\ n possible to obtain the automorphism group of an edge-coloured multidigrap\ h\n (see ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMulti\ Digraph" ), content := 0, count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "Ref", next := 294059, root := ~, start := 294030, stop := 294058 ), rec( content := ") when n\ o two edges share the same\n source, range, and colour.\n\n The ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ utomorphism group", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "E", next := 294159, root := ~, start := 294134, stop := 294158 ), rec( content := " of a ve\ rtex/edge-coloured digraph\n ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "A", next := 294212, root := ~, start := 294198, stop := 294211 ), rec( content := " with co\ louring ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "A", next := 294236, root := ~, start := 294228, stop := 294235 ), rec( content := " is the \ group consisting of its\n vertex/edge-colour preserving automorphisms; an\n\ ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ utomorphism", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "E", next := 294343, root := ~, start := 294324, stop := 294342 ), rec( content := " of ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "A", next := 294361, root := ~, start := 294347, stop := 294360 ), rec( content := " is an i\ somorphism of vertex/edge-coloured\n digraphs from ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "A", next := 294436, root := ~, start := 294422, stop := 294435 ), rec( content := " to itse\ lf. This group is equal to the\n subgroup of ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ utomorphismGroup(", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "A", next := 2945\ 27, root := ~, start := 294513, stop := 294526 ), rec( content := ")", count := [ 7, 2, 6, 10 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "C", next := 294532, root := ~, start := 294492, stop := 294531 ), rec( content := " consist\ ing of those\n automorphisms that preserve the colouring specified by ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "A", next := 294626, root := ~, start := 294612, stop := 294625 ), rec( content := ". See\n \ ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "Ref", next := 294690, root := ~, start := 294636, stop := 294689 ), rec( content := ", and se\ e ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs and homogeneous lists", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "Ref", next := 294783, root := ~, start := 294700, stop := 294782 ), rec( content := "\n fo\ r more information about isomorphisms of coloured digraphs. ", count := [ 7, 2, 6, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 6, 11 ], mathmode := "Text", name := "P", next := 294854, root := ~, start := 294850, stop := 294853 ), rec( content := "\n\n \ If ", count := [ 7, 2, 6, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 11 ], mathmode := "Text", name := "A", next := 294877, root := ~, start := 294863, stop := 294876 ), rec( content := " is not \ a multidigraph then the automorphism group is\n returned as a group of perm\ utations on the set of vertices of\n ", count := [ 7, 2, 6, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 11 ], mathmode := "Text", name := "A", next := 295015, root := ~, start := 295001, stop := 295014 ), rec( content := ". ", count := [ 7, 2, 6, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "P", next := 295021, root := ~, start := 295017, stop := 295020 ), rec( content := "\n\n \ If ", count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "A", next := 295044, root := ~, start := 295030, stop := 295043 ), rec( content := " is a mu\ ltidigraph then the automorphism group is returned\n as the direct product \ of a group of permutations on the set of vertices of\n ", count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "A", next := 295200, root := ~, start := 295186, stop := 295199 ), rec( content := " with a \ group of permutations on the set of edges of\n ", count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "A", next := 295271, root := ~, start := 295257, stop := 295270 ), rec( content := ". These \ groups can be accessed using ", count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Label := "for a domain and a positive integer", Oper := "Projection" ), content := 0, count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "Ref", next := 295397, root := ~, start := 295308, stop := 295396 ), rec( content := " on the\\ n returned group.", count := [ 7, 2, 6, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "P", next := 295428, root := ~, start := 295424, stop := 295427 ), rec( content := "\n\n \ By default, the automorphism group is found using ", count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 6, 13 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 6, 13 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 13 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila\n and Petteri Kaski. If ", count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 7, 2, 6, 13 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 13 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 6, 13 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 7, 2\ , 6, 13 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 13 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " is avai\ lable, then ", count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 6, 13 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 6, 13 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 13 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by\n \ Brendan Mckay and Adolfo Piperno can be used instead; see\n ", count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "BlissAu\ tomorphismGroup", Label := "for a digraph, homogenous list, and list" ), content := 0, count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "Ref", next := 295748, root := ~, start := 295656, stop := 295747 ), rec( content := ",\n \ ", count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( Attr := "NautyAu\ tomorphismGroup" ), content := 0, count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "Ref", next := 295791, root := ~, start := 295755, stop := 295790 ), rec( content := ", ", count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseBliss" ), content := 0, count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "Ref", next := 295823, root := ~, start := 295793, stop := 295822 ), rec( content := ", and\n \ ", count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseNauty" ), content := 0, count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "Ref", next := 295864, root := ~, start := 295834, stop := 295863 ), rec( content := ".\n\n " , count := [ 7, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> cycle := CycleDigraph(12);\n\n\ gap> vert_colours := List([1 .. 12], x -> x mod 3 + 1);;\ngap> edge_colours :=\ List([1 .. 12], x -> [x mod 2 + 1]);;\ngap> Size(AutomorphismGroup(cycle));\n\ 12\ngap> Size(AutomorphismGroup(cycle, vert_colours));\n4\ngap> Size(Automorph\ ismGroup(cycle, fail, edge_colours));\n6\ngap> Size(AutomorphismGroup(cycle, v\ ert_colours, edge_colours));\n2\ngap> IsTrivial(AutomorphismGroup(cycle,\n> ve\ rt_colours, List([1 .. 12], x -> [x mod 4 + 1])));\ntrue\n", count := [ 7, 2, 6, 14 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 6, 14 ], mathmode := "Text", name := "Example", next := 296411, root := ~, start := 295869, stop := 296410 ), rec( content := "\n ", count := [ 7, 2, 6, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 6, 3 ], mathmode := "Text", name := "Description", next := 296428, root := ~, start := 292715, stop := 296427 ) ], count := [ 7, 2, 6, 1 ], mathmode := "Text", name := "ManSection", next := 296442, root := ~, start := 292523, stop := 296441 ), rec( content := "\n\n ", count := [ 7, 2, 6, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Label := "for a digraph" , Name := "BlissCanonicalL\ abelling" ), content := 0, count := [ 7, 2, 7, 2 ], mathmode := "Text", name := "Attr", next := 296537, root := ~, start := 296463, stop := 296536 ), rec( attributes := rec( Arg := "digraph", Label := "for a digraph" , Name := "NautyCanonicalL\ abelling" ), content := 0, count := [ 7, 2, 7, 4 ], mathmode := "Text", name := "Attr", next := 296614, root := ~, start := 296540, stop := 296613 ), rec( attributes := rec( ), content := [ rec( content := "A permuta\ tion, or a list of two permutations.", count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "Returns", next := 296681, root := ~, start := 296617, stop := 296680 ), rec( attributes := rec( ), content := [ rec( content := "\n A f\ unction ", count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ \rho", count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "M", next := 296724, root := ~, start := 296713, stop := 296723 ), rec( content := " that ma\ ps a digraph to a digraph is a ", count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ anonical\n representative map", count := [ 7, 2, 7, 5 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "E", next := 296804, root := ~, start := 296763, stop := 296803 ), rec( content := " if the \ following two conditions hold for all\n digraphs ", count := [ 7, 2, 7, 5 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "M", next := 296871, root := ~, start := 296863, stop := 296870 ), rec( content := " and ", count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ ", count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "M", next := 296884, root := ~, start := 296876, stop := 296883 ), rec( content := ": ", count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 7, 6 ], mathmode := "Text", name := "P", next := 296890, root := ~, start := 296886, stop := 296889 ), rec( content := "\n\n \ ", count := [ 7, 2, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 7, 8 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "\\rho(G)", count := [ 7, 2, 7, 8 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 8 ], mathmode := "Tex\ t", name := "M", next := 296938, root := ~, start := 296924, stop := 296937 ), rec( cont\ ent := " and ", count := [ 7, 2, 7, 8 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "G", count :\ = [ 7, 2, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :\ = [ 7, 2, 7, 8 ], mathmode := "Text", name := "M", next := 296951, root := ~, star\ t := 296943, stop := 296950 ), rec( content := " are isomorphic as digraphs; a\ nd\n ", count := [ 7, 2, 7, 8 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 7, 8 ], name := "Item", next := 296997, root := ~, start := 296\ 909, stop := 296996 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n ", count := [ 7, 2, 7, 10 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\rho(G)=\\\ rho(H)", count := [ 7, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 7, 10 ], mathmode := "Text", name := "M", next := 2\ 97041, root := ~, start := 297019, stop := 297040 ), rec( content := " if and \ only if ", count := [ 7, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "G", count :\ = [ 7, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count \ := [ 7, 2, 7, 10 ], mathmode := "Text", name := "M", next := 297065, root := ~ , star\ t := 297057, stop := 297064 ), rec( content := " and ", count := [ 7, 2, 7, 10\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ ), content := [ rec( content := "H", count := [ 7, 2, 7, 10 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 10 ], mathmode := \ "Text", name := "M", next := 297078, root := ~, start := 297070, stop := 29707\ 7 ), rec( content := " are\n isomorphic as digraphs.\n ", count :=\ [ 7, 2, 7, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 10 ], name := "Ite\ m", next := 297128, root := ~, start := 297004, stop := 297127 ) ], count := [ 7, 2, 7, 7 ], mathmode := "Text", name := "List", next := 297140, root := ~, start := 296896, stop := 297139 ), rec( content := "\n\n \ A ", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ anonical labelling", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "E", next := 297174, root := ~, start := 297148, stop := 297173 ), rec( content := " of a di\ graph ", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "M", next := 297196, root := ~, start := 297188, stop := 297195 ), rec( content := " (under \ ", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ \rho", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "M", next := 297215, root := ~, start := 297204, stop := 297214 ), rec( content := ") is an\\ n isomorphism of ", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "M", next := 297250, root := ~, start := 297242, stop := 297249 ), rec( content := " onto it\ s ", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ anonical representative", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "E", next := 297291, root := ~, start := 297260, stop := 297290 ), rec( content := ",\n " , count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ \rho(G)", count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "M", next := 297311, root := ~, start := 297297, stop := 297310 ), rec( content := ". See " , count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 7, 12 ], mathmode := "Text", name := "Ref", next := 297373, root := ~, start := 297318, stop := 297372 ), rec( content := "\n fo\ r more information about isomorphisms of digraphs. ", count := [ 7, 2, 7, 12 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "P", next := 297435, root := ~, start := 297431, stop := 297434 ), rec( content := "\n\n \ ", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "B\ lissCanonicalLabelling", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "C", next := 297471, root := ~, start := 297441, stop := 297470 ), rec( content := " returns\ a canonical labelling of the digraph\n ", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "A", next := 297535, root := ~, start := 297521, stop := 297534 ), rec( content := " found u\ sing ", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 7, 13 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 7, 13 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 13 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila and Petteri Kaski.\n ", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "N\ autyCanonicalLabelling", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "C", next := 297627, root := ~, start := 297597, stop := 297626 ), rec( content := " returns\ a canonical labelling of the digraph\n ", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "A", next := 297691, root := ~, start := 297677, stop := 297690 ), rec( content := " found u\ sing ", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 7, 13 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 7, 13 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 13 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by Bren\ dan McKay and Adolfo Piperno.\n Note that the canonical labellings returned\ by ", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 7, 13 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 7, 13 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 13 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " and ", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 7, 13 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 7, 13 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 13 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " are not\ \n usually the same (and may depend of the version used).", count := [ 7, 2, 7, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "P", next := 297890, root := ~, start := 297886, stop := 297889 ), rec( content := "\n\n \ ", count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "B\ lissCanonicalLabelling", count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "C", next := 297926, root := ~, start := 297896, stop := 297925 ), rec( content := " can onl\ y be computed if ", count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "A", next := 297965, root := ~, start := 297951, stop := 297964 ), rec( content := " has\n \ no multiple edges; see ", count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMulti\ Digraph" ), content := 0, count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "Ref", next := 298026, root := ~, start := 297997, stop := 298025 ), rec( content := ". ", count := [ 7, 2, 7, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 7, 15 ], mathmode := "Text", name := "P", next := 298032, root := ~, start := 298028, stop := 298031 ), rec( content := "\n\n \ ", count := [ 7, 2, 7, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph1 := DigraphFromDiSparse6String(\".ImNS_AiB?qRN\");\n\ngap> BlissCanonicalLabelling(digraph1);\n(1\ ,9,5,7)(3,6,4,10)\ngap> p := (1, 2, 7, 5)(3, 9)(6, 10, 8);;\ngap> digraph2 := \ OnDigraphs(digraph1, p);\n\ngap> \ digraph1 = digraph2;\nfalse\ngap> OnDigraphs(digraph1, BlissCanonicalLabelling\ (digraph1)) =\n> OnDigraphs(digraph2, BlissCanonicalLabelling(digraph2));\n\ true", count := [ 7, 2, 7, 16 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 16 ], mathmode := "Text", name := "Example", next := 298528, root := ~, start := 298038, stop := 298527 ), rec( content := "\n ", count := [ 7, 2, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 7, 5 ], mathmode := "Text", name := "Description", next := 298545, root := ~, start := 296684, stop := 298544 ) ], count := [ 7, 2, 7, 1 ], mathmode := "Text", name := "ManSection", next := 298559, root := ~, start := 296448, stop := 298558 ), rec( content := "\n\n ", count := [ 7, 2, 7, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, colours\ ", Label := "for a digraph and a list", Name := "BlissCanonicalLabelling" ), content := 0, count := [ 7, 2, 8, 2 ], mathmode := "Text", name := "Oper", next := 298678, root := ~, start := 298580, stop := 298677 ), rec( attributes := rec( Arg := "digraph, colours\ ", Label := "for a digraph and a list", Name := "NautyCanonicalLabelling" ), content := 0, count := [ 7, 2, 8, 4 ], mathmode := "Text", name := "Oper", next := 298779, root := ~, start := 298681, stop := 298778 ), rec( attributes := rec( ), content := [ rec( content := "A permuta\ tion.", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "Returns", next := 298815, root := ~, start := 298782, stop := 298814 ), rec( attributes := rec( ), content := [ rec( content := "\n A f\ unction ", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ \rho", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "M", next := 298858, root := ~, start := 298847, stop := 298857 ), rec( content := " that ma\ ps a coloured digraph to a coloured digraph is\n a ", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ anonical representative map", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "E", next := 298954, root := ~, start := 298919, stop := 298953 ), rec( content := " if the \ following two conditions hold\n for all coloured digraphs ", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "M", next := 299030, root := ~, start := 299022, stop := 299029 ), rec( content := " and ", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ ", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "M", next := 299043, root := ~, start := 299035, stop := 299042 ), rec( content := ":\n\n \ ", count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 8, 7 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "\\rho(G)", count := [ 7, 2, 8, 7 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 7 ], mathmode := "Tex\ t", name := "M", next := 299092, root := ~, start := 299078, stop := 299091 ), rec( cont\ ent := " and ", count := [ 7, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "G", count :\ = [ 7, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :\ = [ 7, 2, 8, 7 ], mathmode := "Text", name := "M", next := 299105, root := ~, star\ t := 299097, stop := 299104 ), rec( content := " are isomorphic as coloured di\ graphs; and\n ", count := [ 7, 2, 8, 7 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ 7, 2, 8, 7 ], name := "Item", next := 299160, root := ~, start := 299\ 063, stop := 299159 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n ", count := [ 7, 2, 8, 9 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\rho(G)=\\\ rho(H)", count := [ 7, 2, 8, 9 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ) ], count := [ 7, 2, 8, 9 ], mathmode := "Text", name := "M", next := 299\ 204, root := ~, start := 299182, stop := 299203 ), rec( content := " if and on\ ly if ", count := [ 7, 2, 8, 9 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ), rec( attributes := rec( ), content := [ rec( content := "G", count := \ [ 7, 2, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ \ 7, 2, 8, 9 ], mathmode := "Text", name := "M", next := 299228, root := ~, star\ t := 299220, stop := 299227 ), rec( content := " and ", count := [ 7, 2, 8, 9 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "H", count := [ 7, 2, 8, 9 ], mathmode := "Text", nam\ e := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 9 ], mathmode := "Text", name\ := "M", next := 299241, root := ~, start := 299233, stop := 299240 ), rec( cont\ ent := " are\n isomorphic as coloured digraphs.\n ", count := [ 7,\ 2, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 9 ], name := "Ite\ m", next := 299300, root := ~, start := 299167, stop := 299299 ) ], count := [ 7, 2, 8, 6 ], mathmode := "Text", name := "List", next := 299312, root := ~, start := 299050, stop := 299311 ), rec( content := "\n\n \ A ", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ anonical labelling", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "E", next := 299346, root := ~, start := 299320, stop := 299345 ), rec( content := " of a co\ loured digraph ", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "M", next := 299377, root := ~, start := 299369, stop := 299376 ), rec( content := " (under\\ n ", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ \rho", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "M", next := 299400, root := ~, start := 299389, stop := 299399 ), rec( content := ") is an \ isomorphism of ", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "M", next := 299431, root := ~, start := 299423, stop := 299430 ), rec( content := " onto it\ s ", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ anonical\n representative", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "E", next := 299478, root := ~, start := 299441, stop := 299477 ), rec( content := ", ", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ \rho(G)", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "M", next := 299494, root := ~, start := 299480, stop := 299493 ), rec( content := ". See " , count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs and homogeneous lists", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "Ref", next := 299584, root := ~, start := 299501, stop := 299583 ), rec( content := " for mor\ e information about\n isomorphisms of coloured digraphs. ", count := [ 7, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "P", next := 299655, root := ~, start := 299651, stop := 299654 ), rec( content := "\n\n \ A coloured digraph can be specified by its underlying digraph ", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "A", next := 299737, root := ~, start := 299723, stop := 299736 ), rec( content := "\n an\ d its colouring ", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "A", next := 299774, root := ~, start := 299760, stop := 299773 ), rec( content := ". Let " , count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "C", next := 299789, root := ~, start := 299781, stop := 299788 ), rec( content := " be the \ number of vertices of\n ", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "A", next := 299837, root := ~, start := 299823, stop := 299836 ), rec( content := ". The co\ louring ", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "A", next := 299867, root := ~, start := 299853, stop := 299866 ), rec( content := " may hav\ e one of the following\n two forms: ", count := [ 7, 2, 8, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 8, 13 ], mathmode := "Text", name := "P", next := 299917, root := ~, start := 299913, stop := 299916 ), rec( content := "\n\n \ ", count := [ 7, 2, 8, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n a list of ", count := [ 7, 2\ , 8, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes \ := rec( ), content := [ rec( content := "n", count := [ 7, 2, 8, 15 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 15 ], mathm\ ode := "Text", name := "C", next := 299969, root := ~, start := 299961, stop :\ = 299968 ), rec( content := " integers, where ", count := [ 7, 2, 8, 15 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "colours", count := [ 7, 2, 8, 15 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 15 ], mathmode := "Te\ xt", name := "A", next := 300000, root := ~, start := 299986, stop := 299999 ) , rec( attr\ ibutes := rec( ), content := [ rec( content := "[i]", count := [ 7, 2, 8, 15 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 15\ ], mathmode := "Text", name := "C", next := 300010, root := ~, start := 30000\ 0, stop := 300009 ), rec( content := " is the\n colour of vertex ", coun\ t := [ 7, 2, 8, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "i", count := [ 7, 2, 8, 15 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 15 ] , math\ mode := "Text", name := "C", next := 300051, root := ~, start := 300043, stop \ := 300050 ), rec( content := ", using the colours ", count := [ 7, 2, 8, 15 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "[1 .. m]", count := [ 7, 2, 8, 15 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 15 ], mathmode := "T\ ext", name := "C", next := 300086, root := ~, start := 300071, stop := 300085 ), rec( cont\ ent := " for some\n ", count := [ 7, 2, 8, 15 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "m <= n", count := [ 7, 2, 8, 15 ], mathmode := "Text", name := "PCDATA"\ , root := ~ ) ], count := [ 7, 2, 8, 15 ], mathmode := "Text", name := "C", next\ := 300120, root := ~, start := 300104, stop := 300119 ), rec( content := "; o\ r\n ", count := [ 7, 2, 8, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 8, 15 ], name := "Item", next := 300138, root := ~, start := 299\ 936, stop := 300137 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n a list of non-empty disjoint lists whose union is\n ", coun\ t := [ 7, 2, 8, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "DigraphVertices(", count := [\ 7, 2, 8, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attrib\ utes := rec( ), content := [ rec( content := "digraph", count := [ 7, 2, 8, 1\ 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, \ 17 ], mathmode := "Text", name := "A", next := 300251, root := ~, start := 300\ 237, stop := 300250 ), rec( content := ")", count := [ 7, 2, 8, 17 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 17 ], mathmod\ e := "Text", name := "C", next := 300256, root := ~, start := 300218, stop := \ 300255 ), rec( content := ", such that\n ", count := [ 7, 2, 8, 17 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "colours", count := [ 7, 2, 8, 17 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 17 ], mathmode := "Te\ xt", name := "A", next := 300290, root := ~, start := 300276, stop := 300289 ) , rec( attr\ ibutes := rec( ), content := [ rec( content := "[i]", count := [ 7, 2, 8, 17 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 17\ ], mathmode := "Text", name := "C", next := 300300, root := ~, start := 30029\ 0, stop := 300299 ), rec( content := " is the list of all vertices with colour\ \n ", count := [ 7, 2, 8, 17 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "i", count :\ = [ 7, 2, 8, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count \ := [ 7, 2, 8, 17 ], mathmode := "Text", name := "C", next := 300357, root := ~ , star\ t := 300349, stop := 300356 ), rec( content := ".\n ", count := [ 7, 2, 8\ , 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 17 ], name := "Ite\ m", next := 300372, root := ~, start := 300145, stop := 300371 ) ], count := [ 7, 2, 8, 14 ], mathmode := "Text", name := "List", next := 300384, root := ~, start := 299923, stop := 300383 ), rec( content := "\n\n \ If ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "A", next := 300407, root := ~, start := 300393, stop := 300406 ), rec( content := " and ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "A", next := 300426, root := ~, start := 300412, stop := 300425 ), rec( content := " togethe\ r form a coloured digraph,\n ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ lissCanonicalLabelling", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "C", next := 300495, root := ~, start := 300465, stop := 300494 ), rec( content := " returns\ a canonical labelling of the digraph\n ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "A", next := 300559, root := ~, start := 300545, stop := 300558 ), rec( content := " found u\ sing ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 8, 19 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 8, 19 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila and Petteri Kaski.\n Similarly, ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "N\ autyCanonicalLabelling", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "C", next := 300662, root := ~, start := 300632, stop := 300661 ), rec( content := " returns\ a canonical labelling of\n the digraph ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "A", next := 300726, root := ~, start := 300712, stop := 300725 ), rec( content := " found u\ sing ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 8, 19 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 8, 19 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by Bren\ dan McKay and Adolfo\n Piperno. Note that the canonical labellings returne\ d by ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 8, 19 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 8, 19 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " and\n \ ", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 8, 19 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 8, 19 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 19 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " are not\ usually the same (and may depend of the version used).", count := [ 7, 2, 8, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "P", next := 300926, root := ~, start := 300922, stop := 300925 ), rec( content := "\n\n \ ", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "B\ lissCanonicalLabelling", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "C", next := 300962, root := ~, start := 300932, stop := 300961 ), rec( content := " can onl\ y be computed if ", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "A", next := 301001, root := ~, start := 300987, stop := 301000 ), rec( content := " has\n \ no multiple edges; see ", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMulti\ Digraph" ), content := 0, count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "Ref", next := 301062, root := ~, start := 301033, stop := 301061 ), rec( content := ". The ca\ nonical\n labelling of ", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "A", next := 301109, root := ~, start := 301095, stop := 301108 ), rec( content := " is give\ n as a permutation of its vertices.\n The canonical representative of ", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "A", next := 301203, root := ~, start := 301189, stop := 301202 ), rec( content := " can be \ created from\n ", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "A", next := 301242, root := ~, start := 301228, stop := 301241 ), rec( content := " and its\ canonical labelling ", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "C", next := 301279, root := ~, start := 301271, stop := 301278 ), rec( content := " by usin\ g the\n operation ", count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and a perm", Oper := "OnDigraphs" ), content := 0, count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "Ref", next := 301365, root := ~, start := 301307, stop := 301364 ), rec( content := ":\n " , count := [ 7, 2, 8, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ap> OnDigraphs(digraph, p);", count := [ 7, 2, 8, 21 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 21 ], mathmode := "Text", name := "Log", next := 301410, root := ~, start := 301371, stop := 301409 ), rec( content := "\n\n \ The colouring of the canonical representative can easily be\n constructed. \ A vertex ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "C", next := 301510, root := ~, start := 301502, stop := 301509 ), rec( content := " (in ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "A", next := 301529, root := ~, start := 301515, stop := 301528 ), rec( content := ") has co\ lour ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "C", next := 301550, root := ~, start := 301542, stop := 301549 ), rec( content := " if\n \ and only if the vertex ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ^ p", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "C", next := 301593, root := ~, start := 301581, stop := 301592 ), rec( content := " (in the\ canonical representative) has\n colour ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "C", next := 301651, root := ~, start := 301643, stop := 301650 ), rec( content := ", where \ ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "C", next := 301667, root := ~, start := 301659, stop := 301666 ), rec( content := " is the \ permutation of the canonical\n labelling that acts on the vertices of ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "A", next := 301761, root := ~, start := 301747, stop := 301760 ), rec( content := ". In par\ ticular, if\n ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "A", next := 301799, root := ~, start := 301785, stop := 301798 ), rec( content := " has the\ first form that is described above, then the\n colouring of the canonical \ representative is given by:\n\n ", count := [ 7, 2, 8, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ap> List(DigraphVertices(digraph), i -> colours[i / p]);", count := [ 7, 2, 8, 23 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 8, 23 ], mathmode := "Text", name := "Log", next := 301985, root := ~, start := 301917, stop := 301984 ), rec( content := "\n\n \ On the other hand, if ", count := [ 7, 2, 8, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours", count := [ 7, 2, 8, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 24 ], mathmode := "Text", name := "A", next := 302027, root := ~, start := 302013, stop := 302026 ), rec( content := " has the\ second form above, then the\n canonical representative has colouring:\n\n \ ", count := [ 7, 2, 8, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ap> OnTuplesSets(colours, p);", count := [ 7, 2, 8, 25 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 25 ], mathmode := "Text", name := "Log", next := 302154, root := ~, start := 302113, stop := 302153 ), rec( content := "\n\n \ ", count := [ 7, 2, 8, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := 0, count := [ 7, 2, 8, 27 ], mathmode := "Text", name := "P", next := 302164, root := ~, start := 302160, stop := 302163 ), rec( content := "\n\n \ ", count := [ 7, 2, 8, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph := DigraphFromDiSparse6String(\".ImNS_AiB?qRN\");\n\ngap> colours := [[1, 2, 8, 9, 10], [3, 4, 5,\ 6, 7]];;\ngap> p := BlissCanonicalLabelling(digraph, colours);\n(1,5,8,4,10,3\ ,9)(6,7)\ngap> OnDigraphs(digraph, p);\n\ngap> OnTuplesSets(colours, p);\n[ [ 1, 2, 3, 4, 5 ], [ 6, 7, 8, 9, 10\ ] ]\ngap> colours := [1, 1, 1, 1, 2, 3, 1, 3, 2, 1];;\ngap> p := BlissCanonic\ alLabelling(digraph, colours);\n(1,6,9,7)(3,4,5,8,10)\ngap> OnDigraphs(digraph\ , p);\n\ngap> List(DigraphVertice\ s(digraph), i -> colours[i / p]);\n[ 1, 1, 1, 1, 1, 1, 2, 2, 3, 3 ]", count := [ 7, 2, 8, 28 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 8, 28 ], mathmode := "Text", name := "Example", next := 302875, root := ~, start := 302170, stop := 302874 ), rec( content := "\n ", count := [ 7, 2, 8, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 8, 5 ], mathmode := "Text", name := "Description", next := 302892, root := ~, start := 298818, stop := 302891 ) ], count := [ 7, 2, 8, 1 ], mathmode := "Text", name := "ManSection", next := 302906, root := ~, start := 298565, stop := 302905 ), rec( content := "\n\n ", count := [ 7, 2, 8, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "BlissCanonicalD\ igraph" ), content := 0, count := [ 7, 2, 9, 2 ], mathmode := "Text", name := "Attr", next := 302977, root := ~, start := 302927, stop := 302976 ), rec( attributes := rec( Arg := "digraph", Name := "NautyCanonicalD\ igraph" ), content := 0, count := [ 7, 2, 9, 4 ], mathmode := "Text", name := "Attr", next := 303030, root := ~, start := 302980, stop := 303029 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 7, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 9, 5 ], mathmode := "Text", name := "Returns", next := 303062, root := ~, start := 303033, stop := 303061 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ attribute ", count := [ 7, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ lissCanonicalLabelling", count := [ 7, 2, 9, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 9, 5 ], mathmode := "Text", name := "C", next := 303127, root := ~, start := 303097, stop := 303126 ), rec( content := " returns\ the canonical\n representative found by applying ", count := [ 7, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "BlissCa\ nonicalLabelling", Label := "for a digraph" ), content := 0, count := [ 7, 2, 9, 5 ], mathmode := "Text", name := "Ref", next := 303252, root := ~, start := 303187, stop := 303251 ), rec( content := ". The di\ graph returned is canonical in the sense\n that\n\n ", count := [ 7, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 9, 7 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "BlissCanonicalDigraph(", count := [ 7, 2, 9, 7 ], ma\ thmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), c\ ontent := [ rec( content := "digraph", count := [ 7, 2, 9, 7 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 9, 7 ], mathmode := "T\ ext", name := "A", next := 303382, root := ~, start := 303368, stop := 303381 \ ), rec( content := ")", count := [ 7, 2, 9, 7 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ 7, 2, 9, 7 ], mathmode := "Text", name := "\ C", next := 303387, root := ~, start := 303343, stop := 303386 ), rec( content\ := " and ", count := [ 7, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", c\ ount := [ 7, 2, 9, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 2, 9, 7 ], mathmode := "Text", name := "A", next := 303406, root := \ ~, start := 303392, stop := 303405 ), rec( content := " are\n isomorphi\ c as digraphs; and\n ", count := [ 7, 2, 9, 7 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 9, 7 ], name := "Item", next := 3034\ 60, root := ~, start := 303328, stop := 303459 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n If ", count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :=\ "gr", count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root := \ ~ ) ], count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "C", next := 30349\ 4, root := ~, start := 303485, stop := 303493 ), rec( content := " is any digr\ aph then ", count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "BlissCanoni\ calDigraph(gr)", count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "PCDATA"\ , root := ~ ) ], count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "C", next\ := 303547, root := ~, start := 303515, stop := 303546 ), rec( content := "\n \ and ", count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "BlissCanoni\ calDigraph(", count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph"\ , count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ]\ , count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "A", next := 303599, ro\ ot := ~, start := 303585, stop := 303598 ), rec( content := ")", count := [ 7,\ 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7,\ 2, 9, 9 ], mathmode := "Text", name := "C", next := 303604, root := ~, start \ := 303560, stop := 303603 ), rec( content := " are equal if and only\n \ if ", count := [ 7, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~\ ), rec( attributes := rec( ), content := [ rec( content := "gr", count := [ \ 7, 2, 9, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ \ 7, 2, 9, 9 ], mathmode := "Text", name := "C", next := 303647, root := ~, star\ t := 303638, stop := 303646 ), rec( content := " and ", count := [ 7, 2, 9, 9 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "digraph", count := [ 7, 2, 9, 9 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 9, 9 ], mathmode := "Text\ ", name := "A", next := 303666, root := ~, start := 303652, stop := 303665 ), rec( cont\ ent := " are isomorphic as digraphs.\n ", count := [ 7, 2, 9, 9 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 9, 9 ], name := "Ite\ m", next := 303708, root := ~, start := 303467, stop := 303707 ) ], count := [ 7, 2, 9, 6 ], mathmode := "Text", name := "List", next := 303720, root := ~, start := 303315, stop := 303719 ), rec( content := "\n\n \ Analogously, the attribute ", count := [ 7, 2, 9, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "N\ autyCanonicalLabelling", count := [ 7, 2, 9, 11 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 9, 11 ], mathmode := "Text", name := "C", next := 303783, root := ~, start := 303753, stop := 303782 ), rec( content := " returns\ the\n canonical representative found by applying ", count := [ 7, 2, 9, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "NautyCa\ nonicalLabelling", Label := "for a digraph" ), content := 0, count := [ 7, 2, 9, 11 ], mathmode := "Text", name := "Ref", next := 303908, root := ~, start := 303843, stop := 303907 ), rec( content := ".\n " , count := [ 7, 2, 9, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 9, 12 ], mathmode := "Text", name := "P", next := 303918, root := ~, start := 303914, stop := 303917 ), rec( content := "\n\n \ If the argument ", count := [ 7, 2, 9, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 9, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 9, 12 ], mathmode := "Text", name := "A", next := 303954, root := ~, start := 303940, stop := 303953 ), rec( content := " is muta\ ble, then the return value of\n this attribute is recomputed every time it \ is called. \n\n ", count := [ 7, 2, 9, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph := Digraph([[1], [2, 3], [3], [1, 2, 3]]);\n\ngap> canon := BlissCanonicalDigraph(digraph);\n\ngap> OutNeighbours(canon);\n[ [ 1 ], \ [ 2 ], [ 3, 2 ], [ 1, 3, 2 ] ]\n", count := [ 7, 2, 9, 13 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 9, 13 ], mathmode := "Text", name := "Example", next := 304347, root := ~, start := 304056, stop := 304346 ), rec( content := "\n ", count := [ 7, 2, 9, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 9, 5 ], mathmode := "Text", name := "Description", next := 304364, root := ~, start := 303065, stop := 304363 ) ], count := [ 7, 2, 9, 1 ], mathmode := "Text", name := "ManSection", next := 304378, root := ~, start := 302912, stop := 304377 ), rec( content := "\n\n ", count := [ 7, 2, 9, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphGroup" ) , content := 0, count := [ 7, 2, 10, 2 ], mathmode := "Text", name := "Attr", next := 304440, root := ~, start := 304399, stop := 304439 ), rec( attributes := rec( ), content := [ rec( content := "A permuta\ tion group.", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "Returns", next := 304482, root := ~, start := 304443, stop := 304481 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "A", next := 304520, root := ~, start := 304506, stop := 304519 ), rec( content := " is immu\ table and was created knowing a subgroup of\n its automorphism group, then \ this group is stored in the attribute\n ", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphGroup", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "C", next := 304666, root := ~, start := 304647, stop := 304665 ), rec( content := ". If ", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "A", next := 304685, root := ~, start := 304671, stop := 304684 ), rec( content := " is muta\ ble, or was not created\n knowing a subgroup of its automorphism group, the\ n ", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphGroup", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "C", next := 304791, root := ~, start := 304772, stop := 304790 ), rec( content := "\n re\ turns the entire automorphism group of ", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "A", next := 304851, root := ~, start := 304837, stop := 304850 ), rec( content := ". \n \ Note that if ", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "A", next := 304888, root := ~, start := 304874, stop := 304887 ), rec( content := " is muta\ ble, then the automorphism group is\n recomputed every time this function i\ s called.\n ", count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "P", next := 304991, root := ~, start := 304987, stop := 304990 ), rec( content := "\n\n \ Note that certain other constructor operations such as ", count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "CayleyD\ igraph" ), content := 0, count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "Ref", next := 305086, root := ~, start := 305053, stop := 305085 ), rec( content := ", ", count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Biparti\ teDoubleDigraph" ), content := 0, count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "Ref", next := 305124, root := ~, start := 305088, stop := 305123 ), rec( content := ", and ", count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "DoubleD\ igraph" ), content := 0, count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "Ref", next := 305163, root := ~, start := 305130, stop := 305162 ), rec( content := ", may no\ t require a group as one of the arguments,\n but use the standard construct\ or method using a group, and hence set the\n ", count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphGroup", count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "C", next := 305314, root := ~, start := 305295, stop := 305313 ), rec( content := " attribu\ te for the resulting digraph.\n\n ", count := [ 7, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> n := 4;;\ngap> adj := function(x, y)\n> return (((x - y) mod n) = 1\ ) or (((x - y) mod n) = n - 1);\n> end;;\ngap> group := CyclicGroup(IsPermG\ roup, n);\nGroup([ (1,2,3,4) ])\ngap> D := Digraph(IsMutableDigraph, group, [1\ .. n], \\^, adj);\n\ngap> HasDigrap\ hGroup(D);\nfalse\ngap> DigraphGroup(D);\nGroup([ (2,4), (1,2)(3,4) ])\ngap> A\ utomorphismGroup(D);\nGroup([ (2,4), (1,2)(3,4) ])\ngap> D := Digraph(group, [\ 1 .. n], \\^, adj);\n\ngap> HasDig\ raphGroup(D);\ntrue\ngap> DigraphGroup(D);\nGroup([ (1,2,3,4) ])\ngap> D := Do\ ubleDigraph(D);\n\ngap> HasDigrap\ hGroup(D);\ntrue\ngap> DigraphGroup(D);\nGroup([ (1,2,3,4)(5,6,7,8), (1,5)(2,6\ )(3,7)(4,8) ])\ngap> AutomorphismGroup(D) =\n> Group([(6, 8), (5, 7), (4, 6), \ (3, 5), (2, 4),\n> (1, 2)(3, 4)(5, 6)(7, 8)]);\ntrue\ngap> D := Digraph\ ([[2, 3], [], []]);\n\ngap> HasDig\ raphGroup(D);\nfalse\ngap> HasAutomorphismGroup(D);\nfalse\ngap> DigraphGroup(\ D);\nGroup([ (2,3) ])\ngap> HasAutomorphismGroup(D);\ntrue\ngap> group := Dihe\ dralGroup(8);\n\ngap> D := CayleyDigraph\ (group);\n\ngap> HasDigraphGroup(\ D);\ntrue\ngap> GeneratorsOfGroup(DigraphGroup(D));\n[ (1,2)(3,8)(4,6)(5,7), (\ 1,3,4,7)(2,5,6,8), (1,4)(2,6)(3,7)(5,8) ]", count := [ 7, 2, 10, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 10, 5 ], mathmode := "Text", name := "Example", next := 306784, root := ~, start := 305357, stop := 306783 ), rec( content := "\n ", count := [ 7, 2, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 10, 3 ], mathmode := "Text", name := "Description", next := 306801, root := ~, start := 304485, stop := 306800 ) ], count := [ 7, 2, 10, 1 ], mathmode := "Text", name := "ManSection", next := 306815, root := ~, start := 304384, stop := 306814 ), rec( content := "\n\n ", count := [ 7, 2, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphOrbits" ), content := 0, count := [ 7, 2, 11, 2 ], mathmode := "Text", name := "Attr", next := 306878, root := ~, start := 306836, stop := 306877 ), rec( attributes := rec( ), content := [ rec( content := "\n An \ immutable list of lists of integers.\n ", count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "Returns", next := 306947, root := ~, start := 306881, stop := 306946 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphOrbits", count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "C", next := 306988, root := ~, start := 306968, stop := 306987 ), rec( content := " returns\ the orbits of the action of the\n ", count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Group" ), content := 0, count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "Ref", next := 307059, root := ~, start := 307033, stop := 307058 ), rec( content := " on the \ set of vertices of ", count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "A", next := 307100, root := ~, start := 307086, stop := 307099 ), rec( content := ".\n\n \ ", count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> G := Group([(2, 3)(7, 8, 9), (1, 2, 3)(4, 5, 6)(8, 9)]);;\ngap> D := Edg\ eOrbitsDigraph(G, [1, 2]);\n\ngap>\ DigraphOrbits(D);\n[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ]\ngap> D := Digra\ phMutableCopy(D);\n\ngap> DigraphOrb\ its(D);\n[ [ 1, 2, 3 ], [ 4, 5, 6, 7, 8, 9 ] ]\n", count := [ 7, 2, 11, 4 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 11, 4 ], mathmode := "Text", name := "Example", next := 307489, root := ~, start := 307107, stop := 307488 ), rec( content := "\n ", count := [ 7, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 11, 3 ], mathmode := "Text", name := "Description", next := 307506, root := ~, start := 306950, stop := 307505 ) ], count := [ 7, 2, 11, 1 ], mathmode := "Text", name := "ManSection", next := 307520, root := ~, start := 306821, stop := 307519 ), rec( content := "\n\n ", count := [ 7, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphOrbitRep\ s" ), content := 0, count := [ 7, 2, 12, 2 ], mathmode := "Text", name := "Attr", next := 307586, root := ~, start := 307541, stop := 307585 ), rec( attributes := rec( ), content := [ rec( content := "\n An \ immutable list of integers.\n ", count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "Returns", next := 307646, root := ~, start := 307589, stop := 307645 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphOrbitReps", count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "C", next := 307690, root := ~, start := 307667, stop := 307689 ), rec( content := " returns\ a list of orbit representatives\n of the action of the ", count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Group" ), content := 0, count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "Ref", next := 307782, root := ~, start := 307756, stop := 307781 ), rec( content := " on the \ set of vertices of\n ", count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "A", next := 307827, root := ~, start := 307813, stop := 307826 ), rec( content := ".\n\n \ ", count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CayleyDigraph(AlternatingGroup(4));\n\ngap> DigraphOrbitReps(D);\n[ 1 ]\ngap> D := DigraphMutableCo\ py(D);\n\ngap> DigraphOrbitReps(D)\ ;\n[ 1 ]\ngap> D := DigraphFromDigraph6String(\"&IGO??S?`?_@?a?CK?O\");\n\ngap> DigraphOrbitReps(D);\n[ 1, 2, \ 3, 4, 5, 6, 7, 8, 9, 10 ]\ngap> DigraphOrbitReps(DigraphMutableCopy(D));\n[ 1,\ 2, 3, 4, 5, 6, 7, 8, 9, 10 ]\n", count := [ 7, 2, 12, 4 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 12, 4 ], mathmode := "Text", name := "Example", next := 308348, root := ~, start := 307834, stop := 308347 ), rec( content := "\n ", count := [ 7, 2, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 12, 3 ], mathmode := "Text", name := "Description", next := 308365, root := ~, start := 307649, stop := 308364 ) ], count := [ 7, 2, 12, 1 ], mathmode := "Text", name := "ManSection", next := 308379, root := ~, start := 307526, stop := 308378 ), rec( content := "\n\n ", count := [ 7, 2, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphSchreier\ Vector" ), content := 0, count := [ 7, 2, 13, 2 ], mathmode := "Text", name := "Attr", next := 308450, root := ~, start := 308400, stop := 308449 ), rec( attributes := rec( ), content := [ rec( content := "\n An \ immutable list of integers.\n ", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "Returns", next := 308510, root := ~, start := 308453, stop := 308509 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphSchreierVector", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "C", next := 308559, root := ~, start := 308531, stop := 308558 ), rec( content := " returns\ the so-called ", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ chreier vector", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "E", next := 308604, root := ~, start := 308582, stop := 308603 ), rec( content := "\n of\ the action of the ", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Group" ), content := 0, count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "Ref", next := 308656, root := ~, start := 308630, stop := 308655 ), rec( content := " on the \ set of vertices of\n ", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "A", next := 308701, root := ~, start := 308687, stop := 308700 ), rec( content := ". The Sc\ hreier vector is a list ", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ch", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "C", next := 308743, root := ~, start := 308733, stop := 308742 ), rec( content := " of inte\ gers with\n length ", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphNrVertices(", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "A", next := 3088\ 07, root := ~, start := 308793, stop := 308806 ), rec( content := ")", count := [ 7, 2, 13, 3 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "C", next := 308812, root := ~, start := 308772, stop := 308811 ), rec( content := " where:\\ n ", count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( attributes := rec( ), content := [ rec( content :\ = "sch[i] < 0:", count := [ 7, 2, 13, 4 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 13, 4 ], mathmode := "Text", name := "C", next\ := 308864, root := ~, start := 308843, stop := 308863 ) ], count := [ 7, 2, 13, 4 ], name := "Mar\ k", next := 308871, root := ~, start := 308837, stop := 308870 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n implies that ", count := [ \ 7, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "i", count := [ 7, 2, 13, 5 ], ma\ thmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13, 5 ], math\ mode := "Text", name := "C", next := 308914, root := ~, start := 308906, stop \ := 308913 ), rec( content := " is an orbit representative and\n ", coun\ t := [ 7, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "DigraphOrbitReps(", count := \ [ 7, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attri\ butes := rec( ), content := [ rec( content := "digraph", count := [ 7, 2, 13,\ 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13\ , 5 ], mathmode := "Text", name := "A", next := 308988, root := ~, start := 30\ 8974, stop := 308987 ), rec( content := ")[-sch[i]] = i", count := [ 7, 2, 13,\ 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13\ , 5 ], mathmode := "Text", name := "C", next := 309006, root := ~, start := 30\ 8954, stop := 309005 ), rec( content := ".\n ", count := [ 7, 2, 13, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13, 5 ], name := "Ite\ m", next := 309021, root := ~, start := 308878, stop := 309020 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "sch[i] > 0:", count := [ 7, 2, 13, 6 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 2, 13, 6 ], mathmode := "Text", name := "C", next\ := 309056, root := ~, start := 309035, stop := 309055 ) ], count := [ 7, 2, 13, 6 ], name := "Mar\ k", next := 309063, root := ~, start := 309029, stop := 309062 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n implies that ", count := [ \ 7, 2, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "i / gens[sch[i]]", count := [ 7,\ 2, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7\ , 2, 13, 7 ], mathmode := "Text", name := "C", next := 309121, root := ~, star\ t := 309098, stop := 309120 ), rec( content := "\n is one step closer t\ o the root (or representative) of the tree, where\n ", count := [ 7, 2,\ 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "gens", count := [ 7, 2, 13, 7 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13, 7 ], math\ mode := "Text", name := "C", next := 309219, root := ~, start := 309208, stop \ := 309218 ), rec( content := " is the generators of ", count := [ 7, 2, 13, 7 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "DigraphGroup(", count := [ 7, 2, 13, 7 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :\ = [ rec( content := "digraph", count := [ 7, 2, 13, 7 ], mathmode := "Text", n\ ame := "PCDATA", root := ~ ) ], count := [ 7, 2, 13, 7 ], mathmode := "Text", \ name := "A", next := 309271, root := ~, start := 309257, stop := 309270 ), rec\ ( content := ")", count := [ 7, 2, 13, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 2, 13, 7 ], mathmode := "Text", name := "C", next\ := 309276, root := ~, start := 309241, stop := 309275 ), rec( content := ".\n\ ", count := [ 7, 2, 13, 7 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 2, 13, 7 ], name := "Item", next := 309291, root := ~, start := 309\ 070, stop := 309290 ) ], count := [ 7, 2, 13, 4 ], mathmode := "Text", name := "List", next := 309303, root := ~, start := 308824, stop := 309302 ), rec( content := "\n\n \ ", count := [ 7, 2, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> n := 4;;\ngap> adj := function(x, y)\n> return (((x - y) mod n) = 1\ ) or (((x - y) mod n) = n - 1);\n> end;;\ngap> group := CyclicGroup(IsPermG\ roup, n);\nGroup([ (1,2,3,4) ])\ngap> D := Digraph(IsMutableDigraph, group, [1\ .. n], \\^, adj);\n\ngap> sch := Di\ graphSchreierVector(D);\n[ -1, 2, 2, 1 ]\ngap> D := CayleyDigraph(AlternatingG\ roup(4));\n\ngap> sch := Digraph\ SchreierVector(D);\n[ -1, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 1 ]\ngap> DigraphOrbit\ Reps(D);\n[ 1 ]\ngap> gens := GeneratorsOfGroup(DigraphGroup(D));\n[ (1,5,7)(2\ ,4,8)(3,6,9)(10,11,12), (1,2,3)(4,7,10)(5,9,11)(6,8,12) ]\ngap> 10 / gens[sch[\ 10]];\n7\ngap> 7 / gens[sch[7]];\n5\ngap> 5 / gens[sch[5]];\n1", count := [ 7, 2, 13, 10 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 13, 10 ], mathmode := "Text", name := "Example", next := 310080, root := ~, start := 309309, stop := 310079 ), rec( content := "\n ", count := [ 7, 2, 13, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 13, 3 ], mathmode := "Text", name := "Description", next := 310097, root := ~, start := 308513, stop := 310096 ) ], count := [ 7, 2, 13, 1 ], mathmode := "Text", name := "ManSection", next := 310111, root := ~, start := 308385, stop := 310110 ), rec( content := "\n\n ", count := [ 7, 2, 13, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, v", Name := "DigraphStabiliz\ er" ), content := 0, count := [ 7, 2, 14, 2 ], mathmode := "Text", name := "Oper", next := 310181, root := ~, start := 310132, stop := 310180 ), rec( attributes := rec( ), content := [ rec( content := "\n A p\ ermutation group.\n ", count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "Returns", next := 310231, root := ~, start := 310184, stop := 310230 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphStabilizer", count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "C", next := 310276, root := ~, start := 310252, stop := 310275 ), rec( content := " returns\ the stabilizer of the vertex ", count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "A", next := 310322, root := ~, start := 310314, stop := 310321 ), rec( content := "\n un\ der of the action of the ", count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Group" ), content := 0, count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "Ref", next := 310380, root := ~, start := 310354, stop := 310379 ), rec( content := " on the \ set of\n vertices of ", count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "A", next := 310425, root := ~, start := 310411, stop := 310424 ), rec( content := ".\n\n \ ", count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphFromDigraph6String(\"&GYHPQgWTIIPW\");\n\ngap> DigraphStabilizer(D, 8);\nGroup(())\ngap> Digr\ aphStabilizer(D, 2);\nGroup(())\ngap> D := DigraphMutableCopy(D);\n\ngap> DigraphStabilizer(D, 8);\nGroup(())\nga\ p> DigraphStabilizer(D, 2);\nGroup(())\n", count := [ 7, 2, 14, 4 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 14, 4 ], mathmode := "Text", name := "Example", next := 310801, root := ~, start := 310432, stop := 310800 ), rec( content := "\n ", count := [ 7, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 14, 3 ], mathmode := "Text", name := "Description", next := 310818, root := ~, start := 310234, stop := 310817 ) ], count := [ 7, 2, 14, 1 ], mathmode := "Text", name := "ManSection", next := 310832, root := ~, start := 310117, stop := 310831 ), rec( content := "\n\n ", count := [ 7, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2", Label := "for digraphs", Name := "IsIsomorphicDigraph" ), content := 0, count := [ 7, 2, 15, 2 ], mathmode := "Text", name := "Oper", next := 310933, root := ~, start := 310853, stop := 310932 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "K", next := 310956, root := ~, start := 310945, stop := 310955 ), rec( content := " or ", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "K", next := 310972, root := ~, start := 310960, stop := 310971 ), rec( content := ".", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "Returns", next := 310983, root := ~, start := 310936, stop := 310982 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation returns ", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "K", next := 311038, root := ~, start := 311027, stop := 311037 ), rec( content := " if ther\ e exists an isomorphism from the\n digraph ", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "A", next := 311106, root := ~, start := 311091, stop := 311105 ), rec( content := " to the \ digraph ", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "A", next := 311137, root := ~, start := 311122, stop := 311136 ), rec( content := ". See " , count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "Ref", next := 311205, root := ~, start := 311144, stop := 311204 ), rec( content := " for mor\ e information\n about isomorphisms of digraphs. ", count := [ 7, 2, 15, 3 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "P", next := 311267, root := ~, start := 311263, stop := 311266 ), rec( content := "\n\n \ By default, an isomorphism is found using the canonical labellings of the\n \ digraphs obtained from ", count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 15, 4 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 15, 4 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 4 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila\n and Petteri Kaski. If ", count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 7, 2, 15, 4 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 4 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 15, 4 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 7, 2\ , 15, 4 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 4 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " is avai\ lable, then ", count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 15, 4 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 15, 4 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 4 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by\n \ Brendan Mckay and Adolfo Piperno can be used instead; see\n ", count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseBliss" ), content := 0, count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "Ref", next := 311575, root := ~, start := 311545, stop := 311574 ), rec( content := ", and ", count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseNauty" ), content := 0, count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "Ref", next := 311611, root := ~, start := 311581, stop := 311610 ), rec( content := ".\n\n \ ", count := [ 7, 2, 15, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph1 := CycleDigraph(4);\n\ \ngap> digraph2 := CycleDigraph(5);\n\ \ngap> IsIsomorphicDigraph(digraph1, digraph2);\nfalse\ngap> digraph2 := Digra\ phReverse(digraph1);\n\ngap> IsIso\ morphicDigraph(digraph1, digraph2);\ntrue\ngap> digraph1 := Digraph([[3], [], \ []]);\n\ngap> digraph2 := Digraph([\ [], [], [2]]);\n\ngap> IsIsomorphic\ Digraph(digraph1, digraph2);\ntrue", count := [ 7, 2, 15, 5 ], name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 15, 5 ], mathmode := "Text", name := "Example", next := 312213, root := ~, start := 311618, stop := 312212 ), rec( content := "\n ", count := [ 7, 2, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 15, 3 ], mathmode := "Text", name := "Description", next := 312230, root := ~, start := 310986, stop := 312229 ) ], count := [ 7, 2, 15, 1 ], mathmode := "Text", name := "ManSection", next := 312244, root := ~, start := 310838, stop := 312243 ), rec( content := "\n\n ", count := [ 7, 2, 15, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2, colours1, colours2", Label := "for digraphs and homogeneous lists", Name := "IsIsomorphicDig\ raph" ), content := 0, count := [ 7, 2, 16, 2 ], mathmode := "Text", name := "Oper", next := 312391, root := ~, start := 312265, stop := 312390 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "K", next := 312414, root := ~, start := 312403, stop := 312413 ), rec( content := " or ", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "K", next := 312430, root := ~, start := 312418, stop := 312429 ), rec( content := ".", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "Returns", next := 312441, root := ~, start := 312394, stop := 312440 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation tests for isomorphism of coloured digraphs. A coloured\n digra\ ph can be specified by its underlying digraph ", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "A", next := 312603, root := ~, start := 312588, stop := 312602 ), rec( content := " and its\ \n colouring ", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours1", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "A", next := 312641, root := ~, start := 312626, stop := 312640 ), rec( content := ". Let " , count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "C", next := 312656, root := ~, start := 312648, stop := 312655 ), rec( content := " be the \ number of vertices of\n ", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "A", next := 312705, root := ~, start := 312690, stop := 312704 ), rec( content := ". The co\ louring ", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours1", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "A", next := 312736, root := ~, start := 312721, stop := 312735 ), rec( content := " may hav\ e one of the following\n two forms:\n\n ", count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n a list of ", count := [ 7, 2\ , 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes \ := rec( ), content := [ rec( content := "n", count := [ 7, 2, 16, 5 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 5 ], mathm\ ode := "Text", name := "C", next := 312833, root := ~, start := 312825, stop :\ = 312832 ), rec( content := " integers, where ", count := [ 7, 2, 16, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "colours", count := [ 7, 2, 16, 5 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 5 ], mathmode := "Te\ xt", name := "A", next := 312864, root := ~, start := 312850, stop := 312863 ) , rec( attr\ ibutes := rec( ), content := [ rec( content := "[i]", count := [ 7, 2, 16, 5 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 5\ ], mathmode := "Text", name := "C", next := 312874, root := ~, start := 31286\ 4, stop := 312873 ), rec( content := " is the\n colour of vertex ", coun\ t := [ 7, 2, 16, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "i", count := [ 7, 2, 16, 5 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 5 ] , math\ mode := "Text", name := "C", next := 312915, root := ~, start := 312907, stop \ := 312914 ), rec( content := ", using the colours ", count := [ 7, 2, 16, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "[1 .. m]", count := [ 7, 2, 16, 5 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 5 ], mathmode := "T\ ext", name := "C", next := 312950, root := ~, start := 312935, stop := 312949 ), rec( cont\ ent := " for some\n ", count := [ 7, 2, 16, 5 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "m <= n", count := [ 7, 2, 16, 5 ], mathmode := "Text", name := "PCDATA"\ , root := ~ ) ], count := [ 7, 2, 16, 5 ], mathmode := "Text", name := "C", next\ := 312984, root := ~, start := 312968, stop := 312983 ), rec( content := "; o\ r\n ", count := [ 7, 2, 16, 5 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 16, 5 ], name := "Item", next := 313002, root := ~, start := 312\ 800, stop := 313001 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n a list of non-empty disjoint lists whose union is\n ", coun\ t := [ 7, 2, 16, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "DigraphVertices(", count := [\ 7, 2, 16, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attrib\ utes := rec( ), content := [ rec( content := "digraph", count := [ 7, 2, 16, \ 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16,\ 7 ], mathmode := "Text", name := "A", next := 313115, root := ~, start := 313\ 101, stop := 313114 ), rec( content := ")", count := [ 7, 2, 16, 7 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 7 ], mathmod\ e := "Text", name := "C", next := 313120, root := ~, start := 313082, stop := \ 313119 ), rec( content := ", such that\n ", count := [ 7, 2, 16, 7 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "colours", count := [ 7, 2, 16, 7 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 7 ], mathmode := "Te\ xt", name := "A", next := 313154, root := ~, start := 313140, stop := 313153 ) , rec( attr\ ibutes := rec( ), content := [ rec( content := "[i]", count := [ 7, 2, 16, 7 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 7\ ], mathmode := "Text", name := "C", next := 313164, root := ~, start := 31315\ 4, stop := 313163 ), rec( content := " is the list of all vertices with colour\ \n ", count := [ 7, 2, 16, 7 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "i", count :\ = [ 7, 2, 16, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count \ := [ 7, 2, 16, 7 ], mathmode := "Text", name := "C", next := 313221, root := ~ , star\ t := 313213, stop := 313220 ), rec( content := ".\n ", count := [ 7, 2, 1\ 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 7 ], name := "Ite\ m", next := 313236, root := ~, start := 313009, stop := 313235 ) ], count := [ 7, 2, 16, 4 ], mathmode := "Text", name := "List", next := 313248, root := ~, start := 312787, stop := 313247 ), rec( content := "\n\n \ If ", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "A", next := 313272, root := ~, start := 313257, stop := 313271 ), rec( content := " and ", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "A", next := 313292, root := ~, start := 313277, stop := 313291 ), rec( content := " are dig\ raphs without multiple edges,\n and ", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours1", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "A", next := 313353, root := ~, start := 313338, stop := 313352 ), rec( content := " and ", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours2", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "A", next := 313373, root := ~, start := 313358, stop := 313372 ), rec( content := " are col\ ourings of ", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "A", next := 313407, root := ~, start := 313392, stop := 313406 ), rec( content := "\n an\ d ", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "A", next := 313431, root := ~, start := 313416, stop := 313430 ), rec( content := ", respec\ tively, then this operation returns ", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "K", next := 313486, root := ~, start := 313475, stop := 313485 ), rec( content := "\n if\ there exists an isomorphism between these two coloured digraphs. See\n ", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs and homogeneous lists", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "Ref", next := 313651, root := ~, start := 313568, stop := 313650 ), rec( content := " for mor\ e information about isomorphisms of coloured digraphs. ", count := [ 7, 2, 16, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "P", next := 313718, root := ~, start := 313714, stop := 313717 ), rec( content := "\n\n \ By default, an isomorphism is found using the canonical labellings of the\n \ digraphs obtained from ", count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "URL\ ", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 16, 10 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 16, 10 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 10 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila\n and Petteri Kaski. If ", count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 7, 2, 16, 10 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 10 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 16, 10 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 7, 2\ , 16, 10 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 10 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " is avai\ lable, then ", count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 16, 10 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 16, 10 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 10 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by\n \ Brendan Mckay and Adolfo Piperno can be used instead; see\n ", count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseBliss" ), content := 0, count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "Ref", next := 314026, root := ~, start := 313996, stop := 314025 ), rec( content := ", and ", count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseNauty" ), content := 0, count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "Ref", next := 314062, root := ~, start := 314032, stop := 314061 ), rec( content := ".\n\n \ ", count := [ 7, 2, 16, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph1 := ChainDigraph(4);\n\ \ngap> digraph2 := ChainDigraph(3);\n\ \ngap> IsIsomorphicDigraph(digraph1, digraph2,\n> [[1, 4], [2, 3]], [[1, 2], \ [3]]);\nfalse\ngap> digraph2 := DigraphReverse(digraph1);\n\ngap> IsIsomorphicDigraph(digraph1, digraph2,\n> [1\ , 1, 1, 1], [1, 1, 1, 1]);\ntrue\ngap> IsIsomorphicDigraph(digraph1, digraph2,\ \n> [1, 2, 2, 1], [1, 2, 2, 1]);\ntrue\ngap> IsIsomorphicDigraph(digraph1, di\ graph2,\n> [1, 1, 2, 2], [1, 1, 2, 2]);\nfalse", count := [ 7, 2, 16, 11 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 16, 11 ], mathmode := "Text", name := "Example", next := 314675, root := ~, start := 314069, stop := 314674 ), rec( content := "\n ", count := [ 7, 2, 16, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 16, 3 ], mathmode := "Text", name := "Description", next := 314692, root := ~, start := 312444, stop := 314691 ) ], count := [ 7, 2, 16, 1 ], mathmode := "Text", name := "ManSection", next := 314706, root := ~, start := 312250, stop := 314705 ), rec( content := "\n\n ", count := [ 7, 2, 16, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2", Label := "for digraphs", Name := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 17, 2 ], mathmode := "Text", name := "Oper", next := 314807, root := ~, start := 314727, stop := 314806 ), rec( attributes := rec( ), content := [ rec( content := " A permut\ ation, or a pair of permutations, or ", count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "K", next := 314876, root := ~, start := 314865, stop := 314875 ), rec( content := ".", count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "Returns", next := 314887, root := ~, start := 314810, stop := 314886 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation returns an isomorphism between the digraphs ", count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "A", next := 314982, root := ~, start := 314967, stop := 314981 ), rec( content := "\n an\ d ", count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "A", next := 315006, root := ~, start := 314991, stop := 315005 ), rec( content := " if one \ exists, else this operation returns ", count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "K", next := 315061, root := ~, start := 315050, stop := 315060 ), rec( content := ".\n " , count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "P", next := 315071, root := ~, start := 315067, stop := 315070 ), rec( content := "\n\n \ An ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ somorphism", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "E", next := 315098, root := ~, start := 315080, stop := 315097 ), rec( content := " from a \ digraph ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "A", next := 315129, root := ~, start := 315114, stop := 315128 ), rec( content := " to a di\ graph\n ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "A", next := 315162, root := ~, start := 315147, stop := 315161 ), rec( content := " is a bi\ jection ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "C", next := 315186, root := ~, start := 315178, stop := 315185 ), rec( content := " from th\ e vertices of\n ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "A", next := 315227, root := ~, start := 315212, stop := 315226 ), rec( content := " to the \ vertices of ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "A", next := 315262, root := ~, start := 315247, stop := 315261 ), rec( content := " with th\ e following\n property: for all vertices ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "C", next := 315321, root := ~, start := 315313, stop := 315320 ), rec( content := " and ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "C", next := 315334, root := ~, start := 315326, stop := 315333 ), rec( content := " of ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "A", next := 315353, root := ~, start := 315338, stop := 315352 ), rec( content := ",\n " , count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i, j]", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "C", next := 315372, root := ~, start := 315359, stop := 315371 ), rec( content := " is an e\ dge of ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "A", next := 315402, root := ~, start := 315387, stop := 315401 ), rec( content := " if and \ only if ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i ^ p, j\n ^ p]", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "C", next := 315445, root := ~, start := 315418, stop := 315444 ), rec( content := " is an e\ dge of ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "A", next := 315475, root := ~, start := 315460, stop := 315474 ), rec( content := ". ", count := [ 7, 2, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 17, 5 ], mathmode := "Text", name := "P", next := 315481, root := ~, start := 315477, stop := 315480 ), rec( content := "\n\n \ If there exists such an isomorphism, then this operation returns one.\n The\ form of this isomorphism is a permutation ", count := [ 7, 2, 17, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 7, 2, 17, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 5 ], mathmode := "Text", name := "C", next := 315615, root := ~, start := 315607, stop := 315614 ), rec( content := " of the \ vertices of\n ", count := [ 7, 2, 17, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 17, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 5 ], mathmode := "Text", name := "A", next := 315654, root := ~, start := 315639, stop := 315653 ), rec( content := " such th\ at ", count := [ 7, 2, 17, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "P", next := 315669, root := ~, start := 315665, stop := 315668 ), rec( content := "\n\n \ ", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "O\ nDigraphs(", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "digraph1", count := [ 7, 2, 17, 6 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 6 ], mathmode := \ "Text", name := "A", next := 315704, root := ~, start := 315689, stop := 31570\ 3 ), rec( content := ", p) = digraph2", count := [ 7, 2, 17, 6 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "C", next := 315723, root := ~, start := 315675, stop := 315722 ), rec( content := ".\n\n \ By default, an isomorphism is found using the canonical labellings of the\n \ digraphs obtained from ", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "URL", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 17, 6 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 17, 6 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 6 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila\n and Petteri Kaski. If ", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 7, 2, 17, 6 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 6 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 17, 6 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 7, 2\ , 17, 6 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 6 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " is avai\ lable, then ", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 17, 6 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 17, 6 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 6 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by\n \ Brendan Mckay and Adolfo Piperno can be used instead; see\n ", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseBliss" ), content := 0, count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "Ref", next := 316032, root := ~, start := 316002, stop := 316031 ), rec( content := ", and ", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseNauty" ), content := 0, count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "Ref", next := 316068, root := ~, start := 316038, stop := 316067 ), rec( content := ".\n\n \ ", count := [ 7, 2, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph1 := CycleDigraph(4);\n\ \ngap> digraph2 := CycleDigraph(5);\n\ \ngap> IsomorphismDigraphs(digraph1, digraph2);\nfail\ngap> digraph1 := Comple\ teBipartiteDigraph(10, 5);\n\ngap> digraph2 := CompleteBipartiteDigraph(5, 10);\n\ngap> p := I\ somorphismDigraphs(digraph1, digraph2);\n(1,6,11)(2,7,12)(3,8,13)(4,9,14)(5,10\ ,15)\ngap> OnDigraphs(digraph1, p) = digraph2;\ntrue\n", count := [ 7, 2, 17, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 17, 7 ], mathmode := "Text", name := "Example", next := 316691, root := ~, start := 316075, stop := 316690 ), rec( content := "\n ", count := [ 7, 2, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 17, 3 ], mathmode := "Text", name := "Description", next := 316708, root := ~, start := 314890, stop := 316707 ) ], count := [ 7, 2, 17, 1 ], mathmode := "Text", name := "ManSection", next := 316722, root := ~, start := 314712, stop := 316721 ), rec( content := "\n\n ", count := [ 7, 2, 17, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2, colours1, colours2", Label := "for digraphs and homogeneous lists", Name := "IsomorphismDigr\ aphs" ), content := 0, count := [ 7, 2, 18, 2 ], mathmode := "Text", name := "Oper", next := 316869, root := ~, start := 316743, stop := 316868 ), rec( attributes := rec( ), content := [ rec( content := " A permut\ ation, or ", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "K", next := 316911, root := ~, start := 316900, stop := 316910 ), rec( content := ".", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "Returns", next := 316922, root := ~, start := 316872, stop := 316921 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s operation searches for an isomorphism between coloured digraphs. A\n col\ oured digraph can be specified by its underlying digraph ", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "A", next := 317095, root := ~, start := 317080, stop := 317094 ), rec( content := "\n an\ d its colouring ", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours1", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "A", next := 317133, root := ~, start := 317118, stop := 317132 ), rec( content := ". Let " , count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "C", next := 317148, root := ~, start := 317140, stop := 317147 ), rec( content := " be the \ number of vertices\n of ", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "A", next := 317197, root := ~, start := 317182, stop := 317196 ), rec( content := ". The co\ louring ", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours1", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "A", next := 317228, root := ~, start := 317213, stop := 317227 ), rec( content := " may hav\ e one of the\n following two forms:\n\n ", count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n a list of ", count := [ 7, 2\ , 18, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes \ := rec( ), content := [ rec( content := "n", count := [ 7, 2, 18, 5 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 5 ], mathm\ ode := "Text", name := "C", next := 317325, root := ~, start := 317317, stop :\ = 317324 ), rec( content := " integers, where ", count := [ 7, 2, 18, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "colours", count := [ 7, 2, 18, 5 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 5 ], mathmode := "Te\ xt", name := "A", next := 317356, root := ~, start := 317342, stop := 317355 ) , rec( attr\ ibutes := rec( ), content := [ rec( content := "[i]", count := [ 7, 2, 18, 5 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 5\ ], mathmode := "Text", name := "C", next := 317366, root := ~, start := 31735\ 6, stop := 317365 ), rec( content := " is the\n colour of vertex ", coun\ t := [ 7, 2, 18, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "i", count := [ 7, 2, 18, 5 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 5 ] , math\ mode := "Text", name := "C", next := 317407, root := ~, start := 317399, stop \ := 317406 ), rec( content := ", using the colours ", count := [ 7, 2, 18, 5 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "[1 .. m]", count := [ 7, 2, 18, 5 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 5 ], mathmode := "T\ ext", name := "C", next := 317442, root := ~, start := 317427, stop := 317441 ), rec( cont\ ent := " for some\n ", count := [ 7, 2, 18, 5 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "m <= n", count := [ 7, 2, 18, 5 ], mathmode := "Text", name := "PCDATA"\ , root := ~ ) ], count := [ 7, 2, 18, 5 ], mathmode := "Text", name := "C", next\ := 317476, root := ~, start := 317460, stop := 317475 ), rec( content := "; o\ r\n ", count := [ 7, 2, 18, 5 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 18, 5 ], name := "Item", next := 317494, root := ~, start := 317\ 292, stop := 317493 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n a list of non-empty disjoint lists whose union is\n ", coun\ t := [ 7, 2, 18, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "DigraphVertices(", count := [\ 7, 2, 18, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attrib\ utes := rec( ), content := [ rec( content := "digraph", count := [ 7, 2, 18, \ 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18,\ 7 ], mathmode := "Text", name := "A", next := 317607, root := ~, start := 317\ 593, stop := 317606 ), rec( content := ")", count := [ 7, 2, 18, 7 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 7 ], mathmod\ e := "Text", name := "C", next := 317612, root := ~, start := 317574, stop := \ 317611 ), rec( content := ", such that\n ", count := [ 7, 2, 18, 7 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "colours", count := [ 7, 2, 18, 7 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 7 ], mathmode := "Te\ xt", name := "A", next := 317646, root := ~, start := 317632, stop := 317645 ) , rec( attr\ ibutes := rec( ), content := [ rec( content := "[i]", count := [ 7, 2, 18, 7 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 7\ ], mathmode := "Text", name := "C", next := 317656, root := ~, start := 31764\ 6, stop := 317655 ), rec( content := " is the list of all vertices with colour\ \n ", count := [ 7, 2, 18, 7 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "i", count :\ = [ 7, 2, 18, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count \ := [ 7, 2, 18, 7 ], mathmode := "Text", name := "C", next := 317713, root := ~ , star\ t := 317705, stop := 317712 ), rec( content := ".\n ", count := [ 7, 2, 1\ 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 7 ], name := "Ite\ m", next := 317728, root := ~, start := 317501, stop := 317727 ) ], count := [ 7, 2, 18, 4 ], mathmode := "Text", name := "List", next := 317740, root := ~, start := 317279, stop := 317739 ), rec( content := "\n\n \ An ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ somorphism", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "E", next := 317767, root := ~, start := 317749, stop := 317766 ), rec( content := " between\ coloured digraphs is an isomorphism between\n the underlying digraphs that\ preserves the colourings. See ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs", Oper := "IsomorphismDigraphs" ), content := 0, count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "Ref", next := 317944, root := ~, start := 317884, stop := 317943 ), rec( content := " for mor\ e information\n about isomorphisms of digraphs. More precisely, let ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "C", next := 318030, root := ~, start := 318022, stop := 318029 ), rec( content := " be an\n\ isomorphism of digraphs from the digraph ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "A", next := 318097, root := ~, start := 318082, stop := 318096 ), rec( content := " (with c\ olouring\n ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours1", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "A", next := 318133, root := ~, start := 318118, stop := 318132 ), rec( content := ") to the\ digraph ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "A", next := 318165, root := ~, start := 318150, stop := 318164 ), rec( content := " (with c\ olouring\n ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olours2", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "A", next := 318201, root := ~, start := 318186, stop := 318200 ), rec( content := "), and l\ et ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "C", next := 318220, root := ~, start := 318212, stop := 318219 ), rec( content := " be the \ permutation of the vertices of\n ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "A", next := 318278, root := ~, start := 318263, stop := 318277 ), rec( content := " that co\ rresponds to ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "C", next := 318307, root := ~, start := 318299, stop := 318306 ), rec( content := ". Then \ ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "C", next := 318323, root := ~, start := 318315, stop := 318322 ), rec( content := " preserv\ es the\n colourings of ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "A", next := 318371, root := ~, start := 318356, stop := 318370 ), rec( content := " and ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "A", next := 318391, root := ~, start := 318376, stop := 318390 ), rec( content := " – and\ hence is an\n isomorphism of coloured digraphs – if ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "colours1", count := [ 7, 2, 18, 9 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := \ "Text", name := "A", next := 318474, root := ~, start := 318459, stop := 31847\ 3 ), rec( content := "[i] =\n ", count := [ 7, 2, 18, 9 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "colours2", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "A", next := 3185\ 01, root := ~, start := 318486, stop := 318500 ), rec( content := "[i ^ p]", count := [ 7, 2, 18, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "C", next := 318512, root := ~, start := 318456, stop := 318511 ), rec( content := " for all\ vertices ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "C", next := 318538, root := ~, start := 318530, stop := 318537 ), rec( content := " in ", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "A", next := 318557, root := ~, start := 318542, stop := 318556 ), rec( content := ".\n " , count := [ 7, 2, 18, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 18, 10 ], mathmode := "Text", name := "P", next := 318567, root := ~, start := 318563, stop := 318566 ), rec( content := "\n\n \ This operation returns such an isomorphism if one exists, else it returns\n \ ", count := [ 7, 2, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 2, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 10 ], mathmode := "Text", name := "K", next := 318662, root := ~, start := 318651, stop := 318661 ), rec( content := ". ", count := [ 7, 2, 18, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "P", next := 318668, root := ~, start := 318664, stop := 318667 ), rec( content := "\n\n \ By default, an isomorphism is found using the canonical labellings of the\n \ digraphs obtained from ", count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "bliss" ), content := [ rec( content := "http://www.tcs.tkk.fi/S\ oftware/bliss/", count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "URL\ ", next := 81, root := ~, start := 17, stop := 80 ) ], count := [ 7, 2, 18, 11 ], name := "Alt", next := 87, root := ~, start := 1, stop := 86 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "bliss", count := [ 7, 2, 18, 11 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 11 ], name := "Package", next := 131, root := ~, start := 107 , stop := 130 ) ], count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "Alt", next := 137, root := ~, start := 87, stop := 136 ), rec( content := " by Tomm\ i Junttila\n and Petteri Kaski. If ", count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "NautyTracesInterface" ), content := [ rec( content := "https://\ github.com/gap-packages/NautyTracesInterface", count := [ 7, 2, 18, 11 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 11 ], mathmode := \ "Text", name := "URL", next := 111, root := ~, start := 17, stop := 110 ) ], count := [ 7, 2, 18, 11 ], name := "Alt", next := 117, root := ~, start := 1, stop := 116 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "NautyTracesInterface", count := [ 7, 2\ , 18, 11 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 11 ], name := "Pac\ kage", next := 176, root := ~, start := 137, stop := 175 ) ], count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "Alt", next := 182, root := ~, start := 117, stop := 181 ), rec( content := " is avai\ lable, then ", count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "nauty" ), content := [ rec( content := "http://pallini.di.uniro\ ma1.it/", count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "URL", next := 74, root := ~, start := 17, stop := 73 ) ], count := [ 7, 2, 18, 11 ], name := "Alt", next := 80, root := ~, start := 1, stop := 79 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "nauty", count := [ 7, 2, 18, 11 ], name\ := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 11 ], name := "Package", next := 124, root := ~, start := 100 , stop := 123 ) ], count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "Alt", next := 130, root := ~, start := 80, stop := 129 ), rec( content := " by\n \ Brendan Mckay and Adolfo Piperno can be used instead; see\n ", count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseBliss" ), content := 0, count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "Ref", next := 318976, root := ~, start := 318946, stop := 318975 ), rec( content := ", and ", count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ sUseNauty" ), content := 0, count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "Ref", next := 319012, root := ~, start := 318982, stop := 319011 ), rec( content := ".\n\n \ ", count := [ 7, 2, 18, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph1 := ChainDigraph(4);\n\ \ngap> digraph2 := ChainDigraph(3);\n\ \ngap> IsomorphismDigraphs(digraph1, digraph2,\n> [[1, 4], [2, 3]], [[1, 2], \ [3]]);\nfail\ngap> digraph2 := DigraphReverse(digraph1);\n\ngap> colours1 := [1, 1, 1, 1];;\ngap> colours2 := [1\ , 1, 1, 1];;\ngap> p := IsomorphismDigraphs(digraph1, digraph2, colours1, colo\ urs2);\n(1,4)(2,3)\ngap> OnDigraphs(digraph1, p) = digraph2;\ntrue\ngap> List(\ DigraphVertices(digraph1), i -> colours1[i ^ p]) = colours2;\ntrue\ngap> colou\ rs1 := [1, 1, 2, 2];;\ngap> colours2 := [2, 2, 1, 1];;\ngap> p := IsomorphismD\ igraphs(digraph1, digraph2, colours1, colours2);\n(1,4)(2,3)\ngap> OnDigraphs(\ digraph1, p) = digraph2;\ntrue\ngap> List(DigraphVertices(digraph1), i -> colo\ urs1[i ^ p]) = colours2;\ntrue\ngap> IsomorphismDigraphs(digraph1, digraph2,\n\ > [1, 1, 2, 2], [1, 1, 2, 2]);\nfail", count := [ 7, 2, 18, 12 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 18, 12 ], mathmode := "Text", name := "Example", next := 319995, root := ~, start := 319019, stop := 319994 ), rec( content := "\n ", count := [ 7, 2, 18, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 18, 3 ], mathmode := "Text", name := "Description", next := 320012, root := ~, start := 316925, stop := 320011 ) ], count := [ 7, 2, 18, 1 ], mathmode := "Text", name := "ManSection", next := 320026, root := ~, start := 316728, stop := 320025 ), rec( content := "\n\n ", count := [ 7, 2, 18, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "RepresentativeO\ utNeighbours" ), content := 0, count := [ 7, 2, 19, 2 ], mathmode := "Text", name := "Attr", next := 320103, root := ~, start := 320047, stop := 320102 ), rec( attributes := rec( ), content := [ rec( content := "An immuta\ ble list of lists.", count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "Returns", next := 320152, root := ~, start := 320106, stop := 320151 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function returns the list ", count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut", count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "C", next := 320214, root := ~, start := 320204, stop := 320213 ), rec( content := " of ", count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut-neighbours", count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "E", next := 320239, root := ~, start := 320218, stop := 320238 ), rec( content := " of each\ \n representative of the orbits of the action of ", count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Group" ), content := 0, count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "Ref", next := 320324, root := ~, start := 320298, stop := 320323 ), rec( content := " on\n \ the vertex set of the digraph ", count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "A", next := 320376, root := ~, start := 320362, stop := 320375 ), rec( content := ". ", count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "P", next := 320382, root := ~, start := 320378, stop := 320381 ), rec( content := "\n\n \ More specifically, if ", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ eps", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "C", next := 320421, root := ~, start := 320410, stop := 320420 ), rec( content := " is the \ list of orbit representatives,\n then a vertex ", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "C", next := 320486, root := ~, start := 320478, stop := 320485 ), rec( content := " appears\ in ", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ut[i]", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "C", next := 320511, root := ~, start := 320498, stop := 320510 ), rec( content := " each ti\ me\n there exists an edge with source ", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ eps[i]", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "C", next := 320573, root := ~, start := 320559, stop := 320572 ), rec( content := " and ran\ ge ", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ ", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "C", next := 320592, root := ~, start := 320584, stop := 320591 ), rec( content := " in\n \ ", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "A", next := 320614, root := ~, start := 320600, stop := 320613 ), rec( content := ".\n " , count := [ 7, 2, 19, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 19, 5 ], mathmode := "Text", name := "P", next := 320624, root := ~, start := 320620, stop := 320623 ), rec( content := "\n\n \ If ", count := [ 7, 2, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Group" ), content := 0, count := [ 7, 2, 19, 5 ], mathmode := "Text", name := "Ref", next := 320659, root := ~, start := 320633, stop := 320658 ), rec( content := " is triv\ ial, then ", count := [ 7, 2, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "OutNeig\ hbours" ), content := 0, count := [ 7, 2, 19, 5 ], mathmode := "Text", name := "Ref", next := 320704, root := ~, start := 320677, stop := 320703 ), rec( content := "\n is\ returned.\n\n ", count := [ 7, 2, 19, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\n> [2, 1, 3, 4, 5], [3, 5], [2], [1, 2, 3, 5], [1, 2, 3,\ 4]]);\n\ngap> DigraphGroup(D);\n\ Group(())\ngap> RepresentativeOutNeighbours(D);\n[ [ 2, 1, 3, 4, 5 ], [ 3, 5 ]\ , [ 2 ], [ 1, 2, 3, 5 ], [ 1, 2, 3, 4 ] ]\ngap> D := Digraph(IsMutableDigraph,\ [\n> [2, 1, 3, 4, 5], [3, 5], [2], [1, 2, 3, 5], [1, 2, 3, 4]]);\n\ngap> DigraphGroup(D);\nGroup(())\ngap> Repr\ esentativeOutNeighbours(D);\n[ [ 2, 1, 3, 4, 5 ], [ 3, 5 ], [ 2 ], [ 1, 2, 3, \ 5 ], [ 1, 2, 3, 4 ] ]\ngap> D := DigraphFromDigraph6String(\"&GYHPQgWTIIPW\");\ \n\ngap> G := DigraphGroup(D);;\n\ gap> GeneratorsOfGroup(G);\n[ (1,2)(3,4)(5,6)(7,8), (1,3,2,4)(5,7,6,8), (1,5)(\ 2,6)(3,8)(4,7) ]\ngap> Set(RepresentativeOutNeighbours(D), Set);\n[ [ 2, 3, 5 \ ] ]", count := [ 7, 2, 19, 6 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 6 ], mathmode := "Text", name := "Example", next := 321597, root := ~, start := 320727, stop := 321596 ), rec( content := "\n ", count := [ 7, 2, 19, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 19, 3 ], mathmode := "Text", name := "Description", next := 321614, root := ~, start := 320155, stop := 321613 ) ], count := [ 7, 2, 19, 1 ], mathmode := "Text", name := "ManSection", next := 321628, root := ~, start := 320032, stop := 321627 ), rec( content := "\n\n ", count := [ 7, 2, 19, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "src, ran, x", Label := "for digraphs a\ nd transformation or permutation", Name := "IsDigraphIsomorphism" ), content := 0, count := [ 7, 2, 20, 2 ], mathmode := "Text", name := "Oper", next := 321766, root := ~, start := 321649, stop := 321765 ), rec( attributes := rec( Arg := "src, ran, x, col\ 1, col2", Name := "IsDigraphIsomorphism" ), content := 0, count := [ 7, 2, 20, 4 ], mathmode := "Text", name := "Oper", next := 321834, root := ~, start := 321769, stop := 321833 ), rec( attributes := rec( Arg := "digraph, x", Label := "for a digraph \ and a transformation or permutation", Name := "IsDigraphAutomorphism" ), content := 0, count := [ 7, 2, 20, 6 ], mathmode := "Text", name := "Oper", next := 321957, root := ~, start := 321837, stop := 321956 ), rec( attributes := rec( Arg := "digraph, x, col" , Name := "IsDigraphAutomo\ rphism" ), content := 0, count := [ 7, 2, 20, 8 ], mathmode := "Text", name := "Oper", next := 322018, root := ~, start := 321960, stop := 322017 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "K", next := 322041, root := ~, start := 322030, stop := 322040 ), rec( content := " or ", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "K", next := 322057, root := ~, start := 322045, stop := 322056 ), rec( content := ".", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "Returns", next := 322068, root := ~, start := 322021, stop := 322067 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphIsomorphism", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "C", next := 322116, root := ~, start := 322089, stop := 322115 ), rec( content := " returns\ ", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "K", next := 322136, root := ~, start := 322125, stop := 322135 ), rec( content := " if the \ permutation or\n transformation ", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "A", next := 322186, root := ~, start := 322178, stop := 322185 ), rec( content := " is an i\ somorphism from the digraph ", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "A", next := 322232, root := ~, start := 322222, stop := 322231 ), rec( content := " to\n \ the digraph ", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "A", next := 322262, root := ~, start := 322252, stop := 322261 ), rec( content := ".\n " , count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "P", next := 322272, root := ~, start := 322268, stop := 322271 ), rec( content := "\n\n \ ", count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphAutomorphism", count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "C", next := 322306, root := ~, start := 322278, stop := 322305 ), rec( content := " returns\ ", count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "K", next := 322326, root := ~, start := 322315, stop := 322325 ), rec( content := " if the \ permutation or\n transformation ", count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "A", next := 322376, root := ~, start := 322368, stop := 322375 ), rec( content := " is an a\ utomorphism of the digraph ", count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "A", next := 322425, root := ~, start := 322411, stop := 322424 ), rec( content := ".\n " , count := [ 7, 2, 20, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "P", next := 322435, root := ~, start := 322431, stop := 322434 ), rec( content := "\n\n \ A permutation or transformation ", count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "A", next := 322481, root := ~, start := 322473, stop := 322480 ), rec( content := " is an " , count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ somorphism", count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "E", next := 322506, root := ~, start := 322488, stop := 322505 ), rec( content := " from a\\ n digraph ", count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "A", next := 322536, root := ~, start := 322526, stop := 322535 ), rec( content := " to a di\ graph ", count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "A", next := 322560, root := ~, start := 322550, stop := 322559 ), rec( content := " if the \ following hold:\n ", count := [ 7, 2, 20, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 20, 13 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "x", count := [ 7, 2, 20, 13 ], mathmode := "Text", n\ ame := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 13 ], mathmode := "Text", name\ := "A", next := 322624, root := ~, start := 322616, stop := 322623 ), rec( cont\ ent := " is a bijection from the vertices of ", count := [ 7, 2, 20, 13 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "src", count := [ 7, 2, 20, 13 ], mathmode := "Text",\ name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 13 ], mathmode := "Text\ ", name := "A", next := 322671, root := ~, start := 322661, stop := 322670 ), rec( cont\ ent := " to those of\n ", count := [ 7, 2, 20, 13 ], mathmode := "Text" , name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "ran", count := [ 7, 2, 20, 13 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 7, 2, 20, 13 ], mathmode := "Text", name := "A", next\ := 322702, root := ~, start := 322692, stop := 322701 ), rec( content := ";\n\ ", count := [ 7, 2, 20, 13 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 20, 13 ], name := "Item", next := 322717, root := ~, start := 322\ 601, stop := 322716 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n ", count := [ 7, 2, 20, 15 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[u ^\ ", count := [ 7, 2, 20, 15 ], mathmode := "Text", name := "PCDATA", root := ~\ ), rec( attributes := rec( ), content := [ rec( content := "x", count := [ 7\ , 2, 20, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [\ 7, 2, 20, 15 ], mathmode := "Text", name := "A", next := 322755, root := ~, s\ tart := 322747, stop := 322754 ), rec( content := ", v ^ ", count := [ 7, 2, 2\ 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :=\ rec( ), content := [ rec( content := "x", count := [ 7, 2, 20, 15 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 15 ], mathm\ ode := "Text", name := "A", next := 322769, root := ~, start := 322761, stop :\ = 322768 ), rec( content := "]", count := [ 7, 2, 20, 15 ], mathmode := "Text"\ , name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 15 ], mathmode := "Tex\ t", name := "C", next := 322774, root := ~, start := 322739, stop := 322773 ), rec( cont\ ent := " is an edge of\n ", count := [ 7, 2, 20, 15 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ re\ c( content := "ran", count := [ 7, 2, 20, 15 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 7, 2, 20, 15 ], mathmode := "Text", name := \ "A", next := 322807, root := ~, start := 322797, stop := 322806 ), rec( conten\ t := " if and only if ", count := [ 7, 2, 20, 15 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content\ := "[u, v]", count := [ 7, 2, 20, 15 ], mathmode := "Text", name := "PCDATA",\ root := ~ ) ], count := [ 7, 2, 20, 15 ], mathmode := "Text", name := "C", next\ := 322836, root := ~, start := 322823, stop := 322835 ), rec( content := " is\ an\n edge of ", count := [ 7, 2, 20, 15 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "src", count := [ 7, 2, 20, 15 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 7, 2, 20, 15 ], mathmode := "Text", name := "A", next :\ = 322869, root := ~, start := 322859, stop := 322868 ), rec( content := "; and\ \n ", count := [ 7, 2, 20, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 2, 20, 15 ], name := "Item", next := 322888, root := ~, start := 322\ 724, stop := 322887 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n ", count := [ 7, 2, 20, 17 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x", \ count := [ 7, 2, 20, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ] , coun\ t := [ 7, 2, 20, 17 ], mathmode := "Text", name := "A", next := 322918, root :\ = ~, start := 322910, stop := 322917 ), rec( content := " fixes every ", count\ := [ 7, 2, 20, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "i", count := [ 7, 2, 20, 17 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 17\ ], mathmode := "Text", name := "C", next := 322939, root := ~, start := 32293\ 1, stop := 322938 ), rec( content := " which is not a vertex of ", count := [ \ 7, 2, 20, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attrib\ utes := rec( ), content := [ rec( content := "src", count := [ 7, 2, 20, 17 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 17\ ], mathmode := "Text", name := "A", next := 322975, root := ~, start := 32296\ 5, stop := 322974 ), rec( content := ".\n ", count := [ 7, 2, 20, 17 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 17 ], name := "Ite\ m", next := 322990, root := ~, start := 322895, stop := 322989 ) ], count := [ 7, 2, 20, 12 ], mathmode := "Text", name := "List", next := 323002, root := ~, start := 322588, stop := 323001 ), rec( content := "\n Se\ e also ", count := [ 7, 2, 20, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 2, 20, 19 ], mathmode := "Text", name := "Ref", next := 323076, root := ~, start := 323016, stop := 323075 ), rec( content := ".", count := [ 7, 2, 20, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "P", next := 323081, root := ~, start := 323077, stop := 323080 ), rec( content := "\n \n\ If ", count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol1", count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "A", next := 323105, root := ~, start := 323094, stop := 323104 ), rec( content := " and ", count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol2", count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "A", next := 323121, root := ~, start := 323110, stop := 323120 ), rec( content := ", or ", count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol", count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "A", next := 323136, root := ~, start := 323126, stop := 323135 ), rec( content := ", are gi\ ven, then they must\n represent vertex colourings; see \n ", count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and a homogeneous list", Oper := "AutomorphismGroup" ), content := 0, count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "Ref", next := 323282, root := ~, start := 323206, stop := 323281 ), rec( content := " \n f\ or details of the permissible values for\n these arguments. The homomorphis\ m must then also have the property:\n \n ", count := [ 7, 2, 20, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 20, 22 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "col1[i] = col2[i ^ x]", count := [ 7, 2, 20, 22 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 22 ], math\ mode := "Text", name := "C", next := 323465, root := ~, start := 323437, stop \ := 323464 ), rec( content := " for all vertices ", count := [ 7, 2, 20, 22 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "i", count := [ 7, 2, 20, 22 ], mathmode := "Text", n\ ame := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 22 ], mathmode := "Text", name\ := "C", next := 323491, root := ~, start := 323483, stop := 323490 ), rec( cont\ ent := " of ", count := [ 7, 2, 20, 22 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "src", count\ := [ 7, 2, 20, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 2, 20, 22 ], mathmode := "Text", name := "A", next := 323505, root :\ = ~, start := 323495, stop := 323504 ), rec( content := ",\n for ", coun\ t := [ 7, 2, 20, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "IsDigraphIsomorphism", count \ := [ 7, 2, 20, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 2, 20, 22 ], mathmode := "Text", name := "C", next := 323546, root :\ = ~, start := 323519, stop := 323545 ), rec( content := ". ", count := [ 7, 2,\ 20, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 22 ] , name := "Ite\ m", next := 323555, root := ~, start := 323422, stop := 323554 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n ", count := [ 7, 2, 20, 24 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "col[i] = col[i ^ x]", count := [ 7, 2, 20, 24 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 24 ], math\ mode := "Text", name := "C", next := 323603, root := ~, start := 323577, stop \ := 323602 ), rec( content := " for all vertices ", count := [ 7, 2, 20, 24 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "i", count := [ 7, 2, 20, 24 ], mathmode := "Text", n\ ame := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 24 ], mathmode := "Text", name\ := "C", next := 323629, root := ~, start := 323621, stop := 323628 ), rec( cont\ ent := " of ", count := [ 7, 2, 20, 24 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", c\ ount := [ 7, 2, 20, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 2, 20, 24 ], mathmode := "Text", name := "A", next := 323647, root :\ = ~, start := 323633, stop := 323646 ), rec( content := ",\n for ", coun\ t := [ 7, 2, 20, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "IsDigraphAutomorphism", count\ := [ 7, 2, 20, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 2, 20, 24 ], mathmode := "Text", name := "C", next := 323689, root :\ = ~, start := 323661, stop := 323688 ), rec( content := ". ", count := [ 7, 2,\ 20, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 24 ] , name := "Ite\ m", next := 323698, root := ~, start := 323562, stop := 323697 ) ], count := [ 7, 2, 20, 21 ], mathmode := "Text", name := "List", next := 323710, root := ~, start := 323409, stop := 323709 ), rec( content := "\n\n \ For some digraphs, it can be faster to use ", count := [ 7, 2, 20, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphAutomorphism", count := [ 7, 2, 20, 26 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 20, 26 ], mathmode := "Text", name := "C", next := 323787, root := ~, start := 323759, stop := 323786 ), rec( content := "\n th\ an to test membership in the automorphism group of ", count := [ 7, 2, 20, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 20, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 26 ], mathmode := "Text", name := "A", next := 323859, root := ~, start := 323845, stop := 323858 ), rec( content := ".\n\n \ ", count := [ 7, 2, 20, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> src := Digraph([[1], [1, 2], [1, 3]]);\n\ngap> IsDigraphAutomorphism(src, (1, 2, 3));\nfalse\ngap> IsDigra\ phAutomorphism(src, (2, 3));\ntrue\ngap> IsDigraphAutomorphism(src, (2, 3), [2\ , 1, 1]);\ntrue\ngap> IsDigraphAutomorphism(src, (2, 3), [2, 2, 1]);\nfalse\ng\ ap> IsDigraphAutomorphism(src, (2, 3)(4, 5));\nfalse\ngap> IsDigraphAutomorphi\ sm(src, (1, 4));\nfalse\ngap> IsDigraphAutomorphism(src, ());\ntrue\ngap> ran \ := Digraph([[2, 1], [2], [2, 3]]);\n\ngap> IsDigraphIsomorphism(src, ran, (1, 2));\ntrue\ngap> IsDigraphIsomorph\ ism(ran, src, (1, 2));\ntrue\ngap> IsDigraphIsomorphism(ran, src, (1, 2));\ntr\ ue\ngap> IsDigraphIsomorphism(src, Digraph([[3], [1, 3], [2]]), (1, 2, 3));\nf\ alse\ngap> IsDigraphIsomorphism(src, ran, (1, 2), [1, 2, 3], [2, 1, 3]);\ntrue\ \ngap> IsDigraphIsomorphism(src, ran, (1, 2), [1, 2, 2], [2, 1, 3]);\nfalse\n" , count := [ 7, 2, 20, 27 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 20, 27 ], mathmode := "Text", name := "Example", next := 324802, root := ~, start := 323866, stop := 324801 ), rec( content := "\n ", count := [ 7, 2, 20, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 20, 9 ], mathmode := "Text", name := "Description", next := 324819, root := ~, start := 322071, stop := 324818 ) ], count := [ 7, 2, 20, 1 ], mathmode := "Text", name := "ManSection", next := 324833, root := ~, start := 321634, stop := 324832 ), rec( content := "\n\n ", count := [ 7, 2, 20, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, list", Name := "IsDigraphColour\ ing" ), content := 0, count := [ 7, 2, 21, 2 ], mathmode := "Text", name := "Oper", next := 324911, root := ~, start := 324858, stop := 324910 ), rec( attributes := rec( Arg := "digraph, t", Label := "for a transfor\ mation", Name := "IsDigraphColouring" ), content := 0, count := [ 7, 2, 21, 4 ], mathmode := "Text", name := "Oper", next := 325002, root := ~, start := 324916, stop := 325001 ), rec( attributes := rec( ), content := [ rec( content := " ", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "K", next := 325028, root := ~, start := 325017, stop := 325027 ), rec( content := " or ", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "K", next := 325044, root := ~, start := 325032, stop := 325043 ), rec( content := ". ", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "Returns", next := 325056, root := ~, start := 325007, stop := 325055 ), rec( attributes := rec( ), content := [ rec( content := "\n T\ he operation ", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphColouring", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "C", next := 325120, root := ~, start := 325095, stop := 325119 ), rec( content := " verifie\ s whether or not \n the list ", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "A", next := 325172, root := ~, start := 325161, stop := 325171 ), rec( content := " describ\ es a proper colouring of the digraph \n ", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "A", next := 325238, root := ~, start := 325224, stop := 325237 ), rec( content := ". \n \ ", count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "P", next := 325251, root := ~, start := 325247, stop := 325250 ), rec( content := "\n\n \ A list ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "A", next := 325277, root := ~, start := 325266, stop := 325276 ), rec( content := " describ\ es a ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roper colouring", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "E", next := 325313, root := ~, start := 325290, stop := 325312 ), rec( content := " of a di\ graph\n ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "A", next := 325347, root := ~, start := 325333, stop := 325346 ), rec( content := " if ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "A", next := 325362, root := ~, start := 325351, stop := 325361 ), rec( content := " consist\ s of positive integers, the length of\n ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "A", next := 325425, root := ~, start := 325414, stop := 325424 ), rec( content := " equals \ the number of vertices in ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "A", next := 325473, root := ~, start := 325459, stop := 325472 ), rec( content := ", and fo\ r any\n vertices ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ , v", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "C", next := 325513, root := ~, start := 325502, stop := 325512 ), rec( content := " of ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "A", next := 325531, root := ~, start := 325517, stop := 325530 ), rec( content := " if ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "C", next := 325543, root := ~, start := 325535, stop := 325542 ), rec( content := " and ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "C", next := 325556, root := ~, start := 325548, stop := 325555 ), rec( content := " are adj\ acent,\n then ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "list", count := [ 7, 2, 21, 6 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := \ "Text", name := "A", next := 325596, root := ~, start := 325585, stop := 32559\ 5 ), rec( content := "[u] >< ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ist", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := \ ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "A", next := 3256\ 20, root := ~, start := 325609, stop := 325619 ), rec( content := "[v]", count := [ 7, 2, 21, 6 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "C", next := 325627, root := ~, start := 325582, stop := 325626 ), rec( content := ".\n \ ", count := [ 7, 2, 21, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "P", next := 325639, root := ~, start := 325635, stop := 325638 ), rec( content := "\n\n \ A transformation ", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ ", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "A", next := 325672, root := ~, start := 325664, stop := 325671 ), rec( content := " describ\ es a proper colouring of a digraph\n ", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "A", next := 325735, root := ~, start := 325721, stop := 325734 ), rec( content := ", if ", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ mageListOfTransformation(", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ ", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 7 ], mathmode := \ "Text", name := "A", next := 325777, root := ~, start := 325769, stop := 32577\ 6 ), rec( content := ",\n DigraphNrVertices(", count := [ 7, 2, 21, 7 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "A", next := 3258\ 17, root := ~, start := 325803, stop := 325816 ), rec( content := "))", count := [ 7, 2, 21, 7 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "C", next := 325823, root := ~, start := 325740, stop := 325822 ), rec( content := " is a pr\ oper colouring of \n ", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "A", next := 325870, root := ~, start := 325856, stop := 325869 ), rec( content := ". ", count := [ 7, 2, 21, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 2, 21, 8 ], mathmode := "Text", name := "P", next := 325876, root := ~, start := 325872, stop := 325875 ), rec( content := "\n\n \ See also ", count := [ 7, 2, 21, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsDigra\ phHomomorphism" ), content := 0, count := [ 7, 2, 21, 8 ], mathmode := "Text", name := "Ref", next := 325928, root := ~, start := 325893, stop := 325927 ), rec( content := ".\n \ \n ", count := [ 7, 2, 21, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := JohnsonDigraph(5, 3);\n\ngap> IsDigraphColouring(D, [1, 2, 3, 3, 2, 1, 4, 5, 6, 7]);\ntru\ e\ngap> IsDigraphColouring(D, [1, 2, 3, 3, 2, 1, 2, 5, 6, 7]);\nfalse\ngap> Is\ DigraphColouring(D, [1, 2, 3, 3, 2, 1, 2, 5, 6, -1]);\nfalse\ngap> IsDigraphCo\ louring(D, [1, 2, 3]);\nfalse\ngap> IsDigraphColouring(D, IdentityTransformati\ on);\ntrue\n", count := [ 7, 2, 21, 9 ], name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 9 ], mathmode := "Text", name := "Example", next := 326364, root := ~, start := 325943, stop := 326363 ), rec( content := "\n ", count := [ 7, 2, 21, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 21, 5 ], mathmode := "Text", name := "Description", next := 326383, root := ~, start := 325061, stop := 326382 ) ], count := [ 7, 2, 21, 1 ], mathmode := "Text", name := "ManSection", next := 326399, root := ~, start := 324841, stop := 326398 ), rec( content := "\n\n ", count := [ 7, 2, 21, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 2, 0, 1 ], mathmode := "Text", name := "Section", next := 326413, root := ~, start := 282491, stop := 326412 ) , rec( content := "\n\n ", count := [ 7, 2, 21, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Homomorphisms of \ digraphs", count := [ 7, 3, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 0, 2 ], mathmode := "Text", name := "Heading", next := 326470, root := ~, start := 326426, stop := 326469 ), rec( content := "\n\n The following me\ thods exist to find homomorphisms between digraphs.\n If an argument to one\ of these methods is a digraph with multiple edges,\n then the multiplicity\ of edges will be ignored in order to perform the\n calculation; the digrap\ h will be treated as if it has no multiple edges.\n\n ", count := [ 7, 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "D1, D2, hook, us\ er_param, max_results, hint, injective, image, partial_map, colors1, colors2[,\ order, aut_grp]", Name := "HomomorphismDigraphsFinder" ), content := 0, count := [ 7, 3, 1, 2 ], mathmode := "Text", name := "Func", next := 326951, root := ~, start := 326793, stop := 326950 ), rec( attributes := rec( ), content := [ rec( content := "The argum\ ent ", count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ser_param", count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "A", next := 326993, root := ~, start := 326976, stop := 326992 ), rec( content := ".", count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "Returns", next := 327004, root := ~, start := 326954, stop := 327003 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function finds homomorphisms from the digraph ", count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "A", next := 327085, root := ~, start := 327076, stop := 327084 ), rec( content := " to the \ digraph\n ", count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 2", count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "A", next := 327114, root := ~, start := 327105, stop := 327113 ), rec( content := " subject\ to the conditions imposed by the other arguments as\n described below.", count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "P", next := 327199, root := ~, start := 327195, stop := 327198 ), rec( content := "\n\n \ If ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "C", next := 327216, root := ~, start := 327208, stop := 327215 ), rec( content := " and ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "C", next := 327229, root := ~, start := 327221, stop := 327228 ), rec( content := " are hom\ omorphisms found by\n ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ omomorphismDigraphsFinder", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "C", next := 327294, root := ~, start := 327261, stop := 327293 ), rec( content := ", then " , count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "C", next := 327309, root := ~, start := 327301, stop := 327308 ), rec( content := " cannot \ be obtained from\n ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "C", next := 327346, root := ~, start := 327338, stop := 327345 ), rec( content := " by righ\ t multiplying by an automorphism of ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 2", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "A", next := 327399, root := ~, start := 327390, stop := 327398 ), rec( content := " in\n \ ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "a\ ut_grp", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "A", next := 327421, root := ~, start := 327407, stop := 327420 ), rec( content := ".\n\n \ ", count := [ 7, 3, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( attributes := rec( ), content := [ rec( content :\ = "hook", count := [ 7, 3, 1, 5 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 3, 1, 5 ], mathmode := "Text", name := "A", next := 32\ 7458, root := ~, start := 327447, stop := 327457 ) ], count := [ 7, 3, 1, 5 ], name := "Mar\ k", next := 327465, root := ~, start := 327441, stop := 327464 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n This argument should be a f\ unction or ", count := [ 7, 3, 1, 6 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "fail", coun\ t := [ 7, 3, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 3, 1, 6 ], mathmode := "Text", name := "K", next := 327536, root := \ ~, start := 327525, stop := 327535 ), rec( content := ".", count := [ 7, 3, 1,\ 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := 0, count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "P", next\ := 327541, root := ~, start := 327537, stop := 327540 ), rec( content := "\n\ \n If ", count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "hook", coun\ t := [ 7, 3, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 3, 1, 7 ], mathmode := "Text", name := "A", next := 327565, root := \ ~, start := 327554, stop := 327564 ), rec( content := " is a function, then it\ must have two arguments\n ", count := [ 7, 3, 1, 7 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ re\ c( content := "user_param", count := [ 7, 3, 1, 7 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 7 ], mathmode := "Text", name \ := "A", next := 327638, root := ~, start := 327621, stop := 327637 ), rec( cont\ ent := " (see below) and a transformation ", count := [ 7, 3, 1, 7 ], mathmode\ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content\ := [ rec( content := "t", count := [ 7, 3, 1, 7 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 7 ], mathmode := "Text", name :\ = "C", next := 327680, root := ~, start := 327672, stop := 327679 ), rec( cont\ ent := ". The\n function ", count := [ 7, 3, 1, 7 ], mathmode := "Text" , name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attri\ butes := rec( ), content := [ rec( content := "hook", count := [ 7, 3, 1, 7 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 7 ]\ , mathmode := "Text", name := "A", next := 327717, root := ~, start := 327706,\ stop := 327716 ), rec( content := "(", count := [ 7, 3, 1, 7 ], mathmode := "\ Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [\ rec( content := "user_param", count := [ 7, 3, 1, 7 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 7 ], mathmode := "Text", na\ me := "A", next := 327735, root := ~, start := 327718, stop := 327734 ), rec( \ content := ", t)", count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "C", next\ := 327743, root := ~, start := 327703, stop := 327742 ), rec( content := " is\ called every time\n a new homomorphism ", count := [ 7, 3, 1, 7 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "t", count := [ 7, 3, 1, 7 ], mathmode := "Text", nam\ e := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 7 ], mathmode := "Text", name\ := "C", next := 327800, root := ~, start := 327792, stop := 327799 ), rec( cont\ ent := " is found by\n ", count := [ 7, 3, 1, 7 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "HomomorphismDigraphsFinder", count := [ 7, 3, 1, 7 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 7 ], mathmode := "Text\ ", name := "C", next := 327854, root := ~, start := 327821, stop := 327853 ), rec( cont\ ent := ". If the function returns ", count := [ 7, 3, 1, 7 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ re\ c( content := "true", count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "K" , next\ := 327891, root := ~, start := 327880, stop := 327890 ), rec( content := ",\n\ then ", count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "Homomorphis\ mDigraphsFinder", count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "C", next\ := 327939, root := ~, start := 327906, stop := 327938 ), rec( content := " st\ ops and does not find any\n further homomorphisms. This feature might b\ e useful if you are\n searching for a homomorphism that satisfies some \ condition that you\n cannot specify via the other arguments to\n \ ", count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attr\ ibutes := rec( ), content := [ rec( content := "HomomorphismDigraphsFinder", \ count := [ 7, 3, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 3, 1, 7 ], mathmode := "Text", name := "C", next := 328206, root := \ ~, start := 328173, stop := 328205 ), rec( content := ".\n ", count := [ \ 7, 3, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := 0, count := [ 7, 3, 1, 8 ], mathmode := "Text", name\ := "P", next := 328220, root := ~, start := 328216, stop := 328219 ), rec( cont\ ent := "\n\n If ", count := [ 7, 3, 1, 8 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "hook", count := [ 7, 3, 1, 8 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 3, 1, 8 ], mathmode := "Text", name := "A", next := 3\ 28244, root := ~, start := 328233, stop := 328243 ), rec( content := " is ", coun\ t := [ 7, 3, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "fail", count := [ 7, 3, 1, 8 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 8 ] , math\ mode := "Text", name := "K", next := 328259, root := ~, start := 328248, stop \ := 328258 ), rec( content := ", then a default function is used which\n \ simply adds every new homomorphism found by\n ", count := [ 7, 3, 1, 8\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ ), content := [ rec( content := "HomomorphismDigraphsFinder", count := [ 7, \ 3, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, \ 3, 1, 8 ], mathmode := "Text", name := "C", next := 328392, root := ~, start :\ = 328359, stop := 328391 ), rec( content := " to ", count := [ 7, 3, 1, 8 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "user_param", count := [ 7, 3, 1, 8 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 8 ], mathmode := "T\ ext", name := "A", next := 328413, root := ~, start := 328396, stop := 328412 ), rec( cont\ ent := ", which must be a\n mutable list in this case.\n ", count \ := [ 7, 3, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 6 ], name := "Ite\ m", next := 328479, root := ~, start := 327472, stop := 328478 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "user_param", count := [ 7, 3, 1, 9 ], mathmode := "Text", name := "PCDATA"\ , root := ~ ) ], count := [ 7, 3, 1, 9 ], mathmode := "Text", name := "A", next\ := 328510, root := ~, start := 328493, stop := 328509 ) ], count := [ 7, 3, 1, 9 ], name := "Mar\ k", next := 328517, root := ~, start := 328487, stop := 328516 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n If ", count := [ 7, 3, 1, 1\ 0 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec\ ( ), content := [ rec( content := "hook", count := [ 7, 3, 1, 10 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 10 ], mathmode\ := "Text", name := "A", next := 328553, root := ~, start := 328542, stop := 3\ 28552 ), rec( content := " is a function, then ", count := [ 7, 3, 1, 10 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "user_param", count := [ 7, 3, 1, 10 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 10 ], mathmode := \ "Text", name := "A", next := 328591, root := ~, start := 328574, stop := 32859\ 0 ), rec( content := " can be any ", count := [ 7, 3, 1, 10 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ r\ ec( content := "GAP", count := [ 7, 3, 1, 10 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 7, 3, 1, 10 ], mathmode := "Text", name := "\ Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := "\n\ object. The object ", count := [ 7, 3, 1, 10 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "user_param", count := [ 7, 3, 1, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 1, 10 ], mathmode := "Text", name := "A" , next\ := 328653, root := ~, start := 328636, stop := 328652 ), rec( content := " is\ used as the first argument of\n the function ", count := [ 7, 3, 1, 10\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ ), content := [ rec( content := "hook", count := [ 7, 3, 1, 10 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 10 ], mathmode \ := "Text", name := "A", next := 328719, root := ~, start := 328708, stop := 32\ 8718 ), rec( content := ". For example, ", count := [ 7, 3, 1, 10 ], mathmode \ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content \ := [ rec( content := "user_param", count := [ 7, 3, 1, 10 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 10 ], mathmode := "Tex\ t", name := "A", next := 328751, root := ~, start := 328734, stop := 328750 ), rec( cont\ ent := " might be a\n transformation semigroup, and ", count := [ 7, 3,\ 1, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "hook", count := [ 7, 3, 1, 10 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 7, 3, 1, 10 ], mathmode := "Text", name := "A", next :=\ 328815, root := ~, start := 328804, stop := 328814 ), rec( content := "(", co\ unt := [ 7, 3, 1, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec\ ( attributes := rec( ), content := [ rec( content := "user_param", count := [\ 7, 3, 1, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := \ [ 7, 3, 1, 10 ], mathmode := "Text", name := "A", next := 328833, root := ~, s\ tart := 328816, stop := 328832 ), rec( content := ", t)", count := [ 7, 3, 1, \ 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1,\ 10 ], mathmode := "Text", name := "C", next := 328841, root := ~, start := 32\ 8801, stop := 328840 ), rec( content := "\n might set ", count := [ 7, \ 3, 1, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes\ := rec( ), content := [ rec( content := "user_param", count := [ 7, 3, 1, 10\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 1\ 0 ], mathmode := "Text", name := "A", next := 328877, root := ~, start := 3288\ 60, stop := 328876 ), rec( content := " to be the closure of ", count := [ 7, \ 3, 1, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes\ := rec( ), content := [ rec( content := "user_param", count := [ 7, 3, 1, 10\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 1\ 0 ], mathmode := "Text", name := "A", next := 328916, root := ~, start := 3288\ 99, stop := 328915 ), rec( content := " and\n ", count := [ 7, 3, 1, 10\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ ), content := [ rec( content := "t", count := [ 7, 3, 1, 10 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 10 ], mathmode := \ "Text", name := "C", next := 328937, root := ~, start := 328929, stop := 32893\ 6 ), rec( content := ". ", count := [ 7, 3, 1, 10 ], mathmode := "Text", name \ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ \ 7, 3, 1, 11 ], mathmode := "Text", name := "P", next := 328943, root := ~, star\ t := 328939, stop := 328942 ), rec( content := "\n\n If the value of ", coun\ t := [ 7, 3, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "hook", count := [ 7, 3, 1, 11\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 1\ 1 ], mathmode := "Text", name := "A", next := 328980, root := ~, start := 3289\ 69, stop := 328979 ), rec( content := " is ", count := [ 7, 3, 1, 11 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conte\ nt := [ rec( content := "fail", count := [ 7, 3, 1, 11 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 11 ], mathmode := "Text", name\ := "K", next := 328995, root := ~, start := 328984, stop := 328994 ), rec( cont\ ent := ", then the value of\n ", count := [ 7, 3, 1, 11 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ \ rec( content := "user_param", count := [ 7, 3, 1, 11 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 11 ], mathmode := "Text", name\ := "A", next := 329040, root := ~, start := 329023, stop := 329039 ), rec( cont\ ent := " must be a mutable list.\n ", count := [ 7, 3, 1, 11 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 10 ], name := "Ite\ m", next := 329078, root := ~, start := 328524, stop := 329077 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "max_results", count := [ 7, 3, 1, 12 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 3, 1, 12 ], mathmode := "Text", name := "A", next\ := 329110, root := ~, start := 329092, stop := 329109 ) ], count := [ 7, 3, 1, 12 ], name := "Mar\ k", next := 329117, root := ~, start := 329086, stop := 329116 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n This argument should be a p\ ositive integer or ", count := [ 7, 3, 1, 13 ], mathmode := "Text", name := "P\ CDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := \ "infinity", count := [ 7, 3, 1, 13 ], mathmode := "Text", name := "PCDATA", ro\ ot := ~ ) ], count := [ 7, 3, 1, 13 ], mathmode := "Text", name := "K", next :\ = 329200, root := ~, start := 329185, stop := 329199 ), rec( content := ".\n \ ", count := [ 7, 3, 1, 13 ], mathmode := "Text", name := "PCDATA", root \ := ~ ), rec( attributes := rec( ), content := [ rec( content := "Homomorphism\ DigraphsFinder", count := [ 7, 3, 1, 13 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 3, 1, 13 ], mathmode := "Text", name := "C", next\ := 329243, root := ~, start := 329210, stop := 329242 ), rec( content := " wi\ ll return after it has found\n ", count := [ 7, 3, 1, 13 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :=\ [ rec( content := "max_results", count := [ 7, 3, 1, 13 ], mathmode := "Text"\ , name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 13 ], mathmode := "Text\ ", name := "A", next := 329301, root := ~, start := 329283, stop := 329300 ), rec( cont\ ent := " homomorphisms or the search is complete, whichever\n happens f\ irst.\n ", count := [ 7, 3, 1, 13 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 7, 3, 1, 13 ], name := "Item", next := 329389, root := ~, start := 329\ 124, stop := 329388 ), rec( attributes := rec( ), content := [ rec( attribute\ s := rec( ), content := [ rec( content := "hint", count := [ 7, 3, 1, 14 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 14 ], math\ mode := "Text", name := "A", next := 329414, root := ~, start := 329403, stop \ := 329413 ) ], count := [ 7, 3, 1, 14 ], name := "Mark", next := 329421, root := ~, start := 329\ 397, stop := 329420 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n This argument should be a positive integer or ", count := [ 7, 3,\ 1, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "fail", count := [ 7, 3, 1, 15 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 15 ], math\ mode := "Text", name := "K", next := 329500, root := ~, start := 329489, stop \ := 329499 ), rec( content := ". ", count := [ 7, 3, 1, 15 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, coun\ t := [ 7, 3, 1, 16 ], mathmode := "Text", name := "P", next := 329506, root :=\ ~, start := 329502, stop := 329505 ), rec( content := "\n\n If ", coun\ t := [ 7, 3, 1, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "hint", count := [ 7, 3, 1, 16\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 1\ 6 ], mathmode := "Text", name := "A", next := 329530, root := ~, start := 3295\ 19, stop := 329529 ), rec( content := " is a positive integer, then only homor\ phisms of rank\n ", count := [ 7, 3, 1, 16 ], mathmode := "Text", name \ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conten\ t := "hint", count := [ 7, 3, 1, 16 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 7, 3, 1, 16 ], mathmode := "Text", name := "A", next \ := 329603, root := ~, start := 329592, stop := 329602 ), rec( content := " are\ found.", count := [ 7, 3, 1, 16 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 1, 17 ], math\ mode := "Text", name := "P", next := 329618, root := ~, start := 329614, stop \ := 329617 ), rec( content := "\n\n If ", count := [ 7, 3, 1, 17 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "hint", count := [ 7, 3, 1, 17 ], mathmode := "Text",\ name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 17 ], mathmode := "Text" , name\ := "A", next := 329642, root := ~, start := 329631, stop := 329641 ), rec( cont\ ent := " is ", count := [ 7, 3, 1, 17 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "fail", coun\ t := [ 7, 3, 1, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 3, 1, 17 ], mathmode := "Text", name := "K", next := 329657, root :=\ ~, start := 329646, stop := 329656 ), rec( content := ", then no restriction \ is put on the rank\n of homomorphisms found.\n ", count := [ 7, 3,\ 1, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 15 ], name := "Ite\ m", next := 329743, root := ~, start := 329428, stop := 329742 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "injective", count := [ 7, 3, 1, 18 ], mathmode := "Text", name := "PCDATA"\ , root := ~ ) ], count := [ 7, 3, 1, 18 ], mathmode := "Text", name := "A", next\ := 329773, root := ~, start := 329757, stop := 329772 ) ], count := [ 7, 3, 1, 18 ], name := "Mar\ k", next := 329780, root := ~, start := 329751, stop := 329779 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n This argument should be ", coun\ t := [ 7, 3, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "0", count := [ 7, 3, 1, 19 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 19 ] , math\ mode := "Text", name := "C", next := 329834, root := ~, start := 329826, stop \ := 329833 ), rec( content := ", ", count := [ 7, 3, 1, 19 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec\ ( content := "1", count := [ 7, 3, 1, 19 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 3, 1, 19 ], mathmode := "Text", name := "C", next\ := 329844, root := ~, start := 329836, stop := 329843 ), rec( content := ", o\ r ", count := [ 7, 3, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~\ ), rec( attributes := rec( ), content := [ rec( content := "2", count := [ 7\ , 3, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ \ 7, 3, 1, 19 ], mathmode := "Text", name := "C", next := 329857, root := ~, star\ t := 329849, stop := 329856 ), rec( content := ". If it is\n ", count \ := [ 7, 3, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "2", count := [ 7, 3, 1, 19 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 19 ] , math\ mode := "Text", name := "C", next := 329885, root := ~, start := 329877, stop \ := 329884 ), rec( content := ", then only embeddings are found, if it is ", coun\ t := [ 7, 3, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "1", count := [ 7, 3, 1, 19 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 19 ] , math\ mode := "Text", name := "C", next := 329936, root := ~, start := 329928, stop \ := 329935 ), rec( content := ", then only\n injective homomorphisms are\ found, and if it is ", count := [ 7, 3, 1, 19 ], mathmode := "Text", name := \ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :\ = "0", count := [ 7, 3, 1, 19 ], mathmode := "Text", name := "PCDATA", root :=\ ~ ) ], count := [ 7, 3, 1, 19 ], mathmode := "Text", name := "C", next := 330\ 012, root := ~, start := 330004, stop := 330011 ), rec( content := " there are\ no\n restrictions imposed by this argument.\n ", count := [ 7, \ 3, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes\ := rec( ), content := 0, count := [ 7, 3, 1, 20 ], mathmode := "Text", name \ := "P", next := 330085, root := ~, start := 330081, stop := 330084 ), rec( cont\ ent := "\n\n For backwards compatibility, ", count := [ 7, 3, 1, 20 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "injective", count := [ 7, 3, 1, 20 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 20 ], mathmode := "\ Text", name := "A", next := 330140, root := ~, start := 330124, stop := 330139\ ), rec( content := " can also be ", count := [ 7, 3, 1, 20 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ r\ ec( content := "false", count := [ 7, 3, 1, 20 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 20 ], mathmode := "Text", name :=\ "K", next := 330165, root := ~, start := 330153, stop := 330164 ), rec( conte\ nt := "\n or ", count := [ 7, 3, 1, 20 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :=\ "true", count := [ 7, 3, 1, 20 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 3, 1, 20 ], mathmode := "Text", name := "K", next := 3\ 30188, root := ~, start := 330177, stop := 330187 ), rec( content := " which c\ orrespond to the values ", count := [ 7, 3, 1, 20 ], mathmode := "Text", name \ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conten\ t := "0", count := [ 7, 3, 1, 20 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 3, 1, 20 ], mathmode := "Text", name := "C", next := \ 330228, root := ~, start := 330220, stop := 330227 ), rec( content := " and ", coun\ t := [ 7, 3, 1, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "1", count := [ 7, 3, 1, 20 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 20 ] , math\ mode := "Text", name := "C", next := 330241, root := ~, start := 330233, stop \ := 330240 ), rec( content := "\n described in the previous paragraph, r\ espectively. \n ", count := [ 7, 3, 1, 20 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 19 ], name := "Item", next := 3303\ 15, root := ~, start := 329787, stop := 330314 ), rec( attributes := rec( ), content := [ rec( attr\ ibutes := rec( ), content := [ rec( content := "image", count := [ 7, 3, 1, 2\ 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, \ 21 ], mathmode := "Text", name := "A", next := 330341, root := ~, start := 330\ 329, stop := 330340 ) ], count := [ 7, 3, 1, 21 ], name := "Mark", next := 3303\ 48, root := ~, start := 330323, stop := 330347 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n This argument should be a subset of the vertices of the grap\ h ", count := [ 7, 3, 1, 22 ], mathmode := "Text", name := "PCDATA", root := ~\ ), rec( attributes := rec( ), content := [ rec( content := "D2", count := [ \ 7, 3, 1, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ \ 7, 3, 1, 22 ], mathmode := "Text", name := "A", next := 330441, root := ~, star\ t := 330432, stop := 330440 ), rec( content := ".\n ", count := [ 7, 3,\ 1, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "HomomorphismDigraphsFinder", count :=\ [ 7, 3, 1, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :\ = [ 7, 3, 1, 22 ], mathmode := "Text", name := "C", next := 330484, root := ~, star\ t := 330451, stop := 330483 ), rec( content := " only finds homomorphisms from\ \n ", count := [ 7, 3, 1, 22 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "D1", count \ := [ 7, 3, 1, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count\ := [ 7, 3, 1, 22 ], mathmode := "Text", name := "A", next := 330532, root := \ ~, start := 330523, stop := 330531 ), rec( content := " to the subgraph of ", coun\ t := [ 7, 3, 1, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "D2", count := [ 7, 3, 1, 22 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 22 ] , math\ mode := "Text", name := "A", next := 330561, root := ~, start := 330552, stop \ := 330560 ), rec( content := " induced by the vertices\n ", count := [ \ 7, 3, 1, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "image", count := [ 7, 3, 1, 22 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 22 ] , math\ mode := "Text", name := "A", next := 330606, root := ~, start := 330594, stop \ := 330605 ), rec( content := ".\n ", count := [ 7, 3, 1, 22 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 22 ], name := "Ite\ m", next := 330621, root := ~, start := 330355, stop := 330620 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "partial_map", count := [ 7, 3, 1, 23 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 3, 1, 23 ], mathmode := "Text", name := "A", next\ := 330653, root := ~, start := 330635, stop := 330652 ) ], count := [ 7, 3, 1, 23 ], name := "Mar\ k", next := 330660, root := ~, start := 330629, stop := 330659 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n This argument should be a p\ artial map from ", count := [ 7, 3, 1, 24 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D1\ ", count := [ 7, 3, 1, 24 ], mathmode := "Text", name := "PCDATA", root := ~ )\ ], count := [ 7, 3, 1, 24 ], mathmode := "Text", name := "A", next := 330734, root\ := ~, start := 330725, stop := 330733 ), rec( content := " to ", count := [ 7\ , 3, 1, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := [ rec( content := "D2", count := [ 7, 3, 1, 24 ], ma\ thmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 24 ], math\ mode := "Text", name := "A", next := 330747, root := ~, start := 330738, stop \ := 330746 ), rec( content := ",\n that is, a (not necessarily dense) li\ st of vertices of the digraph\n ", count := [ 7, 3, 1, 24 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :\ = [ rec( content := "D2", count := [ 7, 3, 1, 24 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 24 ], mathmode := "Text", name \ := "A", next := 330841, root := ~, start := 330832, stop := 330840 ), rec( cont\ ent := " of length no greater than the number vertices in the digraph\n \ ", count := [ 7, 3, 1, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "D1", count := [ 7, 3, 1, 24 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 24 ] , math\ mode := "Text", name := "A", next := 330920, root := ~, start := 330911, stop \ := 330919 ), rec( content := ". ", count := [ 7, 3, 1, 24 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec\ ( content := "HomomorphismDigraphsFinder", count := [ 7, 3, 1, 24 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 24 ], mathmode\ := "Text", name := "C", next := 330955, root := ~, start := 330922, stop := 3\ 30954 ), rec( content := " only finds homomorphisms\n extending ", coun\ t := [ 7, 3, 1, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "partial_map", count := [ 7, 3\ , 1, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, \ 3, 1, 24 ], mathmode := "Text", name := "A", next := 331017, root := ~, start \ := 330999, stop := 331016 ), rec( content := " (if any).\n ", count := [ \ 7, 3, 1, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 24 ], name := "Ite\ m", next := 331041, root := ~, start := 330667, stop := 331040 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "colors1", count := [ 7, 3, 1, 25 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 7, 3, 1, 25 ], mathmode := "Text", name := "A", next\ := 331075, root := ~, start := 331061, stop := 331074 ) ], count := [ 7, 3, 1, 25 ], name := "Mar\ k", next := 331082, root := ~, start := 331055, stop := 331081 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n This should be a list repre\ senting possible colours of vertices in the\n digraph ", count := [ 7, \ 3, 1, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes\ := rec( ), content := [ rec( content := "D1", count := [ 7, 3, 1, 26 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 26 ], math\ mode := "Text", name := "A", next := 331200, root := ~, start := 331191, stop \ := 331199 ), rec( content := "; see \n ", count := [ 7, 3, 1, 26 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label :\ = "for a digraph and a homogeneous list", Oper := "AutomorphismGroup" ), conte\ nt := 0, count := [ 7, 3, 1, 26 ], mathmode := "Text", name := "Ref", next := \ 331302, root := ~, start := 331215, stop := 331301 ), rec( content := " \n \ for details of the permissible values for this argument.\n ", count :\ = [ 7, 3, 1, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 26 ], name := "Ite\ m", next := 331382, root := ~, start := 331089, stop := 331381 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "colors2", count := [ 7, 3, 1, 27 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 7, 3, 1, 27 ], mathmode := "Text", name := "A", next\ := 331416, root := ~, start := 331402, stop := 331415 ) ], count := [ 7, 3, 1, 27 ], name := "Mar\ k", next := 331423, root := ~, start := 331396, stop := 331422 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n This should be a list repre\ senting possible colours of vertices in the\n digraph ", count := [ 7, \ 3, 1, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes\ := rec( ), content := [ rec( content := "D2", count := [ 7, 3, 1, 28 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 28 ], math\ mode := "Text", name := "A", next := 331541, root := ~, start := 331532, stop \ := 331540 ), rec( content := "; see \n ", count := [ 7, 3, 1, 28 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label :\ = "for a digraph and a homogeneous list", Oper := "AutomorphismGroup" ), conte\ nt := 0, count := [ 7, 3, 1, 28 ], mathmode := "Text", name := "Ref", next := \ 331643, root := ~, start := 331556, stop := 331642 ), rec( content := " \n \ for details of the permissible values for this argument.\n ", count :\ = [ 7, 3, 1, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 28 ], name := "Ite\ m", next := 331723, root := ~, start := 331430, stop := 331722 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "order", count := [ 7, 3, 1, 29 ], mathmode := "Text", name := "PCDATA", ro\ ot := ~ ) ], count := [ 7, 3, 1, 29 ], mathmode := "Text", name := "A", next :\ = 331748, root := ~, start := 331736, stop := 331747 ) ], count := [ 7, 3, 1, 29 ], name := "Mar\ k", next := 331755, root := ~, start := 331730, stop := 331754 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n The optional argument ", coun\ t := [ 7, 3, 1, 30 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "order", count := [ 7, 3, 1, 3\ 0 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, \ 30 ], mathmode := "Text", name := "A", next := 331811, root := ~, start := 331\ 799, stop := 331810 ), rec( content := " specifies the order the\n vert\ ices in ", count := [ 7, 3, 1, 30 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "D1", count \ := [ 7, 3, 1, 30 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count\ := [ 7, 3, 1, 30 ], mathmode := "Text", name := "A", next := 331865, root := \ ~, start := 331856, stop := 331864 ), rec( content := " appear in the search f\ or homomorphisms. \n The value of this parameter can have a large impac\ t\n on the runtime of the function. It seems in many cases to be a good\ \n idea for this to be the ", count := [ 7, 3, 1, 30 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "DigraphWe\ lshPowellOrder" ), content := 0, count := [ 7, 3, 1, 30 ], mathmode := "Text", name\ := "Ref", next := 332112, root := ~, start := 332075, stop := 332111 ), rec( cont\ ent := ", i.e.\n vertices ordered from highest to lowest degree.\n \ ", count := [ 7, 3, 1, 30 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 30 ], name := "Ite\ m", next := 332188, root := ~, start := 331762, stop := 332187 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n The optional argument ", coun\ t := [ 7, 3, 1, 32 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "aut_grp", count := [ 7, 3, 1,\ 32 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1\ , 32 ], mathmode := "Text", name := "A", next := 332246, root := ~, start := 3\ 32232, stop := 332245 ), rec( content := " should be a subgroup of the\n \ automorphism group of ", count := [ 7, 3, 1, 32 ], mathmode := "Text", name \ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conten\ t := "D2", count := [ 7, 3, 1, 32 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 7, 3, 1, 32 ], mathmode := "Text", name := "A", next :=\ 332314, root := ~, start := 332305, stop := 332313 ), rec( content := ". This\ function returns unique\n representatives of the homomorphisms found u\ p to right multiplication\n by ", count := [ 7, 3, 1, 32 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :=\ [ rec( content := "aut_grp", count := [ 7, 3, 1, 32 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 32 ], mathmode := "Text", name\ := "A", next := 332448, root := ~, start := 332434, stop := 332447 ), rec( cont\ ent := ". If this argument is not specific, it defaults to the\n full a\ utomorphism group of ", count := [ 7, 3, 1, 32 ], mathmode := "Text", name := \ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :\ = "D2", count := [ 7, 3, 1, 32 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ) ], count := [ 7, 3, 1, 32 ], mathmode := "Text", name := "A", next := 33\ 2547, root := ~, start := 332538, stop := 332546 ), rec( content := ", which m\ ay be costly to calculate.\n ", count := [ 7, 3, 1, 32 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 32 ], name := "Item" , next := 3325\ 96, root := ~, start := 332195, stop := 332595 ) ], count := [ 7, 3, 1, 5 ], mathmode := "Text", name := "List", next := 332608, root := ~, start := 327428, stop := 332607 ), rec( content := "\n\n \ ", count := [ 7, 3, 1, 34 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := ChainDigraph(10);\n\ngap>\ D := DigraphSymmetricClosure(D);\n\ngap> HomomorphismDigraphsFinder(D, D, fail, [], infinity, 2, 0,\ \n> [3, 4], [], fail, fail);\n[ Transformation( [ 3, 4, 3, 4, 3, 4, 3, 4, 3, 4\ ] ), \n Transformation( [ 4, 3, 4, 3, 4, 3, 4, 3, 4, 3 ] ) ]\ngap> D2 := Com\ pleteDigraph(6);;\ngap> HomomorphismDigraphsFinder(D, D2, fail, [], 1, fail, 0\ ,\n> [1 .. 6], [1, 2, 1], fail, fail);\n[ Transformation( [ 1, 2, 1, 3, 4, 5, \ 6, 1, 2, 1 ] ) ]\ngap> func := function(user_param, t)\n> Add(user_param, t * \ user_param[1]);\n> end;;\ngap> HomomorphismDigraphsFinder(D, D2, func, [Transf\ ormation([2, 2])],\n> 3, fail, 0, [1 .. 6], [1, 2, 1], fail, fail);\n[ Transfo\ rmation( [ 2, 2 ] ), \n Transformation( [ 2, 2, 2, 3, 4, 5, 6, 2, 2, 2 ] ), \ \n Transformation( [ 2, 2, 2, 3, 4, 5, 6, 2, 2, 3 ] ), \n Transformation( [ \ 2, 2, 2, 3, 4, 5, 6, 2, 2, 4 ] ) ]\ngap> HomomorphismDigraphsFinder(NullDigrap\ h(2), NullDigraph(3), fail,\n> [], infinity, fail, 1, [1, 2, 3], fail, fail, f\ ail, fail,\n> Group(()));\n[ IdentityTransformation, Transformation( [ 1, 3, 3\ ] ), \n Transformation( [ 2, 1 ] ), Transformation( [ 2, 3, 3 ] ), \n Trans\ formation( [ 3, 1, 3 ] ), Transformation( [ 3, 2, 3 ] ) ]\ngap> HomomorphismDi\ graphsFinder(NullDigraph(2), NullDigraph(3), fail,\n> [], infinity, fail, 1, [\ 1, 2, 3], fail, fail, fail, fail,\n> Group((1, 2)));\n[ IdentityTransformation\ , Transformation( [ 1, 3, 3 ] ), \n Transformation( [ 3, 1, 3 ] ) ]", count := [ 7, 3, 1, 35 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 1, 35 ], mathmode := "Text", name := "Example", next := 334163, root := ~, start := 332614, stop := 334162 ), rec( content := "\n ", count := [ 7, 3, 1, 36 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 1, 3 ], mathmode := "Text", name := "Description", next := 334180, root := ~, start := 327007, stop := 334179 ) ], count := [ 7, 3, 1, 1 ], mathmode := "Text", name := "ManSection", next := 334194, root := ~, start := 326778, stop := 334193 ), rec( content := "\n\n ", count := [ 7, 3, 1, 36 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "DigraphHomomorphism" ), content := 0, count := [ 7, 3, 2, 2 ], mathmode := "Text", name := "Oper", next := 334274, root := ~, start := 334215, stop := 334273 ), rec( attributes := rec( ), content := [ rec( content := " A transf\ ormation, or ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "K", next := 334319, root := ~, start := 334308, stop := 334318 ), rec( content := ".", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "Returns", next := 334330, root := ~, start := 334277, stop := 334329 ), rec( attributes := rec( ), content := [ rec( content := "\n A h\ omomorphism from ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "A", next := 334386, root := ~, start := 334371, stop := 334385 ), rec( content := " to ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "A", next := 334405, root := ~, start := 334390, stop := 334404 ), rec( content := " is a ma\ pping from\n the vertex set of ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "A", next := 334461, root := ~, start := 334446, stop := 334460 ), rec( content := " to a su\ bset of the vertices of\n ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "A", next := 334512, root := ~, start := 334497, stop := 334511 ), rec( content := ", such t\ hat every pair of vertices ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i,j]", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "C", next := 334559, root := ~, start := 334547, stop := 334558 ), rec( content := " which h\ as\n an edge ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ->j", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "C", next := 334593, root := ~, start := 334582, stop := 334592 ), rec( content := " is mapp\ ed to a pair of vertices ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ a,b]", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "C", next := 334638, root := ~, start := 334626, stop := 334637 ), rec( content := " which\n\ has an edge ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ ->b", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "C", next := 334672, root := ~, start := 334661, stop := 334671 ), rec( content := ". Note \ that non-adjacent vertices can still be\n mapped to adjacent vertices. ", count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "P", next := 334757, root := ~, start := 334753, stop := 334756 ), rec( content := "\n\n \ ", count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphHomomorphism", count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "C", next := 334789, root := ~, start := 334763, stop := 334788 ), rec( content := " returns\ a single homomorphism between\n ", count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "A", next := 334847, root := ~, start := 334832, stop := 334846 ), rec( content := " and ", count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "A", next := 334867, root := ~, start := 334852, stop := 334866 ), rec( content := " if it e\ xists, otherwise it returns\n ", count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "K", next := 334918, root := ~, start := 334907, stop := 334917 ), rec( content := ".\n", count := [ 7, 3, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := ChainDigraph(3);;\ngap> gr2 := Digraph([[3, 5], [2], [3, 1], [], \ [4]]);\n\ngap> DigraphHomomorphism\ (gr1, gr1);\nIdentityTransformation\ngap> map := DigraphHomomorphism(gr1, gr2)\ ;\nTransformation( [ 3, 1, 5, 4, 5 ] )\ngap> IsDigraphHomomorphism(gr1, gr2, m\ ap);\ntrue\n", count := [ 7, 3, 2, 5 ], name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 5 ], mathmode := "Text", name := "Example", next := 335266, root := ~, start := 334920, stop := 335265 ), rec( content := "\n ", count := [ 7, 3, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 2, 3 ], mathmode := "Text", name := "Description", next := 335283, root := ~, start := 334333, stop := 335282 ) ], count := [ 7, 3, 2, 1 ], mathmode := "Text", name := "ManSection", next := 335297, root := ~, start := 334200, stop := 335296 ), rec( content := "\n\n ", count := [ 7, 3, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "HomomorphismsDigraphs" ), content := 0, count := [ 7, 3, 3, 2 ], mathmode := "Text", name := "Oper", next := 335379, root := ~, start := 335318, stop := 335378 ), rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "HomomorphismsDigraphsRepresentatives" ), content := 0, count := [ 7, 3, 3, 4 ], mathmode := "Text", name := "Oper", next := 335458, root := ~, start := 335382, stop := 335457 ), rec( attributes := rec( ), content := [ rec( content := " A list o\ f transformations.", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "Returns", next := 335507, root := ~, start := 335461, stop := 335506 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ omomorphismsDigraphsRepresentatives", count := [ 7, 3, 3, 5 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "C", next := 335571, root := ~, start := 335528, stop := 335570 ), rec( content := " finds e\ very\n ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Homomorphism" ), content := 0, count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "Ref", next := 335621, root := ~, start := 335588, stop := 335620 ), rec( content := " between\ ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "A", next := 335645, root := ~, start := 335630, stop := 335644 ), rec( content := " and\n \ ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "A", next := 335669, root := ~, start := 335654, stop := 335668 ), rec( content := ", up to \ right multiplication by an element of the\n ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 7, 3, 3, 5 ] , mathmode := "Text", name := "Ref", next := 335776, root := ~, start := 335723, stop := 335775 ), rec( content := " of ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "A", next := 335795, root := ~, start := 335780, stop := 335794 ), rec( content := ".\n I\ n other words, every homomorphism ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "C", next := 335844, root := ~, start := 335836, stop := 335843 ), rec( content := " between\ ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "A", next := 335868, root := ~, start := 335853, stop := 335867 ), rec( content := " and\n \ ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "A", next := 335892, root := ~, start := 335877, stop := 335891 ), rec( content := " can be \ written as the composition ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ = g * x", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "C", next := 335943, root := ~, start := 335927, stop := 335942 ), rec( content := ",\n w\ here ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "g\ ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "C", next := 335963, root := ~, start := 335955, stop := 335962 ), rec( content := " is one \ of the ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ omomorphismsDigraphsRepresentatives", count := [ 7, 3, 3, 5 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "C", next := 336021, root := ~, start := 335978, stop := 336020 ), rec( content := "\n an\ d ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "C", next := 336038, root := ~, start := 336030, stop := 336037 ), rec( content := " is an a\ utomorphism of ", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "A", next := 336076, root := ~, start := 336061, stop := 336075 ), rec( content := ".\n " , count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "P", next := 336086, root := ~, start := 336082, stop := 336085 ), rec( content := "\n\n \ ", count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "H\ omomorphismsDigraphs", count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "C", next := 336120, root := ~, start := 336092, stop := 336119 ), rec( content := " returns\ all homomorphisms between\n ", count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "A", next := 336174, root := ~, start := 336159, stop := 336173 ), rec( content := " and ", count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "A", next := 336194, root := ~, start := 336179, stop := 336193 ), rec( content := ".\n " , count := [ 7, 3, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := ChainDigraph(3);;\ngap> gr2 := Digraph([[3, 5], [2], [3, 1], [], \ [4]]);\n\ngap> HomomorphismsDigrap\ hs(gr1, gr2);\n[ Transformation( [ 1, 3, 1 ] ), Transformation( [ 1, 3, 3 ] ),\ \n Transformation( [ 1, 5, 4, 4, 5 ] ), Transformation( [ 2, 2, 2 ] ), \n T\ ransformation( [ 3, 1, 3 ] ), Transformation( [ 3, 1, 5, 4, 5 ] ), \n Transfo\ rmation( [ 3, 3, 1 ] ), Transformation( [ 3, 3, 3 ] ) ]\ngap> HomomorphismsDig\ raphsRepresentatives(gr1, CompleteDigraph(3));\n[ Transformation( [ 2, 1 ] ), \ Transformation( [ 2, 1, 2 ] ) ]\n", count := [ 7, 3, 3, 7 ], name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 7 ], mathmode := "Text", name := "Example", next := 336800, root := ~, start := 336200, stop := 336799 ), rec( content := "\n ", count := [ 7, 3, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 3, 5 ], mathmode := "Text", name := "Description", next := 336817, root := ~, start := 335510, stop := 336816 ) ], count := [ 7, 3, 3, 1 ], mathmode := "Text", name := "ManSection", next := 336831, root := ~, start := 335303, stop := 336830 ), rec( content := "\n\n ", count := [ 7, 3, 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "DigraphMonomorphism" ), content := 0, count := [ 7, 3, 4, 2 ], mathmode := "Text", name := "Oper", next := 336911, root := ~, start := 336852, stop := 336910 ), rec( attributes := rec( ), content := [ rec( content := "A transfo\ rmation, or ", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "K", next := 336955, root := ~, start := 336944, stop := 336954 ), rec( content := ".", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "Returns", next := 336966, root := ~, start := 336914, stop := 336965 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphMonomorphism", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "C", next := 337013, root := ~, start := 336987, stop := 337012 ), rec( content := " returns\ a single ", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ njective", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "E", next := 337047, root := ~, start := 337031, stop := 337046 ), rec( content := " ", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Homomorphism" ), content := 0, count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "Ref", next := 337087, root := ~, start := 337048, stop := 337086 ), rec( content := " between\ ", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "A", next := 337111, root := ~, start := 337096, stop := 337110 ), rec( content := " and ", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "A", next := 337131, root := ~, start := 337116, stop := 337130 ), rec( content := "\n if\ one exists, otherwise it returns ", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "K", next := 337183, root := ~, start := 337172, stop := 337182 ), rec( content := ".\n " , count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := ChainDigraph(3);;\ngap> gr2 := Digraph([[3, 5], [2], [3, 1], [], \ [4]]);\n\ngap> DigraphMonomorphism\ (gr1, gr1);\nIdentityTransformation\ngap> DigraphMonomorphism(gr1, gr2);\nTran\ sformation( [ 3, 1, 5, 4, 5 ] )\n", count := [ 7, 3, 4, 4 ], name := "PCDATA", root := ~ ) ], count := [ 7, 3, 4, 4 ], mathmode := "Text", name := "Example", next := 337480, root := ~, start := 337189, stop := 337479 ), rec( content := "\n ", count := [ 7, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 4, 3 ], mathmode := "Text", name := "Description", next := 337497, root := ~, start := 336969, stop := 337496 ) ], count := [ 7, 3, 4, 1 ], mathmode := "Text", name := "ManSection", next := 337511, root := ~, start := 336837, stop := 337510 ), rec( content := "\n\n ", count := [ 7, 3, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "MonomorphismsDigraphs" ), content := 0, count := [ 7, 3, 5, 2 ], mathmode := "Text", name := "Oper", next := 337593, root := ~, start := 337532, stop := 337592 ), rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "MonomorphismsDigraphsRepresentatives" ), content := 0, count := [ 7, 3, 5, 4 ], mathmode := "Text", name := "Oper", next := 337672, root := ~, start := 337596, stop := 337671 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ transformations.", count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "Returns", next := 337720, root := ~, start := 337675, stop := 337719 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ se operations behave the same as ", count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Homomor\ phismsDigraphs" ), content := 0, count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "Ref", next := 337812, root := ~, start := 337777, stop := 337811 ), rec( content := " and\n \ ", count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Homomor\ phismsDigraphsRepresentatives" ), content := 0, count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "Ref", next := 337871, root := ~, start := 337821, stop := 337870 ), rec( content := ", except\ they only return\n ", count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ njective", count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "E", next := 337917, root := ~, start := 337901, stop := 337916 ), rec( content := " homomor\ phisms.\n ", count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := ChainDigraph(3);;\ngap> gr2 := Digraph([[3, 5], [2], [3, 1], [], \ [4]]);\n\ngap> MonomorphismsDigrap\ hs(gr1, gr2);\n[ Transformation( [ 1, 5, 4, 4, 5 ] ), \n Transformation( [ 3,\ 1, 5, 4, 5 ] ) ]\ngap> MonomorphismsDigraphsRepresentatives(gr1, CompleteDigr\ aph(3));\n[ Transformation( [ 2, 1 ] ) ]\n", count := [ 7, 3, 5, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 5, 6 ], mathmode := "Text", name := "Example", next := 338314, root := ~, start := 337937, stop := 338313 ), rec( content := "\n ", count := [ 7, 3, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 5, 5 ], mathmode := "Text", name := "Description", next := 338331, root := ~, start := 337723, stop := 338330 ) ], count := [ 7, 3, 5, 1 ], mathmode := "Text", name := "ManSection", next := 338345, root := ~, start := 337517, stop := 338344 ), rec( content := "\n\n ", count := [ 7, 3, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "DigraphEpimorphism" ), content := 0, count := [ 7, 3, 6, 2 ], mathmode := "Text", name := "Oper", next := 338424, root := ~, start := 338366, stop := 338423 ), rec( attributes := rec( ), content := [ rec( content := "A transfo\ rmation, or ", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "K", next := 338468, root := ~, start := 338457, stop := 338467 ), rec( content := ".", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "Returns", next := 338479, root := ~, start := 338427, stop := 338478 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEpimorphism", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "C", next := 338525, root := ~, start := 338500, stop := 338524 ), rec( content := " returns\ a single ", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ urjective", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "E", next := 338560, root := ~, start := 338543, stop := 338559 ), rec( content := " ", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Homomorphism" ), content := 0, count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "Ref", next := 338600, root := ~, start := 338561, stop := 338599 ), rec( content := " between\ ", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "A", next := 338624, root := ~, start := 338609, stop := 338623 ), rec( content := " and ", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "A", next := 338644, root := ~, start := 338629, stop := 338643 ), rec( content := "\n if\ one exists, otherwise it returns ", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "K", next := 338696, root := ~, start := 338685, stop := 338695 ), rec( content := ".\n " , count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := DigraphReverse(ChainDigraph(4));\n\ngap> gr2 := DigraphRemoveEdge(CompleteDigraph(3), [1, 2]);\n\ngap> DigraphEpimorphism(gr2, gr1);\ \nfail\ngap> DigraphEpimorphism(gr1, gr2);\nTransformation( [ 3, 1, 2, 3 ] )\n\ ", count := [ 7, 3, 6, 4 ], name := "PCDATA", root := ~ ) ], count := [ 7, 3, 6, 4 ], mathmode := "Text", name := "Example", next := 339036, root := ~, start := 338702, stop := 339035 ), rec( content := "\n ", count := [ 7, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 6, 3 ], mathmode := "Text", name := "Description", next := 339053, root := ~, start := 338482, stop := 339052 ) ], count := [ 7, 3, 6, 1 ], mathmode := "Text", name := "ManSection", next := 339067, root := ~, start := 338351, stop := 339066 ), rec( content := "\n\n ", count := [ 7, 3, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "EpimorphismsDigraphs" ), content := 0, count := [ 7, 3, 7, 2 ], mathmode := "Text", name := "Oper", next := 339148, root := ~, start := 339088, stop := 339147 ), rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "EpimorphismsDigraphsRepresentatives" ), content := 0, count := [ 7, 3, 7, 4 ], mathmode := "Text", name := "Oper", next := 339226, root := ~, start := 339151, stop := 339225 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ transformations.", count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "Returns", next := 339274, root := ~, start := 339229, stop := 339273 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ se operations behave the same as ", count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Homomor\ phismsDigraphs" ), content := 0, count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "Ref", next := 339366, root := ~, start := 339331, stop := 339365 ), rec( content := " and\n \ ", count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Homomor\ phismsDigraphsRepresentatives" ), content := 0, count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "Ref", next := 339425, root := ~, start := 339375, stop := 339424 ), rec( content := ", except\ they only return\n ", count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ urjective", count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "E", next := 339472, root := ~, start := 339455, stop := 339471 ), rec( content := " homomor\ phisms.\n ", count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr1 := DigraphReverse(ChainDigraph(4));\n\ngap> gr2 := DigraphSymmetricClosure(CycleDigraph(3));\n\ngap> EpimorphismsDigraphsRepre\ sentatives(gr1, gr2);\n[ Transformation( [ 3, 1, 2, 1 ] ), Transformation( [ 3\ , 1, 2, 3 ] ), \n Transformation( [ 2, 1, 2, 3 ] ) ]\ngap> EpimorphismsDigrap\ hs(gr1, gr2);\n[ Transformation( [ 1, 2, 1, 3 ] ), Transformation( [ 1, 2, 3, \ 1 ] ), \n Transformation( [ 1, 2, 3, 2 ] ), Transformation( [ 1, 3, 1, 2 ] ),\ \n Transformation( [ 1, 3, 2, 1 ] ), Transformation( [ 1, 3, 2, 3 ] ), \n T\ ransformation( [ 2, 1, 2, 3 ] ), Transformation( [ 2, 1, 3, 1 ] ), \n Transfo\ rmation( [ 2, 1, 3, 2 ] ), Transformation( [ 2, 3, 1, 2 ] ), \n Transformatio\ n( [ 2, 3, 1, 3 ] ), Transformation( [ 2, 3, 2, 1 ] ), \n Transformation( [ 3\ , 1, 2, 1 ] ), Transformation( [ 3, 1, 2, 3 ] ), \n Transformation( [ 3, 1, 3\ , 2 ] ), Transformation( [ 3, 2, 1, 2 ] ), \n Transformation( [ 3, 2, 1, 3 ] \ ), Transformation( [ 3, 2, 3, 1 ] ) ]\n", count := [ 7, 3, 7, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 7, 6 ], mathmode := "Text", name := "Example", next := 340559, root := ~, start := 339492, stop := 340558 ), rec( content := "\n ", count := [ 7, 3, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 7, 5 ], mathmode := "Text", name := "Description", next := 340576, root := ~, start := 339277, stop := 340575 ) ], count := [ 7, 3, 7, 1 ], mathmode := "Text", name := "ManSection", next := 340590, root := ~, start := 339073, stop := 340589 ), rec( content := "\n\n ", count := [ 7, 3, 7, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph1, digrap\ h2", Name := "DigraphEmbedding" ), content := 0, count := [ 7, 3, 8, 2 ], mathmode := "Text", name := "Oper", next := 340667, root := ~, start := 340611, stop := 340666 ), rec( attributes := rec( ), content := [ rec( content := " A transf\ ormation, or ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "K", next := 340712, root := ~, start := 340701, stop := 340711 ), rec( content := ".", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "Returns", next := 340723, root := ~, start := 340670, stop := 340722 ), rec( attributes := rec( ), content := [ rec( content := "\n An \ embedding of a digraph ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "A", next := 340785, root := ~, start := 340770, stop := 340784 ), rec( content := " into an\ other digraph\n ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "A", next := 340826, root := ~, start := 340811, stop := 340825 ), rec( content := " is a ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Monomorphism" ), content := 0, count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "Ref", next := 340865, root := ~, start := 340832, stop := 340864 ), rec( content := " from ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "A", next := 340886, root := ~, start := 340871, stop := 340885 ), rec( content := "\n to\ ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "A", next := 340909, root := ~, start := 340894, stop := 340908 ), rec( content := " which h\ as the additional property that a pair of\n vertices ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i, j]", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "C", next := 340985, root := ~, start := 340972, stop := 340984 ), rec( content := " which h\ ave no edge ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ -> j", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "C", next := 341018, root := ~, start := 341005, stop := 341017 ), rec( content := " in ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "A", next := 341037, root := ~, start := 341022, stop := 341036 ), rec( content := " are\n\n\ mapped to a pair of vertices ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ a, b]", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "C", next := 341089, root := ~, start := 341076, stop := 341088 ), rec( content := " which h\ ave no edge ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "a\ ->b", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "C", next := 341120, root := ~, start := 341109, stop := 341119 ), rec( content := " in\n \ ", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "A", next := 341143, root := ~, start := 341128, stop := 341142 ), rec( content := ".", count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "P", next := 341148, root := ~, start := 341144, stop := 341147 ), rec( content := "\n\n \ In other words, an embedding ", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ ", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "C", next := 341191, root := ~, start := 341183, stop := 341190 ), rec( content := " is an i\ somorphism from\n ", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph1", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "A", next := 341234, root := ~, start := 341219, stop := 341233 ), rec( content := " to the \ ", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Induced\ Subdigraph" ), content := 0, count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "Ref", next := 341273, root := ~, start := 341242, stop := 341272 ), rec( content := " of ", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph2", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "A", next := 341292, root := ~, start := 341277, stop := 341291 ), rec( content := "\n on\ the image of ", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ ", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "C", next := 341321, root := ~, start := 341313, stop := 341320 ), rec( content := ". ", count := [ 7, 3, 8, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 8, 5 ], mathmode := "Text", name := "P", next := 341327, root := ~, start := 341323, stop := 341326 ), rec( content := "\n\n \ ", count := [ 7, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphEmbedding", count := [ 7, 3, 8, 5 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 3, 8, 5 ], mathmode := "Text", name := "C", next := 341356, root := ~, start := 341333, stop := 341355 ), rec( content := " returns\ a single embedding if one exists, otherwise\n it returns ", count := [ 7, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 5 ], mathmode := "Text", name := "K", next := 341435, root := ~, start := 341424, stop := 341434 ), rec( content := ".\n " , count := [ 7, 3, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := ChainDigraph(3);\n\ngap> \ DigraphEmbedding(gr, CompleteDigraph(4));\nfail\ngap> DigraphEmbedding(gr, Dig\ raph([[3], [1, 4], [1], [3]]));\nTransformation( [ 2, 4, 3, 4 ] )\n", count := [ 7, 3, 8, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 8, 6 ], mathmode := "Text", name := "Example", next := 341689, root := ~, start := 341441, stop := 341688 ), rec( content := "\n ", count := [ 7, 3, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 8, 3 ], mathmode := "Text", name := "Description", next := 341706, root := ~, start := 340726, stop := 341705 ) ], count := [ 7, 3, 8, 1 ], mathmode := "Text", name := "ManSection", next := 341720, root := ~, start := 340596, stop := 341719 ), rec( content := "\n\n ", count := [ 7, 3, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "D1, D2", Name := "EmbeddingsDigra\ phs" ), content := 0, count := [ 7, 3, 9, 2 ], mathmode := "Text", name := "Oper", next := 341787, root := ~, start := 341741, stop := 341786 ), rec( attributes := rec( Arg := "D1, D2", Name := "EmbeddingsDigra\ phsRepresentatives" ), content := 0, count := [ 7, 3, 9, 4 ], mathmode := "Text", name := "Oper", next := 341851, root := ~, start := 341790, stop := 341850 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ transformations.", count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "Returns", next := 341899, root := ~, start := 341854, stop := 341898 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ se operations behave the same as ", count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Homomor\ phismsDigraphs" ), content := 0, count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "Ref", next := 341991, root := ~, start := 341956, stop := 341990 ), rec( content := " and\n \ ", count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Homomor\ phismsDigraphsRepresentatives" ), content := 0, count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "Ref", next := 342050, root := ~, start := 342000, stop := 342049 ), rec( content := ", except\ they only return\n embeddings of ", count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 1", count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "A", next := 342103, root := ~, start := 342094, stop := 342102 ), rec( content := " into ", count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ 2", count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "A", next := 342118, root := ~, start := 342109, stop := 342117 ), rec( content := ".", count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 9, 6 ], mathmode := "Text", name := "P", next := 342123, root := ~, start := 342119, stop := 342122 ), rec( content := "\n\n \ See also ", count := [ 7, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsDigra\ phEmbedding" ), content := 0, count := [ 7, 3, 9, 6 ], mathmode := "Text", name := "Ref", next := 342170, root := ~, start := 342138, stop := 342169 ), rec( content := ".\n " , count := [ 7, 3, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D1 := NullDigraph(2);\n\ngap> D\ 2 := CycleDigraph(5);\n\ngap> Embeddi\ ngsDigraphsRepresentatives(D1, D2);\n[ Transformation( [ 1, 3, 3 ] ), Transfor\ mation( [ 1, 4, 3, 4 ] ) ]\ngap> EmbeddingsDigraphs(D1, D2);\n[ Transformation\ ( [ 1, 3, 3 ] ), Transformation( [ 1, 4, 3, 4 ] ), \n Transformation( [ 2, 4,\ 4, 5, 1 ] ), \n Transformation( [ 2, 5, 4, 5, 1 ] ), \n Transformation( [ 3\ , 1, 5, 1, 2 ] ), \n Transformation( [ 3, 5, 5, 1, 2 ] ), \n Transformation(\ [ 4, 1, 1, 2, 3 ] ), \n Transformation( [ 4, 2, 1, 2, 3 ] ), \n Transformat\ ion( [ 5, 2, 2, 3, 4 ] ), \n Transformation( [ 5, 3, 2, 3, 4 ] ) ]\n", count := [ 7, 3, 9, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 9, 7 ], mathmode := "Text", name := "Example", next := 342884, root := ~, start := 342176, stop := 342883 ), rec( content := "\n ", count := [ 7, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 9, 5 ], mathmode := "Text", name := "Description", next := 342901, root := ~, start := 341902, stop := 342900 ) ], count := [ 7, 3, 9, 1 ], mathmode := "Text", name := "ManSection", next := 342915, root := ~, start := 341726, stop := 342914 ), rec( content := "\n\n ", count := [ 7, 3, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "src, ran, x", Label := "for digraphs a\ nd a permutation or transformation", Name := "IsDigraphHomomorphism" ), content := 0, count := [ 7, 3, 10, 2 ], mathmode := "Text", name := "Oper", next := 343056, root := ~, start := 342936, stop := 343055 ), rec( attributes := rec( Arg := "src, ran, x, col\ 1, col2", Name := "IsDigraphHomomorphism" ), content := 0, count := [ 7, 3, 10, 4 ], mathmode := "Text", name := "Oper", next := 343125, root := ~, start := 343059, stop := 343124 ), rec( attributes := rec( Arg := "src, ran, x", Label := "for digraphs a\ nd a permutation or transformation", Name := "IsDigraphEpimorphism" ), content := 0, count := [ 7, 3, 10, 6 ], mathmode := "Text", name := "Oper", next := 343246, root := ~, start := 343128, stop := 343245 ), rec( attributes := rec( Arg := "src, ran, x, col\ 1, col2", Name := "IsDigraphEpimorphism" ), content := 0, count := [ 7, 3, 10, 8 ], mathmode := "Text", name := "Oper", next := 343314, root := ~, start := 343249, stop := 343313 ), rec( attributes := rec( Arg := "src, ran, x", Label := "for digraphs a\ nd a permutation or transformation", Name := "IsDigraphMonomorphism" ), content := 0, count := [ 7, 3, 10, 10 ], mathmode := "Text", name := "Oper", next := 343436, root := ~, start := 343317, stop := 343435 ), rec( attributes := rec( Arg := "src, ran, x, col\ 1, col2", Name := "IsDigraphMonomorphism" ), content := 0, count := [ 7, 3, 10, 12 ], mathmode := "Text", name := "Oper", next := 343505, root := ~, start := 343439, stop := 343504 ), rec( attributes := rec( Arg := "digraph, x", Label := "for digraphs a\ nd a permutation or transformation", Name := "IsDigraphEndomorphism" ), content := 0, count := [ 7, 3, 10, 14 ], mathmode := "Text", name := "Oper", next := 343626, root := ~, start := 343508, stop := 343625 ), rec( attributes := rec( Arg := "digraph, x, col" , Name := "IsDigraphEndomo\ rphism" ), content := 0, count := [ 7, 3, 10, 16 ], mathmode := "Text", name := "Oper", next := 343687, root := ~, start := 343629, stop := 343686 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "K", next := 343710, root := ~, start := 343699, stop := 343709 ), rec( content := " or ", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "K", next := 343726, root := ~, start := 343714, stop := 343725 ), rec( content := ".", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "Returns", next := 343737, root := ~, start := 343690, stop := 343736 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphHomomorphism", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "C", next := 343786, root := ~, start := 343758, stop := 343785 ), rec( content := " returns\ ", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "K", next := 343806, root := ~, start := 343795, stop := 343805 ), rec( content := " if the \ permutation\n or transformation ", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "A", next := 343856, root := ~, start := 343848, stop := 343855 ), rec( content := " is a ho\ momorphism from the digraph\n ", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "A", next := 343906, root := ~, start := 343896, stop := 343905 ), rec( content := " to the \ digraph ", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "A", next := 343932, root := ~, start := 343922, stop := 343931 ), rec( content := ".\n " , count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "P", next := 343942, root := ~, start := 343938, stop := 343941 ), rec( content := "\n\n \ ", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphEpimorphism", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "C", next := 343975, root := ~, start := 343948, stop := 343974 ), rec( content := " returns\ ", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "K", next := 343995, root := ~, start := 343984, stop := 343994 ), rec( content := " if the \ permutation\n or transformation ", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "A", next := 344045, root := ~, start := 344037, stop := 344044 ), rec( content := " is a su\ rjective homomorphism from the digraph\n ", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "A", next := 344106, root := ~, start := 344096, stop := 344105 ), rec( content := " to the \ digraph ", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "A", next := 344132, root := ~, start := 344122, stop := 344131 ), rec( content := ".\n " , count := [ 7, 3, 10, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "P", next := 344142, root := ~, start := 344138, stop := 344141 ), rec( content := "\n\n \ ", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphMonomorphism", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "C", next := 344176, root := ~, start := 344148, stop := 344175 ), rec( content := " returns\ ", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "K", next := 344196, root := ~, start := 344185, stop := 344195 ), rec( content := " if the \ permutation\n or transformation ", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "A", next := 344246, root := ~, start := 344238, stop := 344245 ), rec( content := " is an i\ njective homomorphism from the digraph\n ", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "A", next := 344307, root := ~, start := 344297, stop := 344306 ), rec( content := " to the \ digraph ", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "A", next := 344333, root := ~, start := 344323, stop := 344332 ), rec( content := ".\n " , count := [ 7, 3, 10, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "P", next := 344343, root := ~, start := 344339, stop := 344342 ), rec( content := "\n\n \ ", count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphEndomorphism", count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "C", next := 344377, root := ~, start := 344349, stop := 344376 ), rec( content := " returns\ ", count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "K", next := 344397, root := ~, start := 344386, stop := 344396 ), rec( content := " if the \ permutation\n or transformation ", count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "A", next := 344447, root := ~, start := 344439, stop := 344446 ), rec( content := " is an e\ ndomorphism of the digraph\n ", count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "A", next := 344500, root := ~, start := 344486, stop := 344499 ), rec( content := ".\n " , count := [ 7, 3, 10, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "P", next := 344510, root := ~, start := 344506, stop := 344509 ), rec( content := "\n\n \ A permutation or transformation ", count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "A", next := 344556, root := ~, start := 344548, stop := 344555 ), rec( content := " is a ", count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ omomorphism", count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "E", next := 344581, root := ~, start := 344562, stop := 344580 ), rec( content := " from a\\ n digraph ", count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "A", next := 344611, root := ~, start := 344601, stop := 344610 ), rec( content := " to a di\ graph ", count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "A", next := 344635, root := ~, start := 344625, stop := 344634 ), rec( content := " if the \ following hold:\n ", count := [ 7, 3, 10, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 7, 3, 10, 23 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "[u ^ ", count := [ 7, 3, 10, 23 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec\ ( content := "x", count := [ 7, 3, 10, 23 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 7, 3, 10, 23 ], mathmode := "Text", name := "A"\ , next := 344707, root := ~, start := 344699, stop := 344706 ), rec( content :\ = ", v ^ ", count := [ 7, 3, 10, 23 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ), rec( attributes := rec( ), content := [ rec( content := "x", coun\ t := [ 7, 3, 10, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], co\ unt := [ 7, 3, 10, 23 ], mathmode := "Text", name := "A", next := 344721, root\ := ~, start := 344713, stop := 344720 ), rec( content := "]", count := [ 7, 3\ , 10, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7,\ 3, 10, 23 ], mathmode := "Text", name := "C", next := 344726, root := ~, star\ t := 344691, stop := 344725 ), rec( content := " is an edge of\n ", coun\ t := [ 7, 3, 10, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "ran", count := [ 7, 3, 10, 23\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, \ 23 ], mathmode := "Text", name := "A", next := 344759, root := ~, start := 344\ 749, stop := 344758 ), rec( content := " whenever ", count := [ 7, 3, 10, 23 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "[u, v]", count := [ 7, 3, 10, 23 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 23 ], mathmode := "T\ ext", name := "C", next := 344782, root := ~, start := 344769, stop := 344781 ), rec( cont\ ent := " is an\n edge of ", count := [ 7, 3, 10, 23 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ re\ c( content := "src", count := [ 7, 3, 10, 23 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 7, 3, 10, 23 ], mathmode := "Text", name := \ "A", next := 344815, root := ~, start := 344805, stop := 344814 ), rec( conten\ t := "; and ", count := [ 7, 3, 10, 23 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 7, 3, 10, 23 ], name := "Item", next := 344828, root := ~, start := 344\ 676, stop := 344827 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n ", count := [ 7, 3, 10, 25 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x", \ count := [ 7, 3, 10, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ] , coun\ t := [ 7, 3, 10, 25 ], mathmode := "Text", name := "A", next := 344858, root :\ = ~, start := 344850, stop := 344857 ), rec( content := " fixes every ", count\ := [ 7, 3, 10, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "i", count := [ 7, 3, 10, 25 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 25\ ], mathmode := "Text", name := "C", next := 344879, root := ~, start := 34487\ 1, stop := 344878 ), rec( content := " which is not a vertex of ", count := [ \ 7, 3, 10, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attrib\ utes := rec( ), content := [ rec( content := "src", count := [ 7, 3, 10, 25 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 25\ ], mathmode := "Text", name := "A", next := 344915, root := ~, start := 34490\ 5, stop := 344914 ), rec( content := ".\n ", count := [ 7, 3, 10, 25 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 25 ], name := "Ite\ m", next := 344930, root := ~, start := 344835, stop := 344929 ) ], count := [ 7, 3, 10, 22 ], mathmode := "Text", name := "List", next := 344942, root := ~, start := 344663, stop := 344941 ), rec( content := "\n Se\ e also ", count := [ 7, 3, 10, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Generat\ orsOfEndomorphismMonoid" ), content := 0, count := [ 7, 3, 10, 27 ], mathmode := "Text", name := "Ref", next := 345000, root := ~, start := 344956, stop := 344999 ), rec( content := ".", count := [ 7, 3, 10, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "P", next := 345005, root := ~, start := 345001, stop := 345004 ), rec( content := "\n\n\n \ If ", count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol1", count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "A", next := 345026, root := ~, start := 345015, stop := 345025 ), rec( content := " and ", count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol2", count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "A", next := 345042, root := ~, start := 345031, stop := 345041 ), rec( content := ", or ", count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol", count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "A", next := 345057, root := ~, start := 345047, stop := 345056 ), rec( content := ", are gi\ ven, then they must\n represent vertex colourings; see \n ", count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and a homogeneous list", Oper := "AutomorphismGroup" ), content := 0, count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "Ref", next := 345203, root := ~, start := 345127, stop := 345202 ), rec( content := " \n f\ or details of the permissible values for these argument. The\n homomorphism\ must then also have the property:\n \n ", count := [ 7, 3, 10, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n ", count := [ 7, 3, 10, 30 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "col[i] = col[i ^ x]", count := [ 7, 3, 10, 30 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 30 ], math\ mode := "Text", name := "C", next := 345383, root := ~, start := 345357, stop \ := 345382 ), rec( content := " for all vertices ", count := [ 7, 3, 10, 30 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "i", count := [ 7, 3, 10, 30 ], mathmode := "Text", n\ ame := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 30 ], mathmode := "Text", name\ := "C", next := 345409, root := ~, start := 345401, stop := 345408 ), rec( cont\ ent := " of ", count := [ 7, 3, 10, 30 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", c\ ount := [ 7, 3, 10, 30 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 3, 10, 30 ], mathmode := "Text", name := "A", next := 345427, root :\ = ~, start := 345413, stop := 345426 ), rec( content := ",\n in the cas\ e of ", count := [ 7, 3, 10, 30 ], mathmode := "Text", name := "PCDATA", root \ := ~ ), rec( attributes := rec( ), content := [ rec( content := "IsDigraphEnd\ omorphism", count := [ 7, 3, 10, 30 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 7, 3, 10, 30 ], mathmode := "Text", name := "C", next\ := 345480, root := ~, start := 345452, stop := 345479 ), rec( content := ".", coun\ t := [ 7, 3, 10, 30 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 30 ] , name := "Ite\ m", next := 345488, root := ~, start := 345342, stop := 345487 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n ", count := [ 7, 3, 10, 32 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "col1[i] = col2[i ^ x]", count := [ 7, 3, 10, 32 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 32 ], math\ mode := "Text", name := "C", next := 345538, root := ~, start := 345510, stop \ := 345537 ), rec( content := " for all vertices ", count := [ 7, 3, 10, 32 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "i", count := [ 7, 3, 10, 32 ], mathmode := "Text", n\ ame := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 32 ], mathmode := "Text", name\ := "C", next := 345564, root := ~, start := 345556, stop := 345563 ), rec( cont\ ent := " of ", count := [ 7, 3, 10, 32 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "src", count\ := [ 7, 3, 10, 32 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 7, 3, 10, 32 ], mathmode := "Text", name := "A", next := 345578, root :\ = ~, start := 345568, stop := 345577 ), rec( content := ",\n in the cas\ es of the other operations.", count := [ 7, 3, 10, 32 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 32 ], name := "Item", next := 3456\ 32, root := ~, start := 345495, stop := 345631 ) ], count := [ 7, 3, 10, 29 ], mathmode := "Text", name := "List", next := 345644, root := ~, start := 345329, stop := 345643 ), rec( content := "\n\n \ See also ", count := [ 7, 3, 10, 34 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ sRespectsColouring" ), content := 0, count := [ 7, 3, 10, 34 ], mathmode := "Text", name := "Ref", next := 345698, root := ~, start := 345659, stop := 345697 ), rec( content := ".\n \\ n ", count := [ 7, 3, 10, 34 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> src := Digraph([[1], [1, 2], [1, 3]]);\n\ngap> ran := Digraph([[1], [1, 2]]);\n\ngap> IsDigraphHomomorphism(src, ran, Transformation([1, 2, \ 2]));\ntrue\ngap> IsDigraphHomomorphism(src, ran, Transformation([2, 1, 2]));\ \nfalse\ngap> IsDigraphHomomorphism(src, ran, Transformation([3, 3, 3]));\nfal\ se\ngap> IsDigraphHomomorphism(src, src, Transformation([3, 3, 3]));\ntrue\nga\ p> IsDigraphHomomorphism(src, ran, Transformation([1, 2, 2]),\n> \ [1, 2, 2], [1, 2]);\ntrue\ngap> IsDigraphHomomorphism(src, ran, Tr\ ansformation([1, 2, 2]),\n> [2, 1, 1], [1, 2]);\nfals\ e\ngap> IsDigraphEndomorphism(src, Transformation([3, 3, 3]));\ntrue\ngap> IsD\ igraphEndomorphism(src, Transformation([3, 3, 3]), [1, 1, 1]);\ntrue\ngap> IsD\ igraphEndomorphism(src, Transformation([3, 3, 3]), [1, 1, 2]);\nfalse\ngap> Is\ DigraphEpimorphism(src, ran, Transformation([3, 3, 3]));\nfalse\ngap> IsDigrap\ hMonomorphism(src, ran, Transformation([1, 2, 2]));\nfalse\ngap> IsDigraphEpim\ orphism(src, ran, Transformation([1, 2, 2]));\ntrue\ngap> IsDigraphMonomorphis\ m(ran, src, ());\ntrue", count := [ 7, 3, 10, 35 ], name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 35 ], mathmode := "Text", name := "Example", next := 346900, root := ~, start := 345709, stop := 346899 ), rec( content := "\n ", count := [ 7, 3, 10, 36 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 10, 17 ], mathmode := "Text", name := "Description", next := 346917, root := ~, start := 343740, stop := 346916 ) ], count := [ 7, 3, 10, 1 ], mathmode := "Text", name := "ManSection", next := 346931, root := ~, start := 342921, stop := 346930 ), rec( content := "\n\n ", count := [ 7, 3, 10, 36 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "src, ran, x", Label := "for digraphs a\ nd a permutation or transformation", Name := "IsDigraphEmbedding" ), content := 0, count := [ 7, 3, 11, 2 ], mathmode := "Text", name := "Oper", next := 347068, root := ~, start := 346952, stop := 347067 ), rec( attributes := rec( Arg := "src, ran, x, col\ 1, col2", Name := "IsDigraphEmbedding" ), content := 0, count := [ 7, 3, 11, 4 ], mathmode := "Text", name := "Oper", next := 347134, root := ~, start := 347071, stop := 347133 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "K", next := 347157, root := ~, start := 347146, stop := 347156 ), rec( content := " or ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "K", next := 347173, root := ~, start := 347161, stop := 347172 ), rec( content := ".", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "Returns", next := 347184, root := ~, start := 347137, stop := 347183 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDigraphEmbedding", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "C", next := 347230, root := ~, start := 347205, stop := 347229 ), rec( content := " returns\ ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "K", next := 347250, root := ~, start := 347239, stop := 347249 ), rec( content := " if the \ permutation\n or transformation ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "A", next := 347300, root := ~, start := 347292, stop := 347299 ), rec( content := " is a em\ bedding of the digraph\n ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "A", next := 347345, root := ~, start := 347335, stop := 347344 ), rec( content := " into th\ e digraph ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "A", next := 347373, root := ~, start := 347363, stop := 347372 ), rec( content := ", while \ respecting the colourings\n ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol1", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "A", next := 347422, root := ~, start := 347411, stop := 347421 ), rec( content := " and ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol2", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "A", next := 347438, root := ~, start := 347427, stop := 347437 ), rec( content := " if give\ n.\n ", count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "P", next := 347457, root := ~, start := 347453, stop := 347456 ), rec( content := "\n\n \ A permutation or transformation ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347503, root := ~, start := 347495, stop := 347502 ), rec( content := " is a ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ mbedding", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "E", next := 347525, root := ~, start := 347509, stop := 347524 ), rec( content := " of a di\ graph\n ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347553, root := ~, start := 347543, stop := 347552 ), rec( content := " into a \ digraph ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347579, root := ~, start := 347569, stop := 347578 ), rec( content := " if ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347591, root := ~, start := 347583, stop := 347590 ), rec( content := " is a mo\ nomorphism from\n ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347629, root := ~, start := 347619, stop := 347628 ), rec( content := " to ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347643, root := ~, start := 347633, stop := 347642 ), rec( content := " and the\ inverse of ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347671, root := ~, start := 347663, stop := 347670 ), rec( content := " is a mo\ nomorphism from\n the subdigraph of ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ an", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347727, root := ~, start := 347717, stop := 347726 ), rec( content := " induced\ by the image of ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347760, root := ~, start := 347752, stop := 347759 ), rec( content := " to\n \ ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "A", next := 347778, root := ~, start := 347768, stop := 347777 ), rec( content := ".\n\n \ See also ", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsDigra\ phHomomorphism" ), content := 0, count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "Ref", next := 347829, root := ~, start := 347794, stop := 347828 ), rec( content := ".", count := [ 7, 3, 11, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 11, 7 ], mathmode := "Text", name := "P", next := 347834, root := ~, start := 347830, stop := 347833 ), rec( content := "\n\n \ ", count := [ 7, 3, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> src := Digraph([[1], [1, 2]]);\n\ngap> ran := Digraph([[1], [1, 2], [1, 3]]);\n\ngap> IsDigraphMonomorphism(src, ran, ());\ntrue\ngap> IsDig\ raphEmbedding(src, ran, ());\ntrue\ngap> IsDigraphEmbedding(src, ran, (), [2, \ 1], [2, 1, 1]);\ntrue\ngap> IsDigraphEmbedding(src, ran, (), [2, 1], [1, 2, 1]\ );\nfalse\ngap> ran := Digraph([[1, 2], [1, 2], [1, 3]]);\n\ngap> IsDigraphMonomorphism(src, ran, IdentityTransf\ ormation);\ntrue\ngap> IsDigraphEmbedding(src, ran, IdentityTransformation);\n\ false", count := [ 7, 3, 11, 8 ], name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 8 ], mathmode := "Text", name := "Example", next := 348483, root := ~, start := 347840, stop := 348482 ), rec( content := "\n ", count := [ 7, 3, 11, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 11, 5 ], mathmode := "Text", name := "Description", next := 348500, root := ~, start := 347187, stop := 348499 ) ], count := [ 7, 3, 11, 1 ], mathmode := "Text", name := "ManSection", next := 348514, root := ~, start := 346937, stop := 348513 ), rec( content := "\n\n ", count := [ 7, 3, 11, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "src, ran, x, col\ 1, col2", Name := "DigraphsRespectsColouring" ), content := 0, count := [ 7, 3, 12, 2 ], mathmode := "Text", name := "Oper", next := 348609, root := ~, start := 348539, stop := 348608 ), rec( attributes := rec( ), content := [ rec( content := " ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "K", next := 348635, root := ~, start := 348624, stop := 348634 ), rec( content := " or ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "K", next := 348651, root := ~, start := 348639, stop := 348650 ), rec( content := ". ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "Returns", next := 348663, root := ~, start := 348614, stop := 348662 ), rec( attributes := rec( ), content := [ rec( content := "\n T\ he operation ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphsRespectsColouring", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "C", next := 348734, root := ~, start := 348702, stop := 348733 ), rec( content := " verifie\ s whether or not \n the permutation or transformation ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "x\ ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "A", next := 348808, root := ~, start := 348800, stop := 348807 ), rec( content := " respect\ s the vertex colourings\n ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol1", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "A", next := 348857, root := ~, start := 348846, stop := 348856 ), rec( content := " and ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol2", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "A", next := 348873, root := ~, start := 348862, stop := 348872 ), rec( content := " of the \ digraphs ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "A", next := 348900, root := ~, start := 348890, stop := 348899 ), rec( content := " and ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "r\ ange", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "A", next := 348917, root := ~, start := 348905, stop := 348916 ), rec( content := ".\n \ That is, ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphsRespectsColouring", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "C", next := 348966, root := ~, start := 348934, stop := 348965 ), rec( content := " returns\ ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "K", next := 348986, root := ~, start := 348975, stop := 348985 ), rec( content := " if and \ only if for\n all vertices ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "C", next := 349033, root := ~, start := 349025, stop := 349032 ), rec( content := " of ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ rc", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "A", next := 349047, root := ~, start := 349037, stop := 349046 ), rec( content := ", ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ol1[i] = col2[i ^ x]", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "C", next := 349077, root := ~, start := 349049, stop := 349076 ), rec( content := ".\n \ ", count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 12, 4 ], mathmode := "Text", name := "P", next := 349089, root := ~, start := 349085, stop := 349088 ), rec( content := "\n\n \ ", count := [ 7, 3, 12, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> src := Digraph([[1], [1, 2]]);\n\ngap> ran := Digraph([[1], [1, 2], [1, 3]]);\n\ngap> DigraphsRespectsColouring(src, ran, (1, 2), [2, 1], [1\ , 2, 1]);\ntrue\ngap> DigraphsRespectsColouring(src, ran, (1, 2), [2, 1], [2, \ 1, 1]);\nfalse\n", count := [ 7, 3, 12, 5 ], name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 5 ], mathmode := "Text", name := "Example", next := 349448, root := ~, start := 349097, stop := 349447 ), rec( content := "\n ", count := [ 7, 3, 12, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 12, 3 ], mathmode := "Text", name := "Description", next := 349467, root := ~, start := 348668, stop := 349466 ) ], count := [ 7, 3, 12, 1 ], mathmode := "Text", name := "ManSection", next := 349483, root := ~, start := 348522, stop := 349482 ), rec( content := "\n\n ", count := [ 7, 3, 12, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph[, colors\ ][, limit]", Name := "GeneratorsOfEndomorphismMonoid" ), content := 0, count := [ 7, 3, 13, 2 ], mathmode := "Text", name := "Func", next := 349582, root := ~, start := 349504, stop := 349581 ), rec( attributes := rec( Arg := "digraph", Name := "GeneratorsOfEnd\ omorphismMonoidAttr" ), content := 0, count := [ 7, 3, 13, 4 ], mathmode := "Text", name := "Attr", next := 349648, root := ~, start := 349585, stop := 349647 ), rec( attributes := rec( ), content := [ rec( content := " A list o\ f transformations.", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "Returns", next := 349697, root := ~, start := 349651, stop := 349696 ), rec( attributes := rec( ), content := [ rec( content := "\n An \ endomorphism of ", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "A", next := 349751, root := ~, start := 349737, stop := 349750 ), rec( content := " is a ho\ momorphism\n ", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Homomorphism" ), content := 0, count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "Ref", next := 349807, root := ~, start := 349774, stop := 349806 ), rec( content := " from ", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "A", next := 349827, root := ~, start := 349813, stop := 349826 ), rec( content := " back to\ itself.\n\n ", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ eneratorsOfEndomorphismMonoid", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "C", next := 349886, root := ~, start := 349849, stop := 349885 ), rec( content := ", called\ with a single argument,\n returns a generating set for the monoid of all e\ ndomorphisms of\n ", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "A", next := 350005, root := ~, start := 349991, stop := 350004 ), rec( content := ". If ", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "A", next := 350024, root := ~, start := 350010, stop := 350023 ), rec( content := " belong\ s to ", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "Ref", next := 350075, root := ~, start := 350037, stop := 350074 ), rec( content := ", then t\ he value of\n ", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ eneratorsOfEndomorphismMonoid", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "C", next := 350136, root := ~, start := 350099, stop := 350135 ), rec( content := " will no\ t be recomputed on future\n calls.", count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "P", next := 350184, root := ~, start := 350180, stop := 350183 ), rec( content := "\n\n \ If the ", count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olors", count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "A", next := 350210, root := ~, start := 350197, stop := 350209 ), rec( content := " argumen\ t is specified, then\n ", count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ eneratorsOfEndomorphismMonoid", count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "C", next := 350280, root := ~, start := 350243, stop := 350279 ), rec( content := " will re\ turn a generating\n set for the monoid of endomorphisms which respect the g\ iven colouring.\n The colouring ", count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olors", count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "A", next := 350412, root := ~, start := 350399, stop := 350411 ), rec( content := " can be \ in one of two forms: ", count := [ 7, 3, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 13, 7 ], mathmode := "Text", name := "P", next := 350445, root := ~, start := 350441, stop := 350444 ), rec( content := "\n\n \ ", count := [ 7, 3, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n A list of positive integers \ of size the number of vertices of\n ", count := [ 7, 3, 13, 9 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conte\ nt := [ rec( content := "digraph", count := [ 7, 3, 13, 9 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 9 ], mathmode := "Tex\ t", name := "A", next := 350563, root := ~, start := 350549, stop := 350562 ), rec( cont\ ent := ", where ", count := [ 7, 3, 13, 9 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "co\ lors", count := [ 7, 3, 13, 9 ], mathmode := "Text", name := "PCDATA", root :=\ ~ ) ], count := [ 7, 3, 13, 9 ], mathmode := "Text", name := "A", next := 350\ 584, root := ~, start := 350571, stop := 350583 ), rec( attributes := rec( ), cont\ ent := [ rec( content := "[i]", count := [ 7, 3, 13, 9 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 9 ], mathmode := "Text", name\ := "C", next := 350594, root := ~, start := 350584, stop := 350593 ), rec( cont\ ent := " is the colour of vertex\n ", count := [ 7, 3, 13, 9 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conten\ t := [ rec( content := "i", count := [ 7, 3, 13, 9 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 9 ], mathmode := "Text", name\ := "C", next := 350635, root := ~, start := 350627, stop := 350634 ), rec( cont\ ent := ".\n ", count := [ 7, 3, 13, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 13, 9 ], name := "Item", next := 350650, root := ~, start := 350\ 464, stop := 350649 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n A list of lists, such that ", count := [ 7, 3, 13, 11 ], mathmode\ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content\ := [ rec( content := "colors", count := [ 7, 3, 13, 11 ], mathmode := "Text",\ name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 11 ], mathmode := "Text\ ", name := "A", next := 350712, root := ~, start := 350699, stop := 350711 ), rec( attr\ ibutes := rec( ), content := [ rec( content := "[i]", count := [ 7, 3, 13, 11\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, \ 11 ], mathmode := "Text", name := "C", next := 350722, root := ~, start := 350\ 712, stop := 350721 ), rec( content := " is a list of all\n vertices wi\ th colour ", count := [ 7, 3, 13, 11 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "i", count :\ = [ 7, 3, 13, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count\ := [ 7, 3, 13, 11 ], mathmode := "Text", name := "C", next := 350777, root :=\ ~, start := 350769, stop := 350776 ), rec( content := ".\n ", count := [ \ 7, 3, 13, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 11 ] , name := "Ite\ m", next := 350792, root := ~, start := 350657, stop := 350791 ) ], count := [ 7, 3, 13, 8 ], mathmode := "Text", name := "List", next := 350804, root := ~, start := 350451, stop := 350803 ), rec( content := "\n\n \ If the ", count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ imit", count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "A", next := 350829, root := ~, start := 350817, stop := 350828 ), rec( content := " argumen\ t is specified, then it will return only the\n first ", count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ imit", count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "A", next := 350904, root := ~, start := 350892, stop := 350903 ), rec( content := " homomor\ phisms, where ", count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ imit", count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "A", next := 350938, root := ~, start := 350926, stop := 350937 ), rec( content := " must be\ a positive\n integer or ", count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "C", next := 350988, root := ~, start := 350973, stop := 350987 ), rec( content := ". ", count := [ 7, 3, 13, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 13, 14 ], mathmode := "Text", name := "P", next := 350994, root := ~, start := 350990, stop := 350993 ), rec( content := "\n\n \ ", count := [ 7, 3, 13, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph(List([1 .. 3], x -> [1 .. 3]));;\ngap> GeneratorsOfEndomor\ phismMonoid(gr);\n[ Transformation( [ 1, 3, 2 ] ), Transformation( [ 2, 1 ] ),\ \n IdentityTransformation, Transformation( [ 1, 2, 1 ] ), \n Transformation\ ( [ 1, 2, 2 ] ), Transformation( [ 1, 1, 2 ] ), \n Transformation( [ 1, 1, 1 \ ] ) ]\ngap> GeneratorsOfEndomorphismMonoid(gr, 3);\n[ Transformation( [ 1, 3, \ 2 ] ), Transformation( [ 2, 1 ] ), \n IdentityTransformation ]\ngap> gr := Co\ mpleteDigraph(3);;\ngap> GeneratorsOfEndomorphismMonoid(gr);\n[ Transformation\ ( [ 2, 3, 1 ] ), Transformation( [ 2, 1 ] ), \n IdentityTransformation ]\ngap\ > GeneratorsOfEndomorphismMonoid(gr, [1, 2, 2]);\n[ Transformation( [ 1, 3, 2 \ ] ), IdentityTransformation ]\ngap> GeneratorsOfEndomorphismMonoid(gr, [[1], [\ 2, 3]]);\n[ Transformation( [ 1, 3, 2 ] ), IdentityTransformation ]\n", count := [ 7, 3, 13, 15 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 13, 15 ], mathmode := "Text", name := "Example", next := 351863, root := ~, start := 351000, stop := 351862 ), rec( content := "\n ", count := [ 7, 3, 13, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 13, 5 ], mathmode := "Text", name := "Description", next := 351880, root := ~, start := 349700, stop := 351879 ) ], count := [ 7, 3, 13, 1 ], mathmode := "Text", name := "ManSection", next := 351894, root := ~, start := 349489, stop := 351893 ), rec( content := "\n\n ", count := [ 7, 3, 13, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, n", Label := "for a digraph \ and a number of colours", Name := "DigraphColouring" ), content := 0, count := [ 7, 3, 14, 2 ], mathmode := "Text", name := "Oper", next := 352013, root := ~, start := 351915, stop := 352012 ), rec( attributes := rec( ), content := [ rec( content := " A transf\ ormation, or ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "K", next := 352058, root := ~, start := 352047, stop := 352057 ), rec( content := ".", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "Returns", next := 352069, root := ~, start := 352016, stop := 352068 ), rec( attributes := rec( ), content := [ rec( content := "\n A " , count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roper colouring", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "E", next := 352115, root := ~, start := 352092, stop := 352114 ), rec( content := " of a di\ graph is a labelling of its vertices in\n such a way that adjacent vertices\ have different labels. A ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roper\n ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA" , root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "n", count := [ 7, 3, 14, 3 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := \ "Text", name := "C", next := 352250, root := ~, start := 352242, stop := 35224\ 9 ), rec( content := "-colouring", count := [ 7, 3, 14, 3 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "E", next := 352264, root := ~, start := 352226, stop := 352263 ), rec( content := " is a pr\ oper colouring that uses exactly ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "C", next := 352313, root := ~, start := 352305, stop := 352312 ), rec( content := "\n co\ lours. Equivalently, a proper (", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "C", next := 352360, root := ~, start := 352352, stop := 352359 ), rec( content := "-)colour\ ing of a digraph can be\n defined to be a ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Epimorphism" ), content := 0, count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "Ref", next := 352444, root := ~, start := 352412, stop := 352443 ), rec( content := " from a \ digraph onto the\n complete digraph (with ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "C", next := 352504, root := ~, start := 352496, stop := 352503 ), rec( content := " vertice\ s); see ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Complet\ eDigraph" ), content := 0, count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "Ref", next := 352555, root := ~, start := 352520, stop := 352554 ), rec( content := ". Note \ that a digraph with loops (", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digraph\ HasLoops" ), content := 0, count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "Ref", next := 352625, root := ~, start := 352590, stop := 352624 ), rec( content := ") does n\ ot have a proper ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "C", next := 352658, root := ~, start := 352650, stop := 352657 ), rec( content := "-colouri\ ng for\n any value ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "C", next := 352695, root := ~, start := 352687, stop := 352694 ), rec( content := ".\n " , count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "P", next := 352705, root := ~, start := 352701, stop := 352704 ), rec( content := "\n\n \ If ", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "A", next := 352728, root := ~, start := 352714, stop := 352727 ), rec( content := " is a di\ graph and ", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "A", next := 352754, root := ~, start := 352746, stop := 352753 ), rec( content := " is a no\ n-negative integer, then\n ", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphColouring(", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "di\ graph", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ) ], count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "A", next := 3528\ 25, root := ~, start := 352811, stop := 352824 ), rec( content := ", ", count := [ 7, 3, 14, 4 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "n", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "A", next := 3528\ 35, root := ~, start := 352827, stop := 352834 ), rec( content := ")", count := [ 7, 3, 14, 4 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "C", next := 352840, root := ~, start := 352791, stop := 352839 ), rec( content := " returns\ an epimorphism\n from ", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "A", next := 352887, root := ~, start := 352873, stop := 352886 ), rec( content := " onto th\ e complete digraph with ", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "A", next := 352927, root := ~, start := 352919, stop := 352926 ), rec( content := " vertice\ s if one\n exists, else it returns ", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "K", next := 352983, root := ~, start := 352972, stop := 352982 ), rec( content := ". ", count := [ 7, 3, 14, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 14, 5 ], mathmode := "Text", name := "P", next := 352989, root := ~, start := 352985, stop := 352988 ), rec( content := "\n\n \ See also ", count := [ 7, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ GreedyColouring", Label := "for a digraph" ), content := 0, count := [ 7, 3, 14, 5 ], mathmode := "Text", name := "Ref", next := 353062, root := ~, start := 353004, stop := 353061 ), rec( content := " and \n \ ", count := [ 7, 3, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 14, 6 ], mathmode := "Text", name := "P", next := 353076, root := ~, start := 353072, stop := 353075 ), rec( content := "\n\n \ Note that a digraph with at least two vertices has a 2-colouring if and only\n\ if it is bipartite, see ", count := [ 7, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsBipar\ titeDigraph" ), content := 0, count := [ 7, 3, 14, 6 ], mathmode := "Text", name := "Ref", next := 353219, root := ~, start := 353187, stop := 353218 ), rec( content := ".\n\n \ ", count := [ 7, 3, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> DigraphColouring(CompleteDigraph(5), 4);\nfail\ngap> DigraphColouring(Ch\ ainDigraph(10), 1);\nfail\ngap> D := ChainDigraph(10);;\ngap> t := DigraphColo\ uring(D, 2);\nTransformation( [ 1, 2, 1, 2, 1, 2, 1, 2, 1, 2 ] )\ngap> IsDigra\ phColouring(D, t); \ntrue\ngap> DigraphGreedyColouring(D);\nTransformation( [ \ 2, 1, 2, 1, 2, 1, 2, 1, 2, 1 ] )\n", count := [ 7, 3, 14, 7 ], name := "PCDATA\ ", root := ~ ) ], count := [ 7, 3, 14, 7 ], mathmode := "Text", name := "Example", next := 353592, root := ~, start := 353226, stop := 353591 ), rec( content := "\n ", count := [ 7, 3, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 14, 3 ], mathmode := "Text", name := "Description", next := 353609, root := ~, start := 352072, stop := 353608 ) ], count := [ 7, 3, 14, 1 ], mathmode := "Text", name := "ManSection", next := 353623, root := ~, start := 351900, stop := 353622 ), rec( content := "\n\n ", count := [ 7, 3, 14, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, order", Label := "for a digraph \ and vertex order", Name := "DigraphGreedyColouring" ), content := 0, count := [ 7, 3, 15, 2 ], mathmode := "Text", name := "Oper", next := 353759, root := ~, start := 353644, stop := 353758 ), rec( attributes := rec( Arg := "digraph, func", Label := "for a digraph \ and vertex order function", Name := "DigraphGreedyColouring" ), content := 0, count := [ 7, 3, 15, 4 ], mathmode := "Text", name := "Oper", next := 353885, root := ~, start := 353762, stop := 353884 ), rec( attributes := rec( Arg := "digraph", Label := "for a digraph" , Name := "DigraphGreedyCo\ louring" ), content := 0, count := [ 7, 3, 15, 6 ], mathmode := "Text", name := "Attr", next := 353979, root := ~, start := 353888, stop := 353978 ), rec( attributes := rec( ), content := [ rec( content := " A transf\ ormation, or ", count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "K", next := 354024, root := ~, start := 354013, stop := 354023 ), rec( content := ".", count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "Returns", next := 354035, root := ~, start := 353982, stop := 354034 ), rec( attributes := rec( ), content := [ rec( content := "\n A " , count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roper colouring", count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "E", next := 354081, root := ~, start := 354058, stop := 354080 ), rec( content := " of a di\ graph is a labelling of its vertices in\n such a way that adjacent vertices\ have different labels. Note that a digraph \n with loops (", count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digraph\ HasLoops" ), content := 0, count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "Ref", next := 354256, root := ~, start := 354227, stop := 354255 ), rec( content := ") does n\ ot have any proper \n colouring.\n ", count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "P", next := 354307, root := ~, start := 354303, stop := 354306 ), rec( content := "\n \n\ If ", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "A", next := 354334, root := ~, start := 354320, stop := 354333 ), rec( content := " is a di\ graph and ", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ rder", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "A", next := 354364, root := ~, start := 354352, stop := 354363 ), rec( content := " is a de\ nse list consisting \n of all of the vertices of ", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "A", next := 354437, root := ~, start := 354423, stop := 354436 ), rec( content := " (in any\ order), then \n ", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphGreedyColouring", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "C", next := 354494, root := ~, start := 354465, stop := 354493 ), rec( content := "\n us\ es a greedy algorithm with the specified order to obtain some proper\n colo\ uring of ", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "A", next := 354601, root := ~, start := 354587, stop := 354600 ), rec( content := ", which \ may not use the minimal number of\n colours. ", count := [ 7, 3, 15, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "P", next := 354660, root := ~, start := 354656, stop := 354659 ), rec( content := "\n \n\ If ", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "A", next := 354687, root := ~, start := 354673, stop := 354686 ), rec( content := " is a di\ graph and ", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ unc", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "A", next := 354716, root := ~, start := 354705, stop := 354715 ), rec( content := " is a fu\ nction whose argument \n is a digraph, and that returns a dense list ", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ rder", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "A", next := 354807, root := ~, start := 354795, stop := 354806 ), rec( content := ", then \\ n ", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphGreedyColouring(", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "A", next := 3548\ 59, root := ~, start := 354845, stop := 354858 ), rec( content := ", ", count := [ 7, 3, 15, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "func", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "A", next := 3548\ 72, root := ~, start := 354861, stop := 354871 ), rec( content := ")", count := [ 7, 3, 15, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "C", next := 354877, root := ~, start := 354819, stop := 354876 ), rec( content := " returns\ \n ", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphGreedyColouring(", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "A", next := 3549\ 30, root := ~, start := 354916, stop := 354929 ), rec( content := ", ", count := [ 7, 3, 15, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "func", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "A", next := 3549\ 43, root := ~, start := 354932, stop := 354942 ), rec( content := "(", count := [ 7, 3, 15, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph", count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "A", next := 3549\ 58, root := ~, start := 354944, stop := 354957 ), rec( content := "))", count := [ 7, 3, 15, 9 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "C", next := 354964, root := ~, start := 354890, stop := 354963 ), rec( content := ".\n " , count := [ 7, 3, 15, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 15, 10 ], mathmode := "Text", name := "P", next := 354974, root := ~, start := 354970, stop := 354973 ), rec( content := "\n\n \ If the optional second argument (either a list or a function), is not \n sp\ ecified, then ", count := [ 7, 3, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ WelshPowellOrder" ), content := 0, count := [ 7, 3, 15, 10 ], mathmode := "Text", name := "Ref", next := 355108, root := ~, start := 355071, stop := 355107 ), rec( content := " is used\ by default. \n ", count := [ 7, 3, 15, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 15, 11 ], mathmode := "Text", name := "P", next := 355138, root := ~, start := 355134, stop := 355137 ), rec( content := "\n \n\ See also\n ", count := [ 7, 3, 15, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and a number of colours", Oper := "DigraphColouring" ), content := 0, count := [ 7, 3, 15, 11 ], mathmode := "Text", name := "Ref", next := 355247, root := ~, start := 355161, stop := 355246 ), rec( content := ".\n " , count := [ 7, 3, 15, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 15, 12 ], mathmode := "Text", name := "P", next := 355257, root := ~, start := 355253, stop := 355256 ), rec( content := "\n\n \ ", count := [ 7, 3, 15, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> DigraphGreedyColouring(ChainDigraph(10));\nTransformation( [ 2, 1, 2, 1,\ 2, 1, 2, 1, 2, 1 ] )\ngap> DigraphGreedyColouring(ChainDigraph(10), [1 .. 10]\ );\nTransformation( [ 1, 2, 1, 2, 1, 2, 1, 2, 1, 2 ] )\n", count := [ 7, 3, 15, 13 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 15, 13 ], mathmode := "Text", name := "Example", next := 355502, root := ~, start := 355263, stop := 355501 ), rec( content := "\n ", count := [ 7, 3, 15, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 15, 7 ], mathmode := "Text", name := "Description", next := 355519, root := ~, start := 354038, stop := 355518 ) ], count := [ 7, 3, 15, 1 ], mathmode := "Text", name := "ManSection", next := 355533, root := ~, start := 353629, stop := 355532 ), rec( content := "\n\n ", count := [ 7, 3, 15, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DigraphWelshPow\ ellOrder" ), content := 0, count := [ 7, 3, 16, 2 ], mathmode := "Text", name := "Attr", next := 355606, root := ~, start := 355554, stop := 355605 ), rec( attributes := rec( ), content := [ rec( content := " A list o\ f the vertices.", count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "Returns", next := 355652, root := ~, start := 355609, stop := 355651 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphWelshPowellOrder", count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "C", next := 355703, root := ~, start := 355673, stop := 355702 ), rec( content := " returns\ a list of all of the vertices of \n the digraph ", count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "A", next := 355776, root := ~, start := 355762, stop := 355775 ), rec( content := " ordered\ according to the sum of the number of \n out- and in-neighbours, from high\ est to lowest. \n ", count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 16, 4 ], mathmode := "Text", name := "P", next := 355885, root := ~, start := 355881, stop := 355884 ), rec( content := "\n\n \ ", count := [ 7, 3, 16, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> DigraphWelshPowellOrder(Digraph([[4], [9], [9], [], \n> \ [4, 6, 9], [1], [], [], \n> \ [4, 5], [4, 5]]));\n[ 5, 9, 4, 1, 6, 10, 2, 3, 7, 8 ]\n", count := [ 7, 3, 16, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 16, 5 ], mathmode := "Text", name := "Example", next := 356135, root := ~, start := 355891, stop := 356134 ), rec( content := "\n ", count := [ 7, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 16, 3 ], mathmode := "Text", name := "Description", next := 356152, root := ~, start := 355655, stop := 356151 ) ], count := [ 7, 3, 16, 1 ], mathmode := "Text", name := "ManSection", next := 356166, root := ~, start := 355539, stop := 356165 ), rec( content := "\n\n ", count := [ 7, 3, 16, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "ChromaticNumber\ " ), content := 0, count := [ 7, 3, 17, 2 ], mathmode := "Text", name := "Attr", next := 356231, root := ~, start := 356187, stop := 356230 ), rec( attributes := rec( ), content := [ rec( content := " A non-ne\ gative integer.", count := [ 7, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 17, 3 ], mathmode := "Text", name := "Returns", next := 356277, root := ~, start := 356234, stop := 356276 ), rec( attributes := rec( ), content := [ rec( content := "\n A " , count := [ 7, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ roper colouring", count := [ 7, 3, 17, 3 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 7, 3, 17, 3 ], mathmode := "Text", name := "E", next := 356323, root := ~, start := 356300, stop := 356322 ), rec( content := " of a di\ graph is a labelling of its\n vertices in such a way that adjacent vertices\ have different labels.\n Equivalently, a proper digraph colouring can be d\ efined to be a ", count := [ 7, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Epimorphism" ), content := 0, count := [ 7, 3, 17, 3 ], mathmode := "Text", name := "Ref", next := 356538, root := ~, start := 356500, stop := 356537 ), rec( content := " from a \ digraph onto a complete digraph. ", count := [ 7, 3, 17, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "P", next := 356583, root := ~, start := 356579, stop := 356582 ), rec( content := "\n\n \ If ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "A", next := 356606, root := ~, start := 356592, stop := 356605 ), rec( content := " is a di\ graph without loops (see ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digraph\ HasLoops" ), content := 0, count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "Ref", next := 356674, root := ~, start := 356639, stop := 356673 ), rec( content := ", then " , count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ hromaticNumber", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "C", next := 356703, root := ~, start := 356681, stop := 356702 ), rec( content := " returns\ the least\n non-negative integer ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "C", next := 356755, root := ~, start := 356747, stop := 356754 ), rec( content := " such th\ at there is a proper colouring of\n ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "A", next := 356815, root := ~, start := 356801, stop := 356814 ), rec( content := " with ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "C", next := 356829, root := ~, start := 356821, stop := 356828 ), rec( content := " colours\ . In other words, for a digraph with at\n least one vertex, ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ hromaticNumber", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "C", next := 356922, root := ~, start := 356900, stop := 356921 ), rec( content := " returns\ the least number ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "C", next := 356956, root := ~, start := 356948, stop := 356955 ), rec( content := "\n su\ ch that ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphColouring(", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "di\ graph", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "A", next := 3570\ 05, root := ~, start := 356991, stop := 357004 ), rec( content := ", n)", count := [ 7, 3, 17, 4 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "C", next := 357013, root := ~, start := 356971, stop := 357012 ), rec( content := " does no\ t return\n ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "K", next := 357045, root := ~, start := 357034, stop := 357044 ), rec( content := ". See ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and a number of colours", Oper := "DigraphColouring" ), content := 0, count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "Ref", next := 357133, root := ~, start := 357051, stop := 357132 ), rec( content := ".\n\n \ ", count := [ 7, 3, 17, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> ChromaticNumber(NullDigraph(10));\n1\ngap> ChromaticNumber(CompleteDigra\ ph(10));\n10\ngap> ChromaticNumber(CompleteBipartiteDigraph(5, 5));\n2\ngap> C\ hromaticNumber(Digraph([[], [3], [5], [2, 3], [4]]));\n3\ngap> ChromaticNumber\ (NullDigraph(0));\n0\ngap> D := PetersenGraph(IsMutableDigraph);\n\ngap> ChromaticNumber(D);\n3\n", count := [ 7, 3, 17, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 7, 3, 17, 5 ], mathmode := "Text", name := "Example", next := 357532, root := ~, start := 357140, stop := 357531 ), rec( content := "\n ", count := [ 7, 3, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 17, 3 ], mathmode := "Text", name := "Description", next := 357549, root := ~, start := 356280, stop := 357548 ) ], count := [ 7, 3, 17, 1 ], mathmode := "Text", name := "ManSection", next := 357563, root := ~, start := 356172, stop := 357562 ), rec( content := "\n\n ", count := [ 7, 3, 17, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "D", Name := "DigraphCore" ), content := 0, count := [ 7, 3, 18, 2 ], mathmode := "Text", name := "Attr", next := 357626, root := ~, start := 357588, stop := 357625 ), rec( attributes := rec( ), content := [ rec( content := "A list of\ positive integers.", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "Returns", next := 357678, root := ~, start := 357631, stop := 357677 ), rec( attributes := rec( ), content := [ rec( content := "\n I\ f ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "A", next := 357714, root := ~, start := 357706, stop := 357713 ), rec( content := " is a di\ graph, then ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphCore", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "C", next := 357752, root := ~, start := 357734, stop := 357751 ), rec( content := " returns\ a list of vertices\n corresponding to the ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ore", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "C", next := 357818, root := ~, start := 357807, stop := 357817 ), rec( content := " of ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "A", next := 357830, root := ~, start := 357822, stop := 357829 ), rec( content := ". In par\ ticular, the subdigraph\n of ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "A", next := 357879, root := ~, start := 357871, stop := 357878 ), rec( content := " induced\ by this list is isomorphic to the core of ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "A", next := 357938, root := ~, start := 357930, stop := 357937 ), rec( content := ".", count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "P", next := 357943, root := ~, start := 357939, stop := 357942 ), rec( content := "\n\n \ The ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ ore", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "E", next := 357964, root := ~, start := 357953, stop := 357963 ), rec( content := " of a di\ graph ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "C", next := 357986, root := ~, start := 357978, stop := 357985 ), rec( content := " is the \ minimal subdigraph ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "A", next := 358021, root := ~, start := 358013, stop := 358020 ), rec( content := " of\n \ ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "C", next := 358037, root := ~, start := 358029, stop := 358036 ), rec( content := " which i\ s a homomorphic image of ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "C", next := 358078, root := ~, start := 358070, stop := 358077 ), rec( content := ". The co\ re of a digraph \n is unique up to isomorphism.\n ", count := [ 7, 3, 18, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := DigraphSymmetricClosure(CycleDigraph(8));\n\ngap> DigraphCore(D);\n[ 1, 2 ]\ngap> D := Pet\ ersenGraph();\n\ngap> DigraphCor\ e(D);\n[ 1 .. 10 ]\ngap> D := Digraph(IsMutableDigraph, [[3], [3], [4], [5], [\ 2]]);\n\ngap> DigraphCore(D);\n[ 2, \ 3, 4, 5 ]\n", count := [ 7, 3, 18, 5 ], name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 5 ], mathmode := "Text", name := "Example", next := 358562, root := ~, start := 358142, stop := 358561 ), rec( content := "\n ", count := [ 7, 3, 18, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 18, 3 ], mathmode := "Text", name := "Description", next := 358581, root := ~, start := 357683, stop := 358580 ) ], count := [ 7, 3, 18, 1 ], mathmode := "Text", name := "ManSection", next := 358597, root := ~, start := 357571, stop := 358596 ), rec( content := "\n\n ", count := [ 7, 3, 18, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 3, 0, 1 ], mathmode := "Text", name := "Section", next := 358611, root := ~, start := 326417, stop := 358610 ) , rec( content := "\n\n", count := [ 7, 3, 18, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 7, 0, 0, 1 ], mathmode := "Text", name := "Chapter", next := 358623, root := ~, start := 277589, stop := 358622 ), rec( content := "\n ", count := [ 7, 3, 18, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " homomorphisms ", count := [ 7, 3, 18, 6 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 7, 3, 18, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Finding cliques and independent sets" ), content := [ rec( content := "\n ", count := [ 8, 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Finding cliques and indep\ endent sets", count := [ 8, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 358762, root := ~, start := 358707, stop := 358761 ) , rec( content := "\n\n In ", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ", a ", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "clique", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "E", next := 358798, root := ~, start := 358785, stop := 358797 ), rec( content := " of a digraph is a set of mutual\ ly adjacent\n vertices of the digraph, and an ", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "independent set", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "E", next := 358900, root := ~, start := 358878, stop := 358899 ), rec( content := " is a set of mutually\n non-a\ djacent vertices of the digraph. A ", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "maximal clique", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "E", next := 358987, root := ~, start := 358966, stop := 358986 ), rec( content := " is a clique\n which is not p\ roperly contained in another clique, and a ", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "maximal\n independen\ t set", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "E", next := 359097, root := ~, start := 359061, stop := 359096 ), rec( content := " is an independent set which is \ not properly contained\n in another independent set. Using this definition\ in ", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ", cliques\n and independent s\ ets are both permitted, but not required, to contain vertices\n at which th\ ere is a loop. Another name for a clique is a ", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "complete\n subgraph" , count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "E", next := 359405, root := ~, start := 359375, stop := 359404 ), rec( content := ".\n ", count := [ 8, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "P", next := 359415, root := ~, start := 359411, stop := 359414 ), rec( content := "\n\n ", count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " provides extensive functionalit\ y for computing cliques and\n independent sets of a digraph, whether maxima\ l or not. The fundamental\n algorithm used in most of the methods in ", count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " to calculate cliques\n and i\ ndependent sets is a version of the Bron-Kerbosch algorithm.\n Calculating \ the cliques and independent sets of a digraph is a well-known\n and hard pr\ oblem, and searching for cliques or independent sets in a\n digraph can be \ very lengthy, even for a digraph with a small number of\n vertices. ", count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " uses several strategies to incr\ ease the performance\n of these calculations.\n ", count := [ 8, 0, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "P", next := 360053, root := ~, start := 360049, stop := 360052 ), rec( content := "\n\n From the definition of c\ liques and independent sets, it follows that the\n presence of loops and mu\ ltiple edges in a digraph is irrelevant to the\n existence of cliques and i\ ndependent sets in the digraph. See ", count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "DigraphHasLoops" ), content := 0, count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "Ref", next := 360309, root := ~, start := 360274, stop := 360308 ), rec( content := " and ", count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsMultiDigraph" ), content := 0, count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "Ref", next := 360342, root := ~, start := 360314, stop := 360341 ), rec( content := " for more\n information about\ these properties. Therefore given a digraph\n ", count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "A", next := 360437, root := ~, start := 360423, stop := 360436 ), rec( content := ", the cliques and independent se\ ts of ", count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "A", next := 360489, root := ~, start := 360475, stop := 360488 ), rec( content := " are\n equal to the cliques a\ nd independent sets of the digraph:\n\n ", count := [ 8, 0, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 8, 0, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "DigraphRe\ moveLoops(DigraphRemoveAllMultipleEdges(", count := [ 8, 0, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 7 ], mathmode := "Text", name := "C", next := 360645, root := ~, start := 360589, stop := 360644 ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 7 ], mathmode := "Text", name := "A", next := 360659, root := ~, start := 360645, stop := 360658 ), rec( attributes := rec( ), content := [ rec( content := "))", count := [ 8, 0, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 7 ], mathmode := "Text", name := "C", next := 360668, root := ~, start := 360659, stop := 360667 ), rec( content := ".\n ", count := [ 8, 0, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 7 ], name := "Item", next := 360683, root := ~, start := 360574, stop := 360682 ) ], count := [ 8, 0, 0, 6 ], mathmode := "Text", name := "List", next := 360695, root := ~, start := 360561, stop := 360694 ), rec( content := "\n\n See ", count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "DigraphRemoveLoops" ), content := 0, count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "Ref", next := 360737, root := ~, start := 360705, stop := 360736 ), rec( content := " and ", count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "DigraphRemoveAllMultipleEdges" ), content := 0, count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "Ref", next := 360791, root := ~, start := 360742, stop := 360790 ), rec( content := " for more information about thes\ e\n attributes. Furthermore, the cliques of this digraph are equal to the\ \n cliques of the digraph formed by removing any edge ", count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[u,v]", count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "C", next := 360967, root := ~, start := 360955, stop := 360966 ), rec( content := " for which\n the correspondin\ g reverse edge ", count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[v,u]", count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "C", next := 361025, root := ~, start := 361013, stop := 361024 ), rec( content := " is not present. Therefore,\n \ overall, the cliques of ", count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "A", next := 361096, root := ~, start := 361082, stop := 361095 ), rec( content := " are equal to the cliques of the\ \n symmetric digraph:\n\n ", count := [ 8, 0, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 8, 0, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "MaximalSy\ mmetricSubdigraphWithoutLoops(", count := [ 8, 0, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 11 ], mathmode := "Text", name := "C", next := 361231, root := ~, start := 361185, stop := 361230 ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 11 ], mathmode := "Text", name := "A", next := 361245, root := ~, start := 361231, stop := 361244 ), rec( attributes := rec( ), content := [ rec( content := ")", count := [ 8, 0, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 11 ], mathmode := "Text", name := "C", next := 361253, root := ~, start := 361245, stop := 361252 ), rec( content := ".\n ", count := [ 8, 0, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 11 ], name := "Item", next := 361268, root := ~, start := 361170, stop := 361267 ) ], count := [ 8, 0, 0, 10 ], mathmode := "Text", name := "List", next := 361280, root := ~, start := 361157, stop := 361279 ), rec( content := "\n\n See ", count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "MaximalSymmetricSubdigraphWitho\ utLoops" ), content := 0, count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "Ref", next := 361342, root := ~, start := 361290, stop := 361341 ), rec( content := " for more\n information about\ this. The ", count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "AutomorphismGroup", Label := "for a digraph" ), content := 0, count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "Ref", next := 361444, root := ~, start := 361384, stop := 361443 ), rec( content := " of this symmetric digraph conta\ ins the\n automorphism group of ", count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "A", next := 361524, root := ~, start := 361510, stop := 361523 ), rec( content := " as a subgroup. By performing t\ he\n search for maximal cliques with the help of this larger automorphism g\ roup\n to reduce the search space, the computation time may be reduced. Th\ e\n functions and attributes which return representatives of cliques of\n \ ", count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "A", next := 361802, root := ~, start := 361788, stop := 361801 ), rec( content := " will return orbit representativ\ es of cliques under the\n action of the automorphism group of the ", count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "maximal symmetric subdigr\ aph\n without loops", count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "E", next := 361957, root := ~, start := 361902, stop := 361956 ), rec( content := " on sets of vertices.", count := [ 8, 0, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 0, 0, 14 ], mathmode := "Text", name := "P", next := 361982, root := ~, start := 361978, stop := 361981 ), rec( content := "\n\n The independent sets of \ a digraph are equal to the independent sets of the\n ", count := [ 8, 0, 0, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "DigraphSymmetricClosure" ), content := 0, count := [ 8, 0, 0, 14 ], mathmode := "Text", name := "Ref", next := 362104, root := ~, start := 362067, stop := 362103 ), rec( content := ". Therefore, overall, the indep\ endent\n sets of ", count := [ 8, 0, 0, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 14 ], mathmode := "Text", name := "A", next := 362169, root := ~, start := 362155, stop := 362168 ), rec( content := " are equal to the independent se\ ts of the symmetric\n digraph:\n\n ", count := [ 8, 0, 0, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 8, 0, 0, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "DigraphSy\ mmetricClosure(DigraphRemoveLoops(DigraphRemoveAllMultipleEdges(\n ", count := [ 8, 0, 0, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 16 ], mathmode := "Text", name := "C", next := 362356, root := ~, start := 362267, stop := 362355 ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 16 ], mathmode := "Text", name := "A", next := 362370, root := ~, start := 362356, stop := 362369 ), rec( attributes := rec( ), content := [ rec( content := ")))", count := [ 8, 0, 0, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 16 ], mathmode := "Text", name := "C", next := 362380, root := ~, start := 362370, stop := 362379 ), rec( content := ".\n ", count := [ 8, 0, 0, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 16 ], name := "Item", next := 362395, root := ~, start := 362252, stop := 362394 ) ], count := [ 8, 0, 0, 15 ], mathmode := "Text", name := "List", next := 362407, root := ~, start := 362239, stop := 362406 ), rec( content := "\n\n Again, the automorphism \ group of this symmetric digraph contains the\n automorphism group of ", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "A", next := 362522, root := ~, start := 362508, stop := 362521 ), rec( content := ". Since a search for independent\ sets\n is equal to a search for cliques in the ", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "DigraphDual" ), content := 0, count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "Ref", next := 362629, root := ~, start := 362604, stop := 362628 ), rec( content := ", the\n methods used in ", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " usually transform a search for \ independent sets\n into a search for cliques, as described above. The func\ tions and\n attributes which return representatives of independent sets of\ \n ", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "A", next := 362869, root := ~, start := 362855, stop := 362868 ), rec( content := " will return orbit representativ\ es of independent sets under\n the action of the automorphism group of the \ ", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "symmetric closure", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "E", next := 363002, root := ~, start := 362978, stop := 363001 ), rec( content := " of the\n digraph formed by r\ emoving loops and multiple edges.", count := [ 8, 0, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "P", next := 363070, root := ~, start := 363066, stop := 363069 ), rec( content := "\n\n Please note that in ", count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := ", cliques and independent sets a\ re not\n required to be maximal. Some authors use the word clique to mean\n\ ", count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "maximal", count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "E", next := 363232, root := ~, start := 363218, stop := 363231 ), rec( content := " clique, and some authors use th\ e phrase independent set to\n mean ", count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "maximal", count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "E", next := 363315, root := ~, start := 363301, stop := 363314 ), rec( content := " independent set, but please not\ e that ", count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " does\n not use this definiti\ on.\n ", count := [ 8, 0, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 0, 0, 20 ], mathmode := "Text", name := "P", next := 363407, root := ~, start := 363403, stop := 363406 ), rec( content := "\n\n ", count := [ 8, 0, 0, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Finding cliques", count := [ 8, 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 363454, root := ~, start := 363420, stop := 363453 ), rec( content := "\n ", count := [ 8, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, l", Name := "IsClique" ), content := 0, count := [ 8, 1, 1, 2 ], mathmode := "Text", name := "Oper", next := 363512, root := ~, start := 363472, stop := 363511 ), rec( attributes := rec( Arg := "digraph, l", Name := "IsMaximalClique\ " ), content := 0, count := [ 8, 1, 1, 4 ], mathmode := "Text", name := "Oper", next := 363560, root := ~, start := 363513, stop := 363559 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "K", next := 363581, root := ~, start := 363570, stop := 363580 ), rec( content := " or ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "K", next := 363597, root := ~, start := 363585, stop := 363596 ), rec( content := ".", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "Returns", next := 363608, root := ~, start := 363561, stop := 363607 ), rec( attributes := rec( ), content := [ rec( content := "\n If ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 363642, root := ~, start := 363628, stop := 363641 ), rec( content := " is a di\ graph and ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 363668, root := ~, start := 363660, stop := 363667 ), rec( content := " is a du\ plicate-free list of\n vertices of ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 363725, root := ~, start := 363711, stop := 363724 ), rec( content := ", then\n\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sClique(", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "C", next := 363750, root := ~, start := 363734, stop := 363749 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 363764, root := ~, start := 363750, stop := 363763 ), rec( attributes := rec( ), content := [ rec( content := ",\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "C", next := 363772, root := ~, start := 363764, stop := 363771 ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 363780, root := ~, start := 363772, stop := 363779 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "C", next := 363788, root := ~, start := 363780, stop := 363787 ), rec( content := " returns\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "K", next := 363808, root := ~, start := 363797, stop := 363807 ), rec( content := "\n if\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 363824, root := ~, start := 363816, stop := 363823 ), rec( content := " is a ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ lique", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "E", next := 363843, root := ~, start := 363830, stop := 363842 ), rec( content := " of ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 363861, root := ~, start := 363847, stop := 363860 ), rec( content := " and ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "K", next := 363878, root := ~, start := 363866, stop := 363877 ), rec( content := " if it i\ s\n not. Similarly,\n ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sMaximalClique(", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "C", next := 363936, root := ~, start := 363913, stop := 363935 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 363950, root := ~, start := 363936, stop := 363949 ), rec( attributes := rec( ), content := [ rec( content := ",\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "C", next := 363958, root := ~, start := 363950, stop := 363957 ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 363966, root := ~, start := 363958, stop := 363965 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "C", next := 363974, root := ~, start := 363966, stop := 363973 ), rec( content := " returns\ \n ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "K", next := 363998, root := ~, start := 363987, stop := 363997 ), rec( content := " if ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 364010, root := ~, start := 364002, stop := 364009 ), rec( content := " is a ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ aximal clique", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "E", next := 364037, root := ~, start := 364016, stop := 364036 ), rec( content := " of ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "A", next := 364055, root := ~, start := 364041, stop := 364054 ), rec( content := " and\n \ ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "K", next := 364076, root := ~, start := 364064, stop := 364075 ), rec( content := " if it i\ s not. ", count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 1, 6 ], mathmode := "Text", name := "P", next := 364096, root := ~, start := 364092, stop := 364095 ), rec( content := "\n\n \ A ", count := [ 8, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ lique", count := [ 8, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 6 ], mathmode := "Text", name := "E", next := 364117, root := ~, start := 364104, stop := 364116 ), rec( content := " of a di\ graph is a set of mutually adjacent vertices of the\n digraph. A ", count := [ 8, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ aximal clique", count := [ 8, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 6 ], mathmode := "Text", name := "E", next := 364213, root := ~, start := 364192, stop := 364212 ), rec( content := " is a cl\ ique that is not properly\n contained in another clique. A clique is permit\ ted, but not required, to\n contain vertices at which there is a loop.\n \ ", count := [ 8, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(4);;\ngap> IsClique(D, [1, 3, 2]);\ntrue\ngap> IsMa\ ximalClique(D, [1, 3, 2]);\nfalse\ngap> IsMaximalClique(D, DigraphVertices(D))\ ;\ntrue\ngap> D := Digraph([[1, 2, 4, 4], [1, 3, 4], [2, 1], [1, 2]]);\n\ngap> IsClique(D, [2, 3, 4]);\nfa\ lse\ngap> IsMaximalClique(D, [1, 2, 4]);\ntrue\ngap> D := CompleteDigraph(IsMu\ tableDigraph, 4);;\ngap> IsClique(D, [1, 3, 2]);\ntrue", count := [ 8, 1, 1, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 8, 1, 1, 7 ], mathmode := "Text", name := "Example", next := 364835, root := ~, start := 364375, stop := 364834 ), rec( content := "\n ", count := [ 8, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 1, 5 ], mathmode := "Text", name := "Description", next := 364852, root := ~, start := 363609, stop := 364851 ) ], count := [ 8, 1, 1, 1 ], mathmode := "Text", name := "ManSection", next := 364866, root := ~, start := 363459, stop := 364865 ), rec( content := "\n\n ", count := [ 8, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, hook, u\ ser_param, limit, include,\n exclude, max, size, reps", Name := "CliquesFinder" ), content := 0, count := [ 8, 1, 2, 2 ], mathmode := "Text", name := "Func", next := 364993, root := ~, start := 364887, stop := 364992 ), rec( attributes := rec( ), content := [ rec( content := "The argum\ ent ", count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "u\ ser_param", count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "A", next := 365035, root := ~, start := 365018, stop := 365034 ), rec( content := ".", count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "Returns", next := 365046, root := ~, start := 364996, stop := 365045 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function finds cliques of the digraph ", count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "A", next := 365124, root := ~, start := 365110, stop := 365123 ), rec( content := " subject\ to the\n conditions imposed by the other arguments as described below. Not\ e\n that a clique is represented by the immutable list of the vertices that\ \n it contains.\n ", count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "P", next := 365312, root := ~, start := 365308, stop := 365311 ), rec( content := "\n\n \ Let ", count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "C", next := 365330, root := ~, start := 365322, stop := 365329 ), rec( content := " denote \ the automorphism group of the maximal symmetric\n subdigraph of ", count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "A", next := 365418, root := ~, start := 365404, stop := 365417 ), rec( content := " without\ loops (see ", count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 8, 1, 2, 4 ] , mathmode := "Text", name := "Ref", next := 365497, root := ~, start := 365438, stop := 365496 ), rec( content := " and ", count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Maximal\ SymmetricSubdigraphWithoutLoops" ), content := 0, count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "Ref", next := 365560, root := ~, start := 365502, stop := 365559 ), rec( content := ").\n\n \ ", count := [ 8, 1, 2, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( attributes := rec( ), content := [ rec( content :\ = "hook", count := [ 8, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 8, 1, 2, 5 ], mathmode := "Text", name := "A", next := 36\ 5598, root := ~, start := 365587, stop := 365597 ) ], count := [ 8, 1, 2, 5 ], name := "Mar\ k", next := 365605, root := ~, start := 365581, stop := 365604 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n This argument should be a f\ unction or ", count := [ 8, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "fail", coun\ t := [ 8, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 1, 2, 6 ], mathmode := "Text", name := "K", next := 365676, root := \ ~, start := 365665, stop := 365675 ), rec( content := ".", count := [ 8, 1, 2,\ 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := 0, count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "P", next\ := 365681, root := ~, start := 365677, stop := 365680 ), rec( content := "\n\ \n If ", count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "hook", coun\ t := [ 8, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 1, 2, 7 ], mathmode := "Text", name := "A", next := 365705, root := \ ~, start := 365694, stop := 365704 ), rec( content := " is a function, then it\ should have two arguments\n ", count := [ 8, 1, 2, 7 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ \ rec( content := "user_param", count := [ 8, 1, 2, 7 ], mathmode := "Text", nam\ e := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 7 ], mathmode := "Text", name\ := "A", next := 365780, root := ~, start := 365763, stop := 365779 ), rec( cont\ ent := " (see below) and a clique ", count := [ 8, 1, 2, 7 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ re\ c( content := "c", count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "C", next\ := 365814, root := ~, start := 365806, stop := 365813 ), rec( content := ". T\ he function\n ", count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes\ := rec( ), content := [ rec( content := "hook", count := [ 8, 1, 2, 7 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 7 ], mat\ hmode := "Text", name := "A", next := 365851, root := ~, start := 365840, stop\ := 365850 ), rec( content := "(", count := [ 8, 1, 2, 7 ], mathmode := "Text"\ , name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec(\ content := "user_param", count := [ 8, 1, 2, 7 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 7 ], mathmode := "Text", name :=\ "A", next := 365869, root := ~, start := 365852, stop := 365868 ), rec( conte\ nt := ", c)", count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "C", next :\ = 365877, root := ~, start := 365837, stop := 365876 ), rec( content := " is c\ alled every time a new\n clique ", count := [ 8, 1, 2, 7 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :=\ [ rec( content := "c", count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "\ C", next := 365928, root := ~, start := 365920, stop := 365927 ), rec( content\ := " is found by ", count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ liquesFinder", count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 8, 1, 2, 7 ], mathmode := "Text", name := "C", next \ := 365961, root := ~, start := 365941, stop := 365960 ), rec( content := ".", coun\ t := [ 8, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := 0, count := [ 8, 1, 2, 8 ], mathmode := "Text", name\ := "P", next := 365966, root := ~, start := 365962, stop := 365965 ), rec( cont\ ent := "\n\n If ", count := [ 8, 1, 2, 8 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "hook", count := [ 8, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 8, 1, 2, 8 ], mathmode := "Text", name := "A", next := 3\ 65990, root := ~, start := 365979, stop := 365989 ), rec( content := " is ", coun\ t := [ 8, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "fail", count := [ 8, 1, 2, 8 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 8 ] , math\ mode := "Text", name := "K", next := 366005, root := ~, start := 365994, stop \ := 366004 ), rec( content := ", then a default function is used that\n \ simply adds every new clique found by ", count := [ 8, 1, 2, 8 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ \ rec( content := "CliquesFinder", count := [ 8, 1, 2, 8 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 8 ], mathmode := "Text", name\ := "C", next := 366110, root := ~, start := 366090, stop := 366109 ), rec( cont\ ent := " to\n ", count := [ 8, 1, 2, 8 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :=\ "user_param", count := [ 8, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 8, 1, 2, 8 ], mathmode := "Text", name := "A", next \ := 366139, root := ~, start := 366122, stop := 366138 ), rec( content := ", wh\ ich must be a list in this case.\n ", count := [ 8, 1, 2, 8 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 6 ], name := "Ite\ m", next := 366189, root := ~, start := 365612, stop := 366188 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "user_param", count := [ 8, 1, 2, 9 ], mathmode := "Text", name := "PCDATA"\ , root := ~ ) ], count := [ 8, 1, 2, 9 ], mathmode := "Text", name := "A", next\ := 366220, root := ~, start := 366203, stop := 366219 ) ], count := [ 8, 1, 2, 9 ], name := "Mar\ k", next := 366227, root := ~, start := 366197, stop := 366226 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n If ", count := [ 8, 1, 2, 1\ 0 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec\ ( ), content := [ rec( content := "hook", count := [ 8, 1, 2, 10 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], mathmode\ := "Text", name := "A", next := 366263, root := ~, start := 366252, stop := 3\ 66262 ), rec( content := " is a function, then ", count := [ 8, 1, 2, 10 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "user_param", count := [ 8, 1, 2, 10 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], mathmode := \ "Text", name := "A", next := 366301, root := ~, start := 366284, stop := 36630\ 0 ), rec( content := " can be any ", count := [ 8, 1, 2, 10 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ r\ ec( content := "GAP", count := [ 8, 1, 2, 10 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], mathmode := "Text", name := "\ Package", next := 23, root := ~, start := 1, stop := 22 ), rec( content := "\n\ object. The object ", count := [ 8, 1, 2, 10 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "user_param", count := [ 8, 1, 2, 10 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], mathmode := "Text", name := "A" , next\ := 366363, root := ~, start := 366346, stop := 366362 ), rec( content := " is\ used as the first argument for\n the function ", count := [ 8, 1, 2, 1\ 0 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec\ ( ), content := [ rec( content := "hook", count := [ 8, 1, 2, 10 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], mathmode\ := "Text", name := "A", next := 366430, root := ~, start := 366419, stop := 3\ 66429 ), rec( content := ". For example, ", count := [ 8, 1, 2, 10 ], mathmode\ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content\ := [ rec( content := "user_param", count := [ 8, 1, 2, 10 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], mathmode := "Te\ xt", name := "A", next := 366462, root := ~, start := 366445, stop := 366461 ) , rec( cont\ ent := " might be a\n list, and ", count := [ 8, 1, 2, 10 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :\ = [ rec( attributes := rec( ), content := [ rec( content := "hook", count := \ [ 8, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :=\ [ 8, 1, 2, 10 ], mathmode := "Text", name := "A", next := 366506, root := ~, \ start := 366495, stop := 366505 ), rec( content := "(", count := [ 8, 1, 2, 10\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ ), content := [ rec( content := "user_param", count := [ 8, 1, 2, 10 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], mat\ hmode := "Text", name := "A", next := 366524, root := ~, start := 366507, stop\ := 366523 ), rec( content := ", c)", count := [ 8, 1, 2, 10 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], mathmode := "\ Text", name := "C", next := 366532, root := ~, start := 366492, stop := 366531\ ), rec( content := " might add the size\n of the clique ", count := [ \ 8, 1, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "c", count := [ 8, 1, 2, 10 ], ma\ thmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], math\ mode := "Text", name := "C", next := 366582, root := ~, start := 366574, stop \ := 366581 ), rec( content := " to the list ", count := [ 8, 1, 2, 10 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conte\ nt := [ rec( content := "user_param", count := [ 8, 1, 2, 10 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], mathmode := "\ Text", name := "A", next := 366612, root := ~, start := 366595, stop := 366611\ ), rec( content := ". ", count := [ 8, 1, 2, 10 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ \ 8, 1, 2, 11 ], mathmode := "Text", name := "P", next := 366618, root := ~, star\ t := 366614, stop := 366617 ), rec( content := "\n\n If the value of ", coun\ t := [ 8, 1, 2, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "hook", count := [ 8, 1, 2, 11\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 1\ 1 ], mathmode := "Text", name := "A", next := 366655, root := ~, start := 3666\ 44, stop := 366654 ), rec( content := " is ", count := [ 8, 1, 2, 11 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conte\ nt := [ rec( content := "fail", count := [ 8, 1, 2, 11 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 11 ], mathmode := "Text", name\ := "K", next := 366670, root := ~, start := 366659, stop := 366669 ), rec( cont\ ent := ", then the value of\n ", count := [ 8, 1, 2, 11 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ \ rec( content := "user_param", count := [ 8, 1, 2, 11 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 11 ], mathmode := "Text", name\ := "A", next := 366715, root := ~, start := 366698, stop := 366714 ), rec( cont\ ent := " must be a list.\n ", count := [ 8, 1, 2, 11 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 10 ], name := "Item", next := 3667\ 45, root := ~, start := 366234, stop := 366744 ), rec( attributes := rec( ), content := [ rec( attr\ ibutes := rec( ), content := [ rec( content := "limit", count := [ 8, 1, 2, 1\ 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, \ 12 ], mathmode := "Text", name := "A", next := 366771, root := ~, start := 366\ 759, stop := 366770 ) ], count := [ 8, 1, 2, 12 ], name := "Mark", next := 3667\ 78, root := ~, start := 366753, stop := 366777 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n This argument should be a positive integer or ", count := [ \ 8, 1, 2, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "infinity", count := [ 8, 1, 2, 1\ 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, \ 13 ], mathmode := "Text", name := "K", next := 366861, root := ~, start := 366\ 846, stop := 366860 ), rec( content := ".\n ", count := [ 8, 1, 2, 13 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "CliquesFinder", count := [ 8, 1, 2, 13 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 13 ], mathmode \ := "Text", name := "C", next := 366891, root := ~, start := 366871, stop := 36\ 6890 ), rec( content := " will return after it has found\n ", count := [ \ 8, 1, 2, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "limit", count := [ 8, 1, 2, 13 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 13 ] , math\ mode := "Text", name := "A", next := 366943, root := ~, start := 366931, stop \ := 366942 ), rec( content := " cliques or the search is complete.\n ", coun\ t := [ 8, 1, 2, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 13 ], name := "Ite\ m", next := 366992, root := ~, start := 366785, stop := 366991 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "include", count := [ 8, 1, 2, 14 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 8, 1, 2, 14 ], mathmode := "Text", name := "A", next\ := 367020, root := ~, start := 367006, stop := 367019 ), rec( content := " an\ d ", count := [ 8, 1, 2, 14 ], mathmode := "Text", name := "PCDATA", root := ~\ ), rec( attributes := rec( ), content := [ rec( content := "exclude", count \ := [ 8, 1, 2, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count\ := [ 8, 1, 2, 14 ], mathmode := "Text", name := "A", next := 367039, root := \ ~, start := 367025, stop := 367038 ) ], count := [ 8, 1, 2, 14 ], name := "Mar\ k", next := 367046, root := ~, start := 367000, stop := 367045 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n These arguments should each\ be a (possibly empty) duplicate-free list\n of vertices of ", count :=\ [ 8, 1, 2, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "digraph", count := [ 8, 1, 2,\ 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2\ , 15 ], mathmode := "Text", name := "A", next := 367175, root := ~, start := 3\ 67161, stop := 367174 ), rec( content := " (i.e. positive integers less than t\ he\n number of vertices of ", count := [ 8, 1, 2, 15 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ r\ ec( content := "digraph", count := [ 8, 1, 2, 15 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 15 ], mathmode := "Text", name \ := "A", next := 367258, root := ~, start := 367244, stop := 367257 ), rec( cont\ ent := "). ", count := [ 8, 1, 2, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 2, 16 ], math\ mode := "Text", name := "P", next := 367265, root := ~, start := 367261, stop \ := 367264 ), rec( content := "\n\n ", count := [ 8, 1, 2, 16 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conten\ t := [ rec( content := "CliquesFinder", count := [ 8, 1, 2, 16 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 16 ], mathmode :=\ "Text", name := "C", next := 367295, root := ~, start := 367275, stop := 3672\ 94 ), rec( content := " will only look for cliques containing all of the\n \ vertices in ", count := [ 8, 1, 2, 16 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "in\ clude", count := [ 8, 1, 2, 16 ], mathmode := "Text", name := "PCDATA", root :\ = ~ ) ], count := [ 8, 1, 2, 16 ], mathmode := "Text", name := "A", next := 36\ 7379, root := ~, start := 367365, stop := 367378 ), rec( content := " and cont\ aining none of the vertices in\n ", count := [ 8, 1, 2, 16 ], mathmode \ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content \ := [ rec( content := "exclude", count := [ 8, 1, 2, 16 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 16 ], mathmode := "Text", name\ := "A", next := 367441, root := ~, start := 367427, stop := 367440 ), rec( cont\ ent := ". ", count := [ 8, 1, 2, 16 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 2, 17 ], math\ mode := "Text", name := "P", next := 367447, root := ~, start := 367443, stop \ := 367446 ), rec( content := "\n\n Note that the search may be much mor\ e efficient if each of these lists\n is invariant under the action of " , coun\ t := [ 8, 1, 2, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "G", count := [ 8, 1, 2, 17 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 17 ] , math\ mode := "Text", name := "C", next := 367577, root := ~, start := 367569, stop \ := 367576 ), rec( content := " on sets of vertices.\n ", count := [ 8, 1,\ 2, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 15 ], name := "Ite\ m", next := 367612, root := ~, start := 367053, stop := 367611 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "max", count := [ 8, 1, 2, 18 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 8, 1, 2, 18 ], mathmode := "Text", name := "A", next := \ 367636, root := ~, start := 367626, stop := 367635 ) ], count := [ 8, 1, 2, 18 ], name := "Mar\ k", next := 367643, root := ~, start := 367620, stop := 367642 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n This argument should be ", coun\ t := [ 8, 1, 2, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "true", count := [ 8, 1, 2, 19\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 1\ 9 ], mathmode := "Text", name := "K", next := 367700, root := ~, start := 3676\ 89, stop := 367699 ), rec( content := " or ", count := [ 8, 1, 2, 19 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conte\ nt := [ rec( content := "false", count := [ 8, 1, 2, 19 ], mathmode := "Text",\ name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 19 ], mathmode := "Text" , name\ := "K", next := 367716, root := ~, start := 367704, stop := 367715 ), rec( cont\ ent := ". If ", count := [ 8, 1, 2, 19 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "max"\ , count := [ 8, 1, 2, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ] , coun\ t := [ 8, 1, 2, 19 ], mathmode := "Text", name := "A", next := 367732, root :=\ ~, start := 367722, stop := 367731 ), rec( content := " is\n true then\ ", count := [ 8, 1, 2, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "CliquesFinder", count := [ 8,\ 1, 2, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8\ , 1, 2, 19 ], mathmode := "Text", name := "C", next := 367774, root := ~, star\ t := 367754, stop := 367773 ), rec( content := " will only search for ", count\ := [ 8, 1, 2, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "maximal", count := [ 8, 1, 2,\ 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2\ , 19 ], mathmode := "Text", name := "E", next := 367810, root := ~, start := 3\ 67796, stop := 367809 ), rec( content := "\n cliques. If ", count := [ \ 8, 1, 2, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "max", count := [ 8, 1, 2, 19 ], \ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 19 ], math\ mode := "Text", name := "K", next := 367841, root := ~, start := 367831, stop \ := 367840 ), rec( content := " is ", count := [ 8, 1, 2, 19 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ r\ ec( content := "false", count := [ 8, 1, 2, 19 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 19 ], mathmode := "Text", name :=\ "K", next := 367857, root := ~, start := 367845, stop := 367856 ), rec( conte\ nt := " then non-maximal cliques may be\n found.\n ", count := [ 8\ , 1, 2, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 19 ], name := "Ite\ m", next := 367918, root := ~, start := 367650, stop := 367917 ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( content \ := "size", count := [ 8, 1, 2, 20 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 8, 1, 2, 20 ], mathmode := "Text", name := "A", next :=\ 367943, root := ~, start := 367932, stop := 367942 ) ], count := [ 8, 1, 2, 20 ], name := "Mar\ k", next := 367950, root := ~, start := 367926, stop := 367949 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n This argument should be ", coun\ t := [ 8, 1, 2, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "fail", count := [ 8, 1, 2, 21\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 2\ 1 ], mathmode := "Text", name := "K", next := 368007, root := ~, start := 3679\ 96, stop := 368006 ), rec( content := " or a positive integer.\n If ", coun\ t := [ 8, 1, 2, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "size", count := [ 8, 1, 2, 21\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 2\ 1 ], mathmode := "Text", name := "A", next := 368053, root := ~, start := 3680\ 42, stop := 368052 ), rec( content := " is a positive integer then ", count :=\ [ 8, 1, 2, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "CliquesFinder", count := [ 8,\ 1, 2, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8\ , 1, 2, 21 ], mathmode := "Text", name := "C", next := 368101, root := ~, star\ t := 368081, stop := 368100 ), rec( content := " will\n only search for\ cliques that contain precisely ", count := [ 8, 1, 2, 21 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec\ ( content := "size", count := [ 8, 1, 2, 21 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ 8, 1, 2, 21 ], mathmode := "Text", name := "A\ ", next := 368173, root := ~, start := 368162, stop := 368172 ), rec( content \ := " vertices.\n If ", count := [ 8, 1, 2, 21 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "size", count := [ 8, 1, 2, 21 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 8, 1, 2, 21 ], mathmode := "Text", name := "A", next\ := 368206, root := ~, start := 368195, stop := 368205 ), rec( content := " is\ ", count := [ 8, 1, 2, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "fail", count := [ 8, 1, 2, 21\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 2\ 1 ], mathmode := "Text", name := "K", next := 368221, root := ~, start := 3682\ 10, stop := 368220 ), rec( content := " then cliques of any size may be found.\ \n ", count := [ 8, 1, 2, 21 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 8, 1, 2, 21 ], name := "Item", next := 368274, root := ~, start := 367\ 957, stop := 368273 ), rec( attributes := rec( ), content := [ rec( attribute\ s := rec( ), content := [ rec( content := "reps", count := [ 8, 1, 2, 22 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 22 ], math\ mode := "Text", name := "A", next := 368299, root := ~, start := 368288, stop \ := 368298 ) ], count := [ 8, 1, 2, 22 ], name := "Mark", next := 368306, root := ~, start := 368\ 282, stop := 368305 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n This argument should be ", count := [ 8, 1, 2, 23 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ \ rec( content := "true", count := [ 8, 1, 2, 23 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 23 ], mathmode := "Text", name :=\ "K", next := 368363, root := ~, start := 368352, stop := 368362 ), rec( conte\ nt := " or ", count := [ 8, 1, 2, 23 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "false", cou\ nt := [ 8, 1, 2, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 1, 2, 23 ], mathmode := "Text", name := "K", next := 368379, root :=\ ~, start := 368367, stop := 368378 ), rec( content := ".", count := [ 8, 1, 2\ , 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := 0, count := [ 8, 1, 2, 24 ], mathmode := "Text", name := "P" , next\ := 368384, root := ~, start := 368380, stop := 368383 ), rec( content := "\n\ \n If ", count := [ 8, 1, 2, 24 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "reps", coun\ t := [ 8, 1, 2, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 1, 2, 24 ], mathmode := "Text", name := "A", next := 368408, root :=\ ~, start := 368397, stop := 368407 ), rec( content := " is ", count := [ 8, 1\ , 2, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes \ := rec( ), content := [ rec( content := "true", count := [ 8, 1, 2, 24 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 24 ], math\ mode := "Text", name := "K", next := 368423, root := ~, start := 368412, stop \ := 368422 ), rec( content := " then the arguments ", count := [ 8, 1, 2, 24 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "include", count := [ 8, 1, 2, 24 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 24 ], mathmode := "Te\ xt", name := "A", next := 368457, root := ~, start := 368443, stop := 368456 ) , rec( cont\ ent := " and\n ", count := [ 8, 1, 2, 24 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "exclude", count := [ 8, 1, 2, 24 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 8, 1, 2, 24 ], mathmode := "Text", name := "A", next\ := 368484, root := ~, start := 368470, stop := 368483 ), rec( content := " ar\ e each required to be invariant under the action of\n ", count := [ 8, \ 1, 2, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes\ := rec( ), content := [ rec( content := "G", count := [ 8, 1, 2, 24 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 24 ], math\ mode := "Text", name := "C", next := 368555, root := ~, start := 368547, stop \ := 368554 ), rec( content := " on sets of vertices. In this case, ", count :=\ [ 8, 1, 2, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "CliquesFinder", count := [ 8,\ 1, 2, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8\ , 1, 2, 24 ], mathmode := "Text", name := "C", next := 368612, root := ~, star\ t := 368592, stop := 368611 ), rec( content := " will\n find representa\ tives of the orbits of the desired cliques under the\n action of ", coun\ t := [ 8, 1, 2, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "G", count := [ 8, 1, 2, 24 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 24 ] , math\ mode := "Text", name := "C", next := 368720, root := ~, start := 368712, stop \ := 368719 ), rec( content := ", ", count := [ 8, 1, 2, 24 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec\ ( content := "although representatives may be returned that\n are in \ the same orbit", count := [ 8, 1, 2, 24 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 8, 1, 2, 24 ], mathmode := "Text", name := "E", next\ := 368806, root := ~, start := 368722, stop := 368805 ), rec( content := ".\n\ If ", count := [ 8, 1, 2, 24 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "reps", coun\ t := [ 8, 1, 2, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 1, 2, 24 ], mathmode := "Text", name := "A", next := 368830, root :=\ ~, start := 368819, stop := 368829 ), rec( content := " is false then ", coun\ t := [ 8, 1, 2, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "CliquesFinder", count := [ 8,\ 1, 2, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8\ , 1, 2, 24 ], mathmode := "Text", name := "C", next := 368865, root := ~, star\ t := 368845, stop := 368864 ), rec( content := " will not take this into\n \ consideration.", count := [ 8, 1, 2, 24 ], mathmode := "Text", name := "PC\ DATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1,\ 2, 25 ], mathmode := "Text", name := "P", next := 368916, root := ~, start :=\ 368912, stop := 368915 ), rec( content := "\n\n For a digraph such tha\ t ", count := [ 8, 1, 2, 25 ], mathmode := "Text", name := "PCDATA", root := ~\ ), rec( attributes := rec( ), content := [ rec( content := "G", count := [ 8\ , 1, 2, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ \ 8, 1, 2, 25 ], mathmode := "Text", name := "C", next := 368958, root := ~, star\ t := 368950, stop := 368957 ), rec( content := " is non-trivial, the search fo\ r\n clique representatives can be much more efficient than the search f\ or\n all cliques.\n ", count := [ 8, 1, 2, 25 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 23 ], name := "Item", next := 3691\ 02, root := ~, start := 368313, stop := 369101 ) ], count := [ 8, 1, 2, 5 ], mathmode := "Text", name := "List", next := 369114, root := ~, start := 365568, stop := 369113 ), rec( content := "\n\n \ This function uses a version of the Bron-Kerbosch algorithm.\n ", count := [ 8, 1, 2, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(5);\n\n\ gap> user_param := [];;\ngap> f := function(a, b) # Calculate size of clique\ \n> AddSet(user_param, Size(b));\n> end;;\ngap> CliquesFinder(D, f, user_par\ am, infinity, [], [], false, fail,\n> true);\n[ 1, 2, 3, 4, 5\ ]\ngap> CliquesFinder(D, fail, [], 5, [2, 4], [3], false, fail, false);\n[ [ \ 2, 4 ], [ 1, 2, 4 ], [ 2, 4, 5 ], [ 1, 2, 4, 5 ] ]\ngap> CliquesFinder(D, fail\ , [], 2, [2, 4], [3], false, fail, false);\n[ [ 2, 4 ], [ 1, 2, 4 ] ]\ngap> Cl\ iquesFinder(D, fail, [], infinity, [], [], true, 5, false);\n[ [ 1, 2, 3, 4, 5\ ] ]\ngap> CliquesFinder(D, fail, [], infinity, [1, 3], [], false, 3, false);\ \n[ [ 1, 2, 3 ], [ 1, 3, 4 ], [ 1, 3, 5 ] ]\ngap> CliquesFinder(D, fail, [], i\ nfinity, [1, 3], [], true, 3, false);\n[ ]\ngap> D := CompleteDigraph(IsMutab\ leDigraph, 5);\n\ngap> user_param :\ = [];;\ngap> f := function(a, b) # Calculate size of clique\n> AddSet(user_\ param, Size(b));\n> end;;\ngap> CliquesFinder(D, f, user_param, infinity, [], \ [], false, fail,\n> true);\n[ 1, 2, 3, 4, 5 ]\ngap> CliquesFi\ nder(D, fail, [], 5, [2, 4], [3], false, fail, false);\n[ [ 2, 4 ], [ 1, 2, 4 \ ], [ 2, 4, 5 ], [ 1, 2, 4, 5 ] ]\ngap> CliquesFinder(D, fail, [], 2, [2, 4], [\ 3], false, fail, false);\n[ [ 2, 4 ], [ 1, 2, 4 ] ]\ngap> CliquesFinder(D, fai\ l, [], infinity, [], [], true, 5, false);\n[ [ 1, 2, 3, 4, 5 ] ]\ngap> Cliques\ Finder(D, fail, [], infinity, [1, 3], [], false, 3, false);\n[ [ 1, 2, 3 ], [ \ 1, 3, 4 ], [ 1, 3, 5 ] ]\ngap> CliquesFinder(D, fail, [], infinity, [1, 3], []\ , true, 3, false);\n[ ]", count := [ 8, 1, 2, 28 ], name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 28 ], mathmode := "Text", name := "Example", next := 370839, root := ~, start := 369185, stop := 370838 ), rec( content := "\n ", count := [ 8, 1, 2, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 2, 3 ], mathmode := "Text", name := "Description", next := 370856, root := ~, start := 365049, stop := 370855 ) ], count := [ 8, 1, 2, 1 ], mathmode := "Text", name := "ManSection", next := 370870, root := ~, start := 364872, stop := 370869 ), rec( content := "\n\n ", count := [ 8, 1, 2, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph[, includ\ e[, exclude[, size]]]", Name := "DigraphClique" ), content := 0, count := [ 8, 1, 3, 2 ], mathmode := "Text", name := "Func", next := 370963, root := ~, start := 370891, stop := 370962 ), rec( attributes := rec( Arg := "digraph[, includ\ e[, exclude[,\n size]]]", Name := "DigraphMaximalClique" ), content := 0, count := [ 8, 1, 3, 4 ], mathmode := "Text", name := "Func", next := 371049, root := ~, start := 370966, stop := 371048 ), rec( attributes := rec( ), content := [ rec( content := "An immuta\ ble list of positive integers, or ", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "K", next := 371115, root := ~, start := 371104, stop := 371114 ), rec( content := ".", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "Returns", next := 371126, root := ~, start := 371052, stop := 371125 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "A", next := 371164, root := ~, start := 371150, stop := 371163 ), rec( content := " is a di\ graph, then these functions returns a clique\n of ", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "A", next := 371238, root := ~, start := 371224, stop := 371237 ), rec( content := " if one \ exists that satisfies the arguments, else it\n returns ", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "K", next := 371314, root := ~, start := 371303, stop := 371313 ), rec( content := ". A cli\ que is defined by the set of vertices that it\n contains; see ", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsCliqu\ e" ), content := 0, count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "Ref", next := 371408, root := ~, start := 371386, stop := 371407 ), rec( content := " and ", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsMaxim\ alClique" ), content := 0, count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "Ref", next := 371442, root := ~, start := 371413, stop := 371441 ), rec( content := ".", count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "P", next := 371447, root := ~, start := 371443, stop := 371446 ), rec( content := "\n\n \ The optional arguments ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371490, root := ~, start := 371476, stop := 371489 ), rec( content := " and ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371509, root := ~, start := 371495, stop := 371508 ), rec( content := " must ea\ ch be a\n (possibly empty) duplicate-free list of vertices of ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371595, root := ~, start := 371581, stop := 371594 ), rec( content := ", and\n \ the optional argument ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371638, root := ~, start := 371627, stop := 371637 ), rec( content := " must be\ a positive integer. By default,\n ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371698, root := ~, start := 371684, stop := 371697 ), rec( content := " and ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371717, root := ~, start := 371703, stop := 371716 ), rec( content := " are emp\ ty. These functions will search for\n a clique of ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371791, root := ~, start := 371777, stop := 371790 ), rec( content := " that in\ cludes the vertices of ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371836, root := ~, start := 371822, stop := 371835 ), rec( content := "\n bu\ t does not include any vertices in ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371892, root := ~, start := 371878, stop := 371891 ), rec( content := "; if the\ argument\n ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 371925, root := ~, start := 371914, stop := 371924 ), rec( content := " is supp\ lied, then additionally the clique will be required to\n contain precisely \ ", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "A", next := 372021, root := ~, start := 372010, stop := 372020 ), rec( content := " vertice\ s.", count := [ 8, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 3, 7 ], mathmode := "Text", name := "P", next := 372035, root := ~, start := 372031, stop := 372034 ), rec( content := "\n\n \ If ", count := [ 8, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 7 ], mathmode := "Text", name := "A", next := 372058, root := ~, start := 372044, stop := 372057 ), rec( content := " is not \ a clique, then these functions return ", count := [ 8, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 8, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 7 ], mathmode := "Text", name := "K", next := 372115, root := ~, start := 372104, stop := 372114 ), rec( content := ".\n O\ therwise, the functions behave in the following way, depending on the\n num\ ber of arguments:\n\n ", count := [ 8, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "One or two arguments", count := [ 8, 1\ , 3, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 8 ], name := "Mar\ k", next := 372268, root := ~, start := 372235, stop := 372267 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n If one or two arguments are\ supplied, then ", count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Dig\ raphClique", count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "PCDATA", ro\ ot := ~ ) ], count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "C", next :=\ 372353, root := ~, start := 372333, stop := 372352 ), rec( content := " and\n\ ", count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "DigraphMaxi\ malClique", count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "C", next := \ 372393, root := ~, start := 372366, stop := 372392 ), rec( content := " greedi\ ly enlarge the clique ", count := [ 8, 1, 3, 9 ], mathmode := "Text", name := \ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :\ = "include", count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "PCDATA", ro\ ot := ~ ) ], count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "A", next :=\ 372436, root := ~, start := 372422, stop := 372435 ), rec( content := "\n \ until it can not continue. The result is guaranteed to be a maximal\n \ clique. This may or may not return an answer more quickly than using\n \ ", count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "PCDATA", root := \ ~ ), rec( attributes := rec( Func := "DigraphMaximalCliques" ), content := 0, coun\ t := [ 8, 1, 3, 9 ], mathmode := "Text", name := "Ref", next := 372634, root :\ = ~, start := 372599, stop := 372633 ), rec( content := ". with a limit of 1.\ \n ", count := [ 8, 1, 3, 9 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 8, 1, 3, 9 ], name := "Item", next := 372669, root := ~, start := 372\ 275, stop := 372668 ), rec( attributes := rec( ), content := [ rec( content :\ = "Three arguments", count := [ 8, 1, 3, 10 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ 8, 1, 3, 10 ], name := "Mark", next := 372704 , root := ~, start := 372\ 676, stop := 372703 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n If three arguments are supplied, then ", count := [ 8, 1, 3, 11 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "DigraphClique", count := [ 8, 1, 3, 11 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 11 ], mathmode \ := "Text", name := "C", next := 372784, root := ~, start := 372764, stop := 37\ 2783 ), rec( content := " greedily\n enlarges the clique ", count := [ \ 8, 1, 3, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "include", count := [ 8, 1, 3, 11\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 1\ 1 ], mathmode := "Text", name := "A", next := 372836, root := ~, start := 3728\ 22, stop := 372835 ), rec( content := " until it can not continue, although\n \ this clique may not be maximal.", count := [ 8, 1, 3, 11 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :=\ 0, count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "P", next := 372916, root\ := ~, start := 372912, stop := 372915 ), rec( content := "\n\n Given t\ hree arguments, ", count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Di\ graphMaximalClique", count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "C\ ", next := 372976, root := ~, start := 372949, stop := 372975 ), rec( content \ := " returns the maximal\n clique returned by ", count := [ 8, 1, 3, 12\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ ), content := [ rec( content := "DigraphMaximalCliques(", count := [ 8, 1, 3\ , 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, \ 3, 12 ], mathmode := "Text", name := "C", next := 373053, root := ~, start := \ 373024, stop := 373052 ), rec( attributes := rec( ), content := [ rec( conten\ t := "digraph", count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "PCDATA"\ , root := ~ ) ], count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "A", next\ := 373067, root := ~, start := 373053, stop := 373066 ), rec( attributes := re\ c( ), content := [ rec( content := ",\n ", count := [ 8, 1, 3, 12 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 12 ], math\ mode := "Text", name := "C", next := 373084, root := ~, start := 373067, stop \ := 373083 ), rec( attributes := rec( ), content := [ rec( content := "include\ ", count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "PCDATA", root := ~ )\ ], count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "A", next := 373098, root\ := ~, start := 373084, stop := 373097 ), rec( attributes := rec( ), content \ := [ rec( content := ", ", count := [ 8, 1, 3, 12 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 12 ], mathmode := "Text", name\ := "C", next := 373107, root := ~, start := 373098, stop := 373106 ), rec( attr\ ibutes := rec( ), content := [ rec( content := "exclude", count := [ 8, 1, 3,\ 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3\ , 12 ], mathmode := "Text", name := "A", next := 373121, root := ~, start := 3\ 73107, stop := 373120 ), rec( attributes := rec( ), content := [ rec( content\ := ", 1)", count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "PCDATA", ro\ ot := ~ ) ], count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "C", next :\ = 373132, root := ~, start := 373121, stop := 373131 ), rec( content := " if o\ ne exists,\n else ", count := [ 8, 1, 3, 12 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "fail", count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "K", next\ := 373172, root := ~, start := 373161, stop := 373171 ), rec( content := ".\n\ ", count := [ 8, 1, 3, 12 ], mathmode := "Text", name := "PCDATA", root \ := ~ ) ], count := [ 8, 1, 3, 11 ], name := "Item", next := 373187, root := ~, start := 372\ 711, stop := 373186 ), rec( attributes := rec( ), content := [ rec( content :\ = "Four arguments", count := [ 8, 1, 3, 13 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 8, 1, 3, 13 ], name := "Mark", next := 373221, root := ~, start := 373\ 194, stop := 373220 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n If four arguments are supplied, then ", count := [ 8, 1, 3, 14 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "DigraphClique", count := [ 8, 1, 3, 14 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 14 ], mathmode \ := "Text", name := "C", next := 373300, root := ~, start := 373280, stop := 37\ 3299 ), rec( content := " returns the\n clique returned by ", count := [ \ 8, 1, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribu\ tes := rec( ), content := [ rec( content := "DigraphCliques(", count := [ 8, \ 1, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8,\ 1, 3, 14 ], mathmode := "Text", name := "C", next := 373362, root := ~, start\ := 373340, stop := 373361 ), rec( attributes := rec( ), content := [ rec( co\ ntent := "digraph", count := [ 8, 1, 3, 14 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 8, 1, 3, 14 ], mathmode := "Text", name := "A" , next\ := 373376, root := ~, start := 373362, stop := 373375 ), rec( attributes := re\ c( ), content := [ rec( content := ",\n ", count := [ 8, 1, 3, 14 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 14 ] , math\ mode := "Text", name := "C", next := 373395, root := ~, start := 373376, stop \ := 373394 ), rec( attributes := rec( ), content := [ rec( content := "include\ ", count := [ 8, 1, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ )\ ], count := [ 8, 1, 3, 14 ], mathmode := "Text", name := "A", next := 373409, root\ := ~, start := 373395, stop := 373408 ), rec( attributes := rec( ), content \ := [ rec( content := ", ", count := [ 8, 1, 3, 14 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 14 ], mathmode := "Text", name\ := "C", next := 373418, root := ~, start := 373409, stop := 373417 ), rec( attr\ ibutes := rec( ), content := [ rec( content := "exclude", count := [ 8, 1, 3,\ 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3\ , 14 ], mathmode := "Text", name := "A", next := 373432, root := ~, start := 3\ 73418, stop := 373431 ), rec( attributes := rec( ), content := [ rec( content\ := ", 1,\n ", count := [ 8, 1, 3, 14 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 8, 1, 3, 14 ], mathmode := "Text", name := "\ C", next := 373452, root := ~, start := 373432, stop := 373451 ), rec( attribu\ tes := rec( ), content := [ rec( content := "size", count := [ 8, 1, 3, 14 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 14 ] , math\ mode := "Text", name := "A", next := 373463, root := ~, start := 373452, stop \ := 373462 ), rec( attributes := rec( ), content := [ rec( content := ")", cou\ nt := [ 8, 1, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 1, 3, 14 ], mathmode := "Text", name := "C", next := 373471, root :=\ ~, start := 373463, stop := 373470 ), rec( content := " if one exists, else " , coun\ t := [ 8, 1, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "fail", count := [ 8, 1, 3, 14\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 1\ 4 ], mathmode := "Text", name := "K", next := 373503, root := ~, start := 3734\ 92, stop := 373502 ), rec( content := ". This clique may\n not be maxim\ al.", count := [ 8, 1, 3, 14 ], mathmode := "Text", name := "PCDATA", root := \ ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 3, 15 ], mathm\ ode := "Text", name := "P", next := 373548, root := ~, start := 373544, stop :\ = 373547 ), rec( content := " Given four arguments, ", count := [ 8, 1, 3, 15 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "DigraphMaximalClique", count := [ 8, 1, 3, 15 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 15 ], math\ mode := "Text", name := "C", next := 373598, root := ~, start := 373571, stop \ := 373597 ), rec( content := "\n returns the maximal clique returned by\ \n ", count := [ 8, 1, 3, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "DigraphMaxi\ malCliques(", count := [ 8, 1, 3, 15 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 8, 1, 3, 15 ], mathmode := "Text", name := "C", next\ := 373683, root := ~, start := 373654, stop := 373682 ), rec( attributes := re\ c( ), content := [ rec( content := "digraph", count := [ 8, 1, 3, 15 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 15 ], math\ mode := "Text", name := "A", next := 373697, root := ~, start := 373683, stop \ := 373696 ), rec( attributes := rec( ), content := [ rec( content := ", ", co\ unt := [ 8, 1, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 1, 3, 15 ], mathmode := "Text", name := "C", next := 373706, root :=\ ~, start := 373697, stop := 373705 ), rec( attributes := rec( ), content := [ \ rec( content := "include", count := [ 8, 1, 3, 15 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 15 ], mathmode := "Text", name\ := "A", next := 373720, root := ~, start := 373706, stop := 373719 ), rec( attr\ ibutes := rec( ), content := [ rec( content := ",\n ", count := [ 8, 1\ , 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, \ 1, 3, 15 ], mathmode := "Text", name := "C", next := 373737, root := ~, start \ := 373720, stop := 373736 ), rec( attributes := rec( ), content := [ rec( con\ tent := "exclude", count := [ 8, 1, 3, 15 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 8, 1, 3, 15 ], mathmode := "Text", name := "A", next\ := 373751, root := ~, start := 373737, stop := 373750 ), rec( attributes := re\ c( ), content := [ rec( content := ", 1, ", count := [ 8, 1, 3, 15 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 15 ], mathmo\ de := "Text", name := "C", next := 373763, root := ~, start := 373751, stop :=\ 373762 ), rec( attributes := rec( ), content := [ rec( content := "size", co\ unt := [ 8, 1, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 1, 3, 15 ], mathmode := "Text", name := "A", next := 373774, root :=\ ~, start := 373763, stop := 373773 ), rec( attributes := rec( ), content := [ \ rec( content := ")", count := [ 8, 1, 3, 15 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ 8, 1, 3, 15 ], mathmode := "Text", name := "C\ ", next := 373782, root := ~, start := 373774, stop := 373781 ), rec( content \ := " if one exists, else\n ", count := [ 8, 1, 3, 15 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ r\ ec( content := "fail", count := [ 8, 1, 3, 15 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ 8, 1, 3, 15 ], mathmode := "Text", name := \ "K", next := 373822, root := ~, start := 373811, stop := 373821 ), rec( conten\ t := ".\n ", count := [ 8, 1, 3, 15 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 8, 1, 3, 14 ], name := "Item", next := 373837, root := ~, start := 373\ 228, stop := 373836 ) ], count := [ 8, 1, 3, 8 ], mathmode := "Text", name := "List", next := 373849, root := ~, start := 372222, stop := 373848 ), rec( content := "\n\n \ ", count := [ 8, 1, 3, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([[2, 3, 4], [1, 3], [1, 2], [1, 5], []]);\n\ngap> IsSymmetricDigraph(D);\nfalse\ngap> Digraph\ Clique(D);\n[ 5 ]\ngap> DigraphMaximalClique(D);\n[ 5 ]\ngap> DigraphClique(D,\ [1, 2]);\n[ 1, 2, 3 ]\ngap> DigraphMaximalClique(D, [1, 3]);\n[ 1, 3, 2 ]\nga\ p> DigraphClique(D, [1], [2]);\n[ 1, 4 ]\ngap> DigraphMaximalClique(D, [1], [3\ , 4]);\nfail\ngap> DigraphClique(D, [1, 5]);\nfail\ngap> DigraphClique(D, [], \ [], 2);\n[ 1, 2 ]\ngap> D := Digraph(IsMutableDigraph,\n> [[2,\ 3, 4], [1, 3], [1, 2], [1, 5], []]);\n\ngap> IsSymmetricDigraph(D);\nfalse\ngap> DigraphClique(D);\n[ 5 ]", count := [ 8, 1, 3, 18 ], name := "PCD\ ATA", root := ~ ) ], count := [ 8, 1, 3, 18 ], mathmode := "Text", name := "Example", next := 374554, root := ~, start := 373855, stop := 374553 ), rec( content := "\n ", count := [ 8, 1, 3, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 3, 5 ], mathmode := "Text", name := "Description", next := 374571, root := ~, start := 371129, stop := 374570 ) ], count := [ 8, 1, 3, 1 ], mathmode := "Text", name := "ManSection", next := 374585, root := ~, start := 370876, stop := 374584 ), rec( content := "\n\n ", count := [ 8, 1, 3, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph[, includ\ e[, exclude[, limit[, size]]]]", Name := "DigraphMaximalCliques" ), content := 0, count := [ 8, 1, 4, 2 ], mathmode := "Text", name := "Func", next := 374695, root := ~, start := 374606, stop := 374694 ), rec( attributes := rec( Arg := "digraph[, includ\ e[, exclude[,\n limit[, size]]]]", Name := "DigraphMaximalCliquesReps" ), content := 0, count := [ 8, 1, 4, 4 ], mathmode := "Text", name := "Func", next := 374795, root := ~, start := 374698, stop := 374794 ), rec( attributes := rec( Arg := "digraph[, includ\ e[, exclude[,\n limit[, size]]]]", Name := "DigraphCliques" ), content := 0, count := [ 8, 1, 4, 6 ], mathmode := "Text", name := "Func", next := 374884, root := ~, start := 374798, stop := 374883 ), rec( attributes := rec( Arg := "digraph[, includ\ e[,\n exclude[, limit[, size]]]]", Name := "DigraphCliquesReps" ), content := 0, count := [ 8, 1, 4, 8 ], mathmode := "Text", name := "Func", next := 374977, root := ~, start := 374887, stop := 374976 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphMaximalC\ liquesAttr" ), content := 0, count := [ 8, 1, 4, 10 ], mathmode := "Text", name := "Attr", next := 375034, root := ~, start := 374980, stop := 375033 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphMaximalC\ liquesRepsAttr" ), content := 0, count := [ 8, 1, 4, 12 ], mathmode := "Text", name := "Attr", next := 375095, root := ~, start := 375037, stop := 375094 ), rec( attributes := rec( ), content := [ rec( content := "An immuta\ ble list of lists of positive integers.", count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "Returns", next := 375165, root := ~, start := 375098, stop := 375164 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "A", next := 375203, root := ~, start := 375189, stop := 375202 ), rec( content := " is digr\ aph, then these functions and attributes use ", count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Cliques\ Finder" ), content := 0, count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "Ref", next := 375289, root := ~, start := 375256, stop := 375288 ), rec( content := " to retu\ rn cliques of ", count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "A", next := 375325, root := ~, start := 375311, stop := 375324 ), rec( content := ". A\n \ clique is defined by the set of vertices that it contains; see ", count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsCliqu\ e" ), content := 0, count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "Ref", next := 375424, root := ~, start := 375396, stop := 375423 ), rec( content := " and ", count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsMaxim\ alClique" ), content := 0, count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "Ref", next := 375458, root := ~, start := 375429, stop := 375457 ), rec( content := ".", count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "P", next := 375463, root := ~, start := 375459, stop := 375462 ), rec( content := "\n\n \ The optional arguments ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "A", next := 375506, root := ~, start := 375492, stop := 375505 ), rec( content := " and ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "A", next := 375525, root := ~, start := 375511, stop := 375524 ), rec( content := " must ea\ ch be a\n (possibly empty) list of vertices of ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "A", next := 375596, root := ~, start := 375582, stop := 375595 ), rec( content := ", the op\ tional argument\n ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ imit", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "A", next := 375636, root := ~, start := 375624, stop := 375635 ), rec( content := " must be\ either a positive integer or ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "C", next := 375689, root := ~, start := 375674, stop := 375688 ), rec( content := ", and th\ e\n optional argument ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "A", next := 375732, root := ~, start := 375721, stop := 375731 ), rec( content := " must be\ a positive integer. If not\n specified, then ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "A", next := 375803, root := ~, start := 375789, stop := 375802 ), rec( content := " and ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "A", next := 375822, root := ~, start := 375808, stop := 375821 ), rec( content := " are cho\ sen to be empty\n lists, and ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ imit", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "A", next := 375873, root := ~, start := 375861, stop := 375872 ), rec( content := " is set \ to ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "C", next := 375899, root := ~, start := 375884, stop := 375898 ), rec( content := ". ", count := [ 8, 1, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "P", next := 375905, root := ~, start := 375901, stop := 375904 ), rec( content := "\n\n \ The functions will return as many suitable cliques as possible, up to the\n \ number ", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ imit", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "A", next := 376008, root := ~, start := 375996, stop := 376007 ), rec( content := ". These\ functions will find cliques that contain all\n of the vertices of ", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "A", next := 376099, root := ~, start := 376085, stop := 376098 ), rec( content := " but do \ not contain any of the\n vertices of ", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "A", next := 376160, root := ~, start := 376146, stop := 376159 ), rec( content := ". The a\ rgument ", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "A", next := 376187, root := ~, start := 376176, stop := 376186 ), rec( content := " restric\ ts the search\n to those cliques that contain precisely ", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "A", next := 376264, root := ~, start := 376253, stop := 376263 ), rec( content := " vertice\ s.\n If the function or attribute has ", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "M\ aximal", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "C", next := 376326, root := ~, start := 376312, stop := 376325 ), rec( content := " in its \ name, then only\n maximal cliques will be returned; otherwise non-maximal c\ liques may be\n returned. ", count := [ 8, 1, 4, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "P", next := 376443, root := ~, start := 376439, stop := 376442 ), rec( content := "\n\n \ Let ", count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "C", next := 376461, root := ~, start := 376453, stop := 376460 ), rec( content := " denote \ the automorphism group of maximal symmetric subdigraph\n of ", count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "A", next := 376545, root := ~, start := 376531, stop := 376544 ), rec( content := " without\ loops (see ", count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "Ref", next := 376624, root := ~, start := 376565, stop := 376623 ), rec( content := " and ", count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Maximal\ SymmetricSubdigraphWithoutLoops" ), content := 0, count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "Ref", next := 376687, root := ~, start := 376629, stop := 376686 ), rec( content := ").\n\n \ ", count := [ 8, 1, 4, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Distinct cliques", count := [ 8, 1, 4,\ 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 17 ], name := "Mar\ k", next := 376737, root := ~, start := 376708, stop := 376736 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n ", count := [ 8, 1, 4, 18 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "DigraphMaximalCliques", count := [ 8, 1, 4, 18 ], ma\ thmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 18 ], math\ mode := "Text", name := "C", next := 376787, root := ~, start := 376759, stop \ := 376786 ), rec( content := " and ", count := [ 8, 1, 4, 18 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ \ rec( content := "DigraphCliques", count := [ 8, 1, 4, 18 ], mathmode := "Text"\ , name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 18 ], mathmode := "Text\ ", name := "C", next := 376813, root := ~, start := 376792, stop := 376812 ), rec( cont\ ent := " each return a\n duplicate-free list of at most ", count := [ 8\ , 1, 4, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := [ rec( content := "limit", count := [ 8, 1, 4, 18 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 18 ] , math\ mode := "Text", name := "A", next := 376879, root := ~, start := 376867, stop \ := 376878 ), rec( content := " cliques of ", count := [ 8, 1, 4, 18 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conten\ t := [ rec( content := "digraph", count := [ 8, 1, 4, 18 ], mathmode := "Text"\ , name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 18 ], mathmode := "Text\ ", name := "A", next := 376905, root := ~, start := 376891, stop := 376904 ), rec( cont\ ent := "\n that satisfy the arguments.", count := [ 8, 1, 4, 18 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := 0, count := [ 8, 1, 4, 19 ], mathmode := "Text", name := "P", next := 3\ 76945, root := ~, start := 376941, stop := 376944 ), rec( content := "\n\n \ The computation may be significantly faster if ", count := [ 8, 1, 4, 19 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "include", count := [ 8, 1, 4, 19 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 19 ], mathmode := "Te\ xt", name := "A", next := 377016, root := ~, start := 377002, stop := 377015 ) , rec( cont\ ent := " and\n ", count := [ 8, 1, 4, 19 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "exclude", count := [ 8, 1, 4, 19 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 8, 1, 4, 19 ], mathmode := "Text", name := "A", next\ := 377043, root := ~, start := 377029, stop := 377042 ), rec( content := " ar\ e invariant under the action of ", count := [ 8, 1, 4, 19 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec\ ( content := "G", count := [ 8, 1, 4, 19 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 8, 1, 4, 19 ], mathmode := "Text", name := "C", next\ := 377086, root := ~, start := 377078, stop := 377085 ), rec( content := "\n \ on sets of vertices.\n ", count := [ 8, 1, 4, 19 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 18 ], name := "Item\ ", next := 377129, root := ~, start := 376744, stop := 377128 ), rec( attributes :\ = rec( ), content := [ rec( content := "Orbit representatives of cliques", coun\ t := [ 8, 1, 4, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 20 ], name := "Mar\ k", next := 377182, root := ~, start := 377137, stop := 377181 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n To use ", count := [ 8, 1, \ 4, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :=\ rec( ), content := [ rec( content := "DigraphMaximalCliquesReps", count := [\ 8, 1, 4, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ \ 8, 1, 4, 21 ], mathmode := "Text", name := "C", next := 377243, root := ~, star\ t := 377211, stop := 377242 ), rec( content := " or ", count := [ 8, 1, 4, 21 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "DigraphCliquesReps", count := [ 8, 1, 4, 21 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 21 ], math\ mode := "Text", name := "C", next := 377272, root := ~, start := 377247, stop \ := 377271 ), rec( content := ",\n the arguments ", count := [ 8, 1, 4, \ 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "include", count := [ 8, 1, 4, 21 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 21 ], math\ mode := "Text", name := "A", next := 377310, root := ~, start := 377296, stop \ := 377309 ), rec( content := " and ", count := [ 8, 1, 4, 21 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ \ rec( content := "exclude", count := [ 8, 1, 4, 21 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 21 ], mathmode := "Text", name\ := "A", next := 377329, root := ~, start := 377315, stop := 377328 ), rec( cont\ ent := " must each be invariant\n under the action of ", count := [ 8, \ 1, 4, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes\ := rec( ), content := [ rec( content := "G", count := [ 8, 1, 4, 21 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 21 ], math\ mode := "Text", name := "C", next := 377389, root := ~, start := 377381, stop \ := 377388 ), rec( content := " on sets of vertices.", count := [ 8, 1, 4, 21 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := 0, count := [ 8, 1, 4, 22 ], mathmode := "Text", name := "P", next := 3\ 77414, root := ~, start := 377410, stop := 377413 ), rec( content := "\n\n \ If this is the case, then ", count := [ 8, 1, 4, 22 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "DigraphMaximalCliquesReps", count := [ 8, 1, 4, 22 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 22 ], mathmode := "Tex\ t", name := "C", next := 377482, root := ~, start := 377450, stop := 377481 ), rec( cont\ ent := " and\n ", count := [ 8, 1, 4, 22 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "DigraphCliquesReps", count := [ 8, 1, 4, 22 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 22 ], mathmode := "Text", name :\ = "C", next := 377520, root := ~, start := 377495, stop := 377519 ), rec( cont\ ent := " each return a duplicate-free list of at most\n ", count := [ 8\ , 1, 4, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := [ rec( content := "limit", count := [ 8, 1, 4, 22 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 22 ] , math\ mode := "Text", name := "A", next := 377586, root := ~, start := 377574, stop \ := 377585 ), rec( content := " orbits representatives (under the action of ", coun\ t := [ 8, 1, 4, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "G", count := [ 8, 1, 4, 22 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 22 ] , math\ mode := "Text", name := "C", next := 377639, root := ~, start := 377631, stop \ := 377638 ), rec( content := " on\n sets vertices) of cliques of ", coun\ t := [ 8, 1, 4, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "digraph", count := [ 8, 1, 4,\ 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4\ , 22 ], mathmode := "Text", name := "A", next := 377694, root := ~, start := 3\ 77680, stop := 377693 ), rec( content := " that satisfy the\n arguments\ .", count := [ 8, 1, 4, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := 0, count := [ 8, 1, 4, 23 ], mathmode := "Text", name\ := "P", next := 377734, root := ~, start := 377730, stop := 377733 ), rec( cont\ ent := "\n\n The representatives are not guaranteed to be in distinct o\ rbits.\n However, if fewer than ", count := [ 8, 1, 4, 23 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :\ = [ rec( content := "lim", count := [ 8, 1, 4, 23 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 23 ], mathmode := "Text", name\ := "A", next := 377850, root := ~, start := 377840, stop := 377849 ), rec( cont\ ent := " results are returned, then there\n will be at least one repres\ entative from each orbit of maximal cliques.\n ", count := [ 8, 1, 4, 23 ] , math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 21 ], name := "Ite\ m", next := 377977, root := ~, start := 377189, stop := 377976 ) ], count := [ 8, 1, 4, 17 ], mathmode := "Text", name := "List", next := 377989, root := ~, start := 376695, stop := 377988 ), rec( content := "\n\n \ ", count := [ 8, 1, 4, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := Digraph([\n> [2, 3], [1, 3], [1, 2, 4], [3, 5, 6], [4, 6], [4, 5]])\ ;\n\ngap> IsSymmetricDigraph(D);\ \ntrue\ngap> G := AutomorphismGroup(D);\nGroup([ (5,6), (1,2), (1,5)(2,6)(3,4)\ ])\ngap> DigraphMaximalCliques(D);\n[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 3, 4 ] ]\ng\ ap> DigraphMaximalCliquesReps(D);\n[ [ 1, 2, 3 ], [ 3, 4 ] ]\ngap> Orbit(G, [1\ , 2, 3], OnSets);\n[ [ 1, 2, 3 ], [ 4, 5, 6 ] ]\ngap> Orbit(G, [3, 4], OnSets)\ ;\n[ [ 3, 4 ] ]\ngap> DigraphMaximalCliquesReps(D, [3, 4], [], 1);\n[ [ 3, 4 ]\ ]\ngap> DigraphMaximalCliques(D, [1, 2], [5, 6], 1, 2);\n[ ]\ngap> DigraphCl\ iques(D, [1], [5, 6], infinity, 2);\n[ [ 1, 2 ], [ 1, 3 ] ]\ngap> D := Digraph\ (IsMutableDigraph, [\n> [2, 3], [1, 3], [1, 2, 4], [3, 5, 6], [4, 6], [4, 5]])\ ;\n\ngap> IsSymmetricDigraph(D);\nt\ rue\ngap> G := AutomorphismGroup(D);\nGroup([ (5,6), (1,2), (1,5)(2,6)(3,4) ])\ \ngap> DigraphMaximalCliques(D);\n[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 3, 4 ] ]", count := [ 8, 1, 4, 26 ], name := "PCD\ ATA", root := ~ ) ], count := [ 8, 1, 4, 26 ], mathmode := "Text", name := "Example", next := 379004, root := ~, start := 377995, stop := 379003 ), rec( content := "\n ", count := [ 8, 1, 4, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 4, 13 ], mathmode := "Text", name := "Description", next := 379021, root := ~, start := 375168, stop := 379020 ) ], count := [ 8, 1, 4, 1 ], mathmode := "Text", name := "ManSection", next := 379035, root := ~, start := 374591, stop := 379034 ), rec( content := "\n\n ", count := [ 8, 1, 4, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "CliqueNumber" ) , content := 0, count := [ 8, 1, 5, 2 ], mathmode := "Text", name := "Attr", next := 379097, root := ~, start := 379056, stop := 379096 ), rec( attributes := rec( ), content := [ rec( content := "A non-neg\ ative integer.", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "Returns", next := 379142, root := ~, start := 379100, stop := 379141 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "A", next := 379180, root := ~, start := 379166, stop := 379179 ), rec( content := " is a di\ graph, then ", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ liqueNumber(", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "digraph", count := [ 8, 1, 5, 3 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 5, 3 ], mathmode := \ "Text", name := "A", next := 379230, root := ~, start := 379216, stop := 37922\ 9 ), rec( content := ")", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "C", next := 379235, root := ~, start := 379200, stop := 379234 ), rec( content := "\n re\ turns the largest integer ", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "C", next := 379276, root := ~, start := 379268, stop := 379275 ), rec( content := " such th\ at ", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "A", next := 379301, root := ~, start := 379287, stop := 379300 ), rec( content := " contain\ s a\n clique with ", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "C", next := 379337, root := ~, start := 379329, stop := 379336 ), rec( content := " vertice\ s as an induced subdigraph.\n ", count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 1, 5, 4 ], mathmode := "Text", name := "P", next := 379381, root := ~, start := 379377, stop := 379380 ), rec( content := "\n\n \ A ", count := [ 8, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ lique", count := [ 8, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 5, 4 ], mathmode := "Text", name := "E", next := 379402, root := ~, start := 379389, stop := 379401 ), rec( content := " of a di\ graph is a set of mutually adjacent vertices of the\n digraph. Loops and mu\ ltiple edges are ignored for the purpose of\n determining the clique number\ of a digraph. \n ", count := [ 8, 1, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CompleteDigraph(4);;\ngap> CliqueNumber(D);\n4\ngap> D := Digraph([\ [1, 2, 4, 4], [1, 3, 4], [2, 1], [1, 2]]);\n\ngap> CliqueNumber(D);\n3\ngap> D := CompleteDigraph(IsMutabl\ eDigraph, 4);;\ngap> CliqueNumber(D);\n4", count := [ 8, 1, 5, 5 ], name := "PCD\ ATA", root := ~ ) ], count := [ 8, 1, 5, 5 ], mathmode := "Text", name := "Example", next := 379880, root := ~, start := 379584, stop := 379879 ), rec( content := "\n", count := [ 8, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 5, 3 ], mathmode := "Text", name := "Description", next := 379895, root := ~, start := 379145, stop := 379894 ) ], count := [ 8, 1, 5, 1 ], mathmode := "Text", name := "ManSection", next := 379909, root := ~, start := 379041, stop := 379908 ), rec( content := "\n\n ", count := [ 8, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 1, 0, 1 ], mathmode := "Text", name := "Section", next := 379923, root := ~, start := 363411, stop := 379922 ) , rec( content := "\n\n ", count := [ 8, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Finding independe\ nt sets", count := [ 8, 2, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 0, 2 ], mathmode := "Text", name := "Heading", next := 379979, root := ~, start := 379936, stop := 379978 ), rec( content := "\n ", count := [ 8, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, l", Name := "IsIndependentSe\ t" ), content := 0, count := [ 8, 2, 1, 2 ], mathmode := "Text", name := "Oper", next := 380047, root := ~, start := 379999, stop := 380046 ), rec( attributes := rec( Arg := "digraph, l", Name := "IsMaximalIndepe\ ndentSet" ), content := 0, count := [ 8, 2, 1, 4 ], mathmode := "Text", name := "Oper", next := 380105, root := ~, start := 380050, stop := 380104 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ) , content := [ rec( content := "t\ rue", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "K", next := 380128, root := ~, start := 380117, stop := 380127 ), rec( content := " or ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "K", next := 380144, root := ~, start := 380132, stop := 380143 ), rec( content := ".", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "Returns", next := 380155, root := ~, start := 380108, stop := 380154 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380193, root := ~, start := 380179, stop := 380192 ), rec( content := " is a di\ graph and ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380219, root := ~, start := 380211, stop := 380218 ), rec( content := " is a du\ plicate-free list of\n vertices of ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380278, root := ~, start := 380264, stop := 380277 ), rec( content := ", then\n\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sIndependentSet(", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "C", next := 380313, root := ~, start := 380289, stop := 380312 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380327, root := ~, start := 380313, stop := 380326 ), rec( attributes := rec( ), content := [ rec( content := ",\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "C", next := 380335, root := ~, start := 380327, stop := 380334 ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380343, root := ~, start := 380335, stop := 380342 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "C", next := 380351, root := ~, start := 380343, stop := 380350 ), rec( content := " returns\ \n ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "K", next := 380375, root := ~, start := 380364, stop := 380374 ), rec( content := " if ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380387, root := ~, start := 380379, stop := 380386 ), rec( content := " is an " , count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ndependent set", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "E", next := 380416, root := ~, start := 380394, stop := 380415 ), rec( content := " of ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380434, root := ~, start := 380420, stop := 380433 ), rec( content := " and\n \ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "K", next := 380455, root := ~, start := 380443, stop := 380454 ), rec( content := " if it i\ s not. Similarly,\n ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sMaximalIndependentSet(", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "C", next := 380517, root := ~, start := 380486, stop := 380516 ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380531, root := ~, start := 380517, stop := 380530 ), rec( attributes := rec( ), content := [ rec( content := ",\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "C", next := 380539, root := ~, start := 380531, stop := 380538 ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380547, root := ~, start := 380539, stop := 380546 ), rec( attributes := rec( ), content := [ rec( content := ")\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "C", next := 380555, root := ~, start := 380547, stop := 380554 ), rec( content := "\n re\ turns ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "t\ rue", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "K", next := 380579, root := ~, start := 380568, stop := 380578 ), rec( content := " if ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380591, root := ~, start := 380583, stop := 380590 ), rec( content := " is a ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ aximal independent set", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "E", next := 380627, root := ~, start := 380597, stop := 380626 ), rec( content := " of\n \ ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "A", next := 380649, root := ~, start := 380635, stop := 380648 ), rec( content := " and ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ alse", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "K", next := 380666, root := ~, start := 380654, stop := 380665 ), rec( content := " if it i\ s not. ", count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 2, 1, 6 ], mathmode := "Text", name := "P", next := 380686, root := ~, start := 380682, stop := 380685 ), rec( content := "\n\n \ An ", count := [ 8, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ ndependent set", count := [ 8, 2, 1, 6 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ 8, 2, 1, 6 ], mathmode := "Text", name := "E", next := 380717, root := ~, start := 380695, stop := 380716 ), rec( content := " of a di\ graph is a set of mutually non-adjacent\n vertices of the digraph. A ", count := [ 8, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ aximal independent set", count := [ 8, 2, 1, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 8, 2, 1, 6 ], mathmode := "Text", name := "E", next := 380826, root := ~, start := 380796, stop := 380825 ), rec( content := " is an i\ ndependent\n set that is not properly contained in another independent set.\ An\n independent set is permitted, but not required, to contain vertices a\ t\n which there is a loop.\n ", count := [ 8, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(4);;\ngap> IsIndependentSet(D, [1]);\ntrue\ngap> IsMax\ imalIndependentSet(D, [1]);\nfalse\ngap> IsIndependentSet(D, [1, 4, 3]);\nfals\ e\ngap> IsIndependentSet(D, [2, 4]);\ntrue\ngap> IsMaximalIndependentSet(D, [2\ , 4]);\ntrue\ngap> D := CycleDigraph(IsMutableDigraph, 4);;\ngap> IsIndependen\ tSet(D, [1]);\ntrue", count := [ 8, 2, 1, 7 ], name := "PCDATA", root := ~ ) ] , count := [ 8, 2, 1, 7 ], mathmode := "Text", name := "Example", next := 381370, root := ~, start := 381021, stop := 381369 ), rec( content := "\n ", count := [ 8, 2, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 1, 5 ], mathmode := "Text", name := "Description", next := 381387, root := ~, start := 380158, stop := 381386 ) ], count := [ 8, 2, 1, 1 ], mathmode := "Text", name := "ManSection", next := 381401, root := ~, start := 379984, stop := 381400 ), rec( content := "\n\n ", count := [ 8, 2, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph[, includ\ e[, exclude[, size]]]", Name := "DigraphIndependentSet" ), content := 0, count := [ 8, 2, 2, 2 ], mathmode := "Text", name := "Func", next := 381506, root := ~, start := 381422, stop := 381505 ), rec( attributes := rec( Arg := "digraph[, includ\ e[, exclude[,\n size]]]", Name := "DigraphMaximalIndependentSet" ), content := 0, count := [ 8, 2, 2, 4 ], mathmode := "Text", name := "Func", next := 381604, root := ~, start := 381509, stop := 381603 ), rec( attributes := rec( ), content := [ rec( content := "An immuta\ ble list of positive integers, or ", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "K", next := 381670, root := ~, start := 381659, stop := 381669 ), rec( content := ".", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "Returns", next := 381681, root := ~, start := 381607, stop := 381680 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "A", next := 381719, root := ~, start := 381705, stop := 381718 ), rec( content := " is a di\ graph, then these functions returns an independent\n set of ", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "A", next := 381803, root := ~, start := 381789, stop := 381802 ), rec( content := " if one \ exists that satisfies the arguments, else it\n returns ", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "K", next := 381879, root := ~, start := 381868, stop := 381878 ), rec( content := ". An in\ dependent set is defined by the set of vertices\n that it contains; see ", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsIndep\ endentSet" ), content := 0, count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "Ref", next := 381991, root := ~, start := 381961, stop := 381990 ), rec( content := " and ", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsMaxim\ alIndependentSet" ), content := 0, count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "Ref", next := 382039, root := ~, start := 381996, stop := 382038 ), rec( content := ".", count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "P", next := 382044, root := ~, start := 382040, stop := 382043 ), rec( content := "\n\n \ The optional arguments ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382087, root := ~, start := 382073, stop := 382086 ), rec( content := " and ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382106, root := ~, start := 382092, stop := 382105 ), rec( content := " must ea\ ch be a\n (possibly empty) duplicate-free list of vertices of ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382192, root := ~, start := 382178, stop := 382191 ), rec( content := ", and th\ e\n optional argument ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382235, root := ~, start := 382224, stop := 382234 ), rec( content := " must be\ a positive integer. By default,\n ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382295, root := ~, start := 382281, stop := 382294 ), rec( content := " and ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382314, root := ~, start := 382300, stop := 382313 ), rec( content := " are emp\ ty. These functions will search\n for an independent set of ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382398, root := ~, start := 382384, stop := 382397 ), rec( content := " that in\ cludes the vertices of\n ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382447, root := ~, start := 382433, stop := 382446 ), rec( content := " but doe\ s not include any vertices in ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382499, root := ~, start := 382485, stop := 382498 ), rec( content := ";\n i\ f the argument ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382532, root := ~, start := 382521, stop := 382531 ), rec( content := " is supp\ lied, then additionally the independent\n set will be required to contain p\ recisely ", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "A", next := 382637, root := ~, start := 382626, stop := 382636 ), rec( content := " vertice\ s.", count := [ 8, 2, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 2, 2, 7 ], mathmode := "Text", name := "P", next := 382651, root := ~, start := 382647, stop := 382650 ), rec( content := "\n\n \ If ", count := [ 8, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 7 ], mathmode := "Text", name := "A", next := 382674, root := ~, start := 382660, stop := 382673 ), rec( content := " is not \ an independent set, then these functions return\n ", count := [ 8, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ail", count := [ 8, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 7 ], mathmode := "Text", name := "K", next := 382745, root := ~, start := 382734, stop := 382744 ), rec( content := ". Other\ wise, the functions behave in the following way,\n depending on the number \ of arguments:\n\n ", count := [ 8, 2, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "One or two arguments", count := [ 8, 2\ , 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 8 ], name := "Mar\ k", next := 382895, root := ~, start := 382862, stop := 382894 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n If one or two arguments are\ supplied, then ", count := [ 8, 2, 2, 9 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Dig\ raphIndependentSet", count := [ 8, 2, 2, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 8, 2, 2, 9 ], mathmode := "Text", name := "C", next\ := 382988, root := ~, start := 382960, stop := 382987 ), rec( content := "\n \ and ", count := [ 8, 2, 2, 9 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "DigraphMaxi\ malIndependentSet", count := [ 8, 2, 2, 9 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 8, 2, 2, 9 ], mathmode := "Text", name := "C", next\ := 383036, root := ~, start := 383001, stop := 383035 ), rec( content := " gr\ eedily enlarge the\n independent set ", count := [ 8, 2, 2, 9 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conte\ nt := [ rec( content := "include", count := [ 8, 2, 2, 9 ], mathmode := "Text"\ , name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 9 ], mathmode := "Text" , name\ := "A", next := 383096, root := ~, start := 383082, stop := 383095 ), rec( cont\ ent := " until it can not continue. The result\n is guaranteed to be a\ maximal independent set. This may or may not\n return an answer more q\ uickly than using ", count := [ 8, 2, 2, 9 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Func := "DigraphMaximalIndependentS\ ets" ), content := 0, count := [ 8, 2, 2, 9 ], mathmode := "Text", name := "Re\ f", next := 383313, root := ~, start := 383260, stop := 383312 ), rec( content\ := ". with a limit of 1.\n ", count := [ 8, 2, 2, 9 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 9 ], name := "Item", next := 3833\ 48, root := ~, start := 382902, stop := 383347 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "Three arguments", count := [ 8, 2, 2, 10 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 10 ], name := "Mark", next := 3833\ 83, root := ~, start := 383355, stop := 383382 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n If three arguments are supplied, then ", count := [ 8, 2, 2,\ 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "DigraphIndependentSet", count := [ 8, 2, \ 2, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2,\ 2, 11 ], mathmode := "Text", name := "C", next := 383471, root := ~, start :=\ 383443, stop := 383470 ), rec( content := "\n greedily enlarges the in\ dependent set ", count := [ 8, 2, 2, 11 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "incl\ ude", count := [ 8, 2, 2, 11 ], mathmode := "Text", name := "PCDATA", root := \ ~ ) ], count := [ 8, 2, 2, 11 ], mathmode := "Text", name := "A", next := 3835\ 32, root := ~, start := 383518, stop := 383531 ), rec( content := " until it c\ an not\n continue, although this independent set may not be maximal.", coun\ t := [ 8, 2, 2, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := 0, count := [ 8, 2, 2, 12 ], mathmode := "Text", name\ := "P", next := 383621, root := ~, start := 383617, stop := 383620 ), rec( cont\ ent := "\n\n Given three arguments, ", count := [ 8, 2, 2, 12 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), conte\ nt := [ rec( content := "DigraphMaximalIndependentSet", count := [ 8, 2, 2, 12\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 1\ 2 ], mathmode := "Text", name := "C", next := 383689, root := ~, start := 3836\ 54, stop := 383688 ), rec( content := " returns the\n maximal independe\ nt set returned by\n ", count := [ 8, 2, 2, 12 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "DigraphMaximalIndependentSets(", count := [ 8, 2, 2, 12 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 12 ], mathmode :=\ "Text", name := "C", next := 383791, root := ~, start := 383754, stop := 3837\ 90 ), rec( attributes := rec( ), content := [ rec( content := "digraph", coun\ t := [ 8, 2, 2, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 2, 2, 12 ], mathmode := "Text", name := "A", next := 383805, root :=\ ~, start := 383791, stop := 383804 ), rec( attributes := rec( ), content := [ \ rec( content := ",\n ", count := [ 8, 2, 2, 12 ], mathmode := "Text", n\ ame := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 12 ], mathmode := "Text", name\ := "C", next := 383822, root := ~, start := 383805, stop := 383821 ), rec( attr\ ibutes := rec( ), content := [ rec( content := "include", count := [ 8, 2, 2,\ 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2\ , 12 ], mathmode := "Text", name := "A", next := 383836, root := ~, start := 3\ 83822, stop := 383835 ), rec( attributes := rec( ), content := [ rec( content\ := ", ", count := [ 8, 2, 2, 12 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 8, 2, 2, 12 ], mathmode := "Text", name := "C", next := \ 383845, root := ~, start := 383836, stop := 383844 ), rec( attributes := rec( \ ), content := [ rec( content := "exclude", count := [ 8, 2, 2, 12 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 12 ], mathmod\ e := "Text", name := "A", next := 383859, root := ~, start := 383845, stop := \ 383858 ), rec( attributes := rec( ), content := [ rec( content := ", 1)", cou\ nt := [ 8, 2, 2, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 2, 2, 12 ], mathmode := "Text", name := "C", next := 383870, root :=\ ~, start := 383859, stop := 383869 ), rec( content := " if one exists,\n \ else ", count := [ 8, 2, 2, 12 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "fail", coun\ t := [ 8, 2, 2, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 2, 2, 12 ], mathmode := "Text", name := "K", next := 383910, root :=\ ~, start := 383899, stop := 383909 ), rec( content := ".\n ", count := [ \ 8, 2, 2, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 11 ], name := "Ite\ m", next := 383925, root := ~, start := 383390, stop := 383924 ), rec( attributes :\ = rec( ), content := [ rec( content := "Four arguments", count := [ 8, 2, 2, \ 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 13 ], name := "Mar\ k", next := 383959, root := ~, start := 383932, stop := 383958 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n If four arguments are suppl\ ied, then ", count := [ 8, 2, 2, 14 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "DigraphInde\ pendentSet", count := [ 8, 2, 2, 14 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 8, 2, 2, 14 ], mathmode := "Text", name := "C", next \ := 384046, root := ~, start := 384018, stop := 384045 ), rec( content := "\n \ returns the independent set returned by\n ", count := [ 8, 2, 2, \ 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "DigraphIndependentSets(", count := [ 8, 2\ , 2, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, \ 2, 2, 14 ], mathmode := "Text", name := "C", next := 384133, root := ~, start \ := 384103, stop := 384132 ), rec( attributes := rec( ), content := [ rec( con\ tent := "digraph", count := [ 8, 2, 2, 14 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 8, 2, 2, 14 ], mathmode := "Text", name := "A", next\ := 384147, root := ~, start := 384133, stop := 384146 ), rec( attributes := re\ c( ), content := [ rec( content := ", ", count := [ 8, 2, 2, 14 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 14 ], mathmode \ := "Text", name := "C", next := 384156, root := ~, start := 384147, stop := 38\ 4155 ), rec( attributes := rec( ), content := [ rec( content := "include", co\ unt := [ 8, 2, 2, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 2, 2, 14 ], mathmode := "Text", name := "A", next := 384170, root :=\ ~, start := 384156, stop := 384169 ), rec( attributes := rec( ), content := [ \ rec( content := ",\n ", count := [ 8, 2, 2, 14 ], mathmode := "Text", n\ ame := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 14 ], mathmode := "Text", name\ := "C", next := 384187, root := ~, start := 384170, stop := 384186 ), rec( attr\ ibutes := rec( ), content := [ rec( content := "exclude", count := [ 8, 2, 2,\ 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2\ , 14 ], mathmode := "Text", name := "A", next := 384201, root := ~, start := 3\ 84187, stop := 384200 ), rec( attributes := rec( ), content := [ rec( content\ := ", 1, ", count := [ 8, 2, 2, 14 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 8, 2, 2, 14 ], mathmode := "Text", name := "C", next \ := 384213, root := ~, start := 384201, stop := 384212 ), rec( attributes := re\ c( ), content := [ rec( content := "size", count := [ 8, 2, 2, 14 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 14 ], mathmod\ e := "Text", name := "A", next := 384224, root := ~, start := 384213, stop := \ 384223 ), rec( attributes := rec( ), content := [ rec( content := ")", count \ := [ 8, 2, 2, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count\ := [ 8, 2, 2, 14 ], mathmode := "Text", name := "C", next := 384232, root := \ ~, start := 384224, stop := 384231 ), rec( content := " if one exists, else\n \ ", count := [ 8, 2, 2, 14 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "fail", coun\ t := [ 8, 2, 2, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 2, 2, 14 ], mathmode := "Text", name := "K", next := 384272, root :=\ ~, start := 384261, stop := 384271 ), rec( content := ". This independent set\ may not be maximal.", count := [ 8, 2, 2, 14 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, \ 2, 2, 15 ], mathmode := "Text", name := "P", next := 384318, root := ~, start \ := 384314, stop := 384317 ), rec( content := " Given four\n arguments, \ ", count := [ 8, 2, 2, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attr\ ibutes := rec( ), content := [ rec( content := "DigraphMaximalIndependentSet"\ , count := [ 8, 2, 2, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ] , coun\ t := [ 8, 2, 2, 15 ], mathmode := "Text", name := "C", next := 384384, root :=\ ~, start := 384349, stop := 384383 ), rec( content := " returns the maximal\n\ independent set returned by\n ", count := [ 8, 2, 2, 15 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "DigraphMaximalIndependentSets(", count := [ 8, 2, 2,\ 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2\ , 15 ], mathmode := "Text", name := "C", next := 384486, root := ~, start := 3\ 84449, stop := 384485 ), rec( attributes := rec( ), content := [ rec( content\ := "digraph", count := [ 8, 2, 2, 15 ], mathmode := "Text", name := "PCDATA",\ root := ~ ) ], count := [ 8, 2, 2, 15 ], mathmode := "Text", name := "A", next\ := 384500, root := ~, start := 384486, stop := 384499 ), rec( attributes := re\ c( ), content := [ rec( content := ",\n ", count := [ 8, 2, 2, 15 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 15 ] , math\ mode := "Text", name := "C", next := 384519, root := ~, start := 384500, stop \ := 384518 ), rec( attributes := rec( ), content := [ rec( content := "include\ ", count := [ 8, 2, 2, 15 ], mathmode := "Text", name := "PCDATA", root := ~ )\ ], count := [ 8, 2, 2, 15 ], mathmode := "Text", name := "A", next := 384533, root\ := ~, start := 384519, stop := 384532 ), rec( attributes := rec( ), content \ := [ rec( content := ", ", count := [ 8, 2, 2, 15 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 15 ], mathmode := "Text", name\ := "C", next := 384542, root := ~, start := 384533, stop := 384541 ), rec( attr\ ibutes := rec( ), content := [ rec( content := "exclude", count := [ 8, 2, 2,\ 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2\ , 15 ], mathmode := "Text", name := "A", next := 384556, root := ~, start := 3\ 84542, stop := 384555 ), rec( attributes := rec( ), content := [ rec( content\ := ", 1,\n ", count := [ 8, 2, 2, 15 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 8, 2, 2, 15 ], mathmode := "Text", name := "\ C", next := 384576, root := ~, start := 384556, stop := 384575 ), rec( attribu\ tes := rec( ), content := [ rec( content := "size", count := [ 8, 2, 2, 15 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 15 ] , math\ mode := "Text", name := "A", next := 384587, root := ~, start := 384576, stop \ := 384586 ), rec( attributes := rec( ), content := [ rec( content := ")", cou\ nt := [ 8, 2, 2, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 2, 2, 15 ], mathmode := "Text", name := "C", next := 384595, root :=\ ~, start := 384587, stop := 384594 ), rec( content := " if one exists, else " , coun\ t := [ 8, 2, 2, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "fail", count := [ 8, 2, 2, 15\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 1\ 5 ], mathmode := "Text", name := "K", next := 384627, root := ~, start := 3846\ 16, stop := 384626 ), rec( content := ".\n ", count := [ 8, 2, 2, 15 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 14 ], name := "Ite\ m", next := 384642, root := ~, start := 383966, stop := 384641 ) ], count := [ 8, 2, 2, 8 ], mathmode := "Text", name := "List", next := 384654, root := ~, start := 382849, stop := 384653 ), rec( content := "\n ", count := [ 8, 2, 2, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := ChainDigraph(6);\n\ngap> D\ igraphIndependentSet(D);\n[ 6, 4, 2 ]\ngap> DigraphMaximalIndependentSet(D);\n\ [ 6, 4, 2 ]\ngap> DigraphIndependentSet(D, [2, 4]);\n[ 2, 4, 6 ]\ngap> Digraph\ MaximalIndependentSet(D, [1, 3]);\n[ 1, 3, 6 ]\ngap> DigraphIndependentSet(D, \ [2, 4], [6]);\n[ 2, 4 ]\ngap> DigraphMaximalIndependentSet(D, [2, 4], [6]);\nf\ ail\ngap> DigraphIndependentSet(D, [1], [], 2);\n[ 1, 3 ]\ngap> DigraphMaximal\ IndependentSet(D, [1], [], 2);\nfail\ngap> DigraphMaximalIndependentSet(D, [1]\ , [], 3);\n[ 1, 3, 5 ]\ngap> D := ChainDigraph(IsMutableDigraph, 6);\n\ngap> DigraphIndependentSet(D);\n[ 6, 4, 2 \ ]\ngap> DigraphMaximalIndependentSet(D);\n[ 6, 4, 2 ]\ngap> DigraphIndependent\ Set(D, [2, 4]);\n[ 2, 4, 6 ]\ngap> DigraphMaximalIndependentSet(D, [1, 3]);\n[\ 1, 3, 6 ]\ngap> DigraphIndependentSet(D, [2, 4], [6]);\n[ 2, 4 ]\ngap> Digrap\ hMaximalIndependentSet(D, [2, 4], [6]);\nfail\ngap> DigraphIndependentSet(D, [\ 1], [], 2);\n[ 1, 3 ]\ngap> DigraphMaximalIndependentSet(D, [1], [], 2);\nfail\ \ngap> DigraphMaximalIndependentSet(D, [1], [], 3);\n[ 1, 3, 5 ]", count := [ 8, 2, 2, 18 ], name := "PCD\ ATA", root := ~ ) ], count := [ 8, 2, 2, 18 ], mathmode := "Text", name := "Example", next := 385807, root := ~, start := 384659, stop := 385806 ), rec( content := "\n ", count := [ 8, 2, 2, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 2, 5 ], mathmode := "Text", name := "Description", next := 385824, root := ~, start := 381684, stop := 385823 ) ], count := [ 8, 2, 2, 1 ], mathmode := "Text", name := "ManSection", next := 385838, root := ~, start := 381407, stop := 385837 ), rec( content := "\n\n ", count := [ 8, 2, 2, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph[, includ\ e[, exclude[,\n limit[, size]]]]", Name := "DigraphMaximalIndependentSets" ), content := 0, count := [ 8, 2, 3, 2 ], mathmode := "Text", name := "Func", next := 385960, root := ~, start := 385859, stop := 385959 ), rec( attributes := rec( Arg := "digraph[, includ\ e[,\n exclude[, limit[, size]]]]", Name := "DigraphMaximalIndependentSetsRe\ ps" ), content := 0, count := [ 8, 2, 3, 4 ], mathmode := "Text", name := "Func", next := 386068, root := ~, start := 385963, stop := 386067 ), rec( attributes := rec( Arg := "digraph[, includ\ e[,\n exclude[, limit[, size]]]]", Name := "DigraphIndependentSets" ), content := 0, count := [ 8, 2, 3, 6 ], mathmode := "Text", name := "Func", next := 386165, root := ~, start := 386071, stop := 386164 ), rec( attributes := rec( Arg := "digraph[, includ\ e[,\n exclude[, limit[, size]]]]", Name := "DigraphIndependentSetsReps" ), content := 0, count := [ 8, 2, 3, 8 ], mathmode := "Text", name := "Func", next := 386266, root := ~, start := 386168, stop := 386265 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphMaximalI\ ndependentSetsAttr" ), content := 0, count := [ 8, 2, 3, 10 ], mathmode := "Text", name := "Attr", next := 386331, root := ~, start := 386269, stop := 386330 ), rec( attributes := rec( Arg := "digraph", Name := "DigraphMaximalI\ ndependentSetsRepsAttr" ), content := 0, count := [ 8, 2, 3, 12 ], mathmode := "Text", name := "Attr", next := 386400, root := ~, start := 386334, stop := 386399 ), rec( attributes := rec( ), content := [ rec( content := "An immuta\ ble list of lists of positive integers.", count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "Returns", next := 386470, root := ~, start := 386403, stop := 386469 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "A", next := 386508, root := ~, start := 386494, stop := 386507 ), rec( content := " is digr\ aph, then these functions and attributes use ", count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Cliques\ Finder" ), content := 0, count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "Ref", next := 386594, root := ~, start := 386561, stop := 386593 ), rec( content := " to retu\ rn independent sets of ", count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "A", next := 386639, root := ~, start := 386625, stop := 386638 ), rec( content := ". An\n \ independent set is defined by the set of vertices that it contains; see\n \ ", count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsMaxim\ alIndependentSet" ), content := 0, count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "Ref", next := 386761, root := ~, start := 386724, stop := 386760 ), rec( content := " and ", count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "IsIndep\ endentSet" ), content := 0, count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "Ref", next := 386802, root := ~, start := 386766, stop := 386801 ), rec( content := ".", count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "P", next := 386807, root := ~, start := 386803, stop := 386806 ), rec( content := "\n\n \ The optional arguments ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "A", next := 386850, root := ~, start := 386836, stop := 386849 ), rec( content := " and ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "A", next := 386869, root := ~, start := 386855, stop := 386868 ), rec( content := " must ea\ ch be a\n (possibly empty) list of vertices of ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "A", next := 386940, root := ~, start := 386926, stop := 386939 ), rec( content := ", the op\ tional argument\n ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ imit", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "A", next := 386980, root := ~, start := 386968, stop := 386979 ), rec( content := " must be\ either a positive integer or ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "C", next := 387033, root := ~, start := 387018, stop := 387032 ), rec( content := ", and th\ e\n optional argument ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "A", next := 387076, root := ~, start := 387065, stop := 387075 ), rec( content := " must be\ a positive integer. If not\n specified, then ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "A", next := 387147, root := ~, start := 387133, stop := 387146 ), rec( content := " and ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "A", next := 387166, root := ~, start := 387152, stop := 387165 ), rec( content := " are cho\ sen to be empty\n lists, and ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ imit", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "A", next := 387217, root := ~, start := 387205, stop := 387216 ), rec( content := " is set \ to ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nfinity", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "C", next := 387243, root := ~, start := 387228, stop := 387242 ), rec( content := ". ", count := [ 8, 2, 3, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "P", next := 387249, root := ~, start := 387245, stop := 387248 ), rec( content := "\n\n \ The functions will return as many suitable independent sets as possible, up\n \ to the number ", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "l\ imit", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "A", next := 387361, root := ~, start := 387349, stop := 387360 ), rec( content := ". These\ functions will find independent sets\n that contain all of the vertices of\ ", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ nclude", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "A", next := 387461, root := ~, start := 387447, stop := 387460 ), rec( content := " but do \ not\n contain any of the vertices of ", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ xclude", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "A", next := 387522, root := ~, start := 387508, stop := 387521 ), rec( content := " The arg\ ument ", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "A", next := 387547, root := ~, start := 387536, stop := 387546 ), rec( content := "\n re\ stricts the search to those cliques that contain precisely ", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ ize", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "A", next := 387624, root := ~, start := 387613, stop := 387623 ), rec( content := "\n ve\ rtices. If the function or attribute has ", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "M\ aximal", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "C", next := 387687, root := ~, start := 387673, stop := 387686 ), rec( content := " in its \ name,\n then only maximal independent sets will be returned; otherwise non-\ maximal\n independent sets may be returned.\n ", count := [ 8, 2, 3, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "P", next := 387826, root := ~, start := 387822, stop := 387825 ), rec( content := "\n\n \ Let ", count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ ", count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "C", next := 387844, root := ~, start := 387836, stop := 387843 ), rec( content := " denote \ the ", count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "Ref", next := 387909, root := ~, start := 387856, stop := 387908 ), rec( content := "\n of\ the ", count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ SymmetricClosure" ), content := 0, count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "Ref", next := 387958, root := ~, start := 387921, stop := 387957 ), rec( content := " of the \ digraph formed from\n ", count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "A", next := 388004, root := ~, start := 387990, stop := 388003 ), rec( content := " by remo\ ving loops and ignoring the multiplicity of edges.\n\n ", count := [ 8, 2, 3, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Distinct independent sets", count := [ \ 8, 2, 3, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 17 ], name := "Mar\ k", next := 388119, root := ~, start := 388081, stop := 388118 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n ", count := [ 8, 2, 3, 18 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "DigraphMaximalIndependentSets", count := [ 8, 2, 3, \ 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3,\ 18 ], mathmode := "Text", name := "C", next := 388177, root := ~, start := 38\ 8141, stop := 388176 ), rec( content := " and ", count := [ 8, 2, 3, 18 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "DigraphIndependentSets", count := [ 8, 2, 3, 18 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 18 ], math\ mode := "Text", name := "C", next := 388211, root := ~, start := 388182, stop \ := 388210 ), rec( content := "\n each return a duplicate-free list of a\ t most ", count := [ 8, 2, 3, 18 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "limit", cou\ nt := [ 8, 2, 3, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 2, 3, 18 ], mathmode := "Text", name := "A", next := 388277, root :=\ ~, start := 388265, stop := 388276 ), rec( content := " independent\n \ sets of ", count := [ 8, 2, 3, 18 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "digraph", c\ ount := [ 8, 2, 3, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 2, 3, 18 ], mathmode := "Text", name := "A", next := 388320, root :=\ ~, start := 388306, stop := 388319 ), rec( content := " that satisfy the argu\ ments.", count := [ 8, 2, 3, 18 ], mathmode := "Text", name := "PCDATA", root \ := ~ ), rec( attributes := rec( ), content := 0, count := [ 8, 2, 3, 19 ], math\ mode := "Text", name := "P", next := 388352, root := ~, start := 388348, stop \ := 388351 ), rec( content := "\n\n The computation may be significantly\ faster if ", count := [ 8, 2, 3, 19 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "include", c\ ount := [ 8, 2, 3, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 8, 2, 3, 19 ], mathmode := "Text", name := "A", next := 388423, root :=\ ~, start := 388409, stop := 388422 ), rec( content := " and\n ", count\ := [ 8, 2, 3, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "exclude", count := [ 8, 2, 3,\ 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3\ , 19 ], mathmode := "Text", name := "A", next := 388450, root := ~, start := 3\ 88436, stop := 388449 ), rec( content := " are invariant under the action of " , coun\ t := [ 8, 2, 3, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "G", count := [ 8, 2, 3, 19 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 19 ] , math\ mode := "Text", name := "C", next := 388493, root := ~, start := 388485, stop \ := 388492 ), rec( content := " on sets of\n vertices.\n ", count :\ = [ 8, 2, 3, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 18 ], name := "Ite\ m", next := 388536, root := ~, start := 388126, stop := 388535 ), rec( attributes :\ = rec( ), content := [ rec( content := "Representatives of distinct orbits of\ independent sets", count := [ 8, 2, 3, 20 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 8, 2, 3, 20 ], name := "Mark", next := 388611, root := ~, start := 388\ 544, stop := 388610 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n To use ", count := [ 8, 2, 3, 21 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content :=\ "DigraphMaximalIndependentSetsReps", count := [ 8, 2, 3, 21 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 21 ], mathmode := "\ Text", name := "C", next := 388680, root := ~, start := 388640, stop := 388679\ ), rec( content := " or\n ", count := [ 8, 2, 3, 21 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ r\ ec( content := "DigraphIndependentSetsReps", count := [ 8, 2, 3, 21 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 21 ], mathmo\ de := "Text", name := "C", next := 388725, root := ~, start := 388692, stop :=\ 388724 ), rec( content := ", the arguments ", count := [ 8, 2, 3, 21 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "include", count := [ 8, 2, 3, 21 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 21 ], mathmode := "Te\ xt", name := "A", next := 388755, root := ~, start := 388741, stop := 388754 ) , rec( cont\ ent := " and\n ", count := [ 8, 2, 3, 21 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "exclude", count := [ 8, 2, 3, 21 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 8, 2, 3, 21 ], mathmode := "Text", name := "A", next\ := 388782, root := ~, start := 388768, stop := 388781 ), rec( content := " mu\ st each be invariant under the action of ", count := [ 8, 2, 3, 21 ], mathmode\ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content\ := [ rec( content := "G", count := [ 8, 2, 3, 21 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 21 ], mathmode := "Text", name\ := "C", next := 388834, root := ~, start := 388826, stop := 388833 ), rec( cont\ ent := " on\n sets of vertices.", count := [ 8, 2, 3, 21 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :=\ 0, count := [ 8, 2, 3, 22 ], mathmode := "Text", name := "P", next := 388867, root\ := ~, start := 388863, stop := 388866 ), rec( content := "\n\n If this\ is the case, then ", count := [ 8, 2, 3, 22 ], mathmode := "Text", name := "P\ CDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := \ "DigraphMaximalIndependentSetsReps", count := [ 8, 2, 3, 22 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 22 ], mathmode := "T\ ext", name := "C", next := 388943, root := ~, start := 388903, stop := 388942 ), rec( cont\ ent := " and\n ", count := [ 8, 2, 3, 22 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "DigraphIndependentSetsReps", count := [ 8, 2, 3, 22 ], mathmode := "Text",\ name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 22 ], mathmode := "Text" , name\ := "C", next := 388989, root := ~, start := 388956, stop := 388988 ), rec( cont\ ent := " each return a list of\n at most ", count := [ 8, 2, 3, 22 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "limit", count := [ 8, 2, 3, 22 ], mathmode := "Text"\ , name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 22 ], mathmode := "Text\ ", name := "A", next := 389040, root := ~, start := 389028, stop := 389039 ), rec( cont\ ent := " orbits representatives (under the action of\n ", count := [ 8,\ 2, 3, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribute\ s := rec( ), content := [ rec( content := "G", count := [ 8, 2, 3, 22 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 22 ], math\ mode := "Text", name := "C", next := 389101, root := ~, start := 389093, stop \ := 389100 ), rec( content := " on sets of vertices) of independent sets of ", coun\ t := [ 8, 2, 3, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "digraph", count := [ 8, 2, 3,\ 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3\ , 22 ], mathmode := "Text", name := "A", next := 389160, root := ~, start := 3\ 89146, stop := 389159 ), rec( content := "\n that satisfy the arguments\ . ", count := [ 8, 2, 3, 22 ], mathmode := "Text", name := "PCDATA", root := ~\ ), rec( attributes := rec( ), content := 0, count := [ 8, 2, 3, 23 ], mathmo\ de := "Text", name := "P", next := 389201, root := ~, start := 389197, stop :=\ 389200 ), rec( content := "\n\n The representatives are not guaranteed\ to be in distinct orbits.\n However, if ", count := [ 8, 2, 3, 23 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "lim", count := [ 8, 2, 3, 23 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 23 ], mathmode := "Text", name\ := "A", next := 389306, root := ~, start := 389296, stop := 389305 ), rec( cont\ ent := " is not specified, or fewer than ", count := [ 8, 2, 3, 23 ], mathmode\ := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content\ := [ rec( content := "lim", count := [ 8, 2, 3, 23 ], mathmode := "Text", nam\ e := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 23 ], mathmode := "Text", name\ := "A", next := 389349, root := ~, start := 389339, stop := 389348 ), rec( cont\ ent := "\n results are returned, then there will be at least one repres\ entative\n from each orbit of maximal independent sets.\n ", count\ := [ 8, 2, 3, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 21 ], name := "Ite\ m", next := 389493, root := ~, start := 388618, stop := 389492 ) ], count := [ 8, 2, 3, 17 ], mathmode := "Text", name := "List", next := 389505, root := ~, start := 388068, stop := 389504 ), rec( content := "\n\n \ ", count := [ 8, 2, 3, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(5);\n\ngap> D\ igraphMaximalIndependentSetsReps(D);\n[ [ 1, 3 ] ]\ngap> DigraphIndependentSet\ sReps(D);\n[ [ 1 ], [ 1, 3 ] ]\ngap> Set(DigraphMaximalIndependentSets(D));\n[\ [ 1, 3 ], [ 1, 4 ], [ 2, 4 ], [ 2, 5 ], [ 3, 5 ] ]\ngap> DigraphMaximalIndepe\ ndentSets(D, [1]);\n[ [ 1, 3 ], [ 1, 4 ] ]\ngap> DigraphIndependentSets(D, [],\ [4, 5]);\n[ [ 1 ], [ 2 ], [ 3 ], [ 1, 3 ] ]\ngap> DigraphIndependentSets(D, [\ ], [4, 5], 1, 2);\n[ [ 1, 3 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 5);\ \n\ngap> DigraphMaximalIndependentSe\ tsReps(D);\n[ [ 1, 3 ] ]\ngap> DigraphIndependentSetsReps(D);\n[ [ 1 ], [ 1, 3\ ] ]\ngap> Set(DigraphMaximalIndependentSets(D));\n[ [ 1, 3 ], [ 1, 4 ], [ 2, \ 4 ], [ 2, 5 ], [ 3, 5 ] ]\ngap> DigraphMaximalIndependentSets(D, [1]);\n[ [ 1,\ 3 ], [ 1, 4 ] ]\ngap> DigraphIndependentSets(D, [], [4, 5]);\n[ [ 1 ], [ 2 ],\ [ 3 ], [ 1, 3 ] ]\ngap> DigraphIndependentSets(D, [], [4, 5], 1, 2);\n[ [ 1, \ 3 ] ]", count := [ 8, 2, 3, 26 ], name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 26 ], mathmode := "Text", name := "Example", next := 390533, root := ~, start := 389511, stop := 390532 ), rec( content := "\n ", count := [ 8, 2, 3, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 3, 13 ], mathmode := "Text", name := "Description", next := 390550, root := ~, start := 386473, stop := 390549 ) ], count := [ 8, 2, 3, 1 ], mathmode := "Text", name := "ManSection", next := 390564, root := ~, start := 385844, stop := 390563 ), rec( content := "\n\n ", count := [ 8, 2, 3, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 2, 0, 1 ], mathmode := "Text", name := "Section", next := 390578, root := ~, start := 379927, stop := 390577 ) , rec( content := "\n", count := [ 8, 2, 3, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 8, 0, 0, 1 ], mathmode := "Text", name := "Chapter", next := 390589, root := ~, start := 358650, stop := 390588 ), rec( content := "\n ", count := [ 8, 2, 3, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " cliques ", count := [ 8, 2, 3, 27 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n ", count := [ 8, 2, 3, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "Visualising and IO" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Visualising and IO", count := [ 9, 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 390683, root := ~, start := 390646, stop := 390682 ) , rec( content := "\n\n ", count := [ 9, 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Visualising a dig\ raph", count := [ 9, 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 390736, root := ~, start := 390696, stop := 390735 ), rec( content := "\n ", count := [ 9, 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "str, [opts]", Name := "Splash" ), content := 0, count := [ 9, 1, 1, 2 ], mathmode := "Text", name := "Func", next := 390799, root := ~, start := 390760, stop := 390798 ), rec( attributes := rec( ), content := [ rec( content := "Nothing." , count := [ 9, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 3 ], mathmode := "Text", name := "Returns", next := 390831, root := ~, start := 390804, stop := 390830 ), rec( attributes := rec( ), content := [ rec( content := "\n T\ his function attempts to convert the string ", count := [ 9, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tr", count := [ 9, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 3 ], mathmode := "Text", name := "A", next := 390911, root := ~, start := 390901, stop := 390910 ), rec( content := " into a \ pdf\n document and open this document, i.e. to splash it all over your mo\ nitor.", count := [ 9, 1, 1, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "P", next := 391006, root := ~, start := 391002, stop := 391005 ), rec( content := "\n\n \ The string ", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tr", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "A", next := 391035, root := ~, start := 391025, stop := 391034 ), rec( content := " must co\ rrespond to a valid ", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ot", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "C", next := 391073, root := ~, start := 391063, stop := 391072 ), rec( content := " or\n \ ", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "L\ aTeX", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "C", next := 391095, root := ~, start := 391083, stop := 391094 ), rec( content := " text fi\ le and you must have have ", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ raphViz", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "C", next := 391144, root := ~, start := 391129, stop := 391143 ), rec( content := " and\n \ ", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "p\ dflatex", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "C", next := 391170, root := ~, start := 391155, stop := 391169 ), rec( content := " install\ ed on your computer. For details about these file\n formats, see ", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttp://www.latex-project.org", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "URL", next := 391287, root := ~, start := 391248, stop := 391286 ), rec( content := " and\n \ ", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttp://www.graphviz.org", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "URL", next := 391332, root := ~, start := 391298, stop := 391331 ), rec( content := ".", count := [ 9, 1, 1, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 1, 5 ], mathmode := "Text", name := "P", next := 391337, root := ~, start := 391333, stop := 391336 ), rec( content := "\n\n \ This function is provided to allow convenient, immediate viewing of the\n \ pictures produced by the function ", count := [ 9, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "DotDigr\ aph" ), content := 0, count := [ 9, 1, 1, 5 ], mathmode := "Text", name := "Ref", next := 391481, root := ~, start := 391457, stop := 391480 ), rec( content := ".", count := [ 9, 1, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 1, 6 ], mathmode := "Text", name := "P", next := 391486, root := ~, start := 391482, stop := 391485 ), rec( content := "\n\n \ The optional second argument ", count := [ 9, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ pts", count := [ 9, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 6 ], mathmode := "Text", name := "A", next := 391534, root := ~, start := 391523, stop := 391533 ), rec( content := " should \ be a record with\n components corresponding to various options, given bel\ ow.\n\n ", count := [ 9, 1, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "path", count := [ 9, 1, 1, 7 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 7 ], name := "Mar\ k", next := 391662, root := ~, start := 391645, stop := 391661 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n this should be a string r\ epresenting the path to the directory where\n you want ", count := [ \ 9, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := [ rec( content := "Splash", count := [ 9, 1, 1, 8 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 8 ], math\ mode := "Text", name := "C", next := 391789, root := ~, start := 391776, stop \ := 391788 ), rec( content := " to do its work. The default value of this\n \ option is ", count := [ 9, 1, 1, 8 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\"~\ /\"", count := [ 9, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~\ ) ], count := [ 9, 1, 1, 8 ], mathmode := "Text", name := "C", next := 391863 , root\ := ~, start := 391852, stop := 391862 ), rec( content := ".\n ", count\ := [ 9, 1, 1, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 8 ], name := "Ite\ m", next := 391880, root := ~, start := 391671, stop := 391879 ), rec( attributes :\ = rec( ), content := [ rec( content := "directory", count := [ 9, 1, 1, 9 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 9 ], name := "Mar\ k", next := 391912, root := ~, start := 391890, stop := 391911 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n this should be a string r\ epresenting the name of the directory in\n ", count := [ 9, 1, 1, 10 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "path", count := [ 9, 1, 1, 10 ], mathmode := "Text",\ name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 10 ], mathmode := "Text" , name\ := "C", next := 392025, root := ~, start := 392014, stop := 392024 ), rec( cont\ ent := " where you want ", count := [ 9, 1, 1, 10 ], mathmode := "Text", name \ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conten\ t := "Splash", count := [ 9, 1, 1, 10 ], mathmode := "Text", name := "PCDATA",\ root := ~ ) ], count := [ 9, 1, 1, 10 ], mathmode := "Text", name := "C", next\ := 392054, root := ~, start := 392041, stop := 392053 ), rec( content := " to\ do its work. This function\n will create this directory if does not \ already exist. ", count := [ 9, 1, 1, 10 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 1,\ 11 ], mathmode := "Text", name := "P", next := 392153, root := ~, start := 39\ 2149, stop := 392152 ), rec( content := "\n\n The default value of th\ is option is ", count := [ 9, 1, 1, 11 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "\"tmp.viz\"\ ", count := [ 9, 1, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ )\ ], count := [ 9, 1, 1, 11 ], mathmode := "Text", name := "C", next := 392217, root\ := ~, start := 392201, stop := 392216 ), rec( content := " if the option\n \ ", count := [ 9, 1, 1, 11 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "path", coun\ t := [ 9, 1, 1, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 9, 1, 1, 11 ], mathmode := "Text", name := "C", next := 392253, root :=\ ~, start := 392242, stop := 392252 ), rec( content := " is present, and the r\ esult of\n ", count := [ 9, 1, 1, 11 ], mathmode := "Text", name := "\ PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref", Func := "Dire\ ctoryTemporary" ), content := 0, count := [ 9, 1, 1, 11 ], mathmode := "Text", name\ := "Ref", next := 392341, root := ~, start := 392294, stop := 392340 ), rec( cont\ ent := " is used otherwise.\n ", count := [ 9, 1, 1, 11 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 10 ], name := "Ite\ m", next := 392376, root := ~, start := 391921, stop := 392375 ), rec( attributes :\ = rec( ), content := [ rec( content := "filename", count := [ 9, 1, 1, 12 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 12 ], name := "Mar\ k", next := 392407, root := ~, start := 392386, stop := 392406 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n this should be a string r\ epresenting the name of the file where\n ", count := [ 9, 1, 1, 13 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "str", count := [ 9, 1, 1, 13 ], mathmode := "Text", \ name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 13 ], mathmode := "Text", name\ := "A", next := 392517, root := ~, start := 392507, stop := 392516 ), rec( cont\ ent := " will be written. The default value of this option is\n ", coun\ t := [ 9, 1, 1, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "\"vizpicture\"", count := [ 9\ , 1, 1, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ \ 9, 1, 1, 13 ], mathmode := "Text", name := "C", next := 392601, root := ~, star\ t := 392582, stop := 392600 ), rec( content := ".\n ", count := [ 9, 1,\ 1, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 13 ], name := "Ite\ m", next := 392618, root := ~, start := 392416, stop := 392617 ), rec( attributes :\ = rec( ), content := [ rec( content := "viewer", count := [ 9, 1, 1, 14 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 14 ], name := "Mar\ k", next := 392647, root := ~, start := 392628, stop := 392646 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n this should be a string r\ epresenting the name of the program which\n should open the files pro\ duced by ", count := [ 9, 1, 1, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "GraphViz", \ count := [ 9, 1, 1, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 9, 1, 1, 15 ], mathmode := "Text", name := "C", next := 392799, root :=\ ~, start := 392784, stop := 392798 ), rec( content := " or ", count := [ 9, 1\ , 1, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes \ := rec( ), content := [ rec( content := "pdflatex", count := [ 9, 1, 1, 15 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 15 ] , math\ mode := "Text", name := "C", next := 392818, root := ~, start := 392803, stop \ := 392817 ), rec( content := ".\n ", count := [ 9, 1, 1, 15 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 15 ], name := "Ite\ m", next := 392835, root := ~, start := 392656, stop := 392834 ), rec( attributes :\ = rec( ), content := [ rec( content := "type", count := [ 9, 1, 1, 16 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 16 ], name := "Mar\ k", next := 392862, root := ~, start := 392845, stop := 392861 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n this option can be used t\ o specify that the string ", count := [ 9, 1, 1, 17 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "str", count := [ 9, 1, 1, 17 ], mathmode := "Text", name := "PCDATA", r\ oot := ~ ) ], count := [ 9, 1, 1, 17 ], mathmode := "Text", name := "A", next \ := 392949, root := ~, start := 392939, stop := 392948 ), rec( content := " con\ tains\n a ", count := [ 9, 1, 1, 17 ], mathmode := "Text", name := "P\ CDATA", root := ~ ), rec( attributes := rec( Only := "LaTeX" ), content := [ r\ ec( content := "{\\LaTeX}", count := [ 9, 1, 1, 17 ], name := "PCDATA", root :\ = ~ ) ], count := [ 9, 1, 1, 17 ], mathmode := "Text", name := "Alt", next := \ 33, root := ~, start := 1, stop := 32 ), rec( attributes := rec( Not := "LaTeX\ " ), content := [ rec( content := "LaTeX", count := [ 9, 1, 1, 17 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 17 ], name := \ "Alt", next := 61, root := ~, start := 33, stop := 60 ), rec( content := " or \ ", count := [ 9, 1, 1, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attr\ ibutes := rec( ), content := [ rec( content := "dot", count := [ 9, 1, 1, 17 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 17\ ], mathmode := "Text", name := "C", next := 392992, root := ~, start := 39298\ 2, stop := 392991 ), rec( content := " document. You can specify this option i\ n\n ", count := [ 9, 1, 1, 17 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "str", count\ := [ 9, 1, 1, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 9, 1, 1, 17 ], mathmode := "Text", name := "A", next := 393054, root :=\ ~, start := 393044, stop := 393053 ), rec( content := " directly by making th\ e first line ", count := [ 9, 1, 1, 17 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "\"%latex\""\ , count := [ 9, 1, 1, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ] , coun\ t := [ 9, 1, 1, 17 ], mathmode := "Text", name := "C", next := 393104, root :=\ ~, start := 393089, stop := 393103 ), rec( content := " or\n ", coun\ t := [ 9, 1, 1, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "\"//dot\"", count := [ 9, 1, \ 1, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1,\ 1, 17 ], mathmode := "Text", name := "C", next := 393132, root := ~, start :=\ 393118, stop := 393131 ), rec( content := ". There is no default value for t\ his option, this\n option must be specified in ", count := [ 9, 1, 1,\ 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "str", count := [ 9, 1, 1, 17 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 17 ], mathmode\ := "Text", name := "A", next := 393231, root := ~, start := 393221, stop := 3\ 93230 ), rec( content := " or in ", count := [ 9, 1, 1, 17 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ re\ c( content := "opt.type", count := [ 9, 1, 1, 17 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 17 ], mathmode := "Text", name \ := "A", next := 393253, root := ~, start := 393238, stop := 393252 ), rec( cont\ ent := ".\n ", count := [ 9, 1, 1, 17 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 9, 1, 1, 17 ], name := "Item", next := 39327\ 0, root := ~, start := 392871, stop := 393269 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "engine", count := [ 9, 1, 1, 18 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 9, 1, 1, 18 ], name := "Mark", next := 393299, root := ~, start := 393\ 280, stop := 393298 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n this option can be used to specify the GraphViz engine to use\n\ to render a ", count := [ 9, 1, 1, 19 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content \ := "dot", count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "C", next := \ 393419, root := ~, start := 393409, stop := 393418 ), rec( content := " docume\ nt. The valid choices are ", count := [ 9, 1, 1, 19 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "\"dot\"", count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "C", next\ := 393464, root := ~, start := 393452, stop := 393463 ), rec( content := ",\n\ ", count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "\"neato\"",\ count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ] , coun\ t := [ 9, 1, 1, 19 ], mathmode := "Text", name := "C", next := 393490, root :=\ ~, start := 393476, stop := 393489 ), rec( content := ", ", count := [ 9, 1, \ 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :=\ rec( ), content := [ rec( content := "\"circo\"", count := [ 9, 1, 1, 19 ], \ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 19 ], math\ mode := "Text", name := "C", next := 393506, root := ~, start := 393492, stop \ := 393505 ), rec( content := ", ", count := [ 9, 1, 1, 19 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec\ ( content := "\"twopi\"", count := [ 9, 1, 1, 19 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 19 ], mathmode := "Text", name \ := "C", next := 393522, root := ~, start := 393508, stop := 393521 ), rec( cont\ ent := ", ", count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "\"fdp\"", c\ ount := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 9, 1, 1, 19 ], mathmode := "Text", name := "C", next := 393536, root :=\ ~, start := 393524, stop := 393535 ), rec( content := ",\n ", count \ := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "\"sfdp\"", count := [ 9, 1, 1\ , 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, \ 1, 19 ], mathmode := "Text", name := "C", next := 393561, root := ~, start := \ 393548, stop := 393560 ), rec( content := ", and ", count := [ 9, 1, 1, 19 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "\"patchwork\"", count := [ 9, 1, 1, 19 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 19 ], mathmode \ := "Text", name := "C", next := 393585, root := ~, start := 393567, stop := 39\ 3584 ), rec( content := ". Please refer to the\n GraphViz documentati\ on for details on these engines.\n The default value for this option \ is ", count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", root := \ ~ ), rec( attributes := rec( ), content := [ rec( content := "\"dot\"", count\ := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 9, 1, 1, 19 ], mathmode := "Text", name := "C", next := 393729, root :=\ ~, start := 393717, stop := 393728 ), rec( content := ", and it\n mu\ st be specified in ", count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "P\ CDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := \ "opt.engine", count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", \ root := ~ ) ], count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "A", next\ := 393786, root := ~, start := 393769, stop := 393785 ), rec( content := ".\n\ ", count := [ 9, 1, 1, 19 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 9, 1, 1, 19 ], name := "Item", next := 393803, root := ~, start := 393\ 308, stop := 393802 ), rec( attributes := rec( ), content := [ rec( content :\ = "filetype", count := [ 9, 1, 1, 20 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 9, 1, 1, 20 ], name := "Mark", next := 393834, root := ~, start := 393\ 813, stop := 393833 ), rec( attributes := rec( ), content := [ rec( content :\ = "\n this should be a string representing the type of file which\n \ ", count := [ 9, 1, 1, 21 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "Splash", co\ unt := [ 9, 1, 1, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], coun\ t := [ 9, 1, 1, 21 ], mathmode := "Text", name := "C", next := 393943, root :=\ ~, start := 393930, stop := 393942 ), rec( content := " should produce. For " , coun\ t := [ 9, 1, 1, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( Only := "LaTeX" ), content := [ rec( content := "{\\LaTeX}", co\ unt := [ 9, 1, 1, 21 ], name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 2\ 1 ], mathmode := "Text", name := "Alt", next := 33, root := ~, start := 1, stop\ := 32 ), rec( attributes := rec( Not := "LaTeX" ), content := [ rec( content \ := "LaTeX", count := [ 9, 1, 1, 21 ], mathmode := "Text", name := "PCDATA", ro\ ot := ~ ) ], count := [ 9, 1, 1, 21 ], name := "Alt", next := 61, root := ~, star\ t := 33, stop := 60 ), rec( content := " files, this option is\n igno\ red and the default value ", count := [ 9, 1, 1, 21 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "\"pdf\"", count := [ 9, 1, 1, 21 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 9, 1, 1, 21 ], mathmode := "Text", name := "C", next\ := 394046, root := ~, start := 394034, stop := 394045 ), rec( content := " is\ used.\n ", count := [ 9, 1, 1, 21 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 9, 1, 1, 21 ], name := "Item", next := 394071, root := ~, start := 393\ 843, stop := 394070 ) ], count := [ 9, 1, 1, 7 ], mathmode := "Text", name := "List", next := 394085, root := ~, start := 391630, stop := 394084 ), rec( content := "\n\n \ This function was written by Attila Egri-Nagy and Manuel Delgado with some\n\ minor changes by J. D. Mitchell.", count := [ 9, 1, 1, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 1, 24 ], mathmode := "Text", name := "P", next := 394210, root := ~, start := 394206, stop := 394209 ), rec( content := "\n\n \ ", count := [ 9, 1, 1, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> Splash(DotDigraph(RandomDigraph(4)));\n", count := [ 9, 1, 1, 25 ], name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 1, 25 ], mathmode := "Text", name := "Log", next := 394285, root := ~, start := 394218, stop := 394284 ), rec( content := "\n ", count := [ 9, 1, 1, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 1, 3 ], mathmode := "Text", name := "Description", next := 394304, root := ~, start := 390836, stop := 394303 ) ], count := [ 9, 1, 1, 1 ], mathmode := "Text", name := "ManSection", next := 394320, root := ~, start := 390743, stop := 394319 ), rec( content := "\n\n ", count := [ 9, 1, 1, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DotDigraph" ), content := 0, count := [ 9, 1, 2, 2 ], mathmode := "Text", name := "Attr", next := 394384, root := ~, start := 394345, stop := 394383 ), rec( attributes := rec( Arg := "digraph", Name := "DotVertexLabell\ edDigraph" ), content := 0, count := [ 9, 1, 2, 4 ], mathmode := "Text", name := "Oper", next := 394442, root := ~, start := 394389, stop := 394441 ), rec( attributes := rec( ), content := [ rec( content := "A string.\ ", count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "Returns", next := 394475, root := ~, start := 394447, stop := 394474 ), rec( attributes := rec( ), content := [ rec( content := "\n " , count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otDigraph", count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "C", next := 394517, root := ~, start := 394500, stop := 394516 ), rec( content := " produce\ s a graphical representation of the digraph\n ", count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "A", next := 394589, root := ~, start := 394575, stop := 394588 ), rec( content := ". Vertic\ es are displayed as circles, numbered consistently\n with ", count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "A", next := 394673, root := ~, start := 394659, stop := 394672 ), rec( content := ". Edges \ are displayed as arrowed lines between\n vertices, with the arrowhead of \ each line pointing towards the range\n of the edge.", count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "P", next := 394817, root := ~, start := 394813, stop := 394816 ), rec( content := "\n\n \ ", count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otVertexLabelledDigraph", count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "C", next := 394856, root := ~, start := 394825, stop := 394855 ), rec( content := " differs\ from ", count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otDigraph", count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "C", next := 394887, root := ~, start := 394870, stop := 394886 ), rec( content := " only in\ \n that the values in ", count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "Ref", next := 394954, root := ~, start := 394921, stop := 394953 ), rec( content := " are use\ d to label\n the vertices in the produced picture rather than the numbers\ ", count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "C", next := 395048, root := ~, start := 395040, stop := 395047 ), rec( content := " to\n \ the number of vertices of the digraph. ", count := [ 9, 1, 2, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "P", next := 395101, root := ~, start := 395097, stop := 395100 ), rec( content := "\n\n \ The output is in ", count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ot", count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "C", next := 395136, root := ~, start := 395126, stop := 395135 ), rec( content := " format \ (also known as ", count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ raphViz", count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "C", next := 395174, root := ~, start := 395159, stop := 395173 ), rec( content := ")\n \ format. For details about this file format, and information about how to\n \ display or edit this format see ", count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttp://www.graphviz.org", count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "URL", next := 395327, root := ~, start := 395293, stop := 395326 ), rec( content := ". ", count := [ 9, 1, 2, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "P", next := 395333, root := ~, start := 395329, stop := 395332 ), rec( content := "\n\n \ The string returned by ", count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otDigraph", count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "C", next := 395381, root := ~, start := 395364, stop := 395380 ), rec( content := " or\n \ ", count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otVertexLabelledDigraph", count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "C", next := 395422, root := ~, start := 395391, stop := 395421 ), rec( content := " can be \ written to a file using\n the command ", count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "GAP\ Doc", Func := "FileString" ), content := 0, count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "Ref", next := 395514, root := ~, start := 395472, stop := 395513 ), rec( content := ".", count := [ 9, 1, 2, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 2, 9 ], mathmode := "Text", name := "P", next := 395519, root := ~, start := 395515, stop := 395518 ), rec( content := "\n\n \ ", count := [ 9, 1, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> adj := List([1 .. 4], x -> [1, 1, 1, 1]);\n[ [ 1, 1, 1, 1 ], [ 1, 1, 1, \ 1 ], [ 1, 1, 1, 1 ], [ 1, 1, 1, 1 ] ]\ngap> adj[1][3] := 0;\n0\ngap> gr := Dig\ raphByAdjacencyMatrix(adj);\n\nga\ p> FileString(\"dot/k4.dot\", DotDigraph(gr));\n154", count := [ 9, 1, 2, 10 ] , name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 2, 10 ], mathmode := "Text", name := "Log", next := 395826, root := ~, start := 395527, stop := 395825 ), rec( content := "\n ", count := [ 9, 1, 2, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 2, 5 ], mathmode := "Text", name := "Description", next := 395845, root := ~, start := 394480, stop := 395844 ) ], count := [ 9, 1, 2, 1 ], mathmode := "Text", name := "ManSection", next := 395861, root := ~, start := 394328, stop := 395860 ), rec( content := "\n\n ", count := [ 9, 1, 2, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DotSymmetricDig\ raph" ), content := 0, count := [ 9, 1, 3, 2 ], mathmode := "Text", name := "Attr", next := 395934, root := ~, start := 395886, stop := 395933 ), rec( attributes := rec( ), content := [ rec( content := "A string.\ ", count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "Returns", next := 395967, root := ~, start := 395939, stop := 395966 ), rec( attributes := rec( ), content := [ rec( content := "\n T\ his function produces a graphical representation of the symmetric\n digra\ ph ", count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "A", next := 396087, root := ~, start := 396073, stop := 396086 ), rec( content := ". ", count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otSymmetricDigraph", count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "C", next := 396115, root := ~, start := 396089, stop := 396114 ), rec( content := " will re\ turn an\n error if ", count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "A", next := 396160, root := ~, start := 396146, stop := 396159 ), rec( content := " is not \ a symmetric digraph. See\n ", count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymme\ tricDigraph" ), content := 0, count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "Ref", next := 396231, root := ~, start := 396199, stop := 396230 ), rec( content := ".", count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "P", next := 396236, root := ~, start := 396232, stop := 396235 ), rec( content := "\n\n \ Vertices are displayed as circles, numbered consistently with\n ", count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "A", next := 396326, root := ~, start := 396312, stop := 396325 ), rec( content := ". Since \ ", count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "A", next := 396348, root := ~, start := 396334, stop := 396347 ), rec( content := " is symm\ etric, for every non-loop\n edge there is a complementary edge with oppos\ ite source and range.\n ", count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otSymmetricDigraph", count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "C", next := 396487, root := ~, start := 396461, stop := 396486 ), rec( content := " display\ s each pair of complementary edges\n as a single line between the relevan\ t vertices, with no arrowhead.", count := [ 9, 1, 3, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "P", next := 396606, root := ~, start := 396602, stop := 396605 ), rec( content := "\n\n \ The output is in ", count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ot", count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "C", next := 396641, root := ~, start := 396631, stop := 396640 ), rec( content := " format \ (also known as ", count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ raphViz", count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "C", next := 396679, root := ~, start := 396664, stop := 396678 ), rec( content := ")\n \ format. For details about this file format, and information about how\n \ to display or edit this format see\n ", count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttp://www.graphviz.org", count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "URL", next := 396838, root := ~, start := 396804, stop := 396837 ), rec( content := ". ", count := [ 9, 1, 3, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 3, 6 ], mathmode := "Text", name := "P", next := 396844, root := ~, start := 396840, stop := 396843 ), rec( content := "\n\n \ The string returned by ", count := [ 9, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otSymmetricDigraph", count := [ 9, 1, 3, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 3, 6 ], mathmode := "Text", name := "C", next := 396901, root := ~, start := 396875, stop := 396900 ), rec( content := " can be \ written to a\n file using the command ", count := [ 9, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "GAP\ Doc", Func := "FileString" ), content := 0, count := [ 9, 1, 3, 6 ], mathmode := "Text", name := "Ref", next := 396993, root := ~, start := 396951, stop := 396992 ), rec( content := ".", count := [ 9, 1, 3, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 3, 7 ], mathmode := "Text", name := "P", next := 396998, root := ~, start := 396994, stop := 396997 ), rec( content := "\n\n \ ", count := [ 9, 1, 3, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> star := Digraph([[2, 2, 3, 4], [1, 1], [1], [1, 4]]);\n\ngap> IsSymmetricDigraph(star);\ntrue\ngap> F\ ileString(\"dot/star.dot\", DotSymmetricDigraph(gr));\n83", count := [ 9, 1, 3, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 3, 8 ], mathmode := "Text", name := "Log", next := 397235, root := ~, start := 397006, stop := 397234 ), rec( content := "\n ", count := [ 9, 1, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 3, 3 ], mathmode := "Text", name := "Description", next := 397254, root := ~, start := 395972, stop := 397253 ) ], count := [ 9, 1, 3, 1 ], mathmode := "Text", name := "ManSection", next := 397270, root := ~, start := 395869, stop := 397269 ), rec( content := "\n\n ", count := [ 9, 1, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DotPartialOrder\ Digraph" ), content := 0, count := [ 9, 1, 4, 2 ], mathmode := "Text", name := "Attr", next := 397346, root := ~, start := 397295, stop := 397345 ), rec( attributes := rec( ), content := [ rec( content := "A string.\ ", count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "Returns", next := 397379, root := ~, start := 397351, stop := 397378 ), rec( attributes := rec( ), content := [ rec( content := "\n T\ his function produces a graphical representation of a partial order\n dig\ raph ", count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "A", next := 397501, root := ~, start := 397487, stop := 397500 ), rec( content := ". ", count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otPartialOrderDigraph", count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "C", next := 397532, root := ~, start := 397503, stop := 397531 ), rec( content := " will re\ turn an error\n if ", count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "A", next := 397577, root := ~, start := 397563, stop := 397576 ), rec( content := " is not \ a partial order digraph. See ", count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsParti\ alOrderDigraph" ), content := 0, count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "Ref", next := 397657, root := ~, start := 397614, stop := 397656 ), rec( content := ".", count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "P", next := 397662, root := ~, start := 397658, stop := 397661 ), rec( content := "\n\n \ Since ", count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "A", next := 397690, root := ~, start := 397676, stop := 397689 ), rec( content := " is a pa\ rtial order, it is both reflexive and\n transitive. The output of ", count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otPartialOrderDigraph", count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "C", next := 397797, root := ~, start := 397768, stop := 397796 ), rec( content := " is the\\ n ", count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "DotDigr\ aph" ), content := 0, count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "Ref", next := 397835, root := ~, start := 397811, stop := 397834 ), rec( content := " of the\\ n ", count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ ReflexiveTransitiveReduction" ), content := 0, count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "Ref", next := 397898, root := ~, start := 397849, stop := 397897 ), rec( content := " of ", count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "A", next := 397916, root := ~, start := 397902, stop := 397915 ), rec( content := ".", count := [ 9, 1, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "P", next := 397921, root := ~, start := 397917, stop := 397920 ), rec( content := "\n\n \ The output is in ", count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ot", count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "C", next := 397956, root := ~, start := 397946, stop := 397955 ), rec( content := " format \ (also known as ", count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ raphViz", count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "C", next := 397994, root := ~, start := 397979, stop := 397993 ), rec( content := ")\n \ format. For details about this file format, and information about how\n \ to display or edit this format see\n ", count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttp://www.graphviz.org", count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "URL", next := 398153, root := ~, start := 398119, stop := 398152 ), rec( content := ". ", count := [ 9, 1, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 4, 6 ], mathmode := "Text", name := "P", next := 398159, root := ~, start := 398155, stop := 398158 ), rec( content := "\n\n \ The string returned by ", count := [ 9, 1, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otPartialOrderDigraph", count := [ 9, 1, 4, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 4, 6 ], mathmode := "Text", name := "C", next := 398219, root := ~, start := 398190, stop := 398218 ), rec( content := " can be \ written to a\n file using the command ", count := [ 9, 1, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "GAP\ Doc", Func := "FileString" ), content := 0, count := [ 9, 1, 4, 6 ], mathmode := "Text", name := "Ref", next := 398311, root := ~, start := 398269, stop := 398310 ), rec( content := ".", count := [ 9, 1, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 4, 7 ], mathmode := "Text", name := "P", next := 398316, root := ~, start := 398312, stop := 398315 ), rec( content := "\n\n \ ", count := [ 9, 1, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> poset := Digraph([[1, 4], [2], [2, 3, 4], [4]);\ngap> IsPartialOrderDigr\ aph(gr);\ntrue\ngap> FileString(\"dot/poset.dot\", DotPartialOrderDigraph(gr))\ ;\n83", count := [ 9, 1, 4, 8 ], name := "PCDATA", root := ~ ) ], count := [ 9, 1, 4, 8 ], mathmode := "Text", name := "Log", next := 398502, root := ~, start := 398324, stop := 398501 ), rec( content := "\n ", count := [ 9, 1, 4, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 4, 3 ], mathmode := "Text", name := "Description", next := 398521, root := ~, start := 397384, stop := 398520 ) ], count := [ 9, 1, 4, 1 ], mathmode := "Text", name := "ManSection", next := 398537, root := ~, start := 397278, stop := 398536 ), rec( content := "\n\n ", count := [ 9, 1, 4, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "DotPreorderDigr\ aph" ), content := 0, count := [ 9, 1, 5, 2 ], mathmode := "Text", name := "Attr", next := 398609, root := ~, start := 398562, stop := 398608 ), rec( attributes := rec( Arg := "digraph", Name := "DotQuasiorderDi\ graph" ), content := 0, count := [ 9, 1, 5, 4 ], mathmode := "Text", name := "Attr", next := 398663, root := ~, start := 398614, stop := 398662 ), rec( attributes := rec( ), content := [ rec( content := "A string.\ ", count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "Returns", next := 398696, root := ~, start := 398668, stop := 398695 ), rec( attributes := rec( ), content := [ rec( content := "\n T\ his function produces a graphical representation of a preorder\n digraph \ ", count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "A", next := 398813, root := ~, start := 398799, stop := 398812 ), rec( content := ". ", count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otPreorderDigraph", count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "C", next := 398840, root := ~, start := 398815, stop := 398839 ), rec( content := " will re\ turn an error\n if ", count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "A", next := 398885, root := ~, start := 398871, stop := 398884 ), rec( content := " is not \ a preorder digraph. See ", count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsPreor\ derDigraph" ), content := 0, count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "Ref", next := 398956, root := ~, start := 398917, stop := 398955 ), rec( content := ".", count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "P", next := 398961, root := ~, start := 398957, stop := 398960 ), rec( content := "\n\n \ A preorder digraph is reflexive and transitive but in general it is\n n\ ot anti-symmetric and may have strongly connected components\n containing\ more than one vertex. The ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Quotien\ tDigraph" ), content := 0, count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "Ref", next := 399177, root := ~, start := 399148, stop := 399176 ), rec( content := "\n \ ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Q\ ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "A", next := 399192, root := ~, start := 399184, stop := 399191 ), rec( content := " obtaine\ d by forming the quotient of ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "A", next := 399243, root := ~, start := 399229, stop := 399242 ), rec( content := " by the\\ n partition of its vertices into the strongly connected components\n \ satisfies ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsParti\ alOrderDigraph" ), content := 0, count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "Ref", next := 399373, root := ~, start := 399338, stop := 399372 ), rec( content := ". Thus e\ very vertex of\n ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Q\ ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "A", next := 399410, root := ~, start := 399402, stop := 399409 ), rec( content := " corresp\ onds to a strongly connected component of ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "A", next := 399474, root := ~, start := 399460, stop := 399473 ), rec( content := ".\n \ The output of ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otPreorderDigraph", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "C", next := 399521, root := ~, start := 399496, stop := 399520 ), rec( content := " display\ s the \n ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ ReflexiveTransitiveReduction" ), content := 0, count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "Ref", next := 399591, root := ~, start := 399542, stop := 399590 ), rec( content := " of ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Q\ ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "A", next := 399603, root := ~, start := 399595, stop := 399602 ), rec( content := " with\n \ vertices displayed as rounded rectangles labelled by all of the vertices\ \n of ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "A", next := 399711, root := ~, start := 399697, stop := 399710 ), rec( content := " in the \ corresponding strongly connected component. ", count := [ 9, 1, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "P", next := 399767, root := ~, start := 399763, stop := 399766 ), rec( content := "\n\n \ The output is in ", count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ot", count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "C", next := 399802, root := ~, start := 399792, stop := 399801 ), rec( content := " format \ (also known as ", count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ raphViz", count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "C", next := 399840, root := ~, start := 399825, stop := 399839 ), rec( content := ")\n \ format. For details about this file format, and information about how\n \ to display or edit this format see\n ", count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttp://www.graphviz.org", count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "URL", next := 399999, root := ~, start := 399965, stop := 399998 ), rec( content := ". ", count := [ 9, 1, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 5, 8 ], mathmode := "Text", name := "P", next := 400005, root := ~, start := 400001, stop := 400004 ), rec( content := "\n\n \ The string returned by ", count := [ 9, 1, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otPreorderDigraph", count := [ 9, 1, 5, 8 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 9, 1, 5, 8 ], mathmode := "Text", name := "C", next := 400061, root := ~, start := 400036, stop := 400060 ), rec( content := " can be \ written to a\n file using the command ", count := [ 9, 1, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "GAP\ Doc", Func := "FileString" ), content := 0, count := [ 9, 1, 5, 8 ], mathmode := "Text", name := "Ref", next := 400153, root := ~, start := 400111, stop := 400152 ), rec( content := ".", count := [ 9, 1, 5, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 5, 9 ], mathmode := "Text", name := "P", next := 400158, root := ~, start := 400154, stop := 400157 ), rec( content := "\n\n \ ", count := [ 9, 1, 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> preset := Digraph([[1, 2, 4, 5], [1, 2, 4, 5], [3, 4], [4], [1, 2, 4, 5]\ );\ngap> IsPreorderDigraph(gr);\ntrue\ngap> FileString(\"dot/preset.dot\", Dot\ ProrderDigraph(gr));\n83", count := [ 9, 1, 5, 10 ], name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 10 ], mathmode := "Text", name := "Log", next := 400363, root := ~, start := 400166, stop := 400362 ), rec( content := "\n ", count := [ 9, 1, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 5, 5 ], mathmode := "Text", name := "Description", next := 400382, root := ~, start := 398701, stop := 400381 ) ], count := [ 9, 1, 5, 1 ], mathmode := "Text", name := "ManSection", next := 400398, root := ~, start := 398545, stop := 400397 ), rec( content := "\n\n ", count := [ 9, 1, 5, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph, verts [\ , colour1, colour2]", Name := "DotHighlightedDigraph" ), content := 0, count := [ 9, 1, 6, 2 ], mathmode := "Text", name := "Oper", next := 400501, root := ~, start := 400423, stop := 400500 ), rec( attributes := rec( ), content := [ rec( content := "A string.\ ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "Returns", next := 400534, root := ~, start := 400506, stop := 400533 ), rec( attributes := rec( ), content := [ rec( content := "\n " , count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otHighlightedDigraph", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "C", next := 400587, root := ~, start := 400559, stop := 400586 ), rec( content := " produce\ s a graphical represenation of the\n digraph ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "A", next := 400658, root := ~, start := 400644, stop := 400657 ), rec( content := ", where \ the vertices in the list ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ erts", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "A", next := 400703, root := ~, start := 400691, stop := 400702 ), rec( content := ", and\n \ edges between them, are drawn with colour ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olour1", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "A", next := 400771, root := ~, start := 400757, stop := 400770 ), rec( content := " and all\ other\n vertices and edges in ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "A", next := 400828, root := ~, start := 400814, stop := 400827 ), rec( content := " are dra\ wn with colour ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olour2", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "A", next := 400865, root := ~, start := 400851, stop := 400864 ), rec( content := ".\n \ If ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olour1", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "A", next := 400890, root := ~, start := 400876, stop := 400889 ), rec( content := " and ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olour2", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "A", next := 400909, root := ~, start := 400895, stop := 400908 ), rec( content := " are not\ given then\n ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otHighlightedDigraph", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "C", next := 400963, root := ~, start := 400935, stop := 400962 ), rec( content := " uses bl\ ack and grey respectively. ", count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "P", next := 401002, root := ~, start := 400998, stop := 401001 ), rec( content := "\n\n \ Note that ", count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ otHighlightedDigraph", count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "C", next := 401048, root := ~, start := 401020, stop := 401047 ), rec( content := " does no\ t validate the colours\n ", count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olour1", count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "A", next := 401099, root := ~, start := 401085, stop := 401098 ), rec( content := " and ", count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ olour2", count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "A", next := 401118, root := ~, start := 401104, stop := 401117 ), rec( content := " - consu\ lt the GraphViz documentation to\n see what is available.\n\n See ", count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "DotDigr\ aph" ), content := 0, count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "Ref", next := 401223, root := ~, start := 401199, stop := 401222 ), rec( content := " for mor\ e details on the output.", count := [ 9, 1, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 1, 6, 5 ], mathmode := "Text", name := "P", next := 401259, root := ~, start := 401255, stop := 401258 ), rec( content := "\n\n \ ", count := [ 9, 1, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> digraph := Digraph([[2, 3], [2], [1, 3]]);\n\ngap> FileString(\"dot/my_digraph.dot\",\n> DotHighlightedDigraph(digra\ ph, [1, 2], \"red\", \"black\"));\n264", count := [ 9, 1, 6, 6 ], name := "PCD\ ATA", root := ~ ) ], count := [ 9, 1, 6, 6 ], mathmode := "Text", name := "Log", next := 401474, root := ~, start := 401267, stop := 401473 ), rec( content := "\n ", count := [ 9, 1, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 6, 3 ], mathmode := "Text", name := "Description", next := 401493, root := ~, start := 400539, stop := 401492 ) ], count := [ 9, 1, 6, 1 ], mathmode := "Text", name := "ManSection", next := 401509, root := ~, start := 400406, stop := 401508 ), rec( content := "\n\n ", count := [ 9, 1, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 1, 0, 1 ], mathmode := "Text", name := "Section", next := 401523, root := ~, start := 390687, stop := 401522 ) , rec( content := "\n\n ", count := [ 9, 1, 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "Reading and writi\ ng digraphs to a file", count := [ 9, 2, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 2 ], mathmode := "Text", name := "Heading", next := 401593, root := ~, start := 401536, stop := 401592 ), rec( content := "\n This section descr\ ibes different ways to store and read graphs\n from a file in the ", count := [ 9, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ 9, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " package.\n ", count := [ 9, 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := " Graph6 " , count := [ 9, 2, 0, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 4 ], name := "Mark", next := 401742, root := ~, start := 401721, stop := 401741 ), rec( attributes := rec( ), content := [ rec( content := "\n\t", count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ Graph6 ", count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "E", next := 401772, root := ~, start := 401757, stop := 401771 ), rec( content := " is a gr\ aph data format for storing undirected graphs\n\twith no multiple edges nor lo\ ops of size up to ", count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ 2^{36} - 1 ", count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "M", next := 401893, root := ~, start := 401874, stop := 401892 ), rec( content := " in\n\tp\ rintable chracters. The format consists of two parts. The first part\n\tuses o\ ne to eight bytes to store the number of vertices. And the second\n\tpart is t\ he upper half of the adjacency matrix converted into ASCII\n\tcharacters. For \ a more detail description see ", count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Text := "Graph6"\ ), content := [ rec( content := "\n\thttp://cs.anu.edu.au/~bdm/data/formats.t\ xt", count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "URL", next := 402226, root := ~, start := 402157, stop := 402225 ), rec( content := ".\n \ ", count := [ 9, 2, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 5 ], name := "Item", next := 402241, root := ~, start := 401749, stop := 402240 ), rec( attributes := rec( ), content := [ rec( content := " Sparse6 \ ", count := [ 9, 2, 0, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 6 ], name := "Mark", next := 402271, root := ~, start := 402249, stop := 402270 ), rec( attributes := rec( ), content := [ rec( content := "\n\t", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ Sparse6 ", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "E", next := 402302, root := ~, start := 402286, stop := 402301 ), rec( content := " is a gr\ aph data format for storing undirected graphs\n\twith possibly multiple edges \ or loops. The maximal number of vertices\n\tallowed is ", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ 2^{36} - 1 ", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "M", next := 402458, root := ~, start := 402439, stop := 402457 ), rec( content := ". The fo\ rmat consists of two parts. The\n\tfirst part uses one to eight bytes to store\ the number of vertices.\n\tAnd the second part only stores information about \ the edges.\n\tTherefore, the ", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ Sparse6 ", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "E", next := 402661, root := ~, start := 402645, stop := 402660 ), rec( content := " format \ return a more compact encoding\n\tthen ", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ Graph6 ", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "E", next := 402721, root := ~, start := 402706, stop := 402720 ), rec( content := " for spa\ rse graph, i.e. graphs where the number\n\tof edges is much less than the num\ ber of vertices squared. For a more\n\tdetail description see ", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Text := "Sparse6\ " ), content := [ rec( content := "\n http://cs.anu.edu.au/~bdm/data/fo\ rmats.txt", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "URL", next := 402943, root := ~, start := 402866, stop := 402942 ), rec( content := ".\n \ ", count := [ 9, 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 7 ], name := "Item", next := 402958, root := ~, start := 402278, stop := 402957 ), rec( attributes := rec( ), content := [ rec( content := " Digraph6\ ", count := [ 9, 2, 0, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 8 ], name := "Mark", next := 402989, root := ~, start := 402966, stop := 402988 ), rec( attributes := rec( ), content := [ rec( content := "\n\t", count := [ 9, 2, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraph6", count := [ 9, 2, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 9 ], mathmode := "Text", name := "E", next := 403019, root := ~, start := 403004, stop := 403018 ), rec( content := " is a ne\ w format based on ", count := [ 9, 2, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ Graph6 ", count := [ 9, 2, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 9 ], mathmode := "Text", name := "E", next := 403060, root := ~, start := 403045, stop := 403059 ), rec( content := ", but de\ signed\n\tfor digraphs. The entire adjacency matrix is stored, and\n\ttherefor\ e there is support for directed edges and single-vertex loops.\n\tHowever, mul\ tiple edges are not supported.\n ", count := [ 9, 2, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 9 ], name := "Item", next := 403262, root := ~, start := 402996, stop := 403261 ), rec( attributes := rec( ), content := [ rec( content := " DiSparse\ 6 ", count := [ 9, 2, 0, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 10 ], name := "Mark", next := 403294, root := ~, start := 403270, stop := 403293 ), rec( attributes := rec( ), content := [ rec( content := "\n\t", count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ iSparse6", count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "E", next := 403325, root := ~, start := 403309, stop := 403324 ), rec( content := " is a ne\ w format based on ", count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ Sparse6 ", count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "E", next := 403367, root := ~, start := 403351, stop := 403366 ), rec( content := ", but\n\\ tdesigned for digraphs. In this format the list of edges is\n\tpartitioned int\ o inceasing and decreasing edges, depending whether the\n\tedge has its source\ bigger than the range. Then both sets of edges are\n\twritten separetly in ", count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := " \ Sparse6 ", count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "E", next := 403615, root := ~, start := 403599, stop := 403614 ), rec( content := " format \ with a separation symbol\n\tin between.\n ", count := [ 9, 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 11 ], name := "Item", next := 403674, root := ~, start := 403301, stop := 403673 ) ], count := [ 9, 2, 0, 4 ], mathmode := "Text", name := "List", next := 403686, root := ~, start := 401708, stop := 403685 ), rec( content := "\n ", count := [ 9, 2, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "String" ), content := 0, count := [ 9, 2, 1, 2 ], mathmode := "Text", name := "Attr", next := 403741, root := ~, start := 403706, stop := 403740 ), rec( attributes := rec( Arg := "digraph", Name := "PrintString" ), content := 0, count := [ 9, 2, 1, 4 ], mathmode := "Text", name := "Oper", next := 403784, root := ~, start := 403744, stop := 403783 ), rec( attributes := rec( ), content := [ rec( content := "A string.\ ", count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "Returns", next := 403815, root := ~, start := 403787, stop := 403814 ), rec( attributes := rec( ), content := [ rec( content := "\n Ret\ urns a string ", count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tring", count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "C", next := 403866, root := ~, start := 403853, stop := 403865 ), rec( content := " such th\ at ", count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "E\ valString(string)", count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "C", next := 403902, root := ~, start := 403877, stop := 403901 ), rec( content := "\n is\ equal to ", count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "A", next := 403933, root := ~, start := 403919, stop := 403932 ), rec( content := ", and ha\ s the same mutability.\n See ", count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Func := "EvalString" ), content := 0, count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "Ref", next := 404012, root := ~, start := 403972, stop := 404011 ), rec( content := ".\n " , count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "P", next := 404022, root := ~, start := 404018, stop := 404021 ), rec( content := "\n\n \ The methods installed for ", count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ tring", count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "C", next := 404067, root := ~, start := 404054, stop := 404066 ), rec( content := " make so\ me attempts to\n ensure that ", count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tring", count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "C", next := 404119, root := ~, start := 404106, stop := 404118 ), rec( content := " has as \ short a length as possible, but\n there may exist shorter strings that also\ evaluate to ", count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "A", next := 404231, root := ~, start := 404217, stop := 404230 ), rec( content := ".\n " , count := [ 9, 2, 1, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "P", next := 404241, root := ~, start := 404237, stop := 404240 ), rec( content := "\n\n \ It is possible that ", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tring", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "C", next := 404280, root := ~, start := 404267, stop := 404279 ), rec( content := " may con\ tain escaped special\n characters. To obtain a representation of ", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "A", next := 404369, root := ~, start := 404355, stop := 404368 ), rec( content := " that\n \ can be entered as GAP input, please use\n ", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Func := "Print" ), content := 0, count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "Ref", next := 404458, root := ~, start := 404423, stop := 404457 ), rec( content := ".\n N\ ote that ", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "P\ rint", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "C", next := 404486, root := ~, start := 404474, stop := 404485 ), rec( content := " for a d\ igraph delegates to\n ", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "P\ rintString", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "C", next := 404537, root := ~, start := 404519, stop := 404536 ), rec( content := ", which \ delegates to ", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ tring", count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "C", next := 404571, root := ~, start := 404558, stop := 404570 ), rec( content := ".\n " , count := [ 9, 2, 1, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> D := CycleDigraph(3);\n\ngap> P\ rint(D);\nCycleDigraph(3);\ngap> G := PetersenGraph(IsMutableDigraph);\n\ngap> String(G);\n\"DigraphFromGraph6St\ ring(IsMutableDigraph, \\\"IheA@GUAo\\\");\"\ngap> Print(last);\nDigraphFromGr\ aph6String(IsMutableDigraph, \"IheA@GUAo\");\ngap> DigraphFromGraph6String(IsM\ utableDigraph, \"IheA@GUAo\");\n\n\ ", count := [ 9, 2, 1, 8 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 8 ], mathmode := "Text", name := "Log", next := 405046, root := ~, start := 404577, stop := 405045 ), rec( content := "\n ", count := [ 9, 2, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 1, 5 ], mathmode := "Text", name := "Description", next := 405063, root := ~, start := 403818, stop := 405062 ) ], count := [ 9, 2, 1, 1 ], mathmode := "Text", name := "ManSection", next := 405077, root := ~, start := 403691, stop := 405076 ), rec( content := "\n\n ", count := [ 9, 2, 1, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "[filt, ]str", Name := "DigraphFromGrap\ h6String" ), content := 0, count := [ 9, 2, 2, 2 ], mathmode := "Text", name := "Oper", next := 405157, root := ~, start := 405098, stop := 405156 ), rec( attributes := rec( Arg := "[filt, ]str", Name := "DigraphFromDigr\ aph6String" ), content := 0, count := [ 9, 2, 2, 4 ], mathmode := "Text", name := "Oper", next := 405219, root := ~, start := 405160, stop := 405218 ), rec( attributes := rec( Arg := "[filt, ]str", Name := "DigraphFromSpar\ se6String" ), content := 0, count := [ 9, 2, 2, 6 ], mathmode := "Text", name := "Oper", next := 405281, root := ~, start := 405222, stop := 405280 ), rec( attributes := rec( Arg := "[filt, ]str", Name := "DigraphFromDiSp\ arse6String" ), content := 0, count := [ 9, 2, 2, 8 ], mathmode := "Text", name := "Oper", next := 405343, root := ~, start := 405284, stop := 405342 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 9, 2, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 2, 9 ], mathmode := "Text", name := "Returns", next := 405375, root := ~, start := 405346, stop := 405374 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 9, 2, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tr", count := [ 9, 2, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 2, 9 ], mathmode := "Text", name := "A", next := 405409, root := ~, start := 405399, stop := 405408 ), rec( content := " is a st\ ring encoding a graph in Graph6, Digraph6, Sparse6 or\n DiSparse6 format, t\ hen the corresponding function returns a digraph. In the\n case of either G\ raph6 or Sparse6, formats which do not support directed\n edges, this will \ be a digraph such that for every edge, the edge going in\n the opposite dir\ ection is also present.", count := [ 9, 2, 2, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 2, 10 ], mathmode := "Text", name := "P", next := 405752, root := ~, start := 405748, stop := 405751 ), rec( content := "\n\n \ Each of these functions takes an optional first argument ", count := [ 9, 2, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilt", count := [ 9, 2, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 2, 10 ], mathmode := "Text", name := "A", next := 405826, root := ~, start := 405815, stop := 405825 ), rec( content := ",\n w\ hich should be either ", count := [ 9, 2, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 9, 2, 2, 10 ], mathmode := "Text", name := "Ref", next := 405885, root := ~, start := 405855, stop := 405884 ), rec( content := "\n or\ ", count := [ 9, 2, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 9, 2, 2, 10 ], mathmode := "Text", name := "Ref", next := 405925, root := ~, start := 405893, stop := 405924 ), rec( content := ",\n a\ nd which specifies whether the output digraph shall\n be mutable or immutab\ le.\n If no first argument is provided, then an immutable\n digraph is r\ eturned by default.\n ", count := [ 9, 2, 2, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> DigraphFromGraph6String(\"?\");\n\ngap> DigraphFromGraph6String(\"C]\");\n\ngap> DigraphFromGraph6String(\"H?AAEM{\");\n\ngap> DigraphFromDigraph6String(\"&?\");\n\ngap> DigraphFromDigraph6String(IsMutableDigraph,\ \"&DOOOW?\");\n\ngap> DigraphFromDi\ graph6String(\"&CQFG\");\n\ngap> D\ igraphFromDigraph6String(\"&IM[SrKLc~lhesbU[F_\");\n\ngap> DigraphFromDiSparse6String(\".CaWBGA?b\");\n\n", count := [ 9, 2, 2, 11 ], name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 2, 11 ], mathmode := "Text", name := "Example", next := 406854, root := ~, start := 406109, stop := 406853 ), rec( content := "\n ", count := [ 9, 2, 2, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 2, 9 ], mathmode := "Text", name := "Description", next := 406873, root := ~, start := 405378, stop := 406872 ) ], count := [ 9, 2, 2, 1 ], mathmode := "Text", name := "ManSection", next := 406887, root := ~, start := 405083, stop := 406886 ), rec( content := "\n\n ", count := [ 9, 2, 2, 12 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "Graph6String" ) , content := 0, count := [ 9, 2, 3, 2 ], mathmode := "Text", name := "Oper", next := 406949, root := ~, start := 406908, stop := 406948 ), rec( attributes := rec( Arg := "digraph", Name := "Digraph6String"\ ), content := 0, count := [ 9, 2, 3, 4 ], mathmode := "Text", name := "Oper", next := 406995, root := ~, start := 406952, stop := 406994 ), rec( attributes := rec( Arg := "digraph", Name := "Sparse6String" ), content := 0, count := [ 9, 2, 3, 6 ], mathmode := "Text", name := "Oper", next := 407040, root := ~, start := 406998, stop := 407039 ), rec( attributes := rec( Arg := "digraph", Name := "DiSparse6String\ " ), content := 0, count := [ 9, 2, 3, 8 ], mathmode := "Text", name := "Oper", next := 407087, root := ~, start := 407043, stop := 407086 ), rec( attributes := rec( ), content := [ rec( content := "A string.\ ", count := [ 9, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 3, 9 ], mathmode := "Text", name := "Returns", next := 407118, root := ~, start := 407090, stop := 407117 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ se four functions return a highly compressed string fully describing the\n \ digraph ", count := [ 9, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 3, 9 ], mathmode := "Text", name := "A", next := 407241, root := ~, start := 407227, stop := 407240 ), rec( content := ". ", count := [ 9, 2, 3, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 3, 10 ], mathmode := "Text", name := "P", next := 407247, root := ~, start := 407243, stop := 407246 ), rec( content := "\n\n \ Graph6 and Digraph6 are formats best used on small, dense graphs, if\n appl\ icable. For larger, sparse graphs use ", count := [ 9, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ parse6", count := [ 9, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 3, 10 ], mathmode := "Text", name := "E", next := 407382, root := ~, start := 407368, stop := 407381 ), rec( content := " and\n \ ", count := [ 9, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ isparse6", count := [ 9, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 3, 10 ], mathmode := "Text", name := "E", next := 407407, root := ~, start := 407391, stop := 407406 ), rec( content := " (this l\ atter also preserves multiple edges). ", count := [ 9, 2, 3, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 3, 11 ], mathmode := "Text", name := "P", next := 407457, root := ~, start := 407453, stop := 407456 ), rec( content := "\n\n \ See ", count := [ 9, 2, 3, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "WriteDi\ graphs" ), content := 0, count := [ 9, 2, 3, 11 ], mathmode := "Text", name := "Ref", next := 407494, root := ~, start := 407467, stop := 407493 ), rec( content := ".\n " , count := [ 9, 2, 3, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[2, 3], [1], [1]]);\n\ngap> Sparse6String(gr);\n\":Bc\"\ngap> DiSparse6String(gr);\n\".Bc{f\ \"\n", count := [ 9, 2, 3, 12 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 3, 12 ], mathmode := "Text", name := "Example", next := 407681, root := ~, start := 407500, stop := 407680 ), rec( content := "\n ", count := [ 9, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 3, 9 ], mathmode := "Text", name := "Description", next := 407698, root := ~, start := 407121, stop := 407697 ) ], count := [ 9, 2, 3, 1 ], mathmode := "Text", name := "ManSection", next := 407712, root := ~, start := 406893, stop := 407711 ), rec( content := "\n\n ", count := [ 9, 2, 3, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "filename [, code\ r][, mode]", Name := "DigraphFile" ), content := 0, count := [ 9, 2, 4, 2 ], mathmode := "Text", name := "Func", next := 407792, root := ~, start := 407733, stop := 407791 ), rec( attributes := rec( ), content := [ rec( content := "An IO fil\ e object.", count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "Returns", next := 407832, root := ~, start := 407795, stop := 407831 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "A", next := 407871, root := ~, start := 407856, stop := 407870 ), rec( content := " is a st\ ring representing the name of a file, then\n ", count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphFile", count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "C", next := 407944, root := ~, start := 407926, stop := 407943 ), rec( content := " returns\ an ", count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "IO" ), content := [ rec( content := "\n http://gap-packages\ .github.io/io/\n", count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "URL", next := 78, root := ~, start := 17, stop := 77 ) ], count := [ 9, 2, 4, 3 ], name := "Alt", next := 84, root := ~, start := 1, stop := 83 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "IO", count := [ 9, 2, 4, 3 ], name := \ "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 3 ], name := "Package", next := 122, root := ~, start := 101 , stop := 121 ) ], count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "Alt", next := 128, root := ~, start := 84, stop := 127 ), rec( content := " package\ file object for that file.\n ", count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "P", next := 408004, root := ~, start := 408000, stop := 408003 ), rec( content := "\n\n \ If the optional argument ", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ oder", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "A", next := 408047, root := ~, start := 408035, stop := 408046 ), rec( content := " is spec\ ified\n and is a function which either encodes a digraph as a string, or de\ codes a\n string into a digraph, then this function will be used when readi\ ng or\n writing to the returned file object. If the optional argument ", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "c\ oder", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "A", next := 408293, root := ~, start := 408281, stop := 408292 ), rec( content := "\n is\ not specified, then the encoding of the digraphs in the returned file\n ob\ ject must be specified in the the file extension. The file extension must\n \ be one of: ", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ g6", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "C", next := 408476, root := ~, start := 408466, stop := 408475 ), rec( content := ", ", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ s6", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "C", next := 408488, root := ~, start := 408478, stop := 408487 ), rec( content := ", ", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ d6", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "C", next := 408500, root := ~, start := 408490, stop := 408499 ), rec( content := ", ", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ ds6", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "C", next := 408513, root := ~, start := 408502, stop := 408512 ), rec( content := ", ", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ txt", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "C", next := 408526, root := ~, start := 408515, stop := 408525 ), rec( content := ",\n " , count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ p", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "C", next := 408541, root := ~, start := 408532, stop := 408540 ), rec( content := ", or ", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ pickle", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "C", next := 408560, root := ~, start := 408546, stop := 408559 ), rec( content := "; more d\ etails of these file formats is given\n below. ", count := [ 9, 2, 4, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "P", next := 408621, root := ~, start := 408617, stop := 408620 ), rec( content := "\n\n \ If the optional argument ", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ode", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "A", next := 408663, root := ~, start := 408652, stop := 408662 ), rec( content := " is spec\ ified, then it must be one of:\n ", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ "w\"", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "C", next := 408716, root := ~, start := 408706, stop := 408715 ), rec( content := " (for wr\ ite), ", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ "a\"", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "C", next := 408740, root := ~, start := 408730, stop := 408739 ), rec( content := " (for ap\ pend), or ", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ "r\"", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "C", next := 408768, root := ~, start := 408758, stop := 408767 ), rec( content := " (for re\ ad).\n If ", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "m\ ode", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "A", next := 408799, root := ~, start := 408788, stop := 408798 ), rec( content := " is not \ specified, then ", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ "r\"", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "C", next := 408833, root := ~, start := 408823, stop := 408832 ), rec( content := " is used\ by default. ", count := [ 9, 2, 4, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "P", next := 408858, root := ~, start := 408854, stop := 408857 ), rec( content := "\n\n \ If ", count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "A", next := 408882, root := ~, start := 408867, stop := 408881 ), rec( content := " ends in\ one of: ", count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ gz", count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "C", next := 408909, root := ~, start := 408899, stop := 408908 ), rec( content := ", ", count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ bz2", count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "C", next := 408922, root := ~, start := 408911, stop := 408921 ), rec( content := ", or\n \ ", count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ xz", count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "C", next := 408941, root := ~, start := 408931, stop := 408940 ), rec( content := ", then t\ he digraphs which are read from, or written to, the\n returned file object \ are decompressed, or compressed, appropriately.\n ", count := [ 9, 2, 4, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "P", next := 409082, root := ~, start := 409078, stop := 409081 ), rec( content := "\n\n \ The file object returned by ", count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphFile", count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "C", next := 409134, root := ~, start := 409116, stop := 409133 ), rec( content := " can be \ given as the first\n argument for either of the functions ", count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "ReadDig\ raphs" ), content := 0, count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "Ref", next := 409228, root := ~, start := 409202, stop := 409227 ), rec( content := " or ", count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "WriteDi\ graphs" ), content := 0, count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "Ref", next := 409265, root := ~, start := 409232, stop := 409264 ), rec( content := ". The pu\ rpose of this is to reduce the overhead of\n recreating the file object ins\ ide the functions ", count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "ReadDig\ raphs" ), content := 0, count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "Ref", next := 409394, root := ~, start := 409368, stop := 409393 ), rec( content := "\n or\ ", count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( Func := "WriteDi\ graphs" ), content := 0, count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "Ref", next := 409429, root := ~, start := 409402, stop := 409428 ), rec( content := " when, f\ or example, reading or writing many\n digraphs in a loop.\n ", count := [ 9, 2, 4, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 4, 8 ], mathmode := "Text", name := "P", next := 409505, root := ~, start := 409501, stop := 409504 ), rec( content := "\n\n \ The currently supported file formats, and associated filename extensions,\n \ are:\n ", count := [ 9, 2, 4, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "graph6 (.g6)", count := [ 9, 2, 4, 9 ] , math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 9 ], name := "Mar\ k", next := 409636, root := ~, start := 409611, stop := 409635 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n\tA standard and widely-used format\ for undirected graphs, with no support\n\tfor loops or multiple edges. Only \ symmetric graphs are allowed -- each\n\tedge is combined with its converse edg\ e to produce a single undirected\n\tedge. This format is best used for \"dens\ e\" graphs -- those with many\n\tedges per vertex.\n ", count := [ 9, 2, \ 4, 10 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 10 ], name := "Ite\ m", next := 409972, root := ~, start := 409643, stop := 409971 ), rec( attributes :\ = rec( ), content := [ rec( content := "sparse6 (.s6)", count := [ 9, 2, 4, 1\ 1 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 11 ], name := "Mar\ k", next := 410005, root := ~, start := 409979, stop := 410004 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n\tUnlike graph6, sparse6 has suppor\ t for loops and multiple edges.\n\tHowever, its use is still limited to symmet\ ric graphs. This format is\n\tbetter-suited to \"sparse\" graphs -- those wit\ h few edges per vertex.\n ", count := [ 9, 2, 4, 12 ], mathmode := "Text" , name\ := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 12 ], name := "Item", next := 4102\ 40, root := ~, start := 410012, stop := 410239 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph6 (.d6)", count := [ 9, 2, 4, 13 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 13 ], name := "Mark", next := 4102\ 74, root := ~, start := 410247, stop := 410273 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n\tThis format is based on graph6, but stores direction information -\ \n\ttherefore is not limited to symmetric graphs. Loops are allowed, but\n\tm\ ultiple edges are not. Best compression with \"dense\" graphs.\n ", coun\ t := [ 9, 2, 4, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 14 ], name := "Ite\ m", next := 410504, root := ~, start := 410281, stop := 410503 ), rec( attributes :\ = rec( ), content := [ rec( content := "disparse6 (.ds6)", count := [ 9, 2, 4\ , 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 15 ], name := "Mar\ k", next := 410540, root := ~, start := 410511, stop := 410539 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n\tAny type of digraph can be encode\ d in disparse6: directions, loops, and\n\tmultiple edges are all allowed. Sim\ ilar to sparse6, this has the best\n\tcompression rate with \"sparse\" graphs.\ \n ", count := [ 9, 2, 4, 16 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 9, 2, 4, 16 ], name := "Item", next := 410752, root := ~, start := 410\ 547, stop := 410751 ), rec( attributes := rec( ), content := [ rec( content :\ = "plain text (.txt)", count := [ 9, 2, 4, 17 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ 9, 2, 4, 17 ], name := "Mark", next := 4107\ 89, root := ~, start := 410759, stop := 410788 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n\tThis is a human-readable format which stores graphs in the form\n \ ", count := [ 9, 2, 4, 18 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "0 7 0 8 1\ 7 2 8 3 8 4 8 5 8 6 8", count := [ 9, 2, 4, 18 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 18 ], mathmode := "Text", name\ := "C", next := 410921, root := ~, start := 410876, stop := 410920 ), rec( cont\ ent := " i.e. pairs of vertices\n describing edges in a graph. More spe\ cifically, the vertices making up\n one edge must be separated by a sin\ gle space, and pairs of vertices must\n be separated by two spaces. ", coun\ t := [ 9, 2, 4, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := 0, count := [ 9, 2, 4, 19 ], mathmode := "Text", name\ := "P", next := 411145, root := ~, start := 411141, stop := 411144 ), rec( cont\ ent := "\n\n See ", count := [ 9, 2, 4, 19 ], mathmode := "Text", name \ := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "ReadPlainTextDigrap\ h" ), content := 0, count := [ 9, 2, 4, 19 ], mathmode := "Text", name := "Ref\ ", next := 411193, root := ~, start := 411159, stop := 411192 ), rec( content \ := " for a more flexible way to store\n digraphs in a plain text file. \ ", count := [ 9, 2, 4, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attr\ ibutes := rec( ), content := 0, count := [ 9, 2, 4, 20 ], mathmode := "Text", name\ := "P", next := 411270, root := ~, start := 411266, stop := 411269 ), rec( cont\ ent := "\n ", count := [ 9, 2, 4, 20 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 9, 2, 4, 18 ], name := "Item", next := 411284, root := ~, start := 410\ 796, stop := 411283 ), rec( attributes := rec( ), content := [ rec( content :\ = "pickled (", count := [ 9, 2, 4, 21 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := ".p", count \ := [ 9, 2, 4, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count\ := [ 9, 2, 4, 21 ], mathmode := "Text", name := "F", next := 411316, root := \ ~, start := 411307, stop := 411315 ), rec( content := " or ", count := [ 9, 2,\ 4, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := ".pickle", count := [ 9, 2, 4, 21 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 21 ], math\ mode := "Text", name := "F", next := 411334, root := ~, start := 411320, stop \ := 411333 ), rec( content := ")", count := [ 9, 2, 4, 21 ], mathmode := "Text" , name\ := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 21 ], name := "Mark", next := 4113\ 42, root := ~, start := 411292, stop := 411341 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n Digraphs are pickled using the ", count := [ 9, 2, 4, 22 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := \ "Text" ), content := [ rec( attributes := rec( Text := "IO" ), content := [ re\ c( content := "\n http://gap-packages.github.io/io/\n", count := [ 9, 2, 4\ , 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, \ 4, 22 ], mathmode := "Text", name := "URL", next := 78, root := ~, start := 17\ , stop := 77 ) ], count := [ 9, 2, 4, 22 ], name := "Alt", next := 84, root :=\ ~, start := 1, stop := 83 ), rec( attributes := rec( Only := "Text" ), conten\ t := [ rec( attributes := rec( ), content := [ rec( content := "IO", count :=\ [ 9, 2, 4, 22 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 22 ], n\ ame := "Package", next := 122, root := ~, start := 101, stop := 121 ) ], count\ := [ 9, 2, 4, 22 ], mathmode := "Text", name := "Alt", next := 128, root := ~ , star\ t := 84, stop := 127 ), rec( content := " package. This is particularly good\n\ when the ", count := [ 9, 2, 4, 22 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "DigraphGroup" ), content :\ = 0, count := [ 9, 2, 4, 22 ], mathmode := "Text", name := "Ref", next := 4114\ 78, root := ~, start := 411452, stop := 411477 ), rec( content := " is non-tri\ vial.\n ", count := [ 9, 2, 4, 22 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 9, 2, 4, 22 ], name := "Item", next := 411508, root := ~, start := 411\ 349, stop := 411507 ) ], count := [ 9, 2, 4, 9 ], mathmode := "Text", name := "List", next := 411520, root := ~, start := 409598, stop := 411519 ), rec( content := "\n\n \ ", count := [ 9, 2, 4, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> filename := Concatenation(DIGRAPHS_Dir(), \"/tst/out/man.d6.gz\");;\ngap\ > file := DigraphFile(filename, \"w\");;\ngap> for i in [1 .. 10] do\n> WriteD\ igraphs(file, Digraph([[1, 3], [2], [1, 2]]));\n> od;\ngap> IO_Close(file);;\n\ gap> file := DigraphFile(filename, \"r\");;\ngap> ReadDigraphs(file, 9);\n", count := [ 9, 2, 4, 25 ], name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 4, 25 ], mathmode := "Text", name := "Example", next := 411895, root := ~, start := 411526, stop := 411894 ), rec( content := "\n ", count := [ 9, 2, 4, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 4, 3 ], mathmode := "Text", name := "Description", next := 411914, root := ~, start := 407835, stop := 411913 ) ], count := [ 9, 2, 4, 1 ], mathmode := "Text", name := "ManSection", next := 411928, root := ~, start := 407718, stop := 411927 ), rec( content := "\n\n ", count := [ 9, 2, 4, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "filename[, decod\ er][, n]", Name := "ReadDigraphs" ), content := 0, count := [ 9, 2, 5, 2 ], mathmode := "Text", name := "Func", next := 412007, root := ~, start := 411949, stop := 412006 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ , or a list of digraphs.", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "Returns", next := 412062, root := ~, start := 412010, stop := 412061 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "A", next := 412101, root := ~, start := 412086, stop := 412100 ), rec( content := " is a st\ ring containing the name of a file containing\n encoded digraphs or an ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "IO" ), content := [ rec( content := "\n http://gap-packages\ .github.io/io/\n", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "URL", next := 78, root := ~, start := 17, stop := 77 ) ], count := [ 9, 2, 5, 3 ], name := "Alt", next := 84, root := ~, start := 1, stop := 83 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "IO", count := [ 9, 2, 5, 3 ], name := \ "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], name := "Package", next := 122, root := ~, start := 101 , stop := 121 ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "Alt", next := 128, root := ~, start := 84, stop := 127 ), rec( content := " file ob\ ject created using ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ File" ), content := 0, count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "Ref", next := 412244, root := ~, start := 412213, stop := 412243 ), rec( content := ", then " , count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "R\ eadDigraphs", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "C", next := 412270, root := ~, start := 412251, stop := 412269 ), rec( content := " returns\ the digraphs\n encoded in the file as a list. Note that if ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "A", next := 412356, root := ~, start := 412341, stop := 412355 ), rec( content := " is a\n \ compressed file, which has been compressed appropriately to give a filename\ \n extension of ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ gz", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "C", next := 412469, root := ~, start := 412459, stop := 412468 ), rec( content := ", ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ bz2", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "C", next := 412482, root := ~, start := 412471, stop := 412481 ), rec( content := ", or ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ xz", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "C", next := 412497, root := ~, start := 412487, stop := 412496 ), rec( content := ", then\n\ ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "R\ eadDigraphs", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "C", next := 412527, root := ~, start := 412508, stop := 412526 ), rec( content := " can rea\ d ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "A", next := 412552, root := ~, start := 412537, stop := 412551 ), rec( content := " without\ it first needing to be\n decompressed.\n ", count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "P", next := 412610, root := ~, start := 412606, stop := 412609 ), rec( content := "\n\n \ If the optional argument ", count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ecoder", count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "A", next := 412655, root := ~, start := 412641, stop := 412654 ), rec( content := " is spec\ ified\n and is a function which decodes a string into a digraph,\n then \ ", count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "R\ eadDigraphs", count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "C", next := 412758, root := ~, start := 412739, stop := 412757 ), rec( content := " will us\ e ", count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ecoder", count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "A", next := 412782, root := ~, start := 412768, stop := 412781 ), rec( content := " to deco\ de the digraphs\n contained in ", count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "A", next := 412838, root := ~, start := 412823, stop := 412837 ), rec( content := ".", count := [ 9, 2, 5, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "P", next := 412843, root := ~, start := 412839, stop := 412842 ), rec( content := "\n\n \ If the optional argument ", count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "A", next := 412882, root := ~, start := 412874, stop := 412881 ), rec( content := " is spec\ ified, then ", count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "R\ eadDigraphs", count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "C", next := 412921, root := ~, start := 412902, stop := 412920 ), rec( content := "\n re\ turns the ", count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "A", next := 412946, root := ~, start := 412938, stop := 412945 ), rec( content := "th digra\ ph encoded in the file ", count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "A", next := 412992, root := ~, start := 412977, stop := 412991 ), rec( content := ".\n " , count := [ 9, 2, 5, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "P", next := 413002, root := ~, start := 412998, stop := 413001 ), rec( content := "\n\n \ If the optional argument ", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ecoder", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "A", next := 413047, root := ~, start := 413033, stop := 413046 ), rec( content := " is not \ specified, then\n ", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "R\ eadDigraphs", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "C", next := 413094, root := ~, start := 413075, stop := 413093 ), rec( content := " will de\ duce which decoder to use based on the filename\n extension of ", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "A", next := 413182, root := ~, start := 413167, stop := 413181 ), rec( content := " (after \ removing the compression-related\n filename extensions ", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ gz", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "C", next := 413257, root := ~, start := 413247, stop := 413256 ), rec( content := ", ", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ bz2", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "C", next := 413270, root := ~, start := 413259, stop := 413269 ), rec( content := ", and ", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ xz", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "C", next := 413286, root := ~, start := 413276, stop := 413285 ), rec( content := "). For \ example,\n if the filename extension is ", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ g6", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "C", next := 413346, root := ~, start := 413336, stop := 413345 ), rec( content := ", then " , count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "R\ eadDigraphs", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "C", next := 413372, root := ~, start := 413353, stop := 413371 ), rec( content := " will us\ e\n the graph6 decoder ", count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ FromGraph6String" ), content := 0, count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "Ref", next := 413442, root := ~, start := 413405, stop := 413441 ), rec( content := ".\n " , count := [ 9, 2, 5, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 5, 7 ], mathmode := "Text", name := "P", next := 413452, root := ~, start := 413448, stop := 413451 ), rec( content := "\n\n \ The currently supported file formats, and associated filename extensions,\n \ are:\n ", count := [ 9, 2, 5, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "graph6 (.g6)", count := [ 9, 2, 5, 8 ] , math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 8 ], name := "Mar\ k", next := 413583, root := ~, start := 413558, stop := 413582 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n\tA standard and widely-used format\ for undirected graphs, with no support\n\tfor loops or multiple edges. Only \ symmetric graphs are allowed -- each\n\tedge is combined with its converse edg\ e to produce a single undirected\n\tedge. This format is best used for \"dens\ e\" graphs -- those with many\n\tedges per vertex.\n ", count := [ 9, 2, \ 5, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 9 ], name := "Ite\ m", next := 413919, root := ~, start := 413590, stop := 413918 ), rec( attributes :\ = rec( ), content := [ rec( content := "sparse6 (.s6)", count := [ 9, 2, 5, 1\ 0 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 10 ], name := "Mar\ k", next := 413952, root := ~, start := 413926, stop := 413951 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n\tUnlike graph6, sparse6 has suppor\ t for loops and multiple edges.\n\tHowever, its use is still limited to symmet\ ric graphs. This format is\n\tbetter-suited to \"sparse\" graphs -- those wit\ h few edges per vertex.\n ", count := [ 9, 2, 5, 11 ], mathmode := "Text" , name\ := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 11 ], name := "Item", next := 4141\ 87, root := ~, start := 413959, stop := 414186 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph6 (.d6)", count := [ 9, 2, 5, 12 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 12 ], name := "Mark", next := 4142\ 21, root := ~, start := 414194, stop := 414220 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n\tThis format is based on graph6, but stores direction information -\ \n\ttherefore is not limited to symmetric graphs. Loops are allowed, but\n\tm\ ultiple edges are not. Best compression with \"dense\" graphs.\n ", coun\ t := [ 9, 2, 5, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 13 ], name := "Ite\ m", next := 414451, root := ~, start := 414228, stop := 414450 ), rec( attributes :\ = rec( ), content := [ rec( content := "disparse6 (.ds6)", count := [ 9, 2, 5\ , 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 14 ], name := "Mar\ k", next := 414487, root := ~, start := 414458, stop := 414486 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n\tAny type of digraph can be encode\ d in disparse6: directions, loops, and\n\tmultiple edges are all allowed. Sim\ ilar to sparse6, this has the best\n\tcompression rate with \"sparse\" graphs.\ \n ", count := [ 9, 2, 5, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 9, 2, 5, 15 ], name := "Item", next := 414699, root := ~, start := 414\ 494, stop := 414698 ), rec( attributes := rec( ), content := [ rec( content :\ = "plain text (.txt)", count := [ 9, 2, 5, 16 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ 9, 2, 5, 16 ], name := "Mark", next := 4147\ 36, root := ~, start := 414706, stop := 414735 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n\tThis is a human-readable format which stores graphs in the form\n \ ", count := [ 9, 2, 5, 17 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "0 7 0 8 1\ 7 2 8 3 8 4 8 5 8 6 8", count := [ 9, 2, 5, 17 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 17 ], mathmode := "Text", name\ := "C", next := 414868, root := ~, start := 414823, stop := 414867 ), rec( cont\ ent := " i.e. pairs of vertices\n describing edges in a graph. More spe\ cifically, the vertices making up\n one edge must be separated by a sin\ gle space, and pairs of vertices must\n be separated by two spaces. ", coun\ t := [ 9, 2, 5, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := 0, count := [ 9, 2, 5, 18 ], mathmode := "Text", name\ := "P", next := 415092, root := ~, start := 415088, stop := 415091 ), rec( cont\ ent := "\n\n See ", count := [ 9, 2, 5, 18 ], mathmode := "Text", name \ := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "ReadPlainTextDigrap\ h" ), content := 0, count := [ 9, 2, 5, 18 ], mathmode := "Text", name := "Ref\ ", next := 415140, root := ~, start := 415106, stop := 415139 ), rec( content \ := " for a more flexible way to store\n digraphs in a plain text file. \ ", count := [ 9, 2, 5, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attr\ ibutes := rec( ), content := 0, count := [ 9, 2, 5, 19 ], mathmode := "Text", name\ := "P", next := 415217, root := ~, start := 415213, stop := 415216 ), rec( cont\ ent := "\n", count := [ 9, 2, 5, 19 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( content := "\n Just so I remember:\n ReadPlainT\ extDigraph(\"data-local/soc-Epinions1.txt.gz\", \"\\t\", 1,\n '#');\ \n", count := [ 9, 2, 5, 19 ], mathmode := "Text", name := "XMLCOMMENT", root \ := ~ ), rec( content := "\n ", count := [ 9, 2, 5, 19 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 17 ], name := "Item", next := 4153\ 62, root := ~, start := 414743, stop := 415361 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "pickled (", count := [ 9, 2, 5, 20 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ p", count := [ 9, 2, 5, 20 ], mathmode := "Text", name := "PCDATA", root := ~ \ ) ], count := [ 9, 2, 5, 20 ], mathmode := "Text", name := "F", next := 415394 , root\ := ~, start := 415385, stop := 415393 ), rec( content := " or ", count := [ 9\ , 2, 5, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := [ rec( content := ".pickle", count := [ 9, 2, 5, 20 \ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 20\ ], mathmode := "Text", name := "F", next := 415412, root := ~, start := 41539\ 8, stop := 415411 ), rec( content := ")", count := [ 9, 2, 5, 20 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 20 ], name := "Mar\ k", next := 415420, root := ~, start := 415370, stop := 415419 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n Digraphs are pickled using \ the ", count := [ 9, 2, 5, 21 ], mathmode := "Text", name := "PCDATA", root :=\ ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "IO" ), content := [ rec( content := "\n http://gap-packages\ .github.io/io/\n", count := [ 9, 2, 5, 21 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 9, 2, 5, 21 ], mathmode := "Text", name := "URL\ ", next := 78, root := ~, start := 17, stop := 77 ) ], count := [ 9, 2, 5, 21 ] , name\ := "Alt", next := 84, root := ~, start := 1, stop := 83 ), rec( attributes :=\ rec( Only := "Text" ), content := [ rec( attributes := rec( ), content := [ \ rec( content := "IO", count := [ 9, 2, 5, 21 ], name := "PCDATA", root := ~ ) \ ], count := [ 9, 2, 5, 21 ], name := "Package", next := 122, root := ~, start \ := 101, stop := 121 ) ], count := [ 9, 2, 5, 21 ], mathmode := "Text", name :=\ "Alt", next := 128, root := ~, start := 84, stop := 127 ), rec( content := " \ package. This is particularly good\n when the ", count := [ 9, 2, 5, 21\ ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec(\ Attr := "DigraphGroup" ), content := 0, count := [ 9, 2, 5, 21 ], mathmode :=\ "Text", name := "Ref", next := 415556, root := ~, start := 415530, stop := 41\ 5555 ), rec( content := " is non-trivial.\n ", count := [ 9, 2, 5, 21 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 21 ], name := "Ite\ m", next := 415586, root := ~, start := 415427, stop := 415585 ) ], count := [ 9, 2, 5, 8 ], mathmode := "Text", name := "List", next := 415598, root := ~, start := 413545, stop := 415597 ), rec( content := "\n\n \ ", count := [ 9, 2, 5, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> ReadDigraphs(\n> Concatenation(DIGRAPHS_Dir(), \"/data/graph5.g6.gz\"), \ 10);\n\ngap> ReadDigraphs(\n> Conc\ atenation(DIGRAPHS_Dir(), \"/data/graph5.g6.gz\"), 17);\n\ngap> ReadDigraphs(\n> Concatenation(DIGRAPHS_Dir(), \ \"/data/tree9.4.txt\"));\n[ , \n \ , \n , \n , \n , \n , \n , \n , \n , \n , \n , \n , \ \n , \n ]", count := [ 9, 2, 5, 24 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 24 ], mathmode := "Text", name := "Example", next := 416644, root := ~, start := 415604, stop := 416643 ), rec( content := "\n ", count := [ 9, 2, 5, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 5, 3 ], mathmode := "Text", name := "Description", next := 416663, root := ~, start := 412065, stop := 416662 ) ], count := [ 9, 2, 5, 1 ], mathmode := "Text", name := "ManSection", next := 416677, root := ~, start := 411934, stop := 416676 ), rec( content := "\n\n ", count := [ 9, 2, 5, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "filename, digrap\ hs[, encoder] [, mode]", Name := "WriteDigraphs" ), content := 0, count := [ 9, 2, 6, 2 ], mathmode := "Text", name := "Func", next := 416771, root := ~, start := 416698, stop := 416770 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraphs", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "A", next := 416810, root := ~, start := 416795, stop := 416809 ), rec( content := " is a li\ st of digraphs or a digraph and ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "A", next := 416865, root := ~, start := 416850, stop := 416864 ), rec( content := "\n is\ a string or an ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "IO" ), content := [ rec( content := "\n http://gap-packages\ .github.io/io/\n", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "URL", next := 78, root := ~, start := 17, stop := 77 ) ], count := [ 9, 2, 6, 3 ], name := "Alt", next := 84, root := ~, start := 1, stop := 83 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "IO", count := [ 9, 2, 6, 3 ], name := \ "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 3 ], name := "Package", next := 122, root := ~, start := 101 , stop := 121 ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "Alt", next := 128, root := ~, start := 84, stop := 127 ), rec( content := " file ob\ ject created using ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ File" ), content := 0, count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "Ref", next := 416944, root := ~, start := 416919, stop := 416943 ), rec( content := ",\n t\ hen ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "W\ riteDigraphs", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "C", next := 416975, root := ~, start := 416955, stop := 416974 ), rec( content := " writes \ the digraphs to the file represented by\n ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "A", next := 417042, root := ~, start := 417027, stop := 417041 ), rec( content := ". If th\ e supplied filename ends in one of the extensions\n ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ gz", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "C", next := 417114, root := ~, start := 417104, stop := 417113 ), rec( content := ", ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ bz2", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "C", next := 417127, root := ~, start := 417116, stop := 417126 ), rec( content := ", or ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ xz", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "C", next := 417142, root := ~, start := 417132, stop := 417141 ), rec( content := ", then t\ he file will be compressed\n appropriately. Excluding these extensions, if\ the file ends with an\n extension in the list below, the corresponding gra\ ph format will be used to\n encode it. If such an extension is not include\ d, an appropriate format\n will be chosen intelligently, and an extension a\ ppended, to minimise file\n size.\n ", count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "P", next := 417502, root := ~, start := 417498, stop := 417501 ), rec( content := "\n\n \ ", count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " TODO: e\ ncode and mode. ", count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "XMLCOMMENT" , root := ~ ), rec( content := "\n\n \ For more verbose information on the progress of the function, set the info\n \ level of ", count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ nfoDigraphs", count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "A", next := 417652, root := ~, start := 417633, stop := 417651 ), rec( content := " to 1 or\ higher, using ", count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ etInfoLevel", count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "C", next := 417694, root := ~, start := 417675, stop := 417693 ), rec( content := ".", count := [ 9, 2, 6, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 6, 5 ], mathmode := "Text", name := "P", next := 417699, root := ~, start := 417695, stop := 417698 ), rec( content := "\n\n \ The currently supported file formats are:\n ", count := [ 9, 2, 6, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "graph6 (.g6)", count := [ 9, 2, 6, 6 ] , math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 6 ], name := "Mar\ k", next := 417789, root := ~, start := 417764, stop := 417788 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n\tA standard and widely-used format\ for undirected graphs, with no support\n\tfor loops or multiple edges. Only \ symmetric graphs are allowed -- each\n\tedge is combined with its converse edg\ e to produce a single undirected\n\tedge. This format is best used for \"dens\ e\" graphs -- those with many\n\tedges per vertex.\n ", count := [ 9, 2, \ 6, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 7 ], name := "Ite\ m", next := 418125, root := ~, start := 417796, stop := 418124 ), rec( attributes :\ = rec( ), content := [ rec( content := "sparse6 (.s6)", count := [ 9, 2, 6, 8\ ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 8 ], name := "Mar\ k", next := 418158, root := ~, start := 418132, stop := 418157 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n\tUnlike graph6, sparse6 has suppor\ t for loops and multiple edges.\n\tHowever, its use is still limited to symmet\ ric graphs. This format is\n\tbetter-suited to \"sparse\" graphs -- those wit\ h few edges per vertex.\n ", count := [ 9, 2, 6, 9 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 9 ], name := "Item", next := 4183\ 93, root := ~, start := 418165, stop := 418392 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph6 (.d6)", count := [ 9, 2, 6, 10 ], mathmode := "Text", name :=\ "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 10 ], name := "Mark", next := 4184\ 27, root := ~, start := 418400, stop := 418426 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n\tThis format is based on graph6, but stores direction information -\ \n\ttherefore is not limited to symmetric graphs. Loops are allowed, but\n\tm\ ultiple edges are not. Best compression with \"dense\" graphs.\n ", coun\ t := [ 9, 2, 6, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 11 ], name := "Ite\ m", next := 418657, root := ~, start := 418434, stop := 418656 ), rec( attributes :\ = rec( ), content := [ rec( content := "disparse6 (.ds6)", count := [ 9, 2, 6\ , 12 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 12 ], name := "Mar\ k", next := 418693, root := ~, start := 418664, stop := 418692 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n\tAny type of digraph can be encode\ d in disparse6: directions, loops, and\n\tmultiple edges are all allowed. Sim\ ilar to sparse6, this has the best\n\tcompression rate with \"sparse\" graphs.\ \n ", count := [ 9, 2, 6, 13 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ 9, 2, 6, 13 ], name := "Item", next := 418905, root := ~, start := 418\ 700, stop := 418904 ), rec( attributes := rec( ), content := [ rec( content :\ = "plain text (.txt)", count := [ 9, 2, 6, 14 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ 9, 2, 6, 14 ], name := "Mark", next := 4189\ 43, root := ~, start := 418913, stop := 418942 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n\tThis is a human-readable format which stores graphs in the form\n \ ", count := [ 9, 2, 6, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "0 7 0 8 1\ 7 2 8 3 8 4 8 5 8 6 8", count := [ 9, 2, 6, 15 ], mathmode := "Text", na\ me := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 15 ], mathmode := "Text", name\ := "C", next := 419075, root := ~, start := 419030, stop := 419074 ), rec( cont\ ent := " i.e. pairs of vertices\n describing edges in a graph. More spe\ cifically, the vertices making up\n one edge must be separated by a sin\ gle space, and pairs of vertices must\n be separated by two spaces. ", coun\ t := [ 9, 2, 6, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := 0, count := [ 9, 2, 6, 16 ], mathmode := "Text", name\ := "P", next := 419299, root := ~, start := 419295, stop := 419298 ), rec( cont\ ent := "\n\n See ", count := [ 9, 2, 6, 16 ], mathmode := "Text", name \ := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "ReadPlainTextDigrap\ h" ), content := 0, count := [ 9, 2, 6, 16 ], mathmode := "Text", name := "Ref\ ", next := 419347, root := ~, start := 419313, stop := 419346 ), rec( content \ := " for a more flexible way to store\n digraphs in a plain text file. \ ", count := [ 9, 2, 6, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attr\ ibutes := rec( ), content := 0, count := [ 9, 2, 6, 17 ], mathmode := "Text", name\ := "P", next := 419424, root := ~, start := 419420, stop := 419423 ), rec( cont\ ent := "\n", count := [ 9, 2, 6, 17 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( content := "\n Just so I remember:\n ReadPlainT\ extDigraph(\"data-local/soc-Epinions1.txt.gz\", \"\\t\", 1, '#');\n", coun\ t := [ 9, 2, 6, 17 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( cont\ ent := "\n ", count := [ 9, 2, 6, 17 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 9, 2, 6, 15 ], name := "Item", next := 419561, root := ~, start := 418\ 950, stop := 419560 ), rec( attributes := rec( ), content := [ rec( content :\ = "pickled (", count := [ 9, 2, 6, 18 ], mathmode := "Text", name := "PCDATA", root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := ".p", count \ := [ 9, 2, 6, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count\ := [ 9, 2, 6, 18 ], mathmode := "Text", name := "F", next := 419592, root := \ ~, start := 419583, stop := 419591 ), rec( content := " or ", count := [ 9, 2,\ 6, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := ".pickle", count := [ 9, 2, 6, 18 ], m\ athmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 18 ], math\ mode := "Text", name := "F", next := 419610, root := ~, start := 419596, stop \ := 419609 ), rec( content := ")", count := [ 9, 2, 6, 18 ], mathmode := "Text" , name\ := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 18 ], name := "Mark", next := 4196\ 18, root := ~, start := 419568, stop := 419617 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n Digraphs are pickled using the ", count := [ 9, 2, 6, 19 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := \ "Text" ), content := [ rec( attributes := rec( Text := "IO" ), content := [ re\ c( content := "\n http://gap-packages.github.io/io/\n", count := [ 9, 2, 6\ , 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, \ 6, 19 ], mathmode := "Text", name := "URL", next := 78, root := ~, start := 17\ , stop := 77 ) ], count := [ 9, 2, 6, 19 ], name := "Alt", next := 84, root :=\ ~, start := 1, stop := 83 ), rec( attributes := rec( Only := "Text" ), conten\ t := [ rec( attributes := rec( ), content := [ rec( content := "IO", count :=\ [ 9, 2, 6, 19 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 19 ], n\ ame := "Package", next := 122, root := ~, start := 101, stop := 121 ) ], count\ := [ 9, 2, 6, 19 ], mathmode := "Text", name := "Alt", next := 128, root := ~ , star\ t := 84, stop := 127 ), rec( content := " package. This is particularly good\n\ when the ", count := [ 9, 2, 6, 19 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "DigraphGroup" ), content :\ = 0, count := [ 9, 2, 6, 19 ], mathmode := "Text", name := "Ref", next := 4197\ 54, root := ~, start := 419728, stop := 419753 ), rec( content := " is non-tri\ vial.\n ", count := [ 9, 2, 6, 19 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ 9, 2, 6, 19 ], name := "Item", next := 419784, root := ~, start := 419\ 625, stop := 419783 ) ], count := [ 9, 2, 6, 6 ], mathmode := "Text", name := "List", next := 419796, root := ~, start := 417751, stop := 419795 ), rec( content := "\n\n \ ", count := [ 9, 2, 6, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> grs := [];;\ngap> grs[1] := Digraph([]);\n\ngap> grs[2] := Digraph([[1, 3], [2], [1, 2]]);\n\ngap> grs[3] := Digraph([\n> [6, 7], [6, 9], [1, 3\ , 4, 5, 8, 9],\n> [1, 2, 3, 4, 5, 6, 7, 10], [1, 5, 6, 7, 10], [2, 4, 5, 9, 10\ ],\n> [3, 4, 5, 6, 7, 8, 9, 10], [1, 3, 5, 7, 8, 9], [1, 2, 5],\n> [1, 2, 4, 6\ , 7, 8]]);\n\ngap> filename := C\ oncatenation(DIGRAPHS_Dir(), \"/tst/out/man.d6.gz\");;\ngap> WriteDigraphs(fil\ ename, grs, \"w\");\nIO_OK\ngap> ReadDigraphs(filename);\n[ , \n , \n \ ]", count := [ 9, 2, 6, 22 ], name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 6, 22 ], mathmode := "Text", name := "Example", next := 420563, root := ~, start := 419802, stop := 420562 ), rec( content := "\n ", count := [ 9, 2, 6, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 6, 3 ], mathmode := "Text", name := "Description", next := 420582, root := ~, start := 416774, stop := 420581 ) ], count := [ 9, 2, 6, 1 ], mathmode := "Text", name := "ManSection", next := 420596, root := ~, start := 416683, stop := 420595 ), rec( content := "\n\n ", count := [ 9, 2, 6, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "filename [, deco\ der]", Name := "IteratorFromDigraphFile" ), content := 0, count := [ 9, 2, 7, 2 ], mathmode := "Text", name := "Func", next := 420682, root := ~, start := 420617, stop := 420681 ), rec( attributes := rec( ), content := [ rec( content := "An iterat\ or.", count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "Returns", next := 420716, root := ~, start := 420685, stop := 420715 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "A", next := 420755, root := ~, start := 420740, stop := 420754 ), rec( content := " is a st\ ring representing the name of a file containing\n encoded digraphs, then ", count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ teratorFromDigraphFile", count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "C", next := 420868, root := ~, start := 420838, stop := 420867 ), rec( content := " returns\ an iterator\n for which the value of ", count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( BookName := "ref\ ", Oper := "NextIterator" ), content := 0, count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "Ref", next := 420957, root := ~, start := 420916, stop := 420956 ), rec( content := " is the\\ n next digraph encoded in the file.\n ", count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "P", next := 421011, root := ~, start := 421007, stop := 421010 ), rec( content := "\n\n \ If the optional argument ", count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ecoder", count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "A", next := 421056, root := ~, start := 421042, stop := 421055 ), rec( content := " is spec\ ified and is a function\n which decodes a string into a digraph, then ", count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ teratorFromDigraphFile", count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "C", next := 421166, root := ~, start := 421136, stop := 421165 ), rec( content := "\n wi\ ll use ", count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ ecoder", count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "A", next := 421194, root := ~, start := 421180, stop := 421193 ), rec( content := " to deco\ de the digraphs contained in ", count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "A", next := 421246, root := ~, start := 421231, stop := 421245 ), rec( content := ".\n " , count := [ 9, 2, 7, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 7, 5 ], mathmode := "Text", name := "P", next := 421256, root := ~, start := 421252, stop := 421255 ), rec( content := "\n\n \ The purpose of this function is to easily allow looping over digraphs\n enc\ oded in a file when loading all of the encoded digraphs would require\n too\ much memory. ", count := [ 9, 2, 7, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 7, 6 ], mathmode := "Text", name := "P", next := 421434, root := ~, start := 421430, stop := 421433 ), rec( content := "\n\n \ To see what file types are available, see ", count := [ 9, 2, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "WriteDi\ graphs" ), content := 0, count := [ 9, 2, 7, 6 ], mathmode := "Text", name := "Ref", next := 421509, root := ~, start := 421482, stop := 421508 ), rec( content := ".\n\n \ ", count := [ 9, 2, 7, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "\\ ngap> filename := Concatenation(DIGRAPHS_Dir(), \"/tst/out/man.d6.gz\");;\ngap\ > file := DigraphFile(filename, \"w\");;\ngap> for i in [1 .. 10] do\n> Writ\ eDigraphs(file, Digraph([[1, 3], [2], [1, 2]]));\n> od;\ngap> IO_Close(file);;\ \ngap> iter := IteratorFromDigraphFile(filename);\n\ngap> for x in i\ ter do od;\n", count := [ 9, 2, 7, 7 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 7, 7 ], mathmode := "Text", name := "Example", next := 421858, root := ~, start := 421516, stop := 421857 ), rec( content := "\n ", count := [ 9, 2, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 7, 3 ], mathmode := "Text", name := "Description", next := 421875, root := ~, start := 420719, stop := 421874 ) ], count := [ 9, 2, 7, 1 ], mathmode := "Text", name := "ManSection", next := 421889, root := ~, start := 420602, stop := 421888 ), rec( content := "\n\n ", count := [ 9, 2, 7, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "delimiter1, [del\ imiter2,] offset", Name := "DigraphPlainTextLineEncoder" ), content := 0, count := [ 9, 2, 8, 2 ], mathmode := "Text", name := "Func", next := 421991, root := ~, start := 421910, stop := 421990 ), rec( attributes := rec( Arg := "delimiter1, [del\ imiter2,] offset", Name := "DigraphPlainTextLineDecoder" ), content := 0, count := [ 9, 2, 8, 4 ], mathmode := "Text", name := "Oper", next := 422075, root := ~, start := 421994, stop := 422074 ), rec( attributes := rec( ), content := [ rec( content := "A string.\ ", count := [ 9, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 8, 5 ], mathmode := "Text", name := "Returns", next := 422106, root := ~, start := 422078, stop := 422105 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ se two functions return a function which encodes or decodes a digraph in\n \ a plain text format.", count := [ 9, 2, 8, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "P", next := 422231, root := ~, start := 422227, stop := 422230 ), rec( content := "\n\n \ ", count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphPlainTextLineEncoder", count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "A", next := 422271, root := ~, start := 422237, stop := 422270 ), rec( content := " returns\ a function which takes a single\n digraph as an argument. The function re\ turns a string describing the edges\n of that digraph; each edge is written\ as a pair of integers separated by the\n string ", count := [ 9, 2, 8, 6 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ elimiter2", count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "A", next := 422501, root := ~, start := 422484, stop := 422500 ), rec( content := ", and th\ e edges themselves are separated by the\n string ", count := [ 9, 2, 8, 6 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ elimiter1", count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "A", next := 422577, root := ~, start := 422560, stop := 422576 ), rec( content := ". ", count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphPlainTextLineDecoder", count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "A", next := 422614, root := ~, start := 422580, stop := 422613 ), rec( content := " returns\ the\n corresponding decoder function, which takes a string argument in thi\ s format\n and returns a digraph.", count := [ 9, 2, 8, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 8, 7 ], mathmode := "Text", name := "P", next := 422738, root := ~, start := 422734, stop := 422737 ), rec( content := "\n\n \ If only one delimiter is passed as an argument to\n ", count := [ 9, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphPlainTextLineDecoder", count := [ 9, 2, 8, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 8, 7 ], mathmode := "Text", name := "A", next := 422832, root := ~, start := 422798, stop := 422831 ), rec( content := ", it wil\ l return a function which decodes\n a single edge, returning its contents a\ s a list of integers.", count := [ 9, 2, 8, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 8, 8 ], mathmode := "Text", name := "P", next := 422942, root := ~, start := 422938, stop := 422941 ), rec( content := "\n\n \ The argument ", count := [ 9, 2, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ffset", count := [ 9, 2, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 8, 8 ], mathmode := "Text", name := "A", next := 422974, root := ~, start := 422961, stop := 422973 ), rec( content := " should \ be an integer, which will describe a\n number to be added to each vertex be\ fore it is encoded, or after it is\n decoded. This may be used, for exampl\ e, to label vertices starting at 0\n instead of 1.", count := [ 9, 2, 8, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 8, 9 ], mathmode := "Text", name := "P", next := 423192, root := ~, start := 423188, stop := 423191 ), rec( content := "\n\n \ Note that the number of vertices of a digraph is not stored, and so vertices\n\ which are not connected to any edge may be lost.\n\n ", count := [ 9, 2, 8, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[2, 3], [1], [1]]);\n\ngap> enc := DigraphPlainTextLineEncoder(\" \", \" \", -1);;\ngap> d\ ec := DigraphPlainTextLineDecoder(\" \", \" \", 1);;\ngap> enc(gr);\n\"0 1 0\ 2 1 0 2 0\"\ngap> dec(last);\n\ \n", count := [ 9, 2, 8, 10 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 8, 10 ], mathmode := "Text", name := "Example", next := 423659, root := ~, start := 423333, stop := 423658 ), rec( content := "\n ", count := [ 9, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 8, 5 ], mathmode := "Text", name := "Description", next := 423676, root := ~, start := 422109, stop := 423675 ) ], count := [ 9, 2, 8, 1 ], mathmode := "Text", name := "ManSection", next := 423690, root := ~, start := 421895, stop := 423689 ), rec( content := "\n\n ", count := [ 9, 2, 8, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "str", Name := "TournamentLineD\ ecoder" ), content := 0, count := [ 9, 2, 9, 2 ], mathmode := "Text", name := "Oper", next := 423757, root := ~, start := 423711, stop := 423756 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 9, 2, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 3 ], mathmode := "Text", name := "Returns", next := 423789, root := ~, start := 423760, stop := 423788 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function takes a string ", count := [ 9, 2, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tr", count := [ 9, 2, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 3 ], mathmode := "Text", name := "A", next := 423849, root := ~, start := 423839, stop := 423848 ), rec( content := ", decode\ s it, and then returns the\n tournament [see ", count := [ 9, 2, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsTourn\ ament" ), content := 0, count := [ 9, 2, 9, 3 ], mathmode := "Text", name := "Ref", next := 423930, root := ~, start := 423904, stop := 423929 ), rec( content := "] which \ it defines, according to\n the following rules. ", count := [ 9, 2, 9, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 9, 4 ], mathmode := "Text", name := "P", next := 423992, root := ~, start := 423988, stop := 423991 ), rec( content := "\n\n \ The characters of the string ", count := [ 9, 2, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tr", count := [ 9, 2, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 4 ], mathmode := "Text", name := "A", next := 424037, root := ~, start := 424027, stop := 424036 ), rec( content := " represe\ nt the entries in the upper\n triangle of a tournament's adjacency matrix. \ The number of vertices\n ", count := [ 9, 2, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 9, 2, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 4 ], mathmode := "Text", name := "C", next := 424157, root := ~, start := 424149, stop := 424156 ), rec( content := " will be\ detected from the length of the string and will be as\n large as possible.\ ", count := [ 9, 2, 9, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "P", next := 424248, root := ~, start := 424244, stop := 424247 ), rec( content := "\n\n \ The first character represents the possible edge ", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ -> 2", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "C", next := 424316, root := ~, start := 424303, stop := 424315 ), rec( content := ", the se\ cond\n represents ", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ -> 3", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "C", next := 424357, root := ~, start := 424344, stop := 424356 ), rec( content := " and so \ on until ", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ -> n", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "C", next := 424387, root := ~, start := 424374, stop := 424386 ), rec( content := "; then t\ he following\n character represents ", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "2\ -> 3", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "C", next := 424446, root := ~, start := 424433, stop := 424445 ), rec( content := ", and so\ on up to the character which\n represents the edge ", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ -1 -> n", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "C", next := 424523, root := ~, start := 424508, stop := 424522 ), rec( content := ". ", count := [ 9, 2, 9, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "P", next := 424529, root := ~, start := 424525, stop := 424528 ), rec( content := "\n\n \ If a character of the string with corresponding edge ", count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ -> j", count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "C", next := 424601, root := ~, start := 424588, stop := 424600 ), rec( content := " is equa\ l\n to ", count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "C", next := 424626, root := ~, start := 424618, stop := 424625 ), rec( content := ", then t\ he edge ", count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ -> j", count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "C", next := 424655, root := ~, start := 424642, stop := 424654 ), rec( content := " is pres\ ent in the tournament.\n Otherwise, the edge ", count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ -> j", count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "C", next := 424723, root := ~, start := 424710, stop := 424722 ), rec( content := " is pres\ ent instead. In this way, all the\n possible edges are encoded one-by-one.\ \n\n ", count := [ 9, 2, 9, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := TournamentLineDecoder(\"100001\");\n\ngap> OutNeighbours(gr);\n[ [ 2 ], [ ], [ 1, 2, 4 ], [ 1, 2 ] \ ]\n", count := [ 9, 2, 9, 7 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 7 ], mathmode := "Text", name := "Example", next := 424998, root := ~, start := 424814, stop := 424997 ), rec( content := "\n ", count := [ 9, 2, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 9, 3 ], mathmode := "Text", name := "Description", next := 425015, root := ~, start := 423792, stop := 425014 ) ], count := [ 9, 2, 9, 1 ], mathmode := "Text", name := "ManSection", next := 425029, root := ~, start := 423696, stop := 425028 ), rec( content := "\n\n ", count := [ 9, 2, 9, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "str", Name := "AdjacencyMatrix\ UpperTriangleLineDecoder" ), content := 0, count := [ 9, 2, 10, 2 ], mathmode := "Text", name := "Oper", next := 425114, root := ~, start := 425050, stop := 425113 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 9, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 3 ], mathmode := "Text", name := "Returns", next := 425146, root := ~, start := 425117, stop := 425145 ), rec( attributes := rec( ), content := [ rec( content := "\n Thi\ s function takes a string ", count := [ 9, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tr", count := [ 9, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 3 ], mathmode := "Text", name := "A", next := 425206, root := ~, start := 425196, stop := 425205 ), rec( content := ", decode\ s it, and then returns the\n topologically sorted digraph [see ", count := [ 9, 2, 10, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ TopologicalSort" ), content := 0, count := [ 9, 2, 10, 3 ], mathmode := "Text", name := "Ref", next := 425315, root := ~, start := 425279, stop := 425314 ), rec( content := "]\n w\ hich it defines, according to the following rules. ", count := [ 9, 2, 10, 3 ] , mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 10, 4 ], mathmode := "Text", name := "P", next := 425377, root := ~, start := 425373, stop := 425376 ), rec( content := "\n\n \ The characters of the string ", count := [ 9, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tr", count := [ 9, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 4 ], mathmode := "Text", name := "A", next := 425422, root := ~, start := 425412, stop := 425421 ), rec( content := " represe\ nt the entries in the upper\n triangle of a digraph's adjacency matrix. The\ number of vertices ", count := [ 9, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ ", count := [ 9, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 4 ], mathmode := "Text", name := "C", next := 425535, root := ~, start := 425527, stop := 425534 ), rec( content := "\n wi\ ll be detected from the length of the string and will be as large as\n poss\ ible. ", count := [ 9, 2, 10, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "P", next := 425630, root := ~, start := 425626, stop := 425629 ), rec( content := "\n\n \ The first character represents the possible edge ", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ -> 2", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "C", next := 425698, root := ~, start := 425685, stop := 425697 ), rec( content := ", the se\ cond\n represents ", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ -> 3", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "C", next := 425739, root := ~, start := 425726, stop := 425738 ), rec( content := " and so \ on until ", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ -> n", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "C", next := 425769, root := ~, start := 425756, stop := 425768 ), rec( content := "; then t\ he following\n character represents ", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "2\ -> 3", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "C", next := 425828, root := ~, start := 425815, stop := 425827 ), rec( content := ", and so\ on up to the character which\n represents the edge ", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "n\ -1 -> n", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "C", next := 425905, root := ~, start := 425890, stop := 425904 ), rec( content := ". If a \ character of the string with\n corresponding edge ", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "i\ -> j", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "C", next := 425978, root := ~, start := 425965, stop := 425977 ), rec( content := " is equa\ l to ", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "C", next := 425999, root := ~, start := 425991, stop := 425998 ), rec( content := ", then t\ his edge is\n present in the digraph. Otherwise, it is not present. In thi\ s way, all the\n possible edges are encoded one-by-one. ", count := [ 9, 2, 10, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 10, 6 ], mathmode := "Text", name := "P", next := 426146, root := ~, start := 426142, stop := 426145 ), rec( content := "\n\n \ In particular, note that there exists no edge ", count := [ 9, 2, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ i, j]", count := [ 9, 2, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 6 ], mathmode := "Text", name := "C", next := 426211, root := ~, start := 426198, stop := 426210 ), rec( content := " if ", count := [ 9, 2, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "j\ \\leq\n i", count := [ 9, 2, 10, 6 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ 9, 2, 10, 6 ], mathmode := "Text", name := "M", next := 426236, root := ~, start := 426215, stop := 426235 ), rec( content := ". In or\ der words, the digraph will be topologically sorted.\n\n ", count := [ 9, 2, 10, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := AdjacencyMatrixUpperTriangleLineDecoder(\"100001\");\n\ngap> OutNeighbours(gr);\n[ [ 2 ], [ ], [ 4 \ ], [ ] ]\ngap> gr := AdjacencyMatrixUpperTriangleLineDecoder(\"111111x111\");\ \n\ngap> OutNeighbours(gr);\n[ [ 2\ , 3, 4, 5 ], [ 3, 4 ], [ 4, 5 ], [ 5 ], [ ] ]\n", count := [ 9, 2, 10, 7 ], name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 10, 7 ], mathmode := "Text", name := "Example", next := 426681, root := ~, start := 426302, stop := 426680 ), rec( content := "\n ", count := [ 9, 2, 10, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 10, 3 ], mathmode := "Text", name := "Description", next := 426698, root := ~, start := 425149, stop := 426697 ) ], count := [ 9, 2, 10, 1 ], mathmode := "Text", name := "ManSection", next := 426712, root := ~, start := 425035, stop := 426711 ), rec( content := "\n\n ", count := [ 9, 2, 10, 8 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "str", Name := "TCodeDecoder" ) , content := 0, count := [ 9, 2, 11, 2 ], mathmode := "Text", name := "Oper", next := 426770, root := ~, start := 426733, stop := 426769 ), rec( attributes := rec( ), content := [ rec( content := "A digraph\ .", count := [ 9, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 3 ], mathmode := "Text", name := "Returns", next := 426802, root := ~, start := 426773, stop := 426801 ), rec( attributes := rec( ), content := [ rec( content := "\n If \ ", count := [ 9, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "s\ tr", count := [ 9, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 3 ], mathmode := "Text", name := "A", next := 426836, root := ~, start := 426826, stop := 426835 ), rec( content := " is a st\ ring consisting of at least two non-negative integers\n separated by spaces\ , then this function will attempt to return the digraph\n which it defines \ as a TCode string. ", count := [ 9, 2, 11, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "P", next := 427021, root := ~, start := 427017, stop := 427020 ), rec( content := "\n\n \ The first integer of the string defines the number of vertices ", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "C", next := 427098, root := ~, start := 427090, stop := 427097 ), rec( content := " in\n \ the digraph, and the second defines the number of edges ", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "e\ ", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "C", next := 427170, root := ~, start := 427162, stop := 427169 ), rec( content := ". The\n\ following ", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "2\ e", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "C", next := 427200, root := ~, start := 427191, stop := 427199 ), rec( content := " integer\ s should be vertex numbers in the range ", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 0 ..\n v-1]", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "C", next := 427271, root := ~, start := 427248, stop := 427270 ), rec( content := ". These \ integers are read in pairs and define the digraph's\n edges. This function\ will return an error if ", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "s\ tr", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "A", next := 427391, root := ~, start := 427381, stop := 427390 ), rec( content := " has few\ er than\n ", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "2\ e+2", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "C", next := 427422, root := ~, start := 427411, stop := 427421 ), rec( content := " entries\ . ", count := [ 9, 2, 11, 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 11, 5 ], mathmode := "Text", name := "P", next := 427436, root := ~, start := 427432, stop := 427435 ), rec( content := "\n\n \ Note that the vertex numbers will be incremented by 1 in the digraph\n retu\ rned. Hence the string fragment ", count := [ 9, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "0\ 6", count := [ 9, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 5 ], mathmode := "Text", name := "C", next := 427562, root := ~, start := 427552, stop := 427561 ), rec( content := " will de\ scribe the edge\n ", count := [ 9, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "[\ 1,7]", count := [ 9, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 5 ], mathmode := "Text", name := "C", next := 427602, root := ~, start := 427590, stop := 427601 ), rec( content := ".\n " , count := [ 9, 2, 11, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := TCodeDecoder(\"3 2 0 2 2 1\");\n\ngap> OutNeighbours(gr);\n[ [ 3 ], [ ], [ 2 ] ]\ngap> gr := TCodeD\ ecoder(\"12 3 0 10 5 2 8 8\");\n\ \ngap> OutNeighbours(gr);\n[ [ 11 ], [ ], [ ], [ ], [ ], [ 3 ], [ ], [ ]\ , [ 9 ], [ ], \n [ ], [ ] ]\n", count := [ 9, 2, 11, 6 ], name := "PCDATA" , root := ~ ) ], count := [ 9, 2, 11, 6 ], mathmode := "Text", name := "Example", next := 427970, root := ~, start := 427608, stop := 427969 ), rec( content := "\n ", count := [ 9, 2, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 11, 3 ], mathmode := "Text", name := "Description", next := 427987, root := ~, start := 426805, stop := 427986 ) ], count := [ 9, 2, 11, 1 ], mathmode := "Text", name := "ManSection", next := 428001, root := ~, start := 426718, stop := 428000 ), rec( content := "\n\n ", count := [ 9, 2, 11, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "digraph", Name := "PlainTextString\ " ), content := 0, count := [ 9, 2, 12, 2 ], mathmode := "Text", name := "Oper", next := 428066, root := ~, start := 428022, stop := 428065 ), rec( attributes := rec( Arg := "s", Name := "DigraphFromPlai\ nTextString" ), content := 0, count := [ 9, 2, 12, 4 ], mathmode := "Text", name := "Oper", next := 428118, root := ~, start := 428069, stop := 428117 ), rec( attributes := rec( ), content := [ rec( content := "A string.\ ", count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "Returns", next := 428149, root := ~, start := 428121, stop := 428148 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "P\ lainTextString", count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "A", next := 428192, root := ~, start := 428170, stop := 428191 ), rec( content := " takes a\ single digraph, and returns a string\n describing the edges of that digrap\ h. ", count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphFromPlainTextString", count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "A", next := 428314, root := ~, start := 428281, stop := 428313 ), rec( content := "\n ta\ kes such a string and returns the digraph which it describes. Each edge\n \ is written as a pair of integers separated by a single space. The edges\n \ themselves are separated by a double space. Vertex numbers are reduced by\n \ 1 when they are encoded, so that vertices in the string are labelled\n st\ arting at 0.", count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 12, 6 ], mathmode := "Text", name := "P", next := 428645, root := ~, start := 428641, stop := 428644 ), rec( content := "\n\n \ Note that the number of vertices of a digraph is not stored, and so vertices\n\ which are not connected to any edge may be lost.", count := [ 9, 2, 12, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 12, 7 ], mathmode := "Text", name := "P", next := 428784, root := ~, start := 428780, stop := 428783 ), rec( content := "\n\n \ \n The operation ", count := [ 9, 2, 12, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphFromPlainTextString", count := [ 9, 2, 12, 7 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 12, 7 ], mathmode := "Text", name := "C", next := 428842, root := ~, start := 428809, stop := 428841 ), rec( content := "\n ta\ kes an optional first argument ", count := [ 9, 2, 12, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsMutab\ leDigraph" ), content := 0, count := [ 9, 2, 12, 7 ], mathmode := "Text", name := "Ref", next := 428910, root := ~, start := 428880, stop := 428909 ), rec( content := "\n or\ ", count := [ 9, 2, 12, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsImmut\ ableDigraph" ), content := 0, count := [ 9, 2, 12, 7 ], mathmode := "Text", name := "Ref", next := 428950, root := ~, start := 428918, stop := 428949 ), rec( content := ", which \ specifies whether the output digraph shall\n be mutable or immutable. If no\ first argument is provided, then an immutable\n digraph is returned by def\ ault.\n\n ", count := [ 9, 2, 12, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[2, 3], [1], [1]]);\n\ngap> PlainTextString(gr);\n\"0 1 0 2 1 0 2 0\"\ngap> DigraphFromP\ lainTextString(last);\n\n", count := [ 9, 2, 12, 8 ], name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 12, 8 ], mathmode := "Text", name := "Example", next := 429371, root := ~, start := 429123, stop := 429370 ), rec( content := "\n ", count := [ 9, 2, 12, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 12, 5 ], mathmode := "Text", name := "Description", next := 429388, root := ~, start := 428152, stop := 429387 ) ], count := [ 9, 2, 12, 1 ], mathmode := "Text", name := "ManSection", next := 429402, root := ~, start := 428007, stop := 429401 ), rec( content := "\n\n ", count := [ 9, 2, 12, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "filename, digrap\ h, delimiter, offset", Name := "WritePlainTextDigraph" ), content := 0, count := [ 9, 2, 13, 2 ], mathmode := "Text", name := "Func", next := 429502, root := ~, start := 429423, stop := 429501 ), rec( attributes := rec( Arg := "filename, delimi\ ter, offset, ignore", Name := "ReadPlainTextDigraph" ), content := 0, count := [ 9, 2, 13, 4 ], mathmode := "Text", name := "Oper", next := 429582, root := ~, start := 429505, stop := 429581 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ se functions write and read a single digraph in a human-readable plain\n te\ xt format as follows: each line contains a single edge, and each edge is\n \ written as a pair of integers separated by the string ", count := [ 9, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ elimiter", count := [ 9, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 5 ], mathmode := "Text", name := "A", next := 429830, root := ~, start := 429814, stop := 429829 ), rec( content := ".", count := [ 9, 2, 13, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "P", next := 429835, root := ~, start := 429831, stop := 429834 ), rec( content := "\n\n \ ", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "A", next := 429856, root := ~, start := 429841, stop := 429855 ), rec( content := " should \ be the name of a file which will be written to or\n read from, and ", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ffset", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "A", next := 429946, root := ~, start := 429933, stop := 429945 ), rec( content := " should \ be an integer which is added to each\n vertex number as it is written or re\ ad. For example, if\n ", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "W\ ritePlainTextDigraph", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "C", next := 430084, root := ~, start := 430056, stop := 430083 ), rec( content := " is call\ ed with ", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ffset", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "A", next := 430113, root := ~, start := 430100, stop := 430112 ), rec( content := " ", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "-\ 1", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "C", next := 430123, root := ~, start := 430114, stop := 430122 ), rec( content := ", then\n\ the vertices will be numbered in the file starting from 0 instead of 1 -\n\ ", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "R\ eadPlainTextDigraph", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "C", next := 430238, root := ~, start := 430211, stop := 430237 ), rec( content := " would t\ hen need to be called with ", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "o\ ffset", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "A", next := 430286, root := ~, start := 430273, stop := 430285 ), rec( content := "\n ", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "1\ ", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "C", next := 430299, root := ~, start := 430291, stop := 430298 ), rec( content := " to conv\ ert back to the original graph.", count := [ 9, 2, 13, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 13, 7 ], mathmode := "Text", name := "P", next := 430342, root := ~, start := 430338, stop := 430341 ), rec( content := "\n\n \ ", count := [ 9, 2, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) , rec( attributes := rec( ), content := [ rec( content := "i\ gnore", count := [ 9, 2, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 7 ], mathmode := "Text", name := "A", next := 430361, root := ~, start := 430348, stop := 430360 ), rec( content := " should \ be a list of characters which will be ignored when\n reading the graph.\n \ ", count := [ 9, 2, 13, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[1, 2, 3], [1, 1], [2]]);\n\ngap> filename := Concatenation(DIGRAPHS_Dir(), \"/tst/out\ /plain.txt\");;\ngap> WritePlainTextDigraph(filename, gr, \",\", -1);\ngap> Re\ adPlainTextDigraph(filename, \",\", 1, ['/', '%']);\n\n", count := [ 9, 2, 13, 8 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 8 ], mathmode := "Text", name := "Example", next := 430804, root := ~, start := 430447, stop := 430803 ), rec( content := "\n ", count := [ 9, 2, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 13, 5 ], mathmode := "Text", name := "Description", next := 430821, root := ~, start := 429585, stop := 430820 ) ], count := [ 9, 2, 13, 1 ], mathmode := "Text", name := "ManSection", next := 430835, root := ~, start := 429408, stop := 430834 ), rec( content := "\n\n ", count := [ 9, 2, 13, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes := rec( Arg := "filename, digrap\ h", Name := "WriteDIMACSDigraph" ), content := 0, count := [ 9, 2, 14, 2 ], mathmode := "Text", name := "Oper", next := 430913, root := ~, start := 430856, stop := 430912 ), rec( attributes := rec( Arg := "filename", Name := "ReadDIMACSDigra\ ph" ), content := 0, count := [ 9, 2, 14, 4 ], mathmode := "Text", name := "Oper", next := 430963, root := ~, start := 430916, stop := 430962 ), rec( attributes := rec( ), content := [ rec( content := "\n The\ se operations write or read the single symmetric digraph ", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "A", next := 431058, root := ~, start := 431044, stop := 431057 ), rec( content := "\n to\ or from a file in DIMACS format, as appropriate. The operation\n ", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "W\ riteDIMACSDigraph", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "C", next := 431158, root := ~, start := 431133, stop := 431157 ), rec( content := " records\ the vertices and edges of ", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "A", next := 431207, root := ~, start := 431193, stop := 431206 ), rec( content := ".\n T\ he vertex labels of ", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "d\ igraph", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "A", next := 431248, root := ~, start := 431234, stop := 431247 ), rec( content := " will be\ recorded only if they are\n integers. See ", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymme\ tricDigraph" ), content := 0, count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "Ref", next := 431333, root := ~, start := 431301, stop := 431332 ), rec( content := " and ", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "Ref", next := 431377, root := ~, start := 431338, stop := 431376 ), rec( content := ".", count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "P", next := 431382, root := ~, start := 431378, stop := 431381 ), rec( content := "\n\n \ The first argument ", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "A", next := 431422, root := ~, start := 431407, stop := 431421 ), rec( content := " should \ be the name of the file which will\n be written to or read from. A file ca\ n contain one symmetric digraph in\n DIMACS format. If ", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "f\ ilename", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "A", next := 431579, root := ~, start := 431564, stop := 431578 ), rec( content := " ends in\ one of ", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ gz", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "C", next := 431605, root := ~, start := 431595, stop := 431604 ), rec( content := ", ", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ bz2", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "C", next := 431618, root := ~, start := 431607, stop := 431617 ), rec( content := ",\n o\ r ", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := ".\ xz", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "C", next := 431637, root := ~, start := 431627, stop := 431636 ), rec( content := ", then t\ he file is compressed, or decompressed, appropriately.\n ", count := [ 9, 2, 14, 6 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 14, 7 ], mathmode := "Text", name := "P", next := 431708, root := ~, start := 431704, stop := 431707 ), rec( content := "\n\n \ The DIMACS format is described as follows. Each line in the DIMACS file has\n\ one of four types:\n ", count := [ 9, 2, 14, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "\n A line beginning with ", coun\ t := [ 9, 2, 14, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "c", count := [ 9, 2, 14, 9 ],\ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 9 ] , math\ mode := "Text", name := "C", next := 431876, root := ~, start := 431868, stop \ := 431875 ), rec( content := " and followed by any number of characters\n \ is a comment line, and is ignored.\n ", count := [ 9, 2, 14, 9 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 9 ], name := "Ite\ m", next := 431974, root := ~, start := 431831, stop := 431973 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n A line beginning with ", coun\ t := [ 9, 2, 14, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "p", count := [ 9, 2, 14, 11 ]\ , mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 11\ ], mathmode := "Text", name := "C", next := 432026, root := ~, start := 43201\ 8, stop := 432025 ), rec( content := " defines the numbers of vertices and edg\ es\n the digraph. This line has the format ", count := [ 9, 2, 14, 11 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "p edge \n ", count :\ = [ 9, 2, 14, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count\ := [ 9, 2, 14, 11 ], mathmode := "Text", name := "C", next := 432176, root :=\ ~, start := 432116, stop := 432175 ), rec( content := ", where ", count := [ \ 9, 2, 14, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attrib\ utes := rec( ), content := [ rec( content := "", count := [ 9, 2\ , 14, 11 ], mathmode := "Text", name := "PCDATA", next := 6, root := ~ ) ], coun\ t := [ 9, 2, 14, 11 ], mathmode := "Text", name := "C", next := 432210, root :\ = ~, start := 432184, stop := 432209 ), rec( content := " and\n ", coun\ t := [ 9, 2, 14, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "", count := [ 9, 2,\ 14, 11 ], mathmode := "Text", name := "PCDATA", next := 6, root := ~ ) ], coun\ t := [ 9, 2, 14, 11 ], mathmode := "Text", name := "C", next := 432246, root :\ = ~, start := 432223, stop := 432245 ), rec( content := " are replaced by the \ relevant integers. There\n must be exactly one such line in the file, a\ nd it must occur before any\n of the following kinds of line.", count :\ = [ 9, 2, 14, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := 0, count := [ 9, 2, 14, 12 ], mathmode := "Text" , name\ := "P", next := 432415, root := ~, start := 432411, stop := 432414 ), rec( cont\ ent := "\n\n Although it is required to be present, the value of\n \ ", count := [ 9, 2, 14, 12 ], mathmode := "Text", name := "PCDATA", root :=\ ~ ), rec( attributes := rec( ), content := [ rec( content := "", c\ ount := [ 9, 2, 14, 12 ], mathmode := "Text", name := "PCDATA", next := 6, roo\ t := ~ ) ], count := [ 9, 2, 14, 12 ], mathmode := "Text", name := "C", next :\ = 432508, root := ~, start := 432485, stop := 432507 ), rec( content := " will\ be ignored. The correct number of edges\n will be deduced from the res\ t of the information in the file.\n ", count := [ 9, 2, 14, 12 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 11 ], name := "Ite\ m", next := 432637, root := ~, start := 431981, stop := 432636 ), rec( attributes :\ = rec( ), content := [ rec( content := "\n A line of the form ", count\ := [ 9, 2, 14, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "e ", count := [ 9, 2, \ 14, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2\ , 14, 14 ], mathmode := "Text", name := "C", next := 432706, root := ~, start \ := 432678, stop := 432705 ), rec( content := ", where ", count := [ 9, 2, 14, \ 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := re\ c( ), content := [ rec( content := "", count := [ 9, 2, 14, 14 ], mathmode\ := "Text", name := "PCDATA", next := 6, root := ~ ) ], count := [ 9, 2, 14, 1\ 4 ], mathmode := "Text", name := "C", next := 432730, root := ~, start := 4327\ 14, stop := 432729 ), rec( content := "\n and ", count := [ 9, 2, 14, 1\ 4 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec\ ( ), content := [ rec( content := "", count := [ 9, 2, 14, 14 ], mathmode \ := "Text", name := "PCDATA", next := 6, root := ~ ) ], count := [ 9, 2, 14, 14\ ], mathmode := "Text", name := "C", next := 432759, root := ~, start := 43274\ 3, stop := 432758 ), rec( content := " are integers in the range ", count := [ \ 9, 2, 14, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attrib\ utes := rec( ), content := [ rec( content := "[1 ..\n ]\ ", count := [ 9, 2, 14, 14 ], mathmode := "Text", name := "PCDATA", root := ~ \ ) ], count := [ 9, 2, 14, 14 ], mathmode := "Text", name := "C", next := 43282\ 9, root := ~, start := 432786, stop := 432828 ), rec( content := ", specifies \ that there is a (symmetric) edge\n in the digraph between the vertices \ ", count := [ 9, 2, 14, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "", count := [ 9, 2, 14, 14\ ], mathmode := "Text", name := "PCDATA", next := 6, root := ~ ) ], count := [ \ 9, 2, 14, 14 ], mathmode := "Text", name := "C", next := 432934, root := ~, star\ t := 432918, stop := 432933 ), rec( content := " and\n ", count := [ 9,\ 2, 14, 14 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attribut\ es := rec( ), content := [ rec( content := "", count := [ 9, 2, 14, 14 ], \ mathmode := "Text", name := "PCDATA", next := 6, root := ~ ) ], count := [ 9, \ 2, 14, 14 ], mathmode := "Text", name := "C", next := 432963, root := ~, start\ := 432947, stop := 432962 ), rec( content := ". A symmetric edge only needs t\ o be defined once; an\n additional line ", count := [ 9, 2, 14, 14 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "e ", count := [ 9, 2, 14, 14 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 14 ], mathmode :=\ "Text", name := "C", next := 433068, root := ~, start := 433040, stop := 4330\ 67 ), rec( content := ", or ", count := [ 9, 2, 14, 14 ], mathmode := "Text", name\ := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( conte\ nt := "e \n ", count := [ 9, 2, 14, 14 ], mathmode := "Text", n\ ame := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 14 ], mathmode := "Text", name\ := "C", next := 433111, root := ~, start := 433073, stop := 433110 ), rec( cont\ ent := ", will be interpreted as an additional, multiple, edge.\n Loops\ are permitted.\n ", count := [ 9, 2, 14, 14 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 14 ], name := "Item", next := 4332\ 09, root := ~, start := 432644, stop := 433208 ), rec( attributes := rec( ), content := [ rec( cont\ ent := "\n A line of the form ", count := [ 9, 2, 14, 16 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :=\ [ rec( content := "n ", count := [ 9, 2, 14, 16 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 16 ], mathmode := "\ Text", name := "C", next := 433282, root := ~, start := 433250, stop := 433281\ ), rec( content := ", where\n ", count := [ 9, 2, 14, 16 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content :\ = [ rec( content := "", count := [ 9, 2, 14, 16 ], mathmode := "Text", name\ := "PCDATA", next := 6, root := ~ ) ], count := [ 9, 2, 14, 16 ], mathmode :=\ "Text", name := "C", next := 433314, root := ~, start := 433298, stop := 4333\ 13 ), rec( content := " is an integer in the range ", count := [ 9, 2, 14, 16 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "[1 ..\n ]", count := [ 9, 2, 1\ 4, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2,\ 14, 16 ], mathmode := "Text", name := "C", next := 433385, root := ~, start :\ = 433342, stop := 433384 ), rec( content := " and ", count := [ 9, 2, 14, 16 ] , math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( content := "", count := [ 9, 2, 14, 16 ], mathmode := "Te\ xt", name := "PCDATA", next := 6, root := ~ ) ], count := [ 9, 2, 14, 16 ], math\ mode := "Text", name := "C", next := 433410, root := ~, start := 433390, stop \ := 433409 ), rec( content := " is an integer,\n signifies that the vert\ ex ", count := [ 9, 2, 14, 16 ], mathmode := "Text", name := "PCDATA", root :=\ ~ ), rec( attributes := rec( ), content := [ rec( content := "", count :=\ [ 9, 2, 14, 16 ], mathmode := "Text", name := "PCDATA", next := 6, root := ~ \ ) ], count := [ 9, 2, 14, 16 ], mathmode := "Text", name := "C", next := 43347\ 6, root := ~, start := 433460, stop := 433475 ), rec( content := " has the lab\ el\n ", count := [ 9, 2, 14, 16 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ), rec( attributes := rec( ), content := [ rec( content := "", c\ ount := [ 9, 2, 14, 16 ], mathmode := "Text", name := "PCDATA", next := 6, roo\ t := ~ ) ], count := [ 9, 2, 14, 16 ], mathmode := "Text", name := "C", next :\ = 433519, root := ~, start := 433499, stop := 433518 ), rec( content := " in t\ he digraph. If a label is not specified for a\n vertex, then ", count :\ = [ 9, 2, 14, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attr\ ibutes := rec( ), content := [ rec( content := "ReadDIMACSDigraph", count := \ [ 9, 2, 14, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count :\ = [ 9, 2, 14, 16 ], mathmode := "Text", name := "C", next := 433615, root := ~ , star\ t := 433591, stop := 433614 ), rec( content := " will assign the label\n \ ", count := [ 9, 2, 14, 16 ], mathmode := "Text", name := "PCDATA", root := \ ~ ), rec( attributes := rec( ), content := [ rec( content := "1", count := [ \ 9, 2, 14, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ \ 9, 2, 14, 16 ], mathmode := "Text", name := "C", next := 433654, root := ~, star\ t := 433646, stop := 433653 ), rec( content := ", according to the DIMACS spec\ ification.\n ", count := [ 9, 2, 14, 16 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ 9, 2, 14, 16 ], name := "Item", next := 4337\ 08, root := ~, start := 433216, stop := 433707 ) ], count := [ 9, 2, 14, 8 ], mathmode := "Text", name := "List", next := 433720, root := ~, start := 431818, stop := 433719 ), rec( content := "\n\n \ A detailed definition of the DIMACS format can be found at\n ", count := [ 9, 2, 14, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "h\ ttp://mat.gsia.cmu.edu/COLOR/general/ccformat.ps", count := [ 9, 2, 14, 18 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 18 ], mathmode := "Text", name := "URL", next := 433849, root := ~, start := 433789, stop := 433848 ), rec( content := ", in Sec\ tion\n 2.1. Note that optional descriptor lines, as described in Section 2.\ 1, will\n be ignored.\n ", count := [ 9, 2, 14, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0, count := [ 9, 2, 14, 19 ], mathmode := "Text", name := "P", next := 433966, root := ~, start := 433962, stop := 433965 ), rec( content := "\n\n\n \ ", count := [ 9, 2, 14, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\\ ngap> gr := Digraph([[2], [1, 3, 4], [2, 4], [2, 3]]);\n\ngap> filename := Concatenation(DIGRAPHS_Dir(),\n> \ \"/tst/out/dimacs.dimacs\");;\ngap> WriteDIMACSDigrap\ h(filename, gr);;\ngap> ReadDIMACSDigraph(filename);\n", count := [ 9, 2, 14, 20 ], name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 20 ], mathmode := "Text", name := "Example", next := 434328, root := ~, start := 433973, stop := 434327 ), rec( content := "\n ", count := [ 9, 2, 14, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 14, 5 ], mathmode := "Text", name := "Description", next := 434345, root := ~, start := 430966, stop := 434344 ) ], count := [ 9, 2, 14, 1 ], mathmode := "Text", name := "ManSection", next := 434359, root := ~, start := 430841, stop := 434358 ), rec( content := "\n\n ", count := [ 9, 2, 14, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 2, 0, 1 ], mathmode := "Text", name := "Section", next := 434373, root := ~, start := 401527, stop := 434372 ) , rec( content := "\n", count := [ 9, 2, 14, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 9, 0, 0, 1 ], mathmode := "Text", name := "Chapter", next := 434384, root := ~, start := 390610, stop := 434383 ), rec( content := "\n ", count := [ 9, 2, 14, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( content := " visualising, io ", count := [ 9, 2, 14, 21 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( content := "\n", count := [ 9, 2, 14, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ 0, 0, 4, 1 ], mathmode := "Text", name := "Body", next := 434418, root := ~, start := 3999, stop := 434417 ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ "A", 0, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n Grape to Digraphs Command M\ ap\n ", count := [ "A", 0, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 0, 0, 2 ], mathmode := "Text", name := "Heading", next := 434489, root := ~, start := 434433, stop := 434488 ), rec( content := "\n Below is a table of ", count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.ac.\ uk/~leonard/grape/", count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 0, 0, 3 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Grape", count := [ "A", 0, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 0, 0, 3 ], name := "Package", next := 137, root := ~, start := 113, stop := 136 ) ], count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " commands with the ", count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Digraphs", count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " counterparts.\n The sections in this c\ hapter correspond to the chapters in the ", count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.ac.\ uk/~leonard/grape/", count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 0, 0, 3 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ), content := [ rec( attributes := rec( ), content := [ rec( content := "Grape", count := [ "A", 0, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 0, 0, 3 ], name := "Package", next := 137, root := ~, start := 113, stop := 136 ) ], count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := "\n manual.\n\n ", count := [ "A", 0, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ "A", 1, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n Functions to cons\ truct and modify graphs\n ", count := [ "A", 1, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 2 ], mathmode := "Text", name := "Heading", next := 434734, root := ~, start := 434663, stop := 434733 ), rec( content := "\n ", count := [ "A", 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "HTML" ), content := [ rec( content := "\n ", count := [ "A", 1, 0, 3 ], name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n The tab\ le in this section contains more information when viewed in\n html form\ at.\n ", count := [ "A", 1, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 3 ], name := "E", next := 434872, root := ~, start := 434762, stop := 434871 ), rec( content := "\n ", count := [ "A", 1, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 3 ], mathmode := "Text", name := "Alt", next := 434883, root := ~, start := 434739, stop := 434882 ), rec( content := "\n\n ", count := [ "A", 1, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Align := "|l|l|l|" ), content := [ rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 4 ], name := "HorLine", next := 434929, root := ~, start := 434919, stop := 434928 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ "A", 1, 0, 5 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 5 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 5 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ "A", 1, 0, 5 ], name\ := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 5 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ "A", 1, 0, 5 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " command\ \n ", count := [ "A", 1, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 5 ], name := "Item", next := 434998, root := ~, start := 434950, stop := 434997 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ "A", 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 7 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " command\ \n ", count := [ "A", 1, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 7 ], name := "Item", next := 435058, root := ~, start := 435007, stop := 435057 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Comments\n ", count := [ "A", 1, 0, 9 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 9 ], name := "Alt", next := 435139, root := ~, start := 435084, stop := 435138 ), rec( content := "\n \ ", count := [ "A", 1, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 9 ], name := "Item", next := 435155, root := ~, start := 435067, stop := 435154 ) ], count := [ "A", 1, 0, 4 ], name := "Row", next := 435168, root := ~, start := 434936, stop := 435167 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 10 ], name := "HorLine", next := 435185, root := ~, start := 435175, stop := 435184 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ raph", count := [ "A", 1, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 11 ], mathmode := "Text", name := "C", next := 435236, root := ~, start := 435224, stop := 435235 ), rec( content := "\n \ ", count := [ "A", 1, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 11 ], name := "Item", next := 435252, root := ~, start := 435207, stop := 435251 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ " ), content := 0, count := [ "A", 1, 0, 13 ], mathmode := "Text", name := "Ref", next := 435299, root := ~, start := 435278, stop := 435298 ), rec( content := "\n \ ", count := [ "A", 1, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 13 ], name := "Item", next := 435315, root := ~, start := 435261, stop := 435314 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Used with the arguments of ", count := [ "A", 1, 0, 15 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Graph", count := [ "A", 1, 0, 15 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 15 ], mathmode := "Text", name := "C", next := 4354\ 08, root := ~, start := 435396, stop := 435407 ), rec( HTML := true, content := "\ in ", count := [ "A", 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 1, 0, 15 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 15 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 1, 0, 15 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 1, 0, 15 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 1, 0, 15 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ , ", count := [ "A", 1, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Oper := "Digraph" ), content := 0, count := [ "A", 1, 0, 15 ], mathmode := \ "Text", name := "Ref", next := 435454, root := ~, start := 435421, stop := 4354\ 53 ), rec( HTML := true, content := " will return an equivalent digraph. ", count := [ "A", 1, 0, 15 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := 0 , count := [ "A", 1, 0, 16 ], mathmode := \ "Text", name := "P", next := 435494, root := ~, start := 435490, stop := 43549\ 3 ), rec( HTML := true, content := "\n ", count := [ "A", 1, 0, 16 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 15 ], name := "Alt", next := 435511, root := ~, start := 435341, stop := 435510 ), rec( content := "\n \ ", count := [ "A", 1, 0, 16 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 15 ], name := "Item", next := 435527, root := ~, start := 435324, stop := 435526 ) ], count := [ "A", 1, 0, 10 ], name := "Row", next := 435540, root := ~, start := 435193, stop := 435539 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 17 ], name := "HorLine", next := 435557, root := ~, start := 435547, stop := 435556 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "E\ dgeOrbitsGraph", count := [ "A", 1, 0, 18 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 1, 0, 18 ], mathmode := "Text", name := "C", next := 435618, root := ~, start := 435596, stop := 435617 ), rec( content := "\n \ ", count := [ "A", 1, 0, 18 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 18 ], name := "Item", next := 435634, root := ~, start := 435579, stop := 435633 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "EdgeOrb\ itsDigraph" ), content := 0, count := [ "A", 1, 0, 20 ], mathmode := "Text", name := "Ref", next := 435691, root := ~, start := 435660, stop := 435690 ), rec( content := "\n \ ", count := [ "A", 1, 0, 20 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 20 ], name := "Item", next := 435707, root := ~, start := 435643, stop := 435706 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The operation ", count := [ "A", 1, 0, 22 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "EdgeOrbitsDigraph" ), content := 0 , count := [ "A", 1, 0, 22 ], mathmode := \ "Text", name := "Ref", next := 435806, root := ~, start := 435775, stop := 4358\ 05 ), rec( HTML := true, content := " behaves the same as\n ", count := [ "A", 1, 0, 22 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "EdgeOrbitsDigraph", count := [ "A", 1, 0, 22 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 22 ], mathmode := \ "Text", name := "C", next := 435861, root := ~, start := 435837, stop := 43586\ 0 ), rec( HTML := true, content := " in ", count := [ "A", 1, 0, 22 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 1, 0, 22 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 22 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 22 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 1, 0, 22 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 1, 0, 22 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 1, 0, 22 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 1, 0, 22 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 1, 0, 22 ], name := "Alt", next := 435890, root := ~, start := 435733, stop := 435889 ), rec( content := "\n \ ", count := [ "A", 1, 0, 22 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 22 ], name := "Item", next := 435906, root := ~, start := 435716, stop := 435905 ) ], count := [ "A", 1, 0, 17 ], name := "Row", next := 435919, root := ~, start := 435565, stop := 435918 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 23 ], name := "HorLine", next := 435936, root := ~, start := 435926, stop := 435935 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "N\ ullGraph", count := [ "A", 1, 0, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 24 ], mathmode := "Text", name := "C", next := 435991, root := ~, start := 435975, stop := 435990 ), rec( content := "\n \ ", count := [ "A", 1, 0, 24 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 24 ], name := "Item", next := 436007, root := ~, start := 435958, stop := 436006 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "NullDig\ raph" ), content := 0, count := [ "A", 1, 0, 26 ], mathmode := "Text", name := "Ref", next := 436058, root := ~, start := 436033, stop := 436057 ), rec( content := "\n \ ", count := [ "A", 1, 0, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n or\n ", count := [ "A", 1, 0, 26 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "EmptyDigrap\ h" ), content := 0, count := [ "A", 1, 0, 26 ], mathmode := "Text", name := "Ref\ ", next := 436140, root := ~, start := 436114, stop := 436139 ), rec( HTML := true , content := "\ \n ", count := [ "A", 1, 0, 26 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 1, 0, 26 ], name := "Alt", next := 436157, root := ~, start := 436069, stop := 436156 ), rec( content := "\n \ ", count := [ "A", 1, 0, 26 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 26 ], name := "Item", next := 436173, root := ~, start := 436016, stop := 436172 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Note that, unlike in ", count := [ "A", 1, 0, 28 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 1, 0, 28 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 28 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 28 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 1, 0, 28 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 1, 0, 28 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ , the arguments of ", count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "NullDigraph" ), content := 0 , count := [ "A", 1, 0, 28 ], mathmode := \ "Text", name := "Ref", next := 436316, root := ~, start := 436277, stop := 4363\ 15 ), rec( HTML := true, content := " and ", count := [ "A", 1, 0, 28 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "EmptyD\ igraph" ), content := 0, count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "Ref\ ", next := 436347, root := ~, start := 436321, stop := 436346 ), rec( HTML := true , content := "\ are just\n non-negative integers. Since digraphs in ", count := [ "A", 1, 0, 28 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 1, 0, 28 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 28 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ are immutable,\n there is no reason (although it is possible) to c\ reate a null digraph\n and then add edges, as you might be used to \ doing in ", count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 28 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 1, 0, 28 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 1, 0, 28 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 1, 0, 28 ], name := "Alt", next := 436608, root := ~, start := 436199, stop := 436607 ), rec( content := "\n \ ", count := [ "A", 1, 0, 28 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 28 ], name := "Item", next := 436624, root := ~, start := 436182, stop := 436623 ) ], count := [ "A", 1, 0, 23 ], name := "Row", next := 436637, root := ~, start := 435944, stop := 436636 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 29 ], name := "HorLine", next := 436654, root := ~, start := 436644, stop := 436653 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 30 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ompleteGraph", count := [ "A", 1, 0, 30 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 1, 0, 30 ], mathmode := "Text", name := "C", next := 436713, root := ~, start := 436693, stop := 436712 ), rec( content := "\n \ ", count := [ "A", 1, 0, 30 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 30 ], name := "Item", next := 436729, root := ~, start := 436676, stop := 436728 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 32 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Complet\ eDigraph" ), content := 0, count := [ "A", 1, 0, 32 ], mathmode := "Text", name := "Ref", next := 436784, root := ~, start := 436755, stop := 436783 ), rec( content := "\n \ ", count := [ "A", 1, 0, 32 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 32 ], name := "Item", next := 436800, root := ~, start := 436738, stop := 436799 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 34 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Note that, unlike in ", count := [ "A", 1, 0, 34 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 1, 0, 34 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 34 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 34 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 1, 0, 34 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 1, 0, 34 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 1, 0, 34 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ , the argument to ", count := [ "A", 1, 0, 34 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "CompleteDigraph" ), content := 0 , count := [ "A", 1, 0, 34 ], mathmode := \ "Text", name := "Ref", next := 436945, root := ~, start := 436902, stop := 4369\ 44 ), rec( HTML := true, content := " is simply a non-negative integer\n \ indicating the number of vertices. By default a complete digraph in\n \ ", count := [ "A", 1, 0, 34 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 1, 0, 34 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 34 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ does not have any loops. If you want a complete digraph\n with loo\ ps at every vertex, then use ", count := [ "A", 1, 0, 34 ], mathmode := "Text" , name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "DigraphAddAllLoops" ), content := 0 , count := [ "A", 1, 0, 34 ], mathmode := \ "Text", name := "Ref", next := 437233, root := ~, start := 437187, stop := 4372\ 32 ), rec( HTML := true, content := ".\n ", count := [ "A", 1, 0, 34 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 34 ], name := "Alt", next := 437251, root := ~, start := 436826, stop := 437250 ), rec( content := "\n \ ", count := [ "A", 1, 0, 34 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 34 ], name := "Item", next := 437267, root := ~, start := 436809, stop := 437266 ) ], count := [ "A", 1, 0, 29 ], name := "Row", next := 437280, root := ~, start := 436662, stop := 437279 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 35 ], name := "HorLine", next := 437297, root := ~, start := 437287, stop := 437296 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 36 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "J\ ohnsonGraph", count := [ "A", 1, 0, 36 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ "A", 1, 0, 36 ], mathmode := "Text", name := "C", next := 437355, root := ~, start := 437336, stop := 437354 ), rec( content := "\n \ ", count := [ "A", 1, 0, 36 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 36 ], name := "Item", next := 437371, root := ~, start := 437319, stop := 437370 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Johnson\ Digraph" ), content := 0, count := [ "A", 1, 0, 38 ], mathmode := "Text", name := "Ref", next := 437425, root := ~, start := 437397, stop := 437424 ), rec( content := "\n \ ", count := [ "A", 1, 0, 38 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 38 ], name := "Item", next := 437441, root := ~, start := 437380, stop := 437440 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 40 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 1, 0, 40 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 1, 0, 40 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 40 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 40 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 1, 0, 40 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 1, 0, 40 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 1, 0, 40 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ function ", count := [ "A", 1, 0, 40 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "JohnsonGraph", count :=\ [ "A", 1, 0, 40 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 40 ], mathmode := \ "Text", name := "C", next := 437537, root := ~, start := 437518, stop := 43753\ 6 ), rec( HTML := true, content := " is equivalent to\n ", count := [ "A", 1, 0, 40 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Johnso\ nDigraph" ), content := 0, count := [ "A", 1, 0, 40 ], mathmode := "Text", name := "Ref\ ", next := 437595, root := ~, start := 437567, stop := 437594 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 1, 0, 40 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 1, 0, 40 ], name := "Alt", next := 437613, root := ~, start := 437467, stop := 437612 ), rec( content := "\n \ ", count := [ "A", 1, 0, 40 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 40 ], name := "Item", next := 437629, root := ~, start := 437450, stop := 437628 ) ], count := [ "A", 1, 0, 35 ], name := "Row", next := 437642, root := ~, start := 437305, stop := 437641 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 41 ], name := "HorLine", next := 437659, root := ~, start := 437649, stop := 437658 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 42 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ayleyGraph", count := [ "A", 1, 0, 42 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 42 ], mathmode := "Text", name := "C", next := 437716, root := ~, start := 437698, stop := 437715 ), rec( content := "\n \ ", count := [ "A", 1, 0, 42 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 42 ], name := "Item", next := 437732, root := ~, start := 437681, stop := 437731 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 44 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "CayleyD\ igraph" ), content := 0, count := [ "A", 1, 0, 44 ], mathmode := "Text", name := "Ref", next := 437785, root := ~, start := 437758, stop := 437784 ), rec( content := "\n \ ", count := [ "A", 1, 0, 44 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 44 ], name := "Item", next := 437801, root := ~, start := 437741, stop := 437800 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 46 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The operation ", count := [ "A", 1, 0, 46 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "CayleyDigraph" ), content := 0 , count := [ "A", 1, 0, 46 ], mathmode := \ "Text", name := "Ref", next := 437898, root := ~, start := 437871, stop := 4378\ 97 ), rec( HTML := true, content := " behaves the same as\n ", count := [ "A", 1, 0, 46 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "CayleyGraph", count := [ "A", 1, 0, 46 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 46 ], mathmode := \ "Text", name := "C", next := 437949, root := ~, start := 437931, stop := 43794\ 8 ), rec( HTML := true, content := " in ", count := [ "A", 1, 0, 46 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 1, 0, 46 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 46 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 46 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 1, 0, 46 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 1, 0, 46 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 1, 0, 46 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 1, 0, 46 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 1, 0, 46 ], name := "Alt", next := 437978, root := ~, start := 437827, stop := 437977 ), rec( content := "\n \ ", count := [ "A", 1, 0, 46 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 46 ], name := "Item", next := 437994, root := ~, start := 437810, stop := 437993 ) ], count := [ "A", 1, 0, 41 ], name := "Row", next := 438007, root := ~, start := 437667, stop := 438006 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 47 ], name := "HorLine", next := 438024, root := ~, start := 438014, stop := 438023 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 48 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ ddEdgeOrbit", count := [ "A", 1, 0, 48 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ "A", 1, 0, 48 ], mathmode := "Text", name := "C", next := 438082, root := ~, start := 438063, stop := 438081 ), rec( content := "\n \ ", count := [ "A", 1, 0, 48 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 48 ], name := "Item", next := 438098, root := ~, start := 438046, stop := 438097 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 50 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ AddEdgeOrbit" ), content := 0, count := [ "A", 1, 0, 50 ], mathmode := "Text", name := "Ref", next := 438157, root := ~, start := 438124, stop := 438156 ), rec( content := "\n \ ", count := [ "A", 1, 0, 50 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 50 ], name := "Item", next := 438173, root := ~, start := 438107, stop := 438172 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 52 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Note that, unlike in ", count := [ "A", 1, 0, 52 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 1, 0, 52 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 52 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 52 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 1, 0, 52 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 1, 0, 52 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 1, 0, 52 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ , digraphs in ", count := [ "A", 1, 0, 52 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "Digraphs", count := [ "A", 1, 0, 52 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ "A", 1, 0, 52 ], mathmode := "Text", name := "Pac\ kage", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true, content := "\ are immutable,\n and this operation returns a new digraph, i.e. it\ does not modify the\n digraph given as an argument.\n ", count := [ "A", 1, 0, 52 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 52 ], name := "Alt", next := 438437, root := ~, start := 438199, stop := 438436 ), rec( content := "\n \ ", count := [ "A", 1, 0, 52 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 52 ], name := "Item", next := 438453, root := ~, start := 438182, stop := 438452 ) ], count := [ "A", 1, 0, 47 ], name := "Row", next := 438466, root := ~, start := 438032, stop := 438465 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 53 ], name := "HorLine", next := 438483, root := ~, start := 438473, stop := 438482 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 54 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "R\ emoveEdgeOrbit", count := [ "A", 1, 0, 54 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 1, 0, 54 ], mathmode := "Text", name := "C", next := 438544, root := ~, start := 438522, stop := 438543 ), rec( content := "\n \ ", count := [ "A", 1, 0, 54 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 54 ], name := "Item", next := 438560, root := ~, start := 438505, stop := 438559 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 56 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ RemoveEdgeOrbit" ), content := 0, count := [ "A", 1, 0, 56 ], mathmode := "Text", name := "Ref", next := 438622, root := ~, start := 438586, stop := 438621 ), rec( content := "\n \ ", count := [ "A", 1, 0, 56 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 56 ], name := "Item", next := 438638, root := ~, start := 438569, stop := 438637 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 58 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Note that, unlike in ", count := [ "A", 1, 0, 58 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 1, 0, 58 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 58 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 1, 0, 58 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 1, 0, 58 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 1, 0, 58 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 1, 0, 58 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ , digraphs in ", count := [ "A", 1, 0, 58 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "Digraphs", count := [ "A", 1, 0, 58 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ "A", 1, 0, 58 ], mathmode := "Text", name := "Pac\ kage", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true, content := "\ are immutable,\n and this operation returns a new digraph, i.e. it\ does not modify the\n digraph given as an argument.\n ", count := [ "A", 1, 0, 58 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 58 ], name := "Alt", next := 438902, root := ~, start := 438664, stop := 438901 ), rec( content := "\n \ ", count := [ "A", 1, 0, 58 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 58 ], name := "Item", next := 438918, root := ~, start := 438647, stop := 438917 ) ], count := [ "A", 1, 0, 53 ], name := "Row", next := 438931, root := ~, start := 438491, stop := 438930 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 59 ], name := "HorLine", next := 438948, root := ~, start := 438938, stop := 438947 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 60 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ ssignVertexNames", count := [ "A", 1, 0, 60 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 1, 0, 60 ], mathmode := "Text", name := "C", next := 439011, root := ~, start := 438987, stop := 439010 ), rec( content := "\n \ ", count := [ "A", 1, 0, 60 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 60 ], name := "Item", next := 439027, root := ~, start := 438970, stop := 439026 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 62 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "SetDigr\ aphVertexLabels" ), content := 0, count := [ "A", 1, 0, 62 ], mathmode := "Text", name := "Ref", next := 439089, root := ~, start := 439053, stop := 439088 ), rec( content := "\n \ ", count := [ "A", 1, 0, 62 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n and\n ", count := [ "A", 1, 0, 62 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "SetDigraph\ VertexLabel" ), content := 0, count := [ "A", 1, 0, 62 ], mathmode := "Text", name := "Ref\ ", next := 439181, root := ~, start := 439146, stop := 439180 ), rec( HTML := true , content := "\ \n ", count := [ "A", 1, 0, 62 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 1, 0, 62 ], name := "Alt", next := 439198, root := ~, start := 439100, stop := 439197 ), rec( content := "\n \ ", count := [ "A", 1, 0, 62 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 62 ], name := "Item", next := 439214, root := ~, start := 439036, stop := 439213 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 1, 0, 64 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Use ", count := [ "A", 1, 0, 64 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "SetDigraphVertexLabel" ), content := 0 , count := [ "A", 1, 0, 64 ], mathmode := \ "Text", name := "Ref", next := 439310, root := ~, start := 439275, stop := 4393\ 09 ), rec( HTML := true, content := " to set an individual\n vertex\ label and ", count := [ "A", 1, 0, 64 ], mathmode := "Text", name := "PCDATA" , root := ~ ), rec( attributes :\ = rec( Oper := "SetDigraphVertexLabels" ), content := 0, count := [ "A", 1, 0, 64 ], mathmode := \ "Text", name := "Ref", next := 439397, root := ~, start := 439361, stop := 4393\ 96 ), rec( HTML := true, content := " to set all of\n the vertex la\ bels.\n ", count := [ "A", 1, 0, 64 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 1, 0, 64 ], name := "Alt", next := 439459, root := ~, start := 439240, stop := 439458 ), rec( content := "\n \ ", count := [ "A", 1, 0, 64 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 64 ], name := "Item", next := 439475, root := ~, start := 439223, stop := 439474 ) ], count := [ "A", 1, 0, 59 ], name := "Row", next := 439488, root := ~, start := 438956, stop := 439487 ), rec( attributes := rec( ), content := 0, count := [ "A", 1, 0, 65 ], name := "HorLine", next := 439505, root := ~, start := 439495, stop := 439504 ) ], count := [ "A", 1, 0, 4 ], mathmode := "Text", name := "Table", next := 439518, root := ~, start := 434889, stop := 439517 ), rec( content := "\n ", count := [ "A", 1, 0, 66 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 1, 0, 1 ], mathmode := "Text", name := "Section", next := 439531, root := ~, start := 434649, stop := 439530 ), rec( content := "\n\n ", count := [ "A", 1, 0, 66 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ "A", 2, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n Functions to insp\ ect graphs, vertices and edges\n ", count := [ "A", 2, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 2 ], mathmode := "Text", name := "Heading", next := 439627, root := ~, start := 439549, stop := 439626 ), rec( content := "\n ", count := [ "A", 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "HTML" ), content := [ rec( content := "\n ", count := [ "A", 2, 0, 3 ], name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n The tab\ le in this section contains more information when viewed in\n html form\ at.\n ", count := [ "A", 2, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 3 ], name := "E", next := 439765, root := ~, start := 439655, stop := 439764 ), rec( content := "\n ", count := [ "A", 2, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 3 ], mathmode := "Text", name := "Alt", next := 439776, root := ~, start := 439632, stop := 439775 ), rec( content := "\n\n ", count := [ "A", 2, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Align := "|l|l|l|" ), content := [ rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 4 ], name := "HorLine", next := 439822, root := ~, start := 439812, stop := 439821 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ "A", 2, 0, 5 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 5 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 5 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ "A", 2, 0, 5 ], name\ := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 5 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ "A", 2, 0, 5 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " command\ \n ", count := [ "A", 2, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 5 ], name := "Item", next := 439892, root := ~, start := 439844, stop := 439891 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ "A", 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 7 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " command\ \n ", count := [ "A", 2, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 7 ], name := "Item", next := 439952, root := ~, start := 439901, stop := 439951 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Comments\n ", count := [ "A", 2, 0, 9 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 9 ], name := "Alt", next := 440033, root := ~, start := 439978, stop := 440032 ), rec( content := "\n \ ", count := [ "A", 2, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 9 ], name := "Item", next := 440049, root := ~, start := 439961, stop := 440048 ) ], count := [ "A", 2, 0, 4 ], name := "Row", next := 440062, root := ~, start := 439830, stop := 440061 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 10 ], name := "HorLine", next := 440079, root := ~, start := 440069, stop := 440078 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sGraph", count := [ "A", 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 11 ], mathmode := "Text", name := "C", next := 440132, root := ~, start := 440118, stop := 440131 ), rec( content := "\n \ ", count := [ "A", 2, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 11 ], name := "Item", next := 440148, root := ~, start := 440101, stop := 440147 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Filt := "IsDigra\ ph" ), content := 0, count := [ "A", 2, 0, 13 ], mathmode := "Text", name := "Ref", next := 440197, root := ~, start := 440174, stop := 440196 ), rec( content := "\n \ ", count := [ "A", 2, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 13 ], name := "Item", next := 440213, root := ~, start := 440157, stop := 440212 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 2, 0, 15 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( Filt := "IsDigraph" ), content := 0, count := [ "A", 2, 0, 15 ], mathmode := \ "Text", name := "Ref", next := 440292, root := ~, start := 440269, stop := 4402\ 91 ), rec( HTML := true, content := " is a category and not a function like\n \ ", count := [ "A", 2, 0, 15 ], mathmode := "Text", name := "PCDATA" , root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "IsGraph", count := [ "A\ ", 2, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 15 ], mathmode := \ "Text", name := "C", next := 440357, root := ~, start := 440343, stop := 44035\ 6 ), rec( HTML := true, content := ".\n ", count := [ "A", 2, 0, 15 ] , mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 15 ], name := "Alt", next := 440375, root := ~, start := 440239, stop := 440374 ), rec( content := "\n \ ", count := [ "A", 2, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 15 ], name := "Item", next := 440391, root := ~, start := 440222, stop := 440390 ) ], count := [ "A", 2, 0, 10 ], name := "Row", next := 440404, root := ~, start := 440087, stop := 440403 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 16 ], name := "HorLine", next := 440421, root := ~, start := 440411, stop := 440420 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ rderGraph", count := [ "A", 2, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 17 ], mathmode := "Text", name := "C", next := 440477, root := ~, start := 440460, stop := 440476 ), rec( content := "\n \ ", count := [ "A", 2, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 17 ], name := "Item", next := 440493, root := ~, start := 440443, stop := 440492 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ NrVertices" ), content := 0, count := [ "A", 2, 0, 19 ], mathmode := "Text", name := "Ref", next := 440550, root := ~, start := 440519, stop := 440549 ), rec( content := "\n \ ", count := [ "A", 2, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 19 ], name := "Item", next := 440566, root := ~, start := 440502, stop := 440565 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The operation ", count := [ "A", 2, 0, 21 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "DigraphNrVertices" ), content := 0 , count := [ "A", 2, 0, 21 ], mathmode := \ "Text", name := "Ref", next := 440667, root := ~, start := 440636, stop := 4406\ 66 ), rec( HTML := true, content := " behaves the same as\n ", count := [ "A", 2, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "OrderGraph", count := [ "A", 2, 0, 21 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 21 ], mathmode := \ "Text", name := "C", next := 440717, root := ~, start := 440700, stop := 44071\ 6 ), rec( HTML := true, content := " in ", count := [ "A", 2, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 21 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 21 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 21 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 21 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 21 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 21 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 2, 0, 21 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 21 ], name := "Alt", next := 440746, root := ~, start := 440592, stop := 440745 ), rec( content := "\n \ ", count := [ "A", 2, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 21 ], name := "Item", next := 440762, root := ~, start := 440575, stop := 440761 ) ], count := [ "A", 2, 0, 16 ], name := "Row", next := 440775, root := ~, start := 440429, stop := 440774 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 22 ], name := "HorLine", next := 440792, root := ~, start := 440782, stop := 440791 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sVertex(", count := [ "A", 2, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( content := "graph", count := [ "A", 2, 0, 23 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 23 ], mathmode := \ "Text", name := "A", next := 440855, root := ~, start := 440843, stop := 44085\ 4 ), rec( content := ", ", count := [ "A", 2, 0, 23 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "v\ ", count := [ "A", 2, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~\ ) ], count := [ "A", 2, 0, 23 ], mathmode := "Text", name := "A", next := 4408\ 65, root := ~, start := 440857, stop := 440864 ), rec( content := ")", count := [ "A", 2, 0, 23 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 23 ], mathmode := "Text", name := "C", next := 440870, root := ~, start := 440831, stop := 440869 ), rec( content := "\n \ ", count := [ "A", 2, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 23 ], name := "Item", next := 440886, root := ~, start := 440814, stop := 440885 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( attributes :=\ rec( ), content := [ rec( content := "v", count := [ "A", 2, 0, 25 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 25 ], mathmode := \ "Text", name := "A", next := 440923, root := ~, start := 440915, stop := 44092\ 2 ), rec( content := " in DigraphVertices(", count := [ "A", 2, 0, 25 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( cont\ ent := "digraph", count := [ "A", 2, 0, 25 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 2, 0, 25 ], mathmode := "Text", name := "A", next := 4409\ 57, root := ~, start := 440943, stop := 440956 ), rec( content := ")", count := [ "A", 2, 0, 25 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 25 ], mathmode := "Text", name := "C", next := 440962, root := ~, start := 440912, stop := 440961 ), rec( content := "\n \ ", count := [ "A", 2, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 25 ], name := "Item", next := 440978, root := ~, start := 440895, stop := 440977 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The attribute ", count := [ "A", 2, 0, 27 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "DigraphVertices" ), content := 0 , count := [ "A", 2, 0, 27 ], mathmode := \ "Text", name := "Ref", next := 441077, root := ~, start := 441048, stop := 4410\ 76 ), rec( HTML := true, content := " can be used to return\n the l\ ist of vertices of a digraph, or if ", count := [ "A", 2, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "v", count := [ "A", 2, 0, 27 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 27 ], mathmode := "Text", name := "A", next := 4411\ 61, root := ~, start := 441153, stop := 441160 ), rec( HTML := true, content := "\ is known to be\n a positive integer, then you can simply do\n \ ", count := [ "A", 2, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( attributes := rec( ), content := [ rec( HTML := \ true, content := "v", count := [ "A", 2, 0, 27 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 27 ], mathmode := "Text", name \ := "A", next := 441255, root := ~, start := 441247, stop := 441254 ), rec( HTML\ := true, content := " <= DigraphNrVertices(", count := [ "A", 2, 0, 27 ], math\ mode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), cont\ ent := [ rec( HTML := true, content := "digraph", count := [ "A", 2, 0, 27 ], \ mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 27 ] , math\ mode := "Text", name := "A", next := 441294, root := ~, start := 441280, stop \ := 441293 ), rec( HTML := true, content := ")", count := [ "A", 2, 0, 27 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 27 ], mathmode := \ "Text", name := "C", next := 441299, root := ~, start := 441244, stop := 44129\ 8 ), rec( HTML := true, content := "\n ", count := [ "A", 2, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 27 ], name := "Alt", next := 441316, root := ~, start := 441004, stop := 441315 ), rec( content := "\n \ ", count := [ "A", 2, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 27 ], name := "Item", next := 441332, root := ~, start := 440987, stop := 441331 ) ], count := [ "A", 2, 0, 22 ], name := "Row", next := 441345, root := ~, start := 440800, stop := 441344 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 28 ], name := "HorLine", next := 441362, root := ~, start := 441352, stop := 441361 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "V\ ertexName", count := [ "A", 2, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 29 ], mathmode := "Text", name := "C", next := 441418, root := ~, start := 441401, stop := 441417 ), rec( content := "\n \ ", count := [ "A", 2, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 29 ], name := "Item", next := 441434, root := ~, start := 441384, stop := 441433 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabel" ), content := 0, count := [ "A", 2, 0, 31 ], mathmode := "Text", name := "Ref", next := 441492, root := ~, start := 441460, stop := 441491 ), rec( content := "\n \ ", count := [ "A", 2, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 31 ], name := "Item", next := 441508, root := ~, start := 441443, stop := 441507 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Unlike ", count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "VertexName", count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "\ PCDATA", root := ~ ) ], count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "C", next := 4415\ 88, root := ~, start := 441571, stop := 441587 ), rec( HTML := true, content := "\ in ", count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 33 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 33 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 33 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ , the return value of\n ", count := [ "A", 2, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digrap\ hVertexLabel" ), content := 0, count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "Ref\ ", next := 441665, root := ~, start := 441633, stop := 441664 ), rec( HTML := true , content := "\ is mutable.\n ", count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 2, 0, 33 ], name := "Alt", next := 441694, root := ~, start := 441534, stop := 441693 ), rec( content := "\n \ ", count := [ "A", 2, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 33 ], name := "Item", next := 441710, root := ~, start := 441517, stop := 441709 ) ], count := [ "A", 2, 0, 28 ], name := "Row", next := 441723, root := ~, start := 441370, stop := 441722 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 34 ], name := "HorLine", next := 441740, root := ~, start := 441730, stop := 441739 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "V\ ertexNames", count := [ "A", 2, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 35 ], mathmode := "Text", name := "C", next := 441797, root := ~, start := 441779, stop := 441796 ), rec( content := "\n \ ", count := [ "A", 2, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 35 ], name := "Item", next := 441813, root := ~, start := 441762, stop := 441812 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 37 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ VertexLabels" ), content := 0, count := [ "A", 2, 0, 37 ], mathmode := "Text", name := "Ref", next := 441872, root := ~, start := 441839, stop := 441871 ), rec( content := "\n \ ", count := [ "A", 2, 0, 37 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 37 ], name := "Item", next := 441888, root := ~, start := 441822, stop := 441887 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Unlike ", count := [ "A", 2, 0, 39 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "VertexNames", count := [ "A", 2, 0, 39 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 39 ], mathmode := "Text", name := "C", next := 4419\ 69, root := ~, start := 441951, stop := 441968 ), rec( HTML := true, content := "\ in ", count := [ "A", 2, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 2, 0, 39 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 2, 0, 39 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 39 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 39 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 39 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 39 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ , the return value of\n ", count := [ "A", 2, 0, 39 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digrap\ hVertexLabels" ), content := 0, count := [ "A", 2, 0, 39 ], mathmode := "Text" , name := "Ref\ ", next := 442047, root := ~, start := 442014, stop := 442046 ), rec( HTML := true , content := "\ is mutable.\n ", count := [ "A", 2, 0, 39 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 2, 0, 39 ], name := "Alt", next := 442076, root := ~, start := 441914, stop := 442075 ), rec( content := "\n \ ", count := [ "A", 2, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 39 ], name := "Item", next := 442092, root := ~, start := 441897, stop := 442091 ) ], count := [ "A", 2, 0, 34 ], name := "Row", next := 442105, root := ~, start := 441748, stop := 442104 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 40 ], name := "HorLine", next := 442122, root := ~, start := 442112, stop := 442121 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "V\ ertices", count := [ "A", 2, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 41 ], mathmode := "Text", name := "C", next := 442176, root := ~, start := 442161, stop := 442175 ), rec( content := "\n \ ", count := [ "A", 2, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 41 ], name := "Item", next := 442192, root := ~, start := 442144, stop := 442191 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 43 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Vertices" ), content := 0, count := [ "A", 2, 0, 43 ], mathmode := "Text", name := "Ref", next := 442247, root := ~, start := 442218, stop := 442246 ), rec( content := "\n \ ", count := [ "A", 2, 0, 43 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 43 ], name := "Item", next := 442263, root := ~, start := 442201, stop := 442262 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The vertices of a digraph in ", count := [ "A", 2, 0, 45 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 2, 0, 45 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 45 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ is always the range ", count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "[1\n .. n]", count := [ "A", 2, 0, 45 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 45 ], mathmode := "\ Text", name := "C", next := 442408, root := ~, start := 442379, stop := 442407\ ), rec( HTML := true, content := " where ", count := [ "A", 2, 0, 45 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "n", count := [ "A", 2, 0, 45 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "C", next := 4424\ 23, root := ~, start := 442415, stop := 442422 ), rec( HTML := true, content := "\ is the number of vertices of the\n digraph. The operation ", count := [ "A", 2, 0, 45 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digrap\ hVertices" ), content := 0, count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "Ref\ ", next := 442522, root := ~, start := 442493, stop := 442521 ), rec( HTML := true , content := "\ behaves the\n same as ", count := [ "A", 2, 0, 45 ], mathmode := "\ Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Vertices", count := [ "A", 2, 0, 45 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 45 ], mathmode := "T\ ext", name := "C", next := 442570, root := ~, start := 442555, stop := 442569 ), rec( HTML := true , content := "\ in ", count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 45 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 45 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 45 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 45 ], name := "Alt", next := 442599, root := ~, start := 442289, stop := 442598 ), rec( content := "\n \ ", count := [ "A", 2, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 45 ], name := "Item", next := 442615, root := ~, start := 442272, stop := 442614 ) ], count := [ "A", 2, 0, 40 ], name := "Row", next := 442628, root := ~, start := 442130, stop := 442627 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 46 ], name := "HorLine", next := 442645, root := ~, start := 442635, stop := 442644 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 47 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "V\ ertexDegree", count := [ "A", 2, 0, 47 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ "A", 2, 0, 47 ], mathmode := "Text", name := "C", next := 442703, root := ~, start := 442684, stop := 442702 ), rec( content := "\n \ ", count := [ "A", 2, 0, 47 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 47 ], name := "Item", next := 442719, root := ~, start := 442667, stop := 442718 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 49 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "OutDegr\ eeOfVertex" ), content := 0, count := [ "A", 2, 0, 49 ], mathmode := "Text", name := "Ref", next := 442776, root := ~, start := 442745, stop := 442775 ), rec( content := "\n \ ", count := [ "A", 2, 0, 49 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n (see also: ", count := [ "A", 2, 0, 49 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "InDegreeOfVertex" ), content := 0 , count := [ "A", 2, 0, 49 ], mathmode := \ "Text", name := "Ref", next := 442858, root := ~, start := 442828, stop := 4428\ 57 ), rec( HTML := true, content := ")\n ", count := [ "A", 2, 0, 49 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 49 ], name := "Alt", next := 442876, root := ~, start := 442787, stop := 442875 ), rec( content := "\n \ ", count := [ "A", 2, 0, 49 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 49 ], name := "Item", next := 442892, root := ~, start := 442728, stop := 442891 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The operation ", count := [ "A", 2, 0, 51 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "OutDegreeOfVertex" ), content := 0 , count := [ "A", 2, 0, 51 ], mathmode := \ "Text", name := "Ref", next := 442993, root := ~, start := 442962, stop := 4429\ 92 ), rec( HTML := true, content := " behaves the same as\n ", count := [ "A", 2, 0, 51 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "VertexDegree", count := [ "A", 2, 0, 51 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 51 ], mathmode := \ "Text", name := "C", next := 443045, root := ~, start := 443026, stop := 44304\ 4 ), rec( HTML := true, content := " in ", count := [ "A", 2, 0, 51 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 51 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 51 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 51 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 51 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 51 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 51 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 2, 0, 51 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 51 ], name := "Alt", next := 443074, root := ~, start := 442918, stop := 443073 ), rec( content := "\n \ ", count := [ "A", 2, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 51 ], name := "Item", next := 443090, root := ~, start := 442901, stop := 443089 ) ], count := [ "A", 2, 0, 46 ], name := "Row", next := 443103, root := ~, start := 442653, stop := 443102 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 52 ], name := "HorLine", next := 443120, root := ~, start := 443110, stop := 443119 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 53 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "V\ ertexDegrees", count := [ "A", 2, 0, 53 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 2, 0, 53 ], mathmode := "Text", name := "C", next := 443179, root := ~, start := 443159, stop := 443178 ), rec( content := "\n \ ", count := [ "A", 2, 0, 53 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 53 ], name := "Item", next := 443195, root := ~, start := 443142, stop := 443194 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "OutDegr\ eeSet" ), content := 0, count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "Ref", next := 443247, root := ~, start := 443221, stop := 443246 ), rec( content := "\n \ ", count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n (see also:\n ", count := [ "A", 2, 0, 55 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "OutDeg\ reeSequence" ), content := 0, count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "Ref\ ", next := 443342, root := ~, start := 443311, stop := 443341 ), rec( HTML := true , content := "\ ,\n ", count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "OutDegrees" ), content := 0 , count := [ "A", 2, 0, 55 ], mathmode := \ "Text", name := "Ref", next := 443380, root := ~, start := 443356, stop := 4433\ 79 ), rec( HTML := true, content := ",\n ", count := [ "A", 2, 0, 55 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "InDegr\ ees" ), content := 0, count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "Ref\ ", next := 443417, root := ~, start := 443394, stop := 443416 ), rec( HTML := true , content := "\ ,\n ", count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "InDegreeSequence" ), content := 0 , count := [ "A", 2, 0, 55 ], mathmode := \ "Text", name := "Ref", next := 443461, root := ~, start := 443431, stop := 4434\ 60 ), rec( HTML := true, content := ",\n ", count := [ "A", 2, 0, 55 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "InDegr\ eeSet" ), content := 0, count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "Ref\ ", next := 443500, root := ~, start := 443475, stop := 443499 ), rec( HTML := true , content := "\ )\n ", count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 55 ], name := "Alt", next := 443518, root := ~, start := 443258, stop := 443517 ), rec( content := "\n \ ", count := [ "A", 2, 0, 55 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 55 ], name := "Item", next := 443534, root := ~, start := 443204, stop := 443533 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 57 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The operation ", count := [ "A", 2, 0, 57 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "OutDegreeSet" ), content := 0 , count := [ "A", 2, 0, 57 ], mathmode := \ "Text", name := "Ref", next := 443630, root := ~, start := 443604, stop := 4436\ 29 ), rec( HTML := true, content := " behaves the same as\n ", count := [ "A", 2, 0, 57 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "VertexDegrees", count := [ "A", 2, 0, 57 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 57 ], mathmode := \ "Text", name := "C", next := 443683, root := ~, start := 443663, stop := 44368\ 2 ), rec( HTML := true, content := " in ", count := [ "A", 2, 0, 57 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 57 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 57 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 57 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 57 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 57 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 57 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 2, 0, 57 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 57 ], name := "Alt", next := 443712, root := ~, start := 443560, stop := 443711 ), rec( content := "\n \ ", count := [ "A", 2, 0, 57 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 57 ], name := "Item", next := 443728, root := ~, start := 443543, stop := 443727 ) ], count := [ "A", 2, 0, 52 ], name := "Row", next := 443741, root := ~, start := 443128, stop := 443740 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 58 ], name := "HorLine", next := 443758, root := ~, start := 443748, stop := 443757 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 59 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sLoopy", count := [ "A", 2, 0, 59 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 59 ], mathmode := "Text", name := "C", next := 443811, root := ~, start := 443797, stop := 443810 ), rec( content := "\n \ ", count := [ "A", 2, 0, 59 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 59 ], name := "Item", next := 443827, root := ~, start := 443780, stop := 443826 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 61 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digraph\ HasLoops" ), content := 0, count := [ "A", 2, 0, 61 ], mathmode := "Text", name := "Ref", next := 443882, root := ~, start := 443853, stop := 443881 ), rec( content := "\n \ ", count := [ "A", 2, 0, 61 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 61 ], name := "Item", next := 443898, root := ~, start := 443836, stop := 443897 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 63 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The operation ", count := [ "A", 2, 0, 63 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Prop := "DigraphHasLoops" ), content := 0 , count := [ "A", 2, 0, 63 ], mathmode := \ "Text", name := "Ref", next := 443997, root := ~, start := 443968, stop := 4439\ 96 ), rec( HTML := true, content := " behaves the same as\n ", count := [ "A", 2, 0, 63 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "IsLoopy", count := [ "A", 2, 0, 63 ], mathmode := "Text" , name\ := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 63 ], mathmode := "Text", name := "C", next := 4440\ 44, root := ~, start := 444030, stop := 444043 ), rec( HTML := true, content := "\ in ", count := [ "A", 2, 0, 63 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 2, 0, 63 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 2, 0, 63 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 63 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 63 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 63 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 63 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 2, 0, 63 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 63 ], name := "Alt", next := 444073, root := ~, start := 443924, stop := 444072 ), rec( content := "\n \ ", count := [ "A", 2, 0, 63 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 63 ], name := "Item", next := 444089, root := ~, start := 443907, stop := 444088 ) ], count := [ "A", 2, 0, 58 ], name := "Row", next := 444102, root := ~, start := 443766, stop := 444101 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 64 ], name := "HorLine", next := 444119, root := ~, start := 444109, stop := 444118 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 65 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sSimpleGraph", count := [ "A", 2, 0, 65 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 2, 0, 65 ], mathmode := "Text", name := "C", next := 444178, root := ~, start := 444158, stop := 444177 ), rec( content := "\n \ ", count := [ "A", 2, 0, 65 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 65 ], name := "Item", next := 444194, root := ~, start := 444141, stop := 444193 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 67 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 2, 0, 67 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( Prop := "IsSymmetricDigraph" ), content := 0 , count := [ "A", 2, 0, 67 ], mathmode := \ "Text", name := "Ref", next := 444282, root := ~, start := 444250, stop := 4442\ 81 ), rec( HTML := true, content := "\n and not ", count := [ "A", 2, 0, 67 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "Digrap\ hHasLoops" ), content := 0, count := [ "A", 2, 0, 67 ], mathmode := "Text", name := "Ref\ ", next := 444333, root := ~, start := 444304, stop := 444332 ), rec( HTML := true , content := "\ \n ", count := [ "A", 2, 0, 67 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 2, 0, 67 ], name := "Alt", next := 444350, root := ~, start := 444220, stop := 444349 ), rec( content := "\n \ ", count := [ "A", 2, 0, 67 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "HTML" ), content := [ rec( content := "\\ n ", count := [ "A", 2, 0, 67 ], name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Prop := "IsSymmetricDigraph" ), content := 0, count := [ "A", 2, 0, 67 ], name := "Ref\ ", next := 444422, root := ~, start := 444390, stop := 444421 ), rec( content := "\ \n ", count := [ "A", 2, 0, 67 ], name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 67 ], mathmode := "Text", name := "Alt", next := 444439, root := ~, start := 444361, stop := 444438 ), rec( content := "\n \ ", count := [ "A", 2, 0, 67 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 67 ], name := "Item", next := 444455, root := ~, start := 444203, stop := 444454 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 69 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 2, 0, 69 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 69 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 69 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 69 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 69 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 69 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 69 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ function ", count := [ "A", 2, 0, 69 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "IsSimpleGraph", count :\ = [ "A", 2, 0, 69 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 69 ], mathmode := \ "Text", name := "C", next := 444552, root := ~, start := 444532, stop := 44455\ 1 ), rec( HTML := true, content := " is equivalent to\n ", count := [ "A", 2, 0, 69 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsSymm\ etricDigraph" ), content := 0, count := [ "A", 2, 0, 69 ], mathmode := "Text", name := "Ref\ ", next := 444614, root := ~, start := 444582, stop := 444613 ), rec( HTML := true , content := "\ \n and not ", count := [ "A", 2, 0, 69 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Prop := "DigraphHasLoops" ), content := 0 , count := [ "A", 2, 0, 69 ], mathmode := \ "Text", name := "Ref", next := 444665, root := ~, start := 444636, stop := 4446\ 64 ), rec( HTML := true, content := ".\n ", count := [ "A", 2, 0, 69 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 69 ], name := "Alt", next := 444683, root := ~, start := 444481, stop := 444682 ), rec( content := "\n \ ", count := [ "A", 2, 0, 69 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 69 ], name := "Item", next := 444699, root := ~, start := 444464, stop := 444698 ) ], count := [ "A", 2, 0, 64 ], name := "Row", next := 444712, root := ~, start := 444127, stop := 444711 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 70 ], name := "HorLine", next := 444729, root := ~, start := 444719, stop := 444728 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 71 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ djacency", count := [ "A", 2, 0, 71 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 71 ], mathmode := "Text", name := "C", next := 444784, root := ~, start := 444768, stop := 444783 ), rec( content := "\n \ ", count := [ "A", 2, 0, 71 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 71 ], name := "Item", next := 444800, root := ~, start := 444751, stop := 444799 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 73 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "OutNeig\ hboursOfVertex" ), content := 0, count := [ "A", 2, 0, 73 ], mathmode := "Text", name := "Ref", next := 444861, root := ~, start := 444826, stop := 444860 ), rec( content := "\n \ ", count := [ "A", 2, 0, 73 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n (see also ", count := [ "A", 2, 0, 73 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "InNeighboursOfVertex" ), content := 0 , count := [ "A", 2, 0, 73 ], mathmode := \ "Text", name := "Ref", next := 444946, root := ~, start := 444912, stop := 4449\ 45 ), rec( HTML := true, content := ")\n ", count := [ "A", 2, 0, 73 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 73 ], name := "Alt", next := 444964, root := ~, start := 444872, stop := 444963 ), rec( content := "\n \ ", count := [ "A", 2, 0, 73 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 73 ], name := "Item", next := 444980, root := ~, start := 444809, stop := 444979 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 75 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The operation ", count := [ "A", 2, 0, 75 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "OutNeighboursOfVertex" ), content := 0 , count := [ "A", 2, 0, 75 ], mathmode := \ "Text", name := "Ref", next := 445085, root := ~, start := 445050, stop := 4450\ 84 ), rec( HTML := true, content := " behaves the same\n as ", count := [ "A", 2, 0, 75 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Adjacency", count := [ "A", 2, 0, 75 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 75 ], mathmode := "\ Text", name := "C", next := 445134, root := ~, start := 445118, stop := 445133\ ), rec( HTML := true, content := " in ", count := [ "A", 2, 0, 75 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 75 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 75 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 75 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 75 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 75 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 75 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 2, 0, 75 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 75 ], name := "Alt", next := 445163, root := ~, start := 445006, stop := 445162 ), rec( content := "\n \ ", count := [ "A", 2, 0, 75 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 75 ], name := "Item", next := 445179, root := ~, start := 444989, stop := 445178 ) ], count := [ "A", 2, 0, 70 ], name := "Row", next := 445192, root := ~, start := 444737, stop := 445191 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 76 ], name := "HorLine", next := 445209, root := ~, start := 445199, stop := 445208 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 77 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sEdge", count := [ "A", 2, 0, 77 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 77 ], mathmode := "Text", name := "C", next := 445261, root := ~, start := 445248, stop := 445260 ), rec( content := "\n \ ", count := [ "A", 2, 0, 77 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 77 ], name := "Item", next := 445277, root := ~, start := 445231, stop := 445276 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 79 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graph and list", Oper := "IsDigraphEdge" ), content := 0, count := [ "A", 2, 0, 79 ], mathmode := "Text", name := "Ref", next := 445359, root := ~, start := 445303, stop := 445358 ), rec( content := "\n \ ", count := [ "A", 2, 0, 79 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 79 ], name := "Item", next := 445375, root := ~, start := 445286, stop := 445374 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 81 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The arguments of\n ", count := [ "A", 2, 0, 81 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for d\ igraph and list", Oper := "IsDigraphEdge" ), content := 0, count := [ "A", 2, 0, 81 ], mathmode := \ "Text", name := "Ref", next := 445516, root := ~, start := 445460, stop := 4455\ 15 ), rec( HTML := true, content := "\n can be a digraph and an edg\ e, or a digraph and two vertices. In the\n first form the operation\ \n ", count := [ "A", 2, 0, 81 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( Label := "for digraph and list", Oper := \ "IsDigraphEdge" ), content := 0, count := [ "A", 2, 0, 81 ], mathmode := "Text\ ", name := "Ref", next := 445702, root := ~, start := 445646, stop := 445701 ) , rec( HTML := true , content := "\ \n behaves the same as ", count := [ "A", 2, 0, 81 ], mathmode := "\ Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "IsEdge", count := [ "A", 2, 0, 81 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 81 ], mathmode := "Text", name := "C", next := 4457\ 48, root := ~, start := 445735, stop := 445747 ), rec( HTML := true, content := "\ in ", count := [ "A", 2, 0, 81 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 2, 0, 81 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 2, 0, 81 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 81 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 81 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 81 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 81 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 2, 0, 81 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 81 ], name := "Alt", next := 445777, root := ~, start := 445401, stop := 445776 ), rec( content := "\n \ ", count := [ "A", 2, 0, 81 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 81 ], name := "Item", next := 445793, root := ~, start := 445384, stop := 445792 ) ], count := [ "A", 2, 0, 76 ], name := "Row", next := 445806, root := ~, start := 445217, stop := 445805 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 82 ], name := "HorLine", next := 445823, root := ~, start := 445813, stop := 445822 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 83 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ irectedEdges", count := [ "A", 2, 0, 83 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 2, 0, 83 ], mathmode := "Text", name := "C", next := 445882, root := ~, start := 445862, stop := 445881 ), rec( content := "\n \ ", count := [ "A", 2, 0, 83 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 83 ], name := "Item", next := 445898, root := ~, start := 445845, stop := 445897 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 85 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Edges" ), content := 0, count := [ "A", 2, 0, 85 ], mathmode := "Text", name := "Ref", next := 445950, root := ~, start := 445924, stop := 445949 ), rec( content := "\n \ ", count := [ "A", 2, 0, 85 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 85 ], name := "Item", next := 445966, root := ~, start := 445907, stop := 445965 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 87 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The attribute ", count := [ "A", 2, 0, 87 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "DigraphEdges" ), content := 0 , count := [ "A", 2, 0, 87 ], mathmode := \ "Text", name := "Ref", next := 446062, root := ~, start := 446036, stop := 4460\ 61 ), rec( HTML := true, content := " behaves the same\n as ", count := [ "A", 2, 0, 87 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "DirectedEdges", count := [ "A", 2, 0, 87 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 87 ], mathmode := \ "Text", name := "C", next := 446115, root := ~, start := 446095, stop := 44611\ 4 ), rec( HTML := true, content := " in ", count := [ "A", 2, 0, 87 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 87 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 87 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 87 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 87 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 87 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 87 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 2, 0, 87 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 87 ], name := "Alt", next := 446144, root := ~, start := 445992, stop := 446143 ), rec( content := "\n \ ", count := [ "A", 2, 0, 87 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 87 ], name := "Item", next := 446160, root := ~, start := 445975, stop := 446159 ) ], count := [ "A", 2, 0, 82 ], name := "Row", next := 446173, root := ~, start := 445831, stop := 446172 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 88 ], name := "HorLine", next := 446190, root := ~, start := 446180, stop := 446189 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 89 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "U\ ndirectedEdges", count := [ "A", 2, 0, 89 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 2, 0, 89 ], mathmode := "Text", name := "C", next := 446251, root := ~, start := 446229, stop := 446250 ), rec( content := "\n \ ", count := [ "A", 2, 0, 89 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 89 ], name := "Item", next := 446267, root := ~, start := 446212, stop := 446266 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 2, 0, 91 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 91 ], name := "Item", next := 446313, root := ~, start := 446276, stop := 446312 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 93 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n There is no analogous function in ", count := [ "A", 2, 0, 93 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 2, 0, 93 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 93 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , and no plans to\n include one.\n ", count := [ "A", 2, 0, 93 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 93 ], name := "Alt", next := 446472, root := ~, start := 446339, stop := 446471 ), rec( content := "\n \ ", count := [ "A", 2, 0, 93 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 93 ], name := "Item", next := 446488, root := ~, start := 446322, stop := 446487 ) ], count := [ "A", 2, 0, 88 ], name := "Row", next := 446501, root := ~, start := 446198, stop := 446500 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 94 ], name := "HorLine", next := 446518, root := ~, start := 446508, stop := 446517 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 95 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ istance", count := [ "A", 2, 0, 95 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 95 ], mathmode := "Text", name := "C", next := 446572, root := ~, start := 446557, stop := 446571 ), rec( content := "\n \ ", count := [ "A", 2, 0, 95 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 95 ], name := "Item", next := 446588, root := ~, start := 446540, stop := 446587 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 97 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph and two vertices", Oper := "DigraphShortestDistance" ), content := 0, count := [ "A", 2, 0, 97 ], mathmode := "Text", name := "Ref", next := 446705, root := ~, start := 446614, stop := 446704 ), rec( content := "\n \ ", count := [ "A", 2, 0, 97 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 97 ], name := "Item", next := 446721, root := ~, start := 446597, stop := 446720 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 99 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The operation ", count := [ "A", 2, 0, 99 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Label := "for a digraph and two ver\ tices", Oper := "DigraphShortestDistance" ), content := 0, count := [ "A", 2, 0, 99 ], mathmode := \ "Text", name := "Ref", next := 446879, root := ~, start := 446791, stop := 4468\ 78 ), rec( HTML := true, content := " behaves the same as\n ", count := [ "A", 2, 0, 99 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Distance", count := [ "A", 2, 0, 99 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 99 ], mathmode := "T\ ext", name := "C", next := 446927, root := ~, start := 446912, stop := 446926 ), rec( HTML := true , content := "\ in ", count := [ "A", 2, 0, 99 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 2, 0, 99 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 2, 0, 99 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 99 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 99 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 2, 0, 99 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 2, 0, 99 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 2, 0, 99 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 2, 0, 99 ], name := "Alt", next := 446956, root := ~, start := 446747, stop := 446955 ), rec( content := "\n \ ", count := [ "A", 2, 0, 99 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 99 ], name := "Item", next := 446972, root := ~, start := 446730, stop := 446971 ) ], count := [ "A", 2, 0, 94 ], name := "Row", next := 446985, root := ~, start := 446526, stop := 446984 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 100 ], name := "HorLine", next := 447002, root := ~, start := 446992, stop := 447001 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 101 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ iameter", count := [ "A", 2, 0, 101 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 101 ] , mathmode := "Text", name := "C", next := 447056, root := ~, start := 447041, stop := 447055 ), rec( content := "\n \ ", count := [ "A", 2, 0, 101 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 101 ], name := "Item", next := 447072, root := ~, start := 447024, stop := 447071 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 103 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Diameter" ), content := 0, count := [ "A", 2, 0, 103 ], mathmode := "Text", name := "Ref", next := 447127, root := ~, start := 447098, stop := 447126 ), rec( content := "\n \ ", count := [ "A", 2, 0, 103 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 103 ], name := "Item", next := 447143, root := ~, start := 447081, stop := 447142 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 105 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The attribute ", count := [ "A", 2, 0, 105 ], mathmode := "Text" , name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "DigraphDiameter" ), content := 0 , count := [ "A", 2, 0, 105 ] , mathmode := \ "Text", name := "Ref", next := 447242, root := ~, start := 447213, stop := 4472\ 41 ), rec( HTML := true, content := " behaves the same\n as ", count := [ "A", 2, 0, 105 ] , mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Diameter", count := [ "A", 2, 0, 105 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 105 ], mathmode := \ "Text", name := "C", next := 447290, root := ~, start := 447275, stop := 44728\ 9 ), rec( HTML := true, content := " in ", count := [ "A", 2, 0, 105 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 105 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 105 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 105 ] , name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 105 ], name := "PCDATA", root :\ = ~ ) ], count := [ "A", 2, 0, 105 ], name := "Package", next := 137, root := \ ~, start := 113, stop := 136 ) ], count := [ "A", 2, 0, 105 ], mathmode := "Te\ xt", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 2, 0, 105 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 2, 0, 105 ], name := "Alt", next := 447319, root := ~, start := 447169, stop := 447318 ), rec( content := "\n \ ", count := [ "A", 2, 0, 105 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 105 ], name := "Item", next := 447335, root := ~, start := 447152, stop := 447334 ) ], count := [ "A", 2, 0, 100 ], name := "Row", next := 447348, root := ~, start := 447010, stop := 447347 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 106 ], name := "HorLine", next := 447365, root := ~, start := 447355, stop := 447364 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 107 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ irth", count := [ "A", 2, 0, 107 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 107 ] , mathmode := "Text", name := "C", next := 447416, root := ~, start := 447404, stop := 447415 ), rec( content := "\n \ ", count := [ "A", 2, 0, 107 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 107 ], name := "Item", next := 447432, root := ~, start := 447387, stop := 447431 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 109 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ UndirectedGirth" ), content := 0, count := [ "A", 2, 0, 109 ], mathmode := "Text", name := "Ref", next := 447494, root := ~, start := 447458, stop := 447493 ), rec( content := "\n \ ", count := [ "A", 2, 0, 109 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 109 ], name := "Item", next := 447510, root := ~, start := 447441, stop := 447509 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The attribute ", count := [ "A", 2, 0, 111 ], mathmode := "Text" , name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "DigraphUndirectedGirth" ), content := 0 , count := [ "A", 2, 0, 111 ] , mathmode := \ "Text", name := "Ref", next := 447616, root := ~, start := 447580, stop := 4476\ 15 ), rec( HTML := true, content := " behaves the same\n as ", count := [ "A", 2, 0, 111 ] , mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Girth", count := [ "A", 2, 0, 111 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "C", next := 4476\ 61, root := ~, start := 447649, stop := 447660 ), rec( HTML := true, content := "\ in ", count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "PCDATA", roo\ t := ~ ) ], count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 111 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 111 ], name := "PCDATA", root :\ = ~ ) ], count := [ "A", 2, 0, 111 ], name := "Package", next := 137, root := \ ~, start := 113, stop := 136 ) ], count := [ "A", 2, 0, 111 ], mathmode := "Te\ xt", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true , content := "\ except that in the case that the\n argument is a forest, ", count := [ "A", 2, 0, 111 ] , mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "infinity", count := [ "A", 2, 0, 111 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 111 ], mathmode := \ "Text", name := "K", next := 447755, root := ~, start := 447740, stop := 44775\ 4 ), rec( HTML := true, content := " is returned by ", count := [ "A", 2, 0, 111 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 2, 0, 111 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 111 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ \n whereas ", count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "-1", count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "PCDATA" , root\ := ~ ) ], count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "C", next := 4478\ 11, root := ~, start := 447802, stop := 447810 ), rec( HTML := true, content := "\ is returned by ", count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 111 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 111 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 111 ] , name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 111 ], name := "PCDATA", root :\ = ~ ) ], count := [ "A", 2, 0, 111 ], name := "Package", next := 137, root := \ ~, start := 113, stop := 136 ) ], count := [ "A", 2, 0, 111 ], mathmode := "Te\ xt", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 2, 0, 111 ], name := "Alt", next := 447852, root := ~, start := 447536, stop := 447851 ), rec( content := "\n \ ", count := [ "A", 2, 0, 111 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 111 ], name := "Item", next := 447868, root := ~, start := 447519, stop := 447867 ) ], count := [ "A", 2, 0, 106 ], name := "Row", next := 447881, root := ~, start := 447373, stop := 447880 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 112 ], name := "HorLine", next := 447898, root := ~, start := 447888, stop := 447897 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 113 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sConnectedGraph", count := [ "A", 2, 0, 113 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 2, 0, 113 ], mathmode := "Text", name := "C", next := 447960, root := ~, start := 447937, stop := 447959 ), rec( content := "\n \ ", count := [ "A", 2, 0, 113 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 113 ], name := "Item", next := 447976, root := ~, start := 447920, stop := 447975 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 115 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsStron\ glyConnectedDigraph" ), content := 0, count := [ "A", 2, 0, 115 ], mathmode := "Text", name := "Ref", next := 448042, root := ~, start := 448002, stop := 448041 ), rec( content := "\n \ ", count := [ "A", 2, 0, 115 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 115 ], name := "Item", next := 448058, root := ~, start := 447985, stop := 448057 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 117 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The attribute ", count := [ "A", 2, 0, 117 ], mathmode := "Text" , name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Prop := "IsStronglyConnectedDigraph\ " ), content := 0, count := [ "A", 2, 0, 117 ], mathmode := "Text", name := "Ref\ ", next := 448168, root := ~, start := 448128, stop := 448167 ), rec( HTML := true , content := "\ behaves the\n same as ", count := [ "A", 2, 0, 117 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "IsConnectedGraph", count := [ "A", 2, 0, 117 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 117 ], mathmode := \ "Text", name := "C", next := 448224, root := ~, start := 448201, stop := 44822\ 3 ), rec( HTML := true, content := " in ", count := [ "A", 2, 0, 117 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 117 ], mat\ hmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 117 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 117 ] , name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 117 ], name := "PCDATA", root :\ = ~ ) ], count := [ "A", 2, 0, 117 ], name := "Package", next := 137, root := \ ~, start := 113, stop := 136 ) ], count := [ "A", 2, 0, 117 ], mathmode := "Te\ xt", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 2, 0, 117 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 2, 0, 117 ], name := "Alt", next := 448253, root := ~, start := 448084, stop := 448252 ), rec( content := "\n \ ", count := [ "A", 2, 0, 117 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 117 ], name := "Item", next := 448269, root := ~, start := 448067, stop := 448268 ) ], count := [ "A", 2, 0, 112 ], name := "Row", next := 448282, root := ~, start := 447906, stop := 448281 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 118 ], name := "HorLine", next := 448299, root := ~, start := 448289, stop := 448298 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 119 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sBipartite", count := [ "A", 2, 0, 119 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ "A", 2, 0, 119 ] , mathmode := "Text", name := "C", next := 448356, root := ~, start := 448338, stop := 448355 ), rec( content := "\n \ ", count := [ "A", 2, 0, 119 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 119 ], name := "Item", next := 448372, root := ~, start := 448321, stop := 448371 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 121 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsBipar\ titeDigraph" ), content := 0, count := [ "A", 2, 0, 121 ], mathmode := "Text", name := "Ref", next := 448430, root := ~, start := 448398, stop := 448429 ), rec( content := "\n \ ", count := [ "A", 2, 0, 121 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n and ", count := [ "A", 2, 0, 121 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Prop := "IsSymmetricDigraph" ), content := 0 , count := [ "A", 2, 0, 121 ] , mathmode := \ "Text", name := "Ref", next := 448507, root := ~, start := 448475, stop := 4485\ 06 ), rec( HTML := true, content := "\n ", count := [ "A", 2, 0, 121 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 121 ], name := "Alt", next := 448524, root := ~, start := 448441, stop := 448523 ), rec( content := "\n \ ", count := [ "A", 2, 0, 121 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 121 ], name := "Item", next := 448540, root := ~, start := 448381, stop := 448539 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 123 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 2, 0, 123 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 123 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 123 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 123 ] , name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 123 ], name := "PCDATA", root :\ = ~ ) ], count := [ "A", 2, 0, 123 ], name := "Package", next := 137, root := \ ~, start := 113, stop := 136 ) ], count := [ "A", 2, 0, 123 ], mathmode := "Te\ xt", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true , content := "\ function ", count := [ "A", 2, 0, 123 ], mathmode := "Text", name := "PCDATA" , root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "IsBipartite", count := [ \ "A", 2, 0, 123 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 123 ] , mathmode := \ "Text", name := "C", next := 448635, root := ~, start := 448617, stop := 44863\ 4 ), rec( HTML := true, content := " is equivalent to\n ", count := [ "A", 2, 0, 123 ] , mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsBipa\ rtiteDigraph" ), content := 0, count := [ "A", 2, 0, 123 ], mathmode := "Text" , name := "Ref\ ", next := 448697, root := ~, start := 448665, stop := 448696 ), rec( HTML := true , content := "\ and ", count := [ "A", 2, 0, 123 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Prop := "IsSymmetricDigraph" ), content := 0, count := [ "A", 2, 0, 123 ], mathmode := \ "Text", name := "Ref", next := 448748, root := ~, start := 448702, stop := 4487\ 47 ), rec( HTML := true, content := ".\n ", count := [ "A", 2, 0, 123 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 123 ], name := "Alt", next := 448766, root := ~, start := 448566, stop := 448765 ), rec( content := "\n \ ", count := [ "A", 2, 0, 123 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 123 ], name := "Item", next := 448782, root := ~, start := 448549, stop := 448781 ) ], count := [ "A", 2, 0, 118 ], name := "Row", next := 448795, root := ~, start := 448307, stop := 448794 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 124 ], name := "HorLine", next := 448812, root := ~, start := 448802, stop := 448811 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 125 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sNullGraph", count := [ "A", 2, 0, 125 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ "A", 2, 0, 125 ] , mathmode := "Text", name := "C", next := 448869, root := ~, start := 448851, stop := 448868 ), rec( content := "\n \ ", count := [ "A", 2, 0, 125 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 125 ], name := "Item", next := 448885, root := ~, start := 448834, stop := 448884 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 127 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsNullD\ igraph" ), content := 0, count := [ "A", 2, 0, 127 ], mathmode := "Text", name := "Ref", next := 448938, root := ~, start := 448911, stop := 448937 ), rec( content := "\n \ ", count := [ "A", 2, 0, 127 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n or ", count := [ "A", 2, 0, 127 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Prop := "IsEmptyDigraph" ), content := 0 , count := [ "A", 2, 0, 127 ] , mathmode := \ "Text", name := "Ref", next := 449010, root := ~, start := 448982, stop := 4490\ 09 ), rec( HTML := true, content := "\n ", count := [ "A", 2, 0, 127 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 127 ], name := "Alt", next := 449027, root := ~, start := 448949, stop := 449026 ), rec( content := "\n \ ", count := [ "A", 2, 0, 127 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 127 ], name := "Item", next := 449043, root := ~, start := 448894, stop := 449042 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 129 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 2, 0, 129 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 129 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 129 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 129 ] , name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 129 ], name := "PCDATA", root :\ = ~ ) ], count := [ "A", 2, 0, 129 ], name := "Package", next := 137, root := \ ~, start := 113, stop := 136 ) ], count := [ "A", 2, 0, 129 ], mathmode := "Te\ xt", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true , content := "\ function ", count := [ "A", 2, 0, 129 ], mathmode := "Text", name := "PCDATA" , root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "IsNullGraph", count := [ \ "A", 2, 0, 129 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 129 ] , mathmode := \ "Text", name := "C", next := 449138, root := ~, start := 449120, stop := 44913\ 7 ), rec( HTML := true, content := " is equivalent to\n ", count := [ "A", 2, 0, 129 ] , mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsEmpt\ yDigraph" ), content := 0, count := [ "A", 2, 0, 129 ], mathmode := "Text", name := "Ref\ ", next := 449196, root := ~, start := 449168, stop := 449195 ), rec( HTML := true , content := "\ and its synonym ", count := [ "A", 2, 0, 129 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Prop := "IsNullDigraph" ), content := 0 , count := [ "A", 2, 0, 129 ] , mathmode := \ "Text", name := "Ref", next := 449254, root := ~, start := 449213, stop := 4492\ 53 ), rec( HTML := true, content := ".\n ", count := [ "A", 2, 0, 129 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 129 ], name := "Alt", next := 449272, root := ~, start := 449069, stop := 449271 ), rec( content := "\n \ ", count := [ "A", 2, 0, 129 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 129 ], name := "Item", next := 449288, root := ~, start := 449052, stop := 449287 ) ], count := [ "A", 2, 0, 124 ], name := "Row", next := 449301, root := ~, start := 448820, stop := 449300 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 130 ], name := "HorLine", next := 449318, root := ~, start := 449308, stop := 449317 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 131 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sCompleteGraph", count := [ "A", 2, 0, 131 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 2, 0, 131 ], mathmode := "Text", name := "C", next := 449379, root := ~, start := 449357, stop := 449378 ), rec( content := "\n \ ", count := [ "A", 2, 0, 131 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 131 ], name := "Item", next := 449395, root := ~, start := 449340, stop := 449394 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 133 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsCompl\ eteDigraph" ), content := 0, count := [ "A", 2, 0, 133 ], mathmode := "Text", name := "Ref", next := 449452, root := ~, start := 449421, stop := 449451 ), rec( content := "\n \ ", count := [ "A", 2, 0, 133 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 133 ], name := "Item", next := 449468, root := ~, start := 449404, stop := 449467 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 2, 0, 135 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 2, 0, 135 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 2, 0, 135 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 135 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 2, 0, 135 ] , name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 2, 0, 135 ], name := "PCDATA", root :\ = ~ ) ], count := [ "A", 2, 0, 135 ], name := "Package", next := 137, root := \ ~, start := 113, stop := 136 ) ], count := [ "A", 2, 0, 135 ], mathmode := "Te\ xt", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true , content := "\ function ", count := [ "A", 2, 0, 135 ], mathmode := "Text", name := "PCDATA" , root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "IsCompleteGraph", count\ := [ "A", 2, 0, 135 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 135 ] , mathmode := \ "Text", name := "C", next := 449567, root := ~, start := 449545, stop := 44956\ 6 ), rec( HTML := true, content := " is roughly\n equivalent to\n \ ", count := [ "A", 2, 0, 135 ], mathmode := "Text", name := "PCDATA" , root := ~ ), rec( attributes :\ = rec( Prop := "IsCompleteDigraph" ), content := 0, count := [ "A", 2, 0, 135 ], mathmode := \ "Text", name := "Ref", next := 449648, root := ~, start := 449617, stop := 4496\ 47 ), rec( HTML := true, content := " except that in ", count := [ "A", 2, 0, 135 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 2, 0, 135 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 135 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ \n a complete digraph has ", count := [ "A", 2, 0, 135 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "no loops", count := [ "A", 2, 0, 135 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 135 ], mathmode := \ "Text", name := "E", next := 449725, root := ~, start := 449710, stop := 44972\ 4 ), rec( HTML := true, content := ".\n ", count := [ "A", 2, 0, 135 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 135 ], name := "Alt", next := 449743, root := ~, start := 449494, stop := 449742 ), rec( content := "\n \ ", count := [ "A", 2, 0, 135 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 135 ], name := "Item", next := 449759, root := ~, start := 449477, stop := 449758 ) ], count := [ "A", 2, 0, 130 ], name := "Row", next := 449772, root := ~, start := 449326, stop := 449771 ), rec( attributes := rec( ), content := 0, count := [ "A", 2, 0, 136 ], name := "HorLine", next := 449789, root := ~, start := 449779, stop := 449788 ) ], count := [ "A", 2, 0, 4 ], mathmode := "Text", name := "Table", next := 449802, root := ~, start := 439782, stop := 449801 ), rec( content := "\n ", count := [ "A", 2, 0, 137 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 2, 0, 1 ], mathmode := "Text", name := "Section", next := 449815, root := ~, start := 439535, stop := 449814 ), rec( content := "\n\n ", count := [ "A", 2, 0, 137 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ "A", 3, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n Functions to dete\ rmine regularity properties of graphs\n ", count := [ "A", 3, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 2 ], mathmode := "Text", name := "Heading", next := 449918, root := ~, start := 449833, stop := 449917 ), rec( content := "\n ", count := [ "A", 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "HTML" ), content := [ rec( content := "\n ", count := [ "A", 3, 0, 3 ], name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n The tab\ le in this section contains more information when viewed in\n html form\ at.\n ", count := [ "A", 3, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 3 ], name := "E", next := 450056, root := ~, start := 449946, stop := 450055 ), rec( content := "\n ", count := [ "A", 3, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 3 ], mathmode := "Text", name := "Alt", next := 450067, root := ~, start := 449923, stop := 450066 ), rec( content := "\n\n ", count := [ "A", 3, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Align := "|l|l|l|" ), content := [ rec( attributes := rec( ), content := 0, count := [ "A", 3, 0, 4 ], name := "HorLine", next := 450113, root := ~, start := 450103, stop := 450112 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ "A", 3, 0, 5 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 5 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 3, 0, 5 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ "A", 3, 0, 5 ], name\ := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 5 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ "A", 3, 0, 5 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " command\ \n ", count := [ "A", 3, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 5 ], name := "Item", next := 450183, root := ~, start := 450135, stop := 450182 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ "A", 3, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 7 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " command\ \n ", count := [ "A", 3, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 7 ], name := "Item", next := 450243, root := ~, start := 450192, stop := 450242 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Comments\n ", count := [ "A", 3, 0, 9 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 9 ], name := "Alt", next := 450324, root := ~, start := 450269, stop := 450323 ), rec( content := "\n \ ", count := [ "A", 3, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 9 ], name := "Item", next := 450340, root := ~, start := 450252, stop := 450339 ) ], count := [ "A", 3, 0, 4 ], name := "Row", next := 450353, root := ~, start := 450121, stop := 450352 ), rec( attributes := rec( ), content := 0, count := [ "A", 3, 0, 10 ], name := "HorLine", next := 450370, root := ~, start := 450360, stop := 450369 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sRegularGraph", count := [ "A", 3, 0, 11 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 3, 0, 11 ], mathmode := "Text", name := "C", next := 450430, root := ~, start := 450409, stop := 450429 ), rec( content := "\n \ ", count := [ "A", 3, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 11 ], name := "Item", next := 450446, root := ~, start := 450392, stop := 450445 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsOutRe\ gularDigraph" ), content := 0, count := [ "A", 3, 0, 13 ], mathmode := "Text", name := "Ref", next := 450505, root := ~, start := 450472, stop := 450504 ), rec( content := "\n \ ", count := [ "A", 3, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n (see also\n ", count := [ "A", 3, 0, 13 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsInRe\ gularDigraph" ), content := 0, count := [ "A", 3, 0, 13 ], mathmode := "Text", name := "Ref\ ", next := 450600, root := ~, start := 450568, stop := 450599 ), rec( HTML := true , content := "\ \n and\n ", count := [ "A", 3, 0, 13 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsRegularD\ igraph" ), content := 0, count := [ "A", 3, 0, 13 ], mathmode := "Text", name := "Ref\ ", next := 450659, root := ~, start := 450629, stop := 450658 ), rec( HTML := true , content := "\ )\n ", count := [ "A", 3, 0, 13 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 3, 0, 13 ], name := "Alt", next := 450677, root := ~, start := 450516, stop := 450676 ), rec( content := "\n \ ", count := [ "A", 3, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 13 ], name := "Item", next := 450693, root := ~, start := 450455, stop := 450692 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 3, 0, 15 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 3, 0, 15 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 15 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 3, 0, 15 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 3, 0, 15 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 3, 0, 15 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 3, 0, 15 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ function ", count := [ "A", 3, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "IsRegularGraph", count \ := [ "A", 3, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 15 ], mathmode := \ "Text", name := "C", next := 450791, root := ~, start := 450770, stop := 45079\ 0 ), rec( HTML := true, content := " is\n equivalent to ", count := [ "A", 3, 0, 15 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsOutR\ egularDigraph" ), content := 0, count := [ "A", 3, 0, 15 ], mathmode := "Text" , name := "Ref\ ", next := 450854, root := ~, start := 450821, stop := 450853 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 3, 0, 15 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 3, 0, 15 ], name := "Alt", next := 450872, root := ~, start := 450719, stop := 450871 ), rec( content := "\n \ ", count := [ "A", 3, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 15 ], name := "Item", next := 450888, root := ~, start := 450702, stop := 450887 ) ], count := [ "A", 3, 0, 10 ], name := "Row", next := 450901, root := ~, start := 450378, stop := 450900 ), rec( attributes := rec( ), content := 0, count := [ "A", 3, 0, 16 ], name := "HorLine", next := 450918, root := ~, start := 450908, stop := 450917 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "L\ ocalParameters", count := [ "A", 3, 0, 17 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 3, 0, 17 ], mathmode := "Text", name := "C", next := 450979, root := ~, start := 450957, stop := 450978 ), rec( content := "\n \ ", count := [ "A", 3, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 17 ], name := "Item", next := 450995, root := ~, start := 450940, stop := 450994 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 3, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 19 ], name := "Item", next := 451041, root := ~, start := 451004, stop := 451040 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 3, 0, 21 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 3, 0, 21 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 21 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 3, 0, 21 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 3, 0, 21 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 3, 0, 21 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 3, 0, 21 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ function ", count := [ "A", 3, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "LocalParameters", count\ := [ "A", 3, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 21 ], mathmode := \ "Text", name := "C", next := 451139, root := ~, start := 451117, stop := 45113\ 8 ), rec( HTML := true, content := " has no equivalent\n function i\ n ", count := [ "A", 3, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 3, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 21 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , although this might change in the future.\n ", count := [ "A", 3, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 21 ], name := "Alt", next := 451252, root := ~, start := 451066, stop := 451251 ), rec( content := "\n \ ", count := [ "A", 3, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 21 ], name := "Item", next := 451268, root := ~, start := 451050, stop := 451267 ) ], count := [ "A", 3, 0, 16 ], name := "Row", next := 451281, root := ~, start := 450926, stop := 451280 ), rec( attributes := rec( ), content := 0, count := [ "A", 3, 0, 22 ], name := "HorLine", next := 451298, root := ~, start := 451288, stop := 451297 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ lobalParameters", count := [ "A", 3, 0, 23 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 3, 0, 23 ], mathmode := "Text", name := "C", next := 451360, root := ~, start := 451337, stop := 451359 ), rec( content := "\n \ ", count := [ "A", 3, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 23 ], name := "Item", next := 451376, root := ~, start := 451320, stop := 451375 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 3, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 25 ], name := "Item", next := 451422, root := ~, start := 451385, stop := 451421 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 3, 0, 27 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 3, 0, 27 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 27 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 3, 0, 27 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 3, 0, 27 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 3, 0, 27 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 3, 0, 27 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ function ", count := [ "A", 3, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "GlobalParameters", coun\ t := [ "A", 3, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 27 ], mathmode := \ "Text", name := "C", next := 451521, root := ~, start := 451498, stop := 45152\ 0 ), rec( HTML := true, content := " has no equivalent\n function i\ n ", count := [ "A", 3, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 3, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 27 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , although this might change in the future.\n ", count := [ "A", 3, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 27 ], name := "Alt", next := 451634, root := ~, start := 451447, stop := 451633 ), rec( content := "\n \ ", count := [ "A", 3, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 27 ], name := "Item", next := 451650, root := ~, start := 451431, stop := 451649 ) ], count := [ "A", 3, 0, 22 ], name := "Row", next := 451663, root := ~, start := 451306, stop := 451662 ), rec( attributes := rec( ), content := 0, count := [ "A", 3, 0, 28 ], name := "HorLine", next := 451680, root := ~, start := 451670, stop := 451679 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sDistanceRegular", count := [ "A", 3, 0, 29 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 3, 0, 29 ], mathmode := "Text", name := "C", next := 451743, root := ~, start := 451719, stop := 451742 ), rec( content := "\n \ ", count := [ "A", 3, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 29 ], name := "Item", next := 451759, root := ~, start := 451702, stop := 451758 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsDista\ nceRegularDigraph" ), content := 0, count := [ "A", 3, 0, 31 ], mathmode := "Text", name := "Ref", next := 451823, root := ~, start := 451785, stop := 451822 ), rec( content := "\n \ ", count := [ "A", 3, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 31 ], name := "Item", next := 451839, root := ~, start := 451768, stop := 451838 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 3, 0, 33 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 3, 0, 33 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 33 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 3, 0, 33 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 3, 0, 33 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 3, 0, 33 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 3, 0, 33 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ function ", count := [ "A", 3, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "IsDistanceRegular", coun\ t := [ "A", 3, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 33 ], mathmode := \ "Text", name := "C", next := 451940, root := ~, start := 451916, stop := 45193\ 9 ), rec( HTML := true, content := " is\n equivalent to ", count := [ "A", 3, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsDist\ anceRegularDigraph" ), content := 0, count := [ "A", 3, 0, 33 ], mathmode := "\ Text", name := "Ref", next := 452008, root := ~, start := 451970, stop := 4520\ 07 ), rec( HTML := true, content := ".\n ", count := [ "A", 3, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 33 ], name := "Alt", next := 452026, root := ~, start := 451865, stop := 452025 ), rec( content := "\n \ ", count := [ "A", 3, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 33 ], name := "Item", next := 452042, root := ~, start := 451848, stop := 452041 ) ], count := [ "A", 3, 0, 28 ], name := "Row", next := 452055, root := ~, start := 451688, stop := 452054 ), rec( attributes := rec( ), content := 0, count := [ "A", 3, 0, 34 ], name := "HorLine", next := 452072, root := ~, start := 452062, stop := 452071 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ollapsedAdjacencyMat", count := [ "A", 3, 0, 35 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 3, 0, 35 ], mathmode := "Text", name := "C", next := 452139, root := ~, start := 452111, stop := 452138 ), rec( content := "\n \ ", count := [ "A", 3, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 35 ], name := "Item", next := 452155, root := ~, start := 452094, stop := 452154 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 3, 0, 37 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 37 ], name := "Item", next := 452201, root := ~, start := 452164, stop := 452200 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 3, 0, 39 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 3, 0, 39 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 39 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 3, 0, 39 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 3, 0, 39 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 3, 0, 39 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 3, 0, 39 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ function ", count := [ "A", 3, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "CollapsedAdjacencyMat", coun\ t := [ "A", 3, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 39 ], mathmode := \ "Text", name := "C", next := 452305, root := ~, start := 452277, stop := 45230\ 4 ), rec( HTML := true, content := " has no equivalent\n function i\ n ", count := [ "A", 3, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 3, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 39 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , although this might change in the future.\n ", count := [ "A", 3, 0, 39 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 39 ], name := "Alt", next := 452418, root := ~, start := 452226, stop := 452417 ), rec( content := "\n \ ", count := [ "A", 3, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 39 ], name := "Item", next := 452434, root := ~, start := 452210, stop := 452433 ) ], count := [ "A", 3, 0, 34 ], name := "Row", next := 452447, root := ~, start := 452080, stop := 452446 ), rec( attributes := rec( ), content := 0, count := [ "A", 3, 0, 40 ], name := "HorLine", next := 452464, root := ~, start := 452454, stop := 452463 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "O\ rbitalGraphColadjMats", count := [ "A", 3, 0, 41 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 3, 0, 41 ], mathmode := "Text", name := "C", next := 452532, root := ~, start := 452503, stop := 452531 ), rec( content := "\n \ ", count := [ "A", 3, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 41 ], name := "Item", next := 452548, root := ~, start := 452486, stop := 452547 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 3, 0, 43 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 43 ], name := "Item", next := 452594, root := ~, start := 452557, stop := 452593 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 3, 0, 45 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 3, 0, 45 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 45 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 3, 0, 45 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 3, 0, 45 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 3, 0, 45 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 3, 0, 45 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ function ", count := [ "A", 3, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "OrbitalGraphColadjMats" , coun\ t := [ "A", 3, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 45 ], mathmode := \ "Text", name := "C", next := 452699, root := ~, start := 452670, stop := 45269\ 8 ), rec( HTML := true, content := " has no equivalent\n function i\ n ", count := [ "A", 3, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 3, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 45 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , although this might change in the future.\n ", count := [ "A", 3, 0, 45 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 45 ], name := "Alt", next := 452812, root := ~, start := 452619, stop := 452811 ), rec( content := "\n \ ", count := [ "A", 3, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 45 ], name := "Item", next := 452828, root := ~, start := 452603, stop := 452827 ) ], count := [ "A", 3, 0, 40 ], name := "Row", next := 452841, root := ~, start := 452472, stop := 452840 ), rec( attributes := rec( ), content := 0, count := [ "A", 3, 0, 46 ], name := "HorLine", next := 452858, root := ~, start := 452848, stop := 452857 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 47 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "V\ ertexTransitiveDRGs", count := [ "A", 3, 0, 47 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 3, 0, 47 ], mathmode := "Text", name := "C", next := 452924, root := ~, start := 452897, stop := 452923 ), rec( content := "\n \ ", count := [ "A", 3, 0, 47 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 47 ], name := "Item", next := 452940, root := ~, start := 452880, stop := 452939 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 3, 0, 49 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 49 ], name := "Item", next := 452986, root := ~, start := 452949, stop := 452985 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 3, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The ", count := [ "A", 3, 0, 51 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attri\ butes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "h\ ttp://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 3, 0, 51 ], mathm\ ode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 51 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 3, 0, 51 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 3, 0, 51 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 3, 0, 51 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 3, 0, 51 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ function ", count := [ "A", 3, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "VertexTransitiveDRGs", coun\ t := [ "A", 3, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 51 ], mathmode := \ "Text", name := "C", next := 453089, root := ~, start := 453062, stop := 45308\ 8 ), rec( HTML := true, content := " has no equivalent\n function i\ n ", count := [ "A", 3, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 3, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 51 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , although this might change in the future.\n ", count := [ "A", 3, 0, 51 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 51 ], name := "Alt", next := 453202, root := ~, start := 453011, stop := 453201 ), rec( content := "\n \ ", count := [ "A", 3, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 51 ], name := "Item", next := 453218, root := ~, start := 452995, stop := 453217 ) ], count := [ "A", 3, 0, 46 ], name := "Row", next := 453231, root := ~, start := 452866, stop := 453230 ), rec( attributes := rec( ), content := 0, count := [ "A", 3, 0, 52 ], name := "HorLine", next := 453248, root := ~, start := 453238, stop := 453247 ) ], count := [ "A", 3, 0, 4 ], mathmode := "Text", name := "Table", next := 453262, root := ~, start := 450073, stop := 453261 ), rec( content := "\n\n ", count := [ "A", 3, 0, 53 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 3, 0, 1 ], mathmode := "Text", name := "Section", next := 453276, root := ~, start := 449819, stop := 453275 ), rec( content := "\n\n ", count := [ "A", 3, 0, 53 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ "A", 4, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n Some special vert\ ex subsets of a graph\n ", count := [ "A", 4, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 2 ], mathmode := "Text", name := "Heading", next := 453363, root := ~, start := 453294, stop := 453362 ), rec( content := "\n ", count := [ "A", 4, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "HTML" ), content := [ rec( content := "\n ", count := [ "A", 4, 0, 3 ], name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n The tab\ le in this section contains more information when viewed in\n html form\ at.\n ", count := [ "A", 4, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 3 ], name := "E", next := 453501, root := ~, start := 453391, stop := 453500 ), rec( content := "\n ", count := [ "A", 4, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 3 ], mathmode := "Text", name := "Alt", next := 453512, root := ~, start := 453368, stop := 453511 ), rec( content := "\n\n ", count := [ "A", 4, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Align := "|l|l|l|" ), content := [ rec( attributes := rec( ), content := 0, count := [ "A", 4, 0, 4 ], name := "HorLine", next := 453558, root := ~, start := 453548, stop := 453557 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ "A", 4, 0, 5 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 5 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 5 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ "A", 4, 0, 5 ], name\ := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 5 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ "A", 4, 0, 5 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " command\ \n ", count := [ "A", 4, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 5 ], name := "Item", next := 453628, root := ~, start := 453580, stop := 453627 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ "A", 4, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 7 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " command\ \n ", count := [ "A", 4, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 7 ], name := "Item", next := 453688, root := ~, start := 453637, stop := 453687 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Comments\n ", count := [ "A", 4, 0, 9 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 9 ], name := "Alt", next := 453769, root := ~, start := 453714, stop := 453768 ), rec( content := "\n \ ", count := [ "A", 4, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 9 ], name := "Item", next := 453785, root := ~, start := 453697, stop := 453784 ) ], count := [ "A", 4, 0, 4 ], name := "Row", next := 453798, root := ~, start := 453566, stop := 453797 ), rec( attributes := rec( ), content := 0, count := [ "A", 4, 0, 10 ], name := "HorLine", next := 453815, root := ~, start := 453805, stop := 453814 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ onnectedComponent", count := [ "A", 4, 0, 11 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 4, 0, 11 ], mathmode := "Text", name := "C", next := 453879, root := ~, start := 453854, stop := 453878 ), rec( content := "\n \ ", count := [ "A", 4, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 11 ], name := "Item", next := 453895, root := ~, start := 453837, stop := 453894 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ ConnectedComponent" ), content := 0, count := [ "A", 4, 0, 13 ], mathmode := "Text", name := "Ref", next := 453960, root := ~, start := 453921, stop := 453959 ), rec( content := "\n \ ", count := [ "A", 4, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 13 ], name := "Item", next := 453976, root := ~, start := 453904, stop := 453975 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n When applied to a simple di/graph and a vertex,\n ", count := [ "A", 4, 0, 15 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "ConnectedComponent", count := [ "A", 4, 0, 15 ], mathmod\ e := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 15 ], mathmode := \ "Text", name := "C", next := 454117, root := ~, start := 454092, stop := 45411\ 6 ), rec( HTML := true, content := " in ", count := [ "A", 4, 0, 15 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 4, 0, 15 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 15 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 15 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 15 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 15 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 15 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 4, 0, 15 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "DigraphCon\ nectedComponent" ), content := 0, count := [ "A", 4, 0, 15 ], mathmode := "Tex\ t", name := "Ref", next := 454197, root := ~, start := 454158, stop := 454196 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 4, 0, 15 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Oper := "DigraphConnectedComponent"\ ), content := 0, count := [ "A", 4, 0, 15 ], mathmode := "Text", name := "Ref\ ", next := 454250, root := ~, start := 454211, stop := 454249 ), rec( HTML := true , content := "\ can also be applied to\n non-simple graphs (in the language of ", count := [ "A", 4, 0, 15 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 4, 0, 15 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 15 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 15 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 15 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 15 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 15 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ ).\n ", count := [ "A", 4, 0, 15 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 4, 0, 15 ], name := "Alt", next := 454350, root := ~, start := 454002, stop := 454349 ), rec( content := "\n \ ", count := [ "A", 4, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 15 ], name := "Item", next := 454366, root := ~, start := 453985, stop := 454365 ) ], count := [ "A", 4, 0, 10 ], name := "Row", next := 454379, root := ~, start := 453823, stop := 454378 ), rec( attributes := rec( ), content := 0, count := [ "A", 4, 0, 16 ], name := "HorLine", next := 454396, root := ~, start := 454386, stop := 454395 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ onnectedComponents", count := [ "A", 4, 0, 17 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 4, 0, 17 ], mathmode := "Text", name := "C", next := 454461, root := ~, start := 454435, stop := 454460 ), rec( content := "\n \ ", count := [ "A", 4, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 17 ], name := "Item", next := 454477, root := ~, start := 454418, stop := 454476 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ ConnectedComponents" ), content := 0, count := [ "A", 4, 0, 19 ], mathmode := "Text", name := "Ref", next := 454543, root := ~, start := 454503, stop := 454542 ), rec( content := "\n \ ", count := [ "A", 4, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 19 ], name := "Item", next := 454559, root := ~, start := 454486, stop := 454558 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n When applied to a simple di/graph,\n ", count := [ "A", 4, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "ConnectedComponents", count := [ "A", 4, 0, 21 ], mathmo\ de := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 21 ], mathmode := \ "Text", name := "C", next := 454688, root := ~, start := 454662, stop := 45468\ 7 ), rec( HTML := true, content := " in ", count := [ "A", 4, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 4, 0, 21 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 21 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 21 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 21 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 21 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 21 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 4, 0, 21 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "DigraphCon\ nectedComponents" ), content := 0, count := [ "A", 4, 0, 21 ], mathmode := "Te\ xt", name := "Ref", next := 454769, root := ~, start := 454729, stop := 454768\ ), rec( HTML := true, content := ".\n ", count := [ "A", 4, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digrap\ hConnectedComponents" ), content := 0, count := [ "A", 4, 0, 21 ], mathmode := \ "Text", name := "Ref", next := 454823, root := ~, start := 454783, stop := 4548\ 22 ), rec( HTML := true, content := " can also be applied to\n non-\ simple graphs (in the language of ", count := [ "A", 4, 0, 21 ], mathmode := "\ Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 4, 0, 21 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 21 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 21 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 21 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 21 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 21 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ ).\n ", count := [ "A", 4, 0, 21 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 4, 0, 21 ], name := "Alt", next := 454923, root := ~, start := 454585, stop := 454922 ), rec( content := "\n \ ", count := [ "A", 4, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 21 ], name := "Item", next := 454939, root := ~, start := 454568, stop := 454938 ) ], count := [ "A", 4, 0, 16 ], name := "Row", next := 454952, root := ~, start := 454404, stop := 454951 ), rec( attributes := rec( ), content := 0, count := [ "A", 4, 0, 22 ], name := "HorLine", next := 454969, root := ~, start := 454959, stop := 454968 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ icomponents", count := [ "A", 4, 0, 23 ], mathmode := "Text", name := "PCDATA" , root := ~ ) ], count := [ "A", 4, 0, 23 ], mathmode := "Text", name := "C", next := 455027, root := ~, start := 455008, stop := 455026 ), rec( content := "\n \ ", count := [ "A", 4, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 23 ], name := "Item", next := 455043, root := ~, start := 454991, stop := 455042 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ Bicomponents" ), content := 0, count := [ "A", 4, 0, 25 ], mathmode := "Text", name := "Ref", next := 455102, root := ~, start := 455069, stop := 455101 ), rec( content := "\n \ ", count := [ "A", 4, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 25 ], name := "Item", next := 455118, root := ~, start := 455052, stop := 455117 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n When applied to a simple bipartite di/graph,\n ", count := [ "A", 4, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Bicomponents", count := [ "A", 4, 0, 27 ], mathmode := "\ Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 27 ], mathmode := \ "Text", name := "C", next := 455250, root := ~, start := 455231, stop := 45524\ 9 ), rec( HTML := true, content := " in ", count := [ "A", 4, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 4, 0, 27 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 27 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 27 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 27 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 27 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 27 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 4, 0, 27 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "DigraphBic\ omponents" ), content := 0, count := [ "A", 4, 0, 27 ], mathmode := "Text", name := "Ref\ ", next := 455324, root := ~, start := 455291, stop := 455323 ), rec( HTML := true , content := "\ .\n The definition of ", count := [ "A", 4, 0, 27 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ), rec( attributes := rec( Prop := "IsBipart\ iteDigraph" ), content := 0, count := [ "A", 4, 0, 27 ], mathmode := "Text", name := "Ref\ ", next := 455388, root := ~, start := 455356, stop := 455387 ), rec( HTML := true , content := "\ does not require\n its argument to be simple (in the language of " , count := [ "A", 4, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 4, 0, 27 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 27 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 27 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 27 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 27 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 27 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ ), i.e. the\n bipartite graphs in ", count := [ "A", 4, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 4, 0, 27 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 27 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 27 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 27 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 27 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 27 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ are a proper subset of the bipartite\n digraphs in ", count := [ "A", 4, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 4, 0, 27 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 27 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 4, 0, 27 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 4, 0, 27 ], name := "Alt", next := 455612, root := ~, start := 455144, stop := 455611 ), rec( content := "\n \ ", count := [ "A", 4, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 27 ], name := "Item", next := 455628, root := ~, start := 455127, stop := 455627 ) ], count := [ "A", 4, 0, 22 ], name := "Row", next := 455641, root := ~, start := 454977, stop := 455640 ), rec( attributes := rec( ), content := 0, count := [ "A", 4, 0, 28 ], name := "HorLine", next := 455658, root := ~, start := 455648, stop := 455657 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ istanceSet", count := [ "A", 4, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 29 ], mathmode := "Text", name := "C", next := 455715, root := ~, start := 455697, stop := 455714 ), rec( content := "\n \ ", count := [ "A", 4, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 29 ], name := "Item", next := 455731, root := ~, start := 455680, stop := 455730 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a \ digraph, a pos int, and an int", Oper := "DigraphDistanceSet" ), content := 0, count := [ "A", 4, 0, 31 ], mathmode := "Text", name := "Ref", next := 455850, root := ~, start := 455759, stop := 455849 ), rec( content := "\n \ ", count := [ "A", 4, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 31 ], name := "Item", next := 455866, root := ~, start := 455740, stop := 455865 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 4, 0, 33 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "DistanceSet", count := [ "A", 4, 0, 33 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 33 ], mathmode := "Text", name := "C", next := 4559\ 40, root := ~, start := 455922, stop := 455939 ), rec( HTML := true, content := "\ in ", count := [ "A", 4, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 4, 0, 33 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 4, 0, 33 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 33 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 33 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 33 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 33 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 4, 0, 33 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for a dig\ raph, a pos int, and an int", Oper := "DigraphDistanceSet" ), content := 0, count := [ "A", 4, 0, 33 ], mathmode := \ "Text", name := "Ref", next := 456072, root := ~, start := 455981, stop := 4560\ 71 ), rec( HTML := true, content := " in ", count := [ "A", 4, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 4, 0, 33 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 33 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 4, 0, 33 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 4, 0, 33 ], name := "Alt", next := 456104, root := ~, start := 455892, stop := 456103 ), rec( content := "\n \ ", count := [ "A", 4, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 33 ], name := "Item", next := 456120, root := ~, start := 455875, stop := 456119 ) ], count := [ "A", 4, 0, 28 ], name := "Row", next := 456133, root := ~, start := 455666, stop := 456132 ), rec( attributes := rec( ), content := 0, count := [ "A", 4, 0, 34 ], name := "HorLine", next := 456150, root := ~, start := 456140, stop := 456149 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "L\ ayers", count := [ "A", 4, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 35 ], mathmode := "Text", name := "C", next := 456202, root := ~, start := 456189, stop := 456201 ), rec( content := "\n \ ", count := [ "A", 4, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 35 ], name := "Item", next := 456218, root := ~, start := 456172, stop := 456217 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 37 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Layers" ), content := 0, count := [ "A", 4, 0, 37 ], mathmode := "Text", name := "Ref", next := 456271, root := ~, start := 456244, stop := 456270 ), rec( content := "\n \ ", count := [ "A", 4, 0, 37 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 37 ], name := "Item", next := 456287, root := ~, start := 456227, stop := 456286 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "Layers", count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "C", next := 4563\ 56, root := ~, start := 456343, stop := 456355 ), rec( HTML := true, content := "\ in ", count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 39 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 39 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 39 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 4, 0, 39 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "DigraphLay\ ers" ), content := 0, count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "Ref\ ", next := 456424, root := ~, start := 456397, stop := 456423 ), rec( HTML := true , content := "\ in ", count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 4, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 39 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 4, 0, 39 ], name := "Alt", next := 456456, root := ~, start := 456313, stop := 456455 ), rec( content := "\n \ ", count := [ "A", 4, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 39 ], name := "Item", next := 456472, root := ~, start := 456296, stop := 456471 ) ], count := [ "A", 4, 0, 34 ], name := "Row", next := 456485, root := ~, start := 456158, stop := 456484 ), rec( attributes := rec( ), content := 0, count := [ "A", 4, 0, 40 ], name := "HorLine", next := 456502, root := ~, start := 456492, stop := 456501 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ ndependentSet", count := [ "A", 4, 0, 41 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 4, 0, 41 ], mathmode := "Text", name := "C", next := 456562, root := ~, start := 456541, stop := 456561 ), rec( content := "\n \ ", count := [ "A", 4, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 41 ], name := "Item", next := 456578, root := ~, start := 456524, stop := 456577 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 43 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ IndependentSet" ), content := 0, count := [ "A", 4, 0, 43 ], mathmode := "Text", name := "Ref", next := 456639, root := ~, start := 456604, stop := 456638 ), rec( content := "\n \ ", count := [ "A", 4, 0, 43 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 43 ], name := "Item", next := 456655, root := ~, start := 456587, stop := 456654 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "IndependentSet", count := [ "A", 4, 0, 45 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "C", next := 4567\ 32, root := ~, start := 456711, stop := 456731 ), rec( HTML := true, content := "\ in ", count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 4, 0, 45 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 4, 0, 45 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 4, 0, 45 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 4, 0, 45 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "DigraphInd\ ependentSet" ), content := 0, count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "Ref\ ", next := 456808, root := ~, start := 456773, stop := 456807 ), rec( HTML := true , content := "\ in ", count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 4, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 45 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 4, 0, 45 ], name := "Alt", next := 456840, root := ~, start := 456681, stop := 456839 ), rec( content := "\n \ ", count := [ "A", 4, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 45 ], name := "Item", next := 456856, root := ~, start := 456664, stop := 456855 ) ], count := [ "A", 4, 0, 40 ], name := "Row", next := 456869, root := ~, start := 456510, stop := 456868 ), rec( attributes := rec( ), content := 0, count := [ "A", 4, 0, 46 ], name := "HorLine", next := 456886, root := ~, start := 456876, stop := 456885 ) ], count := [ "A", 4, 0, 4 ], mathmode := "Text", name := "Table", next := 456900, root := ~, start := 453518, stop := 456899 ), rec( content := "\n\n ", count := [ "A", 4, 0, 47 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 4, 0, 1 ], mathmode := "Text", name := "Section", next := 456914, root := ~, start := 453280, stop := 456913 ), rec( content := "\n\n ", count := [ "A", 4, 0, 47 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ "A", 5, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n Functions to cons\ truct new graphs from old\n ", count := [ "A", 5, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 2 ], mathmode := "Text", name := "Heading", next := 457005, root := ~, start := 456932, stop := 457004 ), rec( content := "\n ", count := [ "A", 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "HTML" ), content := [ rec( content := "\n ", count := [ "A", 5, 0, 3 ], name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n The tab\ le in this section contains more information when viewed in\n html form\ at.\n ", count := [ "A", 5, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 3 ], name := "E", next := 457143, root := ~, start := 457033, stop := 457142 ), rec( content := "\n ", count := [ "A", 5, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 3 ], mathmode := "Text", name := "Alt", next := 457154, root := ~, start := 457010, stop := 457153 ), rec( content := "\n\n ", count := [ "A", 5, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Align := "|l|l|l|" ), content := [ rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 4 ], name := "HorLine", next := 457200, root := ~, start := 457190, stop := 457199 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ "A", 5, 0, 5 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 5 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 5, 0, 5 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ "A", 5, 0, 5 ], name\ := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 5 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ "A", 5, 0, 5 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " command\ \n ", count := [ "A", 5, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 5 ], name := "Item", next := 457270, root := ~, start := 457222, stop := 457269 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ "A", 5, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 7 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " command\ \n ", count := [ "A", 5, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 7 ], name := "Item", next := 457330, root := ~, start := 457279, stop := 457329 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Comments\n ", count := [ "A", 5, 0, 9 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 9 ], name := "Alt", next := 457411, root := ~, start := 457356, stop := 457410 ), rec( content := "\n \ ", count := [ "A", 5, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 9 ], name := "Item", next := 457427, root := ~, start := 457339, stop := 457426 ) ], count := [ "A", 5, 0, 4 ], name := "Row", next := 457440, root := ~, start := 457208, stop := 457439 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 10 ], name := "HorLine", next := 457457, root := ~, start := 457447, stop := 457456 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ nducedSubgraph", count := [ "A", 5, 0, 11 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 5, 0, 11 ], mathmode := "Text", name := "C", next := 457518, root := ~, start := 457496, stop := 457517 ), rec( content := "\n \ ", count := [ "A", 5, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 11 ], name := "Item", next := 457534, root := ~, start := 457479, stop := 457533 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Induced\ Subdigraph" ), content := 0, count := [ "A", 5, 0, 13 ], mathmode := "Text", name := "Ref", next := 457591, root := ~, start := 457560, stop := 457590 ), rec( content := "\n \ ", count := [ "A", 5, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 13 ], name := "Item", next := 457607, root := ~, start := 457543, stop := 457606 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 5, 0, 15 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( Oper := "InducedSubdigraph" ), content := 0 , count := [ "A", 5, 0, 15 ], mathmode := \ "Text", name := "Ref", next := 457694, root := ~, start := 457663, stop := 4576\ 93 ), rec( HTML := true, content := " in ", count := [ "A", 5, 0, 15 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 15 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 15 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ does not allow a third\n argument ", count := [ "A", 5, 0, 15 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "G", count := [ "A", 5, 0, 15 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 15 ], mathmode := "Text", name := "C", next := 4577\ 61, root := ~, start := 457753, stop := 457760 ), rec( HTML := true, content := "\ specifying a group of automorphisms on the\n resultant graph. This\ may be included in a future release.\n ", count := [ "A", 5, 0, 15 ] , mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 15 ], name := "Alt", next := 457892, root := ~, start := 457633, stop := 457891 ), rec( content := "\n \ ", count := [ "A", 5, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 15 ], name := "Item", next := 457908, root := ~, start := 457616, stop := 457907 ) ], count := [ "A", 5, 0, 10 ], name := "Row", next := 457921, root := ~, start := 457465, stop := 457920 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 16 ], name := "HorLine", next := 457938, root := ~, start := 457928, stop := 457937 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ istanceSetInduced", count := [ "A", 5, 0, 17 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 5, 0, 17 ], mathmode := "Text", name := "C", next := 458002, root := ~, start := 457977, stop := 458001 ), rec( content := "\n \ ", count := [ "A", 5, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 17 ], name := "Item", next := 458018, root := ~, start := 457960, stop := 458017 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 5, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 19 ], name := "Item", next := 458064, root := ~, start := 458027, stop := 458063 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n There is no analogous function in ", count := [ "A", 5, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 21 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 21 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , and no plans to\n include one.\n ", count := [ "A", 5, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 21 ], name := "Alt", next := 458223, root := ~, start := 458090, stop := 458222 ), rec( content := "\n \ ", count := [ "A", 5, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 21 ], name := "Item", next := 458239, root := ~, start := 458073, stop := 458238 ) ], count := [ "A", 5, 0, 16 ], name := "Row", next := 458252, root := ~, start := 457946, stop := 458251 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 22 ], name := "HorLine", next := 458269, root := ~, start := 458259, stop := 458268 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ istanceGraph", count := [ "A", 5, 0, 23 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 5, 0, 23 ], mathmode := "Text", name := "C", next := 458328, root := ~, start := 458308, stop := 458327 ), rec( content := "\n \ ", count := [ "A", 5, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 23 ], name := "Item", next := 458344, root := ~, start := 458291, stop := 458343 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graph and list", Oper := "DistanceDigraph" ), content := 0, count := [ "A", 5, 0, 25 ], mathmode := "Text", name := "Ref", next := 458428, root := ~, start := 458370, stop := 458427 ), rec( content := "\n \ ", count := [ "A", 5, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 25 ], name := "Item", next := 458444, root := ~, start := 458353, stop := 458443 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 5, 0, 27 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "DistanceGraph", count := [ "A", 5, 0, 27 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 27 ], mathmode := "Text", name := "C", next := 4585\ 20, root := ~, start := 458500, stop := 458519 ), rec( HTML := true, content := "\ in ", count := [ "A", 5, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 5, 0, 27 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 5, 0, 27 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 5, 0, 27 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 5, 0, 27 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 5, 0, 27 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 5, 0, 27 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 5, 0, 27 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for digra\ ph and list", Oper := "DistanceDigraph" ), content := 0, count := [ "A", 5, 0, 27 ], mathmode := \ "Text", name := "Ref", next := 458619, root := ~, start := 458561, stop := 4586\ 18 ), rec( HTML := true, content := " in\n ", count := [ "A", 5, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 27 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 27 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 5, 0, 27 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 5, 0, 27 ], name := "Alt", next := 458663, root := ~, start := 458470, stop := 458662 ), rec( content := "\n \ ", count := [ "A", 5, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 27 ], name := "Item", next := 458679, root := ~, start := 458453, stop := 458678 ) ], count := [ "A", 5, 0, 22 ], name := "Row", next := 458692, root := ~, start := 458277, stop := 458691 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 28 ], name := "HorLine", next := 458709, root := ~, start := 458699, stop := 458708 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ omplementGraph", count := [ "A", 5, 0, 29 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 5, 0, 29 ], mathmode := "Text", name := "C", next := 458770, root := ~, start := 458748, stop := 458769 ), rec( content := "\n \ ", count := [ "A", 5, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 29 ], name := "Item", next := 458786, root := ~, start := 458731, stop := 458785 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ Dual" ), content := 0, count := [ "A", 5, 0, 31 ], mathmode := "Text", name := "Ref", next := 458837, root := ~, start := 458812, stop := 458836 ), rec( content := "\n \ ", count := [ "A", 5, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 31 ], name := "Item", next := 458853, root := ~, start := 458795, stop := 458852 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 5, 0, 33 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( Oper := "DigraphDual" ), content := 0 , count := [ "A", 5, 0, 33 ], mathmode := \ "Text", name := "Ref", next := 458934, root := ~, start := 458909, stop := 4589\ 33 ), rec( HTML := true, content := " in ", count := [ "A", 5, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 33 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 33 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ is equivalent to\n ", count := [ "A", 5, 0, 33 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML \ := true, content := "ComplementGraph", count := [ "A", 5, 0, 33 ], mathmode :=\ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 33 ], mathmode := \ "Text", name := "C", next := 459000, root := ~, start := 458978, stop := 45899\ 9 ), rec( HTML := true, content := " in ", count := [ "A", 5, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 5, 0, 33 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 33 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 5, 0, 33 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 5, 0, 33 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 5, 0, 33 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 5, 0, 33 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ with the optional argument\n ", count := [ "A", 5, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "comploops", count := [ "A", 5, 0, 33 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 33 ], mathmode := "\ Text", name := "A", next := 459067, root := ~, start := 459051, stop := 459066\ ), rec( HTML := true, content := " set to ", count := [ "A", 5, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "true", count := [ "A", 5, 0, 33 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 33 ], mathmode := "Text", name := "K", next := 4590\ 86, root := ~, start := 459075, stop := 459085 ), rec( HTML := true, content := "\ (loops/nonloops are\n complemented).\n ", count := [ "A", 5, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 33 ], name := "Alt", next := 459150, root := ~, start := 458879, stop := 459149 ), rec( content := "\n \ ", count := [ "A", 5, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 33 ], name := "Item", next := 459166, root := ~, start := 458862, stop := 459165 ) ], count := [ "A", 5, 0, 28 ], name := "Row", next := 459179, root := ~, start := 458717, stop := 459178 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 34 ], name := "HorLine", next := 459196, root := ~, start := 459186, stop := 459195 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "P\ ointGraph", count := [ "A", 5, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 35 ], mathmode := "Text", name := "C", next := 459252, root := ~, start := 459235, stop := 459251 ), rec( content := "\n \ ", count := [ "A", 5, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 35 ], name := "Item", next := 459268, root := ~, start := 459218, stop := 459267 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 5, 0, 37 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 37 ], name := "Item", next := 459314, root := ~, start := 459277, stop := 459313 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n There is no analogous function in ", count := [ "A", 5, 0, 39 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 39 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 39 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , and no plans to\n include one.\n ", count := [ "A", 5, 0, 39 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 39 ], name := "Alt", next := 459473, root := ~, start := 459340, stop := 459472 ), rec( content := "\n \ ", count := [ "A", 5, 0, 39 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 39 ], name := "Item", next := 459489, root := ~, start := 459323, stop := 459488 ) ], count := [ "A", 5, 0, 34 ], name := "Row", next := 459502, root := ~, start := 459204, stop := 459501 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 40 ], name := "HorLine", next := 459519, root := ~, start := 459509, stop := 459518 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "E\ dgeGraph", count := [ "A", 5, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 41 ], mathmode := "Text", name := "C", next := 459574, root := ~, start := 459558, stop := 459573 ), rec( content := "\n \ ", count := [ "A", 5, 0, 41 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 41 ], name := "Item", next := 459590, root := ~, start := 459541, stop := 459589 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 43 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "EdgeUnd\ irectedDigraph" ), content := 0, count := [ "A", 5, 0, 43 ], mathmode := "Text", name := "Ref", next := 459651, root := ~, start := 459616, stop := 459650 ), rec( content := "\n \ ", count := [ "A", 5, 0, 43 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 43 ], name := "Item", next := 459667, root := ~, start := 459599, stop := 459666 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "EdgeGraph", count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "P\ CDATA", root := ~ ) ], count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "C", next := 4597\ 39, root := ~, start := 459723, stop := 459738 ), rec( HTML := true, content := "\ in ", count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 5, 0, 45 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 5, 0, 45 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 5, 0, 45 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 5, 0, 45 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "EdgeUndire\ ctedDigraph" ), content := 0, count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "Ref\ ", next := 459815, root := ~, start := 459780, stop := 459814 ), rec( HTML := true , content := "\ in ", count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 5, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 45 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 5, 0, 45 ], name := "Alt", next := 459847, root := ~, start := 459693, stop := 459846 ), rec( content := "\n \ ", count := [ "A", 5, 0, 45 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 45 ], name := "Item", next := 459863, root := ~, start := 459676, stop := 459862 ) ], count := [ "A", 5, 0, 40 ], name := "Row", next := 459876, root := ~, start := 459527, stop := 459875 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 46 ], name := "HorLine", next := 459893, root := ~, start := 459883, stop := 459892 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 47 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "S\ witchedGraph", count := [ "A", 5, 0, 47 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 5, 0, 47 ], mathmode := "Text", name := "C", next := 459952, root := ~, start := 459932, stop := 459951 ), rec( content := "\n \ ", count := [ "A", 5, 0, 47 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 47 ], name := "Item", next := 459968, root := ~, start := 459915, stop := 459967 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 5, 0, 49 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 49 ], name := "Item", next := 460014, root := ~, start := 459977, stop := 460013 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n There is no analogous function in ", count := [ "A", 5, 0, 51 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 51 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 51 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , and no plans to\n include one.\n ", count := [ "A", 5, 0, 51 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 51 ], name := "Alt", next := 460173, root := ~, start := 460040, stop := 460172 ), rec( content := "\n \ ", count := [ "A", 5, 0, 51 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 51 ], name := "Item", next := 460189, root := ~, start := 460023, stop := 460188 ) ], count := [ "A", 5, 0, 46 ], name := "Row", next := 460202, root := ~, start := 459901, stop := 460201 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 52 ], name := "HorLine", next := 460219, root := ~, start := 460209, stop := 460218 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 53 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "U\ nderlyingGraph", count := [ "A", 5, 0, 53 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 5, 0, 53 ], mathmode := "Text", name := "C", next := 460280, root := ~, start := 460258, stop := 460279 ), rec( content := "\n \ ", count := [ "A", 5, 0, 53 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 53 ], name := "Item", next := 460296, root := ~, start := 460241, stop := 460295 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 55 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digraph\ SymmetricClosure" ), content := 0, count := [ "A", 5, 0, 55 ], mathmode := "Text", name := "Ref", next := 460359, root := ~, start := 460322, stop := 460358 ), rec( content := "\n \ ", count := [ "A", 5, 0, 55 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 55 ], name := "Item", next := 460375, root := ~, start := 460305, stop := 460374 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "UnderlyingGraph", count := [ "A", 5, 0, 57 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "C", next := 4604\ 53, root := ~, start := 460431, stop := 460452 ), rec( HTML := true, content := "\ in ", count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 5, 0, 57 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 5, 0, 57 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 5, 0, 57 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 5, 0, 57 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "DigraphSym\ metricClosure" ), content := 0, count := [ "A", 5, 0, 57 ], mathmode := "Text" , name := "Ref\ ", next := 460531, root := ~, start := 460494, stop := 460530 ), rec( HTML := true , content := "\ in ", count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 5, 0, 57 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 57 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 5, 0, 57 ], name := "Alt", next := 460563, root := ~, start := 460401, stop := 460562 ), rec( content := "\n \ ", count := [ "A", 5, 0, 57 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 57 ], name := "Item", next := 460579, root := ~, start := 460384, stop := 460578 ) ], count := [ "A", 5, 0, 52 ], name := "Row", next := 460592, root := ~, start := 460227, stop := 460591 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 58 ], name := "HorLine", next := 460609, root := ~, start := 460599, stop := 460608 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 59 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "Q\ uotientGraph", count := [ "A", 5, 0, 59 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 5, 0, 59 ], mathmode := "Text", name := "C", next := 460668, root := ~, start := 460648, stop := 460667 ), rec( content := "\n \ ", count := [ "A", 5, 0, 59 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 59 ], name := "Item", next := 460684, root := ~, start := 460631, stop := 460683 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 61 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Quotien\ tDigraph" ), content := 0, count := [ "A", 5, 0, 61 ], mathmode := "Text", name := "Ref", next := 460739, root := ~, start := 460710, stop := 460738 ), rec( content := "\n \ ", count := [ "A", 5, 0, 61 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 61 ], name := "Item", next := 460755, root := ~, start := 460693, stop := 460754 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 63 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 5, 0, 63 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( Oper := "QuotientDigraph" ), content := 0 , count := [ "A", 5, 0, 63 ], mathmode := \ "Text", name := "Ref", next := 460840, root := ~, start := 460811, stop := 4608\ 39 ), rec( HTML := true, content := " in ", count := [ "A", 5, 0, 63 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 63 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 63 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ takes a partition\n ", count := [ "A", 5, 0, 63 ], mathmode := "Te\ xt", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML \ := true, content := "p", count := [ "A", 5, 0, 63 ], mathmode := "Text", name \ := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 63 ], mathmode := "Text", name := "C", next := 4608\ 93, root := ~, start := 460885, stop := 460892 ), rec( HTML := true, content := "\ of the vertices of the digraph, rather than a set of\n generating \ pairs. Hence, the equivalence might not be\n group-invariant. Als\ o note that in ", count := [ "A", 5, 0, 63 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "Digraphs", count := [ "A", 5, 0, 63 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ "A", 5, 0, 63 ], mathmode := "Text", name := "Pac\ kage", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true, content := "\ multiple edges may be\n created, whereas in ", count := [ "A", 5, 0, 63 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 5, 0, 63 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 63 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 5, 0, 63 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 5, 0, 63 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 5, 0, 63 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 5, 0, 63 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ they are effectively combined into a\n single edge.\n ", count := [ "A", 5, 0, 63 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 63 ], name := "Alt", next := 461213, root := ~, start := 460781, stop := 461212 ), rec( content := "\n \ ", count := [ "A", 5, 0, 63 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 63 ], name := "Item", next := 461229, root := ~, start := 460764, stop := 461228 ) ], count := [ "A", 5, 0, 58 ], name := "Row", next := 461242, root := ~, start := 460617, stop := 461241 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 64 ], name := "HorLine", next := 461259, root := ~, start := 461249, stop := 461258 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 65 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "B\ ipartiteDouble", count := [ "A", 5, 0, 65 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 5, 0, 65 ], mathmode := "Text", name := "C", next := 461320, root := ~, start := 461298, stop := 461319 ), rec( content := "\n \ ", count := [ "A", 5, 0, 65 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 65 ], name := "Item", next := 461336, root := ~, start := 461281, stop := 461335 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 67 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Biparti\ teDoubleDigraph" ), content := 0, count := [ "A", 5, 0, 67 ], mathmode := "Text", name := "Ref", next := 461398, root := ~, start := 461362, stop := 461397 ), rec( content := "\n \ ", count := [ "A", 5, 0, 67 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 67 ], name := "Item", next := 461414, root := ~, start := 461345, stop := 461413 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "BipartiteDouble", count := [ "A", 5, 0, 69 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "C", next := 4614\ 92, root := ~, start := 461470, stop := 461491 ), rec( HTML := true, content := "\ in ", count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 5, 0, 69 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 5, 0, 69 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 5, 0, 69 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 5, 0, 69 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "BipartiteD\ oubleDigraph" ), content := 0, count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "Ref\ ", next := 461569, root := ~, start := 461533, stop := 461568 ), rec( HTML := true , content := "\ in ", count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 5, 0, 69 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 69 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 5, 0, 69 ], name := "Alt", next := 461601, root := ~, start := 461440, stop := 461600 ), rec( content := "\n \ ", count := [ "A", 5, 0, 69 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 69 ], name := "Item", next := 461617, root := ~, start := 461423, stop := 461616 ) ], count := [ "A", 5, 0, 64 ], name := "Row", next := 461630, root := ~, start := 461267, stop := 461629 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 70 ], name := "HorLine", next := 461647, root := ~, start := 461637, stop := 461646 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 71 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ eodesicsGraph", count := [ "A", 5, 0, 71 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 5, 0, 71 ], mathmode := "Text", name := "C", next := 461707, root := ~, start := 461686, stop := 461706 ), rec( content := "\n \ ", count := [ "A", 5, 0, 71 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 71 ], name := "Item", next := 461723, root := ~, start := 461669, stop := 461722 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 5, 0, 73 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 73 ], name := "Item", next := 461769, root := ~, start := 461732, stop := 461768 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 75 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n There is no analogous function in ", count := [ "A", 5, 0, 75 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 75 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 75 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , and no plans to\n include one.\n ", count := [ "A", 5, 0, 75 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 75 ], name := "Alt", next := 461928, root := ~, start := 461795, stop := 461927 ), rec( content := "\n \ ", count := [ "A", 5, 0, 75 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 75 ], name := "Item", next := 461944, root := ~, start := 461778, stop := 461943 ) ], count := [ "A", 5, 0, 70 ], name := "Row", next := 461957, root := ~, start := 461655, stop := 461956 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 76 ], name := "HorLine", next := 461974, root := ~, start := 461964, stop := 461973 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 77 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ollapsedIndependentOrbitsGraph", count := [ "A", 5, 0, 77 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 77 ], mathmode := "Text", name := "C", next := 462051, root := ~, start := 462013, stop := 462050 ), rec( content := "\n \ ", count := [ "A", 5, 0, 77 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 77 ], name := "Item", next := 462067, root := ~, start := 461996, stop := 462066 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 5, 0, 79 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 79 ], name := "Item", next := 462113, root := ~, start := 462076, stop := 462112 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 81 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n There is no analogous function in ", count := [ "A", 5, 0, 81 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 81 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 81 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , although this feature\n might be implemented in the future.\n \ ", count := [ "A", 5, 0, 81 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 81 ], name := "Alt", next := 462301, root := ~, start := 462139, stop := 462300 ), rec( content := "\n \ ", count := [ "A", 5, 0, 81 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 81 ], name := "Item", next := 462317, root := ~, start := 462122, stop := 462316 ) ], count := [ "A", 5, 0, 76 ], name := "Row", next := 462330, root := ~, start := 461982, stop := 462329 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 82 ], name := "HorLine", next := 462347, root := ~, start := 462337, stop := 462346 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 83 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ollapsedCompleteOrbitsGraph", count := [ "A", 5, 0, 83 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 5, 0, 83 ], mathmode := "Text", name := "C", next := 462421, root := ~, start := 462386, stop := 462420 ), rec( content := "\n \ ", count := [ "A", 5, 0, 83 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 83 ], name := "Item", next := 462437, root := ~, start := 462369, stop := 462436 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 5, 0, 85 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 85 ], name := "Item", next := 462483, root := ~, start := 462446, stop := 462482 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 87 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n There is no analogous function in ", count := [ "A", 5, 0, 87 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 87 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 87 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , although this feature\n might be implemented in the future.\n \ ", count := [ "A", 5, 0, 87 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 87 ], name := "Alt", next := 462671, root := ~, start := 462509, stop := 462670 ), rec( content := "\n \ ", count := [ "A", 5, 0, 87 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 87 ], name := "Item", next := 462687, root := ~, start := 462492, stop := 462686 ) ], count := [ "A", 5, 0, 82 ], name := "Row", next := 462700, root := ~, start := 462355, stop := 462699 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 88 ], name := "HorLine", next := 462717, root := ~, start := 462707, stop := 462716 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 89 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "N\ ewGroupGraph", count := [ "A", 5, 0, 89 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 5, 0, 89 ], mathmode := "Text", name := "C", next := 462776, root := ~, start := 462756, stop := 462775 ), rec( content := "\n \ ", count := [ "A", 5, 0, 89 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 89 ], name := "Item", next := 462792, root := ~, start := 462739, stop := 462791 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 5, 0, 91 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 91 ], name := "Item", next := 462838, root := ~, start := 462801, stop := 462837 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 5, 0, 93 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n There is no analogous function in ", count := [ "A", 5, 0, 93 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 5, 0, 93 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 93 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ . However, the same\n results would be possible by calling ", count := [ "A", 5, 0, 93 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Oper := "Digrap\ hCopy" ), content := 0, count := [ "A", 5, 0, 93 ], mathmode := "Text", name := "Ref\ ", next := 463033, root := ~, start := 463008, stop := 463032 ), rec( HTML := true , content := "\ on\n the digraph to produce a copy ", count := [ "A", 5, 0, 93 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "gr", count := [ "A", 5, 0, 93 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 93 ], mathmode := "Text", name := "C", next := 4630\ 88, root := ~, start := 463079, stop := 463087 ), rec( HTML := true, content := "\ , and then applying\n ", count := [ "A", 5, 0, 93 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML \ := true, content := "SetDigraphGroup(gr, G)", count := [ "A", 5, 0, 93 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 93 ], mathmode := \ "Text", name := "C", next := 463149, root := ~, start := 463120, stop := 46314\ 8 ), rec( HTML := true, content := ".\n ", count := [ "A", 5, 0, 93 ] , mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 93 ], name := "Alt", next := 463167, root := ~, start := 462864, stop := 463166 ), rec( content := "\n \ ", count := [ "A", 5, 0, 93 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 93 ], name := "Item", next := 463183, root := ~, start := 462847, stop := 463182 ) ], count := [ "A", 5, 0, 88 ], name := "Row", next := 463196, root := ~, start := 462725, stop := 463195 ), rec( attributes := rec( ), content := 0, count := [ "A", 5, 0, 94 ], name := "HorLine", next := 463213, root := ~, start := 463203, stop := 463212 ) ], count := [ "A", 5, 0, 4 ], mathmode := "Text", name := "Table", next := 463227, root := ~, start := 457160, stop := 463226 ), rec( content := "\n\n ", count := [ "A", 5, 0, 95 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 5, 0, 1 ], mathmode := "Text", name := "Section", next := 463241, root := ~, start := 456918, stop := 463240 ), rec( content := "\n\n ", count := [ "A", 5, 0, 95 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ "A", 6, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n Vertex-Colouring \ and Complete Subgraphs\n ", count := [ "A", 6, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 2 ], mathmode := "Text", name := "Heading", next := 463329, root := ~, start := 463259, stop := 463328 ), rec( content := "\n ", count := [ "A", 6, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "HTML" ), content := [ rec( content := "\n ", count := [ "A", 6, 0, 3 ], name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n The tab\ le in this section contains more information when viewed in\n html form\ at.\n ", count := [ "A", 6, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 3 ], name := "E", next := 463467, root := ~, start := 463357, stop := 463466 ), rec( content := "\n ", count := [ "A", 6, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 3 ], mathmode := "Text", name := "Alt", next := 463478, root := ~, start := 463334, stop := 463477 ), rec( content := "\n\n ", count := [ "A", 6, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Align := "|l|l|l|" ), content := [ rec( attributes := rec( ), content := 0, count := [ "A", 6, 0, 4 ], name := "HorLine", next := 463524, root := ~, start := 463514, stop := 463523 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ "A", 6, 0, 5 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 5 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 6, 0, 5 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ "A", 6, 0, 5 ], name\ := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 5 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ "A", 6, 0, 5 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " command\ \n ", count := [ "A", 6, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 5 ], name := "Item", next := 463594, root := ~, start := 463546, stop := 463593 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ "A", 6, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 7 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " command\ \n ", count := [ "A", 6, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 7 ], name := "Item", next := 463654, root := ~, start := 463603, stop := 463653 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Comments\n ", count := [ "A", 6, 0, 9 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 9 ], name := "Alt", next := 463735, root := ~, start := 463680, stop := 463734 ), rec( content := "\n \ ", count := [ "A", 6, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 9 ], name := "Item", next := 463751, root := ~, start := 463663, stop := 463750 ) ], count := [ "A", 6, 0, 4 ], name := "Row", next := 463764, root := ~, start := 463532, stop := 463763 ), rec( attributes := rec( ), content := 0, count := [ "A", 6, 0, 10 ], name := "HorLine", next := 463781, root := ~, start := 463771, stop := 463780 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "V\ ertexColouring", count := [ "A", 6, 0, 11 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ) ], count := [ "A", 6, 0, 11 ], mathmode := "Text", name := "C", next := 463842, root := ~, start := 463820, stop := 463841 ), rec( content := "\n \ ", count := [ "A", 6, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 11 ], name := "Item", next := 463858, root := ~, start := 463803, stop := 463857 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Digraph\ GreedyColouring", Label := "for a digraph" ), content := 0, count := [ "A", 6, 0, 13 ], mathmode := "Text", name := "Ref", next := 463942, root := ~, start := 463884, stop := 463941 ), rec( content := "\n \ ", count := [ "A", 6, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 13 ], name := "Item", next := 463958, root := ~, start := 463867, stop := 463957 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "VertexColouring", count := [ "A", 6, 0, 15 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "C", next := 4640\ 36, root := ~, start := 464014, stop := 464035 ), rec( HTML := true, content := "\ in ", count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 6, 0, 15 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 6, 0, 15 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 6, 0, 15 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to ", count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Attr := "DigraphGreedyColouring", Label :=\ "for a digraph" ), content := 0, count := [ "A", 6, 0, 15 ], mathmode := "Tex\ t", name := "Ref", next := 464135, root := ~, start := 464065, stop := 464134 ), rec( HTML := true , content := "\ in ", count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 6, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 15 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ ,\n except it returns a transformation rather than a list of vertex\ \n colors.\n ", count := [ "A", 6, 0, 15 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 15 ], name := "Alt", next := 464263, root := ~, start := 463984, stop := 464262 ), rec( content := "\n \ ", count := [ "A", 6, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 15 ], name := "Item", next := 464279, root := ~, start := 463967, stop := 464278 ) ], count := [ "A", 6, 0, 10 ], name := "Row", next := 464292, root := ~, start := 463789, stop := 464291 ), rec( attributes := rec( ), content := 0, count := [ "A", 6, 0, 16 ], name := "HorLine", next := 464309, root := ~, start := 464299, stop := 464308 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ompleteSubgraphs", count := [ "A", 6, 0, 17 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 6, 0, 17 ], mathmode := "Text", name := "C", next := 464372, root := ~, start := 464348, stop := 464371 ), rec( content := "\n \ ", count := [ "A", 6, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 17 ], name := "Item", next := 464388, root := ~, start := 464331, stop := 464387 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ Cliques" ), content := 0, count := [ "A", 6, 0, 19 ], mathmode := "Text", name := "Ref", next := 464442, root := ~, start := 464414, stop := 464441 ), rec( content := "\n \ ", count := [ "A", 6, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 19 ], name := "Item", next := 464458, root := ~, start := 464397, stop := 464457 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n The functionality of ", count := [ "A", 6, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "CompleteSubgraphs", count := [ "A", 6, 0, 21 ], mathmode\ := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 21 ], mathmode := \ "Text", name := "C", next := 464559, root := ~, start := 464535, stop := 46455\ 8 ), rec( HTML := true, content := " in ", count := [ "A", 6, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 6, 0, 21 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 21 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 6, 0, 21 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 6, 0, 21 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 6, 0, 21 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 6, 0, 21 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is provided\n by ", count := [ "A", 6, 0, 21 ], mathmode := "Text" , name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Func := "DigraphCliques" ), content := 0 , count := [ "A", 6, 0, 21 ], mathmode := \ "Text", name := "Ref", next := 464626, root := ~, start := 464598, stop := 4646\ 25 ), rec( HTML := true, content := " and ", count := [ "A", 6, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digrap\ hMaximalCliques" ), content := 0, count := [ "A", 6, 0, 21 ], mathmode := "Tex\ t", name := "Ref", next := 464666, root := ~, start := 464631, stop := 464665 ), rec( HTML := true , content := "\ \n in ", count := [ "A", 6, 0, 21 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "Digraphs", count := [ "A", 6, 0, 21 ], mathmode := "Text", name := "PC\ DATA", root := ~ ) ], count := [ "A", 6, 0, 21 ], mathmode := "Text", name := "Pac\ kage", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true, content := "\ .\n ", count := [ "A", 6, 0, 21 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 6, 0, 21 ], name := "Alt", next := 464710, root := ~, start := 464484, stop := 464709 ), rec( content := "\n \ ", count := [ "A", 6, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 21 ], name := "Item", next := 464726, root := ~, start := 464467, stop := 464725 ) ], count := [ "A", 6, 0, 16 ], name := "Row", next := 464739, root := ~, start := 464317, stop := 464738 ), rec( attributes := rec( ), content := 0, count := [ "A", 6, 0, 22 ], name := "HorLine", next := 464756, root := ~, start := 464746, stop := 464755 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "C\ ompleteSubgraphsOfGivenSize", count := [ "A", 6, 0, 23 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 6, 0, 23 ], mathmode := "Text", name := "C", next := 464830, root := ~, start := 464795, stop := 464829 ), rec( content := "\n \ ", count := [ "A", 6, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 23 ], name := "Item", next := 464846, root := ~, start := 464778, stop := 464845 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digraph\ Cliques" ), content := 0, count := [ "A", 6, 0, 25 ], mathmode := "Text", name := "Ref", next := 464900, root := ~, start := 464872, stop := 464899 ), rec( content := "\n \ ", count := [ "A", 6, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 25 ], name := "Item", next := 464916, root := ~, start := 464855, stop := 464915 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 6, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Much of the functionality of ", count := [ "A", 6, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "CompleteSubgraphsOfGivenSize", count := [ "A", 6, 0, 27 ] , math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 27 ], mathmode := \ "Text", name := "C", next := 465036, root := ~, start := 465001, stop := 46503\ 5 ), rec( HTML := true, content := " in\n ", count := [ "A", 6, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ) , content := [ rec( attr\ ibutes := rec( Text := "Grape" ), content := [ rec( HTML := true, content := "\ http://www.maths.qmul.ac.uk/~leonard/grape/", count := [ "A", 6, 0, 27 ], math\ mode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 27 ], math\ mode := "Text", name := "URL", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 6, 0, 27 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 6, 0, 27 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 6, 0, 27 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 6, 0, 27 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is provided by ", count := [ "A", 6, 0, 27 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Func := "DigraphCliques" ), content := 0 , count := [ "A", 6, 0, 27 ], mathmode := \ "Text", name := "Ref", next := 465103, root := ~, start := 465075, stop := 4651\ 02 ), rec( HTML := true, content := " and ", count := [ "A", 6, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Func := "Digrap\ hMaximalCliques" ), content := 0, count := [ "A", 6, 0, 27 ], mathmode := "Tex\ t", name := "Ref", next := 465157, root := ~, start := 465108, stop := 465156 ), rec( HTML := true , content := "\ in ", count := [ "A", 6, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( ), content := [ rec( HTML := true, content := "Digraphs", count := [ "\ A", 6, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 27 ], mathmode := \ "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , except that the\n functionality relating to vertex weights and pa\ rtial colourings is\n not implemented.\n ", count := [ "A", 6, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 27 ], name := "Alt", next := 465313, root := ~, start := 464942, stop := 465312 ), rec( content := "\n \ ", count := [ "A", 6, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 27 ], name := "Item", next := 465329, root := ~, start := 464925, stop := 465328 ) ], count := [ "A", 6, 0, 22 ], name := "Row", next := 465342, root := ~, start := 464764, stop := 465341 ), rec( attributes := rec( ), content := 0, count := [ "A", 6, 0, 28 ], name := "HorLine", next := 465359, root := ~, start := 465349, stop := 465358 ) ], count := [ "A", 6, 0, 4 ], mathmode := "Text", name := "Table", next := 465373, root := ~, start := 463484, stop := 465372 ), rec( content := "\n ", count := [ "A", 6, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 6, 0, 1 ], mathmode := "Text", name := "Section", next := 465386, root := ~, start := 463245, stop := 465385 ), rec( content := "\n\n ", count := [ "A", 6, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n ", count := [ "A", 7, 0, 1 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n Automorphism grou\ ps and isomorphism testing for graphs\n ", count := [ "A", 7, 0, 2 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 2 ], mathmode := "Text", name := "Heading", next := 465489, root := ~, start := 465404, stop := 465488 ), rec( content := "\n ", count := [ "A", 7, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "HTML" ), content := [ rec( content := "\n ", count := [ "A", 7, 0, 3 ], name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "\n The tab\ le in this section contains more information when viewed in\n html form\ at.\n ", count := [ "A", 7, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 3 ], name := "E", next := 465627, root := ~, start := 465517, stop := 465626 ), rec( content := "\n ", count := [ "A", 7, 0, 3 ], name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 3 ], mathmode := "Text", name := "Alt", next := 465638, root := ~, start := 465494, stop := 465637 ), rec( content := "\n\n ", count := [ "A", 7, 0, 3 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Align := "|l|l|l|" ), content := [ rec( attributes := rec( ), content := 0, count := [ "A", 7, 0, 4 ], name := "HorLine", next := 465684, root := ~, start := 465674, stop := 465683 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Not := "Text" ), content := [ rec( attributes :=\ rec( Text := "Grape" ), content := [ rec( content := "http://www.maths.qmul.a\ c.uk/~leonard/grape/", count := [ "A", 7, 0, 5 ], mathmode := "Text", name := \ "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 5 ], mathmode := "Text", name := "URL\ ", next := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 7, 0, 5 ], name := "Alt", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := "Text" ) , content := [ rec( attributes :=\ rec( ), content := [ rec( content := "Grape", count := [ "A", 7, 0, 5 ], name\ := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 5 ], name := "Package", next := 137, root := ~, start := 113 , stop := 136 ) ], count := [ "A", 7, 0, 5 ], mathmode := "Text", name := "Alt", next := 143, root := ~, start := 93, stop := 142 ), rec( content := " command\ \n ", count := [ "A", 7, 0, 5 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 5 ], name := "Item", next := 465754, root := ~, start := 465706, stop := 465753 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "D\ igraphs", count := [ "A", 7, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 7 ], mathmode := "Text", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( content := " command\ \n ", count := [ "A", 7, 0, 7 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 7 ], name := "Item", next := 465814, root := ~, start := 465763, stop := 465813 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n Comments\n ", count := [ "A", 7, 0, 9 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 9 ], name := "Alt", next := 465895, root := ~, start := 465840, stop := 465894 ), rec( content := "\n \ ", count := [ "A", 7, 0, 9 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 9 ], name := "Item", next := 465911, root := ~, start := 465823, stop := 465910 ) ], count := [ "A", 7, 0, 4 ], name := "Row", next := 465924, root := ~, start := 465692, stop := 465923 ), rec( attributes := rec( ), content := 0, count := [ "A", 7, 0, 10 ], name := "HorLine", next := 465941, root := ~, start := 465931, stop := 465940 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "A\ utGroupGraph", count := [ "A", 7, 0, 11 ], mathmode := "Text", name := "PCDATA\ ", root := ~ ) ], count := [ "A", 7, 0, 11 ], mathmode := "Text", name := "C", next := 466000, root := ~, start := 465980, stop := 465999 ), rec( content := "\n \ ", count := [ "A", 7, 0, 11 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 11 ], name := "Item", next := 466016, root := ~, start := 465963, stop := 466015 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automor\ phismGroup", Label := "for a digraph" ), content := 0, count := [ "A", 7, 0, 13 ], mathmode := "Text", name := "Ref", next := 466095, root := ~, start := 466042, stop := 466094 ), rec( content := "\n \ ", count := [ "A", 7, 0, 13 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 13 ], name := "Item", next := 466111, root := ~, start := 466025, stop := 466110 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 7, 0, 15 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "AutGroupGraph", count := [ "A", 7, 0, 15 ], mathmode := "Text", name :\ = "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 15 ], mathmode := "Text", name := "C", next := 4661\ 87, root := ~, start := 466167, stop := 466186 ), rec( HTML := true, content := "\ in ", count := [ "A", 7, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 7, 0, 15 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 7, 0, 15 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 7, 0, 15 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 7, 0, 15 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 7, 0, 15 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 7, 0, 15 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to\n ", count := [ "A", 7, 0, 15 ], mathmode := "Tex\ t", name := "PCDATA", root := ~ ), rec( attributes := rec( Attr := "Automorphi\ smGroup", Label := "for a digraph" ), content := 0, count := [ "A", 7, 0, 15 ] , mathmode := \ "Text", name := "Ref", next := 466281, root := ~, start := 466228, stop := 4662\ 80 ), rec( HTML := true, content := " in ", count := [ "A", 7, 0, 15 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 7, 0, 15 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 15 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n ", count := [ "A", 7, 0, 15 ], mathmode := "Text", name := "PCDAT\ A", root := ~ ) ], count := [ "A", 7, 0, 15 ], name := "Alt", next := 466313, root := ~, start := 466137, stop := 466312 ), rec( content := "\n \ ", count := [ "A", 7, 0, 15 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 15 ], name := "Item", next := 466329, root := ~, start := 466120, stop := 466328 ) ], count := [ "A", 7, 0, 10 ], name := "Row", next := 466342, root := ~, start := 465949, stop := 466341 ), rec( attributes := rec( ), content := 0, count := [ "A", 7, 0, 16 ], name := "HorLine", next := 466359, root := ~, start := 466349, stop := 466358 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ raphIsomorphism", count := [ "A", 7, 0, 17 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 7, 0, 17 ], mathmode := "Text", name := "C", next := 466421, root := ~, start := 466398, stop := 466420 ), rec( content := "\n \ ", count := [ "A", 7, 0, 17 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 17 ], name := "Item", next := 466437, root := ~, start := 466381, stop := 466436 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs", Oper := "IsomorphismDigraphs" ), content := 0, count := [ "A", 7, 0, 19 ], mathmode := "Text", name := "Ref", next := 466517, root := ~, start := 466463, stop := 466516 ), rec( content := "\n \ ", count := [ "A", 7, 0, 19 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 19 ], name := "Item", next := 466533, root := ~, start := 466446, stop := 466532 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "GraphIsomorphism", count := [ "A", 7, 0, 21 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "C", next := 4666\ 12, root := ~, start := 466589, stop := 466611 ), rec( HTML := true, content := "\ in ", count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 7, 0, 21 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 7, 0, 21 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 7, 0, 21 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to ", count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Label := "for digraphs", Oper := "I\ somorphismDigraphs" ), content := 0, count := [ "A", 7, 0, 21 ], mathmode := "\ Text", name := "Ref", next := 466707, root := ~, start := 466641, stop := 4667\ 06 ), rec( HTML := true, content := " in ", count := [ "A", 7, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 7, 0, 21 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 21 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n Note however that ", count := [ "A", 7, 0, 21 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML \ := true, content := "GraphIsomorphism", count := [ "A", 7, 0, 21 ], mathmode :\ = "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 21 ], mathmode := \ "Text", name := "C", next := 466776, root := ~, start := 466753, stop := 46677\ 5 ), rec( HTML := true, content := "'s optional argument\n ", count := [ "A", 7, 0, 21 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "firstunbindcanon", count := [ "A", 7, 0, 21 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 21 ], mathmode := \ "Text", name := "A", next := 466832, root := ~, start := 466809, stop := 46683\ 1 ), rec( HTML := true, content := " is not applicable, since the canonical\n \ labellings of a digraph are not portable between sessions.\n \ ", count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 21 ], name := "Alt", next := 466959, root := ~, start := 466559, stop := 466958 ), rec( content := "\n \ ", count := [ "A", 7, 0, 21 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 21 ], name := "Item", next := 466975, root := ~, start := 466542, stop := 466974 ) ], count := [ "A", 7, 0, 16 ], name := "Row", next := 466988, root := ~, start := 466367, stop := 466987 ), rec( attributes := rec( ), content := 0, count := [ "A", 7, 0, 22 ], name := "HorLine", next := 467005, root := ~, start := 466995, stop := 467004 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "I\ sIsomorphicGraph", count := [ "A", 7, 0, 23 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ) ], count := [ "A", 7, 0, 23 ], mathmode := "Text", name := "C", next := 467068, root := ~, start := 467044, stop := 467067 ), rec( content := "\n \ ", count := [ "A", 7, 0, 23 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 23 ], name := "Item", next := 467084, root := ~, start := 467027, stop := 467083 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Label := "for di\ graphs", Oper := "IsIsomorphicDigraph" ), content := 0, count := [ "A", 7, 0, 25 ], mathmode := "Text", name := "Ref", next := 467164, root := ~, start := 467110, stop := 467163 ), rec( content := "\n \ ", count := [ "A", 7, 0, 25 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 25 ], name := "Item", next := 467180, root := ~, start := 467093, stop := 467179 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n ", count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "PCDA\ TA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML := true, cont\ ent := "IsIsomorphicGraph", count := [ "A", 7, 0, 27 ], mathmode := "Text", name\ := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "C", next := 4672\ 60, root := ~, start := 467236, stop := 467259 ), rec( HTML := true, content := "\ in ", count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes :\ = rec( Not := "Text" ), content := [ rec( attributes := rec( Text := "Grape" ) , cont\ ent := [ rec( HTML := true, content := "http://www.maths.qmul.ac.uk/~leonard/g\ rape/", count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "PCDATA", root\ := ~ ) ], count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "URL", next\ := 87, root := ~, start := 17, stop := 86 ) ], count := [ "A", 7, 0, 27 ], name := "Alt\ ", next := 93, root := ~, start := 1, stop := 92 ), rec( attributes := rec( Only := \ "Text" ), content := [ rec( attributes := rec( ), content := [ rec( HTML := t\ rue, content := "Grape", count := [ "A", 7, 0, 27 ], name := "PCDATA", root :=\ ~ ) ], count := [ "A", 7, 0, 27 ], name := "Package", next := 137, root := ~, star\ t := 113, stop := 136 ) ], count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "Alt\ ", next := 143, root := ~, start := 93, stop := 142 ), rec( HTML := true, content := "\ is equivalent to ", count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "PCD\ ATA", root := ~ ), rec( attributes := rec( Label := "for digraphs", Oper := "I\ sIsomorphicDigraph" ), content := 0, count := [ "A", 7, 0, 27 ], mathmode := "\ Text", name := "Ref", next := 467355, root := ~, start := 467289, stop := 4673\ 54 ), rec( HTML := true, content := " in ", count := [ "A", 7, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 7, 0, 27 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 27 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ .\n Note however that ", count := [ "A", 7, 0, 27 ], mathmode := "T\ ext", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML \ := true, content := "IsIsomorphicGraph", count := [ "A", 7, 0, 27 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 27 ], mathmode := \ "Text", name := "C", next := 467425, root := ~, start := 467401, stop := 46742\ 4 ), rec( HTML := true, content := "'s optional argument\n ", count := [ "A", 7, 0, 27 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "firstunbindcanon", count := [ "A", 7, 0, 27 ], mathmode \ := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 27 ], mathmode := \ "Text", name := "A", next := 467481, root := ~, start := 467458, stop := 46748\ 0 ), rec( HTML := true, content := " is not applicable, since the canonical\n \ labellings of a digraph are not portable between sessions.\n \ ", count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 27 ], name := "Alt", next := 467608, root := ~, start := 467206, stop := 467607 ), rec( content := "\n \ ", count := [ "A", 7, 0, 27 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 27 ], name := "Item", next := 467624, root := ~, start := 467189, stop := 467623 ) ], count := [ "A", 7, 0, 22 ], name := "Row", next := 467637, root := ~, start := 467013, stop := 467636 ), rec( attributes := rec( ), content := 0, count := [ "A", 7, 0, 28 ], name := "HorLine", next := 467654, root := ~, start := 467644, stop := 467653 ), rec( attributes := rec( ), content := [ rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( content := "G\ raphIsomorphismClassRepresentatives", count := [ "A", 7, 0, 29 ], mathmode := \ "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 29 ], mathmode := "Text", name := "C", next := 467736, root := ~, start := 467693, stop := 467735 ), rec( content := "\n \ ", count := [ "A", 7, 0, 29 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 29 ], name := "Item", next := 467752, root := ~, start := 467676, stop := 467751 ), rec( attributes := rec( ), content := [ rec( content := "\n \ None\n ", count := [ "A", 7, 0, 31 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 31 ], name := "Item", next := 467798, root := ~, start := 467761, stop := 467797 ), rec( attributes := rec( ), content := [ rec( content := "\n \ ", count := [ "A", 7, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( Only := "HTML" ) , content := [ rec( HTML := true, content := "\ \n There is no analogous function in ", count := [ "A", 7, 0, 33 ], mathmode := \ "Text", name := "PCDATA", root := ~ ), rec( attributes := rec( ), content := [ rec( HTML\ := true, content := "Digraphs", count := [ "A", 7, 0, 33 ], mathmode := "Text\ ", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 33 ], mathmode := "T\ ext", name := "Package", next := 28, root := ~, start := 1, stop := 27 ), rec( HTML := true , content := "\ , although this feature\n might be implemented in the future.\n \ ", count := [ "A", 7, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 33 ], name := "Alt", next := 467986, root := ~, start := 467824, stop := 467985 ), rec( content := "\n \ ", count := [ "A", 7, 0, 33 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 33 ], name := "Item", next := 468002, root := ~, start := 467807, stop := 468001 ) ], count := [ "A", 7, 0, 28 ], name := "Row", next := 468015, root := ~, start := 467662, stop := 468014 ), rec( attributes := rec( ), content := 0, count := [ "A", 7, 0, 34 ], name := "HorLine", next := 468032, root := ~, start := 468022, stop := 468031 ) ], count := [ "A", 7, 0, 4 ], mathmode := "Text", name := "Table", next := 468046, root := ~, start := 465644, stop := 468045 ), rec( content := "\n ", count := [ "A", 7, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 7, 0, 1 ], mathmode := "Text", name := "Section", next := 468059, root := ~, start := 465390, stop := 468058 ), rec( content := "\n", count := [ "A", 7, 0, 35 ], mathmode := "Text", name := "PCDATA", root := ~ ) ], count := [ "A", 0, 0, 1 ], mathmode := "Text", name := "Appendix", next := 468071, root := ~, start := 434420, stop := 468070 ), rec( content := " Grape to Digraphs command map ", count := [ "A", 7, 0, 35 ], mathmode := "Text", name := "XMLCOMMENT", root := ~ ), rec( attributes := rec( Databases := "digraphs" ), content := 0, count := [ "Bib", 0, 0, 1 ], mathmode := "Text", name := "Bibliography", next := 468151, root := ~, start := 468114, stop := 468150 ), rec( attributes := rec( ), content := 0, count := [ "Ind", 0, 0, 1 ], mathmode := "Text", name := "TheIndex", next := 468163, root := ~, start := 468152, stop := 468162 ) ], count := [ 0, 0, 0, 1 ], name := "Book", next := 468172, root := ~, start := 1961, stop := 468171 ) ], count := [ 0, 0, 0, 1 ], indent := "", indextext := "< (for digraphs) 4.1
\n= \ (for digraphs) 4.1
\n<\ code class=\"func\">AdjacencyMatrix 5.2-1
\nAdjacencyMatrixMutableCopy 5.2-1 \nAdjacencyMatrixUpperTriangleLineDecoder 9.2-10 \nArticulati\ onPoints 5.3-14 \nAsBinaryRelation 3.2-1 \nAsDigraph 3.2-2 \nAsGraph 3.2-4 \ \nAsMonoid 5.5-1 \nAsSemigroup, for a filter\ and a digraph 5.5-1 \ \n    for a filter, semilattice digraph, and two lists 5.5-2 \nAsTransformation 3.2-5\ \nAutomorphismGroup, for a digraph 7.2-2 \n   \ ; for a digraph and a homogeneous list 7.2-5 \n    for a digraph, homogeneo\ us list, and list 7.2-6 \nBipartiteDoubleDigraph 3.3-37 \nBlissAutomorphi\ smGroup, for a digraph 7.2\ -3 \n    for a digraph and homogenous list 7.2-3 \n   \ for a digraph, homogenous list, and list 7.2-3 \nBlissCanonicalDigraph 7.2-9 \nBlissCanonicalLabelling, for a digraph 7.2-7 \n    for a digr\ aph and a list 7.2-8 \ \nBooleanAdjacencyMatrix 5.2-3 \nBooleanAdjacencyMa\ trixMutableCopy 5.2-3 \ \nCayleyDigraph 3.1-12 \nChainDigraph\ 3.5-1 \nCharacteristicPolynomial 5.2-2 \nChromaticNumber 7.3-17 \nCliqueNumber 8.1-5 <\ br />\nCliquesFinder 8.1-2 \nCompleteBipartiteDigra\ ph 3.5-3 \nCompleteDigraph 3.5-2 \nCompleteMultipartiteDigraph 3.5-4 \nCycleDigraph 3.\ 5-5 \nDegreeMatrix 5.2-16 \nDigraph 3.1-7 \n  \ ;  for a group, list, function, and function 3.1-7 \n    for a list an\ d function 3.1-7 \nDigraph6String 9.2-3 \nDigraphAddAllLoops 3.3-38 \nDigraphAddAllLoopsAttr \ 3.3-38 \nDigraphAddEdge, for a digraph \ and an edge 3.3-16 \n&\ nbsp;   for a digraph, source, and range 3.3-16 \nDigraphAddEdge\ Orbit 3.3-17 \n\ DigraphAddEdges 3.3-18 \nDigraphAddVertex <\ a href=\"chap3_mj.html#X83B2506D79453208\">3.3-14 \nDigraphAddVertices, for a digraph and a list of labels 3.3-15 \n   &nbs\ p;for a digraph and an integer 3.\ 3-15 \nDigraphAdjacencyFunction 5.2-4 \n\ DigraphAllSimpleCircuits 5\ .3-21 \nDigraphBicomponents 5.3-13 \nDig\ raphByAdjacencyMatrix 3.1-\ 8 \nDigraphByEdges 3.1-9 \nDigraphByInNe\ ighbors 3.1-11 \ \nDigraphByInNeighbours 3.1-11 \nDigraphByOutNeighb\ oursType 3.1-6 \ \nDigraphCartesianProduct, for a list of digraphs \ 3.3-30 \n  &\ nbsp; for a positive number of digraphs 3.3-30 \nDigraphCartesianProductPr\ ojections 3.3-32 \nDigraphClique 8.1-3 \nDigraphCliques 8.1-4 \nDigraphCliquesReps 8.1\ -4 \nDigraphClosure 3.3-40 \nDigraphColo\ uring, for a digraph and a number of colours 7.3-14 \nDigraphConnectedCo\ mponent 5.3-10 \ \nDigraphConnectedComponents 5.3-9 \nDigraphCopy 3.3-1 \nDigraphCopySameMutability 3.3-1 \nDigraphCore 7.3-18 \nDigraphDegeneracy 5.3-24<\ /a> \nDigraphDegeneracyOrdering 5.3-25 \nDig\ raphDiameter 5.3-1 \nDigraphDijkstra, for a source 5.3-28 \n    for\ a source and target 5.3-28 \ \nDigraphDirectProduct, for a list of digrap\ hs 3.3-31 \n &nbs\ p;  for a positive number of digraphs 3.3-31 \nDigraphDirectProductPr\ ojections 3.3-33 \nDigraphDisjointUnion, for a list of digraphs \ 3.3-27 \n  &n\ bsp; for an\n arbitrary number of digraphs 3.3-27 \nDigraphDistanceSet<\ /code>, for a digraph, a pos int, and a list 5.3-5 \n    for a digraph, a pos in\ t, and an int 5.3-5 \n\ DigraphDual 3.3-10 \nDigraphDualAttr 3.3-10 \nDigraphEdgeLabel 5.1-10 \nDigraphEdgeLabels 5.1-11 \nDigraphEdges\ 5.1-3 \nDigraphEdgeUnion, for a list of digraphs 3.3-28 \n    for \ a positive number of digraphs 3.3\ -28 \nDigraphEmbedding 7.3-8 \nDigraphEp\ imorphism 7.3-6 \nDigraphFamily 3.1-6 \nDigraphFile 9.2-4 \n\ DigraphFloydWarshall 5.3-1\ 6 \nDigraphFromDigraph6String 9.2-2 \nDi\ graphFromDiSparse6String 9\ .2-2 \nDigraphFromGraph6String 9.2-2 \nD\ igraphFromPlainTextString \ 9.2-12 \nDigraphFromSparse6String 9.2-2 \nDigraphGirth 5.3-6 \ \nDigraphGreedyColouring, for a digraph 7.3-15 \n  &nbs\ p; for a digraph and vertex order 7.3-15 \n    for a digraph and vertex ord\ er function 7.3-15 \n<\ code class=\"func\">DigraphGroup 7.2-10 \nDigraphHasLoops 6.1-1 \n\ DigraphHomomorphism 7.3-2<\ /a> \nDigraphImmutableCopy 3.3-1 \nDigraphIm\ mutableCopyIfImmutable 3.3\ -2 \nDigraphImmutableCopyIfMutable 3.3-2 \nDigraphIndependentSet 8\ .2-2 \nDigraphIndependentSets 8.2-3 \nDi\ graphIndependentSetsReps 8\ .2-3 \nDigraphInEdges 5.1-12 \nDigraphJo\ in, for a list of digraphs 3.3-29 \n    for a positive number of digraphs\ 3.3-29 \nDigraphLayers 5.3\ -23 \nDigraphLongestDistanceFromVertex \ 5.3-4 \nDigraphLongestSimpleCircuit 5.3-22 \nDigraphLoops 5.2-14 \n\ DigraphMaximalClique 8.1-3\ \nDigraphMaximalCliques 8.1-4 \nDigraph\ MaximalCliquesAttr 8.1-4 \nDigraphMaximalCliquesReps 8.1-4 \nDigra\ phMaximalCliquesRepsAttr 8\ .1-4 \nDigraphMaximalIndependentSet 8.2-2 \nDigraphMaximalIndependentSets 8.2-3 \nDigraphMaximalIndependentSetsA\ ttr 8.2-3 \nDigraphMaximalIndependentSetsReps 8.2-3 \nDigraphMaxim\ alIndependentSetsRepsAttr \ 8.2-3 \nDigraphMaximalMatching 5.1-16 \n\ DigraphMaximumMatching 5.1\ -17 \nDigraphMonomorphism 7.3-4 \nDigrap\ hMutableCopy 3.3-1 \nDigraphMutableCopyIfImmutable 3.3-2 \nDigraph\ MutableCopyIfMutable 3.3-2\ \nDigraphMycielskian 3.3-41 \nDigraphMy\ cielskianAttr 3.3-41 \ \nDigraphNrConnectedComponents 5.3-9 \nDigrap\ hNrEdges 5.1-4 \ \nDigraphNrStronglyConnectedComponents 5.3-11 \nDig\ raphNrVertices 5.1-2 \ \nDigraphOddGirth 5.3-7 \nDigraphOrbitReps 7.2-12 \nDigraphOrbits 7.2-11 \nDigraphOutEdges 5.1-13 \nDigra\ phPath 5.3-18 \ \nDigraphPeriod 5.3-15 \nDigraphPlainTextLineDecode\ r 9.2-8 \nDigraphPlainTextLineEncoder 9.2-8 \nDigraphRange \ 5.2-5 \nDigraphReflexiveTransitiveClosure 3.3-12 \nDigraphReflexiveTransi\ tiveClosureAttr 3.3-12\ \nDigraphReflexiveTransitiveReduction 3.3-13 \nDigraphReflexiveTransitiveReductionAttr 3.3-13 \nDigraphRemoveAllMul\ tipleEdges 3.3-25 \nDigraphRemoveAllMultipleEdgesAttr 3.3-25 \nDig\ raphRemoveEdge, for a digraph and an edge 3.3-21 \n    for a digraph, sou\ rce, and range 3.3-21 \ \nDigraphRemoveEdgeOrbit 3.3-22 \nDigraphRemoveEdge\ s 3.3-23 \nDigraphRemoveLoops 3.3-24 \nDigraphRemoveLoopsAttr 3.3-24 \nDigraphRemoveVertex 3.3-19 \nDigraphRemoveVertices 3.3-20 \nDigraphReverse 3.3-9<\ /a> \nDigraphReverseAttr 3.3-9 \nDigraphReve\ rseEdge, for a digraph and an edge 3.3-26 \n    for a digraph, source, an\ d range 3.3-26 \nDigraphReverseEdges, for a digraph and a list of edges \ 3.3-26 \nDigraphs package overview 1. \nDigraphSchreierVector \ 7.2-13 \nDigraphShortestDistance, for a digraph and a list 5.3-2 \n    for \ a digraph and two vertices 5.3-2<\ /a> \n    for a digraph, a list, and a list 5.3-2 \n\ DigraphShortestDistances 5\ .3-3 \nDigraphShortestPath 5.3-19 \nDigr\ aphSinks 5.1-5 \ \nDigraphsMakeDoc 2.4-1 \nDigraphSource 5.2-5 \nDigraphSources 5.1-6 \nDigraphsRespectsColouring 7.3-12 \nDigra\ phStabilizer 7.2-14 <\ br />\nDigraphsTestExtreme 2.5-3 \nDigraphsTestInst\ all 2.5-1 \nDigraphsTestStandard 2.5-2
\nDigraphStronglyConnectedC\ omponent 5.3-12
\nDigraphStronglyConnectedComponents 5.3-11
\nDigr\ aphsUseBliss 7.2-1 \nDigraphsUseNauty 7.2-1
\nDigraphSymmetricClos\ ure 3.3-11
\nDigraphSymmetricClosureAttr 3.3-11
\nDigraphTopologic\ alSort 5.1-7
\n\ DigraphTransitiveClosure 3.3-12
\nDigraphTransitive\ ClosureAttr 3.3-12 \nDigraphTransitiveReduction 3.3-13
\nDigraphTr\ ansitiveReductionAttr 3.3-\ 13
\nDigraphUndirectedGirth 5.3-8
\nDigr\ aphVertexLabel 5.1-8 \
\nDigraphVertexLabels 5.1-9
\nDigraphVertices\ 5.1-1
\nDigraphWelshPowellOrder 7.3-16
\nDiSparse6String \ 9.2-3
\nDistanceDigraph, for digraph and int 3.3-39
\n    for digraph and l\ ist 3.3-39
\nDotDigraph 9.1\ -2
\nDotHighlightedDigraph 9.1-6
\nDotPa\ rtialOrderDigraph 9.1-4
\nDotPreorderDigraph 9.1-5
\nDotQuasiorder\ Digraph 9.1-5
\ \nDotSymmetricDigraph 9.1-3
\nDotVertexLabelledDigr\ aph 9.1-2
\nDoubleDigraph 3.3-36
\nEdgeDigraph 3.3-34
\nEdge\ OrbitsDigraph 3.1-10 \
\nEdgeUndirectedDigraph 3.3-35
\nEmbeddingsDi\ graphs 7.3-9
\n\ EmbeddingsDigraphsRepresentatives 7.3-9
\nEmptyDigr\ aph 3.5-6
\nEpimorphismsDigraphs 7.3-7
\nEpimorphismsDigraphsRepre\ sentatives 7.3-7
\nGeneralisedPetersenGraph 3.5-9
\nGeneratorsOfCa\ yleyDigraph 5.4-2 \nGeneratorsOfEndomorphismMonoid 7.3-13
\nGenera\ torsOfEndomorphismMonoidAttr 7.3-13
\nGraph 3.2-3
\nGraph6String 9.2-3 \nGroupOfCayleyDigraph 5.4-1 \nHamiltonianPath 5.3-26 \nHomomorphismDigraphsFinder 7.3-1 \nHomomorphismsDigraphs 7.3-3 \nHomomorphismsDigraphsRepresentatives 7.3-3 \nInDegreeOfVertex <\ a href=\"chap5_mj.html#X7C9CD0527CB9E6EF\">5.2-12 \nInDegrees 5.2-9 \ \nInDegreeSequence 5.2-9 \nInDegreeSet 5.2-9 \nInducedSubdigraph 3.3-3 \nInNeighbors 5.2-7 \nInNeighbors\ MutableCopy 5.2-7 \nInNeighborsOfVertex 5.2-13 \nInNeighbours 5.2-7 \nInNeighboursMutableCopy 5.2-7 \nInNeighboursOfVertex <\ a href=\"chap5_mj.html#X7C0DA18B8291F302\">5.2-13 \nIsAcyclicDigraph 6.3\ -1 \nIsAntiSymmetricDigraph 6.1-2 \nIsAn\ tisymmetricDigraph 6.1-2 \nIsAperiodicDigraph 6.3-6 \nIsBiconnecte\ dDigraph 6.3-4 \ \nIsBipartiteDigraph 6.1-3 \nIsCayleyDigraph\ 3.1-4 \nIsChainDigraph 6.\ 3-2 \nIsClique 8.1-1 \nIsCompleteBiparti\ teDigraph 6.1-4 \nIsCompleteDigraph 6.1-5 \nIsCompleteMultipartite\ Digraph 6.1-6 \ \nIsConnectedDigraph 6.3-3 \nIsCycleDigraph \ 6.3-11 \nIsDigraph 3.1-1 \nIsDigraphAutomorphism 7.2-20 \n    for a\ digraph and a transformation or permutation 7.2-20 \nIsDigraphColouring\ 7.2-21 \n  \   for a transformation \ 7.2-21 \nIsDigraphCore 6.5-1 \nIsDigraph\ Edge, for digraph and list 5.1-14 \n    for digraph and two pos ints 5.1-14 \nIsDigraphEmbedding 7.3\ -11 \n    for digraphs and a permutation or tra\ nsformation 7.3-11 \n<\ code class=\"func\">IsDigraphEndomorphism 7.3-10 \n    for digraphs and a\ permutation or transformation 7.\ 3-10 \nIsDigraphEpimorphism 7.3-10 \n    \ for digraphs and a permutation or transformation 7.3-10 \nIsDigraphHomomorphism\ 7.3-10 \n \ ;   for digraphs and a permutation or transformation 7.3-10 \nI\ sDigraphIsomorphism 7.2-20\ \n    for digraphs and transformation or permu\ tation 7.2-20 \nIsDigraphMonomorphism 7.3-10 \n    for digraphs and a perm\ utation or transformation 7.3-10<\ /a> \nIsDigraphWithAdjacencyFunction 3.1-5 \nIsDirectedTree 6.3-7 \ \nIsDistanceRegularDigraph 6.2-4 \nIsEdgeTra\ nsitive 6.5-2 \ \nIsEmptyDigraph 6.1-7 \nIsEquivalenceDigraph 6.1-8 \nIsEulerianDigraph 6.3-9 \nIsFunctionalDigraph 6.1-9 \nIs\ HamiltonianDigraph 6.3-10<\ /a> \nIsImmutableDigraph 3.1-3 \nIsIndepende\ ntSet 8.2-1 \n<\ code class=\"func\">IsInRegularDigraph 6.2-1 \nIsIsomorphicDigraph, for digraphs 7.2-15 \n    for digraphs and homogeneous lists 7.2-16 \nIsJoinSe\ milatticeDigraph 6.1-17 \nIsLatticeDigraph 6.1-17 \nIsMatching5.1-15 \nIsMaximalClique 8.1-1 \nIsMaximalIndependentSet 8.2-1 \nIsMaximalMatching 5.1-1\ 5 \nIsMaximumMatching 5.1-15 \nIsMeetSem\ ilatticeDigraph 6.1-17\ \nIsMultiDigraph 6.1-10 \nIsMutableDigraph<\ /code> 3.1-2 \nIsNullDigraph 6.1-7 \nIsomorphismDigraphs, for dig\ raphs 7.2-17 \n &\ nbsp;  for digraphs and homogeneous lists 7.2-18 \nIsOuterPlanarDigra\ ph 6.4-2 \nIsOutRegularDigraph 6.2-2 \nIsPartialOrderDigraph 6.1-16 \nIsPerfectMatching 5.1-15 \nIsPlanarDigraph 6.4-1 \nIsPr\ eorderDigraph 6.1-15 \ \nIsQuasiorderDigraph 6.1-15 \nIsReachable5.3-17 \nIsReflexiveDigraph 6.1-11 \nIsRegularDigraph 6.2-3 \n\ IsStronglyConnectedDigraph 6.3-5 \nIsSubdigraph 4.1-1 \nIsSymmetri\ cDigraph 6.1-12 \nIsTournament 6.1-13 \nIsTransitiveDigraph\ 6.1-14 \nIsUndirectedForest 6.3-8 \nIsUndirectedSpanningForest \ 4.1-2 \nIsUndirectedSpanningTree 4.1-2 \nIsUndirectedTree 6.3-8 \nIs\ VertexTransitive 6.5-3\ \nIteratorFromDigraphFile 9.2-7 \nIteratorO\ fPaths 5.3-20 \ \nJohnsonDigraph 3.5-7 \nKuratowskiOuterPlanarSubdi\ graph 5.6-2 \n<\ code class=\"func\">KuratowskiPlanarSubdigraph 5.6-1 \nLaplacianMatrix 5.2-17 \nLineDigraph \ 3.3-34 \nLineUndirectedDigraph 3.3-35 \n\ MaximalAntiSymmetricSubdigraph 3.3-6 \nMaximalAntiSymmetricSubdigraphAtt\ r 3.3-6 \nMaximalSymmetricSubdigraph 3.3-5 \nMaximalSymmetricSubdi\ graphAttr 3.3-5 \nMaximalSymmetricSubdigraphWithoutLoops 3.3-5 \nM\ aximalSymmetricSubdigraphWithoutLoopsAttr 3.3-5 \nMonomorphismsDigraphs<\ /code> 7.3-5 \nMonomorphismsDigraphsRepresentatives 7.3-5 \nNautyAutomorp\ hismGroup 7.2-4 \nNautyCanonicalDigraph 7.2-9 \nNautyCanonicalLabe\ lling, for a digraph 7.2-7\ \n    for a digraph and a list 7.2-8 \nNrSpanni\ ngTrees 5.3-27 \ \nNullDigraph 3.5-6 \nOnDigraphs, for a digr\ aph and a perm 7.1-1 \ \n    for a digraph and a transformation 7.1-1 \nOnMultiDig\ raphs 7.1-2 \n&\ nbsp;   for a digraph, perm, and perm 7.1-2 \nOutDegreeOfVertex<\ /code> 5.2-10 \nOutDegrees \ 5.2-8 \nOutDegreeSequence 5.2-8 \nOutDeg\ reeSet 5.2-8 \n\ OuterPlanarEmbedding 5.6-4 \nOutNeighbors <\ a href=\"chap5_mj.html#X7E9880767AE68E00\">5.2-6 \nOutNeighborsMutableCopy 5.2-6 \nOutNeighborsOfVertex 5.2-11 \nOutNeighbours 5.2-6 \ \nOutNeighboursMutableCopy 5.2-6 \nOutNeighbo\ ursOfVertex 5.2-11 \nPartialOrderDigraphJoinOfVertices 5.2-15 \nP\ artialOrderDigraphMeetOfVertices 5.2-15 \nPetersenGraph 3.5-8 \nPl\ ainTextString 9.2-12 \ \nPlanarEmbedding 5.6-3 \nPrintString \ 9.2-1 \nQuotientDigraph 3.3\ -8 \nRandomDigraph 3.4-1 \nRandomLattice\ 3.4-4 \nRandomMultiDigraph 3.4-2 \nRandomTournament 3.4-3 \nReadDigraphs 9.2-5 <\ br />\nReadDIMACSDigraph 9.2-14 \nReadPlainTextDigr\ aph 9.2-13 \nReducedDigraph 3.3-4 \nReducedDigraphAttr 3.3-4 \nRepresentativeOutNeighbours 7.2-19 \nSemigroupOfCayleyDigraph \ 5.4-1 \nSetDigraphEdgeLabel 5.1-10 \nSetDigraphEdgeLabels, for a d\ igraph and a function 5.1-11 \ \n    for a digraph and a list of lists 5.1-11 \nSet\ DigraphVertexLabel 5.1-8 \nSetDigraphVertexLabels 5.1-9 \nSparse6S\ tring 9.2-3 \n<\ code class=\"func\">Splash 9.1-1 \nString 9.2-1 \nSubdigraphHomeom\ orphicToK23 5.6-5 \nSubdigraphHomeomorphicToK33 5.6-5 \nSubdigraph\ HomeomorphicToK4 5.6-5\ \nTCodeDecoder 9.2-11 \nTournamentLineDecod\ er 9.2-9 \nUndirectedSpanningForest 3.3-7 \nUndirectedSpanningFore\ stAttr 3.3-7 \n\ UndirectedSpanningTree 3.3-7 \nUndirectedSpanningTr\ eeAttr 3.3-7 \n\ WriteDigraphs 9.2-6 \nWriteDIMACSDigraph 9.2-14 \nWritePlainTextDigraph 9.2-13 \n", input := "Digraphs\">\n http://www.maths.qmul.ac.uk/~leonard/grape/Grape\">\n http://www.tcs.tkk.fi/Software/bliss/bliss\">\n https://github.com/graph-algorithms/edge-addition-planarity-suite<\ /URL>edge-addition-planarity-suite\">\n h\ ttp://pallini.di.uniroma1.it/nauty\">\n https://github.com/gap-packages/NautyTracesInte\ rfaceNautyTracesInterface<\ /Alt>\">\n \n http://gap-\ packages.github.io/io/\nIO\">\n \n http://http:\ //gap-packages.github.io/orb/\n Orb<\ /Package>\">\n https://github.com/gap-packages/datastructuresdatastructures\">\n \n\n\n\n\n\n\n\n\n\n ]>\n\n\n\n &Digraphs\ ;\n Version &VERSION;\n\n Jan De Beule\n \ jdebeule@cage.ugent.be\n http://homepages.vub.a\ c.be/~jdbeule\n \n\n Julius Jonušas\n julius.jonusas@tuwien.ac.at\n http://julius.jonusas.\ work\n \n\n James D. Mitchell\n jdm3@s\ t-and.ac.uk\n http://www-groups.mcs.st-andrews.ac.uk/~jam\ esm\n \n\n Michael Torpey\n mct25@st-a\ ndrews.ac.uk\n https://mtorpey.github.io\n \n\n Wilf A. Wilson\n gap@wilf-wilson.net\n \ http://wilf.me\n \n\n Stuart Burrel\ l\n\n Reinis Cirpons\n\n Luke Elliott\n\n Max Horn\n\n Christopher Jefferson\n\n Markus Pfeiffer\n\n Chris Russell\n\ \n Finn Smith\n\n Murray White\n\n ©right; ©RIGHTYEARS; by\n Jan De Beule, Julius Jonušas, J\ ames D. Mitchell, Michael\n Torpey, Wilf A. Wilson et al.\n\n &Digra\ phs; is free software; you can redistribute it and/or modify it\n under the\ terms of the \n http://www.fsf.or\ g/licenses/gpl.html as published by the Free Software\n Foundation; e\ ither version 3 of the License, or (at your option) any later\n version.\n \ \n\n \n The &Digraphs; package is a &GAP; package c\ ontaining methods for graphs,\n digraphs, and multidigraphs.\n \ \n\n \n We would like to thank Christopher Jefferson for\ his help in including \n &bliss; in &Digraphs;.\n\n This package's meth\ ods for computing digraph homomorphisms are based on work\n by Max Neunh\ 46;ffer, and independently Artur Schäfer.\n \n\n\n\n\n\n\n\n \n \n The &Digraphs; package\n \n &Digraphs; package overview\n\n Introduc\ tion\n\n This is the manual for version &VERSION; of the &Digraphs;\ package.\n This package was developed at the University of St Andrews by:\n \ \n Jan De Beule,\n Julius Jonušas,\ \n James D. Mitchell,\n Michael C. Torpey, and\ \n Wilf A. Wilson.\n \n Additional contributions were\ made by:\n \n Stuart Burrell,\n Reinis Cirpon\ s,\n Luke Elliott,\n Max Horn,\n Christopher Jefferson,\n Markus Pfeiffer,\n Chris Russell,\n Finn Smith, and\n Maria Tsal\ akou,\n Murray Whyte.\n \n\n The &Digraphs; pa\ ckage contains a variety of methods for efficiently creating\n and storing mu\ table and immutable digraphs and computing information about\n them. Full \ explanations of all the functions contained in the package are\n provided b\ elow. \n\n If the &Grape; package is available, it will be loaded automat\ ically.\n Digraphs created with the &Digraphs; package can be converted to &G\ rape;\n graphs with , and conversely &Grape; graphs can \ be\n converted to &Digraphs; objects with . &Grape; i\ s not\n required for &Digraphs; to run. \n\n The &bliss; tool is included in this package. It\n is an open-source tool for comp\ uting automorphism groups and canonical forms\n of graphs, written by Tommi J\ unttila and Petteri Kaski. Several of the methods\n in the &Digraphs; package\ rely on &bliss;. If the &NautyTracesInterface;\n package for GAP is availabl\ e then it is also possible to use &nauty; for comput\ ing automorphism groups and canonical forms\n in &Digraphs;. See Section \n \ for more details. \n <\ P/>\n\n From version 1.0.0 of this package, digraphs can be either mutable or\ immutable.\n Mutable digraphs can be changed in-place by many of the methods\ in the\n package, which avoids unnecessary copying. Immutable digraphs canno\ t be\n changed in-place, but their advantage is that the value of an attribut\ e of\n an immutable digraph is only ever computed once. Mutable digraphs can \ be\n converted into immutable digraphs in-place using . One of the motivations for introducing mutable\ \n digraphs in version 1.0.0 was that in practice the authors often wanted\n \ to create a digraph and immediately modify it (removing certain edges,\n loo\ ps, and so on). Before version 1.0.0, this involved copying the digraph\n sev\ eral times, with each copy being discarded almost immediately.\n From version\ 1.0.0, this unnecessary copying can be eliminated by\n first creating a muta\ ble digraph, then changing it in-place, and finally\n converting the mutable\ digraph to an immutable one in-place\n (if desirable).\n\n Definitions\n\n For the purposes of th\ is package and its documentation, the following\n definitions apply: \n\ \n A digraph E=(E^0,E^1,r,s), also known as a directed\n \ graph, consists of a set of vertices E^0 and a set of edges\n \ E^1 together with functions s, r: E^1 \\to E^0, called the\n \ source and range, respectively.\n\n The source and range of\ an edge is respectively the values of s, r at\n that edge.\n\n A\ n edge is called a loop if its source and range are the same.\n\n A \ digraph is called a multidigraph if there exist two or more edges\n \ with the same source and the same range. \n\n A directed walk on\ a digraph is a sequence of alternating vertices\n and edges (v_1, e_1, \ v_2, e_2, ..., e_{n-1}, v_n) such that each edge\n e_i has sourc\ e v_i and range v_{i+1}. A directed\n path is a dire\ cted walk where no vertex (and hence no edge) is\n repeated. A directed\ circuit is a directed walk where v_1 =\n v_n, and a direct\ ed cycle is a directed circuit where where no\n vertex is repeated, exc\ ept for v_1 = v_n. \n\n The length of a directed walk (v_1, e_1, v_2, e_2, ..., e_{n-1},\n v_n) is equal to n-1, th\ e number of edges it contains. A\n directed walk (or path) (v_1, e_1, v\ _2, e_2, ..., e_{n-1}, v_n) is\n sometimes called a directed walk (or p\ ath) from vertex v_1 to\n vertex v_n. A directed wa\ lk of zero length, i.e. a sequence\n (v) for some vertex v, i\ s called trivial. A trivial\n directed walk is considered to be both\ a circuit and a cycle, as is the\n empty directed walk (). A sim\ ple circuit is another name for a\n non-trivial and non-empty directed \ cycle. \n\n \n \n\n \n \n Installing &Digraphs;\n\n \n For those in a\ hurry\n In this section we give a brief description of how to st\ art using\n &Digraphs;.\n\n It is assumed that you have a working co\ py of &GAP; with version number\n &GAPVERS; or higher. The most up-to-date \ version of &GAP; and instructions\n on how to install it can be obtained fr\ om the main &GAP; webpage\n http://www.gap-system.org. \n\n \ The following is a summary of the steps that should lead to a\n successfu\ l installation of &Digraphs;:\n\n \n\n \n ensure th\ at the &IO; package version &IOVERS; or higher is available.\n &IO; mus\ t be compiled before &Digraphs; can be loaded.\n \n\n \ \n ensure that the &Orb; package version &ORBVERS; or higher is availab\ le.\n &Orb; has better performance when compiled, but although compilat\ ion is\n recommended, it is not required to be compiled for &Digraphs; \ to be\n loaded.\n \n\n ensure that the &datastr\ uctures; package version\n &DATASTRUCTURESVERS; or higher is available.\ \n \n\n \n This step is optional: certain \ functions in &Digraphs; require\n the &Grape; package to be available; \ see Section\n for full details. T\ o use these\n functions make sure\n that the &Grape; package ver\ sion &GRAPEVERS; or higher is available.\n If &Grape; is not available,\ then &Digraphs; can be used as normal with\n the exception that the fu\ nctions listed in Subsection\n wil\ l not work.\n \n \n \n This step is opti\ onal: certain functions in &Digraphs; require\n the &NautyTracesI\ nterface; package to be available.\n \n \ If you want to make use of these functions, please ensure that the\n &\ NautyTracesInterface; package version &NAUTYTRACESINTERFACEVERS; or\n h\ igher is available. If &NautyTracesInterface; is not available,\n then\ &Digraphs; can be used as normal with the exception that \n function\ s whose names contain Nauty will not work.\n \n\n \n download the package archive &ARCHIVENAME;.tar.gz from\n \ http://gap-packages.github.io/D\ igraphs/.\n \n\n \n unzip and untar the fi\ le, this should create a directory called\n &ARCHIVENAME;.\n \ \n\n \n locate the pkg directory of your &GA\ P; directory, which contains\n the directories lib, doc a\ nd so on. Move the directory\n &ARCHIVENAME; into the pkg\ directory.\n \n\n \n it is necessary to compile\ the &Digraphs; package.\n Inside the pkg/&ARCHIVENAME; director\ y, type\n \n\n F\ urther information about this step can be found in Section\n .\n \n\n \n sta\ rt &GAP; in the usual way (i.e. type gap at the command line).\n <\ /Item>\n\n \n type LoadPackage(\"digraphs\");\n \ \n \n\n If you want to check that the package is working c\ orrectly, you\n should run some of the tests described in Section\n .\n \n\n \n \n\n \n Optional package dependenc\ ies\n\n \n\n The &Digraphs; package is written in &GAP; and C cod\ e and requires the\n &IO; package. The &IO; package is used to read and wr\ ite transformations,\n partial permutations, and bipartitions to a file. \n\n \n\n \n The Gr\ ape package\n\n The &Grape; package must be available for the f\ ollowing operations to be\n available:\n\n \n with a digraph argument\n with a digraph argument\n with a &Grape; graph argument\n \n\n If &Grape; is \ not available, then &Digraphs; can be used as normal with\n the exception\ that the functions above will not work.\n \n \n\n \ \ \n \n\n \n Compili\ ng the kernel module\n The &Digraphs; package has a &GAP; kernel \ component in\n C which should be compiled. This component contains certain \ low-level\n functions required by &Digraphs;.\n \n\n It is not po\ ssible to use the &Digraphs; package without compiling it. \n\n To compi\ le the kernel component inside the pkg/&ARCHIVENAME;\n directory, ty\ pe\n \n\n \n\n If y\ ou installed the package in another 'pkg' directory than the standard 'pkg'\n \ directory in your &GAP; installation, then you have to do two things. First\ ly\n during compilation you have to use the option '--with-gaproot=PATH' of\ the\n 'configure' script where 'PATH' is a path to the main GAP root direc\ tory (if\n not given the default '../..' is assumed). \n\n If you ins\ talled &GAP; on several architectures, you must execute the\n configure/mak\ e step for each of the architectures. You can either do this\n immediately \ after configuring and compiling GAP itself on this architecture, or\n alter\ natively set the environment\n variable 'CONFIGNAME' to the name of the con\ figuration you used when compiling\n GAP before running './configure'. Not\ e however that your compiler choice and\n flags (environment variables 'CC'\ and 'CFLAGS') need to be chosen to match the\n setup of the original GAP c\ ompilation. For example you have to specify 32-bit\n or 64-bit mode correct\ ly!\n \n\n \n \n\n \n Rebuilding the documentation\n The &Digraphs; pac\ kage comes complete with pdf, html, and text versions of\n the documentatio\ n. However, you might find it necessary, at some point, to\n rebuild the do\ cumentation. To rebuild the documentation, please use the\n function .\n\n \n \n Nothing\n \n This functio\ n should be called with no argument to compile the &Digraphs;\n documentati\ on.\n \n\n\n \n\n \n \n\n \n Testing your installation\n\n In this section we describe how to test that &Digraphs; is workin\ g as\n intended. To test that &Digraphs; is installed correctly use\n <\ Ref Func=\"DigraphsTestInstall\"/> or for more extensive tests use\n . \n\n If something goes wrong, then plea\ se review the instructions in Section and ensure that &Digraphs; has been\n properly installed. If you cont\ inue having problems, please use the https:\ //github.com/gap-packages/Digraphs/issues\n to report the issues you \ are having.\n\n \n \n true or false.\n \n Th\ is function can be called without arguments to test your installation of\n \ &Digraphs; is working correctly. These tests should take no more than a\n f\ ew seconds to complete. To test more comprehensively that\n &Digraphs; is \ working correctly, use .\n \ \n\n\n \n \n true or false.\n \n \ This function can be called without arguments to test all of the methods\n \ included in &Digraphs;.\n These tests should take less than a minute to \ complete. \n\n To quickly test that &Digraphs; is installed correctly u\ se . For a more thorough test, use .\n \n\n\n \ \n \n No\ thing.\n \n This function should be called with no \ argument. It executes a series of\n very demanding tests, which measure the\ performance of a variety of\n functions on large examples. These tests ta\ ke a long time to\n complete, at least several minutes. \n\n For the\ se tests to complete, the digraphs library digraphs-lib must\n be do\ wnloaded and placed in the digraphs directory in a subfolder\n named\ digraphs-lib.\n This library can be found on the &Digraphs; website\ .\n \n\n\n\n \n\n \n \n\n\n\n\ \n Creating\ digraphs\n\n In this chapter we describe how to create digraphs.\n\n Creating digraphs\n \n \n \n Every digraph i\ n &Digraphs; belongs to the category\n IsDigraph. Some basic a\ ttributes and operations for digraphs\n are \ , , and\n .\n <\ /Description>\n\n\n \n \n \n IsMutableDigraph is a syn\ onym for and . A mutable digraph may be changed\n in-place by methods in the \ &Digraphs; package, and is not attribute-storing\n – see .\n \n\n A mutable digraph ma\ y be converted into an immutable attribute-storing\n digraph by calling on the\n digraph.\n \n\n\n \n \n \n IsImmutableDigraph is a subcat\ egory of .\n Digraphs that lie in IsImmutableD\ igraph are immutable and\n attribute-storing. In particular, they lie i\ n\n . \n\n A \ mutable digraph may be converted to an immutable\n digraph that lies in the\ category IsImmutableDigraph by calling\n on the digraph. \n\n The operation can be used\n to construct a mutable copy of an immutab\ le digraph. It is however not\n possible to convert an immutable digraph in\ to a mutable digraph in-place.\n \n\n\n \n \n \n \ IsCayleyDigraph is a subcategory of IsDigraph. Digraphs that\n\ are Cayley digraphs of a group and that are constructed by the operation\n\ are constructed in this category, and are\n \ always immutable.\n \n\n\n \n \ \n \n IsDigraphWithAdjacencyFunction is a subcategory of IsDigrap\ h.\n Digraphs that are created using an adjacency function are c\ onstructed\n in this category.\n \n\n\n \n \n \n \n The type of all digraphs is DigraphByOutNei\ ghboursType.\n The family of all digraphs is DigraphFamily.\n <\ /Description>\n\n\n \n \n \n \n A digraph.\n \n If the optional first argument filt is present, then this shou\ ld\n specify the category or representation the digraph being created will\ \n belong to. For example, if filt is ,\n then the digraph being created will be mutable, if filt is , then the digraph will be immutable. \n \ If the optional first argument filt is not present, then is used by default.\n \n for a\ list (i.e. an adjacency list)\n \n if obj is \ a list of lists of positive integers in\n the range from 1 to Length(obj), then this function\n returns the digraph with \ vertices\n E ^ 0 = [1 .. Length(obj)],\n an\ d edges corresponding to the entries of obj. \n\n More preci\ sely, there is an edge from vertex i to j if and\n only i\ f j is in obj[i]; the source of this edge is\n \ i and the range is j. If j occurs in\n obj[\ i] with multiplicity k, then there are k\n edges from\ i to j.\n \n\n for three lists\n \ \n if obj is a duplicate-free list, and source\ and\n range are lists of equal length consisting of positive in\ tegers\n in the list [1 .. Length(obj)], then this functi\ on\n returns a digraph with vertices\n E ^ 0 = [1 .. L\ ength(obj)], and\n Length(source) edges. For \ each i in\n [1 .. Length(source)] there exists an \ edge with source\n vertex source[i] and range vertex range[i]\ .\n See and .\n \n\n The vertices of the digraph will be labelled by\ the elements of\n obj.\n \n\n for an int\ eger, and two lists\n \n if obj is an integer,\ and source and\n range are lists of equal length consist\ ing of positive integers\n in the list [1 .. obj], then t\ his function\n returns a digraph with vertices\n E ^ 0 = \ [1 .. obj], and\n Length(source) edges. Fo\ r each i in\n [1 .. Length(source)] there exists a\ n edge with source\n vertex source[i] and range vertex range[\ i].\n See and .\n \n\n for a list and a function\n <\ Item>\n if list is a list and func is a function taking 2\ \n arguments that are elements of list, and func returns\ \n true or false, then this operation creates a digraph w\ ith\n vertices [1 .. Length(list)] and an edge from verte\ x\n i to vertex j if and only if\n func(\ list[i], list[j]) returns true.\n \n\n \ for a group, a list, and two functions\n \n \ The arguments will be G, list, act, adj. \n\n Let G b\ e a group acting on the objects in list via\n the action act<\ /A>, and let adj be a function taking\n two objects from list\ as arguments and returning true or\n false. The func\ tion adj will describe the adjacency\n between objects from l\ ist, which is invariant under the action of\n G. This varian\ t of the constructor returns a digraph with\n vertices the objects of <\ A>list and directed edges [x, y]\n when f(x, y) is true. \n\n The action of the group G on the objects in \ list is stored\n in the attribute , \ and is used to speed up\n operations like .\n \n\n for a Grape package graph\n \n if obj is a &Grape; package graph (i.e. a record for which \ the\n function IsGraph returns true), then this function \ returns\n a digraph isomorphic to obj.\n \n\n <\ Mark>for a binary relation\n \n if obj is a bi\ nary relation on the points [1 .. n] for\n some posititve intege\ r n, then this function returns the digraph\n defined by obj<\ /A>. Specifically, this function returns a digraph\n which has n\ vertices, and which has an edge with source i\n and range j<\ /C> if and only if [i,j] is a pair in\n the binary relation o\ bj.\n \n \n\n gr := Digr\ aph([\n> [2, 5, 8, 10], [2, 3, 4, 2, 5, 6, 8, 9, 10], [1],\n> [3, 5, 7, 8, 10]\ , [2, 5, 7], [3, 6, 7, 9, 10], [1, 4],\n> [1, 5, 9], [1, 2, 7, 8], [3, 5]]);\n\ \ngap> gr := Digraph([\"a\"\ , \"b\", \"c\"], [\"a\"], [\"b\"]);\n\ngap> gr := Digraph(5, [1, 2, 2, 4, 1, 1], [2, 3, 5, 5, 1, 1]);\n\ngap> Petersen := Graph(SymmetricGroup\ (5), [[1, 2]], OnSets,\n> function(x, y) return Intersection(x, y) = []; end);\ ;\ngap> Digraph(Petersen);\n\nga\ p> gr := Digraph([1 .. 10], ReturnTrue);\n]]>\n\n The next example illustrates the uses of the\ fourth and fifth variants of\n this constructor. The resulting digraph i\ s a strongly regular graph, and\n it is actually the point graph of the v\ an Lint-Schrijver partial\n geometry, . The algebra\ ic description\n is taken from the seminal paper of Calderbank and Kantor\ .\n f := GF(3 ^ 4);\nGF(\ 3^4)\ngap> gamma := First(f, x -> Order(x) = 5);\nZ(3^4)^64\ngap> L := Union([\ Zero(f)], List(Group(gamma)));\n[ 0*Z(3), Z(3)^0, Z(3^4)^16, Z(3^4)^32, Z(3^4)\ ^48, Z(3^4)^64 ]\ngap> omega := Union(List(L, x -> List(Difference(L, [x]), y \ -> x - y)));\n[ Z(3)^0, Z(3), Z(3^4)^5, Z(3^4)^7, Z(3^4)^8, Z(3^4)^13, Z(3^4)^\ 15, \n Z(3^4)^16, Z(3^4)^21, Z(3^4)^23, Z(3^4)^24, Z(3^4)^29, Z(3^4)^31, \n \ Z(3^4)^32, Z(3^4)^37, Z(3^4)^39, Z(3^4)^45, Z(3^4)^47, Z(3^4)^48, \n Z(3^4)^5\ 3, Z(3^4)^55, Z(3^4)^56, Z(3^4)^61, Z(3^4)^63, Z(3^4)^64, \n Z(3^4)^69, Z(3^4\ )^71, Z(3^4)^72, Z(3^4)^77, Z(3^4)^79 ]\ngap> adj := function(x, y)\n> retur\ n x - y in omega;\n> end;\nfunction( x, y ) ... end\ngap> digraph := Digraph(A\ sList(f), adj);\n\ngap> group \ := Group(Z(3));;\ngap> act := \\*;\n\ngap> digraph := Digraph\ (group, List(f), act, adj);\n\ \n]]>\n \n\n\n \n \n A digraph\ .\n \n If the optional first argument filt i\ s present, then this should\n specify the category or representation the di\ graph being created will\n belong to. For example, if filt is ,\n then the digraph being created will be mutabl\ e, if filt is , then the digraph\ will be immutable. \n If the optional first argument filt is not pr\ esent, then is used by default. \n\ \n If list is the adjacency matrix of a digraph in the sense of\n \ , then this operation returns the digraph\n \ which is defined by list. \n\n Alternatively, if list is\ a square boolean matrix, then this\n operation returns the digraph with Length(list)\n vertices which has the edge [i,j] \ if and only if\n list[i][j] is true. \n\n DigraphByAdjacencyMatrix([\n> [0, 1, 0, 2, 0],\n> [1, 1, 1\ , 0, 1],\n> [0, 3, 2, 1, 1],\n> [0, 0, 1, 0, 1],\n> [2, 0, 0, 0, 0]]);\n\ngap> D := DigraphByAdjacencyMatr\ ix([\n> [true, false, true],\n> [false, false, true],\n> [false, true, false]]\ );\n\ngap> OutNeighbours(D);\n[ [ \ 1, 3 ], [ 3 ], [ 2 ] ]\ngap> D := DigraphByAdjacencyMatrix(IsMutableDigraph, \ \n> [[true, false, true],\n> [false, false, true],\n> [false, true, false]])\ ;\n\n]]>\n \ \n\n\n \n \n A digraph.\n \n If t\ he optional first argument filt is present, then this should\n speci\ fy the category or representation the digraph being created will\n belong t\ o. For example, if filt is ,\n then \ the digraph being created will be mutable, if filt is , then the digraph will be immutable. \n If the optio\ nal first argument filt is not present, then is used by default. \n\n If list is list of pairs o\ f positive integers, then this function\n returns the digraph with the mini\ mum number of vertices m such that\n its list equal list. \ \n\n If the optional second argument n is a positive integer with\n \ n >= m (with m defined as above),\n then this funct\ ion returns the digraph with n vertices and list\n list. \ \n\n See .\n\n Digr\ aphByEdges(\n> [[1, 3], [2, 1], [2, 3], [2, 5], [3, 6],\n> [4, 6], [5, 2], [5\ , 4], [5, 6], [6, 6]]);\n\ngap> D\ igraphByEdges(\n> [[1, 3], [2, 1], [2, 3], [2, 5], [3, 6],\n> [4, 6], [5, 2],\ [5, 4], [5, 6], [6, 6]], 12);\n\ \ngap> DigraphByEdges(IsMutableDigraph, \n> [[1, 3], [2, 1], [2, 3], [2, 5], [\ 3, 6],\n> [4, 6], [5, 2], [5, 4], [5, 6], [6, 6]], 12);\n\n]]>\n \n\n\n \ \n \n \ \n An immutable digraph.\n \n \n If G is a permutation group, edges is an edge or list of\n edges, \ and n is a non-negative integer such that G fixes\n [1 .. \ n] setwise, then\n this operation returns an immutable digraph w\ ith n vertices and the union\n of the orbits of the edges in edg\ es under the action of the\n permutation group G. An edge in t\ his context is simply a pair of\n positive integers.\n \n\n If th\ e optional third argument n is not present, then the largest\n moved\ point of the permutation group G is used by default. \n\n digraph := EdgeOrbitsDigraph(Group((1, 3), (1, 2)(3, 4)),\n\ > [[1, 2], [4, 5]], 5);\n\ngap> OutNeighbours(digraph);\n[ [ 2, 4, 5 ], [ 1, 3,\ 5 ], [ 2, 4, 5 ], [ 1, 3, 5 ], [ ] ]\ngap> RepresentativeOutNeighbours(digra\ ph);\n[ [ 2, 4, 5 ], [ ] ]\n]]>\n \n\n\ \n \n \n \n A digraph.\n \n If the optional first argument fi\ lt is present, then this should\n specify the category or representation \ the digraph being created will\n belong to. For example, if filt is ,\n then the digraph being created will be muta\ ble, if filt is , then the digraph\ will be immutable. \n If the optional first argument filt is not pres\ ent, then is used by default. \n\n I\ f list is a list of lists of positive integers list the range\n [1 \ .. Length(list)], then this function returns the\n digraph with ve\ rtices E^0=[1 .. Length(list)], and\n edges correspondin\ g to the entries of list. More precisely, there is an\n edge with sour\ ce vertex i and range vertex j if i is list\n list\ [j]. \n\n If i occurs list list[j] with mult\ iplicity k,\n then there are k multiple edges from i to \ j. \n\n See .\n\n D := DigraphByInNeighbours([\n> [2, 5, 8, 10], [2, 3, 4, 5, 6, 8, 9, 1\ 0],\n> [1], [3, 5, 7, 8, 10], [2, 5, 7], [3, 6, 7, 9, 10], [1, 4],\n> [1, 5, 9\ ], [1, 2, 7, 8], [3, 5]]);\n\nga\ p> D := DigraphByInNeighbours([[2, 3, 2], [1], [1, 2, 3]]);\n\ngap> D := DigraphByInNeighbours(IsMutableDig\ raph, \n> [[2, 3, 2], [1], [1, 2, 3]]);\n\n]]>\n \n\n\n \n \n An immutable digraph.\n \n Let \ G be any group and let gens be a list of elements of\n G.\ This operation returns an immutable digraph that corresponds to\n the Cayl\ ey graph of G with respect\n gens. The vertices are the eleme\ nts of G. There exists an edge\n from the vertex u to the ver\ tex v if and only if there exists\n a generator g in gens<\ /A> such that x * g = y. \n\n \n\n If the optional second argument \ gens is not present, then the\n generators of G are used by d\ efault. \n\n The digraph created by this operation belongs to the catego\ ry , the group G can be recovered\ from the\n digraph using , and the gen\ erators\n gens can be obtained using . \n\n Note that this function can only return an immutable di\ graph.\n\n G := DihedralGroup(8);\n\ngap> CayleyDigraph(G);\n\ngap> G := DihedralGroup(IsPermGroup, 8);\nGroup([ (1,2,3,4),\ (2,4) ])\ngap> CayleyDigraph(G);\n\ngap> digraph := CayleyDigraph(G, [()]);\n\ngap> GroupOfCayleyDigraph(digraph) = G;\ntrue\ngap> GeneratorsOfC\ ayleyDigraph(digraph);\n[ () ]]]>\n \n\n\ \n \n\n Changing representations\n \ \n \n \ A binary relation.\n \n If digraph is a digr\ aph with a positive number of vertices\n n, and no multiple edges, t\ hen this operation returns a binary\n relation on the points [1..n].\ \n The pair [i,j] is in the binary relation if and only if\n [\ i,j] is an edge in digraph.\n \n D :\ = Digraph([[3, 2], [1, 2], [2], [3, 4]]);\n\ngap> AsBinaryRelation(D);\nBinary Relation on 4 points\n]]>\n \n\n\n \n \n A digraph, or fail.\n \n If the optional first argument filt is pres\ ent, then this should\n specify the category or representation the digraph \ being created will\n belong to. For example, if filt is ,\n then the digraph being created will be mutable, if \ filt is , then the digraph will \ be immutable. \n If the optional first argument filt is not present,\ then is used by default. \n\n I\ f trans is a transformation, and n is a non-negative integer\n \ such that the restriction of trans to [1 .. n] defines\ \n a transformation of [1 .. n], then AsDigraph\n r\ eturns the functional digraph with n vertices defined by\n trans<\ /A>. See .\n \n\n Specifically, t\ he digraph returned by AsDigraph has n edges:\n for each ver\ tex x in [1 .. n], there is a unique edge\n with sourc\ e x; this edge has range x^trans.\n \n\n If the\ optional second argument n is not supplied, then the degree of\n th\ e transformation trans is used by default. If the restriction of\n \ trans to [1 .. n] does not define a transformation of\n \ [1 .. n], then AsDigraph(trans, n)\n r\ eturns fail.\n\n f := Transformation([4, 3,\ 3, 1, 7, 9, 10, 4, 2, 3]);\nTransformation( [ 4, 3, 3, 1, 7, 9, 10, 4, 2, 3 ]\ )\ngap> AsDigraph(f);\n\ngap> \ AsDigraph(f, 4);\n\ngap> AsDigra\ ph(f, 5);\nfail\ngap> b := BinaryRelationOnPoints(\n> [[3], [1, 3, 5], [1], [1\ , 2, 4], [2, 3, 5]]);\nBinary Relation on 5 points\ngap> D := AsDigraph(b);\n<\ immutable digraph with 5 vertices, 11 edges>\n]]>\n \ \n\n\n \n \ \n A &Grape; package graph.\n \n If di\ graph is a mutable or immutable digraph without multiple edges, then this \ operation\n returns a &Grape; package graph that is isomorphic to digrap\ h. \n\n If digraph is a multidigraph, then since &Grape; doe\ s not support\n multiple edges, the multiple edges will be reduced to a sin\ gle edge in the\n result. In order words, for a multidigraph this operation\ will return the\n same as Graph(DigraphRemoveAllMultipleEdges(di\ graph)).\n\n Petersen := Graph(Symmetri\ cGroup(5), [[1, 2]], OnSets,\n> function(x, y) return Intersection(x, y) = [];\ end);;\ngap> Display(Petersen);\nrec(\n adjacencies := [ [ 3, 5, 8 ] ],\n g\ roup := \n Group( [ ( 1, 2, 3, 5, 7)( 4, 6, 8, 9,10), ( 2, 4)( 6, 9)( 7,10) \ \n ] ),\n isGraph := true,\n names := [ [ 1, 2 ], [ 2, 3 ], [ 3, 4 ], [ \ 1, 3 ], [ 4, 5 ], \n [ 2, 4 ], [ 1, 5 ], [ 3, 5 ], [ 1, 4 ], [ 2, 5 ] ],\ \n order := 10,\n representatives := [ 1 ],\n schreierVector := [ -1, 1, 1,\ 2, 1, 1, 1, 1, 2, 2 ] )\ngap> Digraph(Petersen);\n\ngap> Graph(last) = Petersen;\ntrue]]>\n \n\n\n \n \n A &Grape; package graph.\n \n \ If digraph is a digraph, then this method returns the same as\n , except that if digraph is immutable, then the\n \ result will be stored as a mutable attribute of digraph.\n In this l\ atter case, when AsGraph(digraph) is called\n subseque\ ntly, the same &GAP; object will be returned as before.\n\n D := Digraph([[1, 2], [3], []]);\n\ngap> G := AsGraph(D);\nrec( adjacencies := [ [ 1, 2 ], [ 3 ], [ ]\ ], group := Group(()), \n isGraph := true, names := [ 1 .. 3 ], order := 3, \ \n representatives := [ 1, 2, 3 ], schreierVector := [ -1, -2, -3 ] )\n]]>\n \n\n\n \n \n A transformation, or fail\n \n If digraph is a functional digraph, \ then AsTransformation\n returns the transformation which is defined \ by digraph. See . Otherwise,\ \n AsTransformation(digraph) returns fail. \n\n If digraph is a functional digraph with n vertices, the\ n\n AsTransformation(digraph) will return the\n tra\ nsformation f of degree at most n where for each 1\n \\l\ eq i \\leq n, i ^ f is equal to the unique out-neighbour of\n ve\ rtex i in digraph.\n\n D := Digraph(\ [[1], [3], [2]]);\n\ngap> AsTransf\ ormation(D);\nTransformation( [ 1, 3, 2 ] )\ngap> D := CycleDigraph(IsMutableD\ igraph, 3);\n\ngap> AsTransformation\ (D);\nTransformation( [ 2, 3, 1 ] )\ngap> AsPermutation(last);\n(1,2,3)\ngap> \ D := Digraph([[2, 3], [], []]);\n\ \ngap> AsTransformation(D);\nfail]]>\n \n\n\n \n\n New digraphs from old\n \ \n \n \n \n \ \n A digraph.\n \n Each of these operatio\ ns returns a new copy of digraph,\n of the appropriate mutability, r\ etaining none of the attributes or\n properties of digraph. \n\n\ DigraphCopy is a synonym for DigraphCopySameMutability.\n D := CycleDigraph(10);\n\ngap> DigraphCopy(D) = D;\ntrue\ngap> IsIdenticalObj(DigraphCopy(D)\ , D);\nfalse\ngap> DigraphMutableCopy(D);\n\n]]>\n \n\n\n \ \n \n \n \n \n A digraph.\n \n Each of these operations returns either the original argument\n \ digraph, or a new copy of digraph of the appropriate\n mutabilit\ y, according to the mutability of digraph.\n C \ := CycleDigraph(10);\n\ngap> D := Di\ graphImmutableCopyIfImmutable(C);\n\ngap> IsIdenticalObj(C, D);\nfalse\ngap> C = D;\ntrue\ngap> D := DigraphIm\ mutableCopyIfMutable(C);\n\ngap> IsI\ denticalObj(C, D);\ntrue\ngap> C = D;\ntrue\ngap> D := DigraphMutableCopyIfMut\ able(C);\n\ngap> IsMutableDigraph(D)\ ;\nfalse\ngap> D := DigraphMutableCopyIfImmutable(C);\n\ngap> IsMutableDigraph(D);\ntrue\ngap> C := CycleDigraph\ (IsMutableDigraph, 10);\n\ngap> D \ := DigraphImmutableCopyIfImmutable(C);\n\ngap> IsIdenticalObj(C, D);\ntrue\ngap> C = D;\ntrue\ngap> D := Digraph\ ImmutableCopyIfMutable(C);\n\nga\ p> IsIdenticalObj(C, D);\nfalse\ngap> C = D;\ntrue\ngap> D := DigraphMutableCo\ pyIfMutable(C);\n\ngap> IsMutableD\ igraph(D);\ntrue\ngap> D := DigraphMutableCopyIfImmutable(C);\n\ngap> IsIdenticalObj(C, D);\ntrue\ngap> IsMutabl\ eDigraph(D);\ntrue]]>\n \n\n\n \n \n A digraph.\n \n If digraph is a digraph, a\ nd verts is a subset of the\n vertices of digraph, then this \ operation returns a digraph\n constructed from digraph by retaining \ precisely those vertices in\n verts, and those edges whose source an\ d range vertices are both\n contained in verts. \n\n The vert\ ices of the induced subdigraph are\n [1..Length(verts)] but the orig\ inal vertex labels can be\n accessed via . \n\n If digraph belongs to , \ then\n digraph is modified in place. If digraph belongs to , a new immutable digraph containing th\ e\n appropriate\n vertices and edges is returned. \n\n D := Digraph([[1, 1, 2, 3, 4, 4], [1, 3, 4], [3, 1], [1, 1]]);\n\ \ngap> InducedSubdigraph(D, \ [1, 3, 4]);\n\ngap> DigraphVe\ rtices(last);\n[ 1 .. 3 ]\ngap> D := DigraphMutableCopy(D);\n\ngap> new := InducedSubdigraph(D, [1, 3, 4]);\ \n\ngap> D = new;\ntrue\n]]>\n \n\n\n \n \n \n A digraph.\n \n This functio\ n returns a digraph isomorphic to the subdigraph of\n digraph induce\ d by the set of non-isolated vertices,\n i.e. the set of those vertices of \ digraph which are the source or\n range of some edge in digraph.\n See .\n \n\n The ordering \ of the remaining vertices of digraph is preserved, as are\n the labe\ ls of the remaining vertices and edges;\n see and .\n This can allow one to match\ a vertex in the reduced digraph to the\n corresponding vertex in digrap\ h.\n \n\n If digraph is immutable, then a new immutable d\ igraph is returned.\n Otherwise, the isolated vertices of the mutable digra\ ph digraph are\n removed in-place.\n D :\ = Digraph([[1, 2], [], [], [1, 4], []]);\n\ngap> R := ReducedDigraph(D);\n\ngap> OutNeighbours(R);\n[ [ 1, 2 ], [ ], [ 1, 3 ] ]\ngap> DigraphEdge\ s(D);\n[ [ 1, 1 ], [ 1, 2 ], [ 4, 1 ], [ 4, 4 ] ]\ngap> DigraphEdges(R);\n[ [ \ 1, 1 ], [ 1, 2 ], [ 3, 1 ], [ 3, 3 ] ]\ngap> DigraphVertexLabel(R, 3);\n4\ngap\ > DigraphVertexLabel(R, 2);\n2\ngap> D := Digraph(IsMutableDigraph, [[], [3], \ [2]]);\n\ngap> ReducedDigraph(D);\n<\ mutable digraph with 2 vertices, 2 edges>\ngap> D;\n\n]]>\n \n\n\n \n \n \n \n \n A digraph\ .\n \n If digraph is a digraph, then Maxi\ malSymmetricSubdigraph\n returns a symmetric digraph without multiple e\ dges which has the same\n vertex set as digraph, and whose edge list\ is formed from\n digraph by ignoring the multiplicity of edges, and\ by ignoring\n edges [u,v] for which there does not exist an edge [v,u].\n \n\n The digraph returned by MaximalSymmetricSubdig\ raphWithoutLoops is\n the same, except that loops are removed. \n \ \n If digraph is immutable, then a new immutable digraph is returne\ d.\n Otherwise, the mutable digraph digraph is changed in-place into\ such\n a digraph described above. \n\n See , , and\n for more information.\n D := Digraph([[2, 2]\ , [1, 3], [4], [3, 1]]);\n\ng\ ap> not IsSymmetricDigraph(D) and IsMultiDigraph(D);\ntrue\ngap> OutNeighbours\ (D);\n[ [ 2, 2 ], [ 1, 3 ], [ 4 ], [ 3, 1 ] ]\ngap> S := MaximalSymmetricSubdi\ graph(D);\n\ngap> IsSymm\ etricDigraph(S) and not IsMultiDigraph(S);\ntrue\ngap> OutNeighbours(S);\n[ [ \ 2 ], [ 1 ], [ 4 ], [ 3 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> MaximalSymmetricSubdigraph(D);\n<\ mutable empty digraph with 3 vertices>\ngap> D;\n\n]]>\n \n\n\n \ \n \n \n A dig\ raph.\n \n If digraph is a digraph, then \ MaximalAntiSymmetricSubdigraph\n returns an anti-symmetric subdigraph o\ f digraph formed by\n retaining the vertices of digraph, disc\ arding any duplicate edges,\n and discarding any edge [i,j] of di\ graph where i > j\n and the reverse edge [j,i] is an edge\ of digraph.\n In other words, for every\n symmetric pair of edge\ s [i,j] and [j,i] in digraph, where \n i and j are distinct, it discards the the edge\n [\\max(i,j),\\min(i,j)]<\ /M>.\n \n\n If digraph is immutable, then a new immutable dig\ raph is returned.\n Otherwise, the mutable digraph digraph is change\ d in-place. \n\n See for more in\ formation.\n D := Digraph([[2, 2], [1, 3], [4], [3\ , 1]]);\n\ngap> not IsAntiSym\ metricDigraph(D) and IsMultiDigraph(D);\ntrue\ngap> OutNeighbours(D);\n[ [ 2, \ 2 ], [ 1, 3 ], [ 4 ], [ 3, 1 ] ]\ngap> D := MaximalAntiSymmetricSubdigraph(D);\ \n\ngap> IsAntiSymme\ tricDigraph(D) and not IsMultiDigraph(D);\ntrue\ngap> OutNeighbours(D);\n[ [ 2\ ], [ 3 ], [ 4 ], [ 1 ] ]\ngap> D := Digraph(IsMutableDigraph, [[2], [1]]);\n<\ mutable digraph with 2 vertices, 2 edges>\ngap> MaximalAntiSymmetricSubdigraph\ (D);\n\ngap> D;\n\n]]>\n \n\n\n <\ ManSection>\n \n \n \n \n A digraph, or fail.\n \ \n If digraph is a digraph with at least one vertex, th\ en\n UndirectedSpanningForest returns an undirected spanning forest \ of\n digraph, otherwise this attribute returns fail. See for the definition of an undire\ cted\n spanning forest. \n\n If digraph is a digraph with at l\ east one vertex and whose is\ connected (see ), then Undirecte\ dSpanningTree returns\n an undirected spanning tree of digraph, \ otherwise this attribute\n returns fail. See for the\n definition of an undirected spanning tree. \n\n If digraph is immutable, then an immutable digraph is returned\ .\n Otherwise, the mutable digraph digraph is changed in-place into \ an\n undirected spanning tree of digraph. \n\n Note that for a\ n immutable digraph that has known undirected spanning tree,\n the attribut\ e UndirectedSpanningTree returns the same digraph as\n the attribute\ UndirectedSpanningForest.\n\n D := Digraph\ ([[1, 2, 1, 3], [1], [4], [3, 4, 3]]);\n\ngap> UndirectedSpanningTree(D);\nfail\ngap> forest := UndirectedS\ panningForest(D);\n\ngap\ > OutNeighbours(forest);\n[ [ 2 ], [ 1 ], [ 4 ], [ 3 ] ]\ngap> IsUndirectedSpa\ nningForest(D, forest);\ntrue\ngap> DigraphConnectedComponents(forest).comps;\ \n[ [ 1, 2 ], [ 3, 4 ] ]\ngap> DigraphConnectedComponents(MaximalSymmetricSubd\ igraph(D)).comps;\n[ [ 1, 2 ], [ 3, 4 ] ]\ngap> UndirectedSpanningForest(Maxim\ alSymmetricSubdigraph(D))\n> = forest;\ntrue\ngap> D := CompleteDigraph(4);\n<\ immutable complete digraph with 4 vertices>\ngap> tree := UndirectedSpanningTr\ ee(D);\n\ngap> IsUndirec\ tedSpanningTree(D, tree);\ntrue\ngap> tree = UndirectedSpanningForest(D);\ntru\ e\ngap> UndirectedSpanningForest(EmptyDigraph(0));\nfail\ngap> D := PetersenGr\ aph(IsMutableDigraph);\n\ngap> Und\ irectedSpanningTree(D);\n\ngap> D;\ \n\n]]>\n \n\n\n \n \n A digraph.\n \n If dig\ raph is a digraph, and p is a partition of the vertices\n of \ digraph, then this operation returns a digraph constructed by\n amalgam\ ating all vertices of digraph which lie in the same part of\n p.\n \n\n A partition of the vertices of digraph is a list o\ f non-empty\n disjoint lists, such that the union of all the sub-lists is e\ qual\n to vertex set of digraph. In particular, each vertex must app\ ear\n in precisely one sub-list.\n \n\n The vertices of digrap\ h in part i of p will become\n vertex i in the quo\ tient, and there exists some edge in digraph\n with source in part <\ C>i and range in part j if and only if there\n is an edge from <\ C>i to j in the quotient.\n In particular, this means that the q\ uotient of a digraph has no multiple edges.\n which was a change introduced\ in version 1.0.0 of the &Digraphs; package.\n \n\n If digraph belongs to , then\n digraph is mod\ ified in place. If digraph belongs to , a new immutable digraph with the above\n properties is returned.<\ P/>\n\n D := Digraph([[2, 1], [4], [1], [1, 3, 4]]\ );\n\ngap> DigraphVertices(D);\n[ \ 1 .. 4 ]\ngap> DigraphEdges(D);\n[ [ 1, 2 ], [ 1, 1 ], [ 2, 4 ], [ 3, 1 ], [ 4\ , 1 ], [ 4, 3 ], \n [ 4, 4 ] ]\ngap> p := [[1], [2, 4], [3]];\n[ [ 1 ], [ 2, \ 4 ], [ 3 ] ]\ngap> quo := QuotientDigraph(D, p);\n\ngap> DigraphVertices(quo);\n[ 1 .. 3 ]\ngap> DigraphEdges(qu\ o);\n[ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ], [ 2, 3 ], [ 3, 1 ] ]\ngap> Quot\ ientDigraph(EmptyDigraph(0), []);\n\n\ ]]>\n \n\n\n \n \n \n A digraph.\n \n The re\ verse of a digraph is the digraph formed by reversing the orientation\n of \ each of its edges, i.e. for every edge [i, j] of a digraph, the\n re\ verse contains the corresponding edge [j, i]. \n\n DigraphReve\ rse returns the reverse of the digraph digraph. If\n digraph<\ /A> is immutable, then a new immutable digraph is returned. Otherwise,\n th\ e mutable digraph digraph is changed in-place into its reverse.\n D := Digraph([[3], [1, 3, 5], [1], [1, 2, 4], [2, 3, 5]\ ]);\n\ngap> DigraphReverse(D);\n<\ immutable digraph with 5 vertices, 11 edges>\ngap> OutNeighbours(last);\n[ [ 2\ , 3, 4 ], [ 4, 5 ], [ 1, 2, 5 ], [ 4 ], [ 2, 5 ] ]\ngap> D := Digraph([[2, 4],\ [1], [4], [3, 4]]);\n\ngap> Digra\ phEdges(D);\n[ [ 1, 2 ], [ 1, 4 ], [ 2, 1 ], [ 3, 4 ], [ 4, 3 ], [ 4, 4 ] ]\ng\ ap> DigraphEdges(DigraphReverse(D));\n[ [ 1, 2 ], [ 2, 1 ], [ 3, 4 ], [ 4, 1 ]\ , [ 4, 3 ], [ 4, 4 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> OutNeighbours(D);\n[ [ 2 ], [ 3 ], [ \ 1 ] ]\ngap> DigraphReverse(D);\n\nga\ p> OutNeighbours(D);\n[ [ 3 ], [ 1 ], [ 2 ] ]\n]]>\n \ \n\n\n \n \n \n A digrap\ h.\n \n The dual of digraph has the s\ ame vertices as digraph,\n and there is an edge in the dual from \ i to j\n whenever there is no edge from i to j in \ digraph.\n The dual is sometimes called the complement\ . \n\n DigraphDual returns the dual of the digraph digraph\ . If\n digraph is an immutable digraph, then a new immutable digraph\ is\n returned. Otherwise, the mutable digraph digraph is changed in\ -place\n into its dual.\n D := Digraph([[2, 3],\ [], [4, 6], [5], [],\n> [7, 8, 9], [], [], []]);\n\ngap> DigraphDual(D);\n\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphDual(D);\n\ngap> D;\n\n]]>\n\ \n\n\n \n \n \n A digraph.\n \n If\ digraph is a digraph, then this attribute gives the minimal\n symme\ tric digraph which has the same vertices and contains all the edges of\n digraph. \n \n A digraph is symmetric if its adjacency ma\ trix \n is symmetric. For a digraph with mu\ ltiple\n edges this means that there are the same number of edges from a ve\ rtex\n u to a vertex v as there are from v to u\ ; \n see . \n\n If digraph i\ s immutable, then a new immutable digraph is returned.\n Otherwise, the mut\ able digraph digraph is changed in-place into its\n symmetric closur\ e.\n D := Digraph([[1, 2, 3], [2, 4], [1], [3, 4]]);\n\ \ngap> D := DigraphSymmetricClosur\ e(D);\n\ngap> IsSymmetr\ icDigraph(D);\ntrue\ngap> List(OutNeighbours(D), AsSet);\n[ [ 1, 2, 3 ], [ 1, \ 2, 4 ], [ 1, 4 ], [ 2, 3, 4 ] ]\ngap> D := Digraph([[2, 2], [1]]);\n\ngap> D := DigraphSymmetricClosure(D);\ \n\ngap> OutNeighbo\ urs(D);\n[ [ 2, 2 ], [ 1, 1 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\ \n\ngap> DigraphSymmetricClosure(D);\ \n\ngap> D;\n\n]]>\n \n\n\n \n \n \n \n \n A digraph.\ \n \n If digraph is a digraph with no multiple edges, \ then these\n attributes return the (reflexive) transitive closure of dig\ raph. \n\n A digraph is reflexive if it has a loop at every v\ ertex, and it is\n transitive if whenever [i,j] and [j,k]<\ /C> are edges of\n digraph, [i,k] is also an edge. The (r\ eflexive)\n transitive closure of a digraph digraph is the lea\ st\n (reflexive and) transitive digraph containing digraph. \n\n \ If digraph is immutable, then a new immutable digraph is returned.\n\ Otherwise, the mutable digraph digraph is changed in-place into its\ \n (reflexive) transitive closure. \n\n Let n be the number of\ vertices of digraph, and let\n m be the number of edges. Fo\ r an arbitrary digraph, these\n attributes will use a version of the Floyd-\ Warshall algorithm, with\n complexity O(n^3).\n\n However, for a \ topologically sortable digraph [see ], these attributes will use methods\n with complexity O(m + n + m \ \\cdot n) when this is faster. \n\n D := Di\ graphFromDiSparse6String(\".H`eOWR`Ul^\");\n\ngap> IsReflexiveDigraph(D) or IsTransitiveDigraph(D);\nfalse\ngap>\ OutNeighbours(D);\n[ [ 4, 6 ], [ 1, 3 ], [ ], [ 5 ], [ ], [ 7, 8, 9 ], [ ]\ , [ ], \n [ ] ]\ngap> T := DigraphTransitiveClosure(D);\n\ngap> OutNeighbours(T);\n[ [ 4, 6, 5, 7\ , 8, 9 ], [ 1, 3, 4, 5, 6, 7, 8, 9 ], [ ], [ 5 ], \n [ ], [ 7, 8, 9 ], [ ]\ , [ ], [ ] ]\ngap> RT := DigraphReflexiveTransitiveClosure(D);\n\ngap> OutNeighbours(RT);\n[ [ 4, 6,\ 5, 7, 8, 9, 1 ], [ 1, 3, 4, 5, 6, 7, 8, 9, 2 ], [ 3 ], \n [ 5, 4 ], [ 5 ], [\ 7, 8, 9, 6 ], [ 7 ], [ 8 ], [ 9 ] ]\ngap> D := CycleDigraph(IsMutableDigraph,\ 3);\n\ngap> DigraphReflexiveTransit\ iveClosure(D);\n\ngap> D;\n\n]]>\n \n\n\n \n \n \n \ \n \n A digraph.\n \n If digraph is a topologica\ lly sortable digraph\n [see ]\n wi\ th no multiple edges, then these operations return the\n (reflexive) trans\ itive reduction of digraph. \n\n The (reflexive) transitive reduc\ tion of such a digraph is the unique\n least subgraph such that the (reflex\ ive) transitive closure of the\n subgraph is equal to the (reflexive) trans\ itive closure of digraph\n [see ].\n In order words, it is the least subgraph of digraph which\n retains the same reachability as digraph. \n\n If digraph is immutable, then a new immutable digraph is returned.\n Othe\ rwise, the mutable digraph digraph is changed in-place into its\n (r\ eflexive) transitive reduction. \n\n Let n be the number of verti\ ces of an arbitrary digraph, and let\n m be the number of edges.\ \n Then these operations\n use methods with complexity O(m + n + m \\\ cdot n).\n \n D := Digraph([[1, 2, 3], \ [3], [3]]);;\ngap> DigraphHasLoops(D);\ntrue\ngap> D1 := DigraphReflexiveTrans\ itiveReduction(D);\n\ngap> Digraph\ HasLoops(D1);\nfalse\ngap> OutNeighbours(D1);\n[ [ 2 ], [ 3 ], [ ] ]\ngap> D2\ := DigraphTransitiveReduction(D);\n\ngap> DigraphHasLoops(D2);\ntrue\ngap> OutNeighbours(D2);\n[ [ 2, 1 ], [ 3 \ ], [ 3 ] ]\ngap> DigraphReflexiveTransitiveClosure(D)\n> = DigraphReflexiveTr\ ansitiveClosure(D1);\ntrue\ngap> DigraphTransitiveClosure(D)\n> = DigraphTran\ sitiveClosure(D2);\ntrue\ngap> D := Digraph(IsMutableDigraph, [[1], [1], [1, 2\ , 3]]);\n\ngap> DigraphReflexiveTran\ sitiveReduction(D);\n\ngap> D;\n\n]]>\n \n\n\n \n \n A digraph.\n \n The opera\ tion returns a digraph constructed from digraph by adding a\n single\ new vertex, and no new edges. \n\n If the optional second argument \ label is a &GAP; object,\n then the new vertex will be labelled labe\ l.\n \n\n If digraph belongs to , then the\n vertex is added directly to digraph. If digra\ ph belongs to\n , an immutable copy o\ f digraph with\n the additional vertex is returned. \n\n D := CompleteDigraph(3);\n\ngap> new := DigraphAddVertex(D);\n\ngap> D = new;\nfalse\ngap> DigraphVertices(new);\n[ 1 .. 4 ]\n\ gap> new := DigraphAddVertex(D, Group([(1, 2)]));\n\ngap> DigraphVertexLabels(new);\n[ 1, 2, 3, Group([ (1,2) ])\ ]\ngap> D := CompleteBipartiteDigraph(IsMutableDigraph, 2, 3);\n\ngap> new := DigraphAddVertex(D);\n\ngap> D = new;\ntrue\n]]>\n \n\n\n \n \n \n \n A digraph.\n \n For a non-negati\ ve integer m, this operation returns a digraph\n constructed from digraph by adding m new vertices.\n \n\n Otherwise, if <\ A>labels is a list\n consisting of k &GAP; objects, then this op\ eration returns a\n digraph constructed from digraph by adding k<\ /C> new vertices,\n which are labelled according to this list.\n \n\ \n If digraph belongs to , then the\ \n vertices are added directly to digraph, which is changed in-place\ .\n If digraph belongs to , then t\ he\n result is returned as an immutable digraph.\n \n\n \ D := CompleteDigraph(3);\n\ngap> new := DigraphAddVertices(D, 3);\n\ngap> DigraphVertices(new);\n[ 1 .. 6 ]\ngap> new := DigraphAd\ dVertices(D, [Group([(1, 2)]), \"d\"]);\n\ngap> DigraphVertexLabels(new);\n[ 1, 2, 3, Group([ (1,2) ]), \"d\" ]\ \ngap> DigraphAddVertices(D, 0) = D;\ntrue\ngap> D := CompleteBipartiteDigraph\ (IsMutableDigraph, 2, 3);\n\ngap> n\ ew := DigraphAddVertices(D, 4);\n\n\ gap> D = new;\ntrue\n]]>\n \n\n\n \n \n \n A dig\ raph.\n \n If edge is a pair of vertices of \ digraph, or src and\n ran are vertices of digraph,\n then this operation returns a digraph constructed from digraph\ \n by adding a new edge with source edge[1] [src] and \ range\n edge[2] [ran].\n \n \n If digr\ aph belongs to , then the edge\n is add\ ed directly to digraph. If digraph belongs to , then an immutable copy of digraph with the\n \ additional edge is returned. \n\n D1 := Di\ graph([[2], [3], []]);\n\ngap> Dig\ raphEdges(D1);\n[ [ 1, 2 ], [ 2, 3 ] ]\ngap> D2 := DigraphAddEdge(D1, [3, 1]);\ \n\ngap> DigraphEdges(D2);\n[ [ 1,\ 2 ], [ 2, 3 ], [ 3, 1 ] ]\ngap> D3 := DigraphAddEdge(D2, [2, 3]);\n\ngap> DigraphEdges(D3);\n[ [ 1, 2 ], [\ 2, 3 ], [ 2, 3 ], [ 3, 1 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 4);\n<\ mutable digraph with 4 vertices, 4 edges>\ngap> new := DigraphAddEdge(D, [1, 3\ ]);\n\ngap> DigraphEdges(new);\n[ [ \ 1, 2 ], [ 1, 3 ], [ 2, 3 ], [ 3, 4 ], [ 4, 1 ] ]\ngap> D = new;\ntrue\n]]>\n \n\n\n \n \n \n A new digraph.\n\ \n \n This operation returns a new digraph with t\ he same vertices and edges as\n digraph and with additional edges co\ nsisting of the orbit of the\n edge edge under the action of the of\n digraph. If edge is already a\ n edge in digraph, then\n digraph is returned unchanged. The \ argument digraph must be\n an immutable digraph.\n \n\n An\ edge is simply a pair of vertices of digraph.\n\n gr1 := CayleyDigraph(DihedralGroup(8));\n\ngap> gr2 := DigraphAddEdgeOrbit(gr1, [1, 8]);\n\ngap> DigraphEdges(gr1);\n[ [ 1, 2 ], [ 1, 3 \ ], [ 1, 4 ], [ 2, 1 ], [ 2, 8 ], [ 2, 6 ], \n [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [\ 4, 6 ], [ 4, 7 ], [ 4, 1 ], \n [ 5, 3 ], [ 5, 2 ], [ 5, 8 ], [ 6, 4 ], [ 6, \ 5 ], [ 6, 2 ], \n [ 7, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 7 ], [ 8, 6 ], [ 8, 5 ] \ ]\ngap> DigraphEdges(gr2);\n[ [ 1, 2 ], [ 1, 3 ], [ 1, 4 ], [ 1, 8 ], [ 2, 1 ]\ , [ 2, 8 ], \n [ 2, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [ 3, 2 ], \n\ [ 4, 6 ], [ 4, 7 ], [ 4, 1 ], [ 4, 5 ], [ 5, 3 ], [ 5, 2 ], \n [ 5, 8 ], [ \ 5, 4 ], [ 6, 4 ], [ 6, 5 ], [ 6, 2 ], [ 6, 7 ], \n [ 7, 8 ], [ 7, 1 ], [ 7, 3\ ], [ 7, 6 ], [ 8, 7 ], [ 8, 6 ], \n [ 8, 5 ], [ 8, 1 ] ]\ngap> gr3 := Digrap\ hRemoveEdgeOrbit(gr2, [1, 8]);\n\ \ngap> gr3 = gr1;\ntrue\n]]>\n \n\n\n \ \n \n A digraph.\n \n If edges is a (possib\ ly empty) list of pairs of vertices of\n digraph, then this operatio\ n returns a digraph constructed from\n digraph by adding the edges s\ pecified by edges. More\n precisely, for every edge in ed\ ges, a new edge\n will be added with source edge[1] and range edges[2].\n \n\n If an edge is included in edges with mu\ ltiplicity k,\n then it will be added k times.\n\n If d\ igraph belongs to , then the edges\n ar\ e added directly to digraph. If digraph belongs to , then the result is returned as an immutable\n \ digraph.\n \n\n func := function(n)\n> lo\ cal source, range, i;\n> source := [];\n> range := [];\n> for i in [1 .. n\ - 2] do\n> Add(source, i);\n> Add(range, i + 1);\n> od;\n> return Dig\ raph(n, source, range);\n> end;;\ngap> D := func(1024);\n\ngap> new := DigraphAddEdges(D,\n> [[1023, 1024]\ , [1, 1024], [1023, 1024], [1024, 1]]);\n\ngap> D = new;\nfalse\ngap> D2 := DigraphMutableCopy(func(1\ 024));\n\ngap> new := DigraphA\ ddEdges(D2,\n> [[1023, 1024], [1, 1024], [1023, 1024], [1024, 1]]);\n\ngap> D2 = new;\ntrue\n]]>\n \n\n\n \n \n A digraph.\n \n If v is a vertex of digraph, then this operation \ returns a\n digraph constructed from digraph by removing vertex v\ ,\n along with any edge whose source or range vertex is v. \n\ \n If digraph has n vertices, then the vertices of the return\ ed\n digraph are [1..n-1], but the original labels can be\n acces\ sed via . \n\n If digraph bel\ ongs to , then the\n vertex is removed dire\ ctly from digraph. If digraph belongs\n to , an immutable copy of digraph\n without the vertex \ is returned. \n\n D := Digraph([\"a\", \"b\", \ \"c\"],\n> [\"a\", \"a\", \"b\", \"c\", \"c\"],\n> \ [\"b\", \"c\", \"a\", \"a\", \"c\"]);\n\ngap> DigraphVertexLabels(D);\n[ \"a\", \"b\", \"c\" ]\ngap> Digr\ aphEdges(D);\n[ [ 1, 2 ], [ 1, 3 ], [ 2, 1 ], [ 3, 1 ], [ 3, 3 ] ]\ngap> new :\ = DigraphRemoveVertex(D, 2);\n\nga\ p> DigraphVertexLabels(new);\n[ \"a\", \"c\" ]\ngap> D := CycleDigraph(IsMutab\ leDigraph, 5);\n\ngap> new := Digrap\ hRemoveVertex(D, 1);\n\ngap> Digraph\ VertexLabels(D);\n[ 2, 3, 4, 5 ]\ngap> D = new;\ntrue\n]]>\n \n\n\n \n \n A digraph.\n \n If verts is a (possibly empty) duplicate-free list of vertices \ of\n digraph, then this operation returns a digraph constructed from\ \n digraph by removing every vertex in verts, along with any \ edge\n whose source or range vertex is in verts. \n\n If di\ graph has n vertices, then the vertices of the new\n digraph are\ [1 .. n-Length(verts)], but the\n original labels can be acc\ essed via . \n\n If digraph b\ elongs to , then the\n vertices are removed\ directly from digraph. If digraph belongs\n to , an immutable copy of digraph\n without the ve\ rtices is returned. \n\n D := Digraph([[3], [1,\ 3, 5], [1], [1, 2, 4], [2, 3, 5]]);\n\ngap> SetDigraphVertexLabels(D, [\"a\", \"b\", \"c\", \"d\", \"e\"]);\ng\ ap> new := DigraphRemoveVertices(D, [2, 4]);\n\ngap> DigraphVertexLabels(new);\n[ \"a\", \"c\", \"e\" ]\ngap> D \ := CycleDigraph(IsMutableDigraph, 5);\n\ngap> new := DigraphRemoveVertices(D, [1, 3]);\n\ngap> DigraphVertexLabels(D);\n[ 2, 4, 5 ]\ngap> D = new;\ntru\ e\n]]>\n \n\n\n \n \n \n A digraph.\n \n If digraph is a digraph with no multiple edge\ s and edge is a\n pair of vertices of digraph, or src \ and ran are\n vertices of digraph, then this operation return\ s a digraph\n constructed from digraph by removing the edge specifie\ d by\n edge or [src, ran]. \n\n If digraph be\ longs to , then the edge is removed dir\ ectly from\n digraph. If digraph belongs to , an immutable copy of digraph without\n the\ edge is returned.\n \n\n Note that if digraph belongs to ,\n then a new copy of digraph will b\ e returned even if edge or \n [src, ran] does not define an e\ dge of digraph. \n\n D := CycleDigraph(2\ 50000);\n\ngap> D := DigraphRemo\ veEdge(D, [250000, 1]);\n\ngap> new := DigraphRemoveEdge(D, [25000, 2]);;\ngap> new = D;\ntrue\ngap> I\ sIdenticalObj(new, D);\nfalse\ngap> D := DigraphMutableCopy(D);;\ngap> new := \ DigraphRemoveEdge(D, 2500, 2);;\ngap> IsIdenticalObj(new, D);\ntrue]]>\n\n \n\n\n \n \n \n A new digraph.\ \n \n \n This operation returns a new digraph with\ the same vertices as\n digraph and with the orbit of the edge ed\ ge (under the action\n of the of digrap\ h) removed.\n If edge is not an edge in digraph, then \ digraph is\n returned unchanged. The argument digraph must be an\ immutable\n digraph.\n \n\n An edge is simply a pair of vertices\ of digraph.\n gr1 := CayleyDigraph(Dihedra\ lGroup(8));\n\ngap> gr2 := Digrap\ hAddEdgeOrbit(gr1, [1, 8]);\n\nga\ p> DigraphEdges(gr1);\n[ [ 1, 2 ], [ 1, 3 ], [ 1, 4 ], [ 2, 1 ], [ 2, 8 ], [ 2\ , 6 ], \n [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [ 4, 6 ], [ 4, 7 ], [ 4, 1 ], \n [ 5\ , 3 ], [ 5, 2 ], [ 5, 8 ], [ 6, 4 ], [ 6, 5 ], [ 6, 2 ], \n [ 7, 8 ], [ 7, 1 \ ], [ 7, 3 ], [ 8, 7 ], [ 8, 6 ], [ 8, 5 ] ]\ngap> DigraphEdges(gr2);\n[ [ 1, 2\ ], [ 1, 3 ], [ 1, 4 ], [ 1, 8 ], [ 2, 1 ], [ 2, 8 ], \n [ 2, 6 ], [ 2, 3 ], \ [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [ 3, 2 ], \n [ 4, 6 ], [ 4, 7 ], [ 4, 1 ], [ 4,\ 5 ], [ 5, 3 ], [ 5, 2 ], \n [ 5, 8 ], [ 5, 4 ], [ 6, 4 ], [ 6, 5 ], [ 6, 2 ]\ , [ 6, 7 ], \n [ 7, 8 ], [ 7, 1 ], [ 7, 3 ], [ 7, 6 ], [ 8, 7 ], [ 8, 6 ], \n\ [ 8, 5 ], [ 8, 1 ] ]\ngap> gr3 := DigraphRemoveEdgeOrbit(gr2, [1, 8]);\n\ngap> gr3 = gr1;\ntrue\n]]>\n \n\n\n \n \n A digraph.\n \n If one of the following holds:\n \n \n \ digraph is a digraph with no multiple edges, and\n edges<\ /A> is a list of pairs of vertices of digraph, or\n \n \ digraph is a digraph and edges is an empty list \ \n \n\n then this operation returns a digraph constructed from digraph\n by removing all of the edges specified by edges\n \ (see ).\n\ \n\n If digraph belongs to ,\ then the edge\n is removed directly from digraph. If digraph\ belongs to , the edge is removed fro\ m an immutable copy of\n digraph and this new digraph is returned.\n\n Note that if edges is empty, then this operation\n will al\ ways return digraph rather than a copy. Also, if any element\n of edges is invalid (i.e. does not define an edge of digraph)\n th\ en that element will simply be ignored.\n\n D := C\ ycleDigraph(250000);\n\ngap> D :\ = DigraphRemoveEdges(D, [[250000, 1]]);\n\ngap> D := DigraphMutableCopy(D);\n\ngap> new := DigraphRemoveEdges(D, [[1, 2], [2, 3]\ , [3, 100]]);\n\ngap> new \ = D;\ntrue\n]]>\n \n\n\n \ \n \n \n A digraph.\n \n If digraph is a digraph, then this operation returns a\n \ digraph constructed from digraph by removing every loop. A loop\n \ is an edge with equal source and range. \n\n If digraph is immu\ table, then a new immutable digraph is returned.\n Otherwise, the loops are\ removed from the mutable digraph digraph\n in-place.\n \ D := Digraph([[1, 2, 4], [1, 4], [3, 4], [1, 4, 5], [1, 5]]);\ \n\ngap> DigraphRemoveLoops(D);\n\ \ngap> D := Digraph(IsMutableDigra\ ph, [[1, 2], [1]]);\n\ngap> DigraphR\ emoveLoops(D);\n\ngap> D;\n\n]]>\n \n\n\n \n \n \n A digraph.\n \n If digraph \ is a digraph, then this operation returns a\n digraph constructed from \ digraph by removing all multiple edges.\n The result is the largest sub\ digraph of digraph which does not\n contain multiple edges. \n\n \ If digraph is immutable, then a new immutable digraph is returned.\n\ Otherwise, the multiple edges of the mutable digraph digraph are\n \ removed in-place.\n D1 := Digraph([[1, 2, 3, 2]\ , [1, 1, 3], [2, 2, 2]]);\n\ \ngap> D2 := DigraphRemoveAllMultipleEdges(D1);\n\ngap> OutNeighbours(D2);\n[ [ 1, 2, 3 ], [ 1, 3 ], [ 2 ] ]\nga\ p> D := Digraph(IsMutableDigraph, [[2, 2], [1]]);\n\ngap> DigraphRemoveAllMultipleEdges(D);\n\ngap> D;\n\n]]>\n \n\n\n \n \n \n \n A digraph.\n \n If digraph is a digraph without multiple edges, and edges is a\n list of pair\ s of vertices of digraph (the entries of each pair\n corresponding t\ o the source and the range of an edge, respectively),\n then DigraphReve\ rseEdges returns a digraph constructed from\n digraph by reversi\ ng the orientation of every edge specified by\n edges. If only one e\ dge is to be reversed, then\n DigraphReverseEdge can be used instead\ . In this case, the second\n argument should just be a single vertex-pair, \ or the second and third\n arguments should be the source and range of an ed\ ge respectively. \n\n Note that even though digraph cannot have \ multiple edges, the\n output may have multiple edges. \n\n If dig\ raph belongs to , then the edges\n are \ reversed in digraph. If digraph belongs to , an immutable copy of digraph with the\n specif\ ied edges reversed is returned. \n D := Digraph\ FromDiSparse6String(\".Tg?i@s?t_e?_qEsC\");\n\ngap> DigraphEdges(D);\n[ [ 1, 2 ], [ 1, 7 ], [ 1, 8 ], [ 5, 21 ]\ , [ 7, 19 ], [ 9, 1 ], \n [ 11, 2 ], [ 21, 1 ] ]\ngap> new := DigraphReverseE\ dge(D, [7, 19]);\n\ngap> DigraphE\ dges(new);\n[ [ 1, 2 ], [ 1, 7 ], [ 1, 8 ], [ 5, 21 ], [ 9, 1 ], [ 11, 2 ], \n\ [ 19, 7 ], [ 21, 1 ] ]\ngap> D2 := DigraphMutableCopy(new);;\ngap> new := Di\ graphReverseEdges(D2, [[19, 7]]);;\ngap> D2 = new;\ntrue\ngap> D = new;\ntrue\ \n]]>\n \n\n\n \n \n \n A digraph.\n \n In the first form, if D1, D2, etc. are digraphs, then\ \n DigraphDisjointUnion returns their disjoint union.\n\n In the \ second form, if list is a non-empty list of digraphs, then\n Digr\ aphDisjointUnion returns the disjoint union of the digraphs\n contained\ in the list. \n\n For a disjoint union of digraphs, the vertex set is\ the disjoint union of\n the vertex sets, and the edge list is the disjoint\ union of the edge lists.\n \n\n More specifically, for a collection\ of digraphs D1, D2,\n ..., the disjoint union with ha\ ve\n DigraphNrVertices(D1) +\n DigraphNrV\ ertices(D2) + ... vertices.\n The edges of \ D1 will remain unchanged, whilst the edges of the\n ith digra\ ph, D[i], will be changed so that they\n belong to the vertic\ es of the disjoint union corresponding to\n D[i]. In particu\ lar, the edges of D[i] will\n have their source and range inc\ reased by\n DigraphNrVertices(D1) + ... \ +\n DigraphNrVertices(D[i-1]).\n\n \n\n \ Note that previously set will be lost.<\ P/>\n\n If the first digraph D1 [list[1]] belongs to , then D1 [list[1]] is modified in\ \n place to contain the appropriate vertices and edges. If digraph b\ elongs\n to , a new immutable digraph con\ taining the\n appropriate vertices and edges is returned.\n D1 := CycleDigraph(3);\n\nga\ p> OutNeighbours(D1);\n[ [ 2 ], [ 3 ], [ 1 ] ]\ngap> D2 := CompleteDigraph(3);\ \n\ngap> OutNeighbours(D2);\n[ [ 2\ , 3 ], [ 1, 3 ], [ 1, 2 ] ]\ngap> union := DigraphDisjointUnion(D1, D2);\n\ngap> OutNeighbours(union);\n[ [ 2 ],\ [ 3 ], [ 1 ], [ 5, 6 ], [ 4, 6 ], [ 4, 5 ] ]\n]]>\n \ \n\n\n \n \n \n A digraph.\n \n In the first form, if D1,\ D2, etc. are digraphs, then\n DigraphEdgeUnion returns their\ edge union.\n\n In the second form, if list is a non-empty list of \ digraphs, then\n DigraphEdgeUnion returns the edge union of the digr\ aphs contained\n in the list. \n\n The vertex set of the edge union\ of a collection of digraphs is the\n union of the vertex sets, whil\ st the edge list of the edge union is\n the concatenation of the edg\ e lists. The number of vertices of the\n edge union is equal to the max\ imum number of vertices of one of the\n digraphs, whilst the number of \ edges of the edge union will equal the\n sum of the number of edges \ of each digraph. \n\n Note that previously set will be lost.\n \n\n If the first digraph D1 [\ list[1]] belongs to , then D1 \ [list[1]] is modified in\n place to contain the appropriate vertices\ and edges. If digraph belongs\n to , a new immutable digraph containing the\n appropriate vertices and edges\ is returned.\n D := CycleDigraph(10);\n\ngap> DigraphEdgeUnion(D, D);\n\ngap> D1 := Digraph([[2], [1]]);\n\ngap> D2 := Digraph([[2, 3], [2], [1]]);\n<\ immutable digraph with 3 vertices, 4 edges>\ngap> union := DigraphEdgeUnion(D1\ , D2);\n\ngap> OutNeighbours(\ union);\n[ [ 2, 2, 3 ], [ 1, 2 ], [ 1 ] ]\ngap> union = DigraphByEdges(\n> Con\ catenation(DigraphEdges(D1), DigraphEdges(D2)));\ntrue\n]]>\n \n\n\n \n \n \n A digraph.\n \n In the first form, if D1, \ D2, etc. are digraphs, then\n DigraphJoin returns their join.\ \n\n In the second form, if list is a non-empty list of digraphs,\n \ then DigraphJoin returns the join of the digraphs contained in the\n\ list. \n\n The join of a collection of digraphs D1, D2, ... is\n formed by first taking the of the collection.\n\n In t\ he disjoint union, if i \\neq j then there are no edges between\n ve\ rtices corresponding to digraphs D[i] and\n D[j] in the collection; the join is created by including\n all such edges. \ \n\n For example, the join of two empty digraphs is a complete bipartite\n \ digraph. \n\n Note that previously set will be lost.\n \n\n If the first digraph D1 [list[1\ ]] belongs to , then D1 [li\ st[1]] is modified in\n place to contain the appropriate vertices and e\ dges. If digraph belongs\n to , a \ new immutable digraph containing the\n appropriate vertices and edges is re\ turned.\n D := CompleteDigraph(3);\n\ngap> IsCompleteDigraph(DigraphJoin(D, D));\ntrue\n\ gap> D2 := CycleDigraph(3);\n\ngap> D\ igraphJoin(D, D2);\n\n]]>\n \n\n\n \n \n \n A digraph.\n \n In the first form, if gr1, gr2, etc. are digraphs, then\ \n DigraphCartesianProduct returns a digraph isomorphic to their\n \ Cartesian product.\n \n\n In the second form, if list is a \ non-empty list of digraphs,\n then DigraphCartesianProduct returns a\ digraph isomorphic to the \n Cartesian product of the digraphs contained i\ n the list.\n \n \n Mathematically, the Cartesian product of two dig\ raphs G, H\n is a digraph with vertex set Cartesian(Digrap\ hVertices(G),\n DigraphVertices(H)) such that there is an edge from \ [u, u'] to\n [v, v'] iff u = v and there is an edge fro\ m u' to\n v' in H or u' = v' and there is an e\ dge from\n u to v in G.\n \n\n Due to techni\ cal reasons, the digraph D returned by\n DigraphCartesianProduct<\ /C> has vertex set\n [1 .. DigraphNrVertices(G)*DigraphNrVertices(H)] instead, and the\n exact\n method of encoding pairs of vertices into\ integers is implementation\n specific. The original vertex pair can be so\ mewhat regained by using\n . In addition,\n are preserved: if ve\ rtex pair\n [u,u'] was encoded as i then the vertex label of \ i\n will be the pair of vertex labels of u and u' i.e.\ \n DigraphVertexLabel(D,i) = [DigraphVertexLabel(G,u),\n DigraphVer\ texLabel(H,u')].\n \n\n As the Cartesian product is associative,\ the Cartesian product of a collection \n of digraphs gr1, gr2, ... is computed in the obvious \n fashion. \n \n\n gr := ChainDigraph(4);\n\ngap> gr2 := CycleDigraph(3);\n\ \ngap> gr3 := DigraphCartesianProduct(gr, gr2);\n\ngap> IsIsomorphicDigraph(gr3, \n> Digraph([[2, 5], [3, 6], \ [4, 7], [8], \n> [6, 9], [7, 10], [8, 11], [12],\n> [10, 1],\ [11, 2], [12, 3], [4]]));\ntrue\n]]>\n \n\n\n \n \n \n A digraph.\n \n In the first form, if gr1, gr2, etc. are digraphs, then\n DigraphDirectProduct retur\ ns a digraph isomorphic to their direct\n product.\n \n\n In the \ second form, if list is a non-empty list of digraphs, then\n Digr\ aphDirectProduct returns a digraph isomorphic to the direct\n product o\ f the digraphs contained in the list.\n \n\n Mathematically, the dir\ ect product of two digraphs G, H is a\n digraph with vertex s\ et Cartesian(DigraphVertices(G),\n DigraphVertices(H)) such that the\ re is an edge from [u, u']\n to [v, v'] iff there is an edge \ from u to v in\n G and an edge from u' to v'\ in H. \n \n\n Due to technical reasons, the digraph \ D returned by\n DigraphDirectProduct has vertex set\n [1 .\ . DigraphNrVertices(G)*DigraphNrVertices(H)] instead, and the\n exact \ method of encoding pairs of vertices into integers is implementation\n spec\ ific. The original vertex pair can be somewhat regained by using\n . In addition\n are preserved: if vertex pair\n [u,u'] was encoded \ as i then the vertex label of i\n will be the pair of vertex \ labels of u and u' i.e.\n DigraphVertexLabel(D,i) = [Digra\ phVertexLabel(G,u),\n DigraphVertexLabel(H,u')].\n \n\n As th\ e direct product is associative, the direct product of a collection \n of d\ igraphs gr1, gr2, ... is computed in the obvious \n fa\ shion. \n \n\n gr := ChainDigraph(4);\n\ngap> gr2 := CycleDigraph(3);\n\ngap> gr3 := DigraphDirectProduct(gr, gr2);\n\ngap> IsIsomorphicDigraph(gr3, \n> D\ igraph([[6], [7], [8], [], \n> [10], [11], [12], [],\n> [2],\ [3], [4], []]));\ntrue\n]]>\n \n\n\n \ \n \n A list of transformations.\n \n \ If digraph is a Cartesian product digraph, \n digraph = DigraphCa\ rtesianProduct(gr_1, gr_2, ... ), then\n DigraphCartesianProductProj\ ections returns a list proj\n such that proj[i] is the pr\ ojection onto the i-th\n coordinate of the product.\n \n\n \ A projection is an idempotent endomorphism of digraph. If\n gr1,\ gr2, ... are all loopless digraphs, then the induced \n subdigraph of \ digraph on the image of proj[i] is \n isomorphic to gr_i.\n \n\n Currently this attribute is only set upon creating an imm\ utable \n digraph via DigraphCartesianProduct and there is no way \n\ of calculating it for other digraphs.\n \n\n For more informatio\ n see\n \n\n D := DigraphCartesianProduct(ChainDigra\ ph(3), CycleDigraph(4),\n> Digraph([[2], [2]]));;\ngap> HasDigraphCartesianPro\ ductProjections(D);\ntrue\ngap> proj := DigraphCartesianProductProjections(D);\ ; Length(proj);\n3\ngap> IsIdempotent(proj[2]);\ntrue\ngap> RankOfTransformati\ on(proj[3]);\n2\ngap> S := ImageSetOfTransformation(proj[2]);;\ngap> IsIsomorp\ hicDigraph(CycleDigraph(4), InducedSubdigraph(D, S));\ntrue\n]]>\n \ \n\n\n \n \n A list of transformations.\ \n \n If digraph is a direct product digraph\ , \n digraph = DigraphDirectProduct(gr_1, gr_2, ... ), then\n \ DigraphDirectProductProjections returns a list proj\n such that \ proj[i] is the projection onto the i-th\n coordinate of the p\ roduct.\n \n\n A projection is an idempotent endomorphism of digr\ aph. If\n gr1, gr2, ... are all loopless digraphs, then the imag\ e \n of digraph under proj[i] is isomorphic to gr_i.\n\ \n\n Currently this attribute is only set upon creating an immutabl\ e\n digraph via DigraphDirectProduct and there is no way of \n ca\ lculating it for other digraphs.\n \n\n For more information, see\n \ \n\n \ D := DigraphDirectProduct(ChainDigraph(3), CycleDi\ graph(4),\n> Digraph([[2], [2]]));;\ngap> HasDigraphDirectProductProjections(D\ );\ntrue\ngap> proj := DigraphDirectProductProjections(D);; Length(proj);\n3\n\ gap> IsIdempotent(proj[2]);\ntrue\ngap> RankOfTransformation(proj[3]);\n2\ngap\ > P := DigraphRemoveAllMultipleEdges(\n> ReducedDigraph(OnDigraphs(D, proj[2])\ ));; \ngap> IsIsomorphicDigraph(CycleDigraph(4), P);\ntrue\n]]>\n <\ /Description>\n\n\n \n \n \n A digraph.\n \n Given a digraph digraph, th\ e operation returns the digraph\n obtained by associating a vertex with eac\ h edge of digraph, and\n creating an edge from a vertex v to \ a vertex u if and only\n if the terminal vertex of the edge associat\ ed with v is the start\n vertex of the edge associated with u\ . \n\n Note that the returned digraph is always a new immutable digraph,\ and the\n argument digraph is never modified.\n LineDigraph(CompleteDigraph(3));\n\ngap> LineDigraph(ChainDigraph(3));\n\n]]>\n \n\n\n \n \n \n A digraph.\n \ \n Given a symmetric digraph digraph, the operation ret\ urns the\n symmetric digraph obtained by associating a vertex with each edg\ e of\n digraph, ignoring directions and multiplicites, and adding an\ edge\n between two vertices if and only if the corresponding edges have a \ vertex in\n common. \n\n Note that the returned digraph is always a n\ ew immutable digraph, and the\n argument digraph is never modified.\ \n LineUndirectedDigraph(CompleteDigraph(3));\n\ngap> LineUndirectedDigraph(DigraphS\ ymmetricClosure(ChainDigraph(3)));\n\n]]>\n \n\n\n \n \n A digraph.\n \ \n Let digraph be a digraph with vertex set V. \ This function\n returns the double digraph of digraph. The vertex se\ t of the double\n digraph is the orginal vertex set together with a duplica\ te. The edges are\n [u_1, v_2] and [u_2, v_1] if and only if \ [u, v] is an\n edge in digraph, together with the original ed\ ges and their\n duplicates. \n\n If digraph is mutable, then <\ A>digraph is modified in-place. If\n digraph is immutable, then \ a new immutable digraph constructed as\n described above is returned.\n \ gamma := Digraph([[2], [3], [1]]);\n\ngap> DoubleDigraph(gamma);\n\n]]>\n \n\n\n \ \n \n <\ Returns>A digraph.\n \n Let digraph be a dig\ raph with vertex set V. This function\n returns the bipartite double\ digraph of digraph. The vertex set of\n the double digraph is the o\ riginal vertex set together with a duplicate. The\n edges are [u_1, v_2]\ and [u_2, v_1] if and only if [u,\n v] is an edge in <\ A>digraph. The resulting graph is bipartite,\n since the orignal edges \ are not included in the resulting digraph. \n\n If digraph is mut\ able, then digraph is modified in-place. If\n digraph is immu\ table, then a new immutable digraph constructed as\n described above is ret\ urned.\n gamma := Digraph([[2], [3], [1]]);\n\ngap> BipartiteDoubleDigraph(gamma);\n\ \n]]>\n \ \n\n\n \n \n \n A digraph.\n \n For a digraph digraph\ this operation returns a new digraph constructed\n from digraph, su\ ch that a loop is added for every vertex which did not\n have a loop in \ digraph. \n\n If digraph is immutable, then a new immutable d\ igraph is returned.\n Otherwise, the loops are added to the loopless vertic\ es of the mutable digraph\n digraph in-place.\n D := EmptyDigraph(13);\n\nga\ p> D := DigraphAddAllLoops(D);\n\ngap> OutNeighbours(D);\n[ [ 1 ], [ 2 ], [ 3 ], [ 4 ], [ 5 ], [ 6 ]\ , [ 7 ], [ 8 ], [ 9 ], \n [ 10 ], [ 11 ], [ 12 ], [ 13 ] ]\ngap> D := Digraph\ ([[1, 2, 3], [1, 3], [1]]);\n\ngap\ > D := DigraphAddAllLoops(D);\n\ngap> OutNeighbours(D);\n[ [ 1, 2, 3 ], [ 1, 3, 2 ], [ 1, 3 ] ]\ngap> \ D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphAddAllLoops(D);\n\ \ngap> D;\n\n]]>\n \n\n\n \n \n \n A digraph.\n \n The first argument is\ a digraph, the second argument is a non-negative\n integer or a list of po\ sitive integers. This operation returns a digraph on\n the same set of vert\ ices as digraph, with two vertices being adjacent\n if and only if t\ he distance between them in digraph equals i\n or is a number\ in list. See . \n\n If digraph is mutable, then \ digraph is modified in-place. If\n digraph is immutable, then\ a new immutable digraph constructed as\n described above is returned.\n \ digraph := DigraphFromSparse6String(\n> \":]n?AL`BC_\ DEbEF`GIaGHdIJeGKcKL_@McDHfILaBJfHMjKM\");\n\ngap> DistanceDigraph(digraph, 1);\n\ngap> DistanceDigraph(digraph, [1, 2]);\n\n]]>\n \n\n\ \n \n \n A digraph.\n \n Given a symmetric loopless d\ igraph with no multiple edges digraph,\n the k-closure of \ digraph is defined to be the unique\n smallest symmetric looples\ s digraph C with no multiple edges on the\n vertices of digraph that contains all the edges of digraph\n and satsifies the proper\ ty that the sum of the degrees of every two\n non-adjacenct vertices in \ C is less than k. See , , , and . \n\n The operation DigraphClosure ret\ urns the k-closure of\n digraph.\n D := CompleteDigraph(6);\n\ngap>\ D := DigraphRemoveEdges(D, [[1, 2], [2, 1]]);\n\ngap> closure := DigraphClosure(D, 6);\n\ngap> IsCompleteDigraph(closure);\ntrue\n]]>\ \n \n\n\n \n \n \n A digraph.\n \n If digra\ ph is a symmetric digraph, then\n DigraphMycielskian returns the\ Mycielskian of digraph. \n \n The Mycielskian of a symmetric \ digraph is a larger symmetric digraph\n constructed from it, which has a la\ rger chromatic number. For further\n information, see https://en.wikip\ edia.org/wiki/Mycielskian. \n\n If digraph is immutable, th\ en a new immutable digraph is returned.\n Otherwise, the mutable digraph digraph is changed in-place into\n its Mycielskian. \n\n D := CycleDigraph(2);\n\ngap> ChromaticNumber(D);\n2\ngap> D := DigraphMycielskian(D);\n\ngap> ChromaticNumber(D);\n3\ngap> D := D\ igraphMycielskian(D);\n\ngap> Ch\ romaticNumber(D);\n4\ngap> D := CompleteBipartiteDigraph(IsMutable, 2, 3);\n\ngap> DigraphMycielskian(D);\n\ngap> D;\n\n]]>\n \n\n\n \n\n Random digraphs\n \n \n A digraph.\n \n If the optional first argument filt is present\ , then this should\n specify the category or representation the digraph bei\ ng created will\n belong to. For example, if filt is ,\n then the digraph being created will be mutable, if \ filt is , then the digraph will be \ immutable. \n If the optional first argument filt is not present, th\ en is used by default.\n\n If\ n is a positive integer, then this function returns a random\n digr\ aph with n vertices and without multiple edges. The result\n may or \ may not have loops. \n\n If the optional second argument p is a f\ loat with value\n 0 \\leq p \\leq 1, then an edge \ will exist between each\n pair of vertices with probability approximately <\ A>p.\n If p is not specified, then a random probability will be \ assumed\n (chosen with uniform probability).\n Rand\ omDigraph(1000);\n\ngap> R\ andomDigraph(10000, 0.023);\n\ngap> RandomDigraph(IsMutableDigraph, 1000, 1 / 2);\n\n]]>\n \n\n\ \n \n \n A digraph.\n \n If n is a positive in\ teger, then this function returns a random\n digraph with n vertices\ . If the optional second argument\n m is a positive integer, then th\ e digraph will have m\n edges. If m is not specified, then th\ e number of edges will be\n chosen randomly (with uniform probability) from\ the range\n [1 .. {n \\choose 2}].\n \n\n T\ he method used by this function chooses each edge from the set of\n all pos\ sible edges with uniform probability. No effort is made to avoid\n creating\ multiple edges, so it is possible (but not guaranteed) that the\n result w\ ill have multiple edges. The result may or may not have loops. \n <\ ![CDATA[\ngap> RandomMultiDigraph(1000);\n\ngap> RandomMultiDigraph(1000, 950);\n\n]]>\n \n\n\n \n \ \n A digraph.\n \n If the optional first \ argument filt is present, then this should\n specify the category or\ representation the digraph being created will\n belong to. For example, if\ filt is ,\n then the digraph being \ created will be mutable, if filt is , then the digraph will be immutable. \n If the optional first argument\ filt is not present, then is\ used by default. \n\n If n is a non-negative integer, this funct\ ion returns a random\n tournament with n vertices. See . \n RandomTournament(10);\n\ngap> RandomTournament(IsMutableDigraph, 10);\ \n\n]]>\n \n\n\n \n \n A digraph.\n \n If the optional fi\ rst argument filt is present, then this should\n specify the categor\ y or representation the digraph being created will\n belong to. For example\ , if filt is ,\n then the digraph be\ ing created will be mutable, if filt is , then the digraph will be immutable. \n If the optional first argu\ ment filt is not present, then is used by default. \n\n If n is a positive integer, this funct\ ion return a random lattice\n with m vertices, where it is guarantee\ d that m is between\n n and 2 * n. See . \n RandomLattice(10);\n<\ immutable lattice digraph with 10 vertices, 39 edges>\ngap> RandomLattice(IsMu\ tableDigraph, 10);\n\n]]>\n \ \n\n\n \n\n Standard\ examples\n \n \n A digraph.\n \n If n \ is a positive integer, this function returns a chain\n with n vertic\ es and n - 1 edges.\n Specifically,\n for each vertex i\ (with i < n), there is a directed\n edge with source \ i and range i + 1. \n\n If the optional first argument filt is present, then this should\n specify the category or representa\ tion the digraph being created will\n belong to. For example, if filt is ,\n then the digraph being created wil\ l be mutable, if filt is , then \ the digraph will be immutable. \n If the optional first argument filt is not present, then is used by de\ fault. \n\n The of a c\ hain represents a\n total order.\n ChainDigraph\ (42);\n\ngap> ChainDigraph(IsMutable\ Digraph, 10);\n\n]]>\n <\ /Description>\n\n\n \n \n A digraph.\n \n \ If n is a non-negative integer, this function returns the complete\n \ digraph with n vertices. See . \ \n\n If the optional first argument filt is present, then this shoul\ d\n specify the category or representation the digraph being created will\n\ belong to. For example, if filt is \ ,\n then the digraph being created will be mutable, if filt is , then the digraph will be immutable. \n \ If the optional first argument filt is not present, then is used by default.\n \ CompleteDigraph(20);\n\ngap> Com\ pleteDigraph(IsMutableDigraph, 10);\n\n]]>\n \n\n\n \n \n A digr\ aph.\n \n A complete bipartite digraph is a digraph\ whose vertices\n can be partitioned into two non-empty vertex sets, such t\ here exists\n a unique edge with source i and range j if and \ only if\n i and j lie in different vertex sets. \n\n I\ f m and n are positive integers, this function\n returns the \ complete bipartite digraph with vertex sets of sizes\n m (containing\ the vertices [1 .. m]) and\n n (containing the vertices [\ m + 1 .. m + n]).\n \n\n If the optional first argument filt<\ /A> is present, then this should\n specify the category or representation t\ he digraph being created will\n belong to. For example, if filt is <\ Ref Filt=\"IsMutableDigraph\"/>,\n then the digraph being created will be m\ utable, if filt is , then the di\ graph will be immutable. \n If the optional first argument filt is n\ ot present, then is used by default.\ \n\n CompleteBipartiteDigraph(2, 3);\n\ngap> CompleteBipart\ iteDigraph(IsMutableDigraph, 3, 2);\n\n]]>\n \n\n\n \n \ \n A digraph.\n \n For a list orders \ of n positive integers,\n this function returns the digraph contai\ ning n independent sets\n of vertices of orders [l[1] ..\ l[n]]. Moreover,\n each vertex is adjacent to every other not\ contained in the\n same independent set.\n \n\n If the opt\ ional first argument filt is present, then this should\n specify t\ he category or representation the digraph being created will\n belong to.\ For example, if filt is ,\n then \ the digraph being created will be mutable, if filt is , then the digraph will be immutable. \n If the o\ ptional first argument filt is not present, then is used by default.\n Comp\ leteMultipartiteDigraph([5, 4, 2]);\n\ngap> CompleteMultipartiteDigraph(IsMutableDigraph\ , [5, 4, 2]);\n\n]]>\n \ \n\n\n \n \n A digraph.\n \n \ If n is a positive integer, this function returns a cycle\n d\ igraph with n vertices and n edges. Specifically,\n for each \ vertex i (with i < n), there is a directed\n edge w\ ith source i and range i + 1. In addition, there is\n an edge\ with source n and range 1. \n\n If the optional first ar\ gument filt is present, then this should\n specify the category or r\ epresentation the digraph being created will\n belong to. For example, if <\ A>filt is ,\n then the digraph being cr\ eated will be mutable, if filt is , then the digraph will be immutable. \n If the optional first argument <\ A>filt is not present, then is use\ d by default.\n CycleDigraph(1);\n\ngap> CycleDigraph(123);\n\ngap> CycleDigraph(IsMutableDigraph, 10);\n\n]]>\n \n\n\n \ \n \n \n A digraph.\n \n If n is a non-negative integer, this function returns t\ he\n empty or null digraph with n vertices. An empty\n\ digraph is one with no edges.\n \n \n If the optional first\ argument filt is present, then this should\n specify the category o\ r representation the digraph being created will\n belong to. For example, i\ f filt is ,\n then the digraph being\ created will be mutable, if filt is , then the digraph will be immutable. \n If the optional first argumen\ t filt is not present, then i\ s used by default. \n\n NullDigraph is a synonym for EmptyDigr\ aph.\n\n EmptyDigraph(20);\n\ngap> NullDigraph(10);\n\ngap> EmptyDigraph(IsMutableDigraph, 10);\n]]>\n \n\n\n \n \n A \ digraph.\n \n If n and k are non-nega\ tive integers, then this operation\n returns a symmetric digraph which corr\ esponds to the undirected Johnson\n graph J(n, k). \n\n \ If the optional first argument filt is present, then this should\n \ specify the category or representation the digraph being created will\n be\ long to. For example, if filt is ,\n \ then the digraph being created will be mutable, if filt is , then the digraph will be immutable. \n If the\ optional first argument filt is not present, then is used by default. \n\n The Johnson graph \ J(n, k) has vertices given by all the\n k-subsets of the rang\ e [1 .. n], and two vertices are\n connected by an edge iff\ their intersection has size k - 1.\n\n gr := JohnsonDigraph(3, 1);\n\ngap> OutNeighbours(gr);\n[ [ 2, 3 ], [ 1, 3 ], [ 1, 2 ] ]\ngap> gr \ := JohnsonDigraph(4, 2);\n\ngap> OutNeighbours(gr);\n[ [ 2, 3, 4, 5 ], [ 1, 3, 4, 6 ], [ 1, 2, 5, 6 ]\ , [ 1, 2, 5, 6 ], \n [ 1, 3, 4, 6 ], [ 2, 3, 4, 5 ] ]\ngap> JohnsonDigraph(1,\ 0);\n\ngap> JohnsonDigraph(IsMutableDi\ graph, 1, 0);\n\n]]>\n \n\n\n \n \n A digraph.\n \n\n From https://en.wikipedia.org/wiki/Petersen_graph: \n\n The Peter\ sen graph is an undirected graph with 10 vertices and 15 edges.\n It is a s\ mall graph that serves as a useful example and counterexample for\n many pr\ oblems in graph theory. The Petersen graph is named after Julius\n Petersen\ , who in 1898 constructed it to be the smallest bridgeless cubic\n graph wi\ th no three-edge-coloring. \n \n If the optional first argument <\ A>filt is present, then this should\n specify the category or represent\ ation the digraph being created will\n belong to. For example, if filt is ,\n then the digraph being created wi\ ll be mutable, if filt is , then\ the digraph will be immutable. \n If the optional first argument filt is not present, then is used by d\ efault. \n\n See also .\n\n ChromaticNumber(PetersenGraph());\n3\ngap> PetersenGraph(I\ sMutableDigraph);\n\n]]>\ \n \n\n\n \n \n A digraph.\n \ \n If n is a positive integer and k is a non-neg\ ative\n integer less than n / 2, then this operation returns\ \n the generalised Petersen graph GPG(n, k). \n\n \ From\n https://en.wikipedia.org/wiki/Generalized_Petersen_graph:\n \n\n The generalized Petersen graphs are a family of cubic\ \n graphs formed by connecting the vertices of a regular polygon to the\n \ corresponding vertices of a star polygon. They include the Petersen graph\n \ and generalize one of the ways of constructing the Petersen graph. The\n \ generalized Petersen graph family was introduced in 1950 by H. S. M.\n Cox\ eter and was given its name in 1969 by Mark Watkins.\n \n\n If t\ he optional first argument filt is present, then this should\n speci\ fy the category or representation the digraph being created will\n belong t\ o. For example, if filt is ,\n then \ the digraph being created will be mutable, if filt is , then the digraph will be immutable. \n If the optio\ nal first argument filt is not present, then is used by default. \n\n See also .\n\n GeneralisedPetersenGraph(7, 2);\n\ngap> GeneralisedPetersenGrap\ h(40, 1);\n\ngap> D :\ = GeneralisedPetersenGraph(5, 2);\n\ngap> IsIsomorphicDigraph(D, PetersenGraph());\ntrue\ngap> Gener\ alisedPetersenGraph(IsMutableDigraph, 9, 4);\n\n]]>\n \n\n\n \n\ \n\n \n Oper\ ators\n\n Operators for digraphs\n <\ List>\n digraph1 = digraph2\n \ \n = (for digraphs)\n returns t\ rue if digraph1 and digraph2 have the same\n vertices,\ and DigraphEdges(digraph1) =\n DigraphEdges(digraph2\ ), up to some re-ordering of the edge\n lists. \n\n Note t\ hat this operator does not compare the vertex labels\n of digraph1 and digraph2.\n \n\n digraph1 < \ digraph2\n \n < (\ for digraphs)\n\n This operator returns true if one of th\ e following holds:\n\n \n \n The number n_1 of vertices in digraph1 is less than\n the number n_2 of vertices in digraph2;\n \n \n \ n_1 = n_2, and the number m_1 of edges in\n \ digraph1 is less than the number m_2 of edges in\n \ digraph2;\n \n \n n_1 = n_2,\ m_1 = m_2, and\n DigraphEdges(digraph1) is les\ s than\n DigraphEdges(digraph2) after having both of t\ hese sets\n have been sorted with respect to the lexicographical ord\ er.\n \n \n \n \n\n \n \n true or false.\n \n If super and sub\ are digraphs, then this operation returns\n true if sub \ is a subdigraph of super, and false\n if it is not. \n\n \ A digraph sub is a subdigraph of a digraph super if\n \ sub and super share the same number of vertices, and the\n \ collection of edges of super (including repeats) contains the\n col\ lection of edges of sub (including repeats). \n\n In other word\ s, sub is a subdigraph of super if and only if\n DigraphNr\ Vertices(sub) = DigraphNrVertices(super), and\n for each \ pair of vertices i and j, there are at least as many\n edges \ of the form [i, j] in super as there are in sub.\n \n\n g := Digraph([[2, 3], [1], [2, 3]]);\n\ngap> h := Digraph([[2, 3], [], [2]]);\ \n\ngap> IsSubdigraph(g, h);\ntrue\ \ngap> IsSubdigraph(h, g);\nfalse\ngap> IsSubdigraph(CompleteDigraph(4), Cycle\ Digraph(4));\ntrue\ngap> IsSubdigraph(CycleDigraph(4), ChainDigraph(4));\ntrue\ \ngap> g := Digraph([[2, 2], [1]]);\n\ngap> h := Digraph([[2], [1]]);\n\ngap> IsSubdigraph(g, h);\ntrue\ngap> IsSubdigraph(h, g);\nfalse]]>\n \n\n\n \n \n \n true or false.\n \n The operation IsUndirectedSpanningTree re\ turns true if the\n digraph sub is an undirected spanning tre\ e of the digraph\n super, and the operation IsUndirectedSpanningF\ orest returns\n true if the digraph sub is an undirected \ spanning forest of\n the digraph super. \n\n An undirected\ spanning tree of a digraph super is a subdigraph\n of super<\ /A> that is an undirected tree (see \n and ). Note that a digraph whose is not connected has no undirected\n spannin\ g trees (see ). \n\n An undirected\ spanning forest of a digraph super is a\n subdigraph of supe\ r that is an undirected forest (see an\ d ), and is not\n contained in any larger\ such subdigraph of super. Equivalently, an\n undirected spanning f\ orest is a subdigraph of super whose connected\n components coincide\ with those of the of sup\ er (see ). \n\n No\ te that an undirected spanning tree is an undirected spanning forest that\n \ is connected.\n\n D := CompleteDigraph(4);\n\ngap> tree := Digraph([[3], [4], [1, 4\ ], [2, 3]]);\n\ngap> IsSubdigraph(\ D, tree) and IsUndirectedTree(tree);\ntrue\ngap> IsUndirectedSpanningTree(D, t\ ree);\ntrue\ngap> forest := EmptyDigraph(4);\n\ngap> IsSubdigraph(D, forest) and IsUndirectedForest(forest);\ntrue\ \ngap> IsUndirectedSpanningForest(D, forest);\nfalse\ngap> IsSubdigraph(tree, \ forest);\ntrue\ngap> D := DigraphDisjointUnion(CycleDigraph(2), CycleDigraph(2\ ));\n\ngap> IsUndirectedTree(D);\n\ false\ngap> IsUndirectedForest(D) and IsUndirectedSpanningForest(D, D);\ntrue]\ ]>\n \n\n\n \n\n \n Attributes and operations\n Vertices and edges<\ /Heading>\n \n \n A list of integers.\n \n Returns the \ vertices of the digraph digraph. \n\n Note that the vertices of \ a digraph are always a range of\n positive integers from 1 to the nu\ mber of vertices of the graph.\n gr := Digraph([\"\ a\", \"b\", \"c\"],\n> [\"a\", \"b\", \"b\"],\n> \ [\"b\", \"c\", \"a\"]);\n\nga\ p> DigraphVertices(gr);\n[ 1 .. 3 ]\ngap> gr := Digraph([1, 2, 3, 4, 5, 7],\n>\ [1, 2, 2, 4, 4],\n> [2, 7, 5, 3, 7]);\n\ngap> DigraphVertices(gr);\n[ 1 .. 6 \ ]\ngap> DigraphVertices(RandomDigraph(100));\n[ 1 .. 100 ]\ngap> D := CycleDig\ raph(IsMutableDigraph, 3);\n\ngap> D\ igraphVertices(D);\n[ 1 .. 3 ]\n]]>\n \n\ \n\n \n \n \ An integer.\n \n Returns the number of ver\ tices of the digraph digraph. \n\n gr :\ = Digraph([\"a\", \"b\", \"c\"],\n> [\"a\", \"b\", \"b\"],\n>\ [\"b\", \"c\", \"a\"]);\n\ngap> DigraphNrVertices(gr);\n3\ngap> gr := Digraph([1, 2, 3, 4, 5, \ 7],\n> [1, 2, 2, 4, 4],\n> [2, 7, 5, 3, 7]);\ \n\ngap> DigraphNrVertices(gr);\n6\ \ngap> DigraphNrVertices(RandomDigraph(100));\n100\ngap> D := CycleDigraph(IsM\ utableDigraph, 3);\n\ngap> DigraphNr\ Vertices(D);\n3\n]]>\n \n\n\n \n \n A list of l\ ists.\n \n DigraphEdges returns a list of ed\ ges of the digraph digraph,\n where each edge is a pair of elements \ of of\n the form [source,range].\n \ \n\n The entries of DigraphEdges(digraph) are in\ one-to-one\n corresponence with the edges of digraph. Hence\n <\ C>DigraphEdges(digraph) is duplicate-free if and only if\n \ digraph contains no multiple edges. \n\n The entries of Dig\ raphEdges are guaranteed to be sorted by their\n first component (i.e. \ by the source of each edge), but they are not\n necessarily then sorted by \ the second component.\n gr := DigraphFromDiSparse6\ String(\".DaXbOe?EAM@G~\");\n\ngap> edges := ShallowCopy(DigraphEdges(gr));; Sort(edges);\ngap> edges;\n[ \ [ 1, 1 ], [ 1, 3 ], [ 1, 3 ], [ 1, 4 ], [ 1, 5 ], [ 2, 1 ], \n [ 2, 2 ], [ 2,\ 3 ], [ 2, 5 ], [ 3, 2 ], [ 3, 4 ], [ 3, 5 ], \n [ 4, 2 ], [ 4, 4 ], [ 4, 5 ]\ , [ 5, 1 ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphEdges(D);\n[ [ 1, 2 ], [ 2, 3 ], [ 3, 1 \ ] ]\n]]>\n \n\n\n \n \n An integer.\ \n \n This function returns the number of edges of the digrap\ h digraph.\n gr := Digraph([\n> [1, 3, 4, 5\ ], [1, 2, 3, 5], [2, 4, 5], [2, 4, 5], [1]]);;\ngap> DigraphNrEdges(gr);\n15\n\ gap> gr := Digraph([\"a\", \"b\", \"c\"],\n> [\"a\", \"b\", \ \"b\"],\n> [\"b\", \"a\", \"a\"]);\n\ngap> DigraphNrEdges(gr);\n3\ngap> D := CycleDigraph(\ IsMutableDigraph, 3);\n\ngap> Digrap\ hNrEdges(D);\n3\n]]>\n \n\n\n \n \n A list of v\ ertices.\n \n This function returns a list of the s\ inks of the digraph\n digraph.\n A sink of a digraph is a vertex \ with out-degree zero.\n See .\n gr := Digraph([[3, 5, 2, 2], [3], [], [5, 2, 5, 3], []]);\n<\ immutable multidigraph with 5 vertices, 9 edges>\ngap> DigraphSinks(gr);\n[ 3,\ 5 ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphSinks(D);\n[ ]\n]]>\n \ \n\n\n \n \n A list of vertices.\n \n This \ function returns an immutable list of the sources of the digraph\n digra\ ph.\n A source of a digraph is a vertex with in-degree zero.\n See <\ Ref Oper=\"InDegreeOfVertex\"/>.\n gr := Digraph([\ [3, 5, 2, 2], [3], [], [5, 2, 5, 3], []]);\n\ngap> DigraphSources(gr);\n[ 1, 4 ]\ngap> D := CycleDigraph(Is\ MutableDigraph, 3);\n\ngap> DigraphS\ ources(D);\n[ ]\n]]>\n \n\n\n \n \n \ A list of positive integers, or fail.\n \n I\ f digraph is a digraph whose only directed cycles are loops, then\n \ DigraphTopologicalSort returns the vertices of digraph ordered\n\ so that every edge's source appears no earlier in the list than its range.\ \n If the digraph digraph contains directed cycles of length greater\ \n than 1, then this operation returns fail.\n \n\n \ See section for the definiti\ on\n of a directed cycle, and the definition of a loop.\n\n \n\n \ The method used for this attribute has complexity O(m+n) where\n \ m is the number of edges (counting multiple edges as one) and\n n is the number of vertices in the digraph. \n \ D := Digraph([\n> [2, 3], [], [4, 6], [5], [], [7, 8, 9], [], [], []]);\n\ngap> DigraphTopologicalSort(D);\n[ 2\ , 5, 4, 7, 8, 9, 6, 3, 1 ]\ngap> D := Digraph(IsMutableDigraph, [[2, 3], [3], \ [4], []]);\n\ngap> DigraphTopologica\ lSort(D);\n[ 4, 3, 2, 1 ]\n]]>\n \n\n\n \ \n \n \ \n \n If digraph is a digraph, then the first operation returns the \ label\n of the vertex i. The second operation can be used to set the\ label\n of the vertex i in digraph to the arbitrary &GAP; ob\ ject\n obj. \n\n The label of a vertex can be changed an arb\ itrary number of times. If no\n label has been set for the vertex i,\ then the default value is\n i. \n\n If digraph is a d\ igraph created from a record with a component\n vertices, then the l\ abels of the vertices are set to the value of\n this component. \n\n \ Induced subdigraphs, and some other operations which create new digraphs from\ \n old ones, inherit their labels from their parents.\n\n D := DigraphFromDigraph6String(\"&DHUEe_\");\n\ngap> DigraphVertexLabel(D, 3);\n3\ngap> D := Digraph\ ([\"a\", \"b\", \"c\"], [], []);\n\ng\ ap> DigraphVertexLabel(D, 2);\n\"b\"\ngap> SetDigraphVertexLabel(D, 2, \"d\");\ \ngap> DigraphVertexLabel(D, 2);\n\"d\"\ngap> D := InducedSubdigraph(D, [1, 2]\ );\n\ngap> DigraphVertexLabel(D, 2);\ \n\"d\"\ngap> D := Digraph(IsMutableDigraph, [\"e\", \"f\", \"g\"], [], []);\n\ \ngap> DigraphVertexLabel(D, 1);\n\"e\"\ \ngap> SetDigraphVertexLabel(D, 1, \"h\");\ngap> DigraphVertexLabel(D, 1);\n\"\ h\"\ngap> InducedSubdigraph(D, [1, 2]);\n\ngap> DigraphVertexLabel(D, 1);\n\"h\"\n]]>\n \n\n\n \n \n \n \ \n If digraph is a digraph, then DigraphVertexLabels\ returns a\n copy of the labels of the vertices in digraph.\n \ SetDigraphVertexLabels can be used to set the labels of the vertices\n\ in digraph to the list of\n arbitrary &GAP; objects list.\ \n\n The label of a vertex can be changed an arbitrary number of times\ . If no\n label has been set for the vertex i, then the default valu\ e is\n i. \n\n If digraph is a digraph created from a \ record with a component\n vertices, then the labels of the vertices \ are set to the value of\n this component. \n\n Induced subdigraphs, a\ nd other operations which create new digraphs from\n old ones, inherit thei\ r labels from their parents.\n\n D := DigraphFromD\ igraph6String(\"&DHUEe_\");\n\nga\ p> DigraphVertexLabels(D);\n[ 1 .. 5 ]\ngap> D := Digraph([\"a\", \"b\", \"c\"\ ], [], []);\n\ngap> DigraphVertexLabe\ ls(D);\n[ \"a\", \"b\", \"c\" ]\ngap> SetDigraphVertexLabel(D, 2, \"d\");\ngap\ > DigraphVertexLabels(D);\n[ \"a\", \"d\", \"c\" ]\ngap> D := InducedSubdigrap\ h(D, [1, 3]);\n\ngap> DigraphVertexLa\ bels(D);\n[ \"a\", \"c\" ]\ngap> D := Digraph(IsMutableDigraph, [\"e\", \"f\",\ \"g\"], [], []);\n\ngap> SetDigraphVer\ texLabels(D, [\"h\", \"i\", \"j\"]);\ngap> DigraphVertexLabels(D);\n[ \"h\", \ \"i\", \"j\" ]\ngap> InducedSubdigraph(D, [1, 3]);\n\ngap> DigraphVertexLabels(D);\n[ \"h\", \"j\" ]\n]]>\n\ \n\n\n \n \n \n \n If digraph is a digraph\ without multiple edges, then the first\n operation returns the label of th\ e edge from vertex i to vertex\n j. The second operation can\ be used to set the label of the edge\n between vertex i and vertex \ j to the arbitrary &GAP; object\n obj. \n\n The label \ of an edge can be changed an arbitrary number of times. If no\n label has b\ een set for the edge, then the default value is 1. \n\n Induced \ subdigraphs, and some other operations which create new digraphs from\n old\ ones, inherit their edge labels from their parents.\n\n See also .\n\n D := DigraphFromDigr\ aph6String(\"&DHUEe_\");\n\ngap> \ DigraphEdgeLabel(D, 3, 1);\n1\ngap> SetDigraphEdgeLabel(D, 2, 5, [42]);\ngap> \ DigraphEdgeLabel(D, 2, 5);\n[ 42 ]\ngap> D := InducedSubdigraph(D, [2, 5]);\n<\ immutable digraph with 2 vertices, 3 edges>\ngap> DigraphEdgeLabel(D, 1, 2);\n\ [ 42 ]\ngap> D := ChainDigraph(IsMutableDigraph, 5);\n\ngap> DigraphEdgeLabel(D, 2, 3);\n1\ngap> SetDigraphEdgeLab\ el(D, 4, 5, [1729]);\ngap> DigraphEdgeLabel(D, 4, 5);\n[ 1729 ]\ngap> InducedS\ ubdigraph(D, [4, 5]);\n\ngap> Digraph\ EdgeLabel(D, 1, 2);\n[ 1729 ]\n]]>\n \n\ \n\n \n \n \ \n \n \ \n If digraph is a digraph without multiple edges, then\n Digr\ aphEdgeLabels returns a copy of the labels of the edges\n in digraph\ as a list of lists labels such that\n labels[i][j] is th\ e label on the edge from vertex i\n to vertex OutNeighbours(digra\ ph)[i][j].\n\n SetDigraphEdgeLabels can be used to set the label\ s of the edges in\n digraph without multiple edges to the list la\ bels of lists of\n arbitrary &GAP; objects such that list[i][j] \ is the label on the edge\n from vertex i to the vertex OutNeighbo\ urs(digraph>[i][j].\n\n Alternatively SetDigraphEdgeLabels can b\ e called with binary function\n func that as its second argument tha\ t when passed two vertices i\n and j returns the label for th\ e edge between vertex i and vertex\n j. \n\n The label\ of an edge can be changed an arbitrary number of times. If no\n label has \ been set for an edge, then the default value is 1. \n\n Induced \ subdigraphs, and some other operations which create new digraphs\n from old\ ones, inherit their labels from their parents.\n\n D := DigraphFromDigraph6String(\"&DHUEe_\");\n\ngap> DigraphEdgeLabels(D);\n[ [ 1 ], [ 1, 1, 1 ], [ 1 ], [ 1,\ 1, 1 ], [ 1, 1, 1 ] ]\ngap> SetDigraphEdgeLabel(D, 2, 1, \"d\");\ngap> Digrap\ hEdgeLabels(D);\n[ [ 1 ], [ \"d\", 1, 1 ], [ 1 ], [ 1, 1, 1 ], [ 1, 1, 1 ] ]\n\ gap> D := InducedSubdigraph(D, [1, 2, 3]);\n\ngap> DigraphEdgeLabels(D);\n[ [ 1 ], [ \"d\", 1 ], [ 1 ] ]\ngap> O\ utNeighbours(D);\n[ [ 3 ], [ 1, 3 ], [ 1 ] ]\ngap> D := CompleteBipartiteDigra\ ph(IsMutableDigraph, 2, 3);\n\ngap>\ DigraphEdgeLabels(D);\n[ [ 1, 1, 1 ], [ 1, 1, 1 ], [ 1, 1 ], [ 1, 1 ], [ 1, 1\ ] ]\ngap> SetDigraphEdgeLabel(D, 2, 4, \"a\");\ngap> DigraphEdgeLabels(D);\n[\ [ 1, 1, 1 ], [ 1, \"a\", 1 ], [ 1, 1 ], [ 1, 1 ], [ 1, 1 ] ]\ngap> InducedSub\ digraph(D, [1, 2, 3, 4]);\n\ngap> Di\ graphEdgeLabels(D);\n[ [ 1, 1 ], [ 1, \"a\" ], [ 1, 1 ], [ 1, 1 ] ]\ngap> OutN\ eighbors(D);\n[ [ 3, 4 ], [ 3, 4 ], [ 1, 2 ], [ 1, 2 ] ]\n]]>\n \n\n\n \n \n A list of edges.\n \n DigraphInEdges returns the list of all edges of digraph<\ /A>\n which have vertex as their range.\n D := Digraph([[2, 2], [3, 3], [4, 4], [1, 1]]);\n\ngap> DigraphInEdges(D, 2);\n[ [ 1, 2 ], [ 1, 2 ] ]\n]]\ >\n \n\n\n \n \n A list of edges.\n \n DigraphOutEdges returns the list of all e\ dges of digraph\n which have vertex as their source.\n D := Digraph([[2, 2], [3, 3], [4, 4], [1, 1]]);\n\ngap> DigraphOutEdges(D, 2);\n[ [ 2\ , 3 ], [ 2, 3 ] ]\n]]>\n \n\n\n \n \n \n true o\ r false.\n \n In the first form, this functi\ on returns true if and only if the list\n list specifies an e\ dge in the digraph digraph. Specifically,\n this operation returns \ true if list is a pair of positive\n integers where list[1] is the source and list[2]\n is the range of an e\ dge in digraph, and false otherwise. \n\n The second form\ simply returns true if [u, v] is\n an edge in \ digraph, and false otherwise.\n\n D := D\ igraph([[2, 2], [6], [], [3], [], [1]]);\n\ngap> IsDigraphEdge(D, [1, 1]);\nfalse\ngap> IsDigraphEdge(D, [1\ , 2]);\ntrue\ngap> IsDigraphEdge(D, [1, 8]);\nfalse\n]]>\n \n\n\n \n \n \n\ \n \n true or false.\n \n If digraph is a digraph and list\ is a list of pairs of\n vertices of digraph, then IsMatching\ returns true if\n list is a matching of digraph. \ The operation\n IsMaximalMatching returns true if list is a maximal \n matching, IsMaximumMatching returns true if\ list is a\n maximum matching and IsPerfectMatching returns <\ K>true if \n list is a perfect, matching of digraph, resp\ ectively. \n Otherwise, each of these operations return false.\n \ \n\n A matching M of a digraph digraph is a subse\ t of the\n edges of digraph, i.e. DigraphEdges(digraph), such\n that no pair of distinct edges in M are incident to the sa\ me vertex\n of digraph. Note that this definition allows a matching\ to contain\n loops. See . The matching <\ C>M is\n maximal if it is contained in no larger matching of the\ digraph,\n is maximum if it has the greatest cardinality among all \ matchings and\n is perfect if every vertex of the digraph is inciden\ t to an edge in\n the matching. Every maximum or perfect matching is maxim\ al. Note, however,\n that not every perfect matching of digraphs with loops\ is maximum.\n\n D := Digraph([[1, 2], [1, 2], [2,\ 3, 4], [3, 5], [1]]);\n\ngap> Is\ Matching(D, [[2, 1], [3, 2]]);\nfalse\ngap> edges := [[3, 2]];;\ngap> IsMatchi\ ng(D, edges);\ntrue\ngap> IsMaximalMatching(D, edges);\nfalse\ngap> edges := [\ [2, 1], [3, 4]];;\ngap> IsMaximalMatching(D, edges);\ntrue\ngap> IsPerfectMatc\ hing(D, edges);\nfalse\ngap> edges := [[1, 2], [3, 3], [4, 5]];;\ngap> IsPerfe\ ctMatching(D, edges);\ntrue\ngap> IsMaximumMatching(D, edges);\nfalse\ngap> ed\ ges := [[1, 1], [2, 2], [3, 3], [4, 5]];;\ngap> IsMaximumMatching(D, edges);\n\ true\n]]>\n \n\n\n \n \n A list of pa\ irs of vertices.\n \n This function returns a maxim\ al matching of the digraph digraph.\n \n\n For the definition\ of a maximal matching, see . \n\n D := DigraphFromDiSparse6String(\".IeAoXCJU@|SHAe?d\");\n\ngap> M := DigraphMaximalMatching(\ D);; IsMaximalMatching(D, M);\ntrue\ngap> D := RandomDigraph(100);;\ngap> IsMa\ ximalMatching(D, DigraphMaximalMatching(D));\ntrue\ngap> D := GeneralisedPeter\ senGraph(IsMutableDigraph, 9, 2);\n\ngap> IsMaximalMatching(D, DigraphMaximalMatching(D));\ntrue\n]]>\ \n \n\n\n \n \n A list of pairs of vertices.\n \n This function returns a maximum matching of the \ digraph digraph.\n \n\n For the definition of a maximum match\ ing, see .\n If digraph is bipartit\ e (see ), then \n the algorithm used has \ complexity O(m*sqrt(n)). Otherwise for general \n graphs the complex\ ity is O(m*n*log(n)). Here n is the number of vertices \n and\ m is the number of edges.\n\n D := Digraph\ FromDigraph6String(\"&I@EA_A?AdDp[_c??OO\");\n\ngap> M := DigraphMaximumMatching(D);; IsMaximalMatching(D, M);\ \ntrue\ngap> Length(M);\n5\ngap> D := Digraph([[5, 6, 7, 8], [6, 7, 8], [7, 8]\ , [8], \n> [], [], [], []]);;\ngap> M := DigraphMaximumMatchi\ ng(D);\n[ [ 1, 5 ], [ 2, 6 ], [ 3, 7 ], [ 4, 8 ] ]\ngap> D := GeneralisedPeter\ senGraph(IsMutableDigraph, 9, 2);\n\ngap> M := DigraphMaximumMatching(D);;\ngap> IsMaximalMatching(D, M);\ntrue\ \ngap> Length(M);\n9\n]]>\n \n\n\n \n\n Neighbours and degree\n \n \n \n A square matrix of non-nega\ tive integers.\n \n This function returns the adjac\ ency matrix mat of the digraph\n digraph.\n The value of t\ he matrix entry mat[i][j] is the number of edges\n in digraph\ with source i and range j. If digraph\n has no vertic\ es, then the empty list is returned. \n\n The function AdjacencyMatr\ ix returns an immutable list of\n lists, whereas the function Adjace\ ncyMatrixMutableCopy returns a copy\n of AdjacencyMatrix that is\ a mutable list of mutable lists. \n\n gr := D\ igraph([\n> [2, 2, 2], [1, 3, 6, 8, 9, 10], [4, 6, 8],\n> [1, 2, 3, 9], [3, 3]\ , [3, 5, 6, 10], [1, 2, 7],\n> [1, 2, 3, 10, 5, 6, 10], [1, 3, 4, 5, 8, 10],\n\ > [2, 3, 4, 6, 7, 10]]);\n\ \ngap> mat := AdjacencyMatrix(gr);;\ngap> Display(mat);\n[ [ 0, 3, 0, 0, \ 0, 0, 0, 0, 0, 0 ],\n [ 1, 0, 1, 0, 0, 1, 0, 1, 1, 1 ],\n [ \ 0, 0, 0, 1, 0, 1, 0, 1, 0, 0 ],\n [ 1, 1, 1, 0, 0, 0, 0, 0, \ 1, 0 ],\n [ 0, 0, 2, 0, 0, 0, 0, 0, 0, 0 ],\n [ 0, 0, 1, 0, \ 1, 1, 0, 0, 0, 1 ],\n [ 1, 1, 0, 0, 0, 0, 1, 0, 0, 0 ],\n [ \ 1, 1, 1, 0, 1, 1, 0, 0, 0, 2 ],\n [ 1, 0, 1, 1, 1, 0, 0, 1,\ 0, 1 ],\n [ 0, 1, 1, 1, 0, 1, 1, 0, 0, 1 ] ]\ngap> D := CycleDig\ raph(IsMutableDigraph, 3);\n\ngap> D\ isplay(AdjacencyMatrix(D));\n[ [ 0, 1, 0 ],\n [ 0, 0, 1 ],\n [ 1, 0,\ 0 ] ]\n]]>\n \n\n\n \n \ \n A polyn\ omial with integer coefficients.\n \n This function\ returns the characteristic polynomial of the digraph\n digraph. Th\ at is it returns the characteristic polynomial\n of the adjacency matrix \ of the digraph digraph\n D := Digraph([\n> \ [2, 2, 2], [1, 3, 6, 8, 9, 10], [4, 6, 8],\n> [1, 2, 3, 9], [3, 3], [3, 5, 6, \ 10], [1, 2, 7],\n> [1, 2, 3, 10, 5, 6, 10], [1, 3, 4, 5, 8, 10],\n> [2, 3, 4, \ 6, 7, 10]]);\n\ngap> Charac\ teristicPolynomial(D);\nx_1^10-3*x_1^9-7*x_1^8-x_1^7+14*x_1^6+x_1^5-26*x_1^4+5\ 1*x_1^3-10*x_1^2\\\n+18*x_1-30\ngap> D := CompleteDigraph(5);\n\ngap> CharacteristicPolynomial(D);\nx_1^5-10*x_1\ ^3-20*x_1^2-15*x_1-4\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> CharacteristicPolynomial(D);\nx_1^3-1\n\ ]]>\n \n\n\n \n \n \n A square matrix of boolean\ s.\n \n If digraph is a digraph with a posit\ ive number of vertices\n n, then BooleanAdjacencyMatrix(di\ graph)\n returns the boolean adjacency matrix mat of d\ igraph. The\n value of the matrix entry mat[j][i] is true if and only if\n there exists an edge in digraph with source j<\ /C> and range\n i. If digraph has no vertices, then the empt\ y list is\n returned. \n\n Note that the boolean adjacency matrix lo\ ses information about multiple\n edges. \n\n The attribute Boole\ anAdjacencyMatrix returns an immutable list of\n immutable lists, where\ as the function\n BooleanAdjacencyMatrixMutableCopy returns a copy o\ f the\n BooleanAdjacencyMatrix that is a mutable list of mutable lis\ ts. \n gr := Digraph([[3, 4], [2, 3], [1, 2, 4\ ], [4]]);\n\ngap> PrintArray(Boole\ anAdjacencyMatrix(gr));\n[ [ false, false, true, true ],\n [ false, \ true, true, false ],\n [ true, true, false, true ],\n [ false, f\ alse, false, true ] ]\ngap> gr := CycleDigraph(4);;\ngap> PrintArray(Boolea\ nAdjacencyMatrix(gr));\n[ [ false, true, false, false ],\n [ false, fa\ lse, true, false ],\n [ false, false, false, true ],\n [ true, fa\ lse, false, false ] ]\ngap> BooleanAdjacencyMatrix(EmptyDigraph(0));\n[ ]\n\ gap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> PrintArray(BooleanAdjacencyMatrix(D));\n[ [ false, true, \ false ],\n [ false, false, true ],\n [ true, false, false ] ]\n]]>\n \n\n\n \n \n A function.\ \n \n If digraph is a digraph, then DigraphAdjacenc\ yFunction returns\n a function which takes two integer parameters x,\ y and returns\n true if there exists an edge from vertex x to vertex y\n in digraph and false if not.\n\n <\ Example> digraph := Digraph([[1, 2], [3], []]);\n\ngap> foo := DigraphAdjacencyFunction(digraph);\ \nfunction( u, v ) ... end\ngap> foo(1, 1);\ntrue\ngap> foo(1, 2);\ntrue\ngap>\ foo(1, 3);\nfalse\ngap> foo(3, 1);\nfalse\ngap> gr := Digraph([\"a\", \"b\", \ \"c\"],\n> [\"a\", \"b\", \"b\"],\n> [\"b\",\ \"a\", \"a\"]);\n\ngap> foo \ := DigraphAdjacencyFunction(gr);\nfunction( u, v ) ... end\ngap> foo(1, 2);\nt\ rue\ngap> foo(3, 2);\nfalse\ngap> foo(3, 1);\nfalse\ngap> D := CycleDigraph(Is\ MutableDigraph, 3);\n\ngap> foo := D\ igraphAdjacencyFunction(D);\nfunction( u, v ) ... end\ngap> foo(1, 2);\ntrue\n\ gap> foo(2, 1);\nfalse\n]]>\n \n\n\n \ \n \n \n A list of positive integers.\n \n DigraphRange and DigraphSource retu\ rn the range and source of\n the digraph digraph. More precisely, po\ sition i in\n DigraphRange(digraph) is the range of th\ e ith edge of\n digraph.\n\n gr :\ = Digraph([\n> [2, 1, 3, 5], [1, 3, 4], [2, 3], [2], [1, 2, 3, 4]]);\n\ngap> DigraphRange(gr);\n[ 2, 1, 3, 5, 1\ , 3, 4, 2, 3, 2, 1, 2, 3, 4 ]\ngap> DigraphSource(gr);\n[ 1, 1, 1, 1, 2, 2, 2,\ 3, 3, 4, 5, 5, 5, 5 ]\ngap> DigraphEdges(gr);\n[ [ 1, 2 ], [ 1, 1 ], [ 1, 3 ]\ , [ 1, 5 ], [ 2, 1 ], [ 2, 3 ], \n [ 2, 4 ], [ 3, 2 ], [ 3, 3 ], [ 4, 2 ], [ \ 5, 1 ], [ 5, 2 ], \n [ 5, 3 ], [ 5, 4 ] ]\ngap> D := CycleDigraph(IsMutableDi\ graph, 3);\n\ngap> DigraphRange(D);\ \n[ 2, 3, 1 ]\ngap> DigraphSource(D);\n[ 1, 2, 3 ]\n]]>\n \n\n\n \n \n \n \n \n The adjacencies of a digraph.\n \n This function returns the list out of out-neig\ hbours of each vertex\n of the digraph digraph.\n More specifical\ ly, a vertex j appears in out[i] each time\n there exists an \ edge with source i and range j in\n digraph. \n\n \ The function OutNeighbours returns an immutable list of\n lists, \ whereas the function OutNeighboursMutableCopy returns a copy\n of OutNeighbours which is a mutable list of mutable lists. \n\n gr := Digraph([\"a\", \"b\", \"c\"],\n> [\ \"a\", \"b\", \"b\"],\n> [\"b\", \"a\", \"c\"]);\n\ngap> OutNeighbours(gr);\n[ [ 2 ], [ 1, 3 ],\ [ ] ]\ngap> gr := Digraph([[1, 2, 3], [2, 1], [3]]);\n\ngap> OutNeighbours(gr);\n[ [ 1, 2, 3 ], [ 2, 1 ], [ 3 \ ] ]\ngap> gr := DigraphByAdjacencyMatrix([\n> [1, 2, 1],\n> [1, 1, 0],\n> [\ 0, 0, 1]]);\n\ngap> OutNeighb\ ours(gr);\n[ [ 1, 2, 2, 3 ], [ 1, 2 ], [ 3 ] ]\ngap> OutNeighboursMutableCopy(\ gr);\n[ [ 1, 2, 2, 3 ], [ 1, 2 ], [ 3 ] ]\ngap> D := CycleDigraph(IsMutableDig\ raph, 3);\n\ngap> OutNeighbours(D);\ \n[ [ 2 ], [ 3 ], [ 1 ] ]\n]]>\n \n\n\n \ \n \n \n \n \n \ A list of lists of vertices.\n \n This fu\ nction returns the list inn of in-neighbours of each vertex\n of the\ digraph digraph.\n More specifically, a vertex j appears in \ inn[i] each time\n there exists an edge with source j and ran\ ge i in\n digraph. \n\n The function InNeighbours returns an immutable list of\n lists, whereas the function InNeighbou\ rsMutableCopy returns a copy\n of InNeighbours which is a mutabl\ e list of mutable lists. \n\n Note that each entry of inn is sor\ ted into ascending order. \n\n gr := Digraph([\ \"a\", \"b\", \"c\"],\n> [\"a\", \"b\", \"b\"],\n> \ [\"b\", \"a\", \"c\"]);\n\n\ gap> InNeighbours(gr);\n[ [ 2 ], [ 1 ], [ 2 ] ]\ngap> gr := Digraph([[1, 2, 3]\ , [2, 1], [3]]);\n\ngap> InNeighbo\ urs(gr);\n[ [ 1, 2 ], [ 1, 2 ], [ 1, 3 ] ]\ngap> gr := DigraphByAdjacencyMatri\ x([\n> [1, 2, 1],\n> [1, 1, 0],\n> [0, 0, 1]]);\n\ngap> InNeighbours(gr);\n[ [ 1, 2 ], [ 1, 1, 2 ], [ 1,\ 3 ] ]\ngap> InNeighboursMutableCopy(gr);\n[ [ 1, 2 ], [ 1, 1, 2 ], [ 1, 3 ] ]\ \ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> InNeighbours(D);\n[ [ 3 ], [ 1 ], [ 2 ] ]\n]]>\n \ \n\n\n \n \n \n \ \n A list of non-negati\ ve integers.\n \n\n Given a digraph digraph \ with n vertices, the function\n OutDegrees returns an immutab\ le list out of length n, such that\n for a vertex i in\ digraph, the value of out[i] is the\n out-degree of vertex <\ C>i.\n See . \n\n The function \ OutDegreeSequence returns the same list,\n after it has been sorted \ into non-increasing order. \n\n The function OutDegreeSet return\ s the same list, sorted into\n increasing order with duplicate entries remo\ ved. \n\n D := Digraph([[1, 3, 2, 2], [], [2, \ 1], []]);\n\ngap> OutDegrees(\ D);\n[ 4, 0, 2, 0 ]\ngap> OutDegreeSequence(D);\n[ 4, 2, 0, 0 ]\ngap> OutDegre\ eSet(D);\n[ 0, 2, 4 ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> OutDegrees(D);\n[ 1, 1, 1 ]\n]]>\n \n\n\n \n \n \ \n \n A list of non-neg\ ative integers.\n \n\n Given a digraph digraph with n vertices, the function\n InDegrees returns an immut\ able list inn of length n, such that\n for a vertex i \ in digraph, the value of inn[i] is\n the in-degree of vertex \ i.\n See . \n\n The function \ InDegreeSequence returns the same list,\n after it has been sorted i\ nto non-increasing order. \n\n The function InDegreeSet returns \ the same list, sorted into\n increasing order with duplicate entries remove\ d. \n\n D := Digraph([[1, 3, 2, 2, 4], [], [2,\ 1, 4], []]);\n\ngap> InDegre\ es(D);\n[ 2, 3, 1, 2 ]\ngap> InDegreeSequence(D);\n[ 3, 2, 2, 1 ]\ngap> InDegr\ eeSet(D);\n[ 1, 2, 3 ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> InDegrees(D);\n[ 1, 1, 1 ]\n]]>\n \n\n\n \n \n The non-negative integer\ .\n \n This operation returns the out-degree of the\ vertex vertex in the\n digraph digraph.\n The out-degree \ of vertex is the number of edges in digraph\n whose source is\ vertex.\n \n D := Digraph([\n> [2, \ 2, 1], [1, 4], [2, 2, 4, 2], [1, 1, 2, 2, 1, 2, 2]]);\n\ngap> OutDegreeOfVertex(D, 1);\n3\ngap> OutDegreeO\ fVertex(D, 2);\n2\ngap> OutDegreeOfVertex(D, 3);\n4\ngap> OutDegreeOfVertex(D,\ 4);\n7\n]]>\n \n\n\n \n \ \n \n A list of verti\ ces.\n \n\n This operation returns the list out<\ /C> of vertices of the digraph\n digraph.\n A vertex i app\ ears in the list out each time there exists an\n edge with source <\ A>vertex and range i in digraph; in\n particular, this me\ ans that out may contain duplicates. \n \ D := Digraph([\n> [2, 2, 3], [1, 3, 4], [2, 2, 3], [1, 1, 2, 2, 1, 2, 2]]);\n<\ immutable multidigraph with 4 vertices, 16 edges>\ngap> OutNeighboursOfVertex(\ D, 1);\n[ 2, 2, 3 ]\ngap> OutNeighboursOfVertex(D, 3);\n[ 2, 2, 3 ]\n]]>\n \n\n\n \n \n A non-negative integer.\n \n This operation returns the in-degree of the ver\ tex vertex in the\n digraph digraph.\n The in-degree of vertex is the number of edges in digraph\n whose range is ve\ rtex.\n D := Digraph([\n> [2, 2, 1], [1, 4], [\ 2, 2, 4, 2], [1, 1, 2, 2, 1, 2, 2]]);\n\ngap> InDegreeOfVertex(D, 1);\n5\ngap> InDegreeOfVertex(D, 2);\n9\ \ngap> InDegreeOfVertex(D, 3);\n0\ngap> InDegreeOfVertex(D, 4);\n2\n]]>\n \n\n\n \n \n \n A list of postitive vertices.\n \n\n This operation returns the list inn of vert\ ices of the digraph\n digraph.\n A vertex i appears in the\ list inn each time there exists an\n edge with source i and\ range vertex in digraph; in\n particular, this means that inn may contain duplicates. \n\n D := Dig\ raph([\n> [2, 2, 3], [1, 3, 4], [2, 2, 3], [1, 1, 2, 2, 1, 2, 2]]);\n\ngap> InNeighboursOfVertex(D, 1);\n[\ 2, 4, 4, 4 ]\ngap> InNeighboursOfVertex(D, 2);\n[ 1, 1, 3, 3, 4, 4, 4, 4 ]\n]\ ]>\n \n\n\n \n \n A list of vertices.\ \n \n If digraph is a digraph, then DigraphLoops returns the list\n consisting of the of <\ A>digraph\n at which there is a loop. See . \n\n D := Digraph([[2], [3], []]);\n\ngap> DigraphHasLoops(D);\nfalse\ngap> \ DigraphLoops(D);\n[ ]\ngap> D := Digraph([[3, 5], [1], [2, 4, 3], [4], [2, 1]\ ]);\n\ngap> DigraphLoops(D);\n[ 3,\ 4 ]\ngap> D := Digraph(IsMutableDigraph, [[1], [1]]);\n\ngap> DigraphLoops(D);\n[ 1 ]\n]]>\n \n\n\n \n \n \n A positive integer \ or fail\n \n If the first argument is a pa\ rtial order digraph then these oper\ ations return the meet, or\n the join, of the two input vertices. If the me\ et (or join) is does not\n exist then fail is returned. The meet (or\ join) is guaranteed to\n exist when the first argument satisfies\n (or\n ) - see the documentation for these\n properties for the definitio\ n of the meet (or the join).\n\n D := Digraph([[1]\ , [1, 2], [1, 3], [1, 2, 3, 4]]);\n\ngap> PartialOrderDigraphMeetOfVertices(D, 2, 3);\n4\ngap> PartialOrderDigra\ phJoinOfVertices(D, 2, 3);\n1\ngap> PartialOrderDigraphMeetOfVertices(D, 1, 2)\ ;\n2\ngap> PartialOrderDigraphJoinOfVertices(D, 3, 4);\n3\ngap> D := Digraph([\ [1], [2], [1, 2, 3], [1, 2, 4]]);\n\ngap> PartialOrderDigraphMeetOfVertices(D, 3, 4);\nfail\ngap> PartialOrderDi\ graphJoinOfVertices(D, 3, 4);\nfail\ngap> PartialOrderDigraphMeetOfVertices(D,\ 1, 2);\nfail\ngap> PartialOrderDigraphJoinOfVertices(D, 1, 2);\nfail\n]]>\n \n\n\n \n \n A square matrix of non-negative int\ egers.\n \n This function returns the outdegree mat\ rix mat of the digraph\n digraph. The value of the ith\ diagonal matrix entry is the\n outdegree of the vertex i in digr\ aph. All off-diagonal entries \n are 0.\n If digraph h\ as no vertices, then the empty list is returned. \n\n See for more information.\n D := Digraph\ ([[1, 2, 3], [4], [1, 3, 4], []]);\n\ngap> PrintArray(DegreeMatrix(D));\n[ [ 3, 0, 0, 0 ],\n [ 0, 1, 0, \ 0 ],\n [ 0, 0, 3, 0 ],\n [ 0, 0, 0, 0 ] ]\ngap> D := CycleDigraph(5\ );;\ngap> PrintArray(DegreeMatrix(D));\n[ [ 1, 0, 0, 0, 0 ],\n [ 0, 1,\ 0, 0, 0 ],\n [ 0, 0, 1, 0, 0 ],\n [ 0, 0, 0, 1, 0 ],\n [ 0, \ 0, 0, 0, 1 ] ]\ngap> DegreeMatrix(EmptyDigraph(0));\n[ ]\ngap> D := Cycle\ Digraph(IsMutableDigraph, 3);\n\ngap\ > Display(DegreeMatrix(D));\n[ [ 1, 0, 0 ],\n [ 0, 1, 0 ],\n [ 0, 0,\ 1 ] ]\n]]>\n \n\n\n \n \ \n A square matrix \ of integers.\n \n This function returns the outdegr\ ee Laplacian matrix mat of the\n digraph digraph. The outdegr\ ee Laplacian matrix is defined as\n DegreeMatrix(digraph) - AdjacencyMat\ rix(digraph). If\n digraph has no vertices, then the empty list\ is returned. \n\n See and for more\n information.\n gr :\ = Digraph([[1, 2, 3], [4], [1, 3, 4], []]);\n\ngap> PrintArray(LaplacianMatrix(gr));\n[ [ 2, -1, -1, 0 ],\ \n [ 0, 1, 0, -1 ],\n [ -1, 0, 2, -1 ],\n [ 0, 0, 0, 0\ ] ]\ngap> LaplacianMatrix(EmptyDigraph(0));\n[ ]\ngap> D := CycleDigraph(IsM\ utableDigraph, 3);\n\ngap> Display(L\ aplacianMatrix(D));\n[ [ 1, -1, 0 ],\n [ 0, 1, -1 ],\n [ -1, 0,\ 1 ] ]\n]]>\n \n\n\n \n\n \ Reachability and connectivity\n \n \ \n An integer or fail.\n \n This function returns the diameter \ of the digraph digraph.\n \n\n If a digraph digraph is\ strongly connected and has at least 1\n vertex, then the diameter i\ s the maximum shortest distance between\n any pair of distinct vertices. Ot\ herwise then the diameter of\n digraph is undefined, and this functi\ on returns the value\n fail. \n\n See . \n D := Digraph([[2], [3], \ [4, 5], [5], [1, 2, 3, 4, 5]]);\n\ \ngap> DigraphDiameter(D);\n3\ngap> D := ChainDigraph(2);\n\ngap> DigraphDiameter(D);\nfail\ngap> IsStronglyConnect\ edDigraph(D);\nfalse\ngap> D := GeneralisedPetersenGraph(IsMutableDigraph, 6, \ 2);\n\ngap> DigraphDiameter(D);\n4\ \n]]>\n \n\n\n \n \n \n \n An integer or fail\n \n If there is a directed path in the digraph digraph\ between vertex\n u and vertex v, then this operation ret\ urns the length of the\n shortest such directed path. If no such directed \ path exists, then this\n operation returns fail. See section for the definition of a direc\ ted path. \n\n If the second form is used, then list should be a\ list of length two,\n containing two positive integers which correspond to\ the vertices u\n and v. \n\n Note that as usual, a ve\ rtex is considered to be at distance 0 from\n itself . \n\n If the th\ ird form is used, then list1 and list2 are both lists\n of ve\ rtices. The shortest directed path between list1 and\n list2 \ is then the length of the shortest directed path which starts\n with a vert\ ex in list1 and terminates at a vertex in list2, if\n such di\ rected path exists. If list1 and list2 have non-empty\n inter\ section, the operation returns 0. \n D :\ = Digraph([[2], [3], [1, 4], [1, 3], [5]]);\n\ngap> DigraphShortestDistance(D, 1, 3);\n2\ngap> DigraphShortestDi\ stance(D, [3, 3]);\n0\ngap> DigraphShortestDistance(D, 5, 2);\nfail\ngap> Digr\ aphShortestDistance(D, [1, 2], [4, 5]);\n2\ngap> DigraphShortestDistance(D, [1\ , 3], [3, 5]);\n0\n]]>\n \n\n\n \n \n A square matrix.\n \n If digraph is a dig\ raph with n vertices, then this\n function returns an n \\times n\ matrix mat, where each entry is\n either a non-negative integer\ , or fail. If n = 0, then an\n empty list is returned. \ \n\n If there is a directed path from vertex i to vertex j, t\ hen\n the value of mat[i][j] is the length of the shortest such dire\ cted\n path. If no such directed path exists, then the value of mat[i][j\ ] is\n fail. We use the convention that the distance from every\ vertex to\n itself is 0, i.e. mat[i][i] = 0 for all vertices\ i.\n \n\n The method used in this function is a version of t\ he Floyd-Warshall\n algorithm, and has complexity O(n^3).\n\n D := Digraph([[1, 2], [3], [1, 2], [4]]);\n\ngap> mat := DigraphShortestDistances(D);;\nga\ p> PrintArray(mat);\n[ [ 0, 1, 2, fail ],\n [ 2, 0, \ 1, fail ],\n [ 1, 1, 0, fail ],\n [ fail, fail, fail, 0\ ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphShortestDistances(D);\n[ [ 0, 1, 2 ], [ 2, 0, 1 \ ], [ 1, 2, 0 ] ]\n]]>\n \n\n\n \n \ \n An integer, or infinity.\n \n I\ f digraph is a digraph and v is a vertex in digraph,\n \ then this operation returns the length of the longest directed walk in\n <\ A>digraph which begins at vertex v. See section for the definitions of directed\n wal\ k, directed cycle, and loop.\n \n\n \n \n If\ there exists a directed walk starting at vertex v\n which trave\ rses a loop or a directed cycle,\n then we consider there to be a walk \ of infinite length from v\n (realised by repeatedly traversing t\ he loop/directed cycle),\n and so the result is infinity.\n \ To disallow walks using loops, try using\n : \n\n DigraphLongestDistanceFromVertex(DigraphRemoveLoo\ ps(digraph,v)).\n \n\n \n Othe\ rwise, if all directed walks\n starting at vertex v have finite \ length,\n then the length of the longest such walk is returned.\n \ \n \n\n Note that the result is 0 if and only if v is a sink of\n digraph. See .\n\ \n D := Digraph([[2], [3, 4], [], [5], [], [6]]);\n\ngap> DigraphLongestDistanceFromVert\ ex(D, 1);\n3\ngap> DigraphLongestDistanceFromVertex(D, 3);\n0\ngap> 3 in Digra\ phSinks(D);\ntrue\ngap> DigraphLongestDistanceFromVertex(D, 6);\ninfinity\n]]>\ \n \n\n\n \n \n \n A list of vertices\n \n This operation returns\ the list of all vertices in digraph digraph\n such that the shortes\ t distance to a vertex vertex is\n distance or is in the list\ distances. \n\n digraph should be a digraph, vertex should be a positive\n integer, distance should be a non-negative\ integer, and\n distances should be a list of non-negative integers.\ \n\n D := Digraph([[2], [3], [1, 4], [1, 3]]);\n\ngap> DigraphDistanceSet(D, 2, [1, \ 2]);\n[ 3, 1, 4 ]\ngap> DigraphDistanceSet(D, 3, 1);\n[ 1, 4 ]\ngap> DigraphDi\ stanceSet(D, 2, 0);\n[ 2 ]\n]]>\n \n\n\n\ \n \n \ An integer, or infinity.\n \n This attribute\ returns the girth of the digraph digraph.\n The girth\ of a digraph is the length of its shortest simple circuit.\n See section <\ Ref Subsect=\"Definitions\" Style=\"Number\" /> for the definitions\n of si\ mple circuit, directed cycle, and loop.\n \n\n If digraph has\ no directed cycles, then this function will return\n infinity. If \ digraph contains a loop, then this function will\n return 1.\ \n \n\n In the worst case, the method used in this function is a ver\ sion of the\n Floyd-Warshall algorithm, and has complexity O(n ^ \ 3), where\n n is the number of vertices in digraph. If t\ he digraph has\n known automorphisms [see ], th\ en the performance\n is likely to be better.\n \n\n For symmetric\ digraphs, see also . \n D := Digraph([[1], [1]]);\n\ngap> DigraphGirth(D);\n1\ngap> D := Digraph([[2, 3], [3], [4], []]\ );\n\ngap> DigraphGirth(D);\ninfin\ ity\ngap> D := Digraph([[2, 3], [3], [4], [1]]);\n\ngap> DigraphGirth(D);\n3\ngap> D := GeneralisedPetersenGraph\ (IsMutableDigraph, 6, 2);\n\ngap> \ DigraphGirth(D);\n2\n]]>\n \n\n\n \n \n An i\ nteger, or infinity.\n \n This attribute ret\ urns the odd girth of the digraph digraph.\n The odd girth\ of a digraph is the length of its shortest simple\n circuit of odd len\ gth. See Section for th\ e definitions of simple circuit, directed\n cycle, and loop.\n \n\n \ If digraph has no directed cycles of odd length, then this function\ \n will return infinity, even if digraph has a directed cycle\ \n of even length. If digraph contains a loop, then this function\n\ will return 1.\n \n\n See also . \n D := Digraph([[2], [3, 1], [1]]);\n\ngap> DigraphOddGirth(D);\n3\ngap> D \ := CycleDigraph(4);\n\ngap> DigraphOd\ dGirth(D);\ninfinity\ngap> D := Digraph([[2], [3], [], [3], [4]]);\n\ngap> DigraphOddGirth(D);\ninfinity\ngap> D\ := CycleDigraph(IsMutableDigraph, 4);\n\ngap> DigraphDisjointUnion(D, CycleDigraph(5));\n\ngap> DigraphOddGirth(D);\n5\n]]>\n \n\n\n \n \n An integer or infinity.\n \n If digraph is a symmetric digraph, then this function r\ eturns the\n girth of digraph when treated as an undirected graph (i\ .e. each pair\n of edges [i, j] and [j, i] is treated as a si\ ngle edge between\n i and j). \n\n The girth of\ an undirected graph is the length of its shortest simple\n cycle, i.e. the\ shortest non-trivial path starting and ending at the same\n vertex and pas\ sing through no vertex or edge more than once. \n\n If digraph h\ as no cycles, then this function will return\n infinity. \n <\ Example> D := Digraph([[2, 4], [1, 3], [2, 4], [1, 3]]);\n\ngap> DigraphUndirectedGirth(D);\n4\ng\ ap> D := Digraph([[2], [1, 3], [2]]);\n\ngap> DigraphUndirectedGirth(D);\ninfinity\ngap> D := Digraph([[1], [], \ [4], [3]]);\n\ngap> DigraphUndirec\ tedGirth(D);\n1\ngap> D := GeneralisedPetersenGraph(IsMutableDigraph, 9, 2);\n\ \ngap> DigraphUndirectedGirth(D);\ \n5\n]]>\n \n\n\n \n \n \n A record.\n \ \n This function returns the record wcc corresponding \ to the weakly\n connected components of the digraph digraph. Two ve\ rtices of\n digraph are in the same weakly connected component whene\ ver they are\n equal, or there exists a directed path (ignoring the orienta\ tion of edges)\n between them. More formally, two vertices are in the same\ weakly connected\n component of digraph if and only if they are in \ the same strongly\n connected component (see )\n of the of <\ A>digraph. \n\n The set of weakly connected components is a partit\ ion of\n the vertex set of digraph. \n\n The record wcc has 2 components: comps and id.\n The component comps is a list of the weakly connected components\n of digraph (each o\ f which is a list of vertices).\n The component id is a list such th\ at the vertex i is an\n element of the weakly connected component comps[id[i]]. \n\n The method used in this function has complexity\ O(m+n), where\n m is the number of edges and\n n \ is the number of vertices in the digraph. \n\n DigraphNrConnectedCom\ ponents(digraph) is simply a shortcut\n for Length(DigraphCon\ nectedComponents(digraph).comps),\n and is no more efficient.\n\ \n gr := Digraph([[2], [3, 1], []]);\n\ngap> DigraphConnectedComponents(gr);\nrec( c\ omps := [ [ 1, 2, 3 ] ], id := [ 1, 1, 1 ] )\ngap> gr := Digraph([[1], [1, 2],\ []]);\n\ngap> DigraphConnectedCom\ ponents(gr);\nrec( comps := [ [ 1, 2 ], [ 3 ] ], id := [ 1, 1, 2 ] )\ngap> Dig\ raphNrConnectedComponents(gr);\n2\ngap> gr := EmptyDigraph(0);\n\ngap> DigraphConnectedComponents(gr);\nrec( comps \ := [ ], id := [ ] )\ngap> D := CycleDigraph(IsMutableDigraph, 2);\n\ngap> G := CycleDigraph(3);\n\ngap> DigraphDisjointUnion(D, G);\n\ngap> DigraphConnectedComponents(D);\nrec( comps :=\ [ [ 1, 2 ], [ 3, 4, 5 ] ], id := [ 1, 1, 2, 2, 2 ] )\n]]>\n \n\n\n \n \n A list of vertices.\ \n \n If vertex is a vertex in the digraph digraph<\ /A>, then\n this operation returns the connected component of vertex\ \n in digraph.\n See f\ or more information.\n D := Digraph([[3], [2], [1,\ 2], [4]]);\n\ngap> DigraphConnect\ edComponent(D, 3);\n[ 1, 2, 3 ]\ngap> DigraphConnectedComponent(D, 2);\n[ 1, 2\ , 3 ]\ngap> DigraphConnectedComponent(D, 4);\n[ 4 ]\n]]>\n \n\n\n \n \n \n A record.\n \ \n This function returns the record scc corresponding to the strongl\ y\n connected components of the digraph digraph. Two vertices of\n \ digraph are in the same strongly connected component whenever they\n\ are equal, or there is a directed path from each vertex to the other. The\ \n set of strongly connected components is a partition of the vertex set of\ \n digraph.\n \n\n The record scc has 2 components:\ comps and id.\n The component comps is a list of the \ strongly connected components\n of digraph (each of which is a list \ of vertices).\n The component id is a list such that the vertex i\ is an\n element of the strongly connected component comps[id[i]]. \n\n The method used in this function is a non-recursive version of \ Gabow's\n Algorithm and has complexity O(m+n) \ where\n m is the number of edges (counting multiple edges as one) an\ d\n n is the number of vertices in the digraph. \n\n Digra\ phNrStronglyConnectedComponents(digraph) is simply a\n shortcut \ for\n Length(DigraphStronglyConnectedComponents(digraph).comps),\n and is no more efficient.\n\n gr := Digra\ ph([[2], [3, 1], []]);\n\ngap> Dig\ raphStronglyConnectedComponents(gr);\nrec( comps := [ [ 3 ], [ 1, 2 ] ], id :=\ [ 2, 2, 1 ] )\ngap> DigraphNrStronglyConnectedComponents(gr);\n2\ngap> D := D\ igraphDisjointUnion(CycleDigraph(4), CycleDigraph(5));\n\ngap> DigraphStronglyConnectedComponents(D);\nrec( comp\ s := [ [ 1, 2, 3, 4 ], [ 5, 6, 7, 8, 9 ] ], \n id := [ 1, 1, 1, 1, 2, 2, 2, 2\ , 2 ] )\ngap> DigraphNrStronglyConnectedComponents(D);\n2\ngap> D := CycleDigr\ aph(IsMutableDigraph, 2);\n\ngap> G \ := CycleDigraph(3);\n\ngap> DigraphDi\ sjointUnion(D, G);\n\ngap> DigraphSt\ ronglyConnectedComponents(D);\nrec( comps := [ [ 1, 2 ], [ 3, 4, 5 ] ], id := \ [ 1, 1, 2, 2, 2 ] )\n]]>\n \n\n\n \n \n A list of vertices.\n \n If <\ A>vertex is a vertex in the digraph digraph, then\n this operati\ on returns the strongly connected component of vertex\n in digrap\ h.\n See for more in\ formation.\n D := Digraph([[3], [2], [1, 2], [3]])\ ;\n\ngap> DigraphStronglyConnected\ Component(D, 3);\n[ 1, 3 ]\ngap> DigraphStronglyConnectedComponent(D, 2);\n[ 2\ ]\ngap> DigraphStronglyConnectedComponent(D, 4);\n[ 4 ]\n]]>\n \n\n\n \n \n A pair of lists of vertices, or fail.\n \n If digraph is a bipartite digraph, \ i.e. if it satisfies , then Digrap\ hBicomponents returns a\n pair of bicomponents of digraph. Other\ wise,\n DigraphBicomponents returns fail. \n\n For a bi\ partite digraph, the vertices can be partitioned into two non-empty\n sets \ such that the source and range of any edge are in distinct sets. The\n part\ s of this partition are called bicomponents of digraph.\n Equ\ ivalently, a pair of bicomponents of digraph consists of the\n color\ -classes of a 2-coloring of digraph. \n\n For a bipartite digrap\ h with at least 3 vertices, there is a unique pair of\n bicomponents of bip\ artite if and only if the digraph is connected. See for more information.\n D := Cycle\ Digraph(3);\n\ngap> DigraphBicomponen\ ts(D);\nfail\ngap> D := ChainDigraph(5);\n\ngap> DigraphBicomponents(D);\n[ [ 1, 3, 5 ], [ 2, 4 ] ]\ngap> D := Digr\ aph([[5], [1, 4], [5], [5], []]);\n\ngap> DigraphBicomponents(D);\n[ [ 1, 3, 4 ], [ 2, 5 ] ]\ngap> D := Complete\ BipartiteDigraph(IsMutableDigraph, 2, 3);\n\ngap> DigraphBicomponents(D);\n[ [ 1, 2 ], [ 3, 4, 5 ] ]\n]]>\n \n\n\n \n \n A list of vertices.\n \ \n\n A connected digraph is biconnected if it is still \ connected (in the\n sense of ) when any v\ ertex is removed. \n If the digraph digraph is not biconnected but i\ s connected, then any\n vertex v of digraph whose removal mak\ es the resulting digraph\n disconnected is called an articulation point<\ /E>. \n\n ArticulationPoints returns a list of the articulation p\ oints of\n digraph, if any, and, in particular, returns the empty li\ st if\n digraph is not connected. \n\n Multiple edges and loo\ ps are ignored by this method. \n\n The method used in this operation h\ as complexity O(m+n) where\n m is the number of edges (counti\ ng multiple edges as one, and not\n counting loops) and n is the num\ ber of vertices in the digraph.\n\n See also .\n ArticulationPoints(CycleDigraph(5));\n[ ]\n\ gap> D := Digraph([[2, 7], [3, 5], [4], [2], [6], [1], []]);;\ngap> Articulati\ onPoints(D);\n[ 2, 1 ]\ngap> ArticulationPoints(ChainDigraph(5));\n[ 4, 3, 2 ]\ \ngap> ArticulationPoints(NullDigraph(5));\n[ ]\ngap> D := ChainDigraph(IsMut\ ableDigraph, 4);\n\ngap> Articulatio\ nPoints(D);\n[ 3, 2 ]\n]]>\n \n\n\n <\ ManSection>\n \n An i\ nteger.\n \n This function returns the period of th\ e digraph digraph. \n\n If a digraph digraph has at least \ one directed cycle, then the period\n is the greatest positive integer whic\ h divides the lengths of all directed\n cycles of digraph. If di\ graph has no directed cycles, then\n this function returns 0. S\ ee section for the def\ inition of a directed cycle. \n\n A digraph with a period of 1 i\ s said to be aperiodic. See\n . <\ P/>\n D := Digraph([[6], [1], [2], [3], [4, 4], [5\ ]]);\n\ngap> DigraphPeriod(D)\ ;\n6\ngap> D := Digraph([[2], [3, 5], [4], [5], [1, 2]]);\n\ngap> DigraphPeriod(D);\n1\ngap> D := ChainDigraph(2\ );\n\ngap> DigraphPeriod(D);\n0\ngap>\ IsAcyclicDigraph(D);\ntrue\ngap> D := GeneralisedPetersenGraph(IsMutableDigra\ ph, 5, 2);\n\ngap> DigraphPeriod(D\ );\n1\n]]>\n \n\n\n \n <\ Oper Name=\"DigraphFloydWarshall\" Arg=\"digraph, func, nopath, edge\"/>\n A matrix.\n \n If digraph is a digrap\ h with n vertices, then\n this operation returns an n \\times n matrix mat containing\n the output of a generalised version of th\ e Floyd-Warshall algorithm,\n applied to digraph. \n\n The op\ eration DigraphFloydWarshall is customised by the arguments\n fun\ c, nopath, and edge.\n The arguments nopath and edge can be arbitrary &GAP; objects.\n The argument func must b\ e a function which accepts 4 arguments:\n the matrix mat, followed b\ y 3 postive integers. The function\n func is where the work to calcu\ late the desired outcome must be\n performed. \n\n This method initi\ alises the matrix mat by setting entry\n mat[i][j] to equal <\ A>edge if there is an edge with source\n i and range j, a\ nd by setting entry mat[i][j] to equal\n nopath otherwise.\n \ The final part of DigraphFloydWarshall then calls the function\n \ func inside three nested for loops, over the vertices of\n digrap\ h: \n\n \n\n The mat\ rix mat is then returned as the result. An example of using\n Dig\ raphFloydWarshall to calculate the shortest (non-zero) distances\n betw\ een the vertices of a digraph is shown below: \n\n D := DigraphFromDigraph6String(\"&EAHQeDB\");\n\ngap> func := function(mat, i, j, k)\n> if mat[i][k] <> \ -1 and mat[k][j] <> -1 then\n> if (mat[i][j] = -1) or (mat[i][j] > mat[i][\ k] + mat[k][j]) then\n> mat[i][j] := mat[i][k] + mat[k][j];\n> fi;\n\ > fi;\n> end;\nfunction( mat, i, j, k ) ... end\ngap> shortest_distances := \ DigraphFloydWarshall(D, func, -1, 1);;\ngap> Display(shortest_distances);\n[ [\ 3, -1, -1, 2, 1, 2 ],\n [ 4, 2, 1, 3, 2, 1 ],\n [ 3\ , 1, 2, 2, 1, 2 ],\n [ 1, -1, -1, 1, 1, 2 ],\n [ 2, -\ 1, -1, 1, 2, 1 ],\n [ 3, -1, -1, 2, 1, 1 ] ]\n]]>\ \n \n\n\n \n \n true or false.\n \n This operation returns true if there exists a \ non-trivial directed\n walk from vertex u to vertex v in the \ digraph digraph,\n and false if there does not exist such a d\ irected walk. See section\n for the definition of a\n non-trivial directed walk.\n \n\n Th\ e method for IsReachable has worst case complexity of O(m +\n n\ ) where m is the number of edges and n the number of\n ve\ rtices in digraph.\n\n D := Digraph([[2], [3], \ [2, 3]]);\n\ngap> IsReachable(D, 1\ , 3);\ntrue\ngap> IsReachable(D, 2, 1);\nfalse\ngap> IsReachable(D, 3, 3);\ntr\ ue\ngap> IsReachable(D, 1, 1);\nfalse\n]]>\n \n\n\n \n \n A pair of lists, or fail.\n \n\ If there exists a non-trivial directed path (or a non-trivial cycle, in th\ e\n case that u = v) from vertex u to vertex\n \ v in the digraph digraph, then this operation returns such a\ \n directed path (or directed cycle). Otherwise, this operation returns\n \ fail. See Section for \ the\n definition of a directed path and a directed cycle.\n \n\n \ A directed path (or directed cycle) of non-zero length n-1,\n (v_\ 1, e_1, v_2, e_2, ..., e_{n-1}, v_n),\n is represented by a pair of lis\ ts [v,a] as follows:\n\n \n \n v is t\ he list [v_1, v_2, ..., v_n].\n \n \n \ a is the list of positive integers [a_1, a_2, ..., a_{n-1}]\n \ where for each each i < n, a_i is the position of\n \ v_{i+1} in\n OutNeighboursOfVertex(digraph,\ v_i)\n corresponding to the edge e_i. This is can\ be useful if the\n position of a vertex in a list of out-neighours is \ significant, for\n example in orbit digraphs.\n \n \n\n The method for DigraphPath has worst case complexity of O(\ m +\n n) where m is the number of edges and n the numbe\ r of\n vertices in digraph.\n\n D := Digraph\ ([[2], [3], [2, 3]]);\n\ngap> Digr\ aphPath(D, 1, 3);\n[ [ 1, 2, 3 ], [ 1, 1 ] ]\ngap> DigraphPath(D, 2, 1);\nfail\ \ngap> DigraphPath(D, 3, 3);\n[ [ 3, 3 ], [ 2 ] ]\ngap> DigraphPath(D, 1, 1);\ \nfail\n]]>\n \n\n\n \n \ \n A pair \ of lists, or fail.\n \n Returns the shortest\ directed path in the digraph digraph from the vertex\n u to the ver\ tex v, if such a path exists. If u =\n v, then \ the shortest non-trivial cycle is returned, again, if it\n exists. Otherwis\ e, this operation returns fail. See Section\n for the definition of a directed\n path and a dire\ cted cycle.\n \n\n See for details on th\ e output.\n\n The method for DigraphShortestPath has worst case comp\ lexity of\n O(m + n) where m is the number of edges and n<\ /M> the\n number of vertices in digraph.\n\n\ D := Digraph([[1, 2], [3], [2, 4], [1], [2, 4]]);\n\ngap> DigraphShortestPath(D, 5, 1);\n[ [ 5, 4, 1 ], [ 2, 1 \ ] ]\ngap> DigraphShortestPath(D, 3, 3);\n[ [ 3, 2, 3 ], [ 1, 1 ] ]\ngap> Digra\ phShortestPath(D, 5, 5);\nfail\ngap> DigraphShortestPath(D, 1, 1);\n[ [ 1, 1 ]\ , [ 1 ] ]\n]]>\n \n\n\n \ \n \n An iter\ ator.\n \n If digraph is a digraph or a list\ of adjacencies which defines a\n digraph - see - then this operation returns an\n iterator of the non-trivial directed \ paths (or directed cycles, in the case\n that u = v) i\ n digraph from the vertex u\n to the vertex v.\n \n\n See for more information about the repes\ entation\n of a directed path or directed cycle which is used, and see for more information about itera\ tors.\n See Section for the d\ efinition of\n a directed path and a directed cycle.\n \n\n\ D := Digraph([[1, 4, 4, 2], [3, 5], [2, 3], [1, 2], [4]]);\n\ngap> iter := IteratorOfPaths\ (D, 1, 4);\n\ngap> NextIterator(iter);\n[ [ 1, 4 ], [ 2 ] ]\ngap> Ne\ xtIterator(iter);\n[ [ 1, 4 ], [ 3 ] ]\ngap> NextIterator(iter);\n[ [ 1, 2, 5,\ 4 ], [ 4, 2, 1 ] ]\ngap> IsDoneIterator(iter);\ntrue\ngap> iter := IteratorOf\ Paths(D, 4, 3);\n\ngap> NextIterator(iter);\n[ [ 4, 1, 2, 3 ], [ 1, \ 4, 1 ] ]\n]]>\n \n\n\n \n\ \n A list\ of lists of vertices.\n \n If digraph is a \ digraph, then DigraphAllSimpleCircuits\n returns a list of the si\ mple circuits in digraph. \n\n See section for the definition\n of a simple circuit, a\ nd related notions. Note that a loop is a simple\n circuit. \n\n For\ a digraph without multiple edges, a simple circuit is uniquely\n determine\ d by its subsequence of vertices. However this is not the case for\n a mult\ idigraph. The attribute DigraphAllSimpleCircuits ignores\n multiple\ edges, and identifies a simple circuit using only its subsequence\n of ver\ tices. For example, although the simple circuits (v, e, v) and\n \ (v, e', v) (for distinct edges e and e') are\n mathematic\ ally distinct, DigraphAllSimpleCircuits considers them to\n be the s\ ame. \n\n With this approach, a directed circuit of length n can\ be determined\n by a list of its first n vertices. Thus a simple ci\ rcuit (v_1,\n e_1, v_2, e_2, ..., e_{n-1}, v_n, e_{n+1}, v_1) can \ be represented as\n the list [v_1, \\ldots, v_n], or any cyclic perm\ utation thereof. For\n each simple circuit of digraph,\n Digr\ aphAllSimpleCircuits(digraph) includes precisely one such\n list\ to represent the circuit. \n\n D := Digraph(\ [[], [3], [2, 4], [5, 4], [4]]);\n\ \ngap> DigraphAllSimpleCircuits(D);\n[ [ 4 ], [ 4, 5 ], [ 2, 3 ] ]\ngap> D := \ ChainDigraph(10);;\ngap> DigraphAllSimpleCircuits(D);\n[ ]\ngap> D := Digraph\ ([[3], [1], [1]]);\n\ngap> Digraph\ AllSimpleCircuits(D);\n[ [ 1, 3 ] ]\ngap> D := Digraph([[1, 1]]);\n\ngap> DigraphAllSimpleCircuits(D);\n[ [ 1\ ] ]\ngap> D := CycleDigraph(IsMutableDigraph, 3);\n\ngap> DigraphAllSimpleCircuits(D);\n[ [ 1, 2, 3 ] ]\n]]>\n \n\n\n \n \n A list of vertices, o\ r fail.\n \n If digraph is a digraph,\ then DigraphLongestSimpleCircuit\n returns the longest simple ci\ rcuit in digraph. See section\n for the definition of simple\n circuit, and the definition\ of length for a simple circuit. \n\n This attribute computes\n Di\ graphAllSimpleCircuits(digraph) to find all the\n simple \ circuits of digraph, and returns one of maximal length. A\n simple \ circuit is represented as a list of vertices, in the same way as\n describe\ d in . \n\n If digraph ha\ s no simple circuits, then this attribute returns\n fail. If dig\ raph has multiple simple circuits of maximal\n length, then this attrib\ ute returns one of them. \n\n D := Digraph([[],\ [3], [2, 4], [5, 4], [4]]);;\ngap> DigraphLongestSimpleCircuit(D);\n[ 4, 5 ]\ \ngap> D := ChainDigraph(10);;\ngap> DigraphLongestSimpleCircuit(D);\nfail\nga\ p> D := Digraph([[3], [1], [1, 4], [1, 1]]);;\ngap> DigraphLongestSimpleCircui\ t(D);\n[ 1, 3, 4 ]\ngap> D := GeneralisedPetersenGraph(IsMutableDigraph, 4, 1)\ ;\n\ngap> DigraphLongestSimpleCircu\ it(D);\n[ 1, 2, 3, 4, 8, 7, 6, 5 ]\n]]>\n \n\n\n \n \n A list.\n \n This operation return\ s a list list such that list[i] is the\n list of vertices who\ se minimum distance from the vertex vertex in\n digraph is i - 1. Vertex vertex is\n assumed to be at distance 0 fr\ om itself.\n D := CompleteDigraph(4);;\ngap> Digra\ phLayers(D, 1);\n[ [ 1 ], [ 2, 3, 4 ] ]\n]]>\n \n\n\n \n \n A non-negative integer, or fail.\n \n If digraph is a symmetric digraph without multiple edges - \ see\n and \ - then\n this attribute returns the degeneracy of digraph. \n\n\ The degeneracy of a digraph is the least integer k such\n that e\ very induced of digraph contains a vertex whose number of\n neighbou\ rs (excluding itself) is at most k. Note that this means\n that loop\ s are ignored. \n\n If digraph is not symmetric or has multiple e\ dges then this\n attribute returns fail.\n D := DigraphSymmetricClosure(ChainDigraph(5));;\ngap> DigraphDegeneracy(D);\ \n1\ngap> D := CompleteDigraph(5);;\ngap> DigraphDegeneracy(D);\n4\ngap> D := \ Digraph([[1], [2, 4, 5], [3, 4], [2, 3, 4], [2], []]);\n\ngap> DigraphDegeneracy(D);\n1\ngap> D := GeneralisedP\ etersenGraph(IsMutableDigraph, 10, 3);\n\ngap> DigraphDegeneracy(D);\n3\n]]>\n \n\n\n \n \n A list of integers, or fail.\n \n If digraph is a digraph for which\n DigraphDegenera\ cy(digraph) is a non-negative integer\n k - see - then this attribute\n returns a degenerac\ y ordering of the vertices of the vertices of\n digraph. \n\n \ A degeneracy ordering of digraph is a list ordering of the\n \ vertices of digraph ordered such that for any\n position i of\ the list, the vertex ordering[i] has at most\n k neighbours \ in later position of the list. \n\n If DigraphDegeneracy(digra\ ph) returns fail,\n then this attribute returns fail.\n D := DigraphSymmetricClosure(ChainDigraph(5)\ );;\ngap> DigraphDegeneracyOrdering(D);\n[ 5, 4, 3, 2, 1 ]\ngap> D := Complete\ Digraph(5);;\ngap> DigraphDegeneracyOrdering(D);\n[ 5, 4, 3, 2, 1 ]\ngap> D :=\ Digraph([[1], [2, 4, 5], [3, 4], [2, 3, 4], [2], []]);\n\ngap> DigraphDegeneracyOrdering(D);\n[ 1, 6, 5, 2, 4,\ 3 ]\ngap> D := GeneralisedPetersenGraph(IsMutableDigraph, 3, 1);\n\ngap> DigraphDegeneracyOrdering(D);\n[ 6, 5, \ 4, 1, 3, 2 ]\n]]>\n \n\n\n \n \n A list or <\ K>fail.\n \n Returns a Hamiltonian path if one \ exists, fail if not. \n\n A Hamiltonian path of a digraph \ with n vertices is directed\n cycle of length n. If digrap\ h is a digraph that contains a\n Hamiltonian path, then this function r\ eturns one, described in the form\n used by . Note if digraph has\n 0 or 1 vertices, then Hamiltonia\ nPath returns [] or\n [1], respectively. \n\n The m\ ethod used in this attribute has the same worst case complexity as\n .\n\n D := Digraph([[\ ]]);\n\ngap> HamiltonianPath(D);\n[ 1 ]\ \ngap> D := Digraph([[2], [1]]);\n\ \ngap> HamiltonianPath(D);\n[ 1, 2 ]\ngap> D := Digraph([[3], [], [2]]);\n\ngap> HamiltonianPath(D);\nfail\ngap>\ D := Digraph([[2], [3], [1]]);\n\ \ngap> HamiltonianPath(D);\n[ 1, 2, 3 ]\ngap> D := GeneralisedPetersenGraph(Is\ MutableDigraph, 5, 2);\n\ngap> Ham\ iltonianPath(D);\nfail\n]]>\n \n\n\n \ \n \n A\ n integer.\n \n Returns the number of spanning tree\ s of the symmetric digraph\n digraph.\n NrSpanningTrees wi\ ll return an error if digraph is not a\n symmetric digraph. \n\ \n See and\n for more information. \n\n D := \ CompleteDigraph(5);\n\ngap> NrSpan\ ningTrees(D);\n125\ngap> D := DigraphSymmetricClosure(CycleDigraph(24));;\ngap\ > NrSpanningTrees(D);\n24\ngap> NrSpanningTrees(EmptyDigraph(0));\n0\ngap> D :\ = GeneralisedPetersenGraph(IsMutableDigraph, 9, 2);\n\ngap> NrSpanningTrees(D);\n1134225\n]]>\n \n\n\n \n \n \n <\ Returns>Two lists.\n \n If digraph is a digrap\ h and source and target are\n vertices of digraph, then\ DigraphDijkstra calculates the\n length of the shortest path from \ source to target and returns\n two lists. Each element of the firs\ t list is the distance of the\n corresponding element from source. If\ a vertex was not visited in\n the process of calculating the shortest distan\ ce to target or if\n there is no path connecting that vertex with s\ ource, then\n the corresponding distance is infinity. Each elemen\ t of the\n second list gives the previous vertex in the shortest path\n from\ source to the corresponding vertex. For\n source and for any \ vertices that remained unvisited this\n will be -1. \n\n If th\ e optional second argument target is not present, then\n DigraphD\ ijkstra returns the shortest path from source to\n every vertex \ that is reachable from source.\n\n mat := [[0\ , 1, 1], [0, 0, 1], [0, 0, 0]];\n[ [ 0, 1, 1 ], [ 0, 0, 1 ], [ 0, 0, 0 ] ]\nga\ p> D := DigraphByAdjacencyMatrix(mat);\n\ngap> DigraphDijkstra(D, 2, 3);\n[ [ infinity, 0, 1 ], [ -1, -1, 2 ] ]\ \ngap> DigraphDijkstra(D, 1, 3);\n[ [ 0, 1, 1 ], [ -1, 1, 1 ] ]\ngap> DigraphD\ ijkstra(D, 1, 2);\n[ [ 0, 1, 1 ], [ -1, 1, 1 ] ]\n]]>\n\n\n\n \n\n Cayley graphs of group\ s\n \n \n \n A group or semigroup.\n \n If digraph is\ an immutable Cayley graph of a group G and\n digraph belongs\ to the category , then\n GroupOfCayleyDi\ graph returns G.\n \n\n If digraph is a Cayley gra\ ph of a semigroup S and\n digraph belongs to the category , then\n SemigroupOfCayleyDigraph return\ s S.\n \n\n See also .\n G := DihedralGroup(IsPermGroup, 8);\nGroup([ \ (1,2,3,4), (2,4) ])\ngap> digraph := CayleyDigraph(G);\n\ngap> GroupOfCayleyDigraph(digraph) = G;\ntrue\n]]>\n \n\n\n \n \n A list of generators.\ \n \n If digraph is an immutable Cayley grap\ h of a group or semigroup with\n respect to a set of generators gens\ and digraph belongs to\n the category , then\n GeneratorsOfCayleyDigraph return the list of generators <\ C>gens\n over which digraph is defined.\n \n\n See als\ o \n or .\n G := DihedralGroup(IsPermGroup, 8);\ \nGroup([ (1,2,3,4), (2,4) ])\ngap> digraph := CayleyDigraph(G);\n\ngap> GeneratorsOfCayleyDigraph(digraph) = G\ eneratorsOfGroup(G);\ntrue\ngap> digraph := CayleyDigraph(G, [()]);\n\ngap> GeneratorsOfCayleyDigraph(digraph) =\ [()];\ntrue]]>\n \n\n\n \n\n\ Associated semigroups\n \n <\ Oper Name=\"AsSemigroup\" Arg=\"filt, digraph\"\n Label=\"for a filter an\ d a digraph\"/>\n \n A semilattice of partial perms.\n \n The o\ peration AsSemigroup requires that filt be equal to\n .\n If digraph i\ s a\n or \n then AsSemigroup returns a semigroup of partial perms \ which is\n isomorphic to the semigroup whose elements are the vertices of\ \n digraph with the binary operation\n .\n If digraph\n satisfies but not\n then\n AsSemigroup returns a semigroup of partial per\ ms which is\n isomorphic to the semigroup whose elements are the vertices\ of\n digraph with the binary operation\n .\n \n\n The operation AsMonoid\ behaves similarly to AsSemigroup\n except that filt ma\ y also be equal to\n \ ,\n digraph must satisfy , and the\ \n output satisfies . \n\n \ The output of both of these operations is guaranteed to be of minimal\n \ degree (see ).\ \n Furthermore the \ of\n the output is guaranteed to be the unique generating set of minimal\ size.\n di := Digraph([[1], [1, 2], [1, 3], [1,\ 4], [1, 2, 3, 5]]);\n\ngap> S :=\ AsSemigroup(IsPartialPermSemigroup, di);\n\ngap> ForAll(Elements(S), IsIdempotent);\ntrue\ngap> IsInver\ seSemigroup(S);\ntrue\ngap> Size(S);\n5\ngap> di := Digraph([[1], [1, 2], [1, \ 2, 3]]);\n\ngap> M := AsMonoid(IsP\ artialPermMonoid, di);\n\ngap\ > Size(M);\n3]]>\n \n \n\n \n \n A Clif\ ford semigroup of partial perms. \n \n The oper\ ation AsSemigroup requires that filt be equal to\n .\n If Y is a or\n ,\n gps is a list of groups corresponding to each vertex, \ and\n homs is a list containing for each edge (i, j) in\n \ the transitive reduction of digraph a triple [i, j, hom]\n \ where hom is a group homomorphism from gps[i] to\n g\ ps[j], and the diagram of homomorphisms commutes, then\n AsSemigro\ up returns a semigroup of partial perms which is\n isomorphic to the \ strong semilattice of groups S[Y; gps; homs].\n G1 := AlternatingGroup(4);;\ngap> G2 := SymmetricGroup(2);;\ngap> G3 :=\ SymmetricGroup(3);;\ngap> gr := Digraph([[1, 3], [2, 3], [3]]);;\ngap> sgn :=\ function(x)\n> if SignPerm(x) = 1 then\n> return ();\n> fi;\n> return (1, 2);\ \n> end;;\ngap> hom13 := GroupHomomorphismByFunction(G1, G3, sgn);;\ngap> hom2\ 3 := GroupHomomorphismByFunction(G2, G3, sgn);;\ngap> T := AsSemigroup(IsParti\ alPermSemigroup,\n> gr,\n> [G1, G2, G3], [[1, 3, hom13], [2, 3, hom23]]);;\nga\ p> Size(T);\n20\ngap> D := GreensDClasses(T);;\ngap> List(D, x -> Size(x));\n[\ 6, 12, 2 ]\n]]>\n \n \n\n \n\n Planarity\n \n \n A list or fail\ .\n \n KuratowskiPlanarSubdigraph return\ s the immutable list of\n lists of out-neighbours of a (not necessarily ind\ uced) subdigraph of the\n digraph digraph that witnesses the fact th\ at digraph is not\n planar, or fail if digraph is plan\ ar. In other words,\n KuratowskiPlanarSubdigraph returns the out-ne\ ighbours of a\n subdigraph of digraph that is homeomorphic to the co\ mplete graph\n with 5 vertices, or to the complete bipartite graph w\ ith vertex sets\n of sizes 3 and 3. \n \n The direc\ tions and multiplicities of any edges in digraph are\n ignored when \ considering whether or not digraph is planar. \n\n See also \n and .\n \n \n This method uses the reference implementation in\n \ &edge-addition-planarity-suite; by John Boyer of the algorithms described\n \ in .\n\n D := Digraph([[3, 5, 10\ ], [8, 9, 10], [1, 4], [3, 6], \n> [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11]\ , [1, 2], [5, 9]]);\n\ngap> Kura\ towskiPlanarSubdigraph(D);\nfail\ngap> D := Digraph([[2, 4, 7, 9, 10], [1, 3, \ 4, 6, 9, 10], [6, 10], \n> [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, \ 7, 9, 10], \n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5\ ]]);\n\ngap> IsPlanarDigraph(D);\ \nfalse\ngap> KuratowskiPlanarSubdigraph(D);\n[ [ 2, 9, 7 ], [ 3 ], [ 6 ], [ 5\ , 9 ], [ 6 ], [ ], [ 4 ], \n [ 7, 9, 3 ], [ ], [ ] ]\ngap> D := Digraph(Is\ MutableDigraph, [[3, 5, 10], [8, 9, 10], [1, 4],\n> [3, 6], [1, 7, 11], [4, 7]\ , [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> KuratowskiPlanarSubdigraph(D);\nfail\ngap> D := Digraph(IsM\ utableDigraph, [[2, 4, 7, 9, 10],\n> [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9\ ],\n> [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10],\n> [3, 4, 5, 6, 9, 10], \ [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]);\n\ngap> IsPlanarDigraph(D);\nfalse\ngap> KuratowskiPlanarSubdigra\ ph(D);\n[ [ 2, 9, 7 ], [ 3 ], [ 6 ], [ 5, 9 ], [ 6 ], [ ], [ 4 ], \n [ 7, 9,\ 3 ], [ ], [ ] ]\n]]>\n \n\n\n \n \n\ A list or fail.\n \n Kuratowsk\ iOuterPlanarSubdigraph returns the immutable list of\n immutable lists \ of out-neighbours of a (not necessarily induced)\n subdigraph of the digrap\ h digraph that witnesses the fact\n that digraph is not outer\ planar, or fail if\n digraph is outer planar. In other word\ s,\n KuratowskiOuterPlanarSubdigraph returns the out-neighbours of a\ \n subdigraph of digraph that is homeomorphic to the complete graph\ \n with 4 vertices, or to the complete bipartite graph with vertex s\ ets\n of sizes 2 and 3. \n \n The directions and mu\ ltiplicities of any edges in digraph are\n ignored when considering \ whether or not digraph is outer planar. \n \n\n See also \n \ ,\n , and \n .\n \n\ \n This method uses the reference implementation in\n &edge-addition-pla\ narity-suite; by John Boyer of the algorithms described\n in .\n\n D := Digraph([[3, 5, 10], [8, 9, 10], [1, \ 4], [3, 6], \n> [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\ \n\ngap> KuratowskiOuterPlanarSu\ bdigraph(D);\n[ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ]\ , \n [ ], [ 11 ], [ ], [ ] ]\ngap> D := Digraph([[2, 4, 7, 9, 10], [1, 3, \ 4, 6, 9, 10], [6, 10], \n> [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, \ 7, 9, 10], \n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5\ ]]);\n\ngap> IsOuterPlanarDigrap\ h(D);\nfalse\ngap> KuratowskiOuterPlanarSubdigraph(D);\n[ [ ], [ ], [ ], [ \ 8, 9 ], [ ], [ ], [ 9, 4 ], [ 7, 9 ], [ ], \n [ ] ]\ngap> D := Digraph(Is\ MutableDigraph, [[3, 5, 10], [8, 9, 10], [1, 4],\n> [3, 6], [1, 7, 11], [4, 7]\ , [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> KuratowskiOuterPlanarSubdigraph(D);\n[ [ 3, 5, 10 ], [ 9, 8\ , 10 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\nga\ p> D := Digraph(IsMutableDigraph, [[2, 4, 7, 9, 10],\n> [1, 3, 4, 6, 9, 10], [\ 6, 10], [2, 5, 8, 9],\n> [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10],\n> [3\ , 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]);\n\ngap> IsOuterPlanarDigraph(D);\nfalse\ngap> \ KuratowskiOuterPlanarSubdigraph(D);\n[ [ ], [ ], [ ], [ 8, 9 ], [ ], [ ],\ [ 9, 4 ], [ 7, 9 ], [ ], \n [ ] ]]]>\n \n\n\n \n \ \n A list or fail.\n \n If digr\ aph is a planar digraph, then \n PlanarEmbedding returns the imm\ utable list of lists of\n out-neighbours of a subdigraph of digraph \ such that each vertex's\n neighbours are given in clockwise order. If di\ graph is not planar,\n then fail is returned. \n \n Th\ e directions and multiplicities of any edges in digraph are\n ignore\ d by PlanarEmbedding.\n \n\n See also \n .\n \n\n This method uses the reference implementation\ in\n &edge-addition-planarity-suite; by John Boyer of the algorithms descr\ ibed\n in .\n\n D := Digraph([[\ 3, 5, 10], [8, 9, 10], [1, 4], [3, 6], \n> [1, 7, 11], [4, 7], [6, 8], [2, 7],\ [2, 11], [1, 2], [5, 9]]);\n\ng\ ap> PlanarEmbedding(D);\n[ [ 3, 10, 5 ], [ 10, 8, 9 ], [ 4 ], [ 6 ], [ 11, 7 ]\ , [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> D := Digraph([[2, 4, 7, 9\ , 10], [1, 3, 4, 6, 9, 10], [6, 10], \n> [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 1\ 0], [3, 4, 5, 7, 9, 10], \n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6\ , 7, 8], [3, 5]]);\n\ngap> Plana\ rEmbedding(D);\nfail\ngap> D := Digraph(IsMutableDigraph, [[3, 5, 10], [8, 9, \ 10], [1, 4],\n> [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [\ 5, 9]]);\n\ngap> PlanarEmbedding(D\ );\n[ [ 3, 10, 5 ], [ 10, 8, 9 ], [ 4 ], [ 6 ], [ 11, 7 ], [ 7 ], [ 8 ], \n [\ ], [ 11 ], [ ], [ ] ]\ngap> D := Digraph(IsMutableDigraph, [[2, 4, 7, 9, 1\ 0],\n> [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9],\n> [1, 2, 3, 4, 6, 7, 9, 10\ ], [3, 4, 5, 7, 9, 10],\n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, \ 7, 8], [3, 5]]);\n\ngap> PlanarEmb\ edding(D);\nfail\n]]>\n \n\n\n \n \n A \ list or fail.\n \n If digraph is an o\ uter planar digraph, then\n OuterPlanarEmbedding returns the immutab\ le list of lists\n of out-neighbours of a subdigraph of digraph such\ that each\n vertex's neighbours are given in clockwise order. If digrap\ h is not\n outer planar, then fail is returned. \n \n \ The directions and multiplicities of any edges in digraph are\n igno\ red by OuterPlanarEmbedding.\n \n\n See also .\n \n\n This method uses the reference implemen\ tation in\n &edge-addition-planarity-suite; by John Boyer of the algorithms\ described\n in .\n\n D := Digr\ aph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], \n> [1, 7, 11], [4, 7], [6, 8], [\ 2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> OuterPlanarEmbedding(D);\nfail\ngap> D := Digraph([[2, 4, 7, 9, 10],\ [1, 3, 4, 6, 9, 10], [6, 10], \n> [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3\ , 4, 5, 7, 9, 10], \n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8\ ], [3, 5]]);\n\ngap> OuterPlanar\ Embedding(D);\nfail\ngap> OuterPlanarEmbedding(CompleteBipartiteDigraph(2, 2))\ ;\n[ [ 3, 4 ], [ 4, 3 ], [ ], [ ] ]\ngap> D := Digraph(IsMutableDigraph, [[3\ , 5, 10], [8, 9, 10], [1, 4],\n> [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [\ 2, 11], [1, 2], [5, 9]]);\n\ngap> \ OuterPlanarEmbedding(D);\nfail\ngap> D := Digraph(IsMutableDigraph, [[2, 4, 7,\ 9, 10],\n> [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9],\n> [1, 2, 3, 4, 6, 7, \ 9, 10], [3, 4, 5, 7, 9, 10],\n> [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5\ , 6, 7, 8], [3, 5]]);\n\ngap> Oute\ rPlanarEmbedding(D);\nfail\ngap> OuterPlanarEmbedding(CompleteBipartiteDigraph\ (2, 2));\n[ [ 3, 4 ], [ 4, 3 ], [ ], [ ] ]\n]]>\n \ \n\n\n \n \n \n \n A list or fail.\n \n These attributes r\ eturn the immutable list of lists of\n out-neighbours of a subdigraph of th\ e digraph digraph which is\n homeomorphic to one of the following:\n\ the complete bipartite graph with vertex sets of sizes 2 and\n <\ C>3; the complete bipartite graph with vertex sets of sizes 3\n \ and 3; or the complete graph with 4 vertices. If\n digraph\ has no such subdigraphs, then fail is returned. \n \n\n \ See also and for more details. \n\n This method uses the reference impleme\ ntation in\n &edge-addition-planarity-suite; by John Boyer of the algorithm\ s described\n in .\n\n D := Dig\ raph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 7, 11], \n> [4, 7], [6, 8], \ [2, 7], [2, 11], [1, 2], [5, 9]]);\n\ngap> SubdigraphHomeomorphicToK4(D);\n[ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ]\ , [ 6 ], [ 7, 11 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> Subdigr\ aphHomeomorphicToK23(D);\n[ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [ 6 ], [ 11 ], \ [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> D := Digraph([[3, 5, 10], [\ 8, 9, 10], [1, 4], [3, 6], [1, 11], \n> [4, 7], [6, 8], [2, 7], [2, 11], [1, \ 2], [5, 9]]);\n\ngap> Subdigraph\ HomeomorphicToK4(D);\nfail\ngap> SubdigraphHomeomorphicToK23(D);\n[ [ 3, 10, 5\ ], [ 10, 8, 9 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], \ [ ] ]\ngap> SubdigraphHomeomorphicToK33(D);\nfail\ngap> SubdigraphHomeomorphi\ cToK23(NullDigraph(0));\nfail\ngap> SubdigraphHomeomorphicToK33(CompleteDigrap\ h(5));\nfail\ngap> SubdigraphHomeomorphicToK33(CompleteBipartiteDigraph(3, 3))\ ;\n[ [ 4, 6, 5 ], [ 4, 5, 6 ], [ 6, 5, 4 ], [ ], [ ], [ ] ]\ngap> Subdigrap\ hHomeomorphicToK4(CompleteDigraph(3));\nfail\ngap> D := Digraph(IsMutableDigra\ ph, [[3, 5, 10], [8, 9, 10], [1, 4],\n> [3, 6], [1, 7, 11], [4, 7], [6, 8], [2\ , 7], [2, 11], [1, 2], [5, 9]]);\n\ \ngap> SubdigraphHomeomorphicToK4(D);\n[ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [ \ 6 ], [ 7, 11 ], [ 7 ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> SubdigraphH\ omeomorphicToK23(D);\n[ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [ 6 ], [ 11 ], [ 7 \ ], [ 8 ], \n [ ], [ 11 ], [ ], [ ] ]\ngap> D := Digraph(IsMutableDigraph, \ [[3, 5, 10], [8, 9, 10], [1, 4],\n> [3, 6], [1, 11], [4, 7], [6, 8], [2, 7], [\ 2, 11], [1, 2], [5, 9]]);\n\ngap> \ SubdigraphHomeomorphicToK4(D);\nfail\ngap> SubdigraphHomeomorphicToK23(D);\n[ \ [ 3, 10, 5 ], [ 10, 8, 9 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ], \n [ ], [ 11\ ], [ ], [ ] ]\ngap> SubdigraphHomeomorphicToK33(D);\nfail\ngap> SubdigraphH\ omeomorphicToK23(NullDigraph(0));\nfail\ngap> SubdigraphHomeomorphicToK33(Comp\ leteDigraph(5));\nfail\ngap> SubdigraphHomeomorphicToK33(CompleteBipartiteDigr\ aph(3, 3));\n[ [ 4, 6, 5 ], [ 4, 5, 6 ], [ 6, 5, 4 ], [ ], [ ], [ ] ]\ngap>\ SubdigraphHomeomorphicToK4(CompleteDigraph(3));\nfail\n]]>\n \n\n\n \n\n\n \n Properties of\ digraphs\n\n Edge properties\n \n \n tr\ ue or false.\n \n Returns true if\ the digraph digraph has loops, and\n false if it does not. A\ loop is an edge with equal source and range.\n \n \n If the ar\ gument digraph is mutable, then the return value of\n this property \ is recomputed every time it is called. \n\n D := Digra\ ph([[1, 2], [2]]);\n\ngap> Digraph\ Edges(D);\n[ [ 1, 1 ], [ 1, 2 ], [ 2, 2 ] ]\ngap> DigraphHasLoops(D);\ntrue\ng\ ap> D := Digraph([[2, 3], [1], [2]]);\n\ngap> DigraphEdges(D);\n[ [ 1, 2 ], [ 1, 3 ], [ 2, 1 ], [ 3, 2 ] ]\ngap>\ DigraphHasLoops(D);\nfalse\ngap> D := CompleteDigraph(IsMutableDigraph, 4);\n\ \ngap> DigraphHasLoops(D);\nfalse]]\ >\n \n\n\n \n \n \n true or false.\ \n \n This property is true if the digraph digraph<\ /A>\n is antisymmetric, and false if it is not.\n \n\n A d\ igraph is antisymmetric if whenever there is an edge with source\n <\ C>u and range v, and an edge with source v and range\n u, then the vertices u and v are equal.\n \n \n\ If the argument digraph is mutable, then the return value of\n t\ his property is recomputed every time it is called. \n\n gr1 := Digraph([[2], [1, 3], [2, 3]]);\n\ngap> IsAntisymmetricDigraph(gr1);\nfalse\ngap> DigraphEdges(gr1\ ){[1, 2]};\n[ [ 1, 2 ], [ 2, 1 ] ]\ngap> gr2 := Digraph([[1, 2], [3, 3], [1]])\ ;\n\ngap> IsAntisymmetricDigr\ aph(gr2);\ntrue\ngap> DigraphEdges(gr2);\n[ [ 1, 1 ], [ 1, 2 ], [ 2, 3 ], [ 2,\ 3 ], [ 3, 1 ] ]\n]]>\n \n\n\n \n \n t\ rue or false.\n \n This property is tru\ e if the digraph digraph is bipartite, and\n false if it is\ not. A digraph is bipartite if and only if the\n vertices of digraph\ can be partitioned into two non-empty sets such\n that the source and range \ of any edge of digraph lie in distinct sets.\n Equivalently, a digraph\ is bipartite if and only if it is 2-colorable; see\n . \n\n See also .\n \n \n If the argument digraph is mu\ table, then the return value of\n this property is recomputed every time it\ is called. \n D := ChainDigraph(4);\n\ngap> IsBipartiteDigraph(D);\ntrue\ngap> D := Cy\ cleDigraph(3);\n\ngap> IsBipartiteDig\ raph(D);\nfalse\ngap> D := CompleteBipartiteDigraph(IsMutableDigraph, 5, 4);\n\ \ngap> IsBipartiteDigraph(D);\ntrue\ ]]>\n \n\n\n \n \n true or\ false.\n \n Returns true if the digr\ aph digraph is a complete bipartite\n digraph, and false if i\ t is not. \n\n A digraph is a complete bipartite digraph if it i\ s bipartite, see\n , and there exists a u\ nique edge with\n source i and range j if and only if i and j lie\n in different bicomponents of digraph, see . \n\n Equivalently, a bipartite \ digraph with bicomponents of size m and\n n is complete preci\ sely when it has 2mn edges, none of which\n are multiple edges. \ \n\n See also .\n \n \n\ If the argument digraph is mutable, then the return value of\n t\ his property is recomputed every time it is called. \n\n D := CycleDigraph(2);\n\ngap> \ IsCompleteBipartiteDigraph(D);\ntrue\ngap> D := CycleDigraph(4);\n\ngap> IsBipartiteDigraph(D);\ntrue\ngap> IsCompl\ eteBipartiteDigraph(D);\nfalse\ngap> D := CompleteBipartiteDigraph(IsMutableDi\ graph, 5, 4);\n\ngap> IsCompleteBip\ artiteDigraph(D);\ntrue]]>\n \n\n\n <\ ManSection>\n \n \ true or false.\n \n Returns true if the digraph digraph is complete, and\n false if it is n\ ot. \n\n A digraph is complete if it has no loops, and for all\n\ distinct vertices i and j,\n there is exactly one \ edge with source i and range j.\n\n Equivalently, a digraph w\ ith n vertices is complete precisely when\n it has n(n - 1) e\ dges, no loops, and no multiple edges.\n \n \n If the argument \ digraph is mutable, then the return value of\n this property is reco\ mputed every time it is called. \n\n D := Digraph(\ [[2, 3], [1, 3], [1, 2]]);\n\ngap>\ IsCompleteDigraph(D);\ntrue\ngap> D := Digraph([[2, 2], [1]]);\n\ngap> IsCompleteDigraph(D);\nfalse\ngap> \ D := CompleteBipartiteDigraph(IsMutableDigraph, 5, 4);\n\ngap> IsCompleteDigraph(D);\nfalse]]>\n \n\n\n \n \n true or false.\n \n This property returns true if digraph is a complete\n multipartite digraph, and false if not. \n\n \ A digraph is a complete multipartite digraph if and only if\n its \ vertices can be partitioned into at least two maximal independent sets,\n w\ here every possible edge between these independent sets occurs in the\n dig\ raph exactly once.\n \n \n If the argument digraph is mu\ table, then the return value of\n this property is recomputed every time it\ is called. \n\n D := CompleteMultipartiteDigraph(\ [2, 4, 6]);\n\ngap> IsCompleteMultipartiteDigraph(D);\ntrue\ngap> D := CompleteBipartite\ Digraph(IsMutableDigraph, 5, 4);\n\ \ngap> IsCompleteMultipartiteDigraph(D);\ntrue]]>\n \ \n\n\n \n \n \n true\ or false.\n \n Returns true if t\ he digraph digraph is empty, and\n false if it is not. A digr\ aph is empty if it has no\n edges. \n\n IsNullDigraph i\ s a synonym for IsEmptyDigraph.\n \n \n If the argument \ digraph is mutable, then the return value of\n this property is reco\ mputed every time it is called. \n\n D := Digraph(\ [[], []]);\n\ngap> IsEmptyDigraph(D);\ \ntrue\ngap> IsNullDigraph(D);\ntrue\ngap> D := Digraph([[], [1]]);\n\ngap> IsEmptyDigraph(D);\nfalse\ngap> IsNul\ lDigraph(D);\nfalse]]>\n \n\n\n \n \n <\ K>true or false.\n \n A digraph is an eq\ uivalence digraph if and only if the digraph satisifies\n all of ,\n and .\n A partial order digraph corresponds t\ o an equivalence relation.\n \n \n If the argument digraph is mutable, then the return value of\n this property is recomputed every\ time it is called. \n\n D := Digraph([[1, 3], [2], [1\ , 3]]);\n\ngap> IsEquivalenceDigra\ ph(D);\ntrue\n]]>\n \n\n\n \n \n true\ or false.\n \n This property is true\ if the digraph digraph is\n functional. \n\n A digraph i\ s functional if every vertex is the source of a\n unique edge.\n \ \n \n If the argument digraph is mutable, then the return v\ alue of\n this property is recomputed every time it is called. \n gr1 := Digraph([[3], [2], [2], [1], [6], [5]]);\n\ngap> IsFunctionalDigraph(gr1);\ntrue\ngap>\ gr2 := Digraph([[1, 2], [1]]);\n\ \ngap> IsFunctionalDigraph(gr2);\nfalse\ngap> gr3 := Digraph(3, [1, 2, 3], [2,\ 3, 1]);\n\ngap> IsFunctionalDigra\ ph(gr3);\ntrue\n]]>\n \n\n\n \n \n true or false.\n \n A multidigraph is on\ e that has at least two\n edges with equal source and range. \n\n If \ the argument digraph is mutable, then the return value of\n this pro\ perty is recomputed every time it is called. \n\n \ D := Digraph([\"a\", \"b\", \"c\"], [\"a\", \"b\", \"b\"], [\"b\", \"c\", \"a\ \"]);\n\ngap> IsMultiDigraph(D);\n\ false\ngap> D := DigraphFromDigraph6String(\"&Bug\");\n\ngap> IsDuplicateFree(DigraphEdges(D));\ntrue\ngap> IsMu\ ltiDigraph(D);\nfalse\ngap> D := Digraph([[1, 2, 3, 2], [2, 1], [3]]);\n\ngap> IsDuplicateFree(DigraphEdges\ (D));\nfalse\ngap> IsMultiDigraph(D);\ntrue\ngap> D := DigraphMutableCopy(D); \ \n\ngap> IsMultiDigraph(D);\ntr\ ue]]>\n \n\n\n \n \n true or fa\ lse.\n \n This property is true if the d\ igraph digraph is\n reflexive, and false if it is not.\n A\ digraph is reflexive if it has a loop at every vertex. \n \ \n \n If the argument digraph is mutable, then the return value\ of\n this property is recomputed every time it is called. \n <\ ![CDATA[\ngap> D := Digraph([[1, 2], [2]]);\n\ngap> IsReflexiveDigraph(D);\ntrue\ngap> D := Digraph([[3, 1], [4,\ 2], [3], [2, 1]]);\n\ngap> IsRefl\ exiveDigraph(D);\nfalse\n]]>\n \n\n\n \ \n \n true or false.\n \n This property \ is true if the digraph digraph\n is symmetric, and false if it is not. \n\n A symmetric digraph is one where for each n\ on-loop edge, having\n source u and range v, there is a corre\ sponding edge with\n source v and range u. If there are n\ edges with\n source u and range v, then there must be pr\ ecisely n\n edges with source v and range u. In other\ words, a symmetric\n digraph has a symmetric adjacency matrix .\n \n \n If the argument digraph is \ mutable, then the return value of\n this property is recomputed every time \ it is called. \n gr1 := Digraph([[2], [1, 3], [2, \ 3]]);\n\ngap> IsSymmetricDigraph(g\ r1);\ntrue\ngap> adj1 := AdjacencyMatrix(gr1);;\ngap> Display(adj1);\n[ [ 0, \ 1, 0 ],\n [ 1, 0, 1 ],\n [ 0, 1, 1 ] ]\ngap> adj1 = TransposedMat(ad\ j1);\ntrue\ngap> gr1 = DigraphReverse(gr1);\ntrue\ngap> gr2 := Digraph([[2, 3]\ , [1, 3], [2, 3]]);\n\ngap> IsSymm\ etricDigraph(gr2);\nfalse\ngap> adj2 := AdjacencyMatrix(gr2);;\ngap> Display(a\ dj2);\n[ [ 0, 1, 1 ],\n [ 1, 0, 1 ],\n [ 0, 1, 1 ] ]\ngap> adj2 = T\ ransposedMat(adj2);\nfalse\n]]>\n \n\n\n\ \n \n \ true or false.\n \n This property is \ true if the digraph digraph is a tournament,\n and false if it is not. \n\n A tournament is an orientation of a complete (und\ irected) graph.\n Specifically, a tournament is a digraph which has a uniqu\ e directed edge\n (of some orientation) between any pair of distinct vertic\ es, and no loops.\n \n \n If the argument digraph is mut\ able, then the return value of\n this property is recomputed every time it \ is called. \n D := Digraph([[2, 3, 4], [3, 4], [4]\ , []]);\n\ngap> IsTournament(D);\n\ true\ngap> D := Digraph([[2], [1], [3]]);\n\ngap> IsTournament(D);\nfalse\ngap> D := CycleDigraph(IsMutableDigra\ ph, 3);\n\ngap> IsTournament(D);\ntr\ ue\ngap> DigraphRemoveEdge(D, 1, 2);\n\ngap> IsTournament(D);\nfalse\n]]>\n \n\n\n \n \ \n true or false.\n \n This\ property is true if the digraph digraph\n is transitive, and\ false if it is not.\n\n A digraph is transitive if whenever \ [ i, j ] and\n [ j, k ] are edges of the digraph, then [ i\ , k ] is also an\n edge of the digraph. \n\n Let n be the\ number of vertices of an arbitrary digraph, and let\n m be the \ number of edges.\n For general digraphs, the methods used for this property\ use a version\n of the Floyd-Warshall algorithm, and have complexity O(\ n^3).\n\n However for digraphs which are topologically sortable\n [<\ Ref Attr=\"DigraphTopologicalSort\"/>], then methods with\n complexity O\ (m + n + m \\cdot n) will be used when appropriate.\n \n \n \ If the argument digraph is mutable, then the return value of\n this\ property is recomputed every time it is called. \n \n D := Digraph([[1, 2], [3], [3]]);\n\ngap> IsTransitiveDigraph(D);\nfalse\ngap> gr2 := Digraph([[1, 2\ , 3], [3], [3]]);\n\ngap> IsTransi\ tiveDigraph(gr2);\ntrue\ngap> gr2 = DigraphTransitiveClosure(D);\ntrue\ngap> g\ r3 := Digraph([[1, 2, 2, 3], [3, 3], [3]]);\n\ngap> IsTransitiveDigraph(gr3);\ntrue\n]]>\n \n\n\n \n \n \n\ true or false.\n \n A digr\ aph is a preorder digraph if and only if the digraph satisifies both\n and .\n A\ preorder digraph (or quasiorder digraph) digraph corresponds to\n t\ he preorder relation \\leq defined by x \\leq y if and only\n \ if [x, y] is an edge of digraph.\n \n \n If the \ argument digraph is mutable, then the return value of\n this propert\ y is recomputed every time it is called. \n\n D := Dig\ raph([[1], [2, 3], [2, 3]]);\n\nga\ p> IsPreorderDigraph(D);\ntrue\ngap> D := Digraph([[1 .. 4], [1 .. 4], [1 .. 4\ ], [1 .. 4]]);\n\ngap> IsPreorder\ Digraph(D);\ntrue\ngap> D := Digraph([[2], [3], [4], [5], [1]]);\n\ngap> IsPreorderDigraph(D);\nfalse\ngap> D :=\ Digraph([[1], [1, 2], [2, 3]]);\n\ \ngap> IsQuasiorderDigraph(D);\nfalse\n]]>\n \n\n\n \n \n true or false.\n \n \ A digraph is a partial order digraph if and only if the digraph satisifies\ \n all of ,\n and .\n A partial order <\ A>digraph corresponds\n to the partial order relation \\leq defi\ ned by x \\leq y if and\n only if [x, y] is an edge of dig\ raph.\n \n \n If the argument digraph is mutable, th\ en the return value of\n this property is recomputed every time it is calle\ d. \n\n D := Digraph([[1, 3], [2, 3], [3]]);\n\ngap> IsPartialOrderDigraph(D);\ntrue\nga\ p> D := CycleDigraph(5);\n\ngap> IsPa\ rtialOrderDigraph(D);\nfalse\ngap> D := Digraph([[1, 1], [1, 1, 2], [3], [3, 3\ , 4, 4]]);\n\ngap> IsPartial\ OrderDigraph(D);\ntrue\n]]>\n \n\n\n \ \n \n <\ Prop Name=\"IsJoinSemilatticeDigraph\" Arg=\"digraph\"/>\n \n true or false.\n \n IsMeetSemilatticeDigraph returns true\ if the digraph\n digraph is a meet semilattice; IsJoinSemilattic\ eDigraph\n returns true if the digraph digraph is a join \ semilattice;\n and IsLatticeDigraph returns true if the digr\ aph\n digraph is both a meet and a join semilattice.\n \n\n \ For a partial order digraph the\n c\ orresponding partial order is the relation \\leq, defined by\n x \ \\leq y if and only if [x, y] is an edge.\n A digraph is a me\ et semilattice if it is a partial order and every\n pair of vertices ha\ s a greatest lower bound (meet) with respect to the\n aforementioned relati\ on. A join semilattice is a partial order where\n every pair of vert\ ices has a least upper bound (join) with respect to\n the relation.\n \n \n If the argument digraph is mutable, then the return val\ ue of\n this property is recomputed every time it is called. \n\n D := Digraph([[1, 3], [2, 3], [3]]);\n\ngap> IsMeetSemilatticeDigraph(D);\nfalse\ngap> IsJoin\ SemilatticeDigraph(D);\ntrue\ngap> IsLatticeDigraph(D);\nfalse\ngap> D := Digr\ aph([[1], [2], [1 .. 3]]);\n\ngap>\ IsJoinSemilatticeDigraph(D);\nfalse\ngap> IsMeetSemilatticeDigraph(D);\ntrue\ \ngap> IsLatticeDigraph(D);\nfalse\ngap> D := Digraph([[1 .. 4], [2, 4], [3, 4\ ], [4]]);\n\ngap> IsMeetSemilattic\ eDigraph(D);\ntrue\ngap> IsJoinSemilatticeDigraph(D);\ntrue\ngap> IsLatticeDig\ raph(D);\ntrue\ngap> D := Digraph([[1, 1, 1], [1, 1, 2, 2],\n> \ [1, 3, 3], [1, 2, 3, 3, 4]]);\n\ngap> IsMeetSemilatticeDigraph(D);\ntrue\ngap> IsJoinSemilatticeDigraph\ (D);\ntrue\ngap> IsLatticeDigraph(D);\ntrue\n]]>\n \n\ \n\n \n\n Regularity\n \ \n \n true or false.\n \n This property \ is true if there is an integer n such that\n for every vertex\ v of digraph digraph there are exactly\n n edges term\ inating in v.\n\n See also and\n\ .\n \n \n If the argument <\ A>digraph is mutable, then the return value of\n this property is recom\ puted every time it is called. \n IsInRegularDigra\ ph(CompleteDigraph(4));\ntrue\ngap> IsInRegularDigraph(ChainDigraph(4));\nfals\ e\n]]>\n \n\n\n \n \n true or \ false.\n \n This property is true if the\ re is an integer n such that\n for every vertex v of digraph \ digraph there are exactly\n n edges starting at v.\n \ \n\n See also and\n .\n \n \n If the argument digraph \ is mutable, then the return value of\n this property is recomputed every ti\ me it is called. \n IsOutRegularDigraph(CompleteDi\ graph(4));\ntrue\ngap> IsOutRegularDigraph(ChainDigraph(4));\nfalse\n]]>\n \n\n\n \n \n true or false.\n \n This property is true if there is an intege\ r n such that\n for every vertex v of digraph digraph \ there are exactly\n n edges starting and terminating at v. In\ other words,\n the property is true if digraph is both in-re\ gular and\n and out-regular.\n\n See also and\n .\n \n \n If t\ he argument digraph is mutable, then the return value of\n this prop\ erty is recomputed every time it is called. \n IsR\ egularDigraph(CompleteDigraph(4));\ntrue\ngap> IsRegularDigraph(ChainDigraph(4\ ));\nfalse\n]]>\n \n\n\n \ \n \n t\ rue or false.\n \n If digraph is \ a connected symmetric graph, this property returns\n true if for any\ two vertices u and v of digraph\n and any two integer\ s i and j between 0 and the\n diameter of digraph, the number of vertices at distance i\n from u and distanc\ e j from v depends only on\n i, j, and the dist\ ance between vertices u and\n v. \n\n Alternatively, a \ distance regular graph is a graph for which there exist\n integers b_i, c_i, and i such that for any two\n vertices u, \ v in digraph which are distance i\n apart, there are exac\ tly b_i neighbors of v which are at\n distance i - 1 a\ way from u, and c_i neighbors of\n v which are at dist\ ance i + 1 away from u. This\n definition is used to check wh\ ether digraph is distance regular. \n\n In the case where digr\ aph is not symmetric or not connected, the\n property is false.\ \n \n \n If the argument digraph is mutable, then the re\ turn value of\n this property is recomputed every time it is called. \n\n \ D := DigraphSymmetricClosure(ChainDigraph(5));;\nga\ p> IsDistanceRegularDigraph(D);\nfalse\ngap> D := Digraph([[2, 3, 4], [1, 3, 4\ ], [1, 2, 4], [1, 2, 3]]);\n\ngap\ > IsDistanceRegularDigraph(D);\ntrue\n]]>\n \n\n\n \n\n Connectivity and cycles\n \n \n true or false.\n \n This prope\ rty is true if the digraph digraph is acyclic, and\n false\ if it is not. A digraph is acyclic if every directed\n cycle on\ the digraph is trivial. See section for the definition of a directed cycle, and of a trivial\n d\ irected cycle.\n\n The method used in this operation has complexity \ O(m+n) where\n m is the number of edges (counting multiple edges\ as one) and\n n is the number of vertices in the digraph. \n\n \ If the argument digraph is mutable, then the return value of\n th\ is property is recomputed every time it is called. \n\n Petersen := Graph(SymmetricGroup(5), [[1, 2]], OnSets,\n> function(x, y\ )\n> return IsEmpty(Intersection(x, y));\n> end);;\ngap> D := Digraph(Peters\ en);\n\ngap> IsAcyclicDigraph(D)\ ;\nfalse\ngap> D := DigraphFromDiSparse6String(\n> \".b_OGCIDBaPGkULEbQHCeRIdr\ HcuZMfRyDAbPhTi|zF\");\n\ngap> I\ sAcyclicDigraph(D);\ntrue\ngap> IsAcyclicDigraph(ChainDigraph(10));\ntrue\ngap\ > D := CompleteDigraph(IsMutableDigraph, 4);\n\ngap> IsAcyclicDigraph(D);\nfalse\ngap> IsAcyclicDigraph(CycleDigr\ aph(10));\nfalse]]>\n \n\n\n \n \n true or false.\n \n IsChainDigraph retur\ ns true if the digraph digraph is\n isomorphic to the chain d\ igraph with the same number of vertices as\n digraph, and false if it is not; see . \n\n A digraph\ is a chain if and only if it is a directed tree, in which\n every v\ ertex has out degree at most one; see \n and \ .\n \n \n If the argument digraph<\ /A> is mutable, then the return value of\n this property is recomputed ever\ y time it is called. \n\n D := Digraph([[1, 3], [2, 3]\ , [3]]);\n\ngap> IsChainDigraph(D)\ ;\nfalse\ngap> D := ChainDigraph(5);\n\ngap> IsChainDigraph(D);\ntrue\ngap> D := DigraphReverse(D);\n\ngap> IsChainDigraph(D);\ntrue\ngap> D := Chain\ Digraph(IsMutableDigraph, 5);\n\ngap\ > IsChainDigraph(D);\ntrue\ngap> DigraphReverse(D);\n\ngap> IsChainDigraph(D);\ntrue]]>\n \n\n\n \n \n true or false.\n \n This property is true if the digraph digraph\n is we\ akly connected and false if it is not. A digraph\n digraph i\ s weakly connected if it is possible to travel\n from any vertex to \ any other vertex by traversing edges in either\n direction (possibly agains\ t the orientation of some of them). \n\n The method used in this functi\ on has complexity O(m) if the\n digraph's attribute is set, otherwise it has\n complexity O(m+n) (where\n\ m is the number of edges and\n n is the number of vertice\ s of the digraph).\n \n \n If the argument digraph is mu\ table, then the return value of\n this property is recomputed every time it\ is called. \n\n D := Digraph([[2], [3], []]);;\ng\ ap> IsConnectedDigraph(D);\ntrue\ngap> D := Digraph([[1, 3], [4], [3], []]);;\ \ngap> IsConnectedDigraph(D);\nfalse\ngap> D := Digraph(IsMutableDigraph, [[2]\ , [3], []]);;\ngap> IsConnectedDigraph(D);\ntrue\ngap> D := Digraph(IsMutableD\ igraph, [[1, 3], [4], [3], []]);;\ngap> IsConnectedDigraph(D);\nfalse]]>\n \n\n\n \n \n true or false.<\ /Returns>\n \n A connected digraph is biconnected if i\ t is still connected (in the\n sense of )\ when any vertex is removed. \n IsBiconnectedDigraph returns true\ if the digraph\n digraph is biconnected, and false if it\ is not. In\n particular, IsBiconnectedDigraph returns false \ if\n digraph is not connected. \n\n Multiple edges and loops \ are ignored by this method. \n\n The method used in this operation has \ complexity O(m+n) where\n m is the number of edges (counting \ multiple edges as one, and not\n counting loops) and n is the number\ of vertices in the digraph.\n \n\n See also .\n \n \n If the argument digraph is mutable,\ then the return value of\n this property is recomputed every time it is ca\ lled. \n IsBiconnectedDigraph(Digraph([[1, 3], [2, 3],\ [3]]));\nfalse\ngap> IsBiconnectedDigraph(CycleDigraph(5));\ntrue\ngap> D := \ Digraph([[1, 1], [1, 1, 2], [3], [3, 3, 4, 4]]);;\ngap> IsBiconnectedDigraph(D\ );\nfalse\ngap> D := CompleteBipartiteDigraph(IsMutableDigraph, 5, 4);\n\ngap> IsBiconnectedDigraph(D);\ntrue]]><\ /Example>\n \n\n\n \n \n true or false.\n \n This property is true if th\ e digraph digraph is strongly\n connected and false if it is \ not. \n\n A digraph digraph is strongly connected if ther\ e is a directed\n path from every vertex to every other vertex. See sectio\ n for the definition o\ f a directed\n path. \n\n The method used in this operation is ba\ sed on Gabow's Algorithm and has complexity O(\ m+n), where m is\n the number of edges (counting multiple edges \ as one) and n is the\n number of vertices in the digraph.\n \ \n \n If the argument digraph is mutable, then the return value\ of\n this property is recomputed every time it is called. \n\n D := CycleDigraph(250000);\n\ngap> IsStronglyConnectedDigraph(D);\ntrue\ngap> D := DigraphRem\ oveEdges(D, [[250000, 1]]);\n\ngap> IsStronglyConnectedDigraph(D);\nfalse\ngap> D := CycleDigraph(IsMu\ tableDigraph, 250000);\n\n\ gap> IsStronglyConnectedDigraph(D);\ntrue\ngap> DigraphRemoveEdge(D, [250000, \ 1]);\n\ngap> IsStronglyCon\ nectedDigraph(D);\nfalse\n]]>\n \n\n\n \ \n \n true or false.\n \n This property\ is true if the digraph digraph\n is aperiodic, i.e. if its <\ Ref Attr = \"DigraphPeriod\"/> is equal to 1.\n Otherwise, the property is \ false.\n \n \n If the argument digraph is mutable\ , then the return value of\n this property is recomputed every time it is c\ alled. \n D := Digraph([[6], [1], [2], [3], [4, 4]\ , [5]]);\n\ngap> IsAperiodicD\ igraph(D);\nfalse\ngap> D := Digraph([[2], [3, 5], [4], [5], [1, 2]]);\n\ngap> IsAperiodicDigraph(D);\ntrue\ngap\ > D := Digraph(IsMutableDigraph, [[2], [3, 5], [4], [5], [1, 2]]);\n\ngap> IsAperiodicDigraph(D);\ntrue]]>\n \n\n\n \n \n true or false.\n \n Returns true if the digraph digraph is a\ directed tree, and\n false if it is not. \n\n A directed \ tree is an acyclic digraph with precisely 1 source,\n such that no two \ vertices share an out-neighbour.\n Note the empty digraph is not considered\ a directed\n tree as it has no source. \n\n See also .\n \n \n If the argument digraph is mut\ able, then the return value of\n this property is recomputed every time it \ is called. \n\n D := Digraph([[], [2]]);\n\ngap> IsDirectedTree(D);\nfalse\ngap> D :=\ Digraph([[3], [3], []]);\n\ngap> \ IsDirectedTree(D);\nfalse\ngap> D := Digraph([[2], [3], []]);\n\ngap> IsDirectedTree(D);\ntrue\ngap> D := Digrap\ h([[2, 3], [6], [4, 5], [], [], []]);\n\ngap> IsDirectedTree(D);\ntrue\n]]>\n \n\n\n \n \n \n true or false.\n \n The property IsUndirect\ edTree returns true if the digraph\n digraph is an undire\ cted tree, and the property\n IsUndirectedForest returns true\ if digraph is an\n undirected forest; otherwise, these properties r\ eturn false. \n\n An undirected tree is a symmetric digra\ ph without loops, in which for\n any pair of distinct vertices u and\ v, there is exactly one\n directed path from u to v. \ See and , and see\n section fo\ r the definition of\n directed path. This definition implies that an undire\ cted tree has\n no multiple edges. \n\n An undirected forest \ is a digraph, each of whose connected components\n is an undirected tree. I\ n other words, an undirected forest is isomorphic to\n a disjoint union of \ undirected trees. See and <\ Ref Func=\"DigraphDisjointUnion\"\n Label=\"for a list of digraphs\" />. \ In particular, every\n undirected tree is an undirected forest. \n\n \ Please note that the digraph with zero vertices is considered to be neither\n\ an undirected tree nor an undirected forest.\n \n \n If the\ argument digraph is mutable, then the return value of\n this proper\ ty is recomputed every time it is called. \n\n D :\ = Digraph([[3], [3], [1, 2]]);\n\n\ gap> IsUndirectedTree(D);\ntrue\ngap> IsSymmetricDigraph(D) and not DigraphHas\ Loops(D);\ntrue\ngap> D := Digraph([[3], [5], [1, 4], [3], [2]]);\n\ngap> IsConnectedDigraph(D);\nfalse\ngap> Is\ UndirectedTree(D);\nfalse\ngap> IsUndirectedForest(D);\ntrue\ngap> D := Digrap\ h([[1, 2], [1], [2]]);\n\ngap> IsU\ ndirectedTree(D) or IsUndirectedForest(D);\nfalse\ngap> IsSymmetricDigraph(D) \ or not DigraphHasLoops(D);\nfalse]]>\n \n\n\n \n \n \ true or false.\n \n This pr\ operty returns true if the digraph digraph is Eulerian.\n \n\n \ A connected digraph is called Eulerian if there exists a directed\n \ circuit on the digraph which includes every edge exactly once. See\n sec\ tion for the definition of\n \ a directed circuit. Note that the empty digraph with at most one vertex is\ \n considered to be Eulerian.\n \n \n If the argument dig\ raph is mutable, then the return value of\n this property is recomputed\ every time it is called. \n\n D := Digraph([[]]);\ \n\ngap> IsEulerianDigraph(D);\ntrue\ng\ ap> D := Digraph([[2], []]);\n\ngap\ > IsEulerianDigraph(D);\nfalse\ngap> D := Digraph([[3], [], [2]]);\n\ngap> IsEulerianDigraph(D);\nfalse\ngap> D \ := Digraph([[2], [3], [1]]);\n\nga\ p> IsEulerianDigraph(D);\ntrue\n]]>\n \n\ \n\n \n \ \n true or false.\n \n If <\ A>digraph is Hamiltonian, then this property returns\n true, and\ false if it is not. \n\n A digraph with n vertices is Hamiltonian if it has a\n directed cycle of length n. See Secti\ on for the definition o\ f a directed cycle.\n Note the empty digraphs on 0 and 1 vertices are consi\ dered to be\n Hamiltonian. \n\n The method used in this operation has\ the worst case complexity as\n .\n <\ P/>\n \n If the argument digraph is mutable, then the return va\ lue of\n this property is recomputed every time it is called. \n\n g := Digraph([[]]);\n\ngap> IsHamiltonianDigraph(g);\ntrue\ngap> g := Digraph([[2], [1]]);\n\ngap> IsHamiltonianDigraph(g);\ntrue\n\ gap> g := Digraph([[3], [], [2]]);\n\ngap> IsHamiltonianDigraph(g);\nfalse\ngap> g := Digraph([[2], [3], [1]]);\ \n\ngap> IsHamiltonianDigraph(g);\ \ntrue\n]]>\n \n\n\n \n \ \n true or \ false.\n \n IsCycleDigraph returns tr\ ue if the digraph digraph is\n isomorphic to the cycle digraph w\ ith the same number of vertices as\n digraph, and false if it\ is not; see . \n\n A digraph is a cycle if and only if it is strongly connected and has\n the same numbe\ r of edges as vertices. \n \n \n If the argument digraph\ is mutable, then the return value of\n this property is recomputed every t\ ime it is called. \n\n D := Digraph([[1, 3], [2, 3], [\ 3]]);\n\ngap> IsCycleDigraph(D);\n\ false\ngap> D := CycleDigraph(5);\n\n\ gap> IsCycleDigraph(D);\ntrue\ngap> D := OnDigraphs(D, (1, 2, 3));\n\ngap> D = CycleDigraph(5);\nfalse\ngap> IsC\ ycleDigraph(D);\ntrue]]>\n \n\n\n \n \n Planarity\n \n \n true or false\ .\n \n A planar digraph is a digraph tha\ t can be embedded in the plane in\n such a way that its edges do not inters\ ect. A digraph is planar if and only\n if it does not have a subdigraph tha\ t is homeomorphic to either the\n complete graph on 5 vertices or th\ e complete bipartite graph with\n vertex sets of sizes 3 and 3.\n \n \n IsPlanarDigraph returns true if the digr\ aph digraph is\n planar and false if it is not. The direction\ s and multiplicities of\n any edges in digraph are ignored by IsP\ lanarDigraph.\n \n\n See also .\n \n\n This method uses the reference implementation in\n &\ edge-addition-planarity-suite; by John Boyer of the algorithms described\n \ in .\n\n IsPlanarDigraph(Compl\ eteDigraph(4));\ntrue\ngap> IsPlanarDigraph(CompleteDigraph(5));\nfalse\ngap> \ IsPlanarDigraph(CompleteBipartiteDigraph(2, 3));\ntrue\ngap> IsPlanarDigraph(C\ ompleteBipartiteDigraph(3, 3));\nfalse\ngap> IsPlanarDigraph(CompleteDigraph(I\ sMutableDigraph, 4));\ntrue\ngap> IsPlanarDigraph(CompleteDigraph(IsMutableDig\ raph, 5));\nfalse\ngap> IsPlanarDigraph(CompleteBipartiteDigraph(IsMutableDigr\ aph, 2, 3));\ntrue\ngap> IsPlanarDigraph(CompleteBipartiteDigraph(IsMutableDig\ raph, 3, 3));\nfalse\n]]>\n \n\n\n \n \n true or false.\n \n An outer pla\ nar digraph is a digraph that can be embedded in the\n plane in such a \ way that its edges do not intersect, and all vertices\n belong to the unbou\ nded face of the embedding. A digraph is outer planar\n if and only if it \ does not have a subdigraph that is homeomorphic to either\n the complete gr\ aph on 4 vertices or the complete bipartite graph\n with vertex sets\ of sizes 2 and 3.\n \n \n IsOuterPlanarDigraph<\ /C> returns true if the digraph\n digraph is outer planar and\ false if it is not. The\n directions and multiplicities of any edge\ s in digraph are ignored by\n IsPlanarDigraph. \n\n S\ ee also .\n\n This method uses the reference\ implementation in\n &edge-addition-planarity-suite; by John Boyer of the a\ lgorithms described\n in .\n\n \ IsOuterPlanarDigraph(CompleteDigraph(4));\nfalse\ngap> IsOuterPlanarDigraph(Co\ mpleteDigraph(5));\nfalse\ngap> IsOuterPlanarDigraph(CompleteBipartiteDigraph(\ 2, 3));\nfalse\ngap> IsOuterPlanarDigraph(CompleteBipartiteDigraph(3, 3));\nfa\ lse\ngap> IsOuterPlanarDigraph(CycleDigraph(10));\ntrue\ngap> IsOuterPlanarDig\ raph(CompleteDigraph(IsMutableDigraph, 4));\nfalse\ngap> IsOuterPlanarDigraph(\ CompleteDigraph(IsMutableDigraph, 5));\nfalse\ngap> IsOuterPlanarDigraph(Compl\ eteBipartiteDigraph(IsMutableDigraph,\n> \ 2, 3));\nfalse\ngap> IsOuterPlanarDigraph(CompleteBipartiteDigraph\ (IsMutableDigraph,\n> 3, 3));\ \nfalse\ngap> IsOuterPlanarDigraph(CycleDigraph(IsMutableDigraph, 10));\ntrue\ \n\n]]>\n \n\n\n \n\n Homomorphisms and transformations\n \n <\ Prop Name=\"IsDigraphCore\" Arg=\"digraph\"/>\n true or fa\ lse.\n \n This property returns true if \ digraph is a core,\n and false if it is not.\n\n A dig\ raph D is a core if and only if it has no proper\n subdigraph\ s A such that there exists a homomorphism from D\n to A. In other words, a digraph D is a core if and only if\n every endo\ morphism on D is an automorphism on D.\n \n \n If\ the argument digraph is mutable, then the return value of\n this pr\ operty is recomputed every time it is called. \n\n \ D := CompleteDigraph(6);\n\ngap> \ IsDigraphCore(D);\ntrue\ngap> D := DigraphSymmetricClosure(CycleDigraph(6));\n\ \ngap> DigraphHomomorph\ ism(D, CompleteDigraph(2));\nTransformation( [ 1, 2, 1, 2, 1, 2 ] )\ngap> IsDi\ graphCore(D);\nfalse\n]]>\n \n\n\n \n \n true or false.\n \n If digraph i\ s a digraph without multiple edges, then\n IsEdgeTransitive returns \ true if digraph\n is edge transitive, and false otherw\ ise. A digraph is\n edge transitive if its automorphism group acts\n\ transitively on its edges (via the action\n ).\n \n \n If the argument digraph is mutab\ le, then the return value of\n this property is recomputed every time it is\ called. \n\n IsEdgeTransitive(CompleteDigraph(2))\ ;\ntrue\ngap> IsEdgeTransitive(ChainDigraph(3));\nfalse\ngap> IsEdgeTransitive\ (Digraph([[2], [3, 3, 3], []]));\nError, the argument must be a digraph wi\ th no multiple edges,\n]]>\n \n\n\n <\ ManSection>\n \n true or false.\n \n If digraph is a digraph, then IsVertexTransitive returns\n true if \ digraph is vertex transitive, and false\n otherwise. A digraph i\ s vertex transitive if its automorphism group\n acts transitively on\ its vertices.\n \n \n If the argument digraph is mutabl\ e, then the return value of\n this property is recomputed every time it is \ called. \n\n IsVertexTransitive(CompleteDigraph(2)\ );\ntrue\ngap> IsVertexTransitive(ChainDigraph(3));\nfalse\n]]>\n <\ /Description>\n\n\n \n\n \n\n \n Homomorphisms\n \ \n\n Acting on digraphs\n \n \ \n \n A digraph.\n \n If digraph is a digraph, and the second argument per\ m is a\n permutation of the vertices of digraph, then thi\ s operation\n returns a digraph constructed by relabelling the vertices of\ \n digraph according to perm. Note that for an automorphism\ \n f of a digraph, we have OnDigraphs(digraph, f) =\n <\ /C>digraph.\n \n\n If the second argument is a transformat\ ion trans of the\n vertices of digraph, then this operati\ on returns a digraph\n constructed by transforming the source and range of \ each edge according to\n trans. Thus a vertex which does not appear \ in the image of\n trans will be isolated in the returned digraph, an\ d the returned\n digraph may contain multiple edges, even if digraph\ does not.\n If trans is mathematically a permutation, then the resu\ lt coincides\n with OnDigraphs(digraph, AsPermutation(trans)).\n \n\n The of digrap\ h will not be retained\n in the returned digraph. \n\n If dig\ raph belongs to , then\n relabelling of\ the vertices is performed directly on digraph.\n If digraph \ belongs to , an immutable\n copy of di\ graph with the vertices relabelled is returned. \n\n D := Digraph([[3], [1, 3, 5], [1], [1, 2, 4], [2, 3, 5]]);\n\ngap> new := OnDigraphs(D, (1, 2));\n\ngap> OutNeighbours(new);\n[ [ 2, 3\ , 5 ], [ 3 ], [ 2 ], [ 2, 1, 4 ], [ 1, 3, 5 ] ]\ngap> D := Digraph([[2], [], [\ 2]]);\n\ngap> t := Transformation(\ [1, 2, 1]);;\ngap> new := OnDigraphs(D, t);\n\ngap> OutNeighbours(new);\n[ [ 2, 2 ], [ ], [ ] ]\ngap> For\ All(DigraphEdges(D),\n> e -> IsDigraphEdge(new, [e[1] ^ t, e[2] ^ t]));\ntrue\ \n]]>\n \n\n\n \n \n \n A digraph.\n \n If digraph \ is a digraph, and pair is a pair consisting of a\n permutation of th\ e vertices and a permutation of the edges of\n digraph, then this op\ eration returns a digraph\n constructed by relabelling the vertices and edg\ es of digraph\n according to perm[1] and perm[2], resp\ ectively. \n\n In its second form, OnMultiDigraphs returns a dig\ raph with vertices\n and edges permuted by perm1 and perm2, r\ espectively. \n\n Note that OnDigraphs(digraph,\n perm)=\ OnMultiDigraphs(digraph, [perm, ()]) where perm is\n a pe\ rmutation of the vertices of digraph. If you are only interested\n i\ n the action of a permutation on the vertices of a digraph, then you can\n \ use OnDigraphs instead of OnMultiDigraphs.\n\n If digraph<\ /A> belongs to , then\n relabelling of the \ vertices is performed directly on digraph.\n If digraph belon\ gs to , an immutable\n copy of digraph\ with the vertices relabelled is returned. \n\n D1 := Digraph([\n> [3, 6, 3], [], [3], [9, 10], [9], [], [], [10, 4, 10]\ , [], []]);\n\ngap> p := Bl\ issCanonicalLabelling(D1);\n[ (1,7)(3,6)(4,10)(5,9), () ]\ngap> D2 := OnMultiD\ igraphs(D1, p);\n\ngap> Out\ Neighbours(D2);\n[ [ ], [ ], [ ], [ ], [ ], [ 6 ], [ 6, 3, 6 ], [ 4, 10, \ 4 ], \n [ 5 ], [ 5, 4 ] ]]]>\n \n\n\n \ \n\n \n \ Isomorphisms and canonical labellings\n From version 0.\ 11.0 of &Digraphs; it is possible to use either &bliss; or\n &nauty; (via &\ NautyTracesInterface;) to calculate canonical labellings and\n automorphism\ groups of digraphs; see and \ for more details about &bliss; and &nauty;,\n respectively. \n\n \n \n \n Nothing.\n \n These\ functions can be used to specify whether &nauty; or &bliss; should be\n us\ ed by default by &Digraphs;. If &NautyTracesInterface; is not available,\n \ then these functions do nothing. Otherwise, by calling\n DigraphsUseNaut\ y subsequent computations will default to using\n &nauty; rather than &\ bliss;, where possible.\n \n\n You can call these functions at any p\ oint in a &GAP; session, as many\n times as you like, it is guaranteed that\ existing digraphs remain\n valid, and that comparison of existing digraphs\ and newly created digraphs\n via\n ,\n ,\n , and\n are also valid. \n\n It is\ also possible to compute the automorphism group of a specific digraph\n us\ ing both &nauty; and &bliss; using \n \ and , respectiv\ ely.\n \n\n\n \n \n A permut\ ation group.\n \n If digraph is a digraph, t\ hen this attribute contains the group of\n automorphisms of digraph.\ An automorphism of digraph\n is an isomorphism from digr\ aph to itself. See for more information\n about isomorphisms of digraphs. \n\n\ If digraph is not a multidigraph then the automorphism group is\n \ returned as a group of permutations on the set of vertices of\n digrap\ h. \n\n If digraph is a multidigraph then the automorphism g\ roup is returned\n as the direct product of a group of permutations on the \ set of vertices of\n digraph with a group of permutations on the set\ of edges of\n digraph. These groups can be accessed using on the\n returned group. \n\n By default, the automorphism \ group is found using &bliss; by Tommi Junttila\n and Petteri Kaski. If &Nau\ tyTracesInterface; is available, then &nauty; by\n Brendan Mckay and Adolfo\ Piperno can be used instead; see\n , \n , ,\n and .\n \n\n If the argument digraph is mutable, then the return value of\n\ this attribute is recomputed every time it is called. \n\n johnson := DigraphFromGraph6String(\"E}lw\");\n\ngap> G := AutomorphismGroup(johnson);\nGroup([ (3\ ,4), (2,3)(4,5), (1,2)(5,6) ])\ngap> cycle := CycleDigraph(9);\n\ngap> G := AutomorphismGroup(cycle);\nGroup([ (1,2\ ,3,4,5,6,7,8,9) ])\ngap> IsCyclic(G) and Size(G) = 9;\ntrue]]>\n \ \n \n\n \n \n \n \n A permutation group.\n \n \ If digraph is a digraph, then this attribute contains the group of\n\ automorphisms of digraph as calculated using &bliss; by Tommi Juntt\ ila\n and Petteri Kaski. \n\n The attribute and\n operation returns\n t\ he value of either BlissAutomorphismGroup or . These groups are, of course, equal but\n their generat\ ing sets may differ. \n The attribute returns the valu\ e of\n BlissAutomorphismGroup as it is not implemented for &nauty; T\ he \n requirements for the optional arguments vertex_colours and \n \ edge_colours are documented in .\n\n See also , and .\n \ \n\n If the argument digraph is mutable, then the return value of\n \ this attribute is recomputed every time it is called. \n\n G := BlissAutomorphismGroup(JohnsonDigraph(5, 2));;\ngap> IsSymmet\ ricGroup(G);\ntrue\ngap> Size(G);\n120]]>\n \n \n\n \n \n A permutation group.\n \n If digraph is a digraph, then this attribute contains th\ e group of\n automorphisms of digraph as calculated using &nauty; by\ \n Brendan Mckay and Adolfo Piperno via &NautyTracesInterface;.\n\n \n\n The attribute \ and\n operation <\ Ref Oper=\"AutomorphismGroup\" \n Label=\"for a digraph and a homogeneous\ list\"/> returns\n the value of either NautyAutomorphismGroup or <\ Ref\n Attr=\"BlissAutomorphismGroup\" Label=\"for a digraph\"/>.\n The\ se groups are, of course, equal but their generating sets may differ. \n\n \ See also , and .\n \n\n If the argument digraph is mutable, then the ret\ urn value of\n this attribute is recomputed every time it is called. \n\n \ NautyAutomorphismGroup(JohnsonDigraph(5, 2));\nGroup([ \ (3,4)(6,7)(8,9), (2,3)(5,6)(9,10), (2,5)(3,6)(4,7),\n (1,2)(6,8)(7,9) ])]]>\n \n \n\n \n \n A permutation group.\n \n\n This operation computes the automorphism group of a vertex-colou\ red digraph.\n A vertex-coloured digraph can be specified by its underlying\ digraph\n digraph and its colouring vert_colours. Let n be the\n number of vertices of digraph. The colouring vert_col\ ours may\n have one of the following two forms:\n\n \n \n a list of n integers, where vert_colours[i]\ is the\n colour of vertex i, using the colours [1 .. m] \ for some\n m <= n; or\n \n \n a\ list of non-empty disjoint lists whose union is\n DigraphVertices(<\ A>digraph), such that\n vert_colours[i] is the li\ st of all vertices with colour\n i.\n \n \ \n\n The automorphism group of a coloured digraph digraph wit\ h\n colouring vert_colours is the group consisting of its automorphi\ sms; an\n automorphism of digraph is an isomorphism of colour\ ed\n digraphs from digraph to itself. This group is equal to the\n \ subgroup of AutomorphismGroup(digraph) consisting of those\n \ automorphisms that preserve the colouring specified by vert_colours.\ See\n , and see \ \n for more information about isomorphisms of coloured digraphs. \ \n\n If digraph is not a multidigraph then the automorphism grou\ p is\n returned as a group of permutations on the set of vertices of\n <\ A>digraph. \n\n If digraph is a multidigraph then the automo\ rphism group is returned\n as the direct product of a group of permutations\ on the set of vertices of\n digraph with a group of permutations on\ the set of edges of\n digraph. These groups can be accessed using <\ Ref Oper=\"Projection\"\n Label=\"for a domain and a positive integer\" B\ ookName=\"ref\"/> on the\n returned group. \n\n By default, the autom\ orphism group is found using &bliss; by Tommi Junttila\n and Petteri Kaski.\ If &NautyTracesInterface; is available, then &nauty; by\n Brendan Mckay an\ d Adolfo Piperno can be used instead; see\n ,\n , ,\n and .\n\n cycle := CycleDigraph(\ 9);\n\ngap> G := AutomorphismGroup(cy\ cle);;\ngap> IsCyclic(G) and Size(G) = 9;\ntrue\ngap> colours := [[1, 4, 7], [\ 2, 5, 8], [3, 6, 9]];;\ngap> H := AutomorphismGroup(cycle, colours);;\ngap> Si\ ze(H);\n3\ngap> H = AutomorphismGroup(cycle, [1, 2, 3, 1, 2, 3, 1, 2, 3]);\ntr\ ue\ngap> H = SubgroupByProperty(G, p -> OnTuplesSets(colours, p) = colours);\n\ true\ngap> IsTrivial(AutomorphismGroup(cycle, [1, 1, 2, 2, 2, 2, 2, 2, 2]));\n\ true]]>\n \n\n\n \n \n A permu\ tation group.\n \n\n This operation computes the au\ tomorphism group of a vertex- and/or\n edge-coloured digraph.\n A colour\ ed digraph can be specified by its underlying digraph\n digraph and \ colourings vert_colours, edge_colours.\n Let n be the \ number of vertices of digraph. The colourings\n must have the follow\ ing forms:\n\n \n \n vert_colours must be fail or a list of n integers,\n where vert_colours[i] is the colour of vertex i,\n using the colours [1 ..\ m] for some m <= n;\n \n \n ed\ ge_colours must be fail or a list of n lists of\n int\ egers of the same shape as OutNeighbours(digraph), where\n ed\ ge_colours[i][j] is the colour of the edge\n OutNeighbour\ s(digraph)[i][j], using the colours [1 .. k]\n for some k\ <= n;\n \n \n\n Giving vert_colours [<\ A>edge_colours] as fail is\n equivalent to setting all vertices \ [edges] to be the same colour. \n\n Unlike , it is\n possible to obtain the automorphism \ group of an edge-coloured multidigraph\n (see ) when no two edges share the same\n source, range, and colour.\n\n Th\ e automorphism group of a vertex/edge-coloured digraph\n digraph<\ /A> with colouring c is the group consisting of its\n vertex/edge-co\ lour preserving automorphisms; an\n automorphism of digraph i\ s an isomorphism of vertex/edge-coloured\n digraphs from digraph to \ itself. This group is equal to the\n subgroup of AutomorphismGroup(d\ igraph) consisting of those\n automorphisms that preserve the colou\ ring specified by colours. See\n , and see \n for more information about is\ omorphisms of coloured digraphs. \n\n If digraph is not a multid\ igraph then the automorphism group is\n returned as a group of permutations\ on the set of vertices of\n digraph. \n\n If digraph \ is a multidigraph then the automorphism group is returned\n as the direct p\ roduct of a group of permutations on the set of vertices of\n digraph with a group of permutations on the set of edges of\n digraph. The\ se groups can be accessed using on the\n returned group.\ \n\n By default, the automorphism group is found using &bliss; by Tommi\ Junttila\n and Petteri Kaski. If &NautyTracesInterface; is available, then\ &nauty; by\n Brendan Mckay and Adolfo Piperno can be used instead; see\n \ ,\n , , and\n .\n\n cycle := CycleDigraph(12);\n\ngap> vert_colours := List([1 .. 12], x -> x mod 3 + 1);;\ngap>\ edge_colours := List([1 .. 12], x -> [x mod 2 + 1]);;\ngap> Size(Automorphism\ Group(cycle));\n12\ngap> Size(AutomorphismGroup(cycle, vert_colours));\n4\ngap\ > Size(AutomorphismGroup(cycle, fail, edge_colours));\n6\ngap> Size(Automorphi\ smGroup(cycle, vert_colours, edge_colours));\n2\ngap> IsTrivial(AutomorphismGr\ oup(cycle,\n> vert_colours, List([1 .. 12], x -> [x mod 4 + 1])));\ntrue\n]]><\ /Example>\n \n\n\n \n \n \n \ A permutation, or a list of two permutations.\n \n A function \\rho that maps a digraph to a digraph is a can\ onical\n representative map if the following two conditions hold for \ all\n digraphs G and H: \n\n \n \n \ \\rho(G) and G are isomorphic as digraphs; and\n \n \n \\rho(G)=\\rho(H) if and only if G and\ H are\n isomorphic as digraphs.\n \n \n\n\ A canonical labelling of a digraph G (under \\rho) is\ an\n isomorphism of G onto its canonical representative,\n \ \\rho(G). See \n for more information about isomorphisms of digraphs. \n\n BlissCanonicalLabelling returns a canonical labelling of the digraph\n \ digraph found using &bliss; by Tommi Junttila and Petteri Kaski.\n \ NautyCanonicalLabelling returns a canonical labelling of the digraph\n \ digraph found using &nauty; by Brendan McKay and Adolfo Piperno.\n \ Note that the canonical labellings returned by &bliss; and &nauty; are not\n\ usually the same (and may depend of the version used). \n\n Bliss\ CanonicalLabelling can only be computed if digraph has\n no mult\ iple edges; see . \n\n digraph1 := DigraphFromDiSparse6String(\".ImNS_AiB?qRN\");\n\ngap> BlissCanonicalLabelling(digraph1);\n\ (1,9,5,7)(3,6,4,10)\ngap> p := (1, 2, 7, 5)(3, 9)(6, 10, 8);;\ngap> digraph2 :\ = OnDigraphs(digraph1, p);\n\ngap\ > digraph1 = digraph2;\nfalse\ngap> OnDigraphs(digraph1, BlissCanonicalLabelli\ ng(digraph1)) =\n> OnDigraphs(digraph2, BlissCanonicalLabelling(digraph2));\ \ntrue]]>\n \n\n\n \n \n \n A permuta\ tion.\n \n A function \\rho that maps a colo\ ured digraph to a coloured digraph is\n a canonical representative map if the following two conditions hold\n for all coloured digraphs G and H:\n\n \n \n \\rho(G) and G<\ /M> are isomorphic as coloured digraphs; and\n \n \n \ \\rho(G)=\\rho(H) if and only if G and H are\n \ isomorphic as coloured digraphs.\n \n \n\n A can\ onical labelling of a coloured digraph G (under\n \\rho) \ is an isomorphism of G onto its canonical\n representative,\ \\rho(G). See for more information about\n isomorphisms\ of coloured digraphs. \n\n A coloured digraph can be specified by its \ underlying digraph digraph\n and its colouring colours. Let \ n be the number of vertices of\n digraph. The colouring co\ lours may have one of the following\n two forms: \n\n \n \ \n a list of n integers, where colours[i] is the\n colour of vertex i, using the colours [1 .. m]\ for some\n m <= n; or\n \n \n \ a list of non-empty disjoint lists whose union is\n DigraphVertices(\ digraph), such that\n colours[i] is the list o\ f all vertices with colour\n i.\n \n \n\n \ If digraph and colours together form a coloured digraph,\n \ BlissCanonicalLabelling returns a canonical labelling of the digraph\n\ digraph found using &bliss; by Tommi Junttila and Petteri Kaski.\n \ Similarly, NautyCanonicalLabelling returns a canonical labelling of\ \n the digraph digraph found using &nauty; by Brendan McKay and Adol\ fo\n Piperno. Note that the canonical labellings returned by &bliss; and\n\ &nauty; are not usually the same (and may depend of the version used). \ \n\n BlissCanonicalLabelling can only be computed if digraph \ has\n no multiple edges; see . The canonical\ \n labelling of digraph is given as a permutation of its vertices.\n\ The canonical representative of digraph can be created from\n digraph and its canonical labelling p by using the\n operation \ :\n gap>\ OnDigraphs(digraph, p);\n\n The colouring of the canonical represent\ ative can easily be\n constructed. A vertex v (in digraph) ha\ s colour i if\n and only if the vertex v ^ p (in the canonica\ l representative) has\n colour i, where p is the permutation \ of the canonical\n labelling that acts on the vertices of digraph. I\ n particular, if\n colours has the first form that is described abov\ e, then the\n colouring of the canonical representative is given by:\n\n \ gap> List(DigraphVertices(digraph), i -> colours[i / p]);\n\n O\ n the other hand, if colours has the second form above, then the\n c\ anonical representative has colouring:\n\n gap> OnTuplesSets(colours, \ p);\n\n \n\n digraph := DigraphFromDi\ Sparse6String(\".ImNS_AiB?qRN\");\n\ngap> colours := [[1, 2, 8, 9, 10], [3, 4, 5, 6, 7]];;\ngap> p := BlissCano\ nicalLabelling(digraph, colours);\n(1,5,8,4,10,3,9)(6,7)\ngap> OnDigraphs(digr\ aph, p);\n\ngap> OnTuplesSets(col\ ours, p);\n[ [ 1, 2, 3, 4, 5 ], [ 6, 7, 8, 9, 10 ] ]\ngap> colours := [1, 1, 1\ , 1, 2, 3, 1, 3, 2, 1];;\ngap> p := BlissCanonicalLabelling(digraph, colours);\ \n(1,6,9,7)(3,4,5,8,10)\ngap> OnDigraphs(digraph, p);\n\ngap> List(DigraphVertices(digraph), i -> colours[i / p\ ]);\n[ 1, 1, 1, 1, 1, 1, 2, 2, 3, 3 ]]]>\n \n\n\n \n \n \n A \ digraph.\n \n The attribute BlissCanonicalLabell\ ing returns the canonical\n representative found by applying . The digraph retu\ rned is canonical in the sense\n that\n\n \n \n \ BlissCanonicalDigraph(digraph) and digraph are\n i\ somorphic as digraphs; and\n \n \n If gr \ is any digraph then BlissCanonicalDigraph(gr)\n and BlissCano\ nicalDigraph(digraph) are equal if and only\n if gr a\ nd digraph are isomorphic as digraphs.\n \n \n\n \ Analogously, the attribute NautyCanonicalLabelling returns the\n \ canonical representative found by applying .\n \n\n If the argument digra\ ph is mutable, then the return value of\n this attribute is recomputed \ every time it is called. \n\n digraph := Digraph([\ [1], [2, 3], [3], [1, 2, 3]]);\n\n\ gap> canon := BlissCanonicalDigraph(digraph);\n\ngap> OutNeighbours(canon);\n[ [ 1 ], [ 2 ], [ 3, 2 ], [ 1, 3, 2\ ] ]\n]]>\n \n\n\n \n \n A permutation group.\n \n If digraph is immutable and was created \ knowing a subgroup of\n its automorphism group, then this group is stored i\ n the attribute\n DigraphGroup. If digraph is mutable, or was\ not created\n knowing a subgroup of its automorphism group, then Digrap\ hGroup\n returns the entire automorphism group of digraph. \n\ Note that if digraph is mutable, then the automorphism group is\n \ recomputed every time this function is called.\n \n\n Note that ce\ rtain other constructor operations such as , , and , may not require a group as one of the arguments,\n but use the stan\ dard constructor method using a group, and hence set the\n DigraphGroup<\ /C> attribute for the resulting digraph.\n\n n := \ 4;;\ngap> adj := function(x, y)\n> return (((x - y) mod n) = 1) or (((x -\ y) mod n) = n - 1);\n> end;;\ngap> group := CyclicGroup(IsPermGroup, n);\n\ Group([ (1,2,3,4) ])\ngap> D := Digraph(IsMutableDigraph, group, [1 .. n], \\^\ , adj);\n\ngap> HasDigraphGroup(D);\ \nfalse\ngap> DigraphGroup(D);\nGroup([ (2,4), (1,2)(3,4) ])\ngap> Automorphis\ mGroup(D);\nGroup([ (2,4), (1,2)(3,4) ])\ngap> D := Digraph(group, [1 .. n], \ \\^, adj);\n\ngap> HasDigraphGroup\ (D);\ntrue\ngap> DigraphGroup(D);\nGroup([ (1,2,3,4) ])\ngap> D := DoubleDigra\ ph(D);\n\ngap> HasDigraphGroup(D)\ ;\ntrue\ngap> DigraphGroup(D);\nGroup([ (1,2,3,4)(5,6,7,8), (1,5)(2,6)(3,7)(4,\ 8) ])\ngap> AutomorphismGroup(D) =\n> Group([(6, 8), (5, 7), (4, 6), (3, 5), (\ 2, 4),\n> (1, 2)(3, 4)(5, 6)(7, 8)]);\ntrue\ngap> D := Digraph([[2, 3],\ [], []]);\n\ngap> HasDigraphGroup\ (D);\nfalse\ngap> HasAutomorphismGroup(D);\nfalse\ngap> DigraphGroup(D);\nGrou\ p([ (2,3) ])\ngap> HasAutomorphismGroup(D);\ntrue\ngap> group := DihedralGroup\ (8);\n\ngap> D := CayleyDigraph(group);\ \n\ngap> HasDigraphGroup(D);\ntru\ e\ngap> GeneratorsOfGroup(DigraphGroup(D));\n[ (1,2)(3,8)(4,6)(5,7), (1,3,4,7)\ (2,5,6,8), (1,4)(2,6)(3,7)(5,8) ]]]>\n \n\n\n \n \n \n An immutable list of lists of integers.\n \n \n DigraphOrbits returns the orbits of the action of the\n on the set of vertices of digraph.\n\n G := Group([(2, 3)(7, 8, 9), (1, 2, 3)(4, 5, 6)(8, 9)])\ ;;\ngap> D := EdgeOrbitsDigraph(G, [1, 2]);\n\ngap> DigraphOrbits(D);\n[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ]\ \ngap> D := DigraphMutableCopy(D);\n\ \ngap> DigraphOrbits(D);\n[ [ 1, 2, 3 ], [ 4, 5, 6, 7, 8, 9 ] ]\n]]>\ \n \n\n\n \n \n \n An immutable list of integers.\ \n \n \n DigraphOrbitReps returns a list of\ orbit representatives\n of the action of the \ on the set of vertices of\n digraph.\n\n \ D := CayleyDigraph(AlternatingGroup(4));\n\ngap> DigraphOrbitReps(D);\n[ 1 ]\ngap> D := DigraphMutableCopy(D)\ ;\n\ngap> DigraphOrbitReps(D);\n[ \ 1 ]\ngap> D := DigraphFromDigraph6String(\"&IGO??S?`?_@?a?CK?O\");\n\ngap> DigraphOrbitReps(D);\n[ 1, 2, 3, 4,\ 5, 6, 7, 8, 9, 10 ]\ngap> DigraphOrbitReps(DigraphMutableCopy(D));\n[ 1, 2, 3\ , 4, 5, 6, 7, 8, 9, 10 ]\n]]>\n \n\n\n \ \n \n \n An immutable list of integers.\n \n \n \ DigraphSchreierVector returns the so-called Schreier vector\n \ of the action of the on the set of vertices of\ \n digraph. The Schreier vector is a list sch of integers wit\ h\n length DigraphNrVertices(digraph) where:\n \n \ sch[i] < 0:\n \n implies that i\ is an orbit representative and\n DigraphOrbitReps(digraph)[-sch[i]] = i.\n \n\n sch[i] > 0:\n \n implies that i / gens[sch[i]]\n is one \ step closer to the root (or representative) of the tree, where\n gen\ s is the generators of DigraphGroup(digraph).\n \ \n \n\n n := 4;;\ngap> adj := function(x\ , y)\n> return (((x - y) mod n) = 1) or (((x - y) mod n) = n - 1);\n> \ end;;\ngap> group := CyclicGroup(IsPermGroup, n);\nGroup([ (1,2,3,4) ])\ngap> \ D := Digraph(IsMutableDigraph, group, [1 .. n], \\^, adj);\n\ngap> sch := DigraphSchreierVector(D);\n[ -1, 2, 2, 1\ ]\ngap> D := CayleyDigraph(AlternatingGroup(4));\n\ngap> sch := DigraphSchreierVector(D);\n[ -1, 2, 2, 1, 1, \ 1, 1, 1, 2, 2, 2, 1 ]\ngap> DigraphOrbitReps(D);\n[ 1 ]\ngap> gens := Generato\ rsOfGroup(DigraphGroup(D));\n[ (1,5,7)(2,4,8)(3,6,9)(10,11,12), (1,2,3)(4,7,10\ )(5,9,11)(6,8,12) ]\ngap> 10 / gens[sch[10]];\n7\ngap> 7 / gens[sch[7]];\n5\ng\ ap> 5 / gens[sch[5]];\n1]]>\n \n\n\n \ \n \n \n A permutation group.\n \n \n DigraphS\ tabilizer returns the stabilizer of the vertex v\n under of the \ action of the on the set of\n vertices of d\ igraph.\n\n D := DigraphFromDigraph6String(\"&\ GYHPQgWTIIPW\");\n\ngap> DigraphS\ tabilizer(D, 8);\nGroup(())\ngap> DigraphStabilizer(D, 2);\nGroup(())\ngap> D \ := DigraphMutableCopy(D);\n\ngap> D\ igraphStabilizer(D, 8);\nGroup(())\ngap> DigraphStabilizer(D, 2);\nGroup(())\n\ ]]>\n \n\n\n \n \ \n true or false.\n \n This\ operation returns true if there exists an isomorphism from the\n di\ graph digraph1 to the digraph digraph2. See for more information\n abou\ t isomorphisms of digraphs. \n\n By default, an isomorphism is found us\ ing the canonical labellings of the\n digraphs obtained from &bliss; by Tom\ mi Junttila\n and Petteri Kaski. If &NautyTracesInterface; is available, th\ en &nauty; by\n Brendan Mckay and Adolfo Piperno can be used instead; see\n\ , and .\n\ \n digraph1 := CycleDigraph(4);\n\ngap> digraph2 := CycleDigraph(5);\n\ngap> IsIsomorphicDigraph(digraph1, digraph2);\nfalse\ \ngap> digraph2 := DigraphReverse(digraph1);\n\ngap> IsIsomorphicDigraph(digraph1, digraph2);\ntrue\ngap> digrap\ h1 := Digraph([[3], [], []]);\n\nga\ p> digraph2 := Digraph([[], [], [2]]);\n\ngap> IsIsomorphicDigraph(digraph1, digraph2);\ntrue]]>\n \n\n\n \n \n true or false.\ \n \n This operation tests for isomorphism of coloured digrap\ hs. A coloured\n digraph can be specified by its underlying digraph dig\ raph1 and its\n colouring colours1. Let n be the number \ of vertices of\n digraph1. The colouring colours1 may have on\ e of the following\n two forms:\n\n \n \n a list\ of n integers, where colours[i] is the\n colour o\ f vertex i, using the colours [1 .. m] for some\n m &l\ t;= n; or\n \n \n a list of non-empty disjoi\ nt lists whose union is\n DigraphVertices(digraph), such \ that\n colours[i] is the list of all vertices with colour\ \n i.\n \n \n\n If digraph1 and \ digraph2 are digraphs without multiple edges,\n and colours1 \ and colours2 are colourings of digraph1\n and digraph2\ , respectively, then this operation returns true\n if there exists a\ n isomorphism between these two coloured digraphs. See\n for mo\ re information about isomorphisms of coloured digraphs. \n\n By default\ , an isomorphism is found using the canonical labellings of the\n digraphs \ obtained from &bliss; by Tommi Junttila\n and Petteri Kaski. If &NautyTrace\ sInterface; is available, then &nauty; by\n Brendan Mckay and Adolfo Pipern\ o can be used instead; see\n , and .\n\n digraph1 := ChainDig\ raph(4);\n\ngap> digraph2 := ChainDig\ raph(3);\n\ngap> IsIsomorphicDigraph(\ digraph1, digraph2,\n> [[1, 4], [2, 3]], [[1, 2], [3]]);\nfalse\ngap> digraph\ 2 := DigraphReverse(digraph1);\n\n\ gap> IsIsomorphicDigraph(digraph1, digraph2,\n> [1, 1, 1, 1], [1, 1, 1, 1]);\ \ntrue\ngap> IsIsomorphicDigraph(digraph1, digraph2,\n> [1, 2, 2, 1], [1, 2, \ 2, 1]);\ntrue\ngap> IsIsomorphicDigraph(digraph1, digraph2,\n> [1, 1, 2, 2], \ [1, 1, 2, 2]);\nfalse]]>\n \n\n\n \n \n A permutation, or a pair of permutations, o\ r fail.\n \n This operation returns an isomo\ rphism between the digraphs digraph1\n and digraph2 if one ex\ ists, else this operation returns fail.\n \n\n An isomorph\ ism from a digraph digraph1 to a digraph\n digraph2 is a \ bijection p from the vertices of\n digraph1 to the vertices o\ f digraph2 with the following\n property: for all vertices i \ and j of digraph1,\n [i, j] is an edge of digraph1<\ /A> if and only if [i ^ p, j\n ^ p] is an edge of digraph2.\ \n\n If there exists such an isomorphism, then this operation returns \ one.\n The form of this isomorphism is a permutation p of the vertic\ es of\n digraph1 such that \n\n OnDigraphs(digraph1\ , p) = digraph2.\n\n By default, an isomorphism is found using the cano\ nical labellings of the\n digraphs obtained from &bliss; by Tommi Junttila\ \n and Petteri Kaski. If &NautyTracesInterface; is available, then &nauty; \ by\n Brendan Mckay and Adolfo Piperno can be used instead; see\n , and .\n\n digraph1 := CycleDigraph(4);\n\ngap> digraph2 := CycleDigraph(5);\n\ngap> IsomorphismDigraphs(digraph1, digraph2);\nfail\ngap> digrap\ h1 := CompleteBipartiteDigraph(10, 5);\n\ngap> digraph2 := CompleteBipartiteDigraph(5,\ 10);\n\ \ngap> p := IsomorphismDigraphs(digraph1, digraph2);\n(1,6,11)(2,7,12)(3,8,13)\ (4,9,14)(5,10,15)\ngap> OnDigraphs(digraph1, p) = digraph2;\ntrue\n]]>\n \n\n\n \n \n A permutation, or fail.\n \n This operation searches for an isomorphism \ between coloured digraphs. A\n coloured digraph can be specified by its un\ derlying digraph digraph1\n and its colouring colours1. Let \ n be the number of vertices\n of digraph1. The colouring c\ olours1 may have one of the\n following two forms:\n\n \n \ \n a list of n integers, where colours[i] i\ s the\n colour of vertex i, using the colours [1 .. m] fo\ r some\n m <= n; or\n \n \n a l\ ist of non-empty disjoint lists whose union is\n DigraphVertices(\ digraph), such that\n colours[i] is the list of a\ ll vertices with colour\n i.\n \n \n\n \ An isomorphism between coloured digraphs is an isomorphism between\n \ the underlying digraphs that preserves the colourings. See for more information\n abo\ ut isomorphisms of digraphs. More precisely, let f be an\n isomorphi\ sm of digraphs from the digraph digraph1 (with colouring\n colour\ s1) to the digraph digraph2 (with colouring\n colours2), \ and let p be the permutation of the vertices of\n digraph1 th\ at corresponds to f. Then f preserves the\n colourings of digraph1 and digraph2 – and hence is an\n isomorphism of colo\ ured digraphs – if colours1[i] =\n colours2[i ^ p]\ for all vertices i in digraph1.\n \n\n This operation\ returns such an isomorphism if one exists, else it returns\n fail. \ \n\n By default, an isomorphism is found using the canonical labellings\ of the\n digraphs obtained from &bliss; by Tommi Junttila\n and Petteri\ Kaski. If &NautyTracesInterface; is available, then &nauty; by\n Brendan M\ ckay and Adolfo Piperno can be used instead; see\n , and .\n\n digraph1 := ChainDigraph(4);\n\ngap\ > digraph2 := ChainDigraph(3);\n\ngap\ > IsomorphismDigraphs(digraph1, digraph2,\n> [[1, 4], [2, 3]], [[1, 2], [3]])\ ;\nfail\ngap> digraph2 := DigraphReverse(digraph1);\n\ngap> colours1 := [1, 1, 1, 1];;\ngap> colours2 := [1, 1, \ 1, 1];;\ngap> p := IsomorphismDigraphs(digraph1, digraph2, colours1, colours2)\ ;\n(1,4)(2,3)\ngap> OnDigraphs(digraph1, p) = digraph2;\ntrue\ngap> List(Digra\ phVertices(digraph1), i -> colours1[i ^ p]) = colours2;\ntrue\ngap> colours1 :\ = [1, 1, 2, 2];;\ngap> colours2 := [2, 2, 1, 1];;\ngap> p := IsomorphismDigrap\ hs(digraph1, digraph2, colours1, colours2);\n(1,4)(2,3)\ngap> OnDigraphs(digra\ ph1, p) = digraph2;\ntrue\ngap> List(DigraphVertices(digraph1), i -> colours1[\ i ^ p]) = colours2;\ntrue\ngap> IsomorphismDigraphs(digraph1, digraph2,\n> [1\ , 1, 2, 2], [1, 1, 2, 2]);\nfail]]>\n \n\ \n\n \n \n An immutable list of lists.\n \n \ This function returns the list out of out-neighbours of each\n \ representative of the orbits of the action of \ on\n the vertex set of the digraph digraph. \n\n More specifi\ cally, if reps is the list of orbit representatives,\n then a vertex\ j appears in out[i] each time\n there exists an edge with so\ urce reps[i] and range j in\n digraph.\n \n\n \ If is trivial, then \n is returned.\n\n D := Digraph([\n> [2, 1,\ 3, 4, 5], [3, 5], [2], [1, 2, 3, 5], [1, 2, 3, 4]]);\n\ngap> DigraphGroup(D);\nGroup(())\ngap> RepresentativeO\ utNeighbours(D);\n[ [ 2, 1, 3, 4, 5 ], [ 3, 5 ], [ 2 ], [ 1, 2, 3, 5 ], [ 1, 2\ , 3, 4 ] ]\ngap> D := Digraph(IsMutableDigraph, [\n> [2, 1, 3, 4, 5], [3, 5],\ [2], [1, 2, 3, 5], [1, 2, 3, 4]]);\n\ngap> DigraphGroup(D);\nGroup(())\ngap> RepresentativeOutNeighbours(D);\n[ \ [ 2, 1, 3, 4, 5 ], [ 3, 5 ], [ 2 ], [ 1, 2, 3, 5 ], [ 1, 2, 3, 4 ] ]\ngap> D :\ = DigraphFromDigraph6String(\"&GYHPQgWTIIPW\");\n\ngap> G := DigraphGroup(D);;\ngap> GeneratorsOfGroup(G);\n[ (\ 1,2)(3,4)(5,6)(7,8), (1,3,2,4)(5,7,6,8), (1,5)(2,6)(3,8)(4,7) ]\ngap> Set(Repr\ esentativeOutNeighbours(D), Set);\n[ [ 2, 3, 5 ] ]]]>\n \n\n\n \n \n \n \n \n true or f\ alse.\n \n IsDigraphIsomorphism returns \ true if the permutation or\n transformation x is an isomorphi\ sm from the digraph src to\n the digraph ran.\n \n\n \ IsDigraphAutomorphism returns true if the permutation or\n \ transformation x is an automorphism of the digraph digraph.\n \ \n\n A permutation or transformation x is an isomorphism\ from a\n digraph src to a digraph ran if the following hold:\ \n \n \n x is a bijection from the vertices \ of src to those of\n ran;\n \n \n \ [u ^ x, v ^ x] is an edge of\n ran i\ f and only if [u, v] is an\n edge of src; and\n \n \n x fixes every i which is not a vertex\ of src.\n \n \n See also . \n \n If col1 a\ nd col2, or col, are given, then they must\n represent vertex\ colourings; see \n \n for details of the permissible values for\n \ these arguments. The homomorphism must then also have the property:\n \n \ \n \n col1[i] = col2[i ^ x] for all vertices i of src,\n for IsDigraphIsomorphism. \n \ \n col[i] = col[i ^ x] for all vertices i of di\ graph,\n for IsDigraphAutomorphism. \n \n\n\ For some digraphs, it can be faster to use IsDigraphAutomorphism\n \ than to test membership in the automorphism group of digraph.\n\n \ src := Digraph([[1], [1, 2], [1, 3]]);\n\ngap> IsDigraphAutomorphism(src, (1, 2, 3));\ \nfalse\ngap> IsDigraphAutomorphism(src, (2, 3));\ntrue\ngap> IsDigraphAutomor\ phism(src, (2, 3), [2, 1, 1]);\ntrue\ngap> IsDigraphAutomorphism(src, (2, 3), \ [2, 2, 1]);\nfalse\ngap> IsDigraphAutomorphism(src, (2, 3)(4, 5));\nfalse\ngap\ > IsDigraphAutomorphism(src, (1, 4));\nfalse\ngap> IsDigraphAutomorphism(src, \ ());\ntrue\ngap> ran := Digraph([[2, 1], [2], [2, 3]]);\n\ngap> IsDigraphIsomorphism(src, ran, (1, 2));\ntrue\ng\ ap> IsDigraphIsomorphism(ran, src, (1, 2));\ntrue\ngap> IsDigraphIsomorphism(r\ an, src, (1, 2));\ntrue\ngap> IsDigraphIsomorphism(src, Digraph([[3], [1, 3], \ [2]]), (1, 2, 3));\nfalse\ngap> IsDigraphIsomorphism(src, ran, (1, 2), [1, 2, \ 3], [2, 1, 3]);\ntrue\ngap> IsDigraphIsomorphism(src, ran, (1, 2), [1, 2, 2], \ [2, 1, 3]);\nfalse\n]]>\n \n\n\n \n \n \ \n true or false. \n <\ Description>\n The operation IsDigraphColouring verifies whether o\ r not \n the list list describes a proper colouring of the digraph\ \n digraph. \n \n\n A list list describes a \ proper colouring of a digraph\n digraph if list cons\ ists of positive integers, the length of\n list equals the number \ of vertices in digraph, and for any\n vertices u, v of d\ igraph if u and v are adjacent,\n then list[u\ ] >< list[v].\n \n\n A transformation t \ describes a proper colouring of a digraph\n digraph, if ImageLi\ stOfTransformation(t,\n DigraphNrVertices(digraph)) is \ a proper colouring of \n digraph. \n\n See also .\n \n D := Joh\ nsonDigraph(5, 3);\n\n\ gap> IsDigraphColouring(D, [1, 2, 3, 3, 2, 1, 4, 5, 6, 7]);\ntrue\ngap> IsDigr\ aphColouring(D, [1, 2, 3, 3, 2, 1, 2, 5, 6, 7]);\nfalse\ngap> IsDigraphColouri\ ng(D, [1, 2, 3, 3, 2, 1, 2, 5, 6, -1]);\nfalse\ngap> IsDigraphColouring(D, [1,\ 2, 3]);\nfalse\ngap> IsDigraphColouring(D, IdentityTransformation);\ntrue\n]]\ >\n \n \n\n \n\n Homomorphisms of digraphs\n\n The following methods exi\ st to find homomorphisms between digraphs.\n If an argument to one of these\ methods is a digraph with multiple edges,\n then the multiplicity of edges\ will be ignored in order to perform the\n calculation; the digraph will be\ treated as if it has no multiple edges.\n\n \n \n The argument user_param.\n \n This func\ tion finds homomorphisms from the digraph D1 to the digraph\n D2<\ /A> subject to the conditions imposed by the other arguments as\n described\ below.\n\n If f and g are homomorphisms found by\n HomomorphismDigraphsFinder, then f cannot be obtained from\n g by right multiplying by an automorphism of D2 in\n aut_grp\ .\n\n \n hook\n \n Thi\ s argument should be a function or fail. \n\n If hook \ is a function, then it must have two arguments\n user_param (see\ below) and a transformation t. The\n function hook(user_param, t) is called every time\n a new homomorphism t<\ /C> is found by\n HomomorphismDigraphsFinder. If the function re\ turns true,\n then HomomorphismDigraphsFinder stops and d\ oes not find any\n further homomorphisms. This feature might be useful \ if you are\n searching for a homomorphism that satisfies some condition\ that you\n cannot specify via the other arguments to\n Homom\ orphismDigraphsFinder.\n \n\n If hook is fail<\ /K>, then a default function is used which\n simply adds every new homo\ morphism found by\n HomomorphismDigraphsFinder to user_param<\ /A>, which must be a\n mutable list in this case.\n \n\n \ user_param\n \n If hook is a f\ unction, then user_param can be any &GAP;\n object. The object <\ A>user_param is used as the first argument of\n the function hoo\ k. For example, user_param might be a\n transformation semig\ roup, and hook(user_param, t)\n might set user_\ param to be the closure of user_param and\n t. \n\ \n If the value of hook is fail, then the value of\n \ user_param must be a mutable list.\n \n\n \ max_results\n \n This argument should be a positi\ ve integer or infinity.\n HomomorphismDigraphsFinder will\ return after it has found\n max_results homomorphisms or the se\ arch is complete, whichever\n happens first.\n \n\n hint\n \n This argument should be a positi\ ve integer or fail. \n\n If hint is a positive intege\ r, then only homorphisms of rank\n hint are found. \n\n \ If hint is fail, then no restriction is put on the rank\n \ of homomorphisms found.\n \n\n injective\n \n This argument should be 0, 1, or 2<\ /C>. If it is\n 2, then only embeddings are found, if it is \ 1, then only\n injective homomorphisms are found, and if it is 0\ there are no\n restrictions imposed by this argument.\n \n\n For backwards compatibility, injective can also be fals\ e\n or true which correspond to the values 0 and 1\ \n described in the previous paragraph, respectively. \n \n\n image\n \n This argument sho\ uld be a subset of the vertices of the graph D2.\n Homomorphi\ smDigraphsFinder only finds homomorphisms from\n D1 to the s\ ubgraph of D2 induced by the vertices\n image.\n \n\n partial_map\n \n This argu\ ment should be a partial map from D1 to D2,\n that is, a \ (not necessarily dense) list of vertices of the digraph\n D2 of \ length no greater than the number vertices in the digraph\n D1. \ HomomorphismDigraphsFinder only finds homomorphisms\n extending \ partial_map (if any).\n \n \n colors1\n \n This should be a list representing possible co\ lours of vertices in the\n digraph D1; see \n \n for details of the permissible values for this argument.\n \ \n \n colors2\n \n Thi\ s should be a list representing possible colours of vertices in the\n d\ igraph D2; see \n \n for details of the pe\ rmissible values for this argument.\n \n order\n \n The optional argument order specifies the \ order the\n vertices in D1 appear in the search for homomorphism\ s. \n The value of this parameter can have a large impact\n on t\ he runtime of the function. It seems in many cases to be a good\n idea \ for this to be the , i.e.\n vert\ ices ordered from highest to lowest degree.\n \n \n \ The optional argument aut_grp should be a subgroup of the\n \ automorphism group of D2. This function returns unique\n represe\ ntatives of the homomorphisms found up to right multiplication\n by \ aut_grp. If this argument is not specific, it defaults to the\n ful\ l automorphism group of D2, which may be costly to calculate.\n \n \n\n D := ChainDigraph(10);\n\ngap> D := DigraphSymmetricClosure(D);\ \n\ngap> HomomorphismD\ igraphsFinder(D, D, fail, [], infinity, 2, 0,\n> [3, 4], [], fail, fail);\n[ T\ ransformation( [ 3, 4, 3, 4, 3, 4, 3, 4, 3, 4 ] ), \n Transformation( [ 4, 3,\ 4, 3, 4, 3, 4, 3, 4, 3 ] ) ]\ngap> D2 := CompleteDigraph(6);;\ngap> Homomorph\ ismDigraphsFinder(D, D2, fail, [], 1, fail, 0,\n> [1 .. 6], [1, 2, 1], fail, f\ ail);\n[ Transformation( [ 1, 2, 1, 3, 4, 5, 6, 1, 2, 1 ] ) ]\ngap> func := fu\ nction(user_param, t)\n> Add(user_param, t * user_param[1]);\n> end;;\ngap> Ho\ momorphismDigraphsFinder(D, D2, func, [Transformation([2, 2])],\n> 3, fail, 0,\ [1 .. 6], [1, 2, 1], fail, fail);\n[ Transformation( [ 2, 2 ] ), \n Transfor\ mation( [ 2, 2, 2, 3, 4, 5, 6, 2, 2, 2 ] ), \n Transformation( [ 2, 2, 2, 3, \ 4, 5, 6, 2, 2, 3 ] ), \n Transformation( [ 2, 2, 2, 3, 4, 5, 6, 2, 2, 4 ] ) ]\ \ngap> HomomorphismDigraphsFinder(NullDigraph(2), NullDigraph(3), fail,\n> [],\ infinity, fail, 1, [1, 2, 3], fail, fail, fail, fail,\n> Group(()));\n[ Ident\ ityTransformation, Transformation( [ 1, 3, 3 ] ), \n Transformation( [ 2, 1 ]\ ), Transformation( [ 2, 3, 3 ] ), \n Transformation( [ 3, 1, 3 ] ), Transfor\ mation( [ 3, 2, 3 ] ) ]\ngap> HomomorphismDigraphsFinder(NullDigraph(2), NullD\ igraph(3), fail,\n> [], infinity, fail, 1, [1, 2, 3], fail, fail, fail, fail,\ \n> Group((1, 2)));\n[ IdentityTransformation, Transformation( [ 1, 3, 3 ] ), \ \n Transformation( [ 3, 1, 3 ] ) ]]]>\n \n\n\n \n \n A transformation, or fail.\n \n A homomorphism from digraph1 to digraph2 is a mapp\ ing from\n the vertex set of digraph1 to a subset of the vertices of\ \n digraph2, such that every pair of vertices [i,j] which has\ \n an edge i->j is mapped to a pair of vertices [a,b] which\n\ has an edge a->b. Note that non-adjacent vertices can still be\n \ mapped to adjacent vertices. \n\n DigraphHomomorphism returns \ a single homomorphism between\n digraph1 and digraph2 if it e\ xists, otherwise it returns\n fail.\n gr1 :=\ ChainDigraph(3);;\ngap> gr2 := Digraph([[3, 5], [2], [3, 1], [], [4]]);\n\ngap> DigraphHomomorphism(gr1, gr1);\ \nIdentityTransformation\ngap> map := DigraphHomomorphism(gr1, gr2);\nTransfor\ mation( [ 3, 1, 5, 4, 5 ] )\ngap> IsDigraphHomomorphism(gr1, gr2, map);\ntrue\ \n]]>\n \n\n\n \n \n \n \ A list of transformations.\n \n HomomorphismsDi\ graphsRepresentatives finds every\n \ between digraph1 and\n digraph2, up to right multiplication \ by an element of the\n of digraph2.\n In other words, every homomorphism f bet\ ween digraph1 and\n digraph2 can be written as the compositio\ n f = g * x,\n where g is one of the HomomorphismsDigraphs\ Representatives\n and x is an automorphism of digraph2.\n\ \n\n HomomorphismsDigraphs returns all homomorphisms between\ \n digraph1 and digraph2.\n gr1 :\ = ChainDigraph(3);;\ngap> gr2 := Digraph([[3, 5], [2], [3, 1], [], [4]]);\n\ngap> HomomorphismsDigraphs(gr1, gr2\ );\n[ Transformation( [ 1, 3, 1 ] ), Transformation( [ 1, 3, 3 ] ), \n Transf\ ormation( [ 1, 5, 4, 4, 5 ] ), Transformation( [ 2, 2, 2 ] ), \n Transformati\ on( [ 3, 1, 3 ] ), Transformation( [ 3, 1, 5, 4, 5 ] ), \n Transformation( [ \ 3, 3, 1 ] ), Transformation( [ 3, 3, 3 ] ) ]\ngap> HomomorphismsDigraphsRepres\ entatives(gr1, CompleteDigraph(3));\n[ Transformation( [ 2, 1 ] ), Transformat\ ion( [ 2, 1, 2 ] ) ]\n]]>\n \n\n\n \n \ \n A transformation, or fail.\n \n \ DigraphMonomorphism returns a single injective between digraph1 and digraph2\n if\ one exists, otherwise it returns fail.\n g\ r1 := ChainDigraph(3);;\ngap> gr2 := Digraph([[3, 5], [2], [3, 1], [], [4]]);\ \n\ngap> DigraphMonomorphism(gr1, \ gr1);\nIdentityTransformation\ngap> DigraphMonomorphism(gr1, gr2);\nTransforma\ tion( [ 3, 1, 5, 4, 5 ] )\n]]>\n \n\n\n \ \n \n \n A list of transformations.\n \ \n These operations behave the same as and\n , except they o\ nly return\n injective homomorphisms.\n \ gr1 := ChainDigraph(3);;\ngap> gr2 := Digraph([[3, 5], [2], [3, 1], [], [4]]);\ \n\ngap> MonomorphismsDigraphs(gr1\ , gr2);\n[ Transformation( [ 1, 5, 4, 4, 5 ] ), \n Transformation( [ 3, 1, 5,\ 4, 5 ] ) ]\ngap> MonomorphismsDigraphsRepresentatives(gr1, CompleteDigraph(3)\ );\n[ Transformation( [ 2, 1 ] ) ]\n]]>\n \n\n\n \n \n A transformation, or fail.\n \n DigraphEpimorphism returns a single surjective between digraph1 and digraph2\ \n if one exists, otherwise it returns fail.\n gr1 := DigraphReverse(ChainDigraph(4));\n\ngap> gr2 := DigraphRemoveEdge(CompleteDigraph(3), [1, 2]);\ \n\ngap> DigraphEpimorphism(gr2, g\ r1);\nfail\ngap> DigraphEpimorphism(gr1, gr2);\nTransformation( [ 3, 1, 2, 3 ]\ )\n]]>\n \n\n\n \n \n \n \ A list of transformations.\n \n These operations be\ have the same as and\n , except they only return\n surjec\ tive homomorphisms.\n gr1 := DigraphReverse(Ch\ ainDigraph(4));\n\ngap> gr2 := Dig\ raphSymmetricClosure(CycleDigraph(3));\n\ngap> EpimorphismsDigraphsRepresentatives(gr1, gr2);\n[ Trans\ formation( [ 3, 1, 2, 1 ] ), Transformation( [ 3, 1, 2, 3 ] ), \n Transformat\ ion( [ 2, 1, 2, 3 ] ) ]\ngap> EpimorphismsDigraphs(gr1, gr2);\n[ Transformatio\ n( [ 1, 2, 1, 3 ] ), Transformation( [ 1, 2, 3, 1 ] ), \n Transformation( [ 1\ , 2, 3, 2 ] ), Transformation( [ 1, 3, 1, 2 ] ), \n Transformation( [ 1, 3, 2\ , 1 ] ), Transformation( [ 1, 3, 2, 3 ] ), \n Transformation( [ 2, 1, 2, 3 ] \ ), Transformation( [ 2, 1, 3, 1 ] ), \n Transformation( [ 2, 1, 3, 2 ] ), Tra\ nsformation( [ 2, 3, 1, 2 ] ), \n Transformation( [ 2, 3, 1, 3 ] ), Transform\ ation( [ 2, 3, 2, 1 ] ), \n Transformation( [ 3, 1, 2, 1 ] ), Transformation(\ [ 3, 1, 2, 3 ] ), \n Transformation( [ 3, 1, 3, 2 ] ), Transformation( [ 3, \ 2, 1, 2 ] ), \n Transformation( [ 3, 2, 1, 3 ] ), Transformation( [ 3, 2, 3, \ 1 ] ) ]\n]]>\n \n\n\n \n \ \n A t\ ransformation, or fail.\n \n An embedding of\ a digraph digraph1 into another digraph\n digraph2 is a from digraph1\n to digraph2 w\ hich has the additional property that a pair of\n vertices [i, j] wh\ ich have no edge i -> j in digraph1 are\n\n mapped to a pair \ of vertices [a, b] which have no edge a->b in\n digraph2. \n\n In other words, an embedding t is an isomorphism from\n \ digraph1 to the of digraph2\ \n on the image of t. \n\n DigraphEmbedding returns a \ single embedding if one exists, otherwise\n it returns fail.\n gr := ChainDigraph(3);\n\ngap> DigraphEmbedding(gr, CompleteDigraph(4));\nfail\ngap> Digraph\ Embedding(gr, Digraph([[3], [1, 4], [1], [3]]));\nTransformation( [ 2, 4, 3, 4\ ] )\n]]>\n \n\n\n \n \n \n A list of transformations.\ \n \n These operations behave the same as and\n , except they only return\n embeddings of D1 into D2<\ /A>. \n\n See also .\n D1 := NullDigraph(2);\n\ \ngap> D2 := CycleDigraph(5);\n\ngap>\ EmbeddingsDigraphsRepresentatives(D1, D2);\n[ Transformation( [ 1, 3, 3 ] ), \ Transformation( [ 1, 4, 3, 4 ] ) ]\ngap> EmbeddingsDigraphs(D1, D2);\n[ Transf\ ormation( [ 1, 3, 3 ] ), Transformation( [ 1, 4, 3, 4 ] ), \n Transformation(\ [ 2, 4, 4, 5, 1 ] ), \n Transformation( [ 2, 5, 4, 5, 1 ] ), \n Transformat\ ion( [ 3, 1, 5, 1, 2 ] ), \n Transformation( [ 3, 5, 5, 1, 2 ] ), \n Transfo\ rmation( [ 4, 1, 1, 2, 3 ] ), \n Transformation( [ 4, 2, 1, 2, 3 ] ), \n Tra\ nsformation( [ 5, 2, 2, 3, 4 ] ), \n Transformation( [ 5, 3, 2, 3, 4 ] ) ]\n]\ ]>\n \n\n\n \n \n \n \n \n \n \n \n \n true or false.\n \n IsDigraphHomomorphism returns true if the permutation\n\ or transformation x is a homomorphism from the digraph\n src<\ /A> to the digraph ran.\n \n\n IsDigraphEpimorphism re\ turns true if the permutation\n or transformation x is a surj\ ective homomorphism from the digraph\n src to the digraph ran\ .\n \n\n IsDigraphMonomorphism returns true if the per\ mutation\n or transformation x is an injective homomorphism from the\ digraph\n src to the digraph ran.\n \n\n IsDigr\ aphEndomorphism returns true if the permutation\n or transformat\ ion x is an endomorphism of the digraph\n digraph.\n \ \n\n A permutation or transformation x is a homomorphism from\ a\n digraph src to a digraph ran if the following hold:\n \ \n \n [u ^ x, v ^ x] is an edge \ of\n ran whenever [u, v] is an\n edge of src; and \n \n x fixes every i which is n\ ot a vertex of src.\n \n \n See also . \n\n\n If col1 and col2\ , or col, are given, then they must\n represent vertex colouring\ s; see \n \n for details of the permissible values for these argument\ . The\n homomorphism must then also have the property:\n \n \n \ \n col[i] = col[i ^ x] for all vertices i of \ digraph,\n in the case of IsDigraphEndomorphism.\n \ \n col1[i] = col2[i ^ x] for all vertices i of <\ A>src,\n in the cases of the other operations.\n \ \n\n See also .\n \n src := Digraph([[1], [1, 2], [1, 3]]);\n\ngap> ran := Digraph([[1], [1, 2]]);\n\ngap> IsDigraphHomomorphism(src, ran, Transforma\ tion([1, 2, 2]));\ntrue\ngap> IsDigraphHomomorphism(src, ran, Transformation([\ 2, 1, 2]));\nfalse\ngap> IsDigraphHomomorphism(src, ran, Transformation([3, 3,\ 3]));\nfalse\ngap> IsDigraphHomomorphism(src, src, Transformation([3, 3, 3]))\ ;\ntrue\ngap> IsDigraphHomomorphism(src, ran, Transformation([1, 2, 2]),\n> \ [1, 2, 2], [1, 2]);\ntrue\ngap> IsDigraphHomomorphism(s\ rc, ran, Transformation([1, 2, 2]),\n> [2, 1, 1], [1,\ 2]);\nfalse\ngap> IsDigraphEndomorphism(src, Transformation([3, 3, 3]));\ntru\ e\ngap> IsDigraphEndomorphism(src, Transformation([3, 3, 3]), [1, 1, 1]);\ntru\ e\ngap> IsDigraphEndomorphism(src, Transformation([3, 3, 3]), [1, 1, 2]);\nfal\ se\ngap> IsDigraphEpimorphism(src, ran, Transformation([3, 3, 3]));\nfalse\nga\ p> IsDigraphMonomorphism(src, ran, Transformation([1, 2, 2]));\nfalse\ngap> Is\ DigraphEpimorphism(src, ran, Transformation([1, 2, 2]));\ntrue\ngap> IsDigraph\ Monomorphism(ran, src, ());\ntrue]]>\n \n\n\n \n \n \n true or false.\n \n IsDigraphEmbeddi\ ng returns true if the permutation\n or transformation x \ is a embedding of the digraph\n src into the digraph ran, whi\ le respecting the colourings\n col1 and col2 if given.\n <\ P/>\n\n A permutation or transformation x is a embedding of a\ digraph\n src into a digraph ran if x is a monomorphi\ sm from\n src to ran and the inverse of x is a monomor\ phism from\n the subdigraph of ran induced by the image of x \ to\n src.\n\n See also . \ \n\n src := Digraph([[1], [1, 2]]);\n\ngap> ran := Digraph([[1], [1, 2], [1, 3]]);\n\ \ngap> IsDigraphMonomorphism(src, \ ran, ());\ntrue\ngap> IsDigraphEmbedding(src, ran, ());\ntrue\ngap> IsDigraphE\ mbedding(src, ran, (), [2, 1], [2, 1, 1]);\ntrue\ngap> IsDigraphEmbedding(src,\ ran, (), [2, 1], [1, 2, 1]);\nfalse\ngap> ran := Digraph([[1, 2], [1, 2], [1,\ 3]]);\n\ngap> IsDigraphMonomorphi\ sm(src, ran, IdentityTransformation);\ntrue\ngap> IsDigraphEmbedding(src, ran,\ IdentityTransformation);\nfalse]]>\n \n\ \n\n \n \n true or false. \n \n The operation DigraphsRespectsColouring ver\ ifies whether or not \n the permutation or transformation x respec\ ts the vertex colourings\n col1 and col2 of the digraphs src and range.\n That is, DigraphsRespectsColouring re\ turns true if and only if for\n all vertices i of src, col1[i] = col2[i ^ x].\n \n\n \ src := Digraph([[1], [1, 2]]);\n\ \ngap> ran := Digraph([[1], [1, 2], [1, 3]]);\n\ngap> DigraphsRespectsColouring(src, ran, (1, 2), [2, 1], [1, 2,\ 1]);\ntrue\ngap> DigraphsRespectsColouring(src, ran, (1, 2), [2, 1], [2, 1, 1\ ]);\nfalse\n]]>\n \n \n\n \n \n \n A list of transformations.\n \n \ An endomorphism of digraph is a homomorphism\n from digraph back to itself.\n\n GeneratorsOfEndom\ orphismMonoid, called with a single argument,\n returns a generating se\ t for the monoid of all endomorphisms of\n digraph. If digraph belongs to , then the value of\n \ GeneratorsOfEndomorphismMonoid will not be recomputed on future\n \ calls. \n\n If the colors argument is specified, then\n Gen\ eratorsOfEndomorphismMonoid will return a generating\n set for the mono\ id of endomorphisms which respect the given colouring.\n The colouring c\ olors can be in one of two forms: \n\n \n \n \ A list of positive integers of size the number of vertices of\n di\ graph, where colors[i] is the colour of vertex\n i\ .\n \n \n A list of lists, such that colo\ rs[i] is a list of all\n vertices with colour i.\n \ \n \n\n If the limit argument is specified, then\ it will return only the\n first limit homomorphisms, where limit\ must be a positive\n integer or infinity. \n\n \ gr := Digraph(List([1 .. 3], x -> [1 .. 3]));;\ngap> Generator\ sOfEndomorphismMonoid(gr);\n[ Transformation( [ 1, 3, 2 ] ), Transformation( [\ 2, 1 ] ), \n IdentityTransformation, Transformation( [ 1, 2, 1 ] ), \n Tran\ sformation( [ 1, 2, 2 ] ), Transformation( [ 1, 1, 2 ] ), \n Transformation( \ [ 1, 1, 1 ] ) ]\ngap> GeneratorsOfEndomorphismMonoid(gr, 3);\n[ Transformation\ ( [ 1, 3, 2 ] ), Transformation( [ 2, 1 ] ), \n IdentityTransformation ]\ngap\ > gr := CompleteDigraph(3);;\ngap> GeneratorsOfEndomorphismMonoid(gr);\n[ Tran\ sformation( [ 2, 3, 1 ] ), Transformation( [ 2, 1 ] ), \n IdentityTransformat\ ion ]\ngap> GeneratorsOfEndomorphismMonoid(gr, [1, 2, 2]);\n[ Transformation( \ [ 1, 3, 2 ] ), IdentityTransformation ]\ngap> GeneratorsOfEndomorphismMonoid(g\ r, [[1], [2, 3]]);\n[ Transformation( [ 1, 3, 2 ] ), IdentityTransformation ]\ \n]]>\n \n\n\n \n \n A transformation, or fail.\ \n \n A proper colouring of a digraph is a labelling o\ f its vertices in\n such a way that adjacent vertices have different labels\ . A proper\n n-colouring is a proper colouring that uses ex\ actly n\n colours. Equivalently, a proper (n-)colouring of a\ digraph can be\n defined to be a from a\ digraph onto the\n complete digraph (with n vertices); see . Note that a digraph with loops () does not have a proper n-colouring for\n \ any value n.\n \n\n If digraph is a digraph and n is a non-negative integer, then\n DigraphColouring(digraph, n) returns an epimorphism\n from digraph onto the complete \ digraph with n vertices if one\n exists, else it returns fail\ . \n\n See also and \n \n\n Note that a digraph with at least two vertices h\ as a 2-colouring if and only\n if it is bipartite, see .\n\n DigraphColouring(CompleteDigra\ ph(5), 4);\nfail\ngap> DigraphColouring(ChainDigraph(10), 1);\nfail\ngap> D :=\ ChainDigraph(10);;\ngap> t := DigraphColouring(D, 2);\nTransformation( [ 1, 2\ , 1, 2, 1, 2, 1, 2, 1, 2 ] )\ngap> IsDigraphColouring(D, t); \ntrue\ngap> Digr\ aphGreedyColouring(D);\nTransformation( [ 2, 1, 2, 1, 2, 1, 2, 1, 2, 1 ] )\n]]\ >\n \n\n\n \n \n \n \n A transformation, or \ fail.\n \n A proper colouring of a digra\ ph is a labelling of its vertices in\n such a way that adjacent vertices ha\ ve different labels. Note that a digraph \n with loops () does not have any proper \n colouring.\n \n \n I\ f digraph is a digraph and order is a dense list consisting \n \ of all of the vertices of digraph (in any order), then \n Digr\ aphGreedyColouring\n uses a greedy algorithm with the specified order t\ o obtain some proper\n colouring of digraph, which may not use the m\ inimal number of\n colours. \n \n If digraph is a digraph \ and func is a function whose argument \n is a digraph, and that retu\ rns a dense list order, then \n DigraphGreedyColouring(digraph\ , func) returns\n DigraphGreedyColouring(digraph, \ func(digraph)).\n \n\n If the optional second argu\ ment (either a list or a function), is not \n specified, then is used by default. \n \n \n See also\ \n .\n \n\n DigraphGreedyCo\ louring(ChainDigraph(10));\nTransformation( [ 2, 1, 2, 1, 2, 1, 2, 1, 2, 1 ] )\ \ngap> DigraphGreedyColouring(ChainDigraph(10), [1 .. 10]);\nTransformation( [\ 1, 2, 1, 2, 1, 2, 1, 2, 1, 2 ] )\n]]>\n \n\n\n \n \n A list of the vertices.\n \n \ DigraphWelshPowellOrder returns a list of all of the vertices of \n the\ digraph digraph ordered according to the sum of the number of \n ou\ t- and in-neighbours, from highest to lowest. \n \n\n DigraphWelshPowellOrder(Digraph([[4], [9], [9], [], \n> \ [4, 6, 9], [1], [], [], \n> \ [4, 5], [4, 5]]));\n[ 5, 9, 4, 1, 6, 10, 2, 3, 7, 8 ]\n]]>\n \n\n\n \n \n A non-negative integer.\n \ \n A proper colouring of a digraph is a labelling of i\ ts\n vertices in such a way that adjacent vertices have different labels.\n\ Equivalently, a proper digraph colouring can be defined to be a from a digraph onto a complete digraph. \n\ \n If digraph is a digraph without loops (see , then ChromaticNumber returns the least\n non-negat\ ive integer n such that there is a proper colouring of\n digraph<\ /A> with n colours. In other words, for a digraph with at\n least o\ ne vertex, ChromaticNumber returns the least number n\n such \ that DigraphColouring(digraph, n) does not return\n fail. See .\n\n ChromaticNumber(NullDigraph\ (10));\n1\ngap> ChromaticNumber(CompleteDigraph(10));\n10\ngap> ChromaticNumbe\ r(CompleteBipartiteDigraph(5, 5));\n2\ngap> ChromaticNumber(Digraph([[], [3], \ [5], [2, 3], [4]]));\n3\ngap> ChromaticNumber(NullDigraph(0));\n0\ngap> D := P\ etersenGraph(IsMutableDigraph);\n\ \ngap> ChromaticNumber(D);\n3\n]]>\n \n\ \n\n \n \n A list of positive integers.\n \n If \ D is a digraph, then DigraphCore returns a list of vertices\n \ corresponding to the core of D. In particular, the subdigraph\n \ of D induced by this list is isomorphic to the core of D.\n\n The core of a digraph D is the minimal subdigraph C\ of\n D which is a homomorphic image of D. The core of a \ digraph \n is unique up to isomorphism.\n D :\ = DigraphSymmetricClosure(CycleDigraph(8));\n\ngap> DigraphCore(D);\n[ 1, 2 ]\ngap> D := PetersenGrap\ h();\n\ngap> DigraphCore(D);\n[ \ 1 .. 10 ]\ngap> D := Digraph(IsMutableDigraph, [[3], [3], [4], [5], [2]]);\n\ngap> DigraphCore(D);\n[ 2, 3, 4, 5 ]\ \n]]>\n \n \n\n \n\n\n \n \n Finding cliques and independent sets\n\n \ In &Digraphs;, a clique of a digraph is a set of mutually adjacent\n \ vertices of the digraph, and an independent set is a set of mutually\n\ non-adjacent vertices of the digraph. A maximal clique is a clique\ \n which is not properly contained in another clique, and a maximal\n \ independent set is an independent set which is not properly contained\n\ in another independent set. Using this definition in &Digraphs;, cliques\ \n and independent sets are both permitted, but not required, to contain ve\ rtices\n at which there is a loop. Another name for a clique is a compl\ ete\n subgraph.\n \n\n &Digraphs; provides extensive functi\ onality for computing cliques and\n independent sets of a digraph, whether \ maximal or not. The fundamental\n algorithm used in most of the methods in\ &Digraphs; to calculate cliques\n and independent sets is a version of the\ Bron-Kerbosch algorithm.\n Calculating the cliques and independent sets of\ a digraph is a well-known\n and hard problem, and searching for cliques or\ independent sets in a\n digraph can be very lengthy, even for a digraph wi\ th a small number of\n vertices. &Digraphs; uses several strategies to inc\ rease the performance\n of these calculations.\n \n\n From the de\ finition of cliques and independent sets, it follows that the\n presence of\ loops and multiple edges in a digraph is irrelevant to the\n existence of \ cliques and independent sets in the digraph. See and for more\n information about \ these properties. Therefore given a digraph\n digraph, the cliques \ and independent sets of digraph are\n equal to the cliques and indep\ endent sets of the digraph:\n\n \n \n DigraphRem\ oveLoops(DigraphRemoveAllMultipleEdges(digraph)).\n \n \n\n See and for more information about these\n \ attributes. Furthermore, the cliques of this digraph are equal to the\n \ cliques of the digraph formed by removing any edge [u,v] for which\n \ the corresponding reverse edge [v,u] is not present. Therefore,\n \ overall, the cliques of digraph are equal to the cliques of the\n s\ ymmetric digraph:\n\n \n \n MaximalSymmetricSubd\ igraphWithoutLoops(digraph).\n \n \n\n\ See for more\n i\ nformation about this. The of this symmetric digraph contains the\n automorphism group \ of digraph as a subgroup. By performing the\n search for maximal cl\ iques with the help of this larger automorphism group\n to reduce the searc\ h space, the computation time may be reduced. The\n functions and attribut\ es which return representatives of cliques of\n digraph will return \ orbit representatives of cliques under the\n action of the automorphism gro\ up of the maximal symmetric subdigraph\n without loops on sets of \ vertices. \n\n The independent sets of a digraph are equal to the indepe\ ndent sets of the\n . Therefore, ov\ erall, the independent\n sets of digraph are equal to the independen\ t sets of the symmetric\n digraph:\n\n \n \n \ DigraphSymmetricClosure(DigraphRemoveLoops(DigraphRemoveAllMultipleEdges(\n \ digraph))).\n \n \n\n Again, t\ he automorphism group of this symmetric digraph contains the\n automorphism\ group of digraph. Since a search for independent sets\n is equal to\ a search for cliques in the , the\n methods use\ d in &Digraphs; usually transform a search for independent sets\n into a se\ arch for cliques, as described above. The functions and\n attributes which\ return representatives of independent sets of\n digraph will return\ orbit representatives of independent sets under\n the action of the automo\ rphism group of the symmetric closure of the\n digraph formed by rem\ oving loops and multiple edges. \n\n Please note that in &Digraphs;, cli\ ques and independent sets are not\n required to be maximal. Some authors us\ e the word clique to mean\n maximal clique, and some authors use the\ phrase independent set to\n mean maximal independent set, but pleas\ e note that &Digraphs; does\n not use this definition.\n \n\n Finding cliques\n \n\n\ \ntrue or false.\n\n If digr\ aph is a digraph and l is a duplicate-free list of\n vertices of <\ A>digraph, then\n IsClique(digraph,l) \ returns true\n if l is a clique of digraph and \ false if it is\n not. Similarly,\n IsMaximalClique(dig\ raph,l) returns\n true if l is a \ maximal clique of digraph and\n false if it is not. \ \n\n A clique of a digraph is a set of mutually adjacent vertices of\ the\n digraph. A maximal clique is a clique that is not properly\n \ contained in another clique. A clique is permitted, but not required, to\n \ contain vertices at which there is a loop.\n D \ := CompleteDigraph(4);;\ngap> IsClique(D, [1, 3, 2]);\ntrue\ngap> IsMaximalCli\ que(D, [1, 3, 2]);\nfalse\ngap> IsMaximalClique(D, DigraphVertices(D));\ntrue\ \ngap> D := Digraph([[1, 2, 4, 4], [1, 3, 4], [2, 1], [1, 2]]);\n\ngap> IsClique(D, [2, 3, 4]);\nfalse\nga\ p> IsMaximalClique(D, [1, 2, 4]);\ntrue\ngap> D := CompleteDigraph(IsMutableDi\ graph, 4);;\ngap> IsClique(D, [1, 3, 2]);\ntrue]]>\n \ \n\n\n \n \n The argument user_param.\n \n This fu\ nction finds cliques of the digraph digraph subject to the\n conditi\ ons imposed by the other arguments as described below. Note\n that a clique\ is represented by the immutable list of the vertices that\n it contains.\n\ \n\n Let G denote the automorphism group of the maximal symm\ etric\n subdigraph of digraph without loops (see and ).\n\n \n hook\n \n This argument should be a function or fail.<\ P/>\n\n If hook is a function, then it should have two arguments\ \n user_param (see below) and a clique c. The function\n \ hook(user_param, c) is called every time a new\n \ clique c is found by CliquesFinder. \n\n If h\ ook is fail, then a default function is used that\n simply a\ dds every new clique found by CliquesFinder to\n user_param, which must be a list in this case.\n \n\n user_p\ aram\n \n If hook is a function, then u\ ser_param can be any &GAP;\n object. The object user_param i\ s used as the first argument for\n the function hook. For exampl\ e, user_param might be a\n list, and hook(user_para\ m, c) might add the size\n of the clique c to the list <\ A>user_param. \n\n If the value of hook is fail, \ then the value of\n user_param must be a list.\n \n\ \n limit\n \n This argument should \ be a positive integer or infinity.\n CliquesFinder will r\ eturn after it has found\n limit cliques or the search is comple\ te.\n \n\n include and exclude\n \ \n These arguments should each be a (possibly empty) duplicat\ e-free list\n of vertices of digraph (i.e. positive integers les\ s than the\n number of vertices of digraph). \n\n \ CliquesFinder will only look for cliques containing all of the\n ve\ rtices in include and containing none of the vertices in\n ex\ clude. \n\n Note that the search may be much more efficient if \ each of these lists\n is invariant under the action of G on sets\ of vertices.\n \n\n max\n \n \ This argument should be true or false. If max is\ \n true then CliquesFinder will only search for maximal\n\ cliques. If max is false then non-maximal cliques may be\ \n found.\n \n\n size\n \n This argument should be fail or a positive integer.\n \ If size is a positive integer then CliquesFinder will\n \ only search for cliques that contain precisely size vertices.\n \ If size is fail then cliques of any size may be found.\n \n\n reps\n \n This argument s\ hould be true or false. \n\n If reps is true\ then the arguments include and\n exclude are each re\ quired to be invariant under the action of\n G on sets of vertic\ es. In this case, CliquesFinder will\n find representatives of \ the orbits of the desired cliques under the\n action of G, al\ though representatives may be returned that\n are in the same orbit.\n If reps is false then CliquesFinder will not take t\ his into\n consideration. \n\n For a digraph such that G is non-trivial, the search for\n clique representatives can be much \ more efficient than the search for\n all cliques.\n \n <\ /List>\n\n This function uses a version of the Bron-Kerbosch algorithm.\n \ D := CompleteDigraph(5);\n\ngap> user_param := [];;\ngap> f := function(a, b) # Calc\ ulate size of clique\n> AddSet(user_param, Size(b));\n> end;;\ngap> CliquesF\ inder(D, f, user_param, infinity, [], [], false, fail,\n> tru\ e);\n[ 1, 2, 3, 4, 5 ]\ngap> CliquesFinder(D, fail, [], 5, [2, 4], [3], false,\ fail, false);\n[ [ 2, 4 ], [ 1, 2, 4 ], [ 2, 4, 5 ], [ 1, 2, 4, 5 ] ]\ngap> C\ liquesFinder(D, fail, [], 2, [2, 4], [3], false, fail, false);\n[ [ 2, 4 ], [ \ 1, 2, 4 ] ]\ngap> CliquesFinder(D, fail, [], infinity, [], [], true, 5, false)\ ;\n[ [ 1, 2, 3, 4, 5 ] ]\ngap> CliquesFinder(D, fail, [], infinity, [1, 3], []\ , false, 3, false);\n[ [ 1, 2, 3 ], [ 1, 3, 4 ], [ 1, 3, 5 ] ]\ngap> CliquesFi\ nder(D, fail, [], infinity, [1, 3], [], true, 3, false);\n[ ]\ngap> D := Comp\ leteDigraph(IsMutableDigraph, 5);\n\ \ngap> user_param := [];;\ngap> f := function(a, b) # Calculate size of cliqu\ e\n> AddSet(user_param, Size(b));\n> end;;\ngap> CliquesFinder(D, f, user_pa\ ram, infinity, [], [], false, fail,\n> true);\n[ 1, 2, 3, 4, \ 5 ]\ngap> CliquesFinder(D, fail, [], 5, [2, 4], [3], false, fail, false);\n[ [\ 2, 4 ], [ 1, 2, 4 ], [ 2, 4, 5 ], [ 1, 2, 4, 5 ] ]\ngap> CliquesFinder(D, fai\ l, [], 2, [2, 4], [3], false, fail, false);\n[ [ 2, 4 ], [ 1, 2, 4 ] ]\ngap> C\ liquesFinder(D, fail, [], infinity, [], [], true, 5, false);\n[ [ 1, 2, 3, 4, \ 5 ] ]\ngap> CliquesFinder(D, fail, [], infinity, [1, 3], [], false, 3, false);\ \n[ [ 1, 2, 3 ], [ 1, 3, 4 ], [ 1, 3, 5 ] ]\ngap> CliquesFinder(D, fail, [], i\ nfinity, [1, 3], [], true, 3, false);\n[ ]]]>\n \n\n\n \n \n \n An immutable list\ of positive integers, or fail.\n \n If d\ igraph is a digraph, then these functions returns a clique\n of digr\ aph if one exists that satisfies the arguments, else it\n returns fa\ il. A clique is defined by the set of vertices that it\n contains; see\ and . \n\n The \ optional arguments include and exclude must each be a\n (poss\ ibly empty) duplicate-free list of vertices of digraph, and\n the op\ tional argument size must be a positive integer. By default,\n i\ nclude and exclude are empty. These functions will search for\n \ a clique of digraph that includes the vertices of include\n b\ ut does not include any vertices in exclude; if the argument\n si\ ze is supplied, then additionally the clique will be required to\n cont\ ain precisely size vertices. \n\n If include is not a cliq\ ue, then these functions return fail.\n Otherwise, the functions beh\ ave in the following way, depending on the\n number of arguments:\n\n \n One or two arguments\n \n If one or\ two arguments are supplied, then DigraphClique and\n Digraph\ MaximalClique greedily enlarge the clique include\n until it\ can not continue. The result is guaranteed to be a maximal\n clique. \ This may or may not return an answer more quickly than using\n . with a limit of 1.\n \n Three arguments\n \n If three arguments are supplied\ , then DigraphClique greedily\n enlarges the clique include until it can not continue, although\n this clique may not be maximal\ . \n\n Given three arguments, DigraphMaximalClique returns th\ e maximal\n clique returned by DigraphMaximalCliques(digraph<\ /A>,\n include, exclude, 1) if one e\ xists,\n else fail.\n \n Four arguments\n \n If four arguments are supplied, then DigraphCl\ ique returns the\n clique returned by DigraphCliques(digr\ aph,\n include, exclude, 1,\n \ size) if one exists, else fail. This clique may\n \ not be maximal. Given four arguments, DigraphMaximalClique\n\ returns the maximal clique returned by\n DigraphMaximalCliqu\ es(digraph, include,\n exclude, 1, size) if one exists, else\n fail.\n \ \n \n\n D := Digraph([[2, 3, 4],\ [1, 3], [1, 2], [1, 5], []]);\n\n\ gap> IsSymmetricDigraph(D);\nfalse\ngap> DigraphClique(D);\n[ 5 ]\ngap> Digrap\ hMaximalClique(D);\n[ 5 ]\ngap> DigraphClique(D, [1, 2]);\n[ 1, 2, 3 ]\ngap> D\ igraphMaximalClique(D, [1, 3]);\n[ 1, 3, 2 ]\ngap> DigraphClique(D, [1], [2]);\ \n[ 1, 4 ]\ngap> DigraphMaximalClique(D, [1], [3, 4]);\nfail\ngap> DigraphCliq\ ue(D, [1, 5]);\nfail\ngap> DigraphClique(D, [], [], 2);\n[ 1, 2 ]\ngap> D := D\ igraph(IsMutableDigraph,\n> [[2, 3, 4], [1, 3], [1, 2], [1, 5]\ , []]);\n\ngap> IsSymmetricDigraph(D\ );\nfalse\ngap> DigraphClique(D);\n[ 5 ]]]>\n \n\n\n \n \n \n \ \n \n \n \n An immutable list of lists of positive integers.\n \n If digraph is digraph, then these functions and\ attributes use to return cliques of d\ igraph. A\n clique is defined by the set of vertices that it contains; \ see and . \n\ \n The optional arguments include and exclude must each be a\ \n (possibly empty) list of vertices of digraph, the optional argume\ nt\n limit must be either a positive integer or infinity, and\ the\n optional argument size must be a positive integer. If not\n \ specified, then include and exclude are chosen to be empty\n \ lists, and limit is set to infinity. \n\n The function\ s will return as many suitable cliques as possible, up to the\n number l\ imit. These functions will find cliques that contain all\n of the vert\ ices of include but do not contain any of the\n vertices of exclu\ de. The argument size restricts the search\n to those cliques t\ hat contain precisely size vertices.\n If the function or attribute \ has Maximal in its name, then only\n maximal cliques will be returne\ d; otherwise non-maximal cliques may be\n returned. \n\n Let G denote the automorphism group of maximal symmetric subdigraph\n of dig\ raph without loops (see and ).\n\n \n Distinct cliques\n \n \ DigraphMaximalCliques and DigraphCliques each return a\n \ duplicate-free list of at most limit cliques of digraph\n \ that satisfy the arguments. \n\n The computation may be significan\ tly faster if include and\n exclude are invariant under t\ he action of G\n on sets of vertices.\n \n\n Orbit representatives of cliques\n \n To use D\ igraphMaximalCliquesReps or DigraphCliquesReps,\n the argume\ nts include and exclude must each be invariant\n under th\ e action of G on sets of vertices. \n\n If this is the case, \ then DigraphMaximalCliquesReps and\n DigraphCliquesReps e\ ach return a duplicate-free list of at most\n limit orbits repre\ sentatives (under the action of G on\n sets vertices) of cliques\ of digraph that satisfy the\n arguments. \n\n The rep\ resentatives are not guaranteed to be in distinct orbits.\n However, if\ fewer than lim results are returned, then there\n will be at le\ ast one representative from each orbit of maximal cliques.\n \n \ \n\n D := Digraph([\n> [2, 3], [1, 3], [1,\ 2, 4], [3, 5, 6], [4, 6], [4, 5]]);\n\ngap> IsSymmetricDigraph(D);\ntrue\ngap> G := AutomorphismGroup(D);\nGro\ up([ (5,6), (1,2), (1,5)(2,6)(3,4) ])\ngap> DigraphMaximalCliques(D);\n[ [ 1, \ 2, 3 ], [ 4, 5, 6 ], [ 3, 4 ] ]\ngap> DigraphMaximalCliquesReps(D);\n[ [ 1, 2,\ 3 ], [ 3, 4 ] ]\ngap> Orbit(G, [1, 2, 3], OnSets);\n[ [ 1, 2, 3 ], [ 4, 5, 6 \ ] ]\ngap> Orbit(G, [3, 4], OnSets);\n[ [ 3, 4 ] ]\ngap> DigraphMaximalCliquesR\ eps(D, [3, 4], [], 1);\n[ [ 3, 4 ] ]\ngap> DigraphMaximalCliques(D, [1, 2], [5\ , 6], 1, 2);\n[ ]\ngap> DigraphCliques(D, [1], [5, 6], infinity, 2);\n[ [ 1, \ 2 ], [ 1, 3 ] ]\ngap> D := Digraph(IsMutableDigraph, [\n> [2, 3], [1, 3], [1, \ 2, 4], [3, 5, 6], [4, 6], [4, 5]]);\n\ngap> IsSymmetricDigraph(D);\ntrue\ngap> G := AutomorphismGroup(D);\nGroup(\ [ (5,6), (1,2), (1,5)(2,6)(3,4) ])\ngap> DigraphMaximalCliques(D);\n[ [ 1, 2, \ 3 ], [ 4, 5, 6 ], [ 3, 4 ] ]]]>\n \n\n\n\ \n \n \ A non-negative integer.\n \n If digraph is a\ digraph, then CliqueNumber(digraph)\n returns the largest in\ teger n such that digraph contains a\n clique with n v\ ertices as an induced subdigraph.\n \n\n A clique of a digrap\ h is a set of mutually adjacent vertices of the\n digraph. Loops and multip\ le edges are ignored for the purpose of\n determining the clique number of \ a digraph. \n D := CompleteDigraph(4);;\ngap> Cliq\ ueNumber(D);\n4\ngap> D := Digraph([[1, 2, 4, 4], [1, 3, 4], [2, 1], [1, 2]]);\ \n\ngap> CliqueNumber(D);\n3\ \ngap> D := CompleteDigraph(IsMutableDigraph, 4);;\ngap> CliqueNumber(D);\n4]]\ >\n\n\n\n \n\n Finding independent sets\n \n \n \n true or false.\n \n If digraph is a digraph and l is a duplicate-free\ list of\n vertices of digraph, then\n IsIndependentSet(digraph,l) returns\n true if l is a\ n independent set of digraph and\n false if it is not.\ Similarly,\n IsMaximalIndependentSet(digraph,l)\n returns true if l is a maximal independent set\ of\n digraph and false if it is not. \n\n An \ independent set of a digraph is a set of mutually non-adjacent\n vertic\ es of the digraph. A maximal independent set is an independent\n set\ that is not properly contained in another independent set. An\n independen\ t set is permitted, but not required, to contain vertices at\n which there \ is a loop.\n D := CycleDigraph(4);;\ngap> IsIndepe\ ndentSet(D, [1]);\ntrue\ngap> IsMaximalIndependentSet(D, [1]);\nfalse\ngap> Is\ IndependentSet(D, [1, 4, 3]);\nfalse\ngap> IsIndependentSet(D, [2, 4]);\ntrue\ \ngap> IsMaximalIndependentSet(D, [2, 4]);\ntrue\ngap> D := CycleDigraph(IsMut\ ableDigraph, 4);;\ngap> IsIndependentSet(D, [1]);\ntrue]]>\n \n\n\n \n \n \n An immutable list of positive integers, or fail.\n \n If digraph is a digraph, then these funct\ ions returns an independent\n set of digraph if one exists that sati\ sfies the arguments, else it\n returns fail. An independent set is \ defined by the set of vertices\n that it contains; see and . \n\n Th\ e optional arguments include and exclude must each be a\n (po\ ssibly empty) duplicate-free list of vertices of digraph, and the\n \ optional argument size must be a positive integer. By default,\n include and exclude are empty. These functions will search\n fo\ r an independent set of digraph that includes the vertices of\n i\ nclude but does not include any vertices in exclude;\n if the ar\ gument size is supplied, then additionally the independent\n set wil\ l be required to contain precisely size vertices. \n\n If incl\ ude is not an independent set, then these functions return\n fail. Otherwise, the functions behave in the following way,\n depending on th\ e number of arguments:\n\n \n One or two arguments\ \n \n If one or two arguments are supplied, then DigraphI\ ndependentSet\n and DigraphMaximalIndependentSet greedily en\ large the\n independent set include until it can not continue. \ The result\n is guaranteed to be a maximal independent set. This may or\ may not\n return an answer more quickly than using . with a limit of 1.\n \n \ Three arguments\n \n If three arguments are \ supplied, then DigraphIndependentSet\n greedily enlarges the ind\ ependent set include until it can not\n continue, although this \ independent set may not be maximal. \n\n Given three arguments, D\ igraphMaximalIndependentSet returns the\n maximal independent set r\ eturned by\n DigraphMaximalIndependentSets(digraph,\n \ include, exclude, 1) if one exists,\n \ else fail.\n \n Four arguments\n \ \n If four arguments are supplied, then DigraphIndependentS\ et\n returns the independent set returned by\n DigraphInd\ ependentSets(digraph, include,\n exc\ lude, 1, size) if one exists, else\n fail. This independent set may not be maximal. Given four\n arguments\ , DigraphMaximalIndependentSet returns the maximal\n independent\ set returned by\n DigraphMaximalIndependentSets(digraph<\ C>,\n include, exclude, 1,\n <\ A>size) if one exists, else fail.\n \n \n D := ChainDigraph(6);\n\ngap> DigraphIndependentSet(D);\n[ 6, 4, 2 ]\ngap> DigraphM\ aximalIndependentSet(D);\n[ 6, 4, 2 ]\ngap> DigraphIndependentSet(D, [2, 4]);\ \n[ 2, 4, 6 ]\ngap> DigraphMaximalIndependentSet(D, [1, 3]);\n[ 1, 3, 6 ]\ngap\ > DigraphIndependentSet(D, [2, 4], [6]);\n[ 2, 4 ]\ngap> DigraphMaximalIndepen\ dentSet(D, [2, 4], [6]);\nfail\ngap> DigraphIndependentSet(D, [1], [], 2);\n[ \ 1, 3 ]\ngap> DigraphMaximalIndependentSet(D, [1], [], 2);\nfail\ngap> DigraphM\ aximalIndependentSet(D, [1], [], 3);\n[ 1, 3, 5 ]\ngap> D := ChainDigraph(IsMu\ tableDigraph, 6);\n\ngap> DigraphInd\ ependentSet(D);\n[ 6, 4, 2 ]\ngap> DigraphMaximalIndependentSet(D);\n[ 6, 4, 2\ ]\ngap> DigraphIndependentSet(D, [2, 4]);\n[ 2, 4, 6 ]\ngap> DigraphMaximalIn\ dependentSet(D, [1, 3]);\n[ 1, 3, 6 ]\ngap> DigraphIndependentSet(D, [2, 4], [\ 6]);\n[ 2, 4 ]\ngap> DigraphMaximalIndependentSet(D, [2, 4], [6]);\nfail\ngap>\ DigraphIndependentSet(D, [1], [], 2);\n[ 1, 3 ]\ngap> DigraphMaximalIndepende\ ntSet(D, [1], [], 2);\nfail\ngap> DigraphMaximalIndependentSet(D, [1], [], 3);\ \n[ 1, 3, 5 ]]]>\n \n\n\n \n \n \n \n \n \n \n An immutable list of lists of po\ sitive integers.\n \n If digraph is digraph,\ then these functions and attributes use \ to return independent sets of digraph. An\n independent set is defin\ ed by the set of vertices that it contains; see\n and . \n\n The opt\ ional arguments include and exclude must each be a\n (possibl\ y empty) list of vertices of digraph, the optional argument\n lim\ it must be either a positive integer or infinity, and the\n opti\ onal argument size must be a positive integer. If not\n specified, \ then include and exclude are chosen to be empty\n lists, and \ limit is set to infinity. \n\n The functions will return \ as many suitable independent sets as possible, up\n to the number limit<\ /A>. These functions will find independent sets\n that contain all of the \ vertices of include but do not\n contain any of the vertices of e\ xclude The argument size\n restricts the search to those cliques\ that contain precisely size\n vertices. If the function or attribu\ te has Maximal in its name,\n then only maximal independent sets wil\ l be returned; otherwise non-maximal\n independent sets may be returned.\n \ \n\n Let G denote the \n of the of the\ digraph formed from\n digraph by removing loops and ignoring the mu\ ltiplicity of edges.\n\n \n Distinct independent sets\n \n DigraphMaximalIndependentSets and DigraphI\ ndependentSets\n each return a duplicate-free list of at most li\ mit independent\n sets of digraph that satisfy the arguments\ . \n\n The computation may be significantly faster if include\ and\n exclude are invariant under the action of G on set\ s of\n vertices.\n \n\n Representatives of disti\ nct orbits of independent sets\n \n To use Digraph\ MaximalIndependentSetsReps or\n DigraphIndependentSetsReps, \ the arguments include and\n exclude must each be invarian\ t under the action of G on\n sets of vertices. \n\n If\ this is the case, then DigraphMaximalIndependentSetsReps and\n \ DigraphIndependentSetsReps each return a list of\n at most li\ mit orbits representatives (under the action of\n G on sets \ of vertices) of independent sets of digraph\n that satisfy the a\ rguments. \n\n The representatives are not guaranteed to be in dist\ inct orbits.\n However, if lim is not specified, or fewer than <\ A>lim\n results are returned, then there will be at least one repre\ sentative\n from each orbit of maximal independent sets.\n \ \n \n\n D := CycleDigraph(5);\n\ngap> DigraphMaximalIndependentSetsReps(D);\n\ [ [ 1, 3 ] ]\ngap> DigraphIndependentSetsReps(D);\n[ [ 1 ], [ 1, 3 ] ]\ngap> S\ et(DigraphMaximalIndependentSets(D));\n[ [ 1, 3 ], [ 1, 4 ], [ 2, 4 ], [ 2, 5 \ ], [ 3, 5 ] ]\ngap> DigraphMaximalIndependentSets(D, [1]);\n[ [ 1, 3 ], [ 1, 4\ ] ]\ngap> DigraphIndependentSets(D, [], [4, 5]);\n[ [ 1 ], [ 2 ], [ 3 ], [ 1,\ 3 ] ]\ngap> DigraphIndependentSets(D, [], [4, 5], 1, 2);\n[ [ 1, 3 ] ]\ngap> \ D := CycleDigraph(IsMutableDigraph, 5);\n\ngap> DigraphMaximalIndependentSetsReps(D);\n[ [ 1, 3 ] ]\ngap> DigraphI\ ndependentSetsReps(D);\n[ [ 1 ], [ 1, 3 ] ]\ngap> Set(DigraphMaximalIndependen\ tSets(D));\n[ [ 1, 3 ], [ 1, 4 ], [ 2, 4 ], [ 2, 5 ], [ 3, 5 ] ]\ngap> Digraph\ MaximalIndependentSets(D, [1]);\n[ [ 1, 3 ], [ 1, 4 ] ]\ngap> DigraphIndepende\ ntSets(D, [], [4, 5]);\n[ [ 1 ], [ 2 ], [ 3 ], [ 1, 3 ] ]\ngap> DigraphIndepen\ dentSets(D, [], [4, 5], 1, 2);\n[ [ 1, 3 ] ]]]>\n \n<\ /ManSection>\n\n \n\n \n Visualising and IO\n\n Visualising a digraph\n \n \n Nothing.\n \n This function attempts to convert the string str into a pdf\n\ document and open this document, i.e. to splash it all over your monitor\ .\n\n The string str must correspond to a valid dot or\ \n LaTeX text file and you must have have GraphViz and\n \ pdflatex installed on your computer. For details about these file\n\ formats, see http://www.latex-project.org and\n htt\ p://www.graphviz.org. \n\n This function is provided to allow co\ nvenient, immediate viewing of the\n pictures produced by the function . \n\n The optional second argument opts should be a record with\n components corresponding to various options, \ given below.\n\n \n path\n \n \ this should be a string representing the path to the directory where\n \ you want Splash to do its work. The default value of this\n \ option is \"~/\".\n \n\n directory\n \n this should be a string representing the name of\ the directory in\n path where you want Splash to do it\ s work. This function\n will create this directory if does not alread\ y exist. \n\n The default value of this option is \"tmp.viz\"<\ /C> if the option\n path is present, and the result of\n \ is used otherwise.\n \ \n\n filename\n \n this\ should be a string representing the name of the file where\n str<\ /A> will be written. The default value of this option is\n \"vizp\ icture\".\n \n\n viewer\n \ \n this should be a string representing the name of the program which\ \n should open the files produced by GraphViz or pdflatex.\n \n\n type\n \n t\ his option can be used to specify that the string str contains\n \ a &LaTeX; or dot document. You can specify this option in\n \ str directly by making the first line \"%latex\" or\n \ \"//dot\". There is no default value for this option, this\n \ option must be specified in str or in opt.type.\n \ \n\n engine\n \n this option can be \ used to specify the GraphViz engine to use\n to render a dot d\ ocument. The valid choices are \"dot\",\n \"neato\", \"circo\", \"twopi\", \"fdp\",\n \"sfdp\", \ and \"patchwork\". Please refer to the\n GraphViz documentatio\ n for details on these engines.\n The default value for this option i\ s \"dot\", and it\n must be specified in opt.engine.\n \ \n\n filetype\n \n thi\ s should be a string representing the type of file which\n Splash<\ /C> should produce. For &LaTeX; files, this option is\n ignored and t\ he default value \"pdf\" is used.\n \n \n\n \ This function was written by Attila Egri-Nagy and Manuel Delgado with some\ \n minor changes by J. D. Mitchell. \n\n Spl\ ash(DotDigraph(RandomDigraph(4)));\n]]>\n \n \n\n \n \n \ \n A s\ tring.\n \n DotDigraph produces a graphi\ cal representation of the digraph\n digraph. Vertices are displaye\ d as circles, numbered consistently\n with digraph. Edges are disp\ layed as arrowed lines between\n vertices, with the arrowhead of each lin\ e pointing towards the range\n of the edge. \n\n DotVertexLabe\ lledDigraph differs from DotDigraph only in\n that the values \ in are used to label\n the vertices i\ n the produced picture rather than the numbers 1 to\n the number o\ f vertices of the digraph. \n\n The output is in dot format (a\ lso known as GraphViz)\n format. For details about this file forma\ t, and information about how to\n display or edit this format see ht\ tp://www.graphviz.org. \n\n The string returned by DotDigrap\ h or\n DotVertexLabelledDigraph can be written to a file using\ \n the command . \n\n \ adj := List([1 .. 4], x -> [1, 1, 1, 1]);\n[ [ 1, 1, 1\ , 1 ], [ 1, 1, 1, 1 ], [ 1, 1, 1, 1 ], [ 1, 1, 1, 1 ] ]\ngap> adj[1][3] := 0;\ \n0\ngap> gr := DigraphByAdjacencyMatrix(adj);\n\ngap> FileString(\"dot/k4.dot\", DotDigraph(gr));\n154]]>\n \n \n\n \n \n A string.\n \ \n This function produces a graphical representation of t\ he symmetric\n digraph digraph. DotSymmetricDigraph will re\ turn an\n error if digraph is not a symmetric digraph. See\n \ . \n\n Vertices are displayed as cir\ cles, numbered consistently with\n digraph. Since digraph i\ s symmetric, for every non-loop\n edge there is a complementary edge with\ opposite source and range.\n DotSymmetricDigraph displays each pa\ ir of complementary edges\n as a single line between the relevant vertice\ s, with no arrowhead. \n\n The output is in dot format (also kn\ own as GraphViz)\n format. For details about this file format, and\ information about how\n to display or edit this format see\n h\ ttp://www.graphviz.org. \n\n The string returned by DotSymme\ tricDigraph can be written to a\n file using the command . \n\n star := \ Digraph([[2, 2, 3, 4], [1, 1], [1], [1, 4]]);\n\ngap> IsSymmetricDigraph(star);\ntrue\ngap> FileString(\"do\ t/star.dot\", DotSymmetricDigraph(gr));\n83]]>\n \n \n\n \n \n A string.\n \n T\ his function produces a graphical representation of a partial order\n dig\ raph digraph. DotPartialOrderDigraph will return an error\n \ if digraph is not a partial order digraph. See . \n\n Since digraph is a partial order,\ it is both reflexive and\n transitive. The output of DotPartialOrderD\ igraph is the\n of the\n of digraph. \n\n The ou\ tput is in dot format (also known as GraphViz)\n format. Fo\ r details about this file format, and information about how\n to display \ or edit this format see\n http://www.graphviz.org. \n\n \ The string returned by DotPartialOrderDigraph can be written to a\n \ file using the command . \n\n poset := Digraph([[1, 4], [2], [2, 3, 4], [4])\ ;\ngap> IsPartialOrderDigraph(gr);\ntrue\ngap> FileString(\"dot/poset.dot\", D\ otPartialOrderDigraph(gr));\n83]]>\n \n \ \n\n \n \n \n A s\ tring.\n \n This function produces a graphical \ representation of a preorder\n digraph digraph. DotPreorderDigr\ aph will return an error\n if digraph is not a preorder digrap\ h. See . \n\n A preorder dig\ raph is reflexive and transitive but in general it is\n not anti-symmetri\ c and may have strongly connected components\n containing more than one v\ ertex. The \n Q obtained by forming\ the quotient of digraph by the\n partition of its vertices into t\ he strongly connected components\n satisfies . Thus every vertex of\n Q corresponds to a strongly conn\ ected component of digraph.\n The output of DotPreorderDigraph<\ /C> displays the \n o\ f Q with\n vertices displayed as rounded rectangles labelled by al\ l of the vertices\n of digraph in the corresponding strongly conne\ cted component. \n\n The output is in dot format (also known a\ s GraphViz)\n format. For details about this file format, and info\ rmation about how\n to display or edit this format see\n http:/\ /www.graphviz.org. \n\n The string returned by DotPreorderDi\ graph can be written to a\n file using the command . \n\n preset := Digr\ aph([[1, 2, 4, 5], [1, 2, 4, 5], [3, 4], [4], [1, 2, 4, 5]);\ngap> IsPreorderD\ igraph(gr);\ntrue\ngap> FileString(\"dot/preset.dot\", DotProrderDigraph(gr));\ \n83]]>\n \n \n\n \n \ \n A string.\n \n DotHighlig\ htedDigraph produces a graphical represenation of the\n digraph di\ graph, where the vertices in the list verts, and\n edges betwe\ en them, are drawn with colour colour1 and all other\n vertices an\ d edges in digraph are drawn with colour colour2.\n If c\ olour1 and colour2 are not given then\n DotHighlightedDigra\ ph uses black and grey respectively. \n\n Note that DotHighlig\ htedDigraph does not validate the colours\n colour1 and col\ our2 - consult the GraphViz documentation to\n see what is available.\ \n\n See for more details on the output. \n\ \n digraph := Digraph([[2, 3], [2], [1, 3]]);\n\ngap> FileString(\"dot/my_digraph.dot\",\n> DotH\ ighlightedDigraph(digraph, [1, 2], \"red\", \"black\"));\n264]]>\n \n \n\n \n\n Reading a\ nd writing digraphs to a file\n This section describes different \ ways to store and read graphs\n from a file in the &Digraphs; package.\n \ \n Graph6 \n \n\t Graph6 is a gra\ ph data format for storing undirected graphs\n\twith no multiple edges nor loo\ ps of size up to 2^{36} - 1 in\n\tprintable chracters. The format con\ sists of two parts. The first part\n\tuses one to eight bytes to store the num\ ber of vertices. And the second\n\tpart is the upper half of the adjacency mat\ rix converted into ASCII\n\tcharacters. For a more detail description see \n\thttp://cs.anu.edu.au/~bdm/data/formats.txt.\n \n\n Sparse6 \n \n\t Sparse6 is a g\ raph data format for storing undirected graphs\n\twith possibly multiple edges\ or loops. The maximal number of vertices\n\tallowed is 2^{36} - 1 . T\ he format consists of two parts. The\n\tfirst part uses one to eight bytes to \ store the number of vertices.\n\tAnd the second part only stores information a\ bout the edges.\n\tTherefore, the Sparse6 format return a more compac\ t encoding\n\tthen Graph6 for sparse graph, i.e. graphs where the nu\ mber\n\tof edges is much less than the number of vertices squared. For a more\ \n\tdetail description see \n http://cs.anu.edu.au/\ ~bdm/data/formats.txt.\n \n\n Digraph6 \n\ \n\tDigraph6 is a new format based on Graph6 , but \ designed\n\tfor digraphs. The entire adjacency matrix is stored, and\n\ttheref\ ore there is support for directed edges and single-vertex loops.\n\tHowever, m\ ultiple edges are not supported.\n \n\n DiSparse6 \n \n\tDiSparse6 is a new format based on Sparse6 , but\n\tdesigned for digraphs. In this format the list of edges is\n\tpartit\ ioned into inceasing and decreasing edges, depending whether the\n\tedge has i\ ts source bigger than the range. Then both sets of edges are\n\twritten separe\ tly in Sparse6 format with a separation symbol\n\tin between.\n \ \n \n \n \n \n A string.\n \n Returns a string string such that EvalS\ tring(string)\n is equal to digraph, and has the same mutability\ .\n See .\n \n\n The \ methods installed for String make some attempts to\n ensure that \ string has as short a length as possible, but\n there may exist shorter\ strings that also evaluate to digraph.\n \n\n It is possible\ that string may contain escaped special\n characters. To obtain a r\ epresentation of digraph that\n can be entered as GAP input, please \ use\n .\n Note that Print \ for a digraph delegates to\n PrintString, which delegates to Str\ ing.\n D := CycleDigraph(3);\n\ngap> Print(D);\nCycleDigraph(3);\ngap> G := PetersenGra\ ph(IsMutableDigraph);\n\ngap> Stri\ ng(G);\n\"DigraphFromGraph6String(IsMutableDigraph, \\\"IheA@GUAo\\\");\"\ngap\ > Print(last);\nDigraphFromGraph6String(IsMutableDigraph, \"IheA@GUAo\");\ngap\ > DigraphFromGraph6String(IsMutableDigraph, \"IheA@GUAo\");\n\n]]>\n \n\n\n \ \n \n \n \n \n A digraph.\n \n If str is a string encoding a graph in Graph6,\ Digraph6, Sparse6 or\n DiSparse6 format, then the corresponding function r\ eturns a digraph. In the\n case of either Graph6 or Sparse6, formats which \ do not support directed\n edges, this will be a digraph such that for every\ edge, the edge going in\n the opposite direction is also present. \n\n \ Each of these functions takes an optional first argument filt,\n \ which should be either \n or ,\n and which specifies whether the output digraph shal\ l\n be mutable or immutable.\n If no first argument is provided, then an\ immutable\n digraph is returned by default.\n \ DigraphFromGraph6String(\"?\");\n\nga\ p> DigraphFromGraph6String(\"C]\");\n\ngap> DigraphFromGraph6String(\"H?AAEM{\");\n\ngap> DigraphFromDigraph6String(\"&?\");\n\ngap> DigraphFromDigraph6String(IsMutableDigraph, \"&DO\ OOW?\");\n\ngap> DigraphFromDigraph6\ String(\"&CQFG\");\n\ngap> Digraph\ FromDigraph6String(\"&IM[SrKLc~lhesbU[F_\");\n\ngap> DigraphFromDiSparse6String(\".CaWBGA?b\");\n\n]]>\n \n\n\n \n \ \n \n \n \n \ A string.\n \n These four functions retur\ n a highly compressed string fully describing the\n digraph digraph.\ \n\n Graph6 and Digraph6 are formats best used on small, dense graphs,\ if\n applicable. For larger, sparse graphs use Sparse6 and\n \ Disparse6 (this latter also preserves multiple edges). \n\n See .\n gr := Digraph([[2, 3\ ], [1], [1]]);\n\ngap> Sparse6Stri\ ng(gr);\n\":Bc\"\ngap> DiSparse6String(gr);\n\".Bc{f\"\n]]>\n \n\n\n \n \n An IO file object.\n \ \n If filename is a string representing the name of a f\ ile, then\n DigraphFile returns an &IO; package file object for that\ file.\n \n\n If the optional argument coder is specified\n \ and is a function which either encodes a digraph as a string, or decodes a\n\ string into a digraph, then this function will be used when reading or\n \ writing to the returned file object. If the optional argument coder\n\ is not specified, then the encoding of the digraphs in the returned file\n\ object must be specified in the the file extension. The file extension mus\ t\n be one of: .g6, .s6, .d6, .ds6, .txt\ ,\n .p, or .pickle; more details of these file formats is giv\ en\n below. \n\n If the optional argument mode is specified, \ then it must be one of:\n \"w\" (for write), \"a\" (for appen\ d), or \"r\" (for read).\n If mode is not specified, then \ \"r\" is used by default. \n\n If filename ends in one of: <\ C>.gz, .bz2, or\n .xz, then the digraphs which are read f\ rom, or written to, the\n returned file object are decompressed, or compres\ sed, appropriately.\n \n\n The file object returned by DigraphFil\ e can be given as the first\n argument for either of the functions or . The purpose \ of this is to reduce the overhead of\n recreating the file object inside th\ e functions \n or \ when, for example, reading or writing many\n digraphs in a loop.\n \ \n\n The currently supported file formats, and associated filename extensio\ ns,\n are:\n \n graph6 (.g6)\n \n\tA \ standard and widely-used format for undirected graphs, with no support\n\tfor \ loops or multiple edges. Only symmetric graphs are allowed -- each\n\tedge is\ combined with its converse edge to produce a single undirected\n\tedge. This\ format is best used for \"dense\" graphs -- those with many\n\tedges per vert\ ex.\n \n sparse6 (.s6)\n \n\tUnlike g\ raph6, sparse6 has support for loops and multiple edges.\n\tHowever, its use i\ s still limited to symmetric graphs. This format is\n\tbetter-suited to \"spa\ rse\" graphs -- those with few edges per vertex.\n \n d\ igraph6 (.d6)\n \n\tThis format is based on graph6, but stor\ es direction information -\n\ttherefore is not limited to symmetric graphs. L\ oops are allowed, but\n\tmultiple edges are not. Best compression with \"dens\ e\" graphs.\n \n disparse6 (.ds6)\n \ \n\tAny type of digraph can be encoded in disparse6: directions, loops, and\n\ \tmultiple edges are all allowed. Similar to sparse6, this has the best\n\tco\ mpression rate with \"sparse\" graphs.\n \n plain text \ (.txt)\n \n\tThis is a human-readable format which stores gr\ aphs in the form\n 0 7 0 8 1 7 2 8 3 8 4 8 5 8 6 8 i.e. p\ airs of vertices\n describing edges in a graph. More specifically, the \ vertices making up\n one edge must be separated by a single space, and \ pairs of vertices must\n be separated by two spaces. \n\n Se\ e for a more flexible way to store\n \ digraphs in a plain text file. \n \n\n pickled (\ .p or .pickle)\n \n Digraphs are pickle\ d using the &IO; package. This is particularly good\n when the is non-trivial.\n \n \n\n filename := Concatenation(DIGRAPHS_Dir(), \"/tst/out/man.d6\ .gz\");;\ngap> file := DigraphFile(filename, \"w\");;\ngap> for i in [1 .. 10]\ do\n> WriteDigraphs(file, Digraph([[1, 3], [2], [1, 2]]));\n> od;\ngap> IO_Cl\ ose(file);;\ngap> file := DigraphFile(filename, \"r\");;\ngap> ReadDigraphs(fi\ le, 9);\n]]>\n \n\n\n \n \n A digraph, or a list of digraphs.<\ /Returns>\n \n If filename is a string containing the \ name of a file containing\n encoded digraphs or an &IO; file object created\ using , then ReadDigraphs returns th\ e digraphs\n encoded in the file as a list. Note that if filename i\ s a\n compressed file, which has been compressed appropriately to give a fi\ lename\n extension of .gz, .bz2, or .xz, then\n \ ReadDigraphs can read filename without it first needing to be\n \ decompressed.\n \n\n If the optional argument decoder is spec\ ified\n and is a function which decodes a string into a digraph,\n then \ ReadDigraphs will use decoder to decode the digraphs\n contai\ ned in filename. \n\n If the optional argument n is specif\ ied, then ReadDigraphs\n returns the nth digraph encoded in t\ he file filename.\n \n\n If the optional argument decoder<\ /A> is not specified, then\n ReadDigraphs will deduce which decoder \ to use based on the filename\n extension of filename (after removing\ the compression-related\n filename extensions .gz, .bz2, and\ .xz). For example,\n if the filename extension is .g6, then\ ReadDigraphs will use\n the graph6 decoder .\n \n\n The currently supported file formats, and as\ sociated filename extensions,\n are:\n \n graph6 (.g6)<\ /Mark>\n \n\tA standard and widely-used format for undirected graph\ s, with no support\n\tfor loops or multiple edges. Only symmetric graphs are \ allowed -- each\n\tedge is combined with its converse edge to produce a single\ undirected\n\tedge. This format is best used for \"dense\" graphs -- those w\ ith many\n\tedges per vertex.\n \n sparse6 (.s6)\ \n \n\tUnlike graph6, sparse6 has support for loops and multiple ed\ ges.\n\tHowever, its use is still limited to symmetric graphs. This format is\ \n\tbetter-suited to \"sparse\" graphs -- those with few edges per vertex.\n \ \n digraph6 (.d6)\n \n\tThis format is\ based on graph6, but stores direction information -\n\ttherefore is not limit\ ed to symmetric graphs. Loops are allowed, but\n\tmultiple edges are not. Be\ st compression with \"dense\" graphs.\n \n disparse6 (.\ ds6)\n \n\tAny type of digraph can be encoded in disparse6: \ directions, loops, and\n\tmultiple edges are all allowed. Similar to sparse6,\ this has the best\n\tcompression rate with \"sparse\" graphs.\n \ \n plain text (.txt)\n \n\tThis is a human-readab\ le format which stores graphs in the form\n 0 7 0 8 1 7 2 8 3 8 \ 4 8 5 8 6 8 i.e. pairs of vertices\n describing edges in a graph\ . More specifically, the vertices making up\n one edge must be separate\ d by a single space, and pairs of vertices must\n be separated by two s\ paces. \n\n See for a more fle\ xible way to store\n digraphs in a plain text file. \n\n \n\n pickled (.p or .pickle)\n \n Digraphs \ are pickled using the &IO; package. This is particularly good\n when th\ e is non-trivial.\n \n \n\n\ ReadDigraphs(\n> Concatenation(DIGRAPHS_Dir(), \"\ /data/graph5.g6.gz\"), 10);\n\ngap\ > ReadDigraphs(\n> Concatenation(DIGRAPHS_Dir(), \"/data/graph5.g6.gz\"), 17);\ \n\ngap> ReadDigraphs(\n> Concate\ nation(DIGRAPHS_Dir(), \"/data/tree9.4.txt\"));\n[ , \n , \n , \n , \n , \n , \n , \n , \n , \n ,\ \n , \n , \n , \n <\ immutable digraph with 9 vertices, 8 edges> ]]]>\n \ \n\n\n \n \n \n If digraphs is a list of digraphs or a digraph and filename\n is a string or a\ n &IO; file object created using ,\n then Wri\ teDigraphs writes the digraphs to the file represented by\n filename\ . If the supplied filename ends in one of the extensions\n .gz,\ .bz2, or .xz, then the file will be compressed\n appropriate\ ly. Excluding these extensions, if the file ends with an\n extension in th\ e list below, the corresponding graph format will be used to\n encode it. \ If such an extension is not included, an appropriate format\n will be chose\ n intelligently, and an extension appended, to minimise file\n size.\n <\ P/>\n\n \n\n For more verbose information\ on the progress of the function, set the info\n level of InfoDigraphs to 1 or higher, using SetInfoLevel. \n\n The currently support\ ed file formats are:\n \n graph6 (.g6)\n \n\tA standard and widely-used format for undirected graphs, with no support\ \n\tfor loops or multiple edges. Only symmetric graphs are allowed -- each\n\ \tedge is combined with its converse edge to produce a single undirected\n\ted\ ge. This format is best used for \"dense\" graphs -- those with many\n\tedges\ per vertex.\n \n sparse6 (.s6)\n \n\ \tUnlike graph6, sparse6 has support for loops and multiple edges.\n\tHowever,\ its use is still limited to symmetric graphs. This format is\n\tbetter-suite\ d to \"sparse\" graphs -- those with few edges per vertex.\n \n \ digraph6 (.d6)\n \n\tThis format is based on graph6\ , but stores direction information -\n\ttherefore is not limited to symmetric \ graphs. Loops are allowed, but\n\tmultiple edges are not. Best compression w\ ith \"dense\" graphs.\n \n disparse6 (.ds6)\n \ \n\tAny type of digraph can be encoded in disparse6: directions, loop\ s, and\n\tmultiple edges are all allowed. Similar to sparse6, this has the be\ st\n\tcompression rate with \"sparse\" graphs.\n \n\n p\ lain text (.txt)\n \n\tThis is a human-readable format which\ stores graphs in the form\n 0 7 0 8 1 7 2 8 3 8 4 8 5 8 6 8<\ /C> i.e. pairs of vertices\n describing edges in a graph. More specific\ ally, the vertices making up\n one edge must be separated by a single s\ pace, and pairs of vertices must\n be separated by two spaces. \n\n\ See for a more flexible way to st\ ore\n digraphs in a plain text file. \n\n \n pickled (.p or \ .pickle)\n \n Digraphs are pickled using the &IO;\ package. This is particularly good\n when the is non-trivial.\n \n \n\n grs := [];;\ngap> grs[1] := Digraph([]);\n\ngap> grs[2] := Digraph([[1, 3], [2], [1, 2]]);\n\ngap> grs[3] := Digraph([\n> [6, 7], [6, 9], [1, 3, 4\ , 5, 8, 9],\n> [1, 2, 3, 4, 5, 6, 7, 10], [1, 5, 6, 7, 10], [2, 4, 5, 9, 10],\ \n> [3, 4, 5, 6, 7, 8, 9, 10], [1, 3, 5, 7, 8, 9], [1, 2, 5],\n> [1, 2, 4, 6, \ 7, 8]]);\n\ngap> filename := Con\ catenation(DIGRAPHS_Dir(), \"/tst/out/man.d6.gz\");;\ngap> WriteDigraphs(filen\ ame, grs, \"w\");\nIO_OK\ngap> ReadDigraphs(filename);\n[ , \n , \n <\ immutable digraph with 10 vertices, 51 edges> ]]]>\n \n\n\n \n \n An iterator.\n \n If filename is a string representing the name of a file co\ ntaining\n encoded digraphs, then IteratorFromDigraphFile returns an\ iterator\n for which the value of is the\n next digraph encoded in the file.\n \n\n If the op\ tional argument decoder is specified and is a function\n which decod\ es a string into a digraph, then IteratorFromDigraphFile\n will use \ decoder to decode the digraphs contained in filename.\n \ \n\n The purpose of this function is to easily allow looping over digraphs\ \n encoded in a file when loading all of the encoded digraphs would require\ \n too much memory. \n\n To see what file types are available, see <\ Ref Func=\"WriteDigraphs\"/>.\n\n filename := Conc\ atenation(DIGRAPHS_Dir(), \"/tst/out/man.d6.gz\");;\ngap> file := DigraphFile(\ filename, \"w\");;\ngap> for i in [1 .. 10] do\n> WriteDigraphs(file, Digrap\ h([[1, 3], [2], [1, 2]]));\n> od;\ngap> IO_Close(file);;\ngap> iter := Iterato\ rFromDigraphFile(filename);\n\ngap> for x in iter do od;\n]]>\n \n\n\n \n \n \ \n A string.\n \n These two functions ret\ urn a function which encodes or decodes a digraph in\n a plain text format.\ \n\n DigraphPlainTextLineEncoder returns a function which takes \ a single\n digraph as an argument. The function returns a string describin\ g the edges\n of that digraph; each edge is written as a pair of integers s\ eparated by the\n string delimiter2, and the edges themselves are se\ parated by the\n string delimiter1. DigraphPlainTextLineDecoder<\ /A> returns the\n corresponding decoder function, which takes a string argu\ ment in this format\n and returns a digraph. \n\n If only one delimit\ er is passed as an argument to\n DigraphPlainTextLineDecoder, it wil\ l return a function which decodes\n a single edge, returning its contents a\ s a list of integers. \n\n The argument offset should be an integ\ er, which will describe a\n number to be added to each vertex before it is \ encoded, or after it is\n decoded. This may be used, for example, to label\ vertices starting at 0\n instead of 1. \n\n Note that the number of \ vertices of a digraph is not stored, and so vertices\n which are not connec\ ted to any edge may be lost.\n\n gr := Digraph([[2\ , 3], [1], [1]]);\n\ngap> enc := D\ igraphPlainTextLineEncoder(\" \", \" \", -1);;\ngap> dec := DigraphPlainTextL\ ineDecoder(\" \", \" \", 1);;\ngap> enc(gr);\n\"0 1 0 2 1 0 2 0\"\ngap> de\ c(last);\n\n]]>\n \n\n\n \n \n A digraph.\n \n Th\ is function takes a string str, decodes it, and then returns the\n t\ ournament [see ] which it defines, according to\n \ the following rules. \n\n The characters of the string str re\ present the entries in the upper\n triangle of a tournament's adjacency mat\ rix. The number of vertices\n n will be detected from the length of \ the string and will be as\n large as possible. \n\n The first chara\ cter represents the possible edge 1 -> 2, the second\n represents 1 -> 3 and so on until 1 -> n; then the following\n character r\ epresents 2 -> 3, and so on up to the character which\n represents t\ he edge n-1 -> n. \n\n If a character of the string with corresp\ onding edge i -> j is equal\n to 1, then the edge i -> j is present in the tournament.\n Otherwise, the edge i -> j is pre\ sent instead. In this way, all the\n possible edges are encoded one-by-one\ .\n\n gr := TournamentLineDecoder(\"100001\");\n\ngap> OutNeighbours(gr);\n[ [ 2 ], \ [ ], [ 1, 2, 4 ], [ 1, 2 ] ]\n]]>\n \n\ \n\n \n \n A digraph.\n \n This fun\ ction takes a string str, decodes it, and then returns the\n topolog\ ically sorted digraph [see ]\n which \ it defines, according to the following rules. \n\n The characters of th\ e string str represent the entries in the upper\n triangle of a digr\ aph's adjacency matrix. The number of vertices n\n will be detected \ from the length of the string and will be as large as\n possible. \n\n\ The first character represents the possible edge 1 -> 2, the second\ \n represents 1 -> 3 and so on until 1 -> n; then the followi\ ng\n character represents 2 -> 3, and so on up to the character whic\ h\n represents the edge n-1 -> n. If a character of the string with\ \n corresponding edge i -> j is equal to 1, then this edge is\ \n present in the digraph. Otherwise, it is not present. In this way, all \ the\n possible edges are encoded one-by-one. \n\n In particular, not\ e that there exists no edge [i, j] if j \\leq\n i. In orde\ r words, the digraph will be topologically sorted.\n\n gr := AdjacencyMatrixUpperTriangleLineDecoder(\"100001\");\n\ngap> OutNeighbours(gr);\n[ [ 2 ], [ ], [ 4 ]\ , [ ] ]\ngap> gr := AdjacencyMatrixUpperTriangleLineDecoder(\"111111x111\");\ \n\ngap> OutNeighbours(gr);\n[ [ 2\ , 3, 4, 5 ], [ 3, 4 ], [ 4, 5 ], [ 5 ], [ ] ]\n]]>\n \n\n\n \n \n A digraph.\n \n If str is a\ string consisting of at least two non-negative integers\n separated by spa\ ces, then this function will attempt to return the digraph\n which it defin\ es as a TCode string. \n\n The first integer of the string defines the \ number of vertices v in\n the digraph, and the second defines the nu\ mber of edges e. The\n following 2e integers should be verte\ x numbers in the range [0 ..\n v-1]. These integers are read in pa\ irs and define the digraph's\n edges. This function will return an error i\ f str has fewer than\n 2e+2 entries. \n\n Note that th\ e vertex numbers will be incremented by 1 in the digraph\n returned. Hence\ the string fragment 0 6 will describe the edge\n [1,7].\n \ gr := TCodeDecoder(\"3 2 0 2 2 1\");\n\ngap> OutNeighbours(gr);\n[ [ 3 ], [ ], [ 2 ] \ ]\ngap> gr := TCodeDecoder(\"12 3 0 10 5 2 8 8\");\n\ngap> OutNeighbours(gr);\n[ [ 11 ], [ ], [ ], [ ], [ ]\ , [ 3 ], [ ], [ ], [ 9 ], [ ], \n [ ], [ ] ]\n]]>\n \n\n\n \n \n \n A string.\n \n PlainTextString takes a\ single digraph, and returns a string\n describing the edges of that digrap\ h. DigraphFromPlainTextString\n takes such a string and returns the\ digraph which it describes. Each edge\n is written as a pair of integers \ separated by a single space. The edges\n themselves are separated by a dou\ ble space. Vertex numbers are reduced by\n 1 when they are encoded, so tha\ t vertices in the string are labelled\n starting at 0. \n\n Note that\ the number of vertices of a digraph is not stored, and so vertices\n which\ are not connected to any edge may be lost. \n\n \n The operation \ DigraphFromPlainTextString\n takes an optional first argument \n or , which spec\ ifies whether the output digraph shall\n be mutable or immutable. If no fir\ st argument is provided, then an immutable\n digraph is returned by default\ .\n\n gr := Digraph([[2, 3], [1], [1]]);\n\ngap> PlainTextString(gr);\n\"0 1 0 2 1\ 0 2 0\"\ngap> DigraphFromPlainTextString(last);\n\n]]>\n \n\n\n \n \n \n \n These functions write and read a\ single digraph in a human-readable plain\n text format as follows: each li\ ne contains a single edge, and each edge is\n written as a pair of integers\ separated by the string delimiter. \n\n filename should b\ e the name of a file which will be written to or\n read from, and offset\ should be an integer which is added to each\n vertex number as it is w\ ritten or read. For example, if\n WritePlainTextDigraph is called w\ ith offset -1, then\n the vertices will be numbered in the fi\ le starting from 0 instead of 1 -\n ReadPlainTextDigraph would then \ need to be called with offset\n 1 to convert back to the orig\ inal graph. \n\n ignore should be a list of characters which will\ be ignored when\n reading the graph.\n gr := D\ igraph([[1, 2, 3], [1, 1], [2]]);\n\ngap> filename := Concatenation(DIGRAPHS_Dir(), \"/tst/out/plain.txt\")\ ;;\ngap> WritePlainTextDigraph(filename, gr, \",\", -1);\ngap> ReadPlainTextDi\ graph(filename, \",\", 1, ['/', '%']);\n\n]]>\n \n\n\n \n \n \n \n These operat\ ions write or read the single symmetric digraph digraph\n to or from\ a file in DIMACS format, as appropriate. The operation\n WriteDIMACSDig\ raph records the vertices and edges of digraph.\n The vertex lab\ els of digraph will be recorded only if they are\n integers. See and \ . \n\n The first argument filename should be the name of the file\ which will\n be written to or read from. A file can contain one symmetric\ digraph in\n DIMACS format. If filename ends in one of .gz, \ .bz2,\n or .xz, then the file is compressed, or decompressed,\ appropriately.\n \n\n The DIMACS format is described as follows. E\ ach line in the DIMACS file has\n one of four types:\n \n \n A line beginning with c and followed by any number of char\ acters\n is a comment line, and is ignored.\n \n \n A line beginning with p defines the numbers of vertices and \ edges\n the digraph. This line has the format p edge <nr_vertice\ s>\n <nr_edges>, where <nr_vertices> and\n \ <nr_edges> are replaced by the relevant integers. There\n \ must be exactly one such line in the file, and it must occur before any\ \n of the following kinds of line. \n\n Although it is requir\ ed to be present, the value of\n <nr_edges> will be ignore\ d. The correct number of edges\n will be deduced from the rest of the i\ nformation in the file.\n \n \n A line of the fo\ rm e <v> <w>, where <v>\n and <w&\ gt; are integers in the range [1 ..\n <nr_vertices>]\ , specifies that there is a (symmetric) edge\n in the digraph between t\ he vertices <v> and\n <w>. A symmetric edge o\ nly needs to be defined once; an\n additional line e <v> <w\ >, or e <w>\n <v>, will be interpreted as a\ n additional, multiple, edge.\n Loops are permitted.\n \n \ \n A line of the form n <v> <label>, where\ \n <v> is an integer in the range [1 ..\n <\ nr_vertices>] and <label> is an integer,\n signifie\ s that the vertex <v> has the label\n <label>\ in the digraph. If a label is not specified for a\n vertex, then Re\ adDIMACSDigraph will assign the label\n 1, according to the \ DIMACS specification.\n \n \n\n A detailed definition\ of the DIMACS format can be found at\n http://mat.gsia.cmu.edu/COLOR/\ general/ccformat.ps, in Section\n 2.1. Note that optional descriptor \ lines, as described in Section 2.1, will\n be ignored.\n \n\n\n <\ Example> gr := Digraph([[2], [1, 3, 4], [2, 4], [2, 3]]);\n\ngap> filename := Concatenation(DIGRA\ PHS_Dir(),\n> \"/tst/out/dimacs.dimacs\");;\ngap>\ WriteDIMACSDigraph(filename, gr);;\ngap> ReadDIMACSDigraph(filename);\n]]>\n \n\n\n \n\n \n\n\n\n \n Grape to Digraphs Command Map\n \n Below \ is a table of &Grape; commands with the &Digraphs; counterparts.\n The sectio\ ns in this chapter correspond to the chapters in the &Grape;\n manual.\n\n <\ Section>\n \n Functions to construct and modify graphs\n <\ /Heading>\n \n \n The table in this sectio\ n contains more information when viewed in\n html format.\n \n\ \n\n \n \n \n \ \n &Grape; command\n \n \n \ &Digraphs; command\n \n \n \n Comments\n \n \n \n \n\n \n \n Graph\n\ \n \n \n \n \n \n Used with the \ arguments of Graph in &Grape;, wil\ l return an equivalent digraph. \n \n \n \ \n \n\n \n \n EdgeOrb\ itsGraph\n \n \n \n \n \n \n\ The operation behaves the same as\ \n EdgeOrbitsDigraph in &Grape;.\n \n \n \n \n\n \n \n \ NullGraph\n \n \n \n \n or\n \n \n \n \n \ \n Note that, unlike in &Grape;, the arg\ uments of and are just\n non-negative integers. Since digraphs in &Digra\ phs; are immutable,\n there is no reason (although it is possible) \ to create a null digraph\n and then add edges, as you might be used\ to doing in &Grape;.\n \n \n \n \ \n\n \n \n CompleteGraph\n \ \n \n \n \ \n \n \n Note th\ at, unlike in &Grape;, the argument to is simply a non-negative integer\n indicating the number of\ vertices. By default a complete digraph in\n &Digraphs; does not h\ ave any loops. If you want a complete digraph\n with loops at every\ vertex, then use .\n \ \n \n \n \n\n \n \ \n JohnsonGraph\n \n \n \ \n \n \n \ \n The &Grape; function JohnsonGraph\ is equivalent to\n .\n \n \n \n \n\n \n \n CayleyGraph\n \n \n \ \n \n \n \n The operation beha\ ves the same as\n CayleyGraph in &Grape;.\n \ \n \n \n \n\n \n \n AddEdgeOrbit\n \n \n \ \n \n \n \ \n Note that, unlike in &Grape;, digraphs in &\ Digraphs; are immutable,\n and this operation returns a new digraph\ , i.e. it does not modify the\n digraph given as an argument.\n \ \n \n \n \n\n \n\ \n RemoveEdgeOrbit\n \n \n \n \n \ \n \n Note that, unlike in &Gra\ pe;, digraphs in &Digraphs; are immutable,\n and this operation ret\ urns a new digraph, i.e. it does not modify the\n digraph given as \ an argument.\n \n \n \n \n\n \n \n AssignVertexNames\n \ \n \n \n \ \n and\n \n \n \n \n \ \n Use t\ o set an individual\n vertex label and to set all of\n the vertex labels.\n \n \ \n \n \n \n \n\n \ \n \n Functions to inspect graphs, vertices and edg\ es\n \n \n \n The table in th\ is section contains more information when viewed in\n html format.\n \ \n \n\n \n \n\n \ \n \n &Grape; command\n \n <\ Item>\n &Digraphs; command\n \n \n \ \n Comments\n \n \ \n \n \n\n \n \n \ IsGraph\n \n \n \n \n \n \n \ is a category and not a function like\n \ IsGraph.\n \n \n \n \n\n \n \n OrderGraph\n <\ /Item>\n \n \n <\ /Item>\n \n \n The operati\ on behaves the same as\n Order\ Graph in &Grape;.\n \n \n \n \ \n\n \n \n IsVertex(graph,\ v)\n \n \n v in Digr\ aphVertices(digraph)\n \n \n \n The attribute c\ an be used to return\n the list of vertices of a digraph, or if \ v is known to be\n a positive integer, then you can simply do\n\ v <= DigraphNrVertices(digraph)\n \ \n \n \n \n\n \n \ \n VertexName\n \n \n \ \n \n \n \ \n Unlike VertexName in &Grape;, th\ e return value of\n is mutable.\ \n \n \n \n \n\n <\ Row>\n \n VertexNames\n \n <\ Item>\n \n \n \ \n \n Unlike VertexNames \ in &Grape;, the return value of\n is mutable.\n \n \n \n \n\n \n \n Vertices\n \ \n \n \n \n\ \n \n The vertices of a d\ igraph in &Digraphs; is always the range [1\n .. n] where \ n is the number of vertices of the\n digraph. The operation\ behaves the\n same as Vertices<\ /C> in &Grape;.\n \n \n \n \n\n \n \n VertexDegree\n \n \n \n \ \n (see also: )\ \n \n \n \n \n The operation behaves the \ same as\n VertexDegree in &Grape;.\n \n \ \n \n \n\n \n \n \ VertexDegrees\n \n \n \n \n (see also:\n\ ,\n ,\n ,\n ,\n )\n \ \n \n \n \n \ The operation behaves the same as\n VertexDegrees in &Grape;.\n \n \n \n \n\n \n \n IsLoopy\n\ \n \n \n \ \n \n \n The \ operation behaves the same as\n \ IsLoopy in &Grape;.\n \n \n \n \ \n\n \n \n IsSimpleGraph\n \ \n \n \n \n and not \n \n \n \n \n \n \n\ \n The &Grape; function IsSimpleGra\ ph is equivalent to\n \n \ and not .\n \n \n \n \n\n \n \n \ Adjacency\n \n \n \n \n (see also <\ Ref Oper=\"InNeighboursOfVertex\"/>)\n \n \n \ \n \n The operation behaves the same\n as Adjacency \ in &Grape;.\n \n \n \n \ \n\n \n \n IsEdge\n \n \ \n \n \n \n \n \ The arguments of\n \n can be a digraph and an edge, or a digraph and \ two vertices. In the\n first form the operation\n \n behaves th\ e same as IsEdge in &Grape;.\n \n \n \ \n \n\n \n \n Directed\ Edges\n \n \n \n \n \n \n \ The attribute behaves the same\n a\ s DirectedEdges in &Grape;.\n \n \n <\ /Row>\n \n\n \n \n Undirecte\ dEdges\n \n \n None\n \n\ \n \n There is no analogo\ us function in &Digraphs;, and no plans to\n include one.\n \ \n \n \n \n\n \n \ \n Distance\n \n \n \ \n \n \n \n The operation behaves the same as\n \ Distance in &Grape;.\n \n \n \ \n \n\n \n \n Diameter\ \n \n \n \n \n \n \n \ The attribute behaves the same\n \ as Diameter in &Grape;.\n \n \n \n \n\n \n \n Girth\n \ \n \n \n \n \n \n \ The attribute behaves the same\n \ as Girth in &Grape; except that in the case that the\n \ argument is a forest, infinity is returned by &Digraphs;\n \ whereas -1 is returned by &Grape;.\n \n \n\ \n \n\n \n \n Is\ ConnectedGraph\n \n \n \n \n \n \n The attribute behaves the\n same as IsConnectedGraph in &Grape;.\n \ \n \n \n \n\n \ \n \n IsBipartite\n \n \n \n \ \n and \n \n \ \n \n \n The &Gra\ pe; function IsBipartite is equivalent to\n and .\n \ \n \n \n \n\n \ \n \n IsNullGraph\n \n \n \n \n \ or \n \n \ \n \n \n The &Grape; funct\ ion IsNullGraph is equivalent to\n and its synonym .\n \ \n \n \n \n\n \n \ \n IsCompleteGraph\n \n \n\ \n \n \n\ \n The &Grape; function IsCompleteG\ raph is roughly\n equivalent to\n except that in &Digraphs;\n a complete digraph has \ no loops.\n \n \n \n \n\n\n \n \n\n \n \n Funct\ ions to determine regularity properties of graphs\n \n \n \n The table in this section contains more inform\ ation when viewed in\n html format.\n \n \n\n \n \n\n \n \n \ &Grape; command\n \n \n &Digraphs; com\ mand\n \n \n \n \ Comments\n \n \n \n \n\n \n \n IsRegularGraph\n \n \n \n \ \n (see also\n \n and\n )\ \n \n \n \n \n The &Grape; function IsRegularGraph is\n e\ quivalent to .\n \n <\ /Item>\n \n \n\n \n \n \ LocalParameters\n \n \n None\n \ \n \n \n The &\ Grape; function LocalParameters has no equivalent\n function\ in &Digraphs;, although this might change in the future.\n \n \ \n \n \n\n \n \ \n GlobalParameters\n \n \n \ None\n \n \n \n \ The &Grape; function GlobalParameters has no equivalent\n \ function in &Digraphs;, although this might change in the future.\n \ \n \n \n \n\n \n \ \n IsDistanceRegular\n \n \n \n \n \ \n \n The &Grape; function I\ sDistanceRegular is\n equivalent to .\n \n \n \n \n\n \n \n CollapsedAdjacencyMat\n \ \n \n None\n \n \ \n \n The &Grape; function CollapsedA\ djacencyMat has no equivalent\n function in &Digraphs;, althoug\ h this might change in the future.\n \n \n <\ /Row>\n \n\n \n \n OrbitalGr\ aphColadjMats\n \n \n None\n \n \n \n The &Grape; f\ unction OrbitalGraphColadjMats has no equivalent\n function \ in &Digraphs;, although this might change in the future.\n \n \ \n \n \n\n \n \n\ VertexTransitiveDRGs\n \n \n \ None\n \n \n \n \ The &Grape; function VertexTransitiveDRGs has no equivalent\n \ function in &Digraphs;, although this might change in the future.\n \ \n \n \n \n\n \n\n \n\n \n \n Some special vertex sub\ sets of a graph\n \n \n \n Th\ e table in this section contains more information when viewed in\n html\ format.\n \n \n\n \n \n\n \n \n &Grape; command\n \n \n &Digraphs; command\n \n \n \n Comments\n \n \ \n \n \n\n \n \n\ ConnectedComponent\n \n \n \ \n \n \n\ \n When applied to a simple di/graph a\ nd a vertex,\n ConnectedComponent in &Grape; is equivalent t\ o\n .\n can also be applied to\n non-sim\ ple graphs (in the language of &Grape;).\n \n \n \ \n \n\n \n \n Con\ nectedComponents\n \n \n \n \n \n \n When applied to a simple di/graph,\n <\ C>ConnectedComponents in &Grape; is equivalent to\n .\n can also be applied to\n non-simple graphs (in the lang\ uage of &Grape;).\n \n \n \n \n\n \n \n Bicomponents\n \ \n \n \n \ \n \n \n When app\ lied to a simple bipartite di/graph,\n Bicomponents in &Grap\ e; is equivalent to\n .\n \ The definition of does not require\n \ its argument to be simple (in the language of &Grape;), i.e. the\n \ bipartite graphs in &Grape; are a proper subset of the bipartite\n \ digraphs in &Digraphs;.\n \n \n \n \n\n \n \n DistanceSe\ t\n \n \n \n \ \n \n \n Dista\ nceSet in &Grape; is equivalent to\n in &Dig\ raphs;.\n \n \n \n \n\n\ \n \n Layers\n \n \ \n \n \n \n \n Layers in &Grape; is eq\ uivalent to\n in &Digraphs;.\n \ \n \n \n \n\n \n \ \n IndependentSet\n \n \ \n \n \n \n \n IndependentSet in &Gra\ pe; is equivalent to\n in &Di\ graphs;.\n \n \n \n \n\ \n \n\n \n\n \n \n Functions \ to construct new graphs from old\n \n \n \ \n The table in this section contains more information when viewed\ in\n html format.\n \n \n\n \n \n\n \n \n &Grape; comma\ nd\n \n \n &Digraphs; command\n \n \n \n Comments\n \ \n \n \n \n\n \ \n \n InducedSubgraph\n \n <\ Item>\n \n \n <\ Item>\n \n in &Digraphs; does not allow a third\n argument G spec\ ifying a group of automorphisms on the\n resultant graph. This may \ be included in a future release.\n \n \n \n \n\n \n \n DistanceSet\ Induced\n \n \n None\n \ \n \n \n There is no analo\ gous function in &Digraphs;, and no plans to\n include one.\n \ \n \n \n \n\n \n \ \n DistanceGraph\n \n \ \n \n \ \n \n \n D\ istanceGraph in &Grape; is equivalent to\n in\n &Digraphs;.\n \ \n \n \n \n\n \n \ \n ComplementGraph\n \n \n \n \n \n \ \n in &Digrap\ hs; is equivalent to\n ComplementGraph in &Grape; with the o\ ptional argument\n comploops set to true (loops/nonlo\ ops are\n complemented).\n \n \n \ \n \n\n \n \n PointGra\ ph\n \n \n None\n \n \ \n \n There is no analogous f\ unction in &Digraphs;, and no plans to\n include one.\n \n \n \n \n\n \n \ \n EdgeGraph\n \n \n \ \n \n \n \ \n EdgeGraph in &Grape; is equivalen\ t to\n in &Digraphs;.\n \ \n \n \n \n\n \n \ \n SwitchedGraph\n \n \ \n None\n \n \n \n There is no analogous function in &Digraphs;, and no plans to\ \n include one.\n \n \n \n \ \n\n \n \n UnderlyingGraph\n \n \n \n \n \n \n \ UnderlyingGraph in &Grape; is equivalent to\n in &Digraphs;.\n \n \n \n \n\n \n \n \ QuotientGraph\n \n \n \n \n \n \n in &Digraphs; takes a par\ tition\n p of the vertices of the digraph, rather than a set\ of\n generating pairs. Hence, the equivalence might not be\n \ group-invariant. Also note that in &Digraphs; multiple edges may be\n \ created, whereas in &Grape; they are effectively combined into a\n \ single edge.\n \n \n \n \ \n\n \n \n BipartiteDouble\ \n \n \n \n \n \n \n \ BipartiteDouble in &Grape; is equivalent to\n in &Digraphs;.\n \n \n \n \n\n \n \n GeodesicsGraph\n \n \n None\n \ \n \n \n There is n\ o analogous function in &Digraphs;, and no plans to\n include one.\ \n \n \n \n \n\n <\ Row>\n \n CollapsedIndependentOrbitsGraph\n \ \n \n None\n \n \n \ \n There is no analogous function in &Di\ graphs;, although this feature\n might be implemented in the future\ .\n \n \n \n \n\n \ \n \n CollapsedCompleteOrbitsGraph\n \ \n \n None\n \n \n \ \n There is no analogous function in &Digr\ aphs;, although this feature\n might be implemented in the future.\ \n \n \n \n \n\n <\ Row>\n \n NewGroupGraph\n \n \ \n None\n \n \n \n There is no analogous function in &Digraphs;. However,\ the same\n results would be possible by calling on\n the digraph to produce a copy gr, and then ap\ plying\n SetDigraphGroup(gr, G).\n \n \ \n \n \n\n \n\n \n\n <\ Section>\n \n Vertex-Colouring and Complete Subgraphs\n \n \n \n The table in this section\ contains more information when viewed in\n html format.\n \n \ \n\n \n \n\n \n \ \n &Grape; command\n \n \n \ &Digraphs; command\n \n \n \n Comments\n \n \n \n \n\n \n \n VertexColo\ uring\n \n \n \n \n \n \ \n VertexColouring in &Grape; is equ\ ivalent to in &Digraphs;,\n except it returns a transformation rather\ than a list of vertex\n colors.\n \n \ \n \n \n\n \n \n \ CompleteSubgraphs\n \n \n \n \n \n \n The functionality of CompleteSubgraphs in &Grape; is \ provided\n by and \n in &Digraphs;.\n \n \n \n \n\n \n \n \ CompleteSubgraphsOfGivenSize\n \n \n \ \n \n \n \ \n Much of the functionality of CompleteSubgr\ aphsOfGivenSize in\n &Grape; is provided by and in &Digra\ phs;, except that the\n functionality relating to vertex weights an\ d partial colourings is\n not implemented.\n \n \ \n \n \n\n \n \n\n \ \n \n Automorphism groups and isomorphism testing fo\ r graphs\n \n \n \n The table\ in this section contains more information when viewed in\n html format\ .\n \n \n\n \n \n\ \n \n \n &Grape; command\n \n \ \n &Digraphs; command\n \n \n \ \n Comments\n \n <\ /Item>\n \n \n\n \n \n \ AutGroupGraph\n \n \n \n \n \n \n AutGroupGraph in &Grape;\ is equivalent to\n in &Digraphs;.\n \n \n \n \ \n\n \n \n GraphIsomorphism\n \n \n \n \n \n \n GraphIsomorphism in &Grape; is equivalent to\ in &D\ igraphs;.\n Note however that GraphIsomorphism's optional ar\ gument\n firstunbindcanon is not applicable, since the canon\ ical\n labellings of a digraph are not portable between sessions.\n\ \n \n \n \n\n \n \n IsIsomorphicGraph\n \n \ \n \n \n \n \n \ IsIsomorphicGraph in &Grape; is equivalent to in &Digraphs;.\n N\ ote however that IsIsomorphicGraph's optional argument\n \ firstunbindcanon is not applicable, since the canonical\n label\ lings of a digraph are not portable between sessions.\n \n \ \n \n \n\n \n \n \ GraphIsomorphismClassRepresentatives\n \n <\ Item>\n None\n \n \n \n There is no analogous function in &Digraphs;, although th\ is feature\n might be implemented in the future.\n \ \n \n \n \n\n \n \n\n \n\n\n\n\n\n", inputorigins := [ [ 1, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main.\ xml", 1 ], [ 36, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 2 ], [ 90, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 3 ], [ 132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 4 ], [ 208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 5 ], [ 256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 6 ], [ 298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 7 ], [ 368, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 8 ], [ 416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 9 ], [ 483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 10 ], [ 611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 11 ], [ 687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 12 ], [ 729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 13 ], [ 792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 14 ], [ 840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 15 ], [ 897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 16 ], [ 997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 17 ], [ 1060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 18 ], [ 1110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 19 ], [ 1149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 20 ], [ 1208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 21 ], [ 1260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 22 ], [ 1313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 23 ], [ 1372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 24 ], [ 1423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 25 ], [ 1515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 26 ], [ 1572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 27 ], [ 1577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/../P\ ackageInfo.g", 12 ], [ 1620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/../P\ ackageInfo.g", 13 ], [ 1663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/../P\ ackageInfo.g", 14 ], [ 1706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/../P\ ackageInfo.g", 15 ], [ 1749, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/../P\ ackageInfo.g", 16 ], [ 1792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/../P\ ackageInfo.g", 17 ], [ 1835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/../P\ ackageInfo.g", 18 ], [ 1876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/../P\ ackageInfo.g", 19 ], [ 1918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/../P\ ackageInfo.g", 20 ], [ 1953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 27 ], [ 1954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 28 ], [ 1960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 29 ], [ 1961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 30 ], [ 1984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 1 ], [ 1996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 2 ], [ 2024, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 3 ], [ 2063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 4 ], [ 2064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 5 ], [ 2087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 6 ], [ 2129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 7 ], [ 2190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 8 ], [ 2202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 9 ], [ 2203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 10 ], [ 2233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 11 ], [ 2280, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 12 ], [ 2332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 13 ], [ 2344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 14 ], [ 2345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 15 ], [ 2373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 16 ], [ 2410, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 17 ], [ 2482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 18 ], [ 2494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 19 ], [ 2495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 20 ], [ 2520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 21 ], [ 2562, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 22 ], [ 2613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 23 ], [ 2625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 24 ], [ 2626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 25 ], [ 2651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 26 ], [ 2690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 27 ], [ 2730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 28 ], [ 2742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 29 ], [ 2743, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 30 ], [ 2777, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 31 ], [ 2778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 32 ], [ 2812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 33 ], [ 2813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 34 ], [ 2845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 35 ], [ 2846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 36 ], [ 2874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 37 ], [ 2875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 38 ], [ 2916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 39 ], [ 2917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 40 ], [ 2952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 41 ], [ 2953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 42 ], [ 2986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 43 ], [ 2987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 44 ], [ 3017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 45 ], [ 3018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 46 ], [ 3050, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 47 ], [ 3051, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 48 ], [ 3096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 49 ], [ 3162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 50 ], [ 3200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 51 ], [ 3201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 52 ], [ 3275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 53 ], [ 3342, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 54 ], [ 3423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 55 ], [ 3502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 56 ], [ 3515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 57 ], [ 3530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 58 ], [ 3531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 59 ], [ 3544, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 60 ], [ 3621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 61 ], [ 3654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 62 ], [ 3668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 63 ], [ 3669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 64 ], [ 3690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 65 ], [ 3766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 66 ], [ 3793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 67 ], [ 3794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 68 ], [ 3875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 69 ], [ 3941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 70 ], [ 3963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 71 ], [ 3964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ti\ tle.xml", 72 ], [ 3977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 31 ], [ 3978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 32 ], [ 3979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 33 ], [ 3998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 34 ], [ 3999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 35 ], [ 4006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 36 ], [ 4008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 1 ], [ 4047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 2 ], [ 4059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 3 ], [ 4086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 4 ], [ 4099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 5 ], [ 4159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 6 ], [ 4160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 7 ], [ 4201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 8 ], [ 4202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 9 ], [ 4272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 10 ], [ 4337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 11 ], [ 4346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 12 ], [ 4377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 13 ], [ 4415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 14 ], [ 4451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 15 ], [ 4491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 16 ], [ 4524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 17 ], [ 4534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 18 ], [ 4575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 19 ], [ 4584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 20 ], [ 4617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 21 ], [ 4650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 22 ], [ 4681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 23 ], [ 4708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 24 ], [ 4748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 25 ], [ 4782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 26 ], [ 4814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 27 ], [ 4847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 28 ], [ 4880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 29 ], [ 4911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 30 ], [ 4921, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 31 ], [ 4922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 32 ], [ 5002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 33 ], [ 5079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 34 ], [ 5158, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 35 ], [ 5183, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 36 ], [ 5184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 37 ], [ 5256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 38 ], [ 5331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 39 ], [ 5403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 40 ], [ 5481, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 41 ], [ 5520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 42 ], [ 5521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 43 ], [ 5592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 44 ], [ 5671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 45 ], [ 5752, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 46 ], [ 5827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 47 ], [ 5904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 48 ], [ 5975, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 49 ], [ 6005, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 50 ], [ 6079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 51 ], [ 6086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 52 ], [ 6087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 53 ], [ 6170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 54 ], [ 6243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 55 ], [ 6317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 56 ], [ 6394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 57 ], [ 6469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 58 ], [ 6546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 59 ], [ 6616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 60 ], [ 6690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 61 ], [ 6763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 62 ], [ 6840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 63 ], [ 6908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 64 ], [ 6976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 65 ], [ 7052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 66 ], [ 7114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 67 ], [ 7132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 68 ], [ 7133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 69 ], [ 7198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 70 ], [ 7199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 71 ], [ 7273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 72 ], [ 7301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 73 ], [ 7302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 74 ], [ 7375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 75 ], [ 7452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 76 ], [ 7528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 77 ], [ 7578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 78 ], [ 7579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 79 ], [ 7660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 80 ], [ 7675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 81 ], [ 7676, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 82 ], [ 7750, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 83 ], [ 7751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 84 ], [ 7830, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 85 ], [ 7880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 86 ], [ 7881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 87 ], [ 7959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 88 ], [ 8040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 89 ], [ 8117, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 90 ], [ 8190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 91 ], [ 8265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 92 ], [ 8345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 93 ], [ 8404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 94 ], [ 8405, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 95 ], [ 8484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 96 ], [ 8559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 97 ], [ 8637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 98 ], [ 8713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 99 ], [ 8791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 100 ], [ 8868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 101 ], [ 8944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 102 ], [ 9025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 103 ], [ 9075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 104 ], [ 9076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 105 ], [ 9092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 106 ], [ 9105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap0.xml", 107 ], [ 9116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 36 ], [ 9132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 37 ], [ 9134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 1 ], [ 9172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 2 ], [ 9215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 3 ], [ 9216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 4 ], [ 9257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 5 ], [ 9301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 6 ], [ 9371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 7 ], [ 9391, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 8 ], [ 9392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 9 ], [ 9468, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 10 ], [ 9547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 11 ], [ 9616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 12 ], [ 9662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 13 ], [ 9663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 14 ], [ 9729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 15 ], [ 9772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 16 ], [ 9773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 17 ], [ 9784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 18 ], [ 9785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 19 ], [ 9798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 20 ], [ 9876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 21 ], [ 9939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 22 ], [ 9953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 23 ], [ 9954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 24 ], [ 9967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 25 ], [ 10047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 26 ], [ 10127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 27 ], [ 10203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 28 ], [ 10219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 29 ], [ 10233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 30 ], [ 10234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 31 ], [ 10296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 32 ], [ 10350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 33 ], [ 10362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 34 ], [ 10363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 35 ], [ 10376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 36 ], [ 10454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 37 ], [ 10511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 38 ], [ 10586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 39 ], [ 10614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 40 ], [ 10691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 41 ], [ 10771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 42 ], [ 10833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 43 ], [ 10891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 44 ], [ 10905, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 45 ], [ 10912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 46 ], [ 10925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 47 ], [ 11003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 48 ], [ 11065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 49 ], [ 11084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 50 ], [ 11106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 51 ], [ 11172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 52 ], [ 11247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 53 ], [ 11324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 54 ], [ 11398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 55 ], [ 11469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 56 ], [ 11537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 57 ], [ 11551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 58 ], [ 11552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 59 ], [ 11565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 60 ], [ 11635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 61 ], [ 11730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 62 ], [ 11744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 63 ], [ 11745, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 64 ], [ 11758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 65 ], [ 11830, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 66 ], [ 11860, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 67 ], [ 11874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 68 ], [ 11875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 69 ], [ 11888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 70 ], [ 11968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 71 ], [ 12045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 72 ], [ 12105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 73 ], [ 12119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 74 ], [ 12120, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 75 ], [ 12133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 76 ], [ 12192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 77 ], [ 12252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 78 ], [ 12270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 79 ], [ 12291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 80 ], [ 12309, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 81 ], [ 12377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 82 ], [ 12428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 83 ], [ 12442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 84 ], [ 12443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 85 ], [ 12456, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 86 ], [ 12537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 87 ], [ 12551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 88 ], [ 12552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 89 ], [ 12565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 90 ], [ 12610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 91 ], [ 12624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 92 ], [ 12636, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 93 ], [ 12637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 94 ], [ 12705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 95 ], [ 12759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 96 ], [ 12804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 97 ], [ 12817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 98 ], [ 12818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 99 ], [ 12898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 100 ], [ 12978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 101 ], [ 12979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 102 ], [ 13029, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 103 ], [ 13082, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 104 ], [ 13083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 105 ], [ 13163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 106 ], [ 13164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 107 ], [ 13239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 108 ], [ 13318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 109 ], [ 13377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 110 ], [ 13378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 111 ], [ 13458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 112 ], [ 13459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 113 ], [ 13502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 114 ], [ 13545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 115 ], [ 13546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 116 ], [ 13625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 117 ], [ 13642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 118 ], [ 13643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 119 ], [ 13656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 120 ], [ 13721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 121 ], [ 13788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 122 ], [ 13861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 123 ], [ 13875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 124 ], [ 13876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 125 ], [ 13954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 126 ], [ 14014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 127 ], [ 14032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 128 ], [ 14045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 129 ], [ 14046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 130 ], [ 14126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 131 ], [ 14206, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 132 ], [ 14207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 133 ], [ 14255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 134 ], [ 14306, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 135 ], [ 14365, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 136 ], [ 14439, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 137 ], [ 14477, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 138 ], [ 14486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 139 ], [ 14487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 140 ], [ 14566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 141 ], [ 14567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 142 ], [ 14639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 143 ], [ 14659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 144 ], [ 14669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 145 ], [ 14679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 146 ], [ 14691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 147 ], [ 14709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 148 ], [ 14718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 149 ], [ 14719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 150 ], [ 14803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 151 ], [ 14885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 152 ], [ 14964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 153 ], [ 15045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 154 ], [ 15096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 155 ], [ 15097, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 156 ], [ 15171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 157 ], [ 15249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 158 ], [ 15333, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 159 ], [ 15371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 160 ], [ 15454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 161 ], [ 15536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 162 ], [ 15619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 163 ], [ 15701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 164 ], [ 15731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 165 ], [ 15744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 166 ], [ 15745, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 167 ], [ 15825, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 168 ], [ 15905, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 169 ], [ 15906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 170 ], [ 15955, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 171 ], [ 16007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 172 ], [ 16086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 173 ], [ 16165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 174 ], [ 16241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 175 ], [ 16285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 176 ], [ 16286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 177 ], [ 16290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 12 ], [ 16303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 13 ], [ 16343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 14 ], [ 16372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 15 ], [ 16388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 16 ], [ 16466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 17 ], [ 16485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 18 ], [ 16502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 19 ], [ 16516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 177 ], [ 16517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 178 ], [ 16530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 179 ], [ 16531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 180 ], [ 16611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 181 ], [ 16691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 182 ], [ 16692, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 183 ], [ 16738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 184 ], [ 16787, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 185 ], [ 16788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 186 ], [ 16862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 187 ], [ 16928, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 188 ], [ 16998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 189 ], [ 17043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 190 ], [ 17044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 191 ], [ 17125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 192 ], [ 17197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 193 ], [ 17275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 194 ], [ 17356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 195 ], [ 17397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 196 ], [ 17398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 197 ], [ 17402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 73 ], [ 17415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 74 ], [ 17459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 75 ], [ 17509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 76 ], [ 17525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 77 ], [ 17604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 78 ], [ 17680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 79 ], [ 17744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 80 ], [ 17821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 81 ], [ 17838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 82 ], [ 17852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 197 ], [ 17853, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 198 ], [ 17857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 39 ], [ 17870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 40 ], [ 17915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 41 ], [ 17965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 42 ], [ 17981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 43 ], [ 18058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 44 ], [ 18086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 45 ], [ 18151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 46 ], [ 18152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 47 ], [ 18220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 48 ], [ 18290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 49 ], [ 18324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 50 ], [ 18341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 51 ], [ 18355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 198 ], [ 18356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 199 ], [ 18360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 55 ], [ 18373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 56 ], [ 18417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 57 ], [ 18447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 58 ], [ 18463, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 59 ], [ 18540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 60 ], [ 18612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 61 ], [ 18678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 62 ], [ 18723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 63 ], [ 18724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 64 ], [ 18803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 65 ], [ 18880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 66 ], [ 18911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 67 ], [ 18968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 68 ], [ 18985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/util\ s.xml", 69 ], [ 18999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 199 ], [ 19000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 200 ], [ 19001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 201 ], [ 19014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 202 ], [ 19015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 203 ], [ 19095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 204 ], [ 19175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 205 ], [ 19176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 206 ], [ 19177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap1.xml", 207 ], [ 19188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 37 ], [ 19209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 38 ], [ 19211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 1 ], [ 19283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 2 ], [ 19284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 3 ], [ 19342, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 4 ], [ 19343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 5 ], [ 19391, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 6 ], [ 19395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 12 ], [ 19408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 13 ], [ 19451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 14 ], [ 19467, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 15 ], [ 19529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 16 ], [ 19602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 17 ], [ 19673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 18 ], [ 19706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 19 ], [ 19725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 20 ], [ 19739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 6 ], [ 19740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 7 ], [ 19744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 67 ], [ 19757, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 68 ], [ 19807, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 69 ], [ 19823, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 70 ], [ 19902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 71 ], [ 19976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 72 ], [ 20056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 73 ], [ 20121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 74 ], [ 20130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 75 ], [ 20131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 76 ], [ 20206, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 77 ], [ 20279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 78 ], [ 20292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 79 ], [ 20311, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 80 ], [ 20325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 7 ], [ 20326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 8 ], [ 20330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 47 ], [ 20343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 48 ], [ 20395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 49 ], [ 20411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 50 ], [ 20487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 51 ], [ 20556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 52 ], [ 20606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 53 ], [ 20668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 54 ], [ 20669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 55 ], [ 20724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 56 ], [ 20799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 57 ], [ 20866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 58 ], [ 20867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 59 ], [ 20930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 60 ], [ 21005, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 61 ], [ 21083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 62 ], [ 21100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 63 ], [ 21114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 8 ], [ 21115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 9 ], [ 21119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 35 ], [ 21132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 36 ], [ 21181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 37 ], [ 21197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 38 ], [ 21276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 39 ], [ 21353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 40 ], [ 21427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 41 ], [ 21449, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 42 ], [ 21468, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 43 ], [ 21482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 9 ], [ 21483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 10 ], [ 21487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 24 ], [ 21500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 25 ], [ 21564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 26 ], [ 21580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 27 ], [ 21660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 28 ], [ 21741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 29 ], [ 21763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 30 ], [ 21780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 31 ], [ 21794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 10 ], [ 21795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 11 ], [ 21799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 84 ], [ 21812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 85 ], [ 21855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 86 ], [ 21885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 87 ], [ 21901, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 88 ], [ 21968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 89 ], [ 22024, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 90 ], [ 22041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 91 ], [ 22055, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 11 ], [ 22056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 12 ], [ 22060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 109 ], [ 22073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 110 ], [ 22137, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 111 ], [ 22190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 112 ], [ 22230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 113 ], [ 22289, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 114 ], [ 22347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 115 ], [ 22379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 116 ], [ 22395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 117 ], [ 22471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 118 ], [ 22545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 119 ], [ 22623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 120 ], [ 22698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 121 ], [ 22768, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 122 ], [ 22841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 123 ], [ 22893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 124 ], [ 22904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 125 ], [ 22959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 126 ], [ 22972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 127 ], [ 23037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 128 ], [ 23118, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 129 ], [ 23160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 130 ], [ 23217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 131 ], [ 23284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 132 ], [ 23285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 133 ], [ 23366, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 134 ], [ 23446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 135 ], [ 23512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 136 ], [ 23593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 137 ], [ 23634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 138 ], [ 23648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 139 ], [ 23649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 140 ], [ 23684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 141 ], [ 23697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 142 ], [ 23767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 143 ], [ 23846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 144 ], [ 23919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 145 ], [ 23959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 146 ], [ 24020, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 147 ], [ 24086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 148 ], [ 24163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 149 ], [ 24229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 150 ], [ 24301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 151 ], [ 24314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 152 ], [ 24315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 153 ], [ 24387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 154 ], [ 24407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 155 ], [ 24421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 156 ], [ 24422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 157 ], [ 24471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 158 ], [ 24484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 159 ], [ 24543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 160 ], [ 24622, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 161 ], [ 24687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 162 ], [ 24727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 163 ], [ 24780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 164 ], [ 24846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 165 ], [ 24923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 166 ], [ 24989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 167 ], [ 25061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 168 ], [ 25075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 169 ], [ 25076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 170 ], [ 25121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 171 ], [ 25134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 172 ], [ 25206, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 173 ], [ 25282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 174 ], [ 25362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 175 ], [ 25437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 176 ], [ 25488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 177 ], [ 25568, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 178 ], [ 25582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 179 ], [ 25583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 180 ], [ 25641, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 181 ], [ 25654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 182 ], [ 25715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 183 ], [ 25716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 184 ], [ 25789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 185 ], [ 25860, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 186 ], [ 25939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 187 ], [ 26013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 188 ], [ 26094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 189 ], [ 26167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 190 ], [ 26244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 191 ], [ 26293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 192 ], [ 26294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 193 ], [ 26375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 194 ], [ 26452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 195 ], [ 26507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 196 ], [ 26521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 197 ], [ 26522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 198 ], [ 26567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 199 ], [ 26580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 200 ], [ 26658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 201 ], [ 26739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 202 ], [ 26783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 203 ], [ 26797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 204 ], [ 26798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 205 ], [ 26839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 206 ], [ 26852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 207 ], [ 26929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 208 ], [ 27009, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 209 ], [ 27086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 210 ], [ 27166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 211 ], [ 27234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 212 ], [ 27274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 213 ], [ 27288, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 214 ], [ 27300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 215 ], [ 27301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 216 ], [ 27324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 217 ], [ 27345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 218 ], [ 27397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 219 ], [ 27454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 220 ], [ 27491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 221 ], [ 27543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 222 ], [ 27594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 223 ], [ 27638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 224 ], [ 27701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 225 ], [ 27751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 226 ], [ 27811, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 227 ], [ 27867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 228 ], [ 27891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 229 ], [ 27938, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 230 ], [ 27981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 231 ], [ 28042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 232 ], [ 28043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 233 ], [ 28123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 234 ], [ 28202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 235 ], [ 28273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 236 ], [ 28337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 237 ], [ 28406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 238 ], [ 28428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 239 ], [ 28447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 240 ], [ 28468, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 241 ], [ 28476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 242 ], [ 28519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 243 ], [ 28529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 244 ], [ 28577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 245 ], [ 28640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 246 ], [ 28713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 247 ], [ 28782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 248 ], [ 28851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 249 ], [ 28920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 250 ], [ 28989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 251 ], [ 29047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 252 ], [ 29074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 253 ], [ 29101, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 254 ], [ 29108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 255 ], [ 29133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 256 ], [ 29174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 257 ], [ 29223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 258 ], [ 29251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 259 ], [ 29267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 260 ], [ 29283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 261 ], [ 29334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 262 ], [ 29383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 263 ], [ 29397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 264 ], [ 29414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 265 ], [ 29428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 12 ], [ 29429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 13 ], [ 29433, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 269 ], [ 29446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 270 ], [ 29507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 271 ], [ 29539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 272 ], [ 29555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 273 ], [ 29631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 274 ], [ 29705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 275 ], [ 29783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 276 ], [ 29858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 277 ], [ 29928, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 278 ], [ 30001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 279 ], [ 30057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 280 ], [ 30058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 281 ], [ 30130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 282 ], [ 30205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 283 ], [ 30247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 284 ], [ 30248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 285 ], [ 30320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 286 ], [ 30393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 287 ], [ 30453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 288 ], [ 30503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 289 ], [ 30504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 290 ], [ 30527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 291 ], [ 30559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 292 ], [ 30578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 293 ], [ 30597, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 294 ], [ 30616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 295 ], [ 30635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 296 ], [ 30656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 297 ], [ 30707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 298 ], [ 30744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 299 ], [ 30767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 300 ], [ 30791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 301 ], [ 30817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 302 ], [ 30862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 303 ], [ 30885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 304 ], [ 30912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 305 ], [ 30966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 306 ], [ 30990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 307 ], [ 31015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 308 ], [ 31042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 309 ], [ 31085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 310 ], [ 31099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 311 ], [ 31116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 312 ], [ 31130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 13 ], [ 31131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 14 ], [ 31135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 316 ], [ 31148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 317 ], [ 31204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 318 ], [ 31236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 319 ], [ 31252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 320 ], [ 31328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 321 ], [ 31402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 322 ], [ 31480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 323 ], [ 31555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 324 ], [ 31625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 325 ], [ 31698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 326 ], [ 31754, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 327 ], [ 31755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 328 ], [ 31832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 329 ], [ 31911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 330 ], [ 31947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 331 ], [ 31948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 332 ], [ 32020, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 333 ], [ 32079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 334 ], [ 32154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 335 ], [ 32176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 336 ], [ 32177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 337 ], [ 32213, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 338 ], [ 32214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 339 ], [ 32237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 340 ], [ 32258, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 341 ], [ 32301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 342 ], [ 32346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 343 ], [ 32392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 344 ], [ 32413, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 345 ], [ 32456, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 346 ], [ 32505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 347 ], [ 32552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 348 ], [ 32591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 349 ], [ 32634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 350 ], [ 32683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 351 ], [ 32728, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 352 ], [ 32742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 353 ], [ 32759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 354 ], [ 32773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 14 ], [ 32774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 15 ], [ 32778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 149 ], [ 32791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 150 ], [ 32846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 151 ], [ 32858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 152 ], [ 32884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 153 ], [ 32897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 154 ], [ 32913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 155 ], [ 32988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 156 ], [ 33063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 157 ], [ 33104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 158 ], [ 33189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 159 ], [ 33262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 160 ], [ 33339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 161 ], [ 33362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 162 ], [ 33371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 163 ], [ 33372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 164 ], [ 33449, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 165 ], [ 33523, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 166 ], [ 33524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 167 ], [ 33547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 168 ], [ 33610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 169 ], [ 33666, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 170 ], [ 33712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 171 ], [ 33741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 172 ], [ 33802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 173 ], [ 33845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 174 ], [ 33867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 175 ], [ 33881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 176 ], [ 33898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 177 ], [ 33912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 15 ], [ 33913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 16 ], [ 33917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 358 ], [ 33930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 359 ], [ 33988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 360 ], [ 34045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 361 ], [ 34077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 362 ], [ 34093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 363 ], [ 34167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 364 ], [ 34239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 365 ], [ 34315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 366 ], [ 34388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 367 ], [ 34456, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 368 ], [ 34527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 369 ], [ 34581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 370 ], [ 34582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 371 ], [ 34654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 372 ], [ 34722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 373 ], [ 34796, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 374 ], [ 34877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 375 ], [ 34958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 376 ], [ 34988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 377 ], [ 34989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 378 ], [ 35065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 379 ], [ 35138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 380 ], [ 35139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 381 ], [ 35173, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 382 ], [ 35174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 383 ], [ 35197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 384 ], [ 35231, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 385 ], [ 35275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 386 ], [ 35337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 387 ], [ 35374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 388 ], [ 35421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 389 ], [ 35483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 390 ], [ 35533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 391 ], [ 35584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 392 ], [ 35646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 393 ], [ 35694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 394 ], [ 35708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 395 ], [ 35725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 396 ], [ 35739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 16 ], [ 35740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 17 ], [ 35744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 48 ], [ 35757, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 49 ], [ 35804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 50 ], [ 35847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 51 ], [ 35863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 52 ], [ 35938, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 53 ], [ 36016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 54 ], [ 36062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 55 ], [ 36143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 56 ], [ 36223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 57 ], [ 36296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 58 ], [ 36297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 59 ], [ 36374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 60 ], [ 36375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 61 ], [ 36448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 62 ], [ 36500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 63 ], [ 36501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 64 ], [ 36572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 65 ], [ 36649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 66 ], [ 36722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 67 ], [ 36805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 68 ], [ 36806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 69 ], [ 36872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 70 ], [ 36873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 71 ], [ 36896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 72 ], [ 36924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 73 ], [ 36963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 74 ], [ 36986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 75 ], [ 37032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 76 ], [ 37073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 77 ], [ 37101, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 78 ], [ 37124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 79 ], [ 37170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 80 ], [ 37210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 81 ], [ 37255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 82 ], [ 37295, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 83 ], [ 37300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 84 ], [ 37341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 85 ], [ 37361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 86 ], [ 37378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 87 ], [ 37392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 17 ], [ 37393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 18 ], [ 37406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 19 ], [ 37407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 20 ], [ 37462, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 21 ], [ 37466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 539 ], [ 37479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 540 ], [ 37527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 541 ], [ 37567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 542 ], [ 37583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 543 ], [ 37653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 544 ], [ 37727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 545 ], [ 37769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 546 ], [ 37836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 547 ], [ 37883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 548 ], [ 37892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 549 ], [ 37911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 550 ], [ 37961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 551 ], [ 38006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 552 ], [ 38032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 553 ], [ 38060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 554 ], [ 38074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 555 ], [ 38091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 556 ], [ 38105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 21 ], [ 38106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 22 ], [ 38110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 400 ], [ 38123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 401 ], [ 38175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 402 ], [ 38223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 403 ], [ 38239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 404 ], [ 38315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 405 ], [ 38389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 406 ], [ 38467, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 407 ], [ 38542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 408 ], [ 38612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 409 ], [ 38685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 410 ], [ 38741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 411 ], [ 38742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 412 ], [ 38822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 413 ], [ 38902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 414 ], [ 38972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 415 ], [ 39041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 416 ], [ 39098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 417 ], [ 39107, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 418 ], [ 39108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 419 ], [ 39188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 420 ], [ 39267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 421 ], [ 39336, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 422 ], [ 39345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 423 ], [ 39346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 424 ], [ 39427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 425 ], [ 39506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 426 ], [ 39585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 427 ], [ 39659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 428 ], [ 39684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 429 ], [ 39685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 430 ], [ 39708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 431 ], [ 39767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 432 ], [ 39819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 433 ], [ 39838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 434 ], [ 39886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 435 ], [ 39908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 436 ], [ 39955, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 437 ], [ 39977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 438 ], [ 39982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 439 ], [ 40016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 440 ], [ 40064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 441 ], [ 40092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 442 ], [ 40116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 443 ], [ 40162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 444 ], [ 40176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 445 ], [ 40193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 446 ], [ 40207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 22 ], [ 40208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 23 ], [ 40212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 12 ], [ 40225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 13 ], [ 40262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 14 ], [ 40308, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 15 ], [ 40324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 16 ], [ 40424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 17 ], [ 40503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 18 ], [ 40504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 19 ], [ 40581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 20 ], [ 40660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 21 ], [ 40738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 22 ], [ 40818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 23 ], [ 40819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 24 ], [ 40842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 25 ], [ 40902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 26 ], [ 40958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 27 ], [ 40982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 28 ], [ 40987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 29 ], [ 41021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 30 ], [ 41033, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 31 ], [ 41102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 32 ], [ 41112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 33 ], [ 41131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 34 ], [ 41195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 35 ], [ 41253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 36 ], [ 41268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 37 ], [ 41296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 38 ], [ 41352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 39 ], [ 41376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 40 ], [ 41423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 41 ], [ 41452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 42 ], [ 41470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 43 ], [ 41487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 44 ], [ 41501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 23 ], [ 41502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 24 ], [ 41506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1449 ], [ 41519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1450 ], [ 41558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1451 ], [ 41604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1452 ], [ 41620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1453 ], [ 41693, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1454 ], [ 41771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1455 ], [ 41839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1456 ], [ 41917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1457 ], [ 41985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1458 ], [ 41986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1459 ], [ 42009, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1460 ], [ 42047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1461 ], [ 42092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1462 ], [ 42114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1463 ], [ 42182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1464 ], [ 42235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1465 ], [ 42304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1466 ], [ 42318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1467 ], [ 42335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1468 ], [ 42349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 24 ], [ 42350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 25 ], [ 42354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1472 ], [ 42367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1473 ], [ 42415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1474 ], [ 42469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1475 ], [ 42485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1476 ], [ 42561, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1477 ], [ 42638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1478 ], [ 42685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1479 ], [ 42763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1480 ], [ 42764, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1481 ], [ 42839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1482 ], [ 42906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1483 ], [ 42981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1484 ], [ 43059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1485 ], [ 43098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1486 ], [ 43099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1487 ], [ 43122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1488 ], [ 43158, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1489 ], [ 43203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1490 ], [ 43229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1491 ], [ 43259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1492 ], [ 43304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1493 ], [ 43347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1494 ], [ 43373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1495 ], [ 43403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1496 ], [ 43429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1497 ], [ 43437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1498 ], [ 43474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1499 ], [ 43519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1500 ], [ 43545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1501 ], [ 43563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1502 ], [ 43580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1503 ], [ 43594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 25 ], [ 43595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 26 ], [ 43608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 27 ], [ 43609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 28 ], [ 43661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 29 ], [ 43665, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 450 ], [ 43678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 451 ], [ 43730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 452 ], [ 43780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 453 ], [ 43837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 454 ], [ 43880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 455 ], [ 43912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 456 ], [ 43928, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 457 ], [ 43995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 458 ], [ 44066, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 459 ], [ 44105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 460 ], [ 44106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 461 ], [ 44180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 462 ], [ 44199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 463 ], [ 44227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 464 ], [ 44270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 465 ], [ 44295, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 466 ], [ 44300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 467 ], [ 44340, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 468 ], [ 44346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 469 ], [ 44374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 470 ], [ 44419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 471 ], [ 44433, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 472 ], [ 44450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 473 ], [ 44464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 29 ], [ 44465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 30 ], [ 44469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 477 ], [ 44482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 478 ], [ 44545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 479 ], [ 44606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 480 ], [ 44665, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 481 ], [ 44726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 482 ], [ 44758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 483 ], [ 44774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 484 ], [ 44840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 485 ], [ 44911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 486 ], [ 44974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 487 ], [ 44993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 488 ], [ 45021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 489 ], [ 45064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 490 ], [ 45110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 491 ], [ 45157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 492 ], [ 45184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 493 ], [ 45190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 494 ], [ 45202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 495 ], [ 45207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 496 ], [ 45251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 497 ], [ 45294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 498 ], [ 45321, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 499 ], [ 45326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 500 ], [ 45338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 501 ], [ 45343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 502 ], [ 45385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 503 ], [ 45428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 504 ], [ 45454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 505 ], [ 45460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 506 ], [ 45504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 507 ], [ 45549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 508 ], [ 45575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 509 ], [ 45580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 510 ], [ 45626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 511 ], [ 45671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 512 ], [ 45717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 513 ], [ 45762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 514 ], [ 45789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 515 ], [ 45794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 516 ], [ 45806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 517 ], [ 45811, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 518 ], [ 45855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 519 ], [ 45902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 520 ], [ 45929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 521 ], [ 45935, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 522 ], [ 45947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 523 ], [ 45952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 524 ], [ 45994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 525 ], [ 46039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 526 ], [ 46065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 527 ], [ 46070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 528 ], [ 46114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 529 ], [ 46159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 530 ], [ 46186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 531 ], [ 46191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 532 ], [ 46217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 533 ], [ 46235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 534 ], [ 46252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 535 ], [ 46266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 30 ], [ 46267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 31 ], [ 46271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 622 ], [ 46284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 623 ], [ 46340, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 624 ], [ 46372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 625 ], [ 46388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 626 ], [ 46460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 627 ], [ 46530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 628 ], [ 46607, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 629 ], [ 46682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 630 ], [ 46718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 631 ], [ 46719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 632 ], [ 46766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 633 ], [ 46834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 634 ], [ 46891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 635 ], [ 46892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 636 ], [ 46962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 637 ], [ 47037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 638 ], [ 47111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 639 ], [ 47127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 640 ], [ 47167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 641 ], [ 47168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 642 ], [ 47191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 643 ], [ 47259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 644 ], [ 47310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 645 ], [ 47348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 646 ], [ 47398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 647 ], [ 47426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 648 ], [ 47437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 649 ], [ 47470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 650 ], [ 47519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 651 ], [ 47564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 652 ], [ 47612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 653 ], [ 47626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 654 ], [ 47631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 655 ], [ 47645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 656 ], [ 47662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 657 ], [ 47676, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 31 ], [ 47677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 32 ], [ 47681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1578 ], [ 47694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1579 ], [ 47740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1580 ], [ 47790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1581 ], [ 47822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1582 ], [ 47838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1583 ], [ 47906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1584 ], [ 47970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1585 ], [ 48047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1586 ], [ 48089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1587 ], [ 48130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1588 ], [ 48139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1589 ], [ 48140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1590 ], [ 48222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1591 ], [ 48274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1592 ], [ 48353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1593 ], [ 48424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1594 ], [ 48468, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1595 ], [ 48477, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1596 ], [ 48478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1597 ], [ 48556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1598 ], [ 48635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1599 ], [ 48657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1600 ], [ 48680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1601 ], [ 48729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1602 ], [ 48774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1603 ], [ 48803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1604 ], [ 48848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1605 ], [ 48871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1606 ], [ 48900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1607 ], [ 48922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1608 ], [ 48965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1609 ], [ 48987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1610 ], [ 49030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1611 ], [ 49061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1612 ], [ 49063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1613 ], [ 49094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1614 ], [ 49096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1615 ], [ 49149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1616 ], [ 49192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1617 ], [ 49216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1618 ], [ 49259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1619 ], [ 49267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1620 ], [ 49310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1621 ], [ 49324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1622 ], [ 49341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1623 ], [ 49355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 32 ], [ 49356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 33 ], [ 49360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1771 ], [ 49373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1772 ], [ 49431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1773 ], [ 49493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1774 ], [ 49563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1775 ], [ 49637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1776 ], [ 49669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1777 ], [ 49685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1778 ], [ 49760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1779 ], [ 49834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1780 ], [ 49903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1781 ], [ 49977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1782 ], [ 50053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1783 ], [ 50062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1784 ], [ 50063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1785 ], [ 50140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1786 ], [ 50189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1787 ], [ 50194, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1788 ], [ 50272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1789 ], [ 50352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1790 ], [ 50387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1791 ], [ 50388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1792 ], [ 50464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1793 ], [ 50520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1794 ], [ 50543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1795 ], [ 50593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1796 ], [ 50643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1797 ], [ 50697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1798 ], [ 50702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1799 ], [ 50725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1800 ], [ 50765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1801 ], [ 50806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1802 ], [ 50861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1803 ], [ 50915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1804 ], [ 50920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1805 ], [ 50943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1806 ], [ 50974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1807 ], [ 51019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1808 ], [ 51062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1809 ], [ 51098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1810 ], [ 51138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1811 ], [ 51146, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1812 ], [ 51186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1813 ], [ 51200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1814 ], [ 51217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1815 ], [ 51231, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 33 ], [ 51232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 34 ], [ 51236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1819 ], [ 51249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1820 ], [ 51311, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1821 ], [ 51377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1822 ], [ 51409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1823 ], [ 51425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1824 ], [ 51504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1825 ], [ 51573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1826 ], [ 51651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1827 ], [ 51729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1828 ], [ 51797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1829 ], [ 51827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1830 ], [ 51911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1831 ], [ 51976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1832 ], [ 52010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1833 ], [ 52019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1834 ], [ 52020, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1835 ], [ 52098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1836 ], [ 52174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1837 ], [ 52175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1838 ], [ 52242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1839 ], [ 52265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1840 ], [ 52315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1841 ], [ 52365, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1842 ], [ 52423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1843 ], [ 52428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1844 ], [ 52451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1845 ], [ 52491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1846 ], [ 52536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1847 ], [ 52595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1848 ], [ 52653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1849 ], [ 52658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1850 ], [ 52681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1851 ], [ 52712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1852 ], [ 52761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1853 ], [ 52804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1854 ], [ 52844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1855 ], [ 52886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1856 ], [ 52894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1857 ], [ 52936, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1858 ], [ 52950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1859 ], [ 52967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1860 ], [ 52981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 34 ], [ 52982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 35 ], [ 52986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1985 ], [ 52999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1986 ], [ 53055, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1987 ], [ 53115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1988 ], [ 53169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1989 ], [ 53227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1990 ], [ 53275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1991 ], [ 53291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1992 ], [ 53357, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1993 ], [ 53434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1994 ], [ 53509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1995 ], [ 53588, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1996 ], [ 53613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1997 ], [ 53614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1998 ], [ 53689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1999 ], [ 53754, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2000 ], [ 53834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2001 ], [ 53910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2002 ], [ 53988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2003 ], [ 54039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2004 ], [ 54040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2005 ], [ 54115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2006 ], [ 54193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2007 ], [ 54245, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2008 ], [ 54246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2009 ], [ 54326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2010 ], [ 54402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2011 ], [ 54453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2012 ], [ 54454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2013 ], [ 54477, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2014 ], [ 54533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2015 ], [ 54583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2016 ], [ 54615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2017 ], [ 54620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2018 ], [ 54664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2019 ], [ 54719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2020 ], [ 54747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2021 ], [ 54778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2022 ], [ 54822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2023 ], [ 54827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2024 ], [ 54874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2025 ], [ 54897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2026 ], [ 54967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2027 ], [ 54990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2028 ], [ 55051, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2029 ], [ 55063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2030 ], [ 55068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2031 ], [ 55098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2032 ], [ 55143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2033 ], [ 55183, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2034 ], [ 55238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2035 ], [ 55278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2036 ], [ 55283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2037 ], [ 55324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2038 ], [ 55329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2039 ], [ 55377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2040 ], [ 55382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2041 ], [ 55425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2042 ], [ 55470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2043 ], [ 55502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2044 ], [ 55547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2045 ], [ 55555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2046 ], [ 55600, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2047 ], [ 55614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2048 ], [ 55631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2049 ], [ 55645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 35 ], [ 55646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 36 ], [ 55650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 845 ], [ 55663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 846 ], [ 55713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 847 ], [ 55745, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 848 ], [ 55761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 849 ], [ 55841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 850 ], [ 55917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 851 ], [ 55995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 852 ], [ 56009, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 853 ], [ 56018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 854 ], [ 56019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 855 ], [ 56092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 856 ], [ 56162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 857 ], [ 56238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 858 ], [ 56269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 859 ], [ 56278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 860 ], [ 56279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 861 ], [ 56355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 862 ], [ 56437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 863 ], [ 56518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 864 ], [ 56576, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 865 ], [ 56660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 866 ], [ 56738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 867 ], [ 56747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 868 ], [ 56748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 869 ], [ 56818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 870 ], [ 56893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 871 ], [ 56967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 872 ], [ 56999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 873 ], [ 57000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 874 ], [ 57023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 875 ], [ 57073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 876 ], [ 57118, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 877 ], [ 57143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 878 ], [ 57154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 879 ], [ 57176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 880 ], [ 57239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 881 ], [ 57252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 882 ], [ 57282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 883 ], [ 57309, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 884 ], [ 57344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 885 ], [ 57389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 886 ], [ 57416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 887 ], [ 57427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 888 ], [ 57451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 889 ], [ 57514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 890 ], [ 57557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 891 ], [ 57599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 892 ], [ 57613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 893 ], [ 57630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 894 ], [ 57644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 36 ], [ 57645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 37 ], [ 57649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1507 ], [ 57662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1508 ], [ 57708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1509 ], [ 57758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1510 ], [ 57790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1511 ], [ 57806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1512 ], [ 57886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1513 ], [ 57964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1514 ], [ 58027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1515 ], [ 58028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1516 ], [ 58108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1517 ], [ 58194, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1518 ], [ 58271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1519 ], [ 58294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1520 ], [ 58358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1521 ], [ 58404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1522 ], [ 58428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1523 ], [ 58474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1524 ], [ 58500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1525 ], [ 58556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1526 ], [ 58603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1527 ], [ 58648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1528 ], [ 58670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1529 ], [ 58733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1530 ], [ 58771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1531 ], [ 58834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1532 ], [ 58879, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1533 ], [ 58922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1534 ], [ 58945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1535 ], [ 58969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1536 ], [ 58993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1537 ], [ 59036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1538 ], [ 59059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1539 ], [ 59083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1540 ], [ 59097, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1541 ], [ 59114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1542 ], [ 59128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 37 ], [ 59129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 38 ], [ 59133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1546 ], [ 59146, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1547 ], [ 59189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1548 ], [ 59236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1549 ], [ 59268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1550 ], [ 59284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1551 ], [ 59363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1552 ], [ 59426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1553 ], [ 59501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1554 ], [ 59568, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1555 ], [ 59569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1556 ], [ 59643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1557 ], [ 59719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1558 ], [ 59799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1559 ], [ 59818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1560 ], [ 59841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1561 ], [ 59889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1562 ], [ 59916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1563 ], [ 59961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1564 ], [ 59982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1565 ], [ 60028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1566 ], [ 60073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1567 ], [ 60116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1568 ], [ 60137, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1569 ], [ 60180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1570 ], [ 60188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1571 ], [ 60231, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1572 ], [ 60245, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1573 ], [ 60262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1574 ], [ 60276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 38 ], [ 60277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 39 ], [ 60281, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1726 ], [ 60294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1727 ], [ 60349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1728 ], [ 60408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1729 ], [ 60440, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1730 ], [ 60456, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1731 ], [ 60530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1732 ], [ 60610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1733 ], [ 60634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1734 ], [ 60639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1735 ], [ 60698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1736 ], [ 60774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1737 ], [ 60849, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1738 ], [ 60924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1739 ], [ 60970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1740 ], [ 60971, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1741 ], [ 61049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1742 ], [ 61128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1743 ], [ 61151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1744 ], [ 61170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1745 ], [ 61223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1746 ], [ 61268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1747 ], [ 61306, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1748 ], [ 61362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1749 ], [ 61390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1750 ], [ 61395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1751 ], [ 61431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1752 ], [ 61483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1753 ], [ 61517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1754 ], [ 61567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1755 ], [ 61605, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1756 ], [ 61665, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1757 ], [ 61688, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1758 ], [ 61711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1759 ], [ 61756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1760 ], [ 61799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1761 ], [ 61832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1762 ], [ 61875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1763 ], [ 61883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1764 ], [ 61926, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1765 ], [ 61940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1766 ], [ 61957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1767 ], [ 61971, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 39 ], [ 61972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 40 ], [ 61976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1864 ], [ 61989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1865 ], [ 62045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1866 ], [ 62105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1867 ], [ 62170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1868 ], [ 62239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1869 ], [ 62271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1870 ], [ 62287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1871 ], [ 62357, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1872 ], [ 62437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1873 ], [ 62438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1874 ], [ 62516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1875 ], [ 62593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1876 ], [ 62663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1877 ], [ 62733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1878 ], [ 62803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1879 ], [ 62804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1880 ], [ 62882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1881 ], [ 62961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1882 ], [ 63001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1883 ], [ 63002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1884 ], [ 63072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1885 ], [ 63142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1886 ], [ 63214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1887 ], [ 63244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1888 ], [ 63245, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1889 ], [ 63305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1890 ], [ 63379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1891 ], [ 63452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1892 ], [ 63453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1893 ], [ 63476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1894 ], [ 63529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1895 ], [ 63574, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1896 ], [ 63628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1897 ], [ 63634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1898 ], [ 63657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1899 ], [ 63724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1900 ], [ 63733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1901 ], [ 63772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1902 ], [ 63829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1903 ], [ 63852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1904 ], [ 63918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1905 ], [ 63958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1906 ], [ 64007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1907 ], [ 64062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1908 ], [ 64086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1909 ], [ 64152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1910 ], [ 64209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1911 ], [ 64254, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1912 ], [ 64297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1913 ], [ 64340, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1914 ], [ 64383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1915 ], [ 64391, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1916 ], [ 64434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1917 ], [ 64448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1918 ], [ 64465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1919 ], [ 64479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 40 ], [ 64480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 41 ], [ 64484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1923 ], [ 64497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1924 ], [ 64555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1925 ], [ 64617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1926 ], [ 64684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1927 ], [ 64755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1928 ], [ 64787, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1929 ], [ 64803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1930 ], [ 64861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1931 ], [ 64908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1932 ], [ 64970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1933 ], [ 65030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1934 ], [ 65031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1935 ], [ 65104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1936 ], [ 65175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1937 ], [ 65253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1938 ], [ 65312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1939 ], [ 65381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1940 ], [ 65438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1941 ], [ 65439, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1942 ], [ 65517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1943 ], [ 65596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1944 ], [ 65638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1945 ], [ 65639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1946 ], [ 65715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1947 ], [ 65756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1948 ], [ 65782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1949 ], [ 65843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1950 ], [ 65852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1951 ], [ 65875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1952 ], [ 65918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1953 ], [ 65943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1954 ], [ 65948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1955 ], [ 65999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1956 ], [ 66044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1957 ], [ 66070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1958 ], [ 66076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1959 ], [ 66100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1960 ], [ 66123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1961 ], [ 66165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1962 ], [ 66210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1963 ], [ 66236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1964 ], [ 66241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1965 ], [ 66265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1966 ], [ 66292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1967 ], [ 66334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1968 ], [ 66378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1969 ], [ 66383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1970 ], [ 66416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1971 ], [ 66451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1972 ], [ 66456, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1973 ], [ 66516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1974 ], [ 66559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1975 ], [ 66604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1976 ], [ 66647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1977 ], [ 66655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1978 ], [ 66698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1979 ], [ 66712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1980 ], [ 66729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1981 ], [ 66743, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 41 ], [ 66744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 42 ], [ 66748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 261 ], [ 66761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 262 ], [ 66819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 263 ], [ 66851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 264 ], [ 66867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 265 ], [ 66947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 266 ], [ 66993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 267 ], [ 66994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 268 ], [ 67062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 269 ], [ 67117, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 270 ], [ 67126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 271 ], [ 67127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 272 ], [ 67201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 273 ], [ 67278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 274 ], [ 67357, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 275 ], [ 67400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 276 ], [ 67401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 277 ], [ 67424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 278 ], [ 67454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 279 ], [ 67499, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 280 ], [ 67532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 281 ], [ 67577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 282 ], [ 67591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 283 ], [ 67597, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 284 ], [ 67624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 285 ], [ 67635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 286 ], [ 67685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 287 ], [ 67730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 288 ], [ 67761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 289 ], [ 67791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 290 ], [ 67851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 291 ], [ 67895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 292 ], [ 67928, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 293 ], [ 67972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 294 ], [ 67986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 295 ], [ 67991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 296 ], [ 68005, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 297 ], [ 68022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 298 ], [ 68036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 42 ], [ 68037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 43 ], [ 68041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 302 ], [ 68054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 303 ], [ 68105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 304 ], [ 68148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 305 ], [ 68204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 306 ], [ 68253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 307 ], [ 68330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 308 ], [ 68389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 309 ], [ 68421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 310 ], [ 68437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 311 ], [ 68511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 312 ], [ 68580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 313 ], [ 68589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 314 ], [ 68590, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 315 ], [ 68632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 316 ], [ 68704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 317 ], [ 68781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 318 ], [ 68828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 319 ], [ 68837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 320 ], [ 68838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 321 ], [ 68912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 322 ], [ 68990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 323 ], [ 69066, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 324 ], [ 69114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 325 ], [ 69123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 326 ], [ 69124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 327 ], [ 69147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 328 ], [ 69177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 329 ], [ 69222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 330 ], [ 69260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 331 ], [ 69305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 332 ], [ 69332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 333 ], [ 69343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 334 ], [ 69402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 335 ], [ 69447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 336 ], [ 69478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 337 ], [ 69513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 338 ], [ 69548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 339 ], [ 69553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 340 ], [ 69613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 341 ], [ 69657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 342 ], [ 69695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 343 ], [ 69739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 344 ], [ 69753, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 345 ], [ 69758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 346 ], [ 69772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 347 ], [ 69789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 348 ], [ 69803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 43 ], [ 69804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 44 ], [ 69808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 436 ], [ 69821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 437 ], [ 69871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 438 ], [ 69911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 439 ], [ 69965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 440 ], [ 70012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 441 ], [ 70044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 442 ], [ 70060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 443 ], [ 70138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 444 ], [ 70185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 445 ], [ 70259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 446 ], [ 70341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 447 ], [ 70381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 448 ], [ 70390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 449 ], [ 70395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 450 ], [ 70474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 451 ], [ 70549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 452 ], [ 70634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 453 ], [ 70673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 454 ], [ 70674, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 455 ], [ 70697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 456 ], [ 70733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 457 ], [ 70778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 458 ], [ 70801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 459 ], [ 70824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 460 ], [ 70863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 461 ], [ 70908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 462 ], [ 70931, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 463 ], [ 70964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 464 ], [ 71003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 465 ], [ 71053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 466 ], [ 71076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 467 ], [ 71119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 468 ], [ 71164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 469 ], [ 71207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 470 ], [ 71246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 471 ], [ 71289, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 472 ], [ 71313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 473 ], [ 71366, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 474 ], [ 71380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 475 ], [ 71385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 476 ], [ 71399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 477 ], [ 71416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 478 ], [ 71430, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 44 ], [ 71431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 45 ], [ 71435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 181 ], [ 71448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 182 ], [ 71505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 183 ], [ 71517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 184 ], [ 71536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 185 ], [ 71549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 186 ], [ 71565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 187 ], [ 71642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 188 ], [ 71718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 189 ], [ 71793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 190 ], [ 71872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 191 ], [ 71950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 192 ], [ 71976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 193 ], [ 71985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 194 ], [ 71986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 195 ], [ 72046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 196 ], [ 72047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 197 ], [ 72070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 198 ], [ 72115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 199 ], [ 72161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 200 ], [ 72207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 201 ], [ 72253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 202 ], [ 72277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 203 ], [ 72340, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 204 ], [ 72403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 205 ], [ 72466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 206 ], [ 72529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 207 ], [ 72553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 208 ], [ 72616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 209 ], [ 72679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 210 ], [ 72742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 211 ], [ 72805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 212 ], [ 72868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 213 ], [ 72891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 214 ], [ 72940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 215 ], [ 72986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 216 ], [ 73002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 217 ], [ 73007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 218 ], [ 73021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 219 ], [ 73038, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 220 ], [ 73052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 45 ], [ 73053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 46 ], [ 73057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 482 ], [ 73070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 483 ], [ 73124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 484 ], [ 73156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 485 ], [ 73172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 486 ], [ 73243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 487 ], [ 73318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 488 ], [ 73390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 489 ], [ 73455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 490 ], [ 73527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 491 ], [ 73536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 492 ], [ 73537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 493 ], [ 73608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 494 ], [ 73650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 495 ], [ 73651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 496 ], [ 73731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 497 ], [ 73807, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 498 ], [ 73886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 499 ], [ 73899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 500 ], [ 73908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 501 ], [ 73909, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 502 ], [ 73932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 503 ], [ 73957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 504 ], [ 73984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 505 ], [ 74001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 506 ], [ 74018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 507 ], [ 74046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 508 ], [ 74067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 509 ], [ 74091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 510 ], [ 74098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 511 ], [ 74135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 512 ], [ 74143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 513 ], [ 74165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 514 ], [ 74216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 515 ], [ 74247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 516 ], [ 74302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 517 ], [ 74358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 518 ], [ 74372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 519 ], [ 74378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 520 ], [ 74421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 521 ], [ 74470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 522 ], [ 74502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 523 ], [ 74557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 524 ], [ 74611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 525 ], [ 74626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 526 ], [ 74631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 527 ], [ 74645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 528 ], [ 74662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 529 ], [ 74676, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 46 ], [ 74677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 47 ], [ 74681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 352 ], [ 74694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 353 ], [ 74748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 354 ], [ 74780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 355 ], [ 74796, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 356 ], [ 74873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 357 ], [ 74946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 358 ], [ 75016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 359 ], [ 75017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 360 ], [ 75096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 361 ], [ 75160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 362 ], [ 75217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 363 ], [ 75218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 364 ], [ 75292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 365 ], [ 75370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 366 ], [ 75447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 367 ], [ 75487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 368 ], [ 75488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 369 ], [ 75511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 370 ], [ 75546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 371 ], [ 75592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 372 ], [ 75639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 373 ], [ 75684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 374 ], [ 75713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 375 ], [ 75731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 376 ], [ 75753, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 377 ], [ 75806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 378 ], [ 75845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 379 ], [ 75890, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 380 ], [ 75921, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 381 ], [ 75934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 382 ], [ 75979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 383 ], [ 76022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 384 ], [ 76061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 385 ], [ 76104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 386 ], [ 76133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 387 ], [ 76148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 388 ], [ 76162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 389 ], [ 76167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 390 ], [ 76181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 391 ], [ 76198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 392 ], [ 76212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 47 ], [ 76213, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 48 ], [ 76217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 396 ], [ 76230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 397 ], [ 76290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 398 ], [ 76322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 399 ], [ 76338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 400 ], [ 76415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 401 ], [ 76490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 402 ], [ 76571, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 403 ], [ 76628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 404 ], [ 76629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 405 ], [ 76703, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 406 ], [ 76765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 407 ], [ 76845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 408 ], [ 76846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 409 ], [ 76920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 410 ], [ 77001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 411 ], [ 77078, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 412 ], [ 77120, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 413 ], [ 77121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 414 ], [ 77144, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 415 ], [ 77208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 416 ], [ 77254, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 417 ], [ 77313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 418 ], [ 77359, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 419 ], [ 77404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 420 ], [ 77435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 421 ], [ 77453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 422 ], [ 77498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 423 ], [ 77541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 424 ], [ 77587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 425 ], [ 77629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 426 ], [ 77658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 427 ], [ 77670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 428 ], [ 77684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 429 ], [ 77689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 430 ], [ 77703, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 431 ], [ 77720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 432 ], [ 77734, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 48 ], [ 77735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 49 ], [ 77739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 533 ], [ 77752, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 534 ], [ 77805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 535 ], [ 77845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 536 ], [ 77902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 537 ], [ 77949, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 538 ], [ 77981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 539 ], [ 77997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 540 ], [ 78076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 541 ], [ 78149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 542 ], [ 78219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 543 ], [ 78289, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 544 ], [ 78334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 545 ], [ 78335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 546 ], [ 78373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 547 ], [ 78445, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 548 ], [ 78499, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 549 ], [ 78578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 550 ], [ 78604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 551 ], [ 78613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 552 ], [ 78614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 553 ], [ 78691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 554 ], [ 78770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 555 ], [ 78839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 556 ], [ 78840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 557 ], [ 78863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 558 ], [ 78895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 559 ], [ 78942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 560 ], [ 78987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 561 ], [ 79042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 562 ], [ 79089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 563 ], [ 79103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 564 ], [ 79108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 565 ], [ 79137, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 566 ], [ 79143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 567 ], [ 79177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 568 ], [ 79221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 569 ], [ 79250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 570 ], [ 79258, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 571 ], [ 79269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 572 ], [ 79286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 573 ], [ 79300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 49 ], [ 79301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 50 ], [ 79305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 224 ], [ 79318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 225 ], [ 79378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 226 ], [ 79390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 227 ], [ 79409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 228 ], [ 79422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 229 ], [ 79438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 230 ], [ 79505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 231 ], [ 79585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 232 ], [ 79651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 233 ], [ 79727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 234 ], [ 79800, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 235 ], [ 79813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 236 ], [ 79822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 237 ], [ 79823, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 238 ], [ 79883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 239 ], [ 79906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 240 ], [ 79951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 241 ], [ 79997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 242 ], [ 80043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 243 ], [ 80089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 244 ], [ 80113, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 245 ], [ 80176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 246 ], [ 80239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 247 ], [ 80302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 248 ], [ 80365, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 249 ], [ 80389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 250 ], [ 80452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 251 ], [ 80515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 252 ], [ 80578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 253 ], [ 80641, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 254 ], [ 80704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 255 ], [ 80727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 256 ], [ 80776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 257 ], [ 80822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 258 ], [ 80838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 259 ], [ 80843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 260 ], [ 80857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 261 ], [ 80874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 262 ], [ 80888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 50 ], [ 80889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 51 ], [ 80893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 577 ], [ 80906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 578 ], [ 80963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 579 ], [ 80995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 580 ], [ 81011, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 581 ], [ 81046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 582 ], [ 81057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 583 ], [ 81070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 584 ], [ 81134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 585 ], [ 81208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 586 ], [ 81222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 587 ], [ 81305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 588 ], [ 81317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 589 ], [ 81318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 590 ], [ 81392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 591 ], [ 81451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 592 ], [ 81528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 593 ], [ 81537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 594 ], [ 81538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 595 ], [ 81617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 596 ], [ 81696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 597 ], [ 81777, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 598 ], [ 81834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 599 ], [ 81835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 600 ], [ 81895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 601 ], [ 81974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 602 ], [ 82054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 603 ], [ 82100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 604 ], [ 82101, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 605 ], [ 82124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 606 ], [ 82156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 607 ], [ 82203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 608 ], [ 82251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 609 ], [ 82306, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 610 ], [ 82339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 611 ], [ 82392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 612 ], [ 82455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 613 ], [ 82508, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 614 ], [ 82522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 615 ], [ 82527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 616 ], [ 82541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 617 ], [ 82558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 618 ], [ 82572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 51 ], [ 82573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 52 ], [ 82577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1697 ], [ 82590, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1698 ], [ 82640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1699 ], [ 82694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1700 ], [ 82726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1701 ], [ 82742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1702 ], [ 82808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1703 ], [ 82884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1704 ], [ 82932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1705 ], [ 82933, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1706 ], [ 83011, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1707 ], [ 83088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1708 ], [ 83102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1709 ], [ 83125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1710 ], [ 83192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1711 ], [ 83238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1712 ], [ 83266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1713 ], [ 83311, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1714 ], [ 83363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1715 ], [ 83406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1716 ], [ 83434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1717 ], [ 83477, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1718 ], [ 83485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1719 ], [ 83528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1720 ], [ 83542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1721 ], [ 83559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1722 ], [ 83573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 52 ], [ 83574, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 53 ], [ 83578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1627 ], [ 83591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1628 ], [ 83652, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1629 ], [ 83717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1630 ], [ 83749, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1631 ], [ 83765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1632 ], [ 83831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1633 ], [ 83908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1634 ], [ 83982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1635 ], [ 84014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1636 ], [ 84015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1637 ], [ 84093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1638 ], [ 84169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1639 ], [ 84191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1640 ], [ 84214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1641 ], [ 84272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1642 ], [ 84323, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1643 ], [ 84369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1644 ], [ 84414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1645 ], [ 84438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1646 ], [ 84471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1647 ], [ 84523, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1648 ], [ 84571, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1649 ], [ 84610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1650 ], [ 84653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1651 ], [ 84661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1652 ], [ 84704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1653 ], [ 84718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1654 ], [ 84735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1655 ], [ 84749, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 53 ], [ 84750, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 54 ], [ 84754, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 114 ], [ 84767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 115 ], [ 84823, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 116 ], [ 84871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 117 ], [ 84925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 118 ], [ 84965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 119 ], [ 85023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 120 ], [ 85070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 121 ], [ 85102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 122 ], [ 85118, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 123 ], [ 85199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 124 ], [ 85273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 125 ], [ 85346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 126 ], [ 85417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 127 ], [ 85492, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 128 ], [ 85551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 129 ], [ 85627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 130 ], [ 85701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 131 ], [ 85776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 132 ], [ 85777, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 133 ], [ 85850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 134 ], [ 85891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 135 ], [ 85892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 136 ], [ 85972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 137 ], [ 86042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 138 ], [ 86122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 139 ], [ 86168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 140 ], [ 86191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 141 ], [ 86250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 142 ], [ 86296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 143 ], [ 86318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 144 ], [ 86383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 145 ], [ 86408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 146 ], [ 86452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 147 ], [ 86498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 148 ], [ 86522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 149 ], [ 86587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 150 ], [ 86612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 151 ], [ 86649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 152 ], [ 86698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 153 ], [ 86713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 154 ], [ 86718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 155 ], [ 86732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 156 ], [ 86737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 157 ], [ 86751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 158 ], [ 86768, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 159 ], [ 86782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 54 ], [ 86783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 55 ], [ 86787, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1043 ], [ 86800, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1044 ], [ 86868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1045 ], [ 86904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1046 ], [ 86984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1047 ], [ 87016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1048 ], [ 87032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1049 ], [ 87104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1050 ], [ 87166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1051 ], [ 87167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1052 ], [ 87244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1053 ], [ 87319, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1054 ], [ 87352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1055 ], [ 87353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1056 ], [ 87431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1057 ], [ 87511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1058 ], [ 87520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1059 ], [ 87521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1060 ], [ 87595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1061 ], [ 87640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1062 ], [ 87696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1063 ], [ 87773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1064 ], [ 87847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1065 ], [ 87920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1066 ], [ 87986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1067 ], [ 88063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1068 ], [ 88108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1069 ], [ 88184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1070 ], [ 88236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1071 ], [ 88237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1072 ], [ 88246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1073 ], [ 88247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1074 ], [ 88328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1075 ], [ 88329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1076 ], [ 88397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1077 ], [ 88475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1078 ], [ 88558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1079 ], [ 88638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1080 ], [ 88686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1081 ], [ 88705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1082 ], [ 88733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1083 ], [ 88775, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1084 ], [ 88799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1085 ], [ 88823, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1086 ], [ 88854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1087 ], [ 88899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1088 ], [ 88923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1089 ], [ 88956, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1090 ], [ 89000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1091 ], [ 89045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1092 ], [ 89072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1093 ], [ 89126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1094 ], [ 89140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1095 ], [ 89157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1096 ], [ 89171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 55 ], [ 89172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 56 ], [ 89176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 993 ], [ 89189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 994 ], [ 89239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 995 ], [ 89287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 996 ], [ 89363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 997 ], [ 89395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 998 ], [ 89411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 999 ], [ 89483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1000 ], [ 89537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1001 ], [ 89538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1002 ], [ 89615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1003 ], [ 89692, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1004 ], [ 89715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1005 ], [ 89716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1006 ], [ 89788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1007 ], [ 89867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1008 ], [ 89946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1009 ], [ 90025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1010 ], [ 90099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1011 ], [ 90159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1012 ], [ 90160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1013 ], [ 90237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1014 ], [ 90246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1015 ], [ 90247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1016 ], [ 90315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1017 ], [ 90393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1018 ], [ 90476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1019 ], [ 90556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1020 ], [ 90604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1021 ], [ 90623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1022 ], [ 90651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1023 ], [ 90694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1024 ], [ 90723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1025 ], [ 90775, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1026 ], [ 90807, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1027 ], [ 90852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1028 ], [ 90892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1029 ], [ 90937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1030 ], [ 90977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1031 ], [ 91027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1032 ], [ 91054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1033 ], [ 91087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1034 ], [ 91116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1035 ], [ 91170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1036 ], [ 91175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1037 ], [ 91189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1038 ], [ 91206, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1039 ], [ 91220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 56 ], [ 91221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 57 ], [ 91225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1100 ], [ 91238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1101 ], [ 91283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1102 ], [ 91331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1103 ], [ 91402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1104 ], [ 91434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1105 ], [ 91450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1106 ], [ 91522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1107 ], [ 91565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1108 ], [ 91566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1109 ], [ 91638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1110 ], [ 91716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1111 ], [ 91731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1112 ], [ 91732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1113 ], [ 91809, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1114 ], [ 91873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1115 ], [ 91931, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1116 ], [ 91932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1117 ], [ 92010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1118 ], [ 92072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1119 ], [ 92147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1120 ], [ 92171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1121 ], [ 92172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1122 ], [ 92244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1123 ], [ 92261, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1124 ], [ 92262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1125 ], [ 92339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1126 ], [ 92348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1127 ], [ 92349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1128 ], [ 92417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1129 ], [ 92495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1130 ], [ 92578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1131 ], [ 92658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1132 ], [ 92706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1133 ], [ 92725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1134 ], [ 92755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1135 ], [ 92800, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1136 ], [ 92843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1137 ], [ 92848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1138 ], [ 92876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1139 ], [ 92918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1140 ], [ 92943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1141 ], [ 92989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1142 ], [ 93003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1143 ], [ 93020, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1144 ], [ 93034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 57 ], [ 93035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 58 ], [ 93039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1148 ], [ 93052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1149 ], [ 93111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1150 ], [ 93159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1151 ], [ 93209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1152 ], [ 93246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1153 ], [ 93278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1154 ], [ 93294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1155 ], [ 93368, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1156 ], [ 93441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1157 ], [ 93464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1158 ], [ 93473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1159 ], [ 93474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1160 ], [ 93546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1161 ], [ 93623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1162 ], [ 93684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1163 ], [ 93693, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1164 ], [ 93695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1165 ], [ 93772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1166 ], [ 93838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1167 ], [ 93916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1168 ], [ 93993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1169 ], [ 94064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1170 ], [ 94102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1171 ], [ 94111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1172 ], [ 94112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1173 ], [ 94175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1174 ], [ 94225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1175 ], [ 94303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1176 ], [ 94314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1177 ], [ 94387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1178 ], [ 94461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1179 ], [ 94528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1180 ], [ 94596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1181 ], [ 94672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1182 ], [ 94741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1183 ], [ 94800, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1184 ], [ 94837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1185 ], [ 94846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1186 ], [ 94847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1187 ], [ 94931, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1188 ], [ 95010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1189 ], [ 95024, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1190 ], [ 95033, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1191 ], [ 95034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1192 ], [ 95053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1193 ], [ 95081, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1194 ], [ 95123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1195 ], [ 95152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1196 ], [ 95194, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1197 ], [ 95240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1198 ], [ 95287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1199 ], [ 95318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1200 ], [ 95359, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1201 ], [ 95402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1202 ], [ 95448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1203 ], [ 95453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1204 ], [ 95467, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1205 ], [ 95484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1206 ], [ 95498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 58 ], [ 95499, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 59 ], [ 95503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1210 ], [ 95516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1211 ], [ 95572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1212 ], [ 95620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1213 ], [ 95667, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1214 ], [ 95704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1215 ], [ 95736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1216 ], [ 95752, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1217 ], [ 95826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1218 ], [ 95903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1219 ], [ 95916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1220 ], [ 95925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1221 ], [ 95926, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1222 ], [ 96003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1223 ], [ 96078, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1224 ], [ 96129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1225 ], [ 96138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1226 ], [ 96139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1227 ], [ 96218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1228 ], [ 96279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1229 ], [ 96354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1230 ], [ 96426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1231 ], [ 96493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1232 ], [ 96503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1233 ], [ 96504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1234 ], [ 96567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1235 ], [ 96614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1236 ], [ 96692, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1237 ], [ 96771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1238 ], [ 96845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1239 ], [ 96908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1240 ], [ 96976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1241 ], [ 97052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1242 ], [ 97121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1243 ], [ 97180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1244 ], [ 97215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1245 ], [ 97224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1246 ], [ 97225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1247 ], [ 97303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1248 ], [ 97382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1249 ], [ 97396, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1250 ], [ 97405, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1251 ], [ 97406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1252 ], [ 97425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1253 ], [ 97453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1254 ], [ 97495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1255 ], [ 97524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1256 ], [ 97566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1257 ], [ 97609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1258 ], [ 97655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1259 ], [ 97686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1260 ], [ 97717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1261 ], [ 97750, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1262 ], [ 97783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1263 ], [ 97788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1264 ], [ 97802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1265 ], [ 97819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1266 ], [ 97833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 59 ], [ 97834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 60 ], [ 97838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2094 ], [ 97851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2095 ], [ 97917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2096 ], [ 97965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2097 ], [ 97981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2098 ], [ 98036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2099 ], [ 98105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2100 ], [ 98178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2101 ], [ 98246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2102 ], [ 98277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2103 ], [ 98286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2104 ], [ 98287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2105 ], [ 98356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2106 ], [ 98426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2107 ], [ 98494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2108 ], [ 98525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2109 ], [ 98534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2110 ], [ 98535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2111 ], [ 98604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2112 ], [ 98672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2113 ], [ 98714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2114 ], [ 98723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2115 ], [ 98724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2116 ], [ 98753, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2117 ], [ 98827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2118 ], [ 98828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2119 ], [ 98851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2120 ], [ 98919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2121 ], [ 98944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2122 ], [ 98991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2123 ], [ 98996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2124 ], [ 99063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2125 ], [ 99065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2126 ], [ 99093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2127 ], [ 99098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2128 ], [ 99134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2129 ], [ 99136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2130 ], [ 99182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2131 ], [ 99250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2132 ], [ 99255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2133 ], [ 99269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2134 ], [ 99286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2135 ], [ 99300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 60 ], [ 99301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 61 ], [ 99305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2139 ], [ 99318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2140 ], [ 99381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2141 ], [ 99429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2142 ], [ 99445, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2143 ], [ 99497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2144 ], [ 99563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2145 ], [ 99633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2146 ], [ 99701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2147 ], [ 99732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2148 ], [ 99741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2149 ], [ 99742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2150 ], [ 99811, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2151 ], [ 99879, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2152 ], [ 99952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2153 ], [ 99961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2154 ], [ 99962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2155 ], [ 100030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2156 ], [ 100098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2157 ], [ 100137, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2158 ], [ 100146, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2159 ], [ 100147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2160 ], [ 100177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2161 ], [ 100248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2162 ], [ 100249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2163 ], [ 100272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2164 ], [ 100337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2165 ], [ 100362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2166 ], [ 100406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2167 ], [ 100411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2168 ], [ 100475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2169 ], [ 100477, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2170 ], [ 100505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2171 ], [ 100510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2172 ], [ 100546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2173 ], [ 100548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2174 ], [ 100589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2175 ], [ 100634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2176 ], [ 100680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2177 ], [ 100685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2178 ], [ 100699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2179 ], [ 100716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2180 ], [ 100730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 61 ], [ 100731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 62 ], [ 100735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 13 ], [ 100748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 14 ], [ 100791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 15 ], [ 100834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 16 ], [ 100866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 17 ], [ 100882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 18 ], [ 100952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 19 ], [ 101027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 20 ], [ 101104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 21 ], [ 101181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 22 ], [ 101234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 23 ], [ 101235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 24 ], [ 101313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 25 ], [ 101360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 26 ], [ 101383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 27 ], [ 101421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 28 ], [ 101467, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 29 ], [ 101502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 30 ], [ 101546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 31 ], [ 101560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 32 ], [ 101577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 33 ], [ 101591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 62 ], [ 101592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 63 ], [ 101596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 37 ], [ 101609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 38 ], [ 101662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 39 ], [ 101715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 40 ], [ 101747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 41 ], [ 101763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 42 ], [ 101835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 43 ], [ 101908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 44 ], [ 101986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 45 ], [ 102067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 46 ], [ 102083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 47 ], [ 102084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 48 ], [ 102162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 49 ], [ 102209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 50 ], [ 102232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 51 ], [ 102280, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 52 ], [ 102325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 53 ], [ 102395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 54 ], [ 102440, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 55 ], [ 102454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 56 ], [ 102471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 57 ], [ 102485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 63 ], [ 102486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 64 ], [ 102490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 86 ], [ 102503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 87 ], [ 102548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 88 ], [ 102580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 89 ], [ 102596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 90 ], [ 102672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 91 ], [ 102751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 92 ], [ 102830, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 93 ], [ 102909, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 94 ], [ 102980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 95 ], [ 103000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 96 ], [ 103001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 97 ], [ 103080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 98 ], [ 103157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 99 ], [ 103190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 100 ], [ 103213, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 101 ], [ 103253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 102 ], [ 103298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 103 ], [ 103325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 104 ], [ 103371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 105 ], [ 103385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 106 ], [ 103402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 107 ], [ 103416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 64 ], [ 103417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 65 ], [ 103421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 61 ], [ 103434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 62 ], [ 103488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 63 ], [ 103520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 64 ], [ 103536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 65 ], [ 103612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 66 ], [ 103690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 67 ], [ 103771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 68 ], [ 103847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 69 ], [ 103924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 70 ], [ 103999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 71 ], [ 104000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 72 ], [ 104079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 73 ], [ 104156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 74 ], [ 104189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 75 ], [ 104212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 76 ], [ 104252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 77 ], [ 104297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 78 ], [ 104333, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 79 ], [ 104378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 80 ], [ 104392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 81 ], [ 104409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 82 ], [ 104423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 65 ], [ 104424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 66 ], [ 104428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1659 ], [ 104441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1660 ], [ 104491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1661 ], [ 104545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1662 ], [ 104577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1663 ], [ 104593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1664 ], [ 104675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1665 ], [ 104757, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1666 ], [ 104796, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1667 ], [ 104797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1668 ], [ 104875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1669 ], [ 104958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1670 ], [ 104987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1671 ], [ 105010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1672 ], [ 105038, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1673 ], [ 105081, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1674 ], [ 105114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1675 ], [ 105171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1676 ], [ 105194, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1677 ], [ 105260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1678 ], [ 105295, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1679 ], [ 105340, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1680 ], [ 105385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1681 ], [ 105418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1682 ], [ 105473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1683 ], [ 105496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1684 ], [ 105535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1685 ], [ 105580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1686 ], [ 105623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1687 ], [ 105651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1688 ], [ 105694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1689 ], [ 105702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1690 ], [ 105745, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1691 ], [ 105759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1692 ], [ 105776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1693 ], [ 105790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 66 ], [ 105791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 67 ], [ 105795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 111 ], [ 105808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 112 ], [ 105856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 113 ], [ 105894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 114 ], [ 105945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 115 ], [ 105984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 116 ], [ 106016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 117 ], [ 106032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 118 ], [ 106107, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 119 ], [ 106187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 120 ], [ 106268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 121 ], [ 106347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 122 ], [ 106423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 123 ], [ 106474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 124 ], [ 106475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 125 ], [ 106554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 126 ], [ 106631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 127 ], [ 106664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 128 ], [ 106687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 129 ], [ 106729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 130 ], [ 106784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 131 ], [ 106831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 132 ], [ 106865, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 133 ], [ 106912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 134 ], [ 106951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 135 ], [ 106999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 136 ], [ 107013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 137 ], [ 107030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cons\ tructors.xml", 138 ], [ 107044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 67 ], [ 107045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 68 ], [ 107049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1617 ], [ 107062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1618 ], [ 107111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1619 ], [ 107143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1620 ], [ 107159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1621 ], [ 107237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1622 ], [ 107315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1623 ], [ 107394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1624 ], [ 107471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1625 ], [ 107543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1626 ], [ 107614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1627 ], [ 107683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1628 ], [ 107754, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1629 ], [ 107755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1630 ], [ 107827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1631 ], [ 107847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1632 ], [ 107870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1633 ], [ 107900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1634 ], [ 107945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1635 ], [ 107996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1636 ], [ 108042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1637 ], [ 108080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1638 ], [ 108126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1639 ], [ 108159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1640 ], [ 108164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1641 ], [ 108178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1642 ], [ 108195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1643 ], [ 108209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 68 ], [ 108210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 69 ], [ 108214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2053 ], [ 108227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2054 ], [ 108277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2055 ], [ 108331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2056 ], [ 108363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2057 ], [ 108379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2058 ], [ 108430, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2059 ], [ 108507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2060 ], [ 108512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2061 ], [ 108585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2062 ], [ 108659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2063 ], [ 108738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2064 ], [ 108739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2065 ], [ 108817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2066 ], [ 108892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2067 ], [ 108917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2068 ], [ 108918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2069 ], [ 108941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2070 ], [ 108968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2071 ], [ 109010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2072 ], [ 109035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2073 ], [ 109037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2074 ], [ 109070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2075 ], [ 109116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2076 ], [ 109141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2077 ], [ 109143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2078 ], [ 109176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2079 ], [ 109223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2080 ], [ 109248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2081 ], [ 109250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2082 ], [ 109303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2083 ], [ 109347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2084 ], [ 109375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2085 ], [ 109420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2086 ], [ 109428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2087 ], [ 109473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2088 ], [ 109487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2089 ], [ 109504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2090 ], [ 109518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 69 ], [ 109519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 70 ], [ 109532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 71 ], [ 109533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 72 ], [ 109579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 73 ], [ 109583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 713 ], [ 109596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 714 ], [ 109648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 715 ], [ 109680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 716 ], [ 109696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 717 ], [ 109772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 718 ], [ 109846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 719 ], [ 109924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 720 ], [ 109999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 721 ], [ 110069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 722 ], [ 110142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 723 ], [ 110200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 724 ], [ 110201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 725 ], [ 110276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 726 ], [ 110350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 727 ], [ 110385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 728 ], [ 110386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 729 ], [ 110453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 730 ], [ 110536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 731 ], [ 110598, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 732 ], [ 110674, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 733 ], [ 110713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 734 ], [ 110732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 735 ], [ 110758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 736 ], [ 110811, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 737 ], [ 110845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 738 ], [ 110900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 739 ], [ 110951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 740 ], [ 111002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 741 ], [ 111012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 742 ], [ 111029, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 743 ], [ 111043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 73 ], [ 111044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 74 ], [ 111048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 798 ], [ 111061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 799 ], [ 111110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 800 ], [ 111142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 801 ], [ 111158, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 802 ], [ 111233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 803 ], [ 111301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 804 ], [ 111373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 805 ], [ 111447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 806 ], [ 111509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 807 ], [ 111556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 808 ], [ 111565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 809 ], [ 111566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 810 ], [ 111637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 811 ], [ 111713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 812 ], [ 111790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 813 ], [ 111869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 814 ], [ 111888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 815 ], [ 111919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 816 ], [ 111977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 817 ], [ 112013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 818 ], [ 112068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 819 ], [ 112078, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 820 ], [ 112095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 821 ], [ 112109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 74 ], [ 112110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 75 ], [ 112114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 747 ], [ 112127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 748 ], [ 112177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 749 ], [ 112209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 750 ], [ 112225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 751 ], [ 112301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 752 ], [ 112375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 753 ], [ 112453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 754 ], [ 112528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 755 ], [ 112598, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 756 ], [ 112671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 757 ], [ 112729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 758 ], [ 112730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 759 ], [ 112804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 760 ], [ 112880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 761 ], [ 112899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 762 ], [ 112926, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 763 ], [ 112966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 764 ], [ 113011, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 765 ], [ 113062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 766 ], [ 113072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 767 ], [ 113089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 768 ], [ 113103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 75 ], [ 113104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 76 ], [ 113108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 772 ], [ 113121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 773 ], [ 113160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 774 ], [ 113192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 775 ], [ 113208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 776 ], [ 113284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 777 ], [ 113358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 778 ], [ 113436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 779 ], [ 113511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 780 ], [ 113581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 781 ], [ 113654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 782 ], [ 113712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 783 ], [ 113713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 784 ], [ 113790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 785 ], [ 113866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 786 ], [ 113945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 787 ], [ 113964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 788 ], [ 113988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 789 ], [ 114043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 790 ], [ 114085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 791 ], [ 114130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 792 ], [ 114140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 793 ], [ 114157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 794 ], [ 114171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 76 ], [ 114172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 77 ], [ 114185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 78 ], [ 114186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 79 ], [ 114234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 80 ], [ 114238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 132 ], [ 114251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 133 ], [ 114297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 134 ], [ 114329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 135 ], [ 114345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 136 ], [ 114414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 137 ], [ 114472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 138 ], [ 114490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 139 ], [ 114570, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 140 ], [ 114629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 141 ], [ 114630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 142 ], [ 114706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 143 ], [ 114780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 144 ], [ 114858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 145 ], [ 114933, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 146 ], [ 115003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 147 ], [ 115076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 148 ], [ 115134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 149 ], [ 115135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 150 ], [ 115215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 151 ], [ 115232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 152 ], [ 115255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 153 ], [ 115278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 154 ], [ 115321, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 155 ], [ 115362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 156 ], [ 115406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 157 ], [ 115420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 158 ], [ 115437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 159 ], [ 115451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 80 ], [ 115452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 81 ], [ 115456, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 107 ], [ 115469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 108 ], [ 115518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 109 ], [ 115550, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 110 ], [ 115566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 111 ], [ 115644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 112 ], [ 115722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 113 ], [ 115723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 114 ], [ 115799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 115 ], [ 115873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 116 ], [ 115951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 117 ], [ 116026, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 118 ], [ 116096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 119 ], [ 116169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 120 ], [ 116223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 121 ], [ 116246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 122 ], [ 116272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 123 ], [ 116318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 124 ], [ 116362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 125 ], [ 116407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 126 ], [ 116421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 127 ], [ 116438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 128 ], [ 116452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 81 ], [ 116453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 82 ], [ 116457, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 44 ], [ 116470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 45 ], [ 116531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 46 ], [ 116563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 47 ], [ 116579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 48 ], [ 116640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 49 ], [ 116713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 50 ], [ 116786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 51 ], [ 116847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 52 ], [ 116848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 53 ], [ 116914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 54 ], [ 116983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 55 ], [ 117042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 56 ], [ 117106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 57 ], [ 117115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 58 ], [ 117116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 59 ], [ 117192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 60 ], [ 117266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 61 ], [ 117344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 62 ], [ 117419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 63 ], [ 117489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 64 ], [ 117562, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 65 ], [ 117616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 66 ], [ 117617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 67 ], [ 117640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 68 ], [ 117677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 69 ], [ 117747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 70 ], [ 117802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 71 ], [ 117846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 72 ], [ 117860, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 73 ], [ 117877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 74 ], [ 117891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 82 ], [ 117892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 83 ], [ 117896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 78 ], [ 117911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 79 ], [ 117981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 80 ], [ 118015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 81 ], [ 118033, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 82 ], [ 118095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 83 ], [ 118172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 84 ], [ 118247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 85 ], [ 118313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 86 ], [ 118341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 87 ], [ 118352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 88 ], [ 118353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 89 ], [ 118431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 90 ], [ 118507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 91 ], [ 118587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 92 ], [ 118664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 93 ], [ 118736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 94 ], [ 118811, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 95 ], [ 118867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 96 ], [ 118892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 97 ], [ 118937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 98 ], [ 119006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 99 ], [ 119069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 100 ], [ 119114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 101 ], [ 119128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 102 ], [ 119145, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 103 ], [ 119159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 83 ], [ 119160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 84 ], [ 119164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 163 ], [ 119177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 164 ], [ 119223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 165 ], [ 119255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 166 ], [ 119271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 167 ], [ 119347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 168 ], [ 119416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 169 ], [ 119496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 170 ], [ 119572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 171 ], [ 119630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 172 ], [ 119631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 173 ], [ 119707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 174 ], [ 119781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 175 ], [ 119859, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 176 ], [ 119934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 177 ], [ 120004, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 178 ], [ 120077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 179 ], [ 120129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 180 ], [ 120150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 181 ], [ 120172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 182 ], [ 120214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 183 ], [ 120238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 184 ], [ 120282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 185 ], [ 120323, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 186 ], [ 120368, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 187 ], [ 120382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 188 ], [ 120399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 189 ], [ 120413, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 84 ], [ 120414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 85 ], [ 120418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 12 ], [ 120431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 13 ], [ 120477, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 14 ], [ 120522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 15 ], [ 120554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 16 ], [ 120570, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 17 ], [ 120639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 18 ], [ 120712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 19 ], [ 120746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 20 ], [ 120755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 21 ], [ 120762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 22 ], [ 120838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 23 ], [ 120912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 24 ], [ 120990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 25 ], [ 121065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 26 ], [ 121135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 27 ], [ 121208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 28 ], [ 121266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 29 ], [ 121267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 30 ], [ 121328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 31 ], [ 121329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 32 ], [ 121352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 33 ], [ 121375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 34 ], [ 121418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 35 ], [ 121440, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 36 ], [ 121483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 37 ], [ 121524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 38 ], [ 121578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 39 ], [ 121595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 40 ], [ 121609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 85 ], [ 121610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 86 ], [ 121614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 193 ], [ 121627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 194 ], [ 121678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 195 ], [ 121710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 196 ], [ 121726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 197 ], [ 121802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 198 ], [ 121881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 199 ], [ 121916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 200 ], [ 121917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 201 ], [ 121993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 202 ], [ 122067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 203 ], [ 122145, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 204 ], [ 122220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 205 ], [ 122290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 206 ], [ 122363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 207 ], [ 122421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 208 ], [ 122422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 209 ], [ 122496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 210 ], [ 122575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 211 ], [ 122655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 212 ], [ 122656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 213 ], [ 122679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 214 ], [ 122712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 215 ], [ 122767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 216 ], [ 122791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 217 ], [ 122824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 218 ], [ 122857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 219 ], [ 122913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 220 ], [ 122937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 221 ], [ 123004, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 222 ], [ 123039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 223 ], [ 123066, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 224 ], [ 123106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 225 ], [ 123151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 226 ], [ 123189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 227 ], [ 123203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 228 ], [ 123220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 229 ], [ 123234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 86 ], [ 123235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 87 ], [ 123239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 233 ], [ 123252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 234 ], [ 123296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 235 ], [ 123328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 236 ], [ 123344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 237 ], [ 123345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 238 ], [ 123415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 239 ], [ 123416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 240 ], [ 123496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 241 ], [ 123575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 242 ], [ 123651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 243 ], [ 123728, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 244 ], [ 123775, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 245 ], [ 123780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 246 ], [ 123856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 247 ], [ 123930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 248 ], [ 124008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 249 ], [ 124083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 250 ], [ 124153, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 251 ], [ 124226, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 252 ], [ 124284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 253 ], [ 124285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 254 ], [ 124338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 255 ], [ 124339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 256 ], [ 124358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 257 ], [ 124397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 258 ], [ 124399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 259 ], [ 124437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 260 ], [ 124482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 261 ], [ 124496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 262 ], [ 124513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 263 ], [ 124527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 87 ], [ 124528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 88 ], [ 124532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 267 ], [ 124545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 268 ], [ 124606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 269 ], [ 124638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 270 ], [ 124654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 271 ], [ 124723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 272 ], [ 124794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 273 ], [ 124866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 274 ], [ 124867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 275 ], [ 124876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 276 ], [ 124949, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 277 ], [ 124958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 278 ], [ 124959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 279 ], [ 125020, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 280 ], [ 125093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 281 ], [ 125171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 282 ], [ 125246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 283 ], [ 125319, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 284 ], [ 125383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 285 ], [ 125392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 286 ], [ 125393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 287 ], [ 125469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 288 ], [ 125543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 289 ], [ 125621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 290 ], [ 125696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 291 ], [ 125766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 292 ], [ 125839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 293 ], [ 125897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 294 ], [ 125898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 295 ], [ 125940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 296 ], [ 125941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 297 ], [ 125960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 298 ], [ 125997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 299 ], [ 126054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 300 ], [ 126092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 301 ], [ 126150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 302 ], [ 126192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 303 ], [ 126249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 304 ], [ 126295, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 305 ], [ 126300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 306 ], [ 126355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 307 ], [ 126400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 308 ], [ 126414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 309 ], [ 126431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/exam\ ples.xml", 310 ], [ 126445, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 88 ], [ 126446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 89 ], [ 126459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 90 ], [ 126460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap2.xml", 91 ], [ 126471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 38 ], [ 126490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 39 ], [ 126492, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 1 ], [ 126548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 2 ], [ 126549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 3 ], [ 126602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 4 ], [ 126613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 5 ], [ 126672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 6 ], [ 126684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 7 ], [ 126738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 8 ], [ 126818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 9 ], [ 126874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 10 ], [ 126953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 11 ], [ 126972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 12 ], [ 126973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 13 ], [ 127039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 14 ], [ 127086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 15 ], [ 127099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 16 ], [ 127100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 17 ], [ 127162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 18 ], [ 127174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 19 ], [ 127234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 20 ], [ 127235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 21 ], [ 127307, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 22 ], [ 127308, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 23 ], [ 127322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 24 ], [ 127338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 25 ], [ 127415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 26 ], [ 127480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 27 ], [ 127497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 28 ], [ 127513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 29 ], [ 127580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 30 ], [ 127654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 31 ], [ 127682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 32 ], [ 127699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 33 ], [ 127715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 34 ], [ 127766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 35 ], [ 127827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 36 ], [ 127907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 37 ], [ 127978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 38 ], [ 127995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 39 ], [ 128010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 40 ], [ 128023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 41 ], [ 128034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 42 ], [ 128035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 43 ], [ 128038, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 12 ], [ 128051, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 13 ], [ 128098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 14 ], [ 128148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 15 ], [ 128164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 16 ], [ 128241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 17 ], [ 128321, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 18 ], [ 128344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 19 ], [ 128345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 20 ], [ 128422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 21 ], [ 128497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 22 ], [ 128570, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 23 ], [ 128635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 24 ], [ 128636, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 25 ], [ 128714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 26 ], [ 128794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 27 ], [ 128874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 28 ], [ 128954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 29 ], [ 128963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 30 ], [ 128964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 31 ], [ 128987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 32 ], [ 129029, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 33 ], [ 129074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 34 ], [ 129112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 35 ], [ 129157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 36 ], [ 129182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 37 ], [ 129187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 38 ], [ 129212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 39 ], [ 129218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 40 ], [ 129274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 41 ], [ 129279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 42 ], [ 129332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 43 ], [ 129337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 44 ], [ 129371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 45 ], [ 129421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 46 ], [ 129452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 47 ], [ 129497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 48 ], [ 129522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 49 ], [ 129527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 50 ], [ 129552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 51 ], [ 129571, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 52 ], [ 129588, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 53 ], [ 129602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 43 ], [ 129603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 44 ], [ 129606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 57 ], [ 129619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 58 ], [ 129678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 59 ], [ 129739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 60 ], [ 129789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 61 ], [ 129805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 62 ], [ 129882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 63 ], [ 129951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 64 ], [ 130029, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 65 ], [ 130107, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 66 ], [ 130142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 67 ], [ 130143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 68 ], [ 130224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 69 ], [ 130304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 70 ], [ 130377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 71 ], [ 130454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 72 ], [ 130518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 73 ], [ 130519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 74 ], [ 130591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 75 ], [ 130661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 76 ], [ 130739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 77 ], [ 130818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 78 ], [ 130897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 79 ], [ 130944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 80 ], [ 131012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 81 ], [ 131061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 82 ], [ 131062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 83 ], [ 131142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 84 ], [ 131160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 85 ], [ 131161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 86 ], [ 131184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 87 ], [ 131214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 88 ], [ 131259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 89 ], [ 131309, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 90 ], [ 131354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 91 ], [ 131409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 92 ], [ 131414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 93 ], [ 131454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 94 ], [ 131459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 95 ], [ 131491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 96 ], [ 131533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 97 ], [ 131594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 98 ], [ 131599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 99 ], [ 131643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 100 ], [ 131649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 101 ], [ 131682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 102 ], [ 131687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 103 ], [ 131753, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 104 ], [ 131798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 105 ], [ 131824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 106 ], [ 131830, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 107 ], [ 131895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 108 ], [ 131913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 109 ], [ 131930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 110 ], [ 131944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 44 ], [ 131945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 45 ], [ 131958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap3.xml", 46 ], [ 131969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 39 ], [ 131995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 40 ], [ 131997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 1 ], [ 132085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 2 ], [ 132134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 3 ], [ 132138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 12 ], [ 132151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 13 ], [ 132198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 14 ], [ 132239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 15 ], [ 132255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 16 ], [ 132316, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 17 ], [ 132317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 18 ], [ 132379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 19 ], [ 132455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 20 ], [ 132478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 21 ], [ 132514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 22 ], [ 132550, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 23 ], [ 132587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 24 ], [ 132632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 25 ], [ 132658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 26 ], [ 132669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 27 ], [ 132708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 28 ], [ 132744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 29 ], [ 132781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 30 ], [ 132826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 31 ], [ 132852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 32 ], [ 132863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 33 ], [ 132905, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 34 ], [ 132918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 35 ], [ 132963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 36 ], [ 133006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 37 ], [ 133031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 38 ], [ 133042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 39 ], [ 133056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 40 ], [ 133073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 41 ], [ 133087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 3 ], [ 133088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 4 ], [ 133092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 45 ], [ 133105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 46 ], [ 133154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 47 ], [ 133187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 48 ], [ 133203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 49 ], [ 133274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 50 ], [ 133275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 51 ], [ 133298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 52 ], [ 133334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 53 ], [ 133370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 54 ], [ 133407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 55 ], [ 133452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 56 ], [ 133480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 57 ], [ 133482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 58 ], [ 133521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 59 ], [ 133557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 60 ], [ 133594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 61 ], [ 133639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 62 ], [ 133667, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 63 ], [ 133669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 64 ], [ 133713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 65 ], [ 133717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 66 ], [ 133762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 67 ], [ 133805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 68 ], [ 133832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 69 ], [ 133834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 70 ], [ 133848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 71 ], [ 133865, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 72 ], [ 133879, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 4 ], [ 133880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 5 ], [ 133884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 76 ], [ 133897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 77 ], [ 133941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 78 ], [ 133979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 79 ], [ 133995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 80 ], [ 134074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 81 ], [ 134152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 82 ], [ 134188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 83 ], [ 134197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 84 ], [ 134198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 85 ], [ 134278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 86 ], [ 134337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 87 ], [ 134417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 88 ], [ 134469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 89 ], [ 134470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 90 ], [ 134546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 91 ], [ 134618, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 92 ], [ 134671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 93 ], [ 134694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 94 ], [ 134751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 95 ], [ 134802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 96 ], [ 134861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 97 ], [ 134873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 98 ], [ 134936, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 99 ], [ 134999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 100 ], [ 135042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 101 ], [ 135087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 102 ], [ 135130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 103 ], [ 135152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 104 ], [ 135185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 105 ], [ 135199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 106 ], [ 135216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 107 ], [ 135230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 5 ], [ 135231, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 6 ], [ 135235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 111 ], [ 135248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 112 ], [ 135294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 113 ], [ 135327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 114 ], [ 135343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 115 ], [ 135420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 116 ], [ 135443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 117 ], [ 135464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 118 ], [ 135524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 119 ], [ 135549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 120 ], [ 135552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 121 ], [ 135588, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 122 ], [ 135624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 123 ], [ 135661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 124 ], [ 135711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 125 ], [ 135736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 126 ], [ 135738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 127 ], [ 135783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 128 ], [ 135826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 129 ], [ 135850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 130 ], [ 135852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 131 ], [ 135866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 132 ], [ 135883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 133 ], [ 135897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 6 ], [ 135898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 7 ], [ 135902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 581 ], [ 135915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 582 ], [ 135959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 583 ], [ 136000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 584 ], [ 136016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 585 ], [ 136077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 586 ], [ 136097, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 587 ], [ 136155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 588 ], [ 136196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 589 ], [ 136219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 590 ], [ 136282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 591 ], [ 136332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 592 ], [ 136355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 593 ], [ 136364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 594 ], [ 136409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 595 ], [ 136452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 596 ], [ 136474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 597 ], [ 136479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 598 ], [ 136493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 599 ], [ 136510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 600 ], [ 136524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 7 ], [ 136525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 8 ], [ 136529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 558 ], [ 136542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 559 ], [ 136588, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 560 ], [ 136629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 561 ], [ 136645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 562 ], [ 136719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 563 ], [ 136739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 564 ], [ 136798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 565 ], [ 136838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 566 ], [ 136861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 567 ], [ 136924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 568 ], [ 136974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 569 ], [ 136999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 570 ], [ 137008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 571 ], [ 137053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 572 ], [ 137096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 573 ], [ 137120, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 574 ], [ 137125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 575 ], [ 137139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 576 ], [ 137156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 577 ], [ 137170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 8 ], [ 137171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 9 ], [ 137175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 721 ], [ 137188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 722 ], [ 137242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 723 ], [ 137308, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 724 ], [ 137324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 725 ], [ 137402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 726 ], [ 137483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 727 ], [ 137562, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 728 ], [ 137639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 729 ], [ 137699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 730 ], [ 137708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 731 ], [ 137709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 732 ], [ 137789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 733 ], [ 137844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 734 ], [ 137845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 735 ], [ 137854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 736 ], [ 137855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 737 ], [ 137929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 738 ], [ 138002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 739 ], [ 138062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 740 ], [ 138085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 741 ], [ 138105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 742 ], [ 138161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 743 ], [ 138206, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 744 ], [ 138238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 745 ], [ 138268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 746 ], [ 138329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 747 ], [ 138372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 748 ], [ 138404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 749 ], [ 138419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 750 ], [ 138433, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 751 ], [ 138450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 752 ], [ 138464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 9 ], [ 138465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 10 ], [ 138469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 13 ], [ 138482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 14 ], [ 138537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 15 ], [ 138599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 16 ], [ 138615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 17 ], [ 138694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 18 ], [ 138772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 19 ], [ 138847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 20 ], [ 138869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 21 ], [ 138870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 22 ], [ 138947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 23 ], [ 139021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 24 ], [ 139040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 25 ], [ 139041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 26 ], [ 139115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 27 ], [ 139192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 28 ], [ 139216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 29 ], [ 139217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 30 ], [ 139299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 31 ], [ 139354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 32 ], [ 139355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 33 ], [ 139378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 34 ], [ 139426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 35 ], [ 139472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 36 ], [ 139503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 37 ], [ 139505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 38 ], [ 139549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 39 ], [ 139591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 40 ], [ 139622, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 41 ], [ 139626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 42 ], [ 139665, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 43 ], [ 139696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 44 ], [ 139700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 45 ], [ 139740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 46 ], [ 139782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 47 ], [ 139813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 48 ], [ 139817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 49 ], [ 139879, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 50 ], [ 139919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 51 ], [ 139950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 52 ], [ 139954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 53 ], [ 139993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 54 ], [ 140024, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 55 ], [ 140028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 56 ], [ 140063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 57 ], [ 140103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 58 ], [ 140134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 59 ], [ 140138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 60 ], [ 140152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 61 ], [ 140169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 62 ], [ 140183, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 10 ], [ 140184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 11 ], [ 140188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 66 ], [ 140201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 67 ], [ 140252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 68 ], [ 140312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 69 ], [ 140328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 70 ], [ 140406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 71 ], [ 140464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 72 ], [ 140544, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 73 ], [ 140581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 74 ], [ 140627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 75 ], [ 140628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 76 ], [ 140705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 77 ], [ 140779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 78 ], [ 140798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 79 ], [ 140799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 80 ], [ 140873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 81 ], [ 140950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 82 ], [ 140974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 83 ], [ 140975, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 84 ], [ 141052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 85 ], [ 141107, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 86 ], [ 141108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 87 ], [ 141131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 88 ], [ 141179, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 89 ], [ 141225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 90 ], [ 141254, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 91 ], [ 141265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 92 ], [ 141309, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 93 ], [ 141351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 94 ], [ 141380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 95 ], [ 141398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 96 ], [ 141437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 97 ], [ 141466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 98 ], [ 141484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 99 ], [ 141524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 100 ], [ 141566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 101 ], [ 141595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 102 ], [ 141608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 103 ], [ 141670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 104 ], [ 141710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 105 ], [ 141759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 106 ], [ 141788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 107 ], [ 141806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 108 ], [ 141841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 109 ], [ 141881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 110 ], [ 141910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 111 ], [ 141923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 112 ], [ 141937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 113 ], [ 141954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 114 ], [ 141968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 11 ], [ 141969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 12 ], [ 141973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 118 ], [ 141986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 119 ], [ 142042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 120 ], [ 142106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 121 ], [ 142122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 122 ], [ 142196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 123 ], [ 142271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 124 ], [ 142348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 125 ], [ 142426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 126 ], [ 142447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 127 ], [ 142448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 128 ], [ 142524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 129 ], [ 142602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 130 ], [ 142603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 131 ], [ 142685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 132 ], [ 142745, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 133 ], [ 142746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 134 ], [ 142792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 135 ], [ 142793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 136 ], [ 142816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 137 ], [ 142864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 138 ], [ 142910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 139 ], [ 142942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 140 ], [ 142944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 141 ], [ 142985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 142 ], [ 143017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 143 ], [ 143024, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 144 ], [ 143064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 145 ], [ 143109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 146 ], [ 143141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 147 ], [ 143148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 148 ], [ 143193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 149 ], [ 143236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 150 ], [ 143268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 151 ], [ 143270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 152 ], [ 143313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 153 ], [ 143345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 154 ], [ 143354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 155 ], [ 143389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 156 ], [ 143431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 157 ], [ 143463, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 158 ], [ 143472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 159 ], [ 143486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 160 ], [ 143503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 161 ], [ 143517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 12 ], [ 143518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 13 ], [ 143522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 165 ], [ 143535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 166 ], [ 143584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 167 ], [ 143642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 168 ], [ 143690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 169 ], [ 143746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 170 ], [ 143789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 171 ], [ 143805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 172 ], [ 143869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 173 ], [ 143940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 174 ], [ 144005, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 175 ], [ 144075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 176 ], [ 144126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 177 ], [ 144127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 178 ], [ 144205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 179 ], [ 144285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 180 ], [ 144366, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 181 ], [ 144442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 182 ], [ 144443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 183 ], [ 144524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 184 ], [ 144607, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 185 ], [ 144690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 186 ], [ 144709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 187 ], [ 144710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 188 ], [ 144786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 189 ], [ 144863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 190 ], [ 144864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 191 ], [ 144941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 192 ], [ 145001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 193 ], [ 145002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 194 ], [ 145025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 195 ], [ 145073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 196 ], [ 145119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 197 ], [ 145146, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 198 ], [ 145202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 199 ], [ 145242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 200 ], [ 145269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 201 ], [ 145327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 202 ], [ 145370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 203 ], [ 145415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 204 ], [ 145442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 205 ], [ 145471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 206 ], [ 145494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 207 ], [ 145521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 208 ], [ 145581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 209 ], [ 145625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 210 ], [ 145652, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 211 ], [ 145711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 212 ], [ 145751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 213 ], [ 145778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 214 ], [ 145839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 215 ], [ 145880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 216 ], [ 145923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 217 ], [ 145950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 218 ], [ 145995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 219 ], [ 146017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 220 ], [ 146060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 221 ], [ 146074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 222 ], [ 146091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/labe\ ls.xml", 223 ], [ 146105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 13 ], [ 146106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 14 ], [ 146110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 765 ], [ 146123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 766 ], [ 146177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 767 ], [ 146215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 768 ], [ 146231, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 769 ], [ 146305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 770 ], [ 146350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 771 ], [ 146373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 772 ], [ 146426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 773 ], [ 146476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 774 ], [ 146503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 775 ], [ 146526, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 776 ], [ 146540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 777 ], [ 146557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 778 ], [ 146571, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 14 ], [ 146572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 15 ], [ 146576, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 782 ], [ 146589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 783 ], [ 146644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 784 ], [ 146682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 785 ], [ 146698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 786 ], [ 146773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 787 ], [ 146819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 788 ], [ 146842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 789 ], [ 146895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 790 ], [ 146945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 791 ], [ 146973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 792 ], [ 146996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 793 ], [ 147010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 794 ], [ 147027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 795 ], [ 147041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 15 ], [ 147042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 16 ], [ 147046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 898 ], [ 147059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 899 ], [ 147108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 900 ], [ 147147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 901 ], [ 147196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 902 ], [ 147243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 903 ], [ 147293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 904 ], [ 147309, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 905 ], [ 147390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 906 ], [ 147470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 907 ], [ 147546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 908 ], [ 147627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 909 ], [ 147707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 910 ], [ 147708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 911 ], [ 147789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 912 ], [ 147848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 913 ], [ 147849, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 914 ], [ 147868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 915 ], [ 147920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 916 ], [ 147970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 917 ], [ 148001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 918 ], [ 148007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 919 ], [ 148038, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 920 ], [ 148043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 921 ], [ 148074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 922 ], [ 148080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 923 ], [ 148094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 924 ], [ 148111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 925 ], [ 148125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 16 ], [ 148126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 17 ], [ 148130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1647 ], [ 148143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1648 ], [ 148191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1649 ], [ 148246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1650 ], [ 148301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1651 ], [ 148356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1652 ], [ 148406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1653 ], [ 148422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1654 ], [ 148495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1655 ], [ 148573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1656 ], [ 148637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1657 ], [ 148715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1658 ], [ 148794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1659 ], [ 148868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1660 ], [ 148942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1661 ], [ 149003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1662 ], [ 149012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1663 ], [ 149013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1664 ], [ 149091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1665 ], [ 149167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1666 ], [ 149246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1667 ], [ 149325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1668 ], [ 149399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1669 ], [ 149475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1670 ], [ 149556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1671 ], [ 149635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1672 ], [ 149715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1673 ], [ 149786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1674 ], [ 149787, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1675 ], [ 149810, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1676 ], [ 149871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1677 ], [ 149917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1678 ], [ 149955, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1679 ], [ 149961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1680 ], [ 149986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1681 ], [ 150013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1682 ], [ 150018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1683 ], [ 150052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1684 ], [ 150058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1685 ], [ 150091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1686 ], [ 150125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1687 ], [ 150130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1688 ], [ 150164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1689 ], [ 150170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1690 ], [ 150211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1691 ], [ 150245, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1692 ], [ 150250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1693 ], [ 150284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1694 ], [ 150290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1695 ], [ 150339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1696 ], [ 150373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1697 ], [ 150378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1698 ], [ 150392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1699 ], [ 150409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1700 ], [ 150423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 17 ], [ 150424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 18 ], [ 150428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2184 ], [ 150441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2185 ], [ 150495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2186 ], [ 150545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2187 ], [ 150561, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2188 ], [ 150637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2189 ], [ 150646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2190 ], [ 150647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2191 ], [ 150731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2192 ], [ 150732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2193 ], [ 150755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2194 ], [ 150814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2195 ], [ 150861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2196 ], [ 150924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2197 ], [ 150929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2198 ], [ 150960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2199 ], [ 151014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2200 ], [ 151019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2201 ], [ 151079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2202 ], [ 151124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2203 ], [ 151178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2204 ], [ 151183, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2205 ], [ 151197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2206 ], [ 151214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2207 ], [ 151228, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 18 ], [ 151229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 19 ], [ 151233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2211 ], [ 151246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2212 ], [ 151300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2213 ], [ 151350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2214 ], [ 151366, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2215 ], [ 151442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2216 ], [ 151451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2217 ], [ 151452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2218 ], [ 151535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2219 ], [ 151616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2220 ], [ 151698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2221 ], [ 151790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2222 ], [ 151831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2223 ], [ 151832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2224 ], [ 151855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2225 ], [ 151915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2226 ], [ 151962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2227 ], [ 152025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2228 ], [ 152030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2229 ], [ 152046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2230 ], [ 152048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2231 ], [ 152106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2232 ], [ 152144, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2233 ], [ 152181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2234 ], [ 152224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2235 ], [ 152284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2236 ], [ 152329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2237 ], [ 152367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2238 ], [ 152397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2239 ], [ 152402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2240 ], [ 152418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2241 ], [ 152420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2242 ], [ 152434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2243 ], [ 152451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 2244 ], [ 152465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 19 ], [ 152466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 20 ], [ 152479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 21 ], [ 152480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 22 ], [ 152532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 23 ], [ 152536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 315 ], [ 152549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 316 ], [ 152596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 317 ], [ 152654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 318 ], [ 152717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 319 ], [ 152733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 320 ], [ 152806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 321 ], [ 152826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 322 ], [ 152900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 323 ], [ 152981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 324 ], [ 153040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 325 ], [ 153041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 326 ], [ 153110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 327 ], [ 153191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 328 ], [ 153267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 329 ], [ 153268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 330 ], [ 153291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 331 ], [ 153312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 332 ], [ 153357, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 333 ], [ 153407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 334 ], [ 153455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 335 ], [ 153480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 336 ], [ 153532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 337 ], [ 153566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 338 ], [ 153585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 339 ], [ 153631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 340 ], [ 153677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 341 ], [ 153723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 342 ], [ 153769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 343 ], [ 153815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 344 ], [ 153861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 345 ], [ 153907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 346 ], [ 153953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 347 ], [ 153999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 348 ], [ 154046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 349 ], [ 154091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 350 ], [ 154134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 351 ], [ 154168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 352 ], [ 154186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 353 ], [ 154204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 354 ], [ 154223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 355 ], [ 154237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 356 ], [ 154254, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 357 ], [ 154268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 23 ], [ 154269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 24 ], [ 154273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1386 ], [ 154286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1387 ], [ 154342, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1388 ], [ 154403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1389 ], [ 154419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1390 ], [ 154490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1391 ], [ 154560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1392 ], [ 154620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1393 ], [ 154643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1394 ], [ 154663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1395 ], [ 154708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1396 ], [ 154758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1397 ], [ 154806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1398 ], [ 154831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1399 ], [ 154883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1400 ], [ 154917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1401 ], [ 154989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1402 ], [ 155000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1403 ], [ 155030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1404 ], [ 155075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1405 ], [ 155109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1406 ], [ 155142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1407 ], [ 155187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1408 ], [ 155230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1409 ], [ 155264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1410 ], [ 155272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1411 ], [ 155286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1412 ], [ 155303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1413 ], [ 155317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 24 ], [ 155318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 25 ], [ 155322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 361 ], [ 155335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 362 ], [ 155389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 363 ], [ 155454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 364 ], [ 155504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 365 ], [ 155520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 366 ], [ 155590, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 367 ], [ 155662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 368 ], [ 155738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 369 ], [ 155815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 370 ], [ 155889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 371 ], [ 155962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 372 ], [ 155981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 373 ], [ 155982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 374 ], [ 156058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 375 ], [ 156075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 376 ], [ 156076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 377 ], [ 156153, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 378 ], [ 156195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 379 ], [ 156262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 380 ], [ 156342, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 381 ], [ 156365, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 382 ], [ 156419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 383 ], [ 156464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 384 ], [ 156509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 385 ], [ 156547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 386 ], [ 156585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 387 ], [ 156623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 388 ], [ 156662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 389 ], [ 156691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 390 ], [ 156736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 391 ], [ 156774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 392 ], [ 156812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 393 ], [ 156850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 394 ], [ 156889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 395 ], [ 156935, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 396 ], [ 156940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 397 ], [ 156985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 398 ], [ 157028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 399 ], [ 157072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 400 ], [ 157102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 401 ], [ 157132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 402 ], [ 157163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 403 ], [ 157177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 404 ], [ 157194, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 405 ], [ 157208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 25 ], [ 157209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 26 ], [ 157213, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 267 ], [ 157226, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 268 ], [ 157282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 269 ], [ 157315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 270 ], [ 157331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 271 ], [ 157412, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 272 ], [ 157486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 273 ], [ 157566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 274 ], [ 157613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 275 ], [ 157614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 276 ], [ 157637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 277 ], [ 157681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 278 ], [ 157726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 279 ], [ 157773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 280 ], [ 157798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 281 ], [ 157814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 282 ], [ 157819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 283 ], [ 157835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 284 ], [ 157840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 285 ], [ 157856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 286 ], [ 157862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 287 ], [ 157878, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 288 ], [ 157884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 289 ], [ 157920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 290 ], [ 157956, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 291 ], [ 157993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 292 ], [ 158043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 293 ], [ 158085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 294 ], [ 158110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 295 ], [ 158126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 296 ], [ 158131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 297 ], [ 158147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 298 ], [ 158153, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 299 ], [ 158169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 300 ], [ 158175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 301 ], [ 158220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 302 ], [ 158263, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 303 ], [ 158304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 304 ], [ 158329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 305 ], [ 158345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 306 ], [ 158350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 307 ], [ 158366, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 308 ], [ 158372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 309 ], [ 158386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 310 ], [ 158403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 311 ], [ 158417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 26 ], [ 158418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 27 ], [ 158422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 137 ], [ 158435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 138 ], [ 158479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 139 ], [ 158524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 140 ], [ 158574, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 141 ], [ 158590, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 142 ], [ 158670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 143 ], [ 158739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 144 ], [ 158818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 145 ], [ 158838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 146 ], [ 158839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 147 ], [ 158862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 148 ], [ 158883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 149 ], [ 158939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 150 ], [ 158985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 151 ], [ 159008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 152 ], [ 159053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 153 ], [ 159077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 154 ], [ 159122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 155 ], [ 159145, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 156 ], [ 159208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 157 ], [ 159271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 158 ], [ 159294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 159 ], [ 159339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 160 ], [ 159382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 161 ], [ 159404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 162 ], [ 159416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 163 ], [ 159439, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 164 ], [ 159451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 165 ], [ 159465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 166 ], [ 159482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 167 ], [ 159496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 27 ], [ 159497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 28 ], [ 159501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 171 ], [ 159514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 172 ], [ 159559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 173 ], [ 159603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 174 ], [ 159659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 175 ], [ 159714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 176 ], [ 159765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 177 ], [ 159781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 178 ], [ 159860, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 179 ], [ 159895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 180 ], [ 159971, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 181 ], [ 160039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 182 ], [ 160064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 183 ], [ 160065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 184 ], [ 160132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 185 ], [ 160211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 186 ], [ 160286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 187 ], [ 160287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 188 ], [ 160310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 189 ], [ 160346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 190 ], [ 160382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 191 ], [ 160419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 192 ], [ 160464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 193 ], [ 160488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 194 ], [ 160514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 195 ], [ 160560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 196 ], [ 160605, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 197 ], [ 160629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 198 ], [ 160662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 199 ], [ 160700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 200 ], [ 160714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 201 ], [ 160728, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 202 ], [ 160744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 203 ], [ 160794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 204 ], [ 160818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 205 ], [ 160854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 206 ], [ 160889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 207 ], [ 160925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 208 ], [ 160970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 209 ], [ 161013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 210 ], [ 161036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 211 ], [ 161060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 212 ], [ 161074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 213 ], [ 161091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 214 ], [ 161105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 28 ], [ 161106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 29 ], [ 161110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 218 ], [ 161123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 219 ], [ 161167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 220 ], [ 161210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 221 ], [ 161265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 222 ], [ 161319, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 223 ], [ 161369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 224 ], [ 161385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 225 ], [ 161463, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 226 ], [ 161498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 227 ], [ 161574, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 228 ], [ 161642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 229 ], [ 161667, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 230 ], [ 161668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 231 ], [ 161734, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 232 ], [ 161812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 233 ], [ 161886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 234 ], [ 161887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 235 ], [ 161963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 236 ], [ 161964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 237 ], [ 161987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 238 ], [ 162023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 239 ], [ 162059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 240 ], [ 162096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 241 ], [ 162141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 242 ], [ 162164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 243 ], [ 162188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 244 ], [ 162234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 245 ], [ 162279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 246 ], [ 162302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 247 ], [ 162335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 248 ], [ 162373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 249 ], [ 162387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 250 ], [ 162401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 251 ], [ 162417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 252 ], [ 162467, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 253 ], [ 162490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 254 ], [ 162526, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 255 ], [ 162560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 256 ], [ 162596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 257 ], [ 162641, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 258 ], [ 162684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 259 ], [ 162706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 260 ], [ 162730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 261 ], [ 162744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 262 ], [ 162761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 263 ], [ 162775, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 29 ], [ 162776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 30 ], [ 162780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 482 ], [ 162793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 483 ], [ 162835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 484 ], [ 162884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 485 ], [ 162928, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 486 ], [ 162982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 487 ], [ 162998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 488 ], [ 162999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 489 ], [ 163071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 490 ], [ 163160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 491 ], [ 163239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 492 ], [ 163274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 493 ], [ 163320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 494 ], [ 163321, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 495 ], [ 163386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 496 ], [ 163447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 497 ], [ 163448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 498 ], [ 163520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 499 ], [ 163578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 500 ], [ 163579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 501 ], [ 163602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 502 ], [ 163653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 503 ], [ 163703, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 504 ], [ 163723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 505 ], [ 163738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 506 ], [ 163765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 507 ], [ 163780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 508 ], [ 163802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 509 ], [ 163814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 510 ], [ 163859, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 511 ], [ 163902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 512 ], [ 163922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 513 ], [ 163934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 514 ], [ 163948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 515 ], [ 163965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 516 ], [ 163979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 30 ], [ 163980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 31 ], [ 163984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 520 ], [ 163997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 521 ], [ 164038, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 522 ], [ 164086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 523 ], [ 164129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 524 ], [ 164183, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 525 ], [ 164199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 526 ], [ 164200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 527 ], [ 164272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 528 ], [ 164360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 529 ], [ 164435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 530 ], [ 164473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 531 ], [ 164518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 532 ], [ 164519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 533 ], [ 164583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 534 ], [ 164644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 535 ], [ 164645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 536 ], [ 164716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 537 ], [ 164774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 538 ], [ 164775, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 539 ], [ 164798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 540 ], [ 164855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 541 ], [ 164905, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 542 ], [ 164924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 543 ], [ 164939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 544 ], [ 164965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 545 ], [ 164980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 546 ], [ 165001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 547 ], [ 165013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 548 ], [ 165058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 549 ], [ 165101, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 550 ], [ 165120, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 551 ], [ 165132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 552 ], [ 165146, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 553 ], [ 165163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 554 ], [ 165177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 31 ], [ 165178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 32 ], [ 165182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 661 ], [ 165195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 662 ], [ 165252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 663 ], [ 165299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 664 ], [ 165315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 665 ], [ 165392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 666 ], [ 165420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 667 ], [ 165497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 668 ], [ 165532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 669 ], [ 165541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 670 ], [ 165564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 671 ], [ 165584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 672 ], [ 165644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 673 ], [ 165695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 674 ], [ 165725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 675 ], [ 165727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 676 ], [ 165757, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 677 ], [ 165759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 678 ], [ 165789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 679 ], [ 165791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 680 ], [ 165821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 681 ], [ 165823, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 682 ], [ 165837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 683 ], [ 165854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 684 ], [ 165868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 32 ], [ 165869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 33 ], [ 165873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 688 ], [ 165886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 689 ], [ 165947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 690 ], [ 166007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 691 ], [ 166048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 692 ], [ 166064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 693 ], [ 166065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 694 ], [ 166139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 695 ], [ 166159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 696 ], [ 166238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 697 ], [ 166315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 698 ], [ 166386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 699 ], [ 166409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 700 ], [ 166429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 701 ], [ 166489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 702 ], [ 166540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 703 ], [ 166574, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 704 ], [ 166586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 705 ], [ 166620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 706 ], [ 166632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 707 ], [ 166646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 708 ], [ 166663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 709 ], [ 166677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 33 ], [ 166678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 34 ], [ 166682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 713 ], [ 166695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 714 ], [ 166751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 715 ], [ 166796, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 716 ], [ 166812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 717 ], [ 166888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 718 ], [ 166916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 719 ], [ 166992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 720 ], [ 167026, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 721 ], [ 167049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 722 ], [ 167069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 723 ], [ 167129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 724 ], [ 167180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 725 ], [ 167209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 726 ], [ 167211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 727 ], [ 167240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 728 ], [ 167242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 729 ], [ 167271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 730 ], [ 167273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 731 ], [ 167302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 732 ], [ 167304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 733 ], [ 167318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 734 ], [ 167335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 735 ], [ 167349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 34 ], [ 167350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 35 ], [ 167354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 739 ], [ 167367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 740 ], [ 167427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 741 ], [ 167486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 742 ], [ 167537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 743 ], [ 167553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 744 ], [ 167554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 745 ], [ 167628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 746 ], [ 167648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 747 ], [ 167727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 748 ], [ 167804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 749 ], [ 167876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 750 ], [ 167877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 751 ], [ 167900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 752 ], [ 167920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 753 ], [ 167980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 754 ], [ 168031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 755 ], [ 168064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 756 ], [ 168079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 757 ], [ 168112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 758 ], [ 168139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 759 ], [ 168153, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 760 ], [ 168170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 761 ], [ 168184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 35 ], [ 168185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 36 ], [ 168189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1247 ], [ 168202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1248 ], [ 168246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1249 ], [ 168287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1250 ], [ 168303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1251 ], [ 168381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1252 ], [ 168451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1253 ], [ 168521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1254 ], [ 168522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1255 ], [ 168545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1256 ], [ 168580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1257 ], [ 168625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1258 ], [ 168650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1259 ], [ 168656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1260 ], [ 168678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1261 ], [ 168683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1262 ], [ 168741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1263 ], [ 168786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1264 ], [ 168808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1265 ], [ 168817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1266 ], [ 168866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1267 ], [ 168909, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1268 ], [ 168931, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1269 ], [ 168937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1270 ], [ 168951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1271 ], [ 168968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1272 ], [ 168982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 36 ], [ 168983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 37 ], [ 168987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1574 ], [ 169000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1575 ], [ 169049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1576 ], [ 169075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1577 ], [ 169124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1578 ], [ 169150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1579 ], [ 169205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1580 ], [ 169223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1581 ], [ 169281, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1582 ], [ 169358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1583 ], [ 169433, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1584 ], [ 169509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1585 ], [ 169553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1586 ], [ 169601, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1587 ], [ 169679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1588 ], [ 169740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1589 ], [ 169741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1590 ], [ 169764, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1591 ], [ 169820, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1592 ], [ 169865, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1593 ], [ 169914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1594 ], [ 169916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1595 ], [ 169965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1596 ], [ 169967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1597 ], [ 170016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1598 ], [ 170018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1599 ], [ 170067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1600 ], [ 170069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1601 ], [ 170122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1602 ], [ 170167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1603 ], [ 170216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1604 ], [ 170221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1605 ], [ 170270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1606 ], [ 170275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1607 ], [ 170324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1608 ], [ 170329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1609 ], [ 170378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1610 ], [ 170383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1611 ], [ 170397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1612 ], [ 170414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1613 ], [ 170428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 37 ], [ 170429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 38 ], [ 170433, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 409 ], [ 170446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 410 ], [ 170490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 411 ], [ 170553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 412 ], [ 170569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 413 ], [ 170642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 414 ], [ 170719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 415 ], [ 170801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 416 ], [ 170819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 417 ], [ 170896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 418 ], [ 170897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 419 ], [ 170952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 420 ], [ 170975, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 421 ], [ 171027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 422 ], [ 171072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 423 ], [ 171106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 424 ], [ 171128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 425 ], [ 171150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 426 ], [ 171172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 427 ], [ 171195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 428 ], [ 171223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 429 ], [ 171257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 430 ], [ 171283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 431 ], [ 171309, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 432 ], [ 171335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 433 ], [ 171361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 434 ], [ 171388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 435 ], [ 171424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 436 ], [ 171429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 437 ], [ 171474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 438 ], [ 171517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 439 ], [ 171548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 440 ], [ 171566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 441 ], [ 171584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 442 ], [ 171603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 443 ], [ 171617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 444 ], [ 171634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 445 ], [ 171648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 38 ], [ 171649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 39 ], [ 171653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 449 ], [ 171666, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 450 ], [ 171713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 451 ], [ 171763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 452 ], [ 171779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 453 ], [ 171854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 454 ], [ 171927, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 455 ], [ 171992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 456 ], [ 172066, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 457 ], [ 172067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 458 ], [ 172145, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 459 ], [ 172162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 460 ], [ 172185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 461 ], [ 172238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 462 ], [ 172283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 463 ], [ 172321, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 464 ], [ 172347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 465 ], [ 172373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 466 ], [ 172399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 467 ], [ 172426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 468 ], [ 172465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 469 ], [ 172470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 470 ], [ 172515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 471 ], [ 172558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 472 ], [ 172592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 473 ], [ 172613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 474 ], [ 172634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 475 ], [ 172656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 476 ], [ 172670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 477 ], [ 172687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 478 ], [ 172701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 39 ], [ 172702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 40 ], [ 172715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 41 ], [ 172716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 42 ], [ 172776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 43 ], [ 172780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 868 ], [ 172793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 869 ], [ 172840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 870 ], [ 172888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 871 ], [ 172904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 872 ], [ 172974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 873 ], [ 172983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 874 ], [ 172984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 875 ], [ 173057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 876 ], [ 173135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 877 ], [ 173201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 878 ], [ 173270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 879 ], [ 173292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 880 ], [ 173293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 881 ], [ 173346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 882 ], [ 173369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 883 ], [ 173430, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 884 ], [ 173476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 885 ], [ 173501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 886 ], [ 173503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 887 ], [ 173530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 888 ], [ 173572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 889 ], [ 173597, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 890 ], [ 173602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 891 ], [ 173638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 892 ], [ 173644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 893 ], [ 173704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 894 ], [ 173749, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 895 ], [ 173774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 896 ], [ 173776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 897 ], [ 173790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 898 ], [ 173807, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 899 ], [ 173821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 43 ], [ 173822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 44 ], [ 173826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1527 ], [ 173839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1528 ], [ 173917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1529 ], [ 173947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1530 ], [ 174019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1531 ], [ 174049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1532 ], [ 174130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1533 ], [ 174168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1534 ], [ 174215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1535 ], [ 174231, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1536 ], [ 174308, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1537 ], [ 174388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1538 ], [ 174465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1539 ], [ 174539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1540 ], [ 174607, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1541 ], [ 174608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1542 ], [ 174689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1543 ], [ 174768, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1544 ], [ 174791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1545 ], [ 174792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1546 ], [ 174864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1547 ], [ 174881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1548 ], [ 174882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1549 ], [ 174963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1550 ], [ 175032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1551 ], [ 175111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1552 ], [ 175192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1553 ], [ 175271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1554 ], [ 175325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1555 ], [ 175348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1556 ], [ 175400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1557 ], [ 175445, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1558 ], [ 175484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1559 ], [ 175486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1560 ], [ 175527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1561 ], [ 175529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1562 ], [ 175568, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1563 ], [ 175573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1564 ], [ 175622, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1565 ], [ 175624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1566 ], [ 175673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1567 ], [ 175675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1568 ], [ 175689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1569 ], [ 175706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1570 ], [ 175720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 44 ], [ 175721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 45 ], [ 175725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 830 ], [ 175738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 831 ], [ 175794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 832 ], [ 175832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 833 ], [ 175848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 834 ], [ 175917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 835 ], [ 175998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 836 ], [ 176075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 837 ], [ 176108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 838 ], [ 176109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 839 ], [ 176187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 840 ], [ 176265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 841 ], [ 176346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 842 ], [ 176425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 843 ], [ 176502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 844 ], [ 176511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 845 ], [ 176512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 846 ], [ 176584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 847 ], [ 176633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 848 ], [ 176634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 849 ], [ 176657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 850 ], [ 176704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 851 ], [ 176749, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 852 ], [ 176791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 853 ], [ 176813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 854 ], [ 176847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 855 ], [ 176881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 856 ], [ 176915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 857 ], [ 176950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 858 ], [ 176995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 859 ], [ 177038, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 860 ], [ 177072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 861 ], [ 177114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 862 ], [ 177128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 863 ], [ 177145, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 864 ], [ 177159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 45 ], [ 177160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 46 ], [ 177164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1430 ], [ 177177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1431 ], [ 177244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1432 ], [ 177297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1433 ], [ 177313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1434 ], [ 177392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1435 ], [ 177467, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1436 ], [ 177537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1437 ], [ 177615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1438 ], [ 177651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1439 ], [ 177660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1440 ], [ 177661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1441 ], [ 177672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1442 ], [ 177685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1443 ], [ 177753, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1444 ], [ 177805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1445 ], [ 177882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1446 ], [ 177951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1447 ], [ 177997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1448 ], [ 178046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1449 ], [ 178092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1450 ], [ 178093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1451 ], [ 178187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1452 ], [ 178201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1453 ], [ 178202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1454 ], [ 178215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1455 ], [ 178256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1456 ], [ 178312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1457 ], [ 178374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1458 ], [ 178388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1459 ], [ 178400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1460 ], [ 178401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1461 ], [ 178475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1462 ], [ 178528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1463 ], [ 178529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1464 ], [ 178548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1465 ], [ 178600, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1466 ], [ 178645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1467 ], [ 178690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1468 ], [ 178692, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1469 ], [ 178737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1470 ], [ 178739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1471 ], [ 178766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1472 ], [ 178771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1473 ], [ 178816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1474 ], [ 178825, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1475 ], [ 178839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1476 ], [ 178856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1477 ], [ 178870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 46 ], [ 178871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 47 ], [ 178875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1499 ], [ 178888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1500 ], [ 179001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1501 ], [ 179115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1502 ], [ 179155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1503 ], [ 179171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1504 ], [ 179249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1505 ], [ 179314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1506 ], [ 179375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1507 ], [ 179376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1508 ], [ 179451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1509 ], [ 179518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1510 ], [ 179582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1511 ], [ 179583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1512 ], [ 179606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1513 ], [ 179653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1514 ], [ 179698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1515 ], [ 179737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1516 ], [ 179749, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1517 ], [ 179783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1518 ], [ 179792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1519 ], [ 179826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1520 ], [ 179832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1521 ], [ 179846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1522 ], [ 179863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1523 ], [ 179877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 47 ], [ 179878, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 48 ], [ 179882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 903 ], [ 179895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 904 ], [ 179939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 905 ], [ 179992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 906 ], [ 180008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 907 ], [ 180083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 908 ], [ 180163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 909 ], [ 180244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 910 ], [ 180293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 911 ], [ 180302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 912 ], [ 180303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 913 ], [ 180380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 914 ], [ 180461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 915 ], [ 180482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 916 ], [ 180491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 917 ], [ 180492, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 918 ], [ 180568, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 919 ], [ 180647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 920 ], [ 180725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 921 ], [ 180804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 922 ], [ 180832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 923 ], [ 180841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 924 ], [ 180842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 925 ], [ 180922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 926 ], [ 180945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 927 ], [ 180976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 928 ], [ 181021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 929 ], [ 181043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 930 ], [ 181045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 931 ], [ 181088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 932 ], [ 181133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 933 ], [ 181155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 934 ], [ 181164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 935 ], [ 181208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 936 ], [ 181253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 937 ], [ 181275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 938 ], [ 181277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 939 ], [ 181337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 940 ], [ 181382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 941 ], [ 181404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 942 ], [ 181406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 943 ], [ 181420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 944 ], [ 181437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 945 ], [ 181451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 48 ], [ 181452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 49 ], [ 181456, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 949 ], [ 181469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 950 ], [ 181516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 951 ], [ 181569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 952 ], [ 181585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 953 ], [ 181664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 954 ], [ 181739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 955 ], [ 181806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 956 ], [ 181876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 957 ], [ 181897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 958 ], [ 181906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 959 ], [ 181907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 960 ], [ 181986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 961 ], [ 182063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 962 ], [ 182138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 963 ], [ 182164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 964 ], [ 182173, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 965 ], [ 182174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 966 ], [ 182220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 967 ], [ 182243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 968 ], [ 182282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 969 ], [ 182327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 970 ], [ 182352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 971 ], [ 182354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 972 ], [ 182381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 973 ], [ 182423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 974 ], [ 182448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 975 ], [ 182457, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 976 ], [ 182502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 977 ], [ 182547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 978 ], [ 182572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 979 ], [ 182581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 980 ], [ 182626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 981 ], [ 182669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 982 ], [ 182716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 983 ], [ 182759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 984 ], [ 182784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 985 ], [ 182786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 986 ], [ 182800, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 987 ], [ 182817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 988 ], [ 182831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 49 ], [ 182832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 50 ], [ 182836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 992 ], [ 182849, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 993 ], [ 182903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 994 ], [ 182955, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 995 ], [ 182971, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 996 ], [ 183048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 997 ], [ 183128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 998 ], [ 183209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 999 ], [ 183242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1000 ], [ 183243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1001 ], [ 183324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1002 ], [ 183402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1003 ], [ 183472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1004 ], [ 183473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1005 ], [ 183541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1006 ], [ 183567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1007 ], [ 183590, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1008 ], [ 183643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1009 ], [ 183688, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1010 ], [ 183720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1011 ], [ 183722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1012 ], [ 183761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1013 ], [ 183806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1014 ], [ 183838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1015 ], [ 183847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1016 ], [ 183887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1017 ], [ 183932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1018 ], [ 183964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1019 ], [ 183966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1020 ], [ 184026, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1021 ], [ 184071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1022 ], [ 184103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1023 ], [ 184105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1024 ], [ 184119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1025 ], [ 184136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1026 ], [ 184150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 50 ], [ 184151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 51 ], [ 184155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 661 ], [ 184168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 662 ], [ 184226, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 663 ], [ 184286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 664 ], [ 184317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 665 ], [ 184333, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 666 ], [ 184409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 667 ], [ 184482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 668 ], [ 184562, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 669 ], [ 184641, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 670 ], [ 184721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 671 ], [ 184798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 672 ], [ 184877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 673 ], [ 184951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 674 ], [ 184952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 675 ], [ 185013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 676 ], [ 185056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 677 ], [ 185057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 678 ], [ 185129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 679 ], [ 185205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 680 ], [ 185267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 681 ], [ 185341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 682 ], [ 185413, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 683 ], [ 185414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 684 ], [ 185488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 685 ], [ 185528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 686 ], [ 185588, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 687 ], [ 185589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 688 ], [ 185666, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 689 ], [ 185739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 690 ], [ 185769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 691 ], [ 185770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 692 ], [ 185793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 693 ], [ 185832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 694 ], [ 185877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 695 ], [ 185914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 696 ], [ 185965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 697 ], [ 186004, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 698 ], [ 186049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 699 ], [ 186086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 700 ], [ 186141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 701 ], [ 186180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 702 ], [ 186182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 703 ], [ 186210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 704 ], [ 186252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 705 ], [ 186289, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 706 ], [ 186322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 707 ], [ 186367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 708 ], [ 186410, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 709 ], [ 186437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 710 ], [ 186479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 711 ], [ 186512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 712 ], [ 186555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 713 ], [ 186591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 714 ], [ 186658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 715 ], [ 186672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 716 ], [ 186689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 717 ], [ 186703, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 51 ], [ 186704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 52 ], [ 186708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 822 ], [ 186721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 823 ], [ 186786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 824 ], [ 186827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 825 ], [ 186843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 826 ], [ 186912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 827 ], [ 186980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 828 ], [ 187003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 829 ], [ 187074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 830 ], [ 187097, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 831 ], [ 187141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 832 ], [ 187186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 833 ], [ 187224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 834 ], [ 187236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 835 ], [ 187274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 836 ], [ 187286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 837 ], [ 187324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 838 ], [ 187330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 839 ], [ 187344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 840 ], [ 187361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 841 ], [ 187375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 52 ], [ 187376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 53 ], [ 187380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 604 ], [ 187393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 605 ], [ 187459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 606 ], [ 187527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 607 ], [ 187558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 608 ], [ 187574, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 609 ], [ 187652, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 610 ], [ 187725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 611 ], [ 187803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 612 ], [ 187882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 613 ], [ 187959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 614 ], [ 187979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 615 ], [ 187988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 616 ], [ 187989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 617 ], [ 188061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 618 ], [ 188139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 619 ], [ 188200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 620 ], [ 188274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 621 ], [ 188348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 622 ], [ 188349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 623 ], [ 188424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 624 ], [ 188497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 625 ], [ 188570, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 626 ], [ 188630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 627 ], [ 188631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 628 ], [ 188707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 629 ], [ 188724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 630 ], [ 188801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 631 ], [ 188831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 632 ], [ 188832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 633 ], [ 188855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 634 ], [ 188894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 635 ], [ 188939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 636 ], [ 188984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 637 ], [ 189039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 638 ], [ 189086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 639 ], [ 189088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 640 ], [ 189154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 641 ], [ 189199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 642 ], [ 189243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 643 ], [ 189297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 644 ], [ 189337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 645 ], [ 189383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 646 ], [ 189385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 647 ], [ 189430, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 648 ], [ 189473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 649 ], [ 189500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 650 ], [ 189542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 651 ], [ 189575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 652 ], [ 189618, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 653 ], [ 189662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 654 ], [ 189729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 655 ], [ 189743, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 656 ], [ 189760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 657 ], [ 189774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 53 ], [ 189775, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 54 ], [ 189779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 799 ], [ 189792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 800 ], [ 189865, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 801 ], [ 189906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 802 ], [ 189922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 803 ], [ 189991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 804 ], [ 190068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 805 ], [ 190091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 806 ], [ 190170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 807 ], [ 190193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 808 ], [ 190237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 809 ], [ 190282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 810 ], [ 190328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 811 ], [ 190337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 812 ], [ 190383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 813 ], [ 190389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 814 ], [ 190435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 815 ], [ 190441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 816 ], [ 190455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 817 ], [ 190472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 818 ], [ 190486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 54 ], [ 190487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 55 ], [ 190491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1315 ], [ 190504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1316 ], [ 190555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1317 ], [ 190621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1318 ], [ 190637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1319 ], [ 190709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1320 ], [ 190786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1321 ], [ 190841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1322 ], [ 190897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1323 ], [ 190898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1324 ], [ 190978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1325 ], [ 191056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1326 ], [ 191134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1327 ], [ 191209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1328 ], [ 191267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1329 ], [ 191268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1330 ], [ 191348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1331 ], [ 191428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1332 ], [ 191484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1333 ], [ 191507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1334 ], [ 191534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1335 ], [ 191576, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1336 ], [ 191605, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1337 ], [ 191610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1338 ], [ 191637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1339 ], [ 191679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1340 ], [ 191708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1341 ], [ 191734, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1342 ], [ 191782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1343 ], [ 191827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1344 ], [ 191856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1345 ], [ 191882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1346 ], [ 191942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1347 ], [ 191986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1348 ], [ 192015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1349 ], [ 192041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1350 ], [ 192055, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1351 ], [ 192072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1352 ], [ 192086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 55 ], [ 192087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 56 ], [ 192091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1030 ], [ 192104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1031 ], [ 192154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1032 ], [ 192195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1033 ], [ 192211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1034 ], [ 192212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1035 ], [ 192291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1036 ], [ 192367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1037 ], [ 192447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1038 ], [ 192527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1039 ], [ 192588, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1040 ], [ 192589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1041 ], [ 192664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1042 ], [ 192738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1043 ], [ 192780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1044 ], [ 192781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1045 ], [ 192843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1046 ], [ 192844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1047 ], [ 192917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1048 ], [ 192994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1049 ], [ 193069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1050 ], [ 193070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1051 ], [ 193119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1052 ], [ 193138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1053 ], [ 193180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1054 ], [ 193185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1055 ], [ 193247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1056 ], [ 193275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1057 ], [ 193284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1058 ], [ 193326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1059 ], [ 193338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1060 ], [ 193379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1061 ], [ 193384, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1062 ], [ 193429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1063 ], [ 193472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1064 ], [ 193500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1065 ], [ 193509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1066 ], [ 193523, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1067 ], [ 193540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1068 ], [ 193554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 56 ], [ 193555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 57 ], [ 193559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1208 ], [ 193572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1209 ], [ 193617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1210 ], [ 193650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1211 ], [ 193666, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1212 ], [ 193738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1213 ], [ 193739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1214 ], [ 193820, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1215 ], [ 193899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1216 ], [ 193977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1217 ], [ 194053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1218 ], [ 194122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1219 ], [ 194123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1220 ], [ 194200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1221 ], [ 194243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1222 ], [ 194266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1223 ], [ 194320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1224 ], [ 194370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1225 ], [ 194393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1226 ], [ 194395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1227 ], [ 194447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1228 ], [ 194492, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1229 ], [ 194515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1230 ], [ 194517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1231 ], [ 194544, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1232 ], [ 194586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1233 ], [ 194609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1234 ], [ 194611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1235 ], [ 194637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1236 ], [ 194642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1237 ], [ 194702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1238 ], [ 194747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1239 ], [ 194770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1240 ], [ 194772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1241 ], [ 194786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1242 ], [ 194803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1243 ], [ 194817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 57 ], [ 194818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 58 ], [ 194822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 929 ], [ 194835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 930 ], [ 194907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 931 ], [ 194938, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 932 ], [ 194954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 933 ], [ 195018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 934 ], [ 195095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 935 ], [ 195168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 936 ], [ 195204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 937 ], [ 195205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 938 ], [ 195282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 939 ], [ 195331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 940 ], [ 195411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 941 ], [ 195486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 942 ], [ 195558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 943 ], [ 195633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 944 ], [ 195653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 945 ], [ 195654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 946 ], [ 195721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 947 ], [ 195795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 948 ], [ 195875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 949 ], [ 195904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 950 ], [ 195978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 951 ], [ 196046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 952 ], [ 196071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 953 ], [ 196072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 954 ], [ 196091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 955 ], [ 196129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 956 ], [ 196169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 957 ], [ 196211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 958 ], [ 196237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 959 ], [ 196245, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 960 ], [ 196251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 961 ], [ 196255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 962 ], [ 196269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 963 ], [ 196270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 964 ], [ 196348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 965 ], [ 196427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 966 ], [ 196486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 967 ], [ 196487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 968 ], [ 196510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 969 ], [ 196559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 970 ], [ 196605, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 971 ], [ 196641, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 972 ], [ 196689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 973 ], [ 196759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 974 ], [ 196803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 975 ], [ 196813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 976 ], [ 196821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 977 ], [ 196828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 978 ], [ 196861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 979 ], [ 196927, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 980 ], [ 196961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 981 ], [ 196997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 982 ], [ 197033, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 983 ], [ 197069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 984 ], [ 197105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 985 ], [ 197141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 986 ], [ 197178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 987 ], [ 197192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 988 ], [ 197209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 989 ], [ 197223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 58 ], [ 197224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 59 ], [ 197228, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1270 ], [ 197241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1271 ], [ 197290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1272 ], [ 197340, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1273 ], [ 197356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1274 ], [ 197434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1275 ], [ 197514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1276 ], [ 197594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1277 ], [ 197667, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1278 ], [ 197698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1279 ], [ 197707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1280 ], [ 197708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1281 ], [ 197784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1282 ], [ 197862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1283 ], [ 197894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1284 ], [ 197895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1285 ], [ 197914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1286 ], [ 197953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1287 ], [ 197998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1288 ], [ 198025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1289 ], [ 198030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1290 ], [ 198057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1291 ], [ 198063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1292 ], [ 198090, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1293 ], [ 198095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1294 ], [ 198122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1295 ], [ 198128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1296 ], [ 198142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1297 ], [ 198159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1298 ], [ 198173, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 59 ], [ 198174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 60 ], [ 198178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1302 ], [ 198191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1303 ], [ 198240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1304 ], [ 198294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1305 ], [ 198310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1306 ], [ 198390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1307 ], [ 198463, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1308 ], [ 198542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1309 ], [ 198615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1310 ], [ 198695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1311 ], [ 198751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1312 ], [ 198760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1313 ], [ 198761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1314 ], [ 198832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1315 ], [ 198884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1316 ], [ 198947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1317 ], [ 198948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1318 ], [ 198959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1319 ], [ 198972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1320 ], [ 199030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1321 ], [ 199044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1322 ], [ 199057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1323 ], [ 199139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1324 ], [ 199214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1325 ], [ 199240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1326 ], [ 199318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1327 ], [ 199394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1328 ], [ 199470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1329 ], [ 199505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1330 ], [ 199519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1331 ], [ 199531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1332 ], [ 199532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1333 ], [ 199608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1334 ], [ 199686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1335 ], [ 199718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1336 ], [ 199719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1337 ], [ 199738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1338 ], [ 199777, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1339 ], [ 199822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1340 ], [ 199849, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1341 ], [ 199875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1342 ], [ 199902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1343 ], [ 199907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1344 ], [ 199934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1345 ], [ 199954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1346 ], [ 199981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1347 ], [ 199986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1348 ], [ 200000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1349 ], [ 200017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1350 ], [ 200031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 60 ], [ 200032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 61 ], [ 200036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1354 ], [ 200049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1355 ], [ 200106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1356 ], [ 200160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1357 ], [ 200176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1358 ], [ 200254, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1359 ], [ 200331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1360 ], [ 200411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1361 ], [ 200483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1362 ], [ 200562, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1363 ], [ 200593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1364 ], [ 200602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1365 ], [ 200603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1366 ], [ 200664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1367 ], [ 200665, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1368 ], [ 200740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1369 ], [ 200815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1370 ], [ 200857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1371 ], [ 200858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1372 ], [ 200877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1373 ], [ 200932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1374 ], [ 200977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1375 ], [ 201012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1376 ], [ 201038, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1377 ], [ 201073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1378 ], [ 201099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1379 ], [ 201134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1380 ], [ 201139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1381 ], [ 201174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1382 ], [ 201194, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1383 ], [ 201208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1384 ], [ 201225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1385 ], [ 201239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 61 ], [ 201240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 62 ], [ 201244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1389 ], [ 201257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1390 ], [ 201310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1391 ], [ 201344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1392 ], [ 201360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1393 ], [ 201436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1394 ], [ 201515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1395 ], [ 201595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1396 ], [ 201675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1397 ], [ 201703, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1398 ], [ 201712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1399 ], [ 201713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1400 ], [ 201792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1401 ], [ 201861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1402 ], [ 201939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1403 ], [ 202019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1404 ], [ 202061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1405 ], [ 202070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1406 ], [ 202071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1407 ], [ 202090, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1408 ], [ 202154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1409 ], [ 202205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1410 ], [ 202244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1411 ], [ 202255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1412 ], [ 202280, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1413 ], [ 202300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1414 ], [ 202325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1415 ], [ 202345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1416 ], [ 202370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1417 ], [ 202402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1418 ], [ 202429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1419 ], [ 202434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1420 ], [ 202473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1421 ], [ 202484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1422 ], [ 202509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1423 ], [ 202541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1424 ], [ 202555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1425 ], [ 202572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1426 ], [ 202586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 62 ], [ 202587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 63 ], [ 202591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1072 ], [ 202604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1073 ], [ 202660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1074 ], [ 202710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1075 ], [ 202726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1076 ], [ 202799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1077 ], [ 202872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1078 ], [ 202873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1079 ], [ 202953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1080 ], [ 203028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1081 ], [ 203046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1082 ], [ 203047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1083 ], [ 203118, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1084 ], [ 203198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1085 ], [ 203273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1086 ], [ 203352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1087 ], [ 203432, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1088 ], [ 203502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1089 ], [ 203581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1090 ], [ 203603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1091 ], [ 203604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1092 ], [ 203684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1093 ], [ 203761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1094 ], [ 203841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1095 ], [ 203921, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1096 ], [ 203964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1097 ], [ 204044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1098 ], [ 204085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1099 ], [ 204086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1100 ], [ 204109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1101 ], [ 204160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1102 ], [ 204205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1103 ], [ 204239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1104 ], [ 204269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1105 ], [ 204298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1106 ], [ 204332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1107 ], [ 204337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1108 ], [ 204373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1109 ], [ 204418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1110 ], [ 204452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1111 ], [ 204465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1112 ], [ 204494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1113 ], [ 204542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1114 ], [ 204576, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1115 ], [ 204586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1116 ], [ 204631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1117 ], [ 204674, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1118 ], [ 204708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1119 ], [ 204724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1120 ], [ 204738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1121 ], [ 204755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1122 ], [ 204769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 63 ], [ 204770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 64 ], [ 204774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1126 ], [ 204787, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1127 ], [ 204846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1128 ], [ 204903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1129 ], [ 204919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1130 ], [ 204995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1131 ], [ 205072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1132 ], [ 205150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1133 ], [ 205218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1134 ], [ 205219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1135 ], [ 205247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1136 ], [ 205322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1137 ], [ 205399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1138 ], [ 205475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1139 ], [ 205536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1140 ], [ 205537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1141 ], [ 205611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1142 ], [ 205687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1143 ], [ 205744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1144 ], [ 205745, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1145 ], [ 205768, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1146 ], [ 205820, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1147 ], [ 205857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1148 ], [ 205866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1149 ], [ 205895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1150 ], [ 205932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1151 ], [ 205937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1152 ], [ 205985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1153 ], [ 206022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1154 ], [ 206034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1155 ], [ 206094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1156 ], [ 206138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1157 ], [ 206175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1158 ], [ 206202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1159 ], [ 206216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1160 ], [ 206233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1161 ], [ 206247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 64 ], [ 206248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 65 ], [ 206252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1481 ], [ 206265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1482 ], [ 206318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1483 ], [ 206347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1484 ], [ 206363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1485 ], [ 206441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1486 ], [ 206518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1487 ], [ 206578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1488 ], [ 206630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1489 ], [ 206653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1490 ], [ 206684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1491 ], [ 206710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1492 ], [ 206733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1493 ], [ 206747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1494 ], [ 206764, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1495 ], [ 206778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 65 ], [ 206779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 66 ], [ 206783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 756 ], [ 206796, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 757 ], [ 206845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 758 ], [ 206906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 759 ], [ 206922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 760 ], [ 206996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 761 ], [ 207073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 762 ], [ 207139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 763 ], [ 207140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 764 ], [ 207207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 765 ], [ 207282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 766 ], [ 207358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 767 ], [ 207390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 768 ], [ 207391, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 769 ], [ 207462, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 770 ], [ 207497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 771 ], [ 207520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 772 ], [ 207573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 773 ], [ 207600, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 774 ], [ 207602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 775 ], [ 207633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 776 ], [ 207660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 777 ], [ 207662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 778 ], [ 207727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 779 ], [ 207773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 780 ], [ 207800, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 781 ], [ 207802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 782 ], [ 207863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 783 ], [ 207908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 784 ], [ 207935, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 785 ], [ 207937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 786 ], [ 207951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 787 ], [ 207968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 788 ], [ 207982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 66 ], [ 207983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 67 ], [ 207987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 792 ], [ 208000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 793 ], [ 208057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 794 ], [ 208114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 795 ], [ 208130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 796 ], [ 208175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 797 ], [ 208253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 798 ], [ 208326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 799 ], [ 208395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 800 ], [ 208419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 801 ], [ 208420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 802 ], [ 208497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 803 ], [ 208554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 804 ], [ 208631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 805 ], [ 208690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 806 ], [ 208691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 807 ], [ 208767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 808 ], [ 208812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 809 ], [ 208835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 810 ], [ 208888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 811 ], [ 208923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 812 ], [ 208941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 813 ], [ 208972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 814 ], [ 209007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 815 ], [ 209025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 816 ], [ 209090, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 817 ], [ 209136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 818 ], [ 209171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 819 ], [ 209192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 820 ], [ 209252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 821 ], [ 209296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 822 ], [ 209331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 823 ], [ 209352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 824 ], [ 209366, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 825 ], [ 209383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 826 ], [ 209397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 67 ], [ 209398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 68 ], [ 209402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1165 ], [ 209415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1166 ], [ 209462, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1167 ], [ 209506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1168 ], [ 209522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1169 ], [ 209592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1170 ], [ 209593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1171 ], [ 209671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1172 ], [ 209748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1173 ], [ 209824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1174 ], [ 209903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1175 ], [ 209973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1176 ], [ 210007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1177 ], [ 210008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1178 ], [ 210084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1179 ], [ 210123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1180 ], [ 210124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1181 ], [ 210147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1182 ], [ 210172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1183 ], [ 210212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1184 ], [ 210237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1185 ], [ 210243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1186 ], [ 210274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1187 ], [ 210319, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1188 ], [ 210344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1189 ], [ 210353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1190 ], [ 210388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1191 ], [ 210433, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1192 ], [ 210458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1193 ], [ 210463, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1194 ], [ 210499, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1195 ], [ 210544, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1196 ], [ 210569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1197 ], [ 210581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1198 ], [ 210641, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1199 ], [ 210686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1200 ], [ 210711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1201 ], [ 210716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1202 ], [ 210730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1203 ], [ 210747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1204 ], [ 210761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 68 ], [ 210762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 69 ], [ 210766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1417 ], [ 210779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1418 ], [ 210826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1419 ], [ 210859, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1420 ], [ 210875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1421 ], [ 210941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1422 ], [ 210961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1423 ], [ 211036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1424 ], [ 211065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1425 ], [ 211066, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1426 ], [ 211111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1427 ], [ 211178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1428 ], [ 211179, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1429 ], [ 211202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1430 ], [ 211232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1431 ], [ 211277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1432 ], [ 211302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1433 ], [ 211306, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1434 ], [ 211360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1435 ], [ 211385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1436 ], [ 211388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1437 ], [ 211427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1438 ], [ 211429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1439 ], [ 211489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1440 ], [ 211534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1441 ], [ 211559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1442 ], [ 211567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1443 ], [ 211581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1444 ], [ 211598, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1445 ], [ 211612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 69 ], [ 211613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 70 ], [ 211617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1704 ], [ 211630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1705 ], [ 211725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1706 ], [ 211801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1707 ], [ 211833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1708 ], [ 211849, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1709 ], [ 211923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1710 ], [ 211996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1711 ], [ 212074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1712 ], [ 212141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1713 ], [ 212217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1714 ], [ 212291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1715 ], [ 212358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1716 ], [ 212428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1717 ], [ 212489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1718 ], [ 212544, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1719 ], [ 212610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1720 ], [ 212637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1721 ], [ 212638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1722 ], [ 212709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1723 ], [ 212784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1724 ], [ 212839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1725 ], [ 212840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1726 ], [ 212861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1727 ], [ 212908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1728 ], [ 212950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1729 ], [ 212991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1730 ], [ 213036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1731 ], [ 213067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1732 ], [ 213105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1733 ], [ 213136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1734 ], [ 213166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1735 ], [ 213197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1736 ], [ 213227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1737 ], [ 213241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1738 ], [ 213256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 1739 ], [ 213270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 70 ], [ 213271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 71 ], [ 213284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 72 ], [ 213285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 73 ], [ 213339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 74 ], [ 213343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 91 ], [ 213356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 92 ], [ 213408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 93 ], [ 213464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 94 ], [ 213507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 95 ], [ 213523, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 96 ], [ 213598, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 97 ], [ 213677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 98 ], [ 213727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 99 ], [ 213736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 100 ], [ 213737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 101 ], [ 213805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 102 ], [ 213884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 103 ], [ 213938, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 104 ], [ 213947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 105 ], [ 213948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 106 ], [ 214002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 107 ], [ 214025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 108 ], [ 214066, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 109 ], [ 214094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 110 ], [ 214128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 111 ], [ 214174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 112 ], [ 214214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 113 ], [ 214219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 114 ], [ 214233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 115 ], [ 214250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 116 ], [ 214264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 74 ], [ 214265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 75 ], [ 214269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 120 ], [ 214282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 121 ], [ 214339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 122 ], [ 214382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 123 ], [ 214398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 124 ], [ 214478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 125 ], [ 214555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 126 ], [ 214608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 127 ], [ 214687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 128 ], [ 214729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 129 ], [ 214738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 130 ], [ 214739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 131 ], [ 214788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 132 ], [ 214835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 133 ], [ 214858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 134 ], [ 214899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 135 ], [ 214927, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 136 ], [ 214961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 137 ], [ 215007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 138 ], [ 215071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 139 ], [ 215076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 140 ], [ 215116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 141 ], [ 215161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 142 ], [ 215209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 143 ], [ 215227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 144 ], [ 215244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grap\ e.xml", 145 ], [ 215258, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 75 ], [ 215259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 76 ], [ 215272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 77 ], [ 215273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 78 ], [ 215325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 79 ], [ 215329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 615 ], [ 215344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 616 ], [ 215393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 617 ], [ 215436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 618 ], [ 215484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 619 ], [ 215539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 620 ], [ 215557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 621 ], [ 215634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 622 ], [ 215693, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 623 ], [ 215722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 624 ], [ 215801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 625 ], [ 215877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 626 ], [ 215946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 627 ], [ 215993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 628 ], [ 216048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 629 ], [ 216072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 630 ], [ 216136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 631 ], [ 216186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 632 ], [ 216257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 633 ], [ 216326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 634 ], [ 216373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 635 ], [ 216428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 636 ], [ 216439, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 637 ], [ 216440, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 638 ], [ 216516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 639 ], [ 216567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 640 ], [ 216623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 641 ], [ 216697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 642 ], [ 216764, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 643 ], [ 216765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 644 ], [ 216841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 645 ], [ 216919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 646 ], [ 216995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 647 ], [ 217075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 648 ], [ 217100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 649 ], [ 217165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 650 ], [ 217211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 651 ], [ 217262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 652 ], [ 217315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 653 ], [ 217355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 654 ], [ 217360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 655 ], [ 217388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 656 ], [ 217393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 657 ], [ 217407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 658 ], [ 217409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 659 ], [ 217455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 660 ], [ 217500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 661 ], [ 217545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 662 ], [ 217595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 663 ], [ 217609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 664 ], [ 217624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 665 ], [ 217643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 666 ], [ 217659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 79 ], [ 217660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 80 ], [ 217664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 670 ], [ 217679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 671 ], [ 217733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 672 ], [ 217798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 673 ], [ 217862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 674 ], [ 217880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 675 ], [ 217957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 676 ], [ 218016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 677 ], [ 218081, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 678 ], [ 218127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 679 ], [ 218198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 680 ], [ 218268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 681 ], [ 218345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 682 ], [ 218414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 683 ], [ 218483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 684 ], [ 218554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 685 ], [ 218631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 686 ], [ 218656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 687 ], [ 218689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 688 ], [ 218720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 689 ], [ 218751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 690 ], [ 218795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 691 ], [ 218819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 692 ], [ 218845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 693 ], [ 218858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 694 ], [ 218864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 695 ], [ 218881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 696 ], [ 218889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 697 ], [ 218946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 698 ], [ 219003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 699 ], [ 219049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 700 ], [ 219055, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 701 ], [ 219105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 702 ], [ 219119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 703 ], [ 219122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 704 ], [ 219152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 705 ], [ 219180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 706 ], [ 219193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 707 ], [ 219207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 708 ], [ 219226, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/digr\ aph.xml", 709 ], [ 219242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 80 ], [ 219243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 81 ], [ 219256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 82 ], [ 219257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 83 ], [ 219297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 84 ], [ 219301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 111 ], [ 219314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 112 ], [ 219372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 113 ], [ 219416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 114 ], [ 219432, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 115 ], [ 219500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 116 ], [ 219577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 117 ], [ 219655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 118 ], [ 219728, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 119 ], [ 219798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 120 ], [ 219874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 121 ], [ 219954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 122 ], [ 219995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 123 ], [ 220000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 124 ], [ 220073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 125 ], [ 220148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 126 ], [ 220149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 127 ], [ 220192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 128 ], [ 220243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 129 ], [ 220252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 130 ], [ 220257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 131 ], [ 220310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 132 ], [ 220388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 133 ], [ 220415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 134 ], [ 220416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 135 ], [ 220435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 136 ], [ 220495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 137 ], [ 220560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 138 ], [ 220607, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 139 ], [ 220643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 140 ], [ 220648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 141 ], [ 220716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 142 ], [ 220781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 143 ], [ 220851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 144 ], [ 220898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 145 ], [ 220923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 146 ], [ 220929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 147 ], [ 220965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 148 ], [ 221025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 149 ], [ 221053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 150 ], [ 221122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 151 ], [ 221195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 152 ], [ 221240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 153 ], [ 221276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 154 ], [ 221281, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 155 ], [ 221336, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 156 ], [ 221382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 157 ], [ 221432, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 158 ], [ 221502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 159 ], [ 221547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 160 ], [ 221572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 161 ], [ 221578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 162 ], [ 221614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 163 ], [ 221674, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 164 ], [ 221702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 165 ], [ 221716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 166 ], [ 221733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 167 ], [ 221747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 84 ], [ 221748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 85 ], [ 221752, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 171 ], [ 221765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 172 ], [ 221828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 173 ], [ 221872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 174 ], [ 221888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 175 ], [ 221961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 176 ], [ 222030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 177 ], [ 222099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 178 ], [ 222162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 179 ], [ 222215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 180 ], [ 222290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 181 ], [ 222366, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 182 ], [ 222446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 183 ], [ 222487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 184 ], [ 222492, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 185 ], [ 222565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 186 ], [ 222642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 187 ], [ 222651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 188 ], [ 222652, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 189 ], [ 222666, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 190 ], [ 222706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 191 ], [ 222757, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 192 ], [ 222804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 193 ], [ 222813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 194 ], [ 222814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 195 ], [ 222867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 196 ], [ 222945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 197 ], [ 222972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 198 ], [ 222973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 199 ], [ 222992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 200 ], [ 223052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 201 ], [ 223117, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 202 ], [ 223164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 203 ], [ 223205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 204 ], [ 223272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 205 ], [ 223301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 206 ], [ 223369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 207 ], [ 223434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 208 ], [ 223504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 209 ], [ 223551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 210 ], [ 223581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 211 ], [ 223587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 212 ], [ 223628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 213 ], [ 223697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 214 ], [ 223706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 215 ], [ 223775, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 216 ], [ 223848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 217 ], [ 223893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 218 ], [ 223934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 219 ], [ 224001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 220 ], [ 224030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 221 ], [ 224085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 222 ], [ 224131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 223 ], [ 224181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 224 ], [ 224251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 225 ], [ 224296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 226 ], [ 224326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 227 ], [ 224332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 228 ], [ 224373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 229 ], [ 224442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 230 ], [ 224464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 231 ], [ 224481, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 232 ], [ 224495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 85 ], [ 224496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 86 ], [ 224500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 236 ], [ 224513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 237 ], [ 224560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 238 ], [ 224604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 239 ], [ 224620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 240 ], [ 224669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 241 ], [ 224735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 242 ], [ 224812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 243 ], [ 224890, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 244 ], [ 224929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 245 ], [ 224934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 246 ], [ 225007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 247 ], [ 225046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 248 ], [ 225055, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 249 ], [ 225056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 250 ], [ 225070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 251 ], [ 225105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 252 ], [ 225114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 253 ], [ 225115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 254 ], [ 225168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 255 ], [ 225246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 256 ], [ 225273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 257 ], [ 225274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 258 ], [ 225293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 259 ], [ 225353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 260 ], [ 225418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 261 ], [ 225465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 262 ], [ 225490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 263 ], [ 225560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 264 ], [ 225589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 265 ], [ 225657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 266 ], [ 225722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 267 ], [ 225792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 268 ], [ 225839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 269 ], [ 225864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 270 ], [ 225869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 271 ], [ 225938, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 272 ], [ 226011, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 273 ], [ 226056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 274 ], [ 226081, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 275 ], [ 226151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 276 ], [ 226180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 277 ], [ 226235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 278 ], [ 226281, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 279 ], [ 226331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 280 ], [ 226401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 281 ], [ 226446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 282 ], [ 226471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 283 ], [ 226476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 284 ], [ 226490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 285 ], [ 226507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 286 ], [ 226521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 86 ], [ 226522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 87 ], [ 226526, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 290 ], [ 226539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 291 ], [ 226591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 292 ], [ 226635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 293 ], [ 226651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 294 ], [ 226706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 295 ], [ 226774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 296 ], [ 226845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 297 ], [ 226924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 298 ], [ 226977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 299 ], [ 226982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 300 ], [ 227055, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 301 ], [ 227099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 302 ], [ 227108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 303 ], [ 227109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 304 ], [ 227158, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 305 ], [ 227167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 306 ], [ 227168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 307 ], [ 227221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 308 ], [ 227299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 309 ], [ 227326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 310 ], [ 227327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 311 ], [ 227346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 312 ], [ 227406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 313 ], [ 227471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 314 ], [ 227518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 315 ], [ 227548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 316 ], [ 227553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 317 ], [ 227621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 318 ], [ 227686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 319 ], [ 227756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 320 ], [ 227803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 321 ], [ 227833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 322 ], [ 227838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 323 ], [ 227897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 324 ], [ 227932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 325 ], [ 228001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 326 ], [ 228074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 327 ], [ 228119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 328 ], [ 228149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 329 ], [ 228154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 330 ], [ 228209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 331 ], [ 228255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 332 ], [ 228305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 333 ], [ 228375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 334 ], [ 228420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 335 ], [ 228450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 336 ], [ 228455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 337 ], [ 228514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 338 ], [ 228549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 339 ], [ 228563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 340 ], [ 228580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 341 ], [ 228594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 87 ], [ 228595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 88 ], [ 228599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 345 ], [ 228612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 346 ], [ 228671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 347 ], [ 228730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 348 ], [ 228788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 349 ], [ 228832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 350 ], [ 228848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 351 ], [ 228907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 352 ], [ 228981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 353 ], [ 229023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 354 ], [ 229095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 355 ], [ 229173, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 356 ], [ 229240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 357 ], [ 229315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 358 ], [ 229324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 359 ], [ 229325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 360 ], [ 229377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 361 ], [ 229435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 362 ], [ 229436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 363 ], [ 229489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 364 ], [ 229567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 365 ], [ 229594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 366 ], [ 229595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 367 ], [ 229614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 368 ], [ 229686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 369 ], [ 229739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 370 ], [ 229786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 371 ], [ 229822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 372 ], [ 229892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 373 ], [ 229921, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 374 ], [ 229958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 375 ], [ 230025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 376 ], [ 230054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 377 ], [ 230123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 378 ], [ 230177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 379 ], [ 230224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 380 ], [ 230260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 381 ], [ 230265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 382 ], [ 230302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 383 ], [ 230369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 384 ], [ 230398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 385 ], [ 230435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 386 ], [ 230440, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 387 ], [ 230490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 388 ], [ 230495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 389 ], [ 230549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 390 ], [ 230554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 391 ], [ 230620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 392 ], [ 230680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 393 ], [ 230733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 394 ], [ 230738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 395 ], [ 230807, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 396 ], [ 230880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 397 ], [ 230925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 398 ], [ 230961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 399 ], [ 231031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 400 ], [ 231060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 401 ], [ 231097, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 402 ], [ 231164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 403 ], [ 231193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 404 ], [ 231262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 405 ], [ 231332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 406 ], [ 231377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 407 ], [ 231413, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 408 ], [ 231418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 409 ], [ 231455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 410 ], [ 231522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 411 ], [ 231551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 412 ], [ 231588, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 413 ], [ 231593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 414 ], [ 231643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 415 ], [ 231648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 416 ], [ 231702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 417 ], [ 231707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 418 ], [ 231773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 419 ], [ 231833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 420 ], [ 231886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 421 ], [ 231891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 422 ], [ 231905, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 423 ], [ 231922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 424 ], [ 231936, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 88 ], [ 231937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 89 ], [ 231950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 90 ], [ 231951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap4.xml", 91 ], [ 231962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 40 ], [ 231995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 41 ], [ 231997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 1 ], [ 232079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 2 ], [ 232080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 3 ], [ 232126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 4 ], [ 232130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 48 ], [ 232143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 49 ], [ 232190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 50 ], [ 232240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 51 ], [ 232256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 52 ], [ 232325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 53 ], [ 232405, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 54 ], [ 232414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 55 ], [ 232421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 56 ], [ 232493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 57 ], [ 232551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 58 ], [ 232552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 59 ], [ 232571, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 60 ], [ 232605, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 61 ], [ 232650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 62 ], [ 232672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 63 ], [ 232705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 64 ], [ 232730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 65 ], [ 232735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 66 ], [ 232774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 67 ], [ 232819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 68 ], [ 232841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 69 ], [ 232884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 70 ], [ 232909, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 71 ], [ 232915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 72 ], [ 232963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 73 ], [ 233007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 74 ], [ 233032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 75 ], [ 233051, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 76 ], [ 233068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 77 ], [ 233082, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 4 ], [ 233083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 5 ], [ 233087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1060 ], [ 233100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1061 ], [ 233154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1062 ], [ 233208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1063 ], [ 233258, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1064 ], [ 233274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1065 ], [ 233337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1066 ], [ 233390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1067 ], [ 233399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1068 ], [ 233400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1069 ], [ 233479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1070 ], [ 233555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1071 ], [ 233620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1072 ], [ 233629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1073 ], [ 233636, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1074 ], [ 233708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1075 ], [ 233766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1076 ], [ 233767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1077 ], [ 233790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1078 ], [ 233834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1079 ], [ 233879, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1080 ], [ 233913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1081 ], [ 233919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1082 ], [ 233951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1083 ], [ 233974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1084 ], [ 234018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1085 ], [ 234068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1086 ], [ 234102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1087 ], [ 234107, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1088 ], [ 234131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1089 ], [ 234184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1090 ], [ 234198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1091 ], [ 234215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1092 ], [ 234229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 5 ], [ 234230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 6 ], [ 234234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 276 ], [ 234247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 277 ], [ 234297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 278 ], [ 234347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 279 ], [ 234363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 280 ], [ 234442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 281 ], [ 234514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 282 ], [ 234591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 283 ], [ 234671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 284 ], [ 234748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 285 ], [ 234815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 286 ], [ 234816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 287 ], [ 234862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 288 ], [ 234871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 289 ], [ 234878, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 290 ], [ 234950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 291 ], [ 235008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 292 ], [ 235031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 293 ], [ 235058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 294 ], [ 235100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 295 ], [ 235128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 296 ], [ 235133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 297 ], [ 235160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 298 ], [ 235202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 299 ], [ 235230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 300 ], [ 235236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 301 ], [ 235296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 302 ], [ 235340, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 303 ], [ 235368, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 304 ], [ 235386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 305 ], [ 235403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 306 ], [ 235417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 6 ], [ 235418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 7 ], [ 235422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 310 ], [ 235435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 311 ], [ 235493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 312 ], [ 235543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 313 ], [ 235559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 314 ], [ 235637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 315 ], [ 235686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 316 ], [ 235687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 317 ], [ 235764, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 318 ], [ 235838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 319 ], [ 235918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 320 ], [ 235976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 321 ], [ 236017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 322 ], [ 236018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 323 ], [ 236095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 324 ], [ 236174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 325 ], [ 236203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 326 ], [ 236204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 327 ], [ 236257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 328 ], [ 236266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 329 ], [ 236273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 330 ], [ 236345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 331 ], [ 236403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 332 ], [ 236404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 333 ], [ 236427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 334 ], [ 236454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 335 ], [ 236496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 336 ], [ 236532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 337 ], [ 236537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 338 ], [ 236564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 339 ], [ 236606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 340 ], [ 236634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 341 ], [ 236639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 342 ], [ 236675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 343 ], [ 236681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 344 ], [ 236741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 345 ], [ 236785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 346 ], [ 236821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 347 ], [ 236839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 348 ], [ 236856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 349 ], [ 236870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 7 ], [ 236871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 8 ], [ 236875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 383 ], [ 236888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 384 ], [ 236937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 385 ], [ 236987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 386 ], [ 237003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 387 ], [ 237074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 388 ], [ 237110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 389 ], [ 237111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 390 ], [ 237176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 391 ], [ 237228, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 392 ], [ 237299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 393 ], [ 237300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 394 ], [ 237378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 395 ], [ 237445, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 396 ], [ 237454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 397 ], [ 237461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 398 ], [ 237533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 399 ], [ 237591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 400 ], [ 237592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 401 ], [ 237615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 402 ], [ 237660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 403 ], [ 237705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 404 ], [ 237732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 405 ], [ 237737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 406 ], [ 237771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 407 ], [ 237821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 408 ], [ 237848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 409 ], [ 237854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 410 ], [ 237914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 411 ], [ 237958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 412 ], [ 237985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 413 ], [ 238004, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 414 ], [ 238021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 415 ], [ 238035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 8 ], [ 238036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 9 ], [ 238040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 353 ], [ 238053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 354 ], [ 238114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 355 ], [ 238164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 356 ], [ 238180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 357 ], [ 238250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 358 ], [ 238306, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 359 ], [ 238307, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 360 ], [ 238378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 361 ], [ 238458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 362 ], [ 238533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 363 ], [ 238559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 364 ], [ 238568, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 365 ], [ 238575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 366 ], [ 238647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 367 ], [ 238705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 368 ], [ 238706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 369 ], [ 238729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 370 ], [ 238779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 371 ], [ 238848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 372 ], [ 238887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 373 ], [ 238892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 374 ], [ 238952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 375 ], [ 238996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 376 ], [ 239035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 377 ], [ 239053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 378 ], [ 239070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 379 ], [ 239084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 9 ], [ 239085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 10 ], [ 239089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 719 ], [ 239102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 720 ], [ 239148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 721 ], [ 239193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 722 ], [ 239243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 723 ], [ 239259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 724 ], [ 239327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 725 ], [ 239397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 726 ], [ 239412, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 727 ], [ 239413, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 728 ], [ 239478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 729 ], [ 239487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 730 ], [ 239494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 731 ], [ 239566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 732 ], [ 239624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 733 ], [ 239625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 734 ], [ 239648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 735 ], [ 239677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 736 ], [ 239719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 737 ], [ 239743, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 738 ], [ 239748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 739 ], [ 239771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 740 ], [ 239776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 741 ], [ 239806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 742 ], [ 239850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 743 ], [ 239874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 744 ], [ 239880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 745 ], [ 239903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 746 ], [ 239922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 747 ], [ 239939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 748 ], [ 239953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 10 ], [ 239954, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 11 ], [ 239958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1279 ], [ 239971, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1280 ], [ 240023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1281 ], [ 240073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1282 ], [ 240089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1283 ], [ 240167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1284 ], [ 240212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1285 ], [ 240288, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1286 ], [ 240363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1287 ], [ 240372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1288 ], [ 240379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1289 ], [ 240451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1290 ], [ 240509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1291 ], [ 240510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1292 ], [ 240529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1293 ], [ 240571, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1294 ], [ 240616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1295 ], [ 240646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1296 ], [ 240651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1297 ], [ 240665, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1298 ], [ 240682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1299 ], [ 240696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 11 ], [ 240697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 12 ], [ 240701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 792 ], [ 240714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 793 ], [ 240765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 794 ], [ 240815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 795 ], [ 240831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 796 ], [ 240897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 797 ], [ 240918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 798 ], [ 240919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 799 ], [ 240989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 800 ], [ 241006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 801 ], [ 241015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 802 ], [ 241022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 803 ], [ 241094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 804 ], [ 241152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 805 ], [ 241175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 806 ], [ 241228, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 807 ], [ 241273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 808 ], [ 241304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 809 ], [ 241309, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 810 ], [ 241345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 811 ], [ 241390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 812 ], [ 241421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 813 ], [ 241427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 814 ], [ 241473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 815 ], [ 241518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 816 ], [ 241549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 817 ], [ 241554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 818 ], [ 241568, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 819 ], [ 241585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 820 ], [ 241599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 12 ], [ 241600, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 13 ], [ 241604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 12 ], [ 241617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 13 ], [ 241663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 14 ], [ 241713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 15 ], [ 241729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 16 ], [ 241784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 17 ], [ 241827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 18 ], [ 241828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 19 ], [ 241900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 20 ], [ 241958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 21 ], [ 241959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 22 ], [ 241982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 23 ], [ 242052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 24 ], [ 242097, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 25 ], [ 242121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 26 ], [ 242127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 27 ], [ 242172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 28 ], [ 242217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 29 ], [ 242256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 30 ], [ 242261, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 31 ], [ 242285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 32 ], [ 242291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 33 ], [ 242339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 34 ], [ 242389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 35 ], [ 242428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 36 ], [ 242434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 37 ], [ 242458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 38 ], [ 242463, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 39 ], [ 242497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 40 ], [ 242545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 41 ], [ 242569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 42 ], [ 242587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 43 ], [ 242604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 44 ], [ 242618, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 13 ], [ 242619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 14 ], [ 242623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 986 ], [ 242636, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 987 ], [ 242686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 988 ], [ 242736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 989 ], [ 242752, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 990 ], [ 242818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 991 ], [ 242864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 992 ], [ 242937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 993 ], [ 242946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 994 ], [ 242953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 995 ], [ 243025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 996 ], [ 243083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 997 ], [ 243106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 998 ], [ 243140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 999 ], [ 243185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1000 ], [ 243213, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1001 ], [ 243218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1002 ], [ 243268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1003 ], [ 243313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1004 ], [ 243341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1005 ], [ 243347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1006 ], [ 243361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1007 ], [ 243378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1008 ], [ 243392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 14 ], [ 243393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 15 ], [ 243397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1012 ], [ 243410, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1013 ], [ 243460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1014 ], [ 243510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1015 ], [ 243526, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1016 ], [ 243589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1017 ], [ 243642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1018 ], [ 243643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1019 ], [ 243718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1020 ], [ 243793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1021 ], [ 243867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1022 ], [ 243945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1023 ], [ 244025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1024 ], [ 244101, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1025 ], [ 244110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1026 ], [ 244117, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1027 ], [ 244189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1028 ], [ 244247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1029 ], [ 244270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1030 ], [ 244314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1031 ], [ 244359, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1032 ], [ 244389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1033 ], [ 244394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1034 ], [ 244430, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1035 ], [ 244450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1036 ], [ 244468, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1037 ], [ 244486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1038 ], [ 244505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1039 ], [ 244538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1040 ], [ 244543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1041 ], [ 244575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1042 ], [ 244580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1043 ], [ 244627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1044 ], [ 244672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1045 ], [ 244702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1046 ], [ 244708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1047 ], [ 244744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1048 ], [ 244764, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1049 ], [ 244782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1050 ], [ 244800, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1051 ], [ 244819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1052 ], [ 244852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1053 ], [ 244858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1054 ], [ 244872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1055 ], [ 244889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1056 ], [ 244903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 15 ], [ 244904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 16 ], [ 244908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 419 ], [ 244921, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 420 ], [ 244965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 421 ], [ 245015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 422 ], [ 245031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 423 ], [ 245111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 424 ], [ 245151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 425 ], [ 245152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 426 ], [ 245221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 427 ], [ 245298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 428 ], [ 245377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 429 ], [ 245386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 430 ], [ 245393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 431 ], [ 245465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 432 ], [ 245523, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 433 ], [ 245546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 434 ], [ 245595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 435 ], [ 245640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 436 ], [ 245662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 437 ], [ 245667, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 438 ], [ 245703, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 439 ], [ 245748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 440 ], [ 245770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 441 ], [ 245776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 442 ], [ 245821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 443 ], [ 245864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 444 ], [ 245886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 445 ], [ 245891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 446 ], [ 245924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 447 ], [ 245967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 448 ], [ 245989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 449 ], [ 245995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 450 ], [ 246009, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 451 ], [ 246026, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 452 ], [ 246040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 16 ], [ 246041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 17 ], [ 246045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1096 ], [ 246058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1097 ], [ 246109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1098 ], [ 246159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1099 ], [ 246175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1100 ], [ 246238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1101 ], [ 246288, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1102 ], [ 246289, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1103 ], [ 246356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1104 ], [ 246434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1105 ], [ 246464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1106 ], [ 246465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1107 ], [ 246541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1108 ], [ 246582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1109 ], [ 246657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1110 ], [ 246729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1111 ], [ 246730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1112 ], [ 246788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1113 ], [ 246850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1114 ], [ 246924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1115 ], [ 246933, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1116 ], [ 246940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1117 ], [ 247012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1118 ], [ 247070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1119 ], [ 247079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1120 ], [ 247102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1121 ], [ 247141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1122 ], [ 247186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1123 ], [ 247215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1124 ], [ 247221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1125 ], [ 247265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1126 ], [ 247310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1127 ], [ 247341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1128 ], [ 247346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1129 ], [ 247386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1130 ], [ 247391, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1131 ], [ 247441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1132 ], [ 247491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1133 ], [ 247522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1134 ], [ 247527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1135 ], [ 247541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1136 ], [ 247558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1137 ], [ 247572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 17 ], [ 247573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 18 ], [ 247577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1207 ], [ 247590, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1208 ], [ 247639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1209 ], [ 247690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1210 ], [ 247740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1211 ], [ 247756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1212 ], [ 247835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1213 ], [ 247911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1214 ], [ 247988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1215 ], [ 248065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1216 ], [ 248116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1217 ], [ 248125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1218 ], [ 248132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1219 ], [ 248204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1220 ], [ 248262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1221 ], [ 248263, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1222 ], [ 248282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1223 ], [ 248324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1224 ], [ 248369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1225 ], [ 248396, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1226 ], [ 248401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1227 ], [ 248462, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1228 ], [ 248508, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1229 ], [ 248535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1230 ], [ 248540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1231 ], [ 248586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1232 ], [ 248631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1233 ], [ 248658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1234 ], [ 248664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1235 ], [ 248706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1236 ], [ 248751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1237 ], [ 248780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1238 ], [ 248786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1239 ], [ 248800, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1240 ], [ 248817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1241 ], [ 248831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 18 ], [ 248832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 19 ], [ 248836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1245 ], [ 248849, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1246 ], [ 248902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1247 ], [ 248952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1248 ], [ 248968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1249 ], [ 249047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1250 ], [ 249092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1251 ], [ 249172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1252 ], [ 249219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1253 ], [ 249299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1254 ], [ 249355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1255 ], [ 249364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1256 ], [ 249371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1257 ], [ 249443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1258 ], [ 249501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1259 ], [ 249502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1260 ], [ 249521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1261 ], [ 249563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1262 ], [ 249608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1263 ], [ 249639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1264 ], [ 249644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1265 ], [ 249671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1266 ], [ 249713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1267 ], [ 249744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1268 ], [ 249750, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1269 ], [ 249809, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1270 ], [ 249860, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1271 ], [ 249891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1272 ], [ 249896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1273 ], [ 249910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1274 ], [ 249927, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1275 ], [ 249941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 19 ], [ 249942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 20 ], [ 249946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1141 ], [ 249959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1142 ], [ 250015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1143 ], [ 250071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1144 ], [ 250119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1145 ], [ 250169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1146 ], [ 250185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1147 ], [ 250256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1148 ], [ 250330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1149 ], [ 250407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1150 ], [ 250475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1151 ], [ 250533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1152 ], [ 250542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1153 ], [ 250543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1154 ], [ 250615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1155 ], [ 250687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1156 ], [ 250748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1157 ], [ 250826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1158 ], [ 250901, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1159 ], [ 250981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1160 ], [ 251055, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1161 ], [ 251073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1162 ], [ 251082, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1163 ], [ 251089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1164 ], [ 251161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1165 ], [ 251219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1166 ], [ 251220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1167 ], [ 251243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1168 ], [ 251285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1169 ], [ 251330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1170 ], [ 251364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1171 ], [ 251370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1172 ], [ 251404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1173 ], [ 251409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1174 ], [ 251435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1175 ], [ 251441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1176 ], [ 251482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1177 ], [ 251527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1178 ], [ 251561, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1179 ], [ 251567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1180 ], [ 251601, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1181 ], [ 251606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1182 ], [ 251632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1183 ], [ 251638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1184 ], [ 251690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1185 ], [ 251735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1186 ], [ 251769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1187 ], [ 251774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1188 ], [ 251808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1189 ], [ 251813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1190 ], [ 251839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1191 ], [ 251844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1192 ], [ 251888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1193 ], [ 251938, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1194 ], [ 251989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1195 ], [ 252023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1196 ], [ 252028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1197 ], [ 252062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1198 ], [ 252067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1199 ], [ 252093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1200 ], [ 252098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1201 ], [ 252112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1202 ], [ 252129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 1203 ], [ 252143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 20 ], [ 252144, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 21 ], [ 252157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 22 ], [ 252158, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 23 ], [ 252199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 24 ], [ 252203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 894 ], [ 252216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 895 ], [ 252266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 896 ], [ 252316, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 897 ], [ 252332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 898 ], [ 252407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 899 ], [ 252481, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 900 ], [ 252525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 901 ], [ 252526, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 902 ], [ 252577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 903 ], [ 252613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 904 ], [ 252622, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 905 ], [ 252629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 906 ], [ 252701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 907 ], [ 252759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 908 ], [ 252782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 909 ], [ 252827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 910 ], [ 252832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 911 ], [ 252874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 912 ], [ 252880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 913 ], [ 252894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 914 ], [ 252911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 915 ], [ 252925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 24 ], [ 252926, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 25 ], [ 252930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 919 ], [ 252943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 920 ], [ 252994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 921 ], [ 253044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 922 ], [ 253060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 923 ], [ 253135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 924 ], [ 253209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 925 ], [ 253250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 926 ], [ 253259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 927 ], [ 253260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 928 ], [ 253310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 929 ], [ 253346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 930 ], [ 253355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 931 ], [ 253362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 932 ], [ 253434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 933 ], [ 253492, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 934 ], [ 253515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 935 ], [ 253561, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 936 ], [ 253566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 937 ], [ 253609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 938 ], [ 253615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 939 ], [ 253629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 940 ], [ 253646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 941 ], [ 253660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 25 ], [ 253661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 26 ], [ 253665, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 867 ], [ 253678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 868 ], [ 253726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 869 ], [ 253776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 870 ], [ 253792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 871 ], [ 253867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 872 ], [ 253941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 873 ], [ 254014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 874 ], [ 254087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 875 ], [ 254108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 876 ], [ 254109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 877 ], [ 254159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 878 ], [ 254198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 879 ], [ 254207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 880 ], [ 254214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 881 ], [ 254286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 882 ], [ 254344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 883 ], [ 254367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 884 ], [ 254410, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 885 ], [ 254415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 886 ], [ 254455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 887 ], [ 254461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 888 ], [ 254475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 889 ], [ 254492, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 890 ], [ 254506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 26 ], [ 254507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 27 ], [ 254511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 945 ], [ 254524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 946 ], [ 254580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 947 ], [ 254630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 948 ], [ 254646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 949 ], [ 254722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 950 ], [ 254802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 951 ], [ 254874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 952 ], [ 254950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 953 ], [ 255020, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 954 ], [ 255091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 955 ], [ 255109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 956 ], [ 255110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 957 ], [ 255187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 958 ], [ 255259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 959 ], [ 255337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 960 ], [ 255412, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 961 ], [ 255486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 962 ], [ 255559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 963 ], [ 255639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 964 ], [ 255640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 965 ], [ 255716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 966 ], [ 255746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 967 ], [ 255755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 968 ], [ 255762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 969 ], [ 255834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 970 ], [ 255892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 971 ], [ 255893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 972 ], [ 255916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 973 ], [ 255969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 974 ], [ 256003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 975 ], [ 256009, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 976 ], [ 256074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 977 ], [ 256120, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 978 ], [ 256154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 979 ], [ 256159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 980 ], [ 256173, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 981 ], [ 256190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 982 ], [ 256204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 27 ], [ 256205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 28 ], [ 256218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 29 ], [ 256219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 30 ], [ 256273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 31 ], [ 256277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 81 ], [ 256290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 82 ], [ 256338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 83 ], [ 256388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 84 ], [ 256404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 85 ], [ 256483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 86 ], [ 256560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 87 ], [ 256636, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 88 ], [ 256717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 89 ], [ 256741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 90 ], [ 256742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 91 ], [ 256815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 92 ], [ 256888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 93 ], [ 256948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 94 ], [ 256949, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 95 ], [ 257021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 96 ], [ 257079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 97 ], [ 257080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 98 ], [ 257103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 99 ], [ 257163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 100 ], [ 257180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 101 ], [ 257220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 102 ], [ 257229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 103 ], [ 257258, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 104 ], [ 257305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 105 ], [ 257331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 106 ], [ 257337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 107 ], [ 257375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 108 ], [ 257425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 109 ], [ 257472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 110 ], [ 257498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 111 ], [ 257503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 112 ], [ 257544, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 113 ], [ 257549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 114 ], [ 257597, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 115 ], [ 257641, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 116 ], [ 257667, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 117 ], [ 257673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 118 ], [ 257714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 119 ], [ 257733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 120 ], [ 257750, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 121 ], [ 257764, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 31 ], [ 257765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 32 ], [ 257769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 456 ], [ 257782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 457 ], [ 257828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 458 ], [ 257878, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 459 ], [ 257894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 460 ], [ 257973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 461 ], [ 258045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 462 ], [ 258105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 463 ], [ 258138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 464 ], [ 258139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 465 ], [ 258218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 466 ], [ 258296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 467 ], [ 258330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 468 ], [ 258339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 469 ], [ 258346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 470 ], [ 258418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 471 ], [ 258476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 472 ], [ 258477, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 473 ], [ 258496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 474 ], [ 258538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 475 ], [ 258583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 476 ], [ 258607, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 477 ], [ 258613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 478 ], [ 258640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 479 ], [ 258682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 480 ], [ 258706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 481 ], [ 258711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 482 ], [ 258740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 483 ], [ 258785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 484 ], [ 258809, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 485 ], [ 258814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 486 ], [ 258859, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 487 ], [ 258902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 488 ], [ 258926, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 489 ], [ 258931, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 490 ], [ 258955, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 491 ], [ 258998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 492 ], [ 259022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 493 ], [ 259040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 494 ], [ 259057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 495 ], [ 259071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 32 ], [ 259072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 33 ], [ 259076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 198 ], [ 259089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 199 ], [ 259139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 200 ], [ 259189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 201 ], [ 259205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 202 ], [ 259268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 203 ], [ 259334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 204 ], [ 259408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 205 ], [ 259478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 206 ], [ 259549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 207 ], [ 259550, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 208 ], [ 259621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 209 ], [ 259698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 210 ], [ 259734, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 211 ], [ 259774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 212 ], [ 259830, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 213 ], [ 259839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 214 ], [ 259846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 215 ], [ 259918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 216 ], [ 259976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 217 ], [ 259977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 218 ], [ 260000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 219 ], [ 260036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 220 ], [ 260064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 221 ], [ 260069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 222 ], [ 260113, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 223 ], [ 260141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 224 ], [ 260147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 225 ], [ 260201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 226 ], [ 260229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 227 ], [ 260234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 228 ], [ 260296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 229 ], [ 260324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 230 ], [ 260343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 231 ], [ 260360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 232 ], [ 260374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 33 ], [ 260375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 34 ], [ 260379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 236 ], [ 260392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 237 ], [ 260444, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 238 ], [ 260494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 239 ], [ 260510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 240 ], [ 260589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 241 ], [ 260665, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 242 ], [ 260732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 243 ], [ 260801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 244 ], [ 260869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 245 ], [ 260911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 246 ], [ 260912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 247 ], [ 260974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 248 ], [ 260975, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 249 ], [ 261048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 250 ], [ 261125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 251 ], [ 261200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 252 ], [ 261209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 253 ], [ 261210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 254 ], [ 261257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 255 ], [ 261266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 256 ], [ 261273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 257 ], [ 261345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 258 ], [ 261403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 259 ], [ 261422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 260 ], [ 261481, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 261 ], [ 261487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 262 ], [ 261531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 263 ], [ 261536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 264 ], [ 261596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 265 ], [ 261626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 266 ], [ 261632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 267 ], [ 261692, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 268 ], [ 261736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 269 ], [ 261766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 270 ], [ 261784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 271 ], [ 261801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 272 ], [ 261815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 34 ], [ 261816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 35 ], [ 261820, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 154 ], [ 261833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 155 ], [ 261891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 156 ], [ 261941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 157 ], [ 261957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 158 ], [ 262032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 159 ], [ 262082, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 160 ], [ 262083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 161 ], [ 262164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 162 ], [ 262232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 163 ], [ 262311, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 164 ], [ 262329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 165 ], [ 262330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 166 ], [ 262404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 167 ], [ 262476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 168 ], [ 262553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 169 ], [ 262592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 170 ], [ 262601, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 171 ], [ 262608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 172 ], [ 262680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 173 ], [ 262738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 174 ], [ 262739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 175 ], [ 262762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 176 ], [ 262794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 177 ], [ 262841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 178 ], [ 262877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 179 ], [ 262882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 180 ], [ 262930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 181 ], [ 262985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 182 ], [ 263021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 183 ], [ 263027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 184 ], [ 263077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 185 ], [ 263130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 186 ], [ 263166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 187 ], [ 263171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 188 ], [ 263211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 189 ], [ 263264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 190 ], [ 263300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 191 ], [ 263306, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 192 ], [ 263320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 193 ], [ 263337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 194 ], [ 263351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 35 ], [ 263352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 36 ], [ 263356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 125 ], [ 263369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 126 ], [ 263419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 127 ], [ 263469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 128 ], [ 263485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 129 ], [ 263548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 130 ], [ 263623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 131 ], [ 263668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 132 ], [ 263677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 133 ], [ 263684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 134 ], [ 263756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 135 ], [ 263814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 136 ], [ 263837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 137 ], [ 263891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 138 ], [ 263941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 139 ], [ 263969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 140 ], [ 263975, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 141 ], [ 264027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 142 ], [ 264072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 143 ], [ 264100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 144 ], [ 264105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 145 ], [ 264175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 146 ], [ 264218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 147 ], [ 264246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 148 ], [ 264264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 149 ], [ 264281, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 150 ], [ 264295, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 36 ], [ 264296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 37 ], [ 264300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 568 ], [ 264313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 569 ], [ 264359, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 570 ], [ 264409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 571 ], [ 264425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 572 ], [ 264503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 573 ], [ 264539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 574 ], [ 264540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 575 ], [ 264614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 576 ], [ 264668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 577 ], [ 264724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 578 ], [ 264759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 579 ], [ 264760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 580 ], [ 264803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 581 ], [ 264812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 582 ], [ 264819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 583 ], [ 264891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 584 ], [ 264949, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 585 ], [ 264950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 586 ], [ 264973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 587 ], [ 265003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 588 ], [ 265047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 589 ], [ 265071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 590 ], [ 265077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 591 ], [ 265112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 592 ], [ 265157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 593 ], [ 265181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 594 ], [ 265187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 595 ], [ 265222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 596 ], [ 265267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 597 ], [ 265291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 598 ], [ 265296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 599 ], [ 265350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 600 ], [ 265395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 601 ], [ 265419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 602 ], [ 265424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 603 ], [ 265438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 604 ], [ 265455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 605 ], [ 265469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 37 ], [ 265470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 38 ], [ 265474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 609 ], [ 265487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 610 ], [ 265535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 611 ], [ 265585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 612 ], [ 265635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 613 ], [ 265651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 614 ], [ 265727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 615 ], [ 265786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 616 ], [ 265860, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 617 ], [ 265937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 618 ], [ 265938, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 619 ], [ 266019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 620 ], [ 266097, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 621 ], [ 266151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 622 ], [ 266228, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 623 ], [ 266307, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 624 ], [ 266378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 625 ], [ 266406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 626 ], [ 266407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 627 ], [ 266488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 628 ], [ 266569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 629 ], [ 266620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 630 ], [ 266700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 631 ], [ 266762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 632 ], [ 266812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 633 ], [ 266813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 634 ], [ 266893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 635 ], [ 266942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 636 ], [ 266951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 637 ], [ 266958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 638 ], [ 267030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 639 ], [ 267088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 640 ], [ 267089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 641 ], [ 267112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 642 ], [ 267151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 643 ], [ 267196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 644 ], [ 267222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 645 ], [ 267227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 646 ], [ 267282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 647 ], [ 267287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 648 ], [ 267336, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 649 ], [ 267381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 650 ], [ 267409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 651 ], [ 267415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 652 ], [ 267441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 653 ], [ 267447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 654 ], [ 267475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 655 ], [ 267480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 656 ], [ 267519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 657 ], [ 267564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 658 ], [ 267615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 659 ], [ 267621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 660 ], [ 267675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 661 ], [ 267694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 662 ], [ 267711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 663 ], [ 267725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 38 ], [ 267726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 39 ], [ 267730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 752 ], [ 267743, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 753 ], [ 267792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 754 ], [ 267842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 755 ], [ 267858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 756 ], [ 267932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 757 ], [ 267941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 758 ], [ 267942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 759 ], [ 268019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 760 ], [ 268091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 761 ], [ 268170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 762 ], [ 268249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 763 ], [ 268280, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 764 ], [ 268289, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 765 ], [ 268296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 766 ], [ 268368, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 767 ], [ 268426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 768 ], [ 268427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 769 ], [ 268450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 770 ], [ 268475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 771 ], [ 268515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 772 ], [ 268542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 773 ], [ 268547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 774 ], [ 268577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 775 ], [ 268621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 776 ], [ 268648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 777 ], [ 268654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 778 ], [ 268689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 779 ], [ 268734, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 780 ], [ 268761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 781 ], [ 268767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 782 ], [ 268803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 783 ], [ 268848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 784 ], [ 268875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 785 ], [ 268880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 786 ], [ 268894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 787 ], [ 268911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 788 ], [ 268925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 39 ], [ 268926, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 40 ], [ 268930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 824 ], [ 268943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 825 ], [ 268995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 826 ], [ 269045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 827 ], [ 269061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 828 ], [ 269126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 829 ], [ 269179, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 830 ], [ 269180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 831 ], [ 269251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 832 ], [ 269329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 833 ], [ 269392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 834 ], [ 269461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 835 ], [ 269482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 836 ], [ 269483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 837 ], [ 269554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 838 ], [ 269593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 839 ], [ 269602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 840 ], [ 269609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 841 ], [ 269681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 842 ], [ 269739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 843 ], [ 269740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 844 ], [ 269763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 845 ], [ 269788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 846 ], [ 269828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 847 ], [ 269858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 848 ], [ 269863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 849 ], [ 269894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 850 ], [ 269939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 851 ], [ 269969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 852 ], [ 269974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 853 ], [ 270009, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 854 ], [ 270054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 855 ], [ 270084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 856 ], [ 270090, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 857 ], [ 270126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 858 ], [ 270171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 859 ], [ 270201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 860 ], [ 270206, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 861 ], [ 270220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 862 ], [ 270237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 863 ], [ 270251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 40 ], [ 270252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 41 ], [ 270256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 499 ], [ 270269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 500 ], [ 270315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 501 ], [ 270365, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 502 ], [ 270381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 503 ], [ 270460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 504 ], [ 270532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 505 ], [ 270592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 506 ], [ 270625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 507 ], [ 270626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 508 ], [ 270706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 509 ], [ 270749, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 510 ], [ 270758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 511 ], [ 270765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 512 ], [ 270837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 513 ], [ 270895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 514 ], [ 270896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 515 ], [ 270915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 516 ], [ 270957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 517 ], [ 271002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 518 ], [ 271026, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 519 ], [ 271032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 520 ], [ 271059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 521 ], [ 271101, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 522 ], [ 271125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 523 ], [ 271130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 524 ], [ 271166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 525 ], [ 271211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 526 ], [ 271237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 527 ], [ 271243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 528 ], [ 271267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 529 ], [ 271285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 530 ], [ 271302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 531 ], [ 271316, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 41 ], [ 271317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 42 ], [ 271330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 43 ], [ 271333, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 44 ], [ 271373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 45 ], [ 271377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 12 ], [ 271390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 13 ], [ 271437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 14 ], [ 271487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 15 ], [ 271503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 16 ], [ 271581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 17 ], [ 271661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 18 ], [ 271733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 19 ], [ 271810, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 20 ], [ 271858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 21 ], [ 271867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 22 ], [ 271872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 23 ], [ 271952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 24 ], [ 272031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 25 ], [ 272102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 26 ], [ 272112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 27 ], [ 272113, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 28 ], [ 272162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 29 ], [ 272171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 30 ], [ 272172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 31 ], [ 272225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 32 ], [ 272303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 33 ], [ 272330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 34 ], [ 272331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 35 ], [ 272354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 36 ], [ 272396, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 37 ], [ 272401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 38 ], [ 272443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 39 ], [ 272449, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 40 ], [ 272503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 41 ], [ 272508, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 42 ], [ 272562, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 43 ], [ 272568, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 44 ], [ 272628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 45 ], [ 272633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 46 ], [ 272693, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 47 ], [ 272699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 48 ], [ 272771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 49 ], [ 272776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 50 ], [ 272848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 51 ], [ 272854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 52 ], [ 272868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 53 ], [ 272885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 54 ], [ 272899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 45 ], [ 272900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 46 ], [ 272904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 58 ], [ 272917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 59 ], [ 272969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 60 ], [ 273019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 61 ], [ 273035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 62 ], [ 273111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 63 ], [ 273185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 64 ], [ 273263, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 65 ], [ 273343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 66 ], [ 273419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 67 ], [ 273472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 68 ], [ 273481, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 69 ], [ 273486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 70 ], [ 273553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 71 ], [ 273623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 72 ], [ 273703, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 73 ], [ 273737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 74 ], [ 273738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 75 ], [ 273782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 76 ], [ 273783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 77 ], [ 273836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 78 ], [ 273914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 79 ], [ 273941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 80 ], [ 273942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 81 ], [ 273961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 82 ], [ 274008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 83 ], [ 274014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 84 ], [ 274061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 85 ], [ 274067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 86 ], [ 274126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 87 ], [ 274132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 88 ], [ 274191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 89 ], [ 274197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 90 ], [ 274242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 91 ], [ 274247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 92 ], [ 274312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 93 ], [ 274318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 94 ], [ 274383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 95 ], [ 274389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 96 ], [ 274458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 97 ], [ 274517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 98 ], [ 274523, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 99 ], [ 274592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 100 ], [ 274651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 101 ], [ 274657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 102 ], [ 274720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 103 ], [ 274725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 104 ], [ 274726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 105 ], [ 274740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 106 ], [ 274757, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/plan\ ar.xml", 107 ], [ 274771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 46 ], [ 274772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 47 ], [ 274785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 48 ], [ 274786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 49 ], [ 274850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 50 ], [ 274854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 535 ], [ 274867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 536 ], [ 274912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 537 ], [ 274962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 538 ], [ 274978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 539 ], [ 275045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 540 ], [ 275084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 541 ], [ 275085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 542 ], [ 275157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 543 ], [ 275234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 544 ], [ 275311, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 545 ], [ 275378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 546 ], [ 275387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 547 ], [ 275394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 548 ], [ 275466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 549 ], [ 275524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 550 ], [ 275525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 551 ], [ 275548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 552 ], [ 275578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 553 ], [ 275623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 554 ], [ 275646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 555 ], [ 275651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 556 ], [ 275703, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 557 ], [ 275759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 558 ], [ 275808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 559 ], [ 275847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 560 ], [ 275870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 561 ], [ 275876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 562 ], [ 275890, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 563 ], [ 275907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 564 ], [ 275921, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 50 ], [ 275922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 51 ], [ 275926, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 667 ], [ 275939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 668 ], [ 275987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 669 ], [ 276037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 670 ], [ 276053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 671 ], [ 276117, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 672 ], [ 276183, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 673 ], [ 276248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 674 ], [ 276306, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 675 ], [ 276352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 676 ], [ 276395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 677 ], [ 276404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 678 ], [ 276411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 679 ], [ 276483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 680 ], [ 276541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 681 ], [ 276542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 682 ], [ 276565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 683 ], [ 276608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 684 ], [ 276613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 685 ], [ 276653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 686 ], [ 276659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 687 ], [ 276713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 688 ], [ 276779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 689 ], [ 276793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 690 ], [ 276810, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 691 ], [ 276824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 51 ], [ 276825, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 52 ], [ 276829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 695 ], [ 276842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 696 ], [ 276892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 697 ], [ 276942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 698 ], [ 276958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 699 ], [ 277033, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 700 ], [ 277106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 701 ], [ 277185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 702 ], [ 277224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 703 ], [ 277233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 704 ], [ 277240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 705 ], [ 277312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 706 ], [ 277370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 707 ], [ 277371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 708 ], [ 277394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 709 ], [ 277439, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 710 ], [ 277444, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 711 ], [ 277486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 712 ], [ 277492, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 713 ], [ 277506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 714 ], [ 277523, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/prop\ .xml", 715 ], [ 277537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 52 ], [ 277538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 53 ], [ 277551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 54 ], [ 277552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 55 ], [ 277555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap5.xml", 56 ], [ 277566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 41 ], [ 277587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 42 ], [ 277589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 1 ], [ 277653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 2 ], [ 277738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 3 ], [ 277815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 4 ], [ 277896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 5 ], [ 277969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 6 ], [ 278048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 7 ], [ 278125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 8 ], [ 278199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 9 ], [ 278247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 10 ], [ 278248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 11 ], [ 278297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 12 ], [ 278301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 163 ], [ 278314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 164 ], [ 278360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 165 ], [ 278399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 166 ], [ 278446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 167 ], [ 278495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 168 ], [ 278527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 169 ], [ 278543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 170 ], [ 278620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 171 ], [ 278698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 172 ], [ 278763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 173 ], [ 278839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 174 ], [ 278909, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 175 ], [ 278933, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 176 ], [ 278942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 177 ], [ 278943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 178 ], [ 279017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 179 ], [ 279087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 180 ], [ 279166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 181 ], [ 279236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 182 ], [ 279312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 183 ], [ 279385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 184 ], [ 279464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 185 ], [ 279537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 186 ], [ 279546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 187 ], [ 279547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 188 ], [ 279628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 189 ], [ 279662, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 190 ], [ 279663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 191 ], [ 279733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 192 ], [ 279806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 193 ], [ 279886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 194 ], [ 279959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 195 ], [ 279960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 196 ], [ 279983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 197 ], [ 280047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 198 ], [ 280093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 199 ], [ 280128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 200 ], [ 280174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 201 ], [ 280199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 202 ], [ 280255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 203 ], [ 280290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 204 ], [ 280335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 205 ], [ 280373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 206 ], [ 280403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 207 ], [ 280453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 208 ], [ 280478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 209 ], [ 280503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 210 ], [ 280532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 211 ], [ 280583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 212 ], [ 280588, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 213 ], [ 280602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 214 ], [ 280619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 215 ], [ 280633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 12 ], [ 280634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 13 ], [ 280638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 219 ], [ 280651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 220 ], [ 280704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 221 ], [ 280763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 222 ], [ 280807, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 223 ], [ 280839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 224 ], [ 280855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 225 ], [ 280933, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 226 ], [ 280999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 227 ], [ 281057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 228 ], [ 281129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 229 ], [ 281200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 230 ], [ 281201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 231 ], [ 281280, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 232 ], [ 281356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 233 ], [ 281357, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 234 ], [ 281401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 235 ], [ 281482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 236 ], [ 281562, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 237 ], [ 281640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 238 ], [ 281701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 239 ], [ 281702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 240 ], [ 281772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 241 ], [ 281845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 242 ], [ 281925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 243 ], [ 281998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 244 ], [ 281999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 245 ], [ 282022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 246 ], [ 282043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 247 ], [ 282111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 248 ], [ 282163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 249 ], [ 282202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 250 ], [ 282232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 251 ], [ 282267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 252 ], [ 282319, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 253 ], [ 282343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 254 ], [ 282410, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 255 ], [ 282443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 256 ], [ 282460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/oper\ .xml", 257 ], [ 282474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 13 ], [ 282475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 14 ], [ 282488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 15 ], [ 282489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 16 ], [ 282547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 17 ], [ 282608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 18 ], [ 282686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 19 ], [ 282765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 20 ], [ 282835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 21 ], [ 282898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 22 ], [ 282917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 23 ], [ 282918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 24 ], [ 282922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 12 ], [ 282935, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 13 ], [ 282976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 14 ], [ 283017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 15 ], [ 283047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 16 ], [ 283063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 17 ], [ 283143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 18 ], [ 283222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 19 ], [ 283281, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 20 ], [ 283355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 21 ], [ 283404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 22 ], [ 283413, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 23 ], [ 283414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 24 ], [ 283488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 25 ], [ 283558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 26 ], [ 283637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 27 ], [ 283645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 28 ], [ 283705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 29 ], [ 283741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 30 ], [ 283793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 31 ], [ 283857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 32 ], [ 283893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 33 ], [ 283964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 34 ], [ 283965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 35 ], [ 284045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 36 ], [ 284123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 37 ], [ 284205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 38 ], [ 284222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 39 ], [ 284236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 24 ], [ 284237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 25 ], [ 284241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 117 ], [ 284254, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 118 ], [ 284325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 119 ], [ 284367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 120 ], [ 284383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 121 ], [ 284461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 122 ], [ 284540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 123 ], [ 284602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 124 ], [ 284680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 125 ], [ 284721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 126 ], [ 284722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 127 ], [ 284797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 128 ], [ 284863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 129 ], [ 284888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 130 ], [ 284889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 131 ], [ 284969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 132 ], [ 285048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 133 ], [ 285119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 134 ], [ 285197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 135 ], [ 285271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 136 ], [ 285295, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 137 ], [ 285296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 138 ], [ 285376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 139 ], [ 285455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 140 ], [ 285517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 141 ], [ 285582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 142 ], [ 285656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 143 ], [ 285696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 144 ], [ 285705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 145 ], [ 285706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 146 ], [ 285778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 147 ], [ 285837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 148 ], [ 285838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 149 ], [ 285861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 150 ], [ 285910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 151 ], [ 285956, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 152 ], [ 285994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 153 ], [ 286035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 154 ], [ 286066, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 155 ], [ 286108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 156 ], [ 286144, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 157 ], [ 286175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 158 ], [ 286209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 159 ], [ 286227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 160 ], [ 286246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 161 ], [ 286262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 25 ], [ 286263, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 26 ], [ 286267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 43 ], [ 286280, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 44 ], [ 286356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 45 ], [ 286425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 46 ], [ 286473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 47 ], [ 286556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 48 ], [ 286611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 49 ], [ 286653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 50 ], [ 286669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 51 ], [ 286747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 52 ], [ 286829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 53 ], [ 286857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 54 ], [ 286858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 55 ], [ 286934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 56 ], [ 286979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 57 ], [ 287040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 58 ], [ 287102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 59 ], [ 287180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 60 ], [ 287223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 61 ], [ 287272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 62 ], [ 287351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 63 ], [ 287427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 64 ], [ 287498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 65 ], [ 287571, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 66 ], [ 287630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 67 ], [ 287631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 68 ], [ 287712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 69 ], [ 287721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 70 ], [ 287722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 71 ], [ 287794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 72 ], [ 287853, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 73 ], [ 287854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 74 ], [ 287877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 75 ], [ 287934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 76 ], [ 287960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 77 ], [ 287965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 78 ], [ 287979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 79 ], [ 287996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 80 ], [ 288015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 81 ], [ 288031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 26 ], [ 288032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 27 ], [ 288036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 85 ], [ 288049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 86 ], [ 288119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 87 ], [ 288161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 88 ], [ 288177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 89 ], [ 288255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 90 ], [ 288322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 91 ], [ 288387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 92 ], [ 288388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 93 ], [ 288453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 94 ], [ 288454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 95 ], [ 288530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 96 ], [ 288575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 97 ], [ 288636, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 98 ], [ 288699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 99 ], [ 288760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 100 ], [ 288841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 101 ], [ 288842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 102 ], [ 288923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 103 ], [ 288932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 104 ], [ 288933, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 105 ], [ 289005, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 106 ], [ 289064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 107 ], [ 289065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 108 ], [ 289084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 109 ], [ 289135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 110 ], [ 289195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 111 ], [ 289224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 112 ], [ 289243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 113 ], [ 289259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 27 ], [ 289260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 28 ], [ 289264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 165 ], [ 289277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 166 ], [ 289355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 167 ], [ 289389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 168 ], [ 289431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 169 ], [ 289447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 170 ], [ 289448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 171 ], [ 289529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 172 ], [ 289602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 173 ], [ 289680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 174 ], [ 289760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 175 ], [ 289801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 176 ], [ 289802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 177 ], [ 289813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 178 ], [ 289826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 179 ], [ 289906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 180 ], [ 289984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 181 ], [ 290013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 182 ], [ 290027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 183 ], [ 290040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 184 ], [ 290098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 185 ], [ 290156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 186 ], [ 290234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 187 ], [ 290252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 188 ], [ 290266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 189 ], [ 290278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 190 ], [ 290279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 191 ], [ 290355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 192 ], [ 290438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 193 ], [ 290510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 194 ], [ 290582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 195 ], [ 290659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 196 ], [ 290743, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 197 ], [ 290816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 198 ], [ 290895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 199 ], [ 290966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 200 ], [ 290967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 201 ], [ 291042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 202 ], [ 291108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 203 ], [ 291133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 204 ], [ 291134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 205 ], [ 291214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 206 ], [ 291293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 207 ], [ 291364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 208 ], [ 291442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 209 ], [ 291516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 210 ], [ 291540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 211 ], [ 291541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 212 ], [ 291621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 213 ], [ 291700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 214 ], [ 291762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 215 ], [ 291801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 216 ], [ 291852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 217 ], [ 291926, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 218 ], [ 291966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 219 ], [ 291967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 220 ], [ 291988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 221 ], [ 292019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 222 ], [ 292061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 223 ], [ 292098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 224 ], [ 292132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 225 ], [ 292137, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 226 ], [ 292189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 227 ], [ 292235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 228 ], [ 292249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 229 ], [ 292251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 230 ], [ 292315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 231 ], [ 292320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 232 ], [ 292393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 233 ], [ 292398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 234 ], [ 292469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 235 ], [ 292487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 236 ], [ 292504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 237 ], [ 292518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 28 ], [ 292519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 29 ], [ 292523, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 241 ], [ 292536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 242 ], [ 292569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 243 ], [ 292623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 244 ], [ 292671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 245 ], [ 292713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 246 ], [ 292729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 247 ], [ 292730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 248 ], [ 292801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 249 ], [ 292828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 250 ], [ 292894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 251 ], [ 292970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 252 ], [ 293047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 253 ], [ 293082, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 254 ], [ 293083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 255 ], [ 293094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 256 ], [ 293107, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 257 ], [ 293187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 258 ], [ 293265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 259 ], [ 293334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 260 ], [ 293348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 261 ], [ 293361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 262 ], [ 293440, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 263 ], [ 293515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 264 ], [ 293582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 265 ], [ 293661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 266 ], [ 293696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 267 ], [ 293710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 268 ], [ 293722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 269 ], [ 293723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 270 ], [ 293794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 271 ], [ 293869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 272 ], [ 293870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 273 ], [ 293942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 274 ], [ 294021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 275 ], [ 294094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 276 ], [ 294125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 277 ], [ 294126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 278 ], [ 294194, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 279 ], [ 294268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 280 ], [ 294320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 281 ], [ 294404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 282 ], [ 294476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 283 ], [ 294553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 284 ], [ 294632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 285 ], [ 294705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 286 ], [ 294784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 287 ], [ 294855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 288 ], [ 294856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 289 ], [ 294931, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 290 ], [ 294997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 291 ], [ 295022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 292 ], [ 295023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 293 ], [ 295103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 294 ], [ 295182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 295 ], [ 295253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 296 ], [ 295331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 297 ], [ 295405, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 298 ], [ 295429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 299 ], [ 295430, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 300 ], [ 295510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 301 ], [ 295589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 302 ], [ 295651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 303 ], [ 295691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 304 ], [ 295750, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 305 ], [ 295829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 306 ], [ 295866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 307 ], [ 295867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 308 ], [ 295888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 309 ], [ 295920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 310 ], [ 295963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 311 ], [ 296020, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 312 ], [ 296079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 313 ], [ 296116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 314 ], [ 296119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 315 ], [ 296170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 316 ], [ 296172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 317 ], [ 296229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 318 ], [ 296231, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 319 ], [ 296296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 320 ], [ 296298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 321 ], [ 296338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 322 ], [ 296393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 323 ], [ 296398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 324 ], [ 296412, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 325 ], [ 296429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 326 ], [ 296443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 29 ], [ 296444, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 30 ], [ 296448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 330 ], [ 296461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 331 ], [ 296538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 332 ], [ 296615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 333 ], [ 296682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 334 ], [ 296698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 335 ], [ 296776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 336 ], [ 296850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 337 ], [ 296891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 338 ], [ 296892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 339 ], [ 296903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 340 ], [ 296916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 341 ], [ 296984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 342 ], [ 296998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 343 ], [ 297011, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 344 ], [ 297083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 345 ], [ 297115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 346 ], [ 297129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 347 ], [ 297141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 348 ], [ 297142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 349 ], [ 297223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 350 ], [ 297293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 351 ], [ 297374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 352 ], [ 297436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 353 ], [ 297437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 354 ], [ 297517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 355 ], [ 297593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 356 ], [ 297673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 357 ], [ 297749, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 358 ], [ 297828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 359 ], [ 297891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 360 ], [ 297892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 361 ], [ 297970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 362 ], [ 298033, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 363 ], [ 298034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 364 ], [ 298057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 365 ], [ 298119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 366 ], [ 298165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 367 ], [ 298205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 368 ], [ 298225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 369 ], [ 298266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 370 ], [ 298308, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 371 ], [ 298354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 372 ], [ 298380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 373 ], [ 298386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 374 ], [ 298449, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 375 ], [ 298511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 376 ], [ 298529, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 377 ], [ 298546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 378 ], [ 298560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 30 ], [ 298561, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 31 ], [ 298565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 382 ], [ 298578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 383 ], [ 298650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 384 ], [ 298679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 385 ], [ 298751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 386 ], [ 298780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 387 ], [ 298816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 388 ], [ 298832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 389 ], [ 298913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 390 ], [ 298992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 391 ], [ 299045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 392 ], [ 299046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 393 ], [ 299057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 394 ], [ 299070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 395 ], [ 299147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 396 ], [ 299161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 397 ], [ 299174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 398 ], [ 299246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 399 ], [ 299287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 400 ], [ 299301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 401 ], [ 299313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 402 ], [ 299314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 403 ], [ 299385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 404 ], [ 299454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 405 ], [ 299533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 406 ], [ 299612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 407 ], [ 299656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 408 ], [ 299657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 409 ], [ 299738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 410 ], [ 299819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 411 ], [ 299898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 412 ], [ 299918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 413 ], [ 299919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 414 ], [ 299930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 415 ], [ 299943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 416 ], [ 300018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 417 ], [ 300096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 418 ], [ 300125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 419 ], [ 300139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 420 ], [ 300152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 421 ], [ 300210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 422 ], [ 300268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 423 ], [ 300341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 424 ], [ 300359, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 425 ], [ 300373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 426 ], [ 300385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 427 ], [ 300386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 428 ], [ 300461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 429 ], [ 300541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 430 ], [ 300617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 431 ], [ 300696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 432 ], [ 300775, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 433 ], [ 300848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 434 ], [ 300927, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 435 ], [ 300928, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 436 ], [ 301006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 437 ], [ 301078, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 438 ], [ 301153, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 439 ], [ 301224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 440 ], [ 301293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 441 ], [ 301367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 442 ], [ 301411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 443 ], [ 301412, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 444 ], [ 301476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 445 ], [ 301554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 446 ], [ 301632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 447 ], [ 301704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 448 ], [ 301781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 449 ], [ 301853, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 450 ], [ 301912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 451 ], [ 301913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 452 ], [ 301986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 453 ], [ 301987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 454 ], [ 302064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 455 ], [ 302108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 456 ], [ 302109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 457 ], [ 302155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 458 ], [ 302156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 459 ], [ 302165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 460 ], [ 302166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 461 ], [ 302189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 462 ], [ 302250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 463 ], [ 302296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 464 ], [ 302350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 465 ], [ 302403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 466 ], [ 302425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 467 ], [ 302454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 468 ], [ 302500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 469 ], [ 302531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 470 ], [ 302573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 471 ], [ 302622, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 472 ], [ 302675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 473 ], [ 302697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 474 ], [ 302726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 475 ], [ 302772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 476 ], [ 302830, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 477 ], [ 302876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 478 ], [ 302893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 479 ], [ 302907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 31 ], [ 302908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 32 ], [ 302912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 711 ], [ 302925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 712 ], [ 302978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 713 ], [ 303031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 714 ], [ 303063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 715 ], [ 303079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 716 ], [ 303150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 717 ], [ 303223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 718 ], [ 303301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 719 ], [ 303310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 720 ], [ 303311, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 721 ], [ 303322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 722 ], [ 303335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 723 ], [ 303411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 724 ], [ 303447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 725 ], [ 303461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 726 ], [ 303474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 727 ], [ 303548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 728 ], [ 303627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 729 ], [ 303695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 730 ], [ 303709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 731 ], [ 303721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 732 ], [ 303722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 733 ], [ 303796, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 734 ], [ 303848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 735 ], [ 303910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 736 ], [ 303919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 737 ], [ 303920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 738 ], [ 303992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 739 ], [ 304051, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 740 ], [ 304052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 741 ], [ 304075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 742 ], [ 304131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 743 ], [ 304176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 744 ], [ 304222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 745 ], [ 304267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 746 ], [ 304294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 747 ], [ 304334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 748 ], [ 304348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 749 ], [ 304365, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 750 ], [ 304379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 32 ], [ 304380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 33 ], [ 304384, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 12 ], [ 304397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 13 ], [ 304441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 14 ], [ 304483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 15 ], [ 304499, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 16 ], [ 304572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 17 ], [ 304643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 18 ], [ 304717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 19 ], [ 304792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 20 ], [ 304857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 21 ], [ 304932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 22 ], [ 304983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 23 ], [ 304992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 24 ], [ 304993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 25 ], [ 305058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 26 ], [ 305135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 27 ], [ 305214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 28 ], [ 305291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 29 ], [ 305352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 30 ], [ 305353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 31 ], [ 305376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 32 ], [ 305390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 33 ], [ 305417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 34 ], [ 305483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 35 ], [ 305494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 36 ], [ 305537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 37 ], [ 305558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 38 ], [ 305621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 39 ], [ 305664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 40 ], [ 305689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 41 ], [ 305695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 42 ], [ 305717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 43 ], [ 305746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 44 ], [ 305773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 45 ], [ 305802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 46 ], [ 305847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 47 ], [ 305892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 48 ], [ 305917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 49 ], [ 305922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 50 ], [ 305944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 51 ], [ 305965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 52 ], [ 305993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 53 ], [ 306039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 54 ], [ 306064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 55 ], [ 306069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 56 ], [ 306091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 57 ], [ 306143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 58 ], [ 306171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 59 ], [ 306220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 60 ], [ 306257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 61 ], [ 306262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 62 ], [ 306299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 63 ], [ 306344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 64 ], [ 306369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 65 ], [ 306375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 66 ], [ 306405, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 67 ], [ 306411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 68 ], [ 306433, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 69 ], [ 306450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 70 ], [ 306480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 71 ], [ 306485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 72 ], [ 306517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 73 ], [ 306556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 74 ], [ 306588, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 75 ], [ 306634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 76 ], [ 306659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 77 ], [ 306664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 78 ], [ 306705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 79 ], [ 306785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 80 ], [ 306802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 81 ], [ 306816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 33 ], [ 306817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 34 ], [ 306821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 200 ], [ 306834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 201 ], [ 306879, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 202 ], [ 306891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 203 ], [ 306935, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 204 ], [ 306948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 205 ], [ 306964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 206 ], [ 307029, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 207 ], [ 307102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 208 ], [ 307103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 209 ], [ 307126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 210 ], [ 307189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 211 ], [ 307229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 212 ], [ 307274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 213 ], [ 307297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 214 ], [ 307339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 215 ], [ 307372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 216 ], [ 307415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 217 ], [ 307438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 218 ], [ 307476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 219 ], [ 307490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 220 ], [ 307507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 221 ], [ 307521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 34 ], [ 307522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 35 ], [ 307526, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 140 ], [ 307539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 141 ], [ 307587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 142 ], [ 307599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 143 ], [ 307634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 144 ], [ 307647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 145 ], [ 307663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 146 ], [ 307731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 147 ], [ 307809, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 148 ], [ 307829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 149 ], [ 307830, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 150 ], [ 307853, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 151 ], [ 307899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 152 ], [ 307946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 153 ], [ 307972, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 154 ], [ 307978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 155 ], [ 308011, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 156 ], [ 308056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 157 ], [ 308082, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 158 ], [ 308088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 159 ], [ 308148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 160 ], [ 308195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 161 ], [ 308221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 162 ], [ 308255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 163 ], [ 308301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 164 ], [ 308335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 165 ], [ 308349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 166 ], [ 308366, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 167 ], [ 308380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 35 ], [ 308381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 36 ], [ 308385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 85 ], [ 308398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 86 ], [ 308451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 87 ], [ 308463, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 88 ], [ 308498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 89 ], [ 308511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 90 ], [ 308527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 91 ], [ 308605, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 92 ], [ 308683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 93 ], [ 308761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 94 ], [ 308820, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 95 ], [ 308831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 96 ], [ 308872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 97 ], [ 308885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 98 ], [ 308946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 99 ], [ 309008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 100 ], [ 309022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 101 ], [ 309023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 102 ], [ 309064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 103 ], [ 309077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 104 ], [ 309122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 105 ], [ 309200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 106 ], [ 309278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 107 ], [ 309292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 108 ], [ 309304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 109 ], [ 309305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 110 ], [ 309328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 111 ], [ 309342, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 112 ], [ 309369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 113 ], [ 309435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 114 ], [ 309446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 115 ], [ 309489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 116 ], [ 309510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 117 ], [ 309573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 118 ], [ 309616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 119 ], [ 309654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 120 ], [ 309670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 121 ], [ 309716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 122 ], [ 309763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 123 ], [ 309801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 124 ], [ 309841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 125 ], [ 309867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 126 ], [ 309873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 127 ], [ 309922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 128 ], [ 309991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 129 ], [ 310016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 130 ], [ 310018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 131 ], [ 310041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 132 ], [ 310043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 133 ], [ 310066, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 134 ], [ 310081, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 135 ], [ 310098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 136 ], [ 310112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 36 ], [ 310113, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 37 ], [ 310117, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 171 ], [ 310130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 172 ], [ 310182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 173 ], [ 310194, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 174 ], [ 310219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 175 ], [ 310232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 176 ], [ 310248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 177 ], [ 310323, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 178 ], [ 310395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 179 ], [ 310427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 180 ], [ 310428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 181 ], [ 310451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 182 ], [ 310505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 183 ], [ 310551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 184 ], [ 310581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 185 ], [ 310591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 186 ], [ 310621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 187 ], [ 310631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 188 ], [ 310664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 189 ], [ 310708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 190 ], [ 310738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 191 ], [ 310748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 192 ], [ 310778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 193 ], [ 310788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 194 ], [ 310802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 195 ], [ 310819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 196 ], [ 310833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 37 ], [ 310834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 38 ], [ 310838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 483 ], [ 310851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 484 ], [ 310934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 485 ], [ 310984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 486 ], [ 311000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 487 ], [ 311079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 488 ], [ 311149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 489 ], [ 311227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 490 ], [ 311268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 491 ], [ 311269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 492 ], [ 311347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 493 ], [ 311400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 494 ], [ 311479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 495 ], [ 311541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 496 ], [ 311613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 497 ], [ 311614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 498 ], [ 311637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 499 ], [ 311671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 500 ], [ 311713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 501 ], [ 311747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 502 ], [ 311789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 503 ], [ 311835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 504 ], [ 311841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 505 ], [ 311884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 506 ], [ 311929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 507 ], [ 311975, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 508 ], [ 311980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 509 ], [ 312021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 510 ], [ 312065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 511 ], [ 312106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 512 ], [ 312150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 513 ], [ 312196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 514 ], [ 312214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 515 ], [ 312231, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 516 ], [ 312245, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 38 ], [ 312246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 39 ], [ 312250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 520 ], [ 312263, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 521 ], [ 312341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 522 ], [ 312392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 523 ], [ 312442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 524 ], [ 312458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 525 ], [ 312533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 526 ], [ 312612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 527 ], [ 312686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 528 ], [ 312767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 529 ], [ 312782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 530 ], [ 312783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 531 ], [ 312794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 532 ], [ 312807, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 533 ], [ 312882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 534 ], [ 312960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 535 ], [ 312989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 536 ], [ 313003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 537 ], [ 313016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 538 ], [ 313074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 539 ], [ 313132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 540 ], [ 313205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 541 ], [ 313223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 542 ], [ 313237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 543 ], [ 313249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 544 ], [ 313250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 545 ], [ 313330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 546 ], [ 313408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 547 ], [ 313487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 548 ], [ 313564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 549 ], [ 313643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 550 ], [ 313719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 551 ], [ 313720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 552 ], [ 313798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 553 ], [ 313851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 554 ], [ 313930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 555 ], [ 313992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 556 ], [ 314064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 557 ], [ 314065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 558 ], [ 314088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 559 ], [ 314122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 560 ], [ 314164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 561 ], [ 314198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 562 ], [ 314240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 563 ], [ 314285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 564 ], [ 314322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 565 ], [ 314328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 566 ], [ 314371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 567 ], [ 314416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 568 ], [ 314461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 569 ], [ 314493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 570 ], [ 314498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 571 ], [ 314543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 572 ], [ 314575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 573 ], [ 314580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 574 ], [ 314625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 575 ], [ 314657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 576 ], [ 314676, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 577 ], [ 314693, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 578 ], [ 314707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 39 ], [ 314708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 40 ], [ 314712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 582 ], [ 314725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 583 ], [ 314808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 584 ], [ 314888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 585 ], [ 314904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 586 ], [ 314983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 587 ], [ 315063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 588 ], [ 315072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 589 ], [ 315073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 590 ], [ 315143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 591 ], [ 315208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 592 ], [ 315282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 593 ], [ 315355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 594 ], [ 315431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 595 ], [ 315482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 596 ], [ 315483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 597 ], [ 315557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 598 ], [ 315635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 599 ], [ 315670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 600 ], [ 315671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 601 ], [ 315725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 602 ], [ 315726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 603 ], [ 315804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 604 ], [ 315857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 605 ], [ 315936, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 606 ], [ 315998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 607 ], [ 316070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 608 ], [ 316071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 609 ], [ 316094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 610 ], [ 316128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 611 ], [ 316170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 612 ], [ 316204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 613 ], [ 316246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 614 ], [ 316292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 615 ], [ 316297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 616 ], [ 316347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 617 ], [ 316418, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 618 ], [ 316468, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 619 ], [ 316539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 620 ], [ 316590, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 621 ], [ 316632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 622 ], [ 316673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 623 ], [ 316678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 624 ], [ 316692, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 625 ], [ 316709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 626 ], [ 316723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 40 ], [ 316724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 41 ], [ 316728, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 630 ], [ 316741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 631 ], [ 316819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 632 ], [ 316870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 633 ], [ 316923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 634 ], [ 316939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 635 ], [ 317016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 636 ], [ 317096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 637 ], [ 317175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 638 ], [ 317249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 639 ], [ 317274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 640 ], [ 317275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 641 ], [ 317286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 642 ], [ 317299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 643 ], [ 317374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 644 ], [ 317452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 645 ], [ 317481, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 646 ], [ 317495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 647 ], [ 317508, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 648 ], [ 317566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 649 ], [ 317624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 650 ], [ 317697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 651 ], [ 317715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 652 ], [ 317729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 653 ], [ 317741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 654 ], [ 317742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 655 ], [ 317820, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 656 ], [ 317889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 657 ], [ 317966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 658 ], [ 318037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 659 ], [ 318114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 660 ], [ 318182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 661 ], [ 318259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 662 ], [ 318338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 663 ], [ 318412, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 664 ], [ 318480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 665 ], [ 318559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 666 ], [ 318568, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 667 ], [ 318569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 668 ], [ 318647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 669 ], [ 318669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 670 ], [ 318670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 671 ], [ 318748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 672 ], [ 318801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 673 ], [ 318880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 674 ], [ 318942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 675 ], [ 319014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 676 ], [ 319015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 677 ], [ 319038, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 678 ], [ 319072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 679 ], [ 319114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 680 ], [ 319148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 681 ], [ 319190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 682 ], [ 319235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 683 ], [ 319272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 684 ], [ 319277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 685 ], [ 319320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 686 ], [ 319365, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 687 ], [ 319397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 688 ], [ 319429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 689 ], [ 319500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 690 ], [ 319511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 691 ], [ 319552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 692 ], [ 319557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 693 ], [ 319628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 694 ], [ 319633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 695 ], [ 319665, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 696 ], [ 319697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 697 ], [ 319768, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 698 ], [ 319779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 699 ], [ 319820, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 700 ], [ 319825, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 701 ], [ 319896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 702 ], [ 319901, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 703 ], [ 319946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 704 ], [ 319978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 705 ], [ 319996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 706 ], [ 320013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 707 ], [ 320027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 41 ], [ 320028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 42 ], [ 320032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 225 ], [ 320045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 226 ], [ 320104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 227 ], [ 320153, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 228 ], [ 320169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 229 ], [ 320248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 230 ], [ 320328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 231 ], [ 320383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 232 ], [ 320384, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 233 ], [ 320460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 234 ], [ 320522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 235 ], [ 320596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 236 ], [ 320616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 237 ], [ 320625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 238 ], [ 320626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 239 ], [ 320705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 240 ], [ 320722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 241 ], [ 320723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 242 ], [ 320746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 243 ], [ 320766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 244 ], [ 320829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 245 ], [ 320875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 246 ], [ 320897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 247 ], [ 320907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 248 ], [ 320944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 249 ], [ 321015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 250 ], [ 321053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 251 ], [ 321116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 252 ], [ 321160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 253 ], [ 321182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 254 ], [ 321192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 255 ], [ 321229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 256 ], [ 321300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 257 ], [ 321354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 258 ], [ 321400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 259 ], [ 321428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 260 ], [ 321455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 261 ], [ 321522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 262 ], [ 321569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 263 ], [ 321598, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 264 ], [ 321615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/orbi\ ts.xml", 265 ], [ 321629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 42 ], [ 321630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 43 ], [ 321634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 754 ], [ 321647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 755 ], [ 321702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 756 ], [ 321767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 757 ], [ 321835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 758 ], [ 321890, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 759 ], [ 321958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 760 ], [ 322019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 761 ], [ 322069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 762 ], [ 322085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 763 ], [ 322159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 764 ], [ 322236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 765 ], [ 322264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 766 ], [ 322273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 767 ], [ 322274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 768 ], [ 322349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 769 ], [ 322427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 770 ], [ 322436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 771 ], [ 322437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 772 ], [ 322514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 773 ], [ 322584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 774 ], [ 322595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 775 ], [ 322608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 776 ], [ 322684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 777 ], [ 322704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 778 ], [ 322718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 779 ], [ 322731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 780 ], [ 322789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 781 ], [ 322843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 782 ], [ 322875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 783 ], [ 322889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 784 ], [ 322902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 785 ], [ 322977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 786 ], [ 322991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 787 ], [ 323003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 788 ], [ 323068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 789 ], [ 323082, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 790 ], [ 323087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 791 ], [ 323164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 792 ], [ 323202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 793 ], [ 323284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 794 ], [ 323330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 795 ], [ 323402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 796 ], [ 323405, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 797 ], [ 323416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 798 ], [ 323429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 799 ], [ 323507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 800 ], [ 323556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 801 ], [ 323569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 802 ], [ 323649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 803 ], [ 323699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 804 ], [ 323711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 805 ], [ 323712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 806 ], [ 323788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 807 ], [ 323861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 808 ], [ 323862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 809 ], [ 323885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 810 ], [ 323929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 811 ], [ 323974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 812 ], [ 324018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 813 ], [ 324024, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 814 ], [ 324065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 815 ], [ 324070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 816 ], [ 324122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 817 ], [ 324127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 818 ], [ 324179, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 819 ], [ 324185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 820 ], [ 324232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 821 ], [ 324238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 822 ], [ 324279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 823 ], [ 324285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 824 ], [ 324322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 825 ], [ 324327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 826 ], [ 324371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 827 ], [ 324416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 828 ], [ 324461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 829 ], [ 324466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 830 ], [ 324511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 831 ], [ 324516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 832 ], [ 324561, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 833 ], [ 324566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 834 ], [ 324638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 835 ], [ 324644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 836 ], [ 324711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 837 ], [ 324716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 838 ], [ 324783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 839 ], [ 324789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 840 ], [ 324803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 841 ], [ 324820, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/isom\ orph.xml", 842 ], [ 324834, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 43 ], [ 324835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 44 ], [ 324839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 733 ], [ 324854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 734 ], [ 324912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 735 ], [ 324966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 736 ], [ 325003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 737 ], [ 325057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 738 ], [ 325075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 739 ], [ 325146, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 740 ], [ 325218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 741 ], [ 325241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 742 ], [ 325252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 743 ], [ 325253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 744 ], [ 325327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 745 ], [ 325408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 746 ], [ 325487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 747 ], [ 325571, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 748 ], [ 325629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 749 ], [ 325640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 750 ], [ 325641, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 751 ], [ 325715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 752 ], [ 325779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 753 ], [ 325850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 754 ], [ 325877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 755 ], [ 325878, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 756 ], [ 325930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 757 ], [ 325937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 758 ], [ 325962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 759 ], [ 325994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 760 ], [ 326051, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 761 ], [ 326111, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 762 ], [ 326116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 763 ], [ 326176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 764 ], [ 326182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 765 ], [ 326243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 766 ], [ 326249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 767 ], [ 326288, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 768 ], [ 326294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 769 ], [ 326346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 770 ], [ 326351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 771 ], [ 326365, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 772 ], [ 326384, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 773 ], [ 326400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 44 ], [ 326401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 45 ], [ 326414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 46 ], [ 326415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 47 ], [ 326471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 48 ], [ 326472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 49 ], [ 326544, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 50 ], [ 326621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 51 ], [ 326696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 52 ], [ 326773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 53 ], [ 326774, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 54 ], [ 326778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 12 ], [ 326791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 13 ], [ 326952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 14 ], [ 327005, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 15 ], [ 327021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 16 ], [ 327101, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 17 ], [ 327175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 18 ], [ 327200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 19 ], [ 327201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 20 ], [ 327257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 21 ], [ 327334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 22 ], [ 327403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 23 ], [ 327423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 24 ], [ 327424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 25 ], [ 327435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 26 ], [ 327466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 27 ], [ 327479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 28 ], [ 327542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 29 ], [ 327543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 30 ], [ 327613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 31 ], [ 327686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 32 ], [ 327765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 33 ], [ 327813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 34 ], [ 327893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 35 ], [ 327968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 36 ], [ 328039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 37 ], [ 328115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 38 ], [ 328165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 39 ], [ 328208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 40 ], [ 328221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 41 ], [ 328222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 42 ], [ 328299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 43 ], [ 328351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 44 ], [ 328431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 45 ], [ 328466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 46 ], [ 328480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 47 ], [ 328481, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 48 ], [ 328518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 49 ], [ 328531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 50 ], [ 328609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 51 ], [ 328687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 52 ], [ 328763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 53 ], [ 328842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 54 ], [ 328921, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 55 ], [ 328944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 56 ], [ 328945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 57 ], [ 329015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 58 ], [ 329065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 59 ], [ 329079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 60 ], [ 329080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 61 ], [ 329118, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 62 ], [ 329131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 63 ], [ 329202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 64 ], [ 329275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 65 ], [ 329353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 66 ], [ 329376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 67 ], [ 329390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 68 ], [ 329391, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 69 ], [ 329422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 70 ], [ 329435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 71 ], [ 329507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 72 ], [ 329508, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 73 ], [ 329584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 74 ], [ 329619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 75 ], [ 329620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 76 ], [ 329698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 77 ], [ 329730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 78 ], [ 329744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 79 ], [ 329745, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 80 ], [ 329781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 81 ], [ 329794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 82 ], [ 329869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 83 ], [ 329948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 84 ], [ 330026, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 85 ], [ 330073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 86 ], [ 330086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 87 ], [ 330087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 88 ], [ 330166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 89 ], [ 330242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 90 ], [ 330302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 91 ], [ 330316, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 92 ], [ 330317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 93 ], [ 330349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 94 ], [ 330362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 95 ], [ 330443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 96 ], [ 330515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 97 ], [ 330586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 98 ], [ 330608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 99 ], [ 330622, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 100 ], [ 330623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 101 ], [ 330661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 102 ], [ 330674, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 103 ], [ 330749, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 104 ], [ 330824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 105 ], [ 330903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 106 ], [ 330981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 107 ], [ 331028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 108 ], [ 331042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 109 ], [ 331049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 110 ], [ 331083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 111 ], [ 331096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 112 ], [ 331175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 113 ], [ 331207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 114 ], [ 331246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 115 ], [ 331304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 116 ], [ 331369, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 117 ], [ 331383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 118 ], [ 331390, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 119 ], [ 331424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 120 ], [ 331437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 121 ], [ 331516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 122 ], [ 331548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 123 ], [ 331587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 124 ], [ 331645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 125 ], [ 331710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 126 ], [ 331724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 127 ], [ 331756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 128 ], [ 331769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 129 ], [ 331836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 130 ], [ 331907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 131 ], [ 331967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 132 ], [ 332043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 133 ], [ 332119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 134 ], [ 332175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 135 ], [ 332189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 136 ], [ 332202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 137 ], [ 332275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 138 ], [ 332345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 139 ], [ 332423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 140 ], [ 332503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 141 ], [ 332583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 142 ], [ 332597, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 143 ], [ 332609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 144 ], [ 332610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 145 ], [ 332633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 146 ], [ 332661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 147 ], [ 332704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 148 ], [ 332742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 149 ], [ 332799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 150 ], [ 332863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 151 ], [ 332890, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 152 ], [ 332945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 153 ], [ 333000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 154 ], [ 333032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 155 ], [ 333093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 156 ], [ 333129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 157 ], [ 333184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 158 ], [ 333221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 159 ], [ 333259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 160 ], [ 333267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 161 ], [ 333338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 162 ], [ 333386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 163 ], [ 333417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 164 ], [ 333472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 165 ], [ 333527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 166 ], [ 333582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 167 ], [ 333652, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 168 ], [ 333712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 169 ], [ 333726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 170 ], [ 333784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 171 ], [ 333846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 172 ], [ 333911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 173 ], [ 333981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 174 ], [ 334041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 175 ], [ 334059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 176 ], [ 334117, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 177 ], [ 334164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 178 ], [ 334181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 179 ], [ 334195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 54 ], [ 334196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 55 ], [ 334200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 183 ], [ 334213, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 184 ], [ 334275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 185 ], [ 334331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 186 ], [ 334347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 187 ], [ 334424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 188 ], [ 334493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 189 ], [ 334570, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 190 ], [ 334645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 191 ], [ 334720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 192 ], [ 334758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 193 ], [ 334759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 194 ], [ 334828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 195 ], [ 334903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 196 ], [ 334920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 197 ], [ 334939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 198 ], [ 334969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 199 ], [ 335022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 200 ], [ 335067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 201 ], [ 335103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 202 ], [ 335126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 203 ], [ 335169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 204 ], [ 335205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 205 ], [ 335248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 206 ], [ 335253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 207 ], [ 335267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 208 ], [ 335284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 209 ], [ 335298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 55 ], [ 335299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 56 ], [ 335303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 213 ], [ 335316, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 214 ], [ 335380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 215 ], [ 335459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 216 ], [ 335508, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 217 ], [ 335524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 218 ], [ 335584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 219 ], [ 335650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 220 ], [ 335719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 221 ], [ 335797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 222 ], [ 335873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 223 ], [ 335945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 224 ], [ 336022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 225 ], [ 336078, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 226 ], [ 336087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 227 ], [ 336088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 228 ], [ 336155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 229 ], [ 336196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 230 ], [ 336219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 231 ], [ 336249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 232 ], [ 336302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 233 ], [ 336347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 234 ], [ 336385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 235 ], [ 336450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 236 ], [ 336521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 237 ], [ 336592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 238 ], [ 336657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 239 ], [ 336725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 240 ], [ 336787, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 241 ], [ 336801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 242 ], [ 336818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 243 ], [ 336832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 56 ], [ 336833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 57 ], [ 336837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 247 ], [ 336850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 248 ], [ 336912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 249 ], [ 336967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 250 ], [ 336983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 251 ], [ 337053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 252 ], [ 337132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 253 ], [ 337185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 254 ], [ 337208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 255 ], [ 337238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 256 ], [ 337291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 257 ], [ 337336, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 258 ], [ 337372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 259 ], [ 337395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 260 ], [ 337431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 261 ], [ 337467, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 262 ], [ 337481, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 263 ], [ 337498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 264 ], [ 337512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 57 ], [ 337513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 58 ], [ 337517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 268 ], [ 337530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 269 ], [ 337594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 270 ], [ 337673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 271 ], [ 337721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 272 ], [ 337737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 273 ], [ 337817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 274 ], [ 337897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 275 ], [ 337933, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 276 ], [ 337956, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 277 ], [ 337986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 278 ], [ 338039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 279 ], [ 338084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 280 ], [ 338122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 281 ], [ 338162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 282 ], [ 338202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 283 ], [ 338270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 284 ], [ 338301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 285 ], [ 338315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 286 ], [ 338332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 287 ], [ 338346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 58 ], [ 338347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 59 ], [ 338351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 291 ], [ 338364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 292 ], [ 338425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 293 ], [ 338480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 294 ], [ 338496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 295 ], [ 338566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 296 ], [ 338645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 297 ], [ 338698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 298 ], [ 338721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 299 ], [ 338766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 300 ], [ 338811, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 301 ], [ 338870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 302 ], [ 338915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 303 ], [ 338950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 304 ], [ 338955, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 305 ], [ 338990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 306 ], [ 339023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 307 ], [ 339037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 308 ], [ 339054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 309 ], [ 339068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 59 ], [ 339069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 60 ], [ 339073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 313 ], [ 339086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 314 ], [ 339149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 315 ], [ 339227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 316 ], [ 339275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 317 ], [ 339291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 318 ], [ 339371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 319 ], [ 339451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 320 ], [ 339488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 321 ], [ 339511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 322 ], [ 339556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 323 ], [ 339601, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 324 ], [ 339655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 325 ], [ 339710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 326 ], [ 339762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 327 ], [ 339833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 328 ], [ 339870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 329 ], [ 339907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 330 ], [ 339978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 331 ], [ 340049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 332 ], [ 340120, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 333 ], [ 340191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 334 ], [ 340262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 335 ], [ 340333, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 336 ], [ 340404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 337 ], [ 340475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 338 ], [ 340546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 339 ], [ 340560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 340 ], [ 340577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 341 ], [ 340591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 60 ], [ 340592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 61 ], [ 340596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 521 ], [ 340609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 522 ], [ 340668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 523 ], [ 340724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 524 ], [ 340740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 525 ], [ 340807, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 526 ], [ 340887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 527 ], [ 340959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 528 ], [ 341042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 529 ], [ 341043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 530 ], [ 341124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 531 ], [ 341149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 532 ], [ 341150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 533 ], [ 341215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 534 ], [ 341293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 535 ], [ 341328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 536 ], [ 341329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 537 ], [ 341409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 538 ], [ 341437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 539 ], [ 341460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 540 ], [ 341488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 541 ], [ 341530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 542 ], [ 341577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 543 ], [ 341582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 544 ], [ 341643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 545 ], [ 341676, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 546 ], [ 341690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 547 ], [ 341707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 548 ], [ 341721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 61 ], [ 341722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 62 ], [ 341726, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 552 ], [ 341739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 553 ], [ 341788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 554 ], [ 341852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 555 ], [ 341900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 556 ], [ 341916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 557 ], [ 341996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 558 ], [ 342076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 559 ], [ 342124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 560 ], [ 342125, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 561 ], [ 342172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 562 ], [ 342195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 563 ], [ 342222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 564 ], [ 342264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 565 ], [ 342292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 566 ], [ 342334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 567 ], [ 342382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 568 ], [ 342450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 569 ], [ 342483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 570 ], [ 342551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 571 ], [ 342591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 572 ], [ 342631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 573 ], [ 342671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 574 ], [ 342711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 575 ], [ 342751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 576 ], [ 342791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 577 ], [ 342831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 578 ], [ 342871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 579 ], [ 342885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 580 ], [ 342902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 581 ], [ 342916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 62 ], [ 342917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 63 ], [ 342921, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 585 ], [ 342934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 586 ], [ 342990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 587 ], [ 343057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 588 ], [ 343126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 589 ], [ 343180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 590 ], [ 343247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 591 ], [ 343315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 592 ], [ 343370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 593 ], [ 343437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 594 ], [ 343506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 595 ], [ 343560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 596 ], [ 343627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 597 ], [ 343688, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 598 ], [ 343738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 599 ], [ 343754, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 600 ], [ 343826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 601 ], [ 343892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 602 ], [ 343934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 603 ], [ 343943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 604 ], [ 343944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 605 ], [ 344015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 606 ], [ 344092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 607 ], [ 344134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 608 ], [ 344143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 609 ], [ 344144, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 610 ], [ 344216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 611 ], [ 344293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 612 ], [ 344335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 613 ], [ 344344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 614 ], [ 344345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 615 ], [ 344417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 616 ], [ 344482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 617 ], [ 344502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 618 ], [ 344511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 619 ], [ 344512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 620 ], [ 344589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 621 ], [ 344659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 622 ], [ 344670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 623 ], [ 344683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 624 ], [ 344741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 625 ], [ 344789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 626 ], [ 344829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 627 ], [ 344842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 628 ], [ 344917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 629 ], [ 344931, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 630 ], [ 344943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 631 ], [ 345006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 632 ], [ 345007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 633 ], [ 345008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 634 ], [ 345085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 635 ], [ 345123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 636 ], [ 345205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 637 ], [ 345271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 638 ], [ 345322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 639 ], [ 345325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 640 ], [ 345336, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 641 ], [ 345349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 642 ], [ 345429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 643 ], [ 345489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 644 ], [ 345502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 645 ], [ 345580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 646 ], [ 345633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 647 ], [ 345645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 648 ], [ 345646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 649 ], [ 345700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 650 ], [ 345705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 651 ], [ 345728, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 652 ], [ 345772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 653 ], [ 345817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 654 ], [ 345853, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 655 ], [ 345898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 656 ], [ 345963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 657 ], [ 345968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 658 ], [ 346033, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 659 ], [ 346039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 660 ], [ 346104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 661 ], [ 346110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 662 ], [ 346175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 663 ], [ 346180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 664 ], [ 346244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 665 ], [ 346291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 666 ], [ 346296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 667 ], [ 346360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 668 ], [ 346407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 669 ], [ 346413, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 670 ], [ 346473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 671 ], [ 346478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 672 ], [ 346549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 673 ], [ 346554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 674 ], [ 346625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 675 ], [ 346631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 676 ], [ 346695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 677 ], [ 346701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 678 ], [ 346766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 679 ], [ 346772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 680 ], [ 346836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 681 ], [ 346841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 682 ], [ 346883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 683 ], [ 346901, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 684 ], [ 346918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 685 ], [ 346932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 63 ], [ 346933, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 64 ], [ 346937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 689 ], [ 346950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 690 ], [ 347002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 691 ], [ 347069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 692 ], [ 347135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 693 ], [ 347185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 694 ], [ 347201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 695 ], [ 347270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 696 ], [ 347331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 697 ], [ 347407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 698 ], [ 347449, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 699 ], [ 347458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 700 ], [ 347459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 701 ], [ 347539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 702 ], [ 347615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 703 ], [ 347695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 704 ], [ 347764, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 705 ], [ 347780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 706 ], [ 347781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 707 ], [ 347835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 708 ], [ 347836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 709 ], [ 347859, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 710 ], [ 347895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 711 ], [ 347940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 712 ], [ 347984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 713 ], [ 348029, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 714 ], [ 348071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 715 ], [ 348076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 716 ], [ 348115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 717 ], [ 348120, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 718 ], [ 348178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 719 ], [ 348183, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 720 ], [ 348241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 721 ], [ 348247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 722 ], [ 348294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 723 ], [ 348339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 724 ], [ 348401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 725 ], [ 348406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 726 ], [ 348465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 727 ], [ 348484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 728 ], [ 348501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 729 ], [ 348515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 64 ], [ 348516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 65 ], [ 348520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 777 ], [ 348535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 778 ], [ 348610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 779 ], [ 348664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 780 ], [ 348682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 781 ], [ 348760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 782 ], [ 348840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 783 ], [ 348919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 784 ], [ 349006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 785 ], [ 349079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 786 ], [ 349090, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 787 ], [ 349091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 788 ], [ 349116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 789 ], [ 349152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 790 ], [ 349197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 791 ], [ 349241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 792 ], [ 349286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 793 ], [ 349355, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 794 ], [ 349360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 795 ], [ 349429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 796 ], [ 349435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 797 ], [ 349449, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 798 ], [ 349468, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 799 ], [ 349484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 65 ], [ 349485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 66 ], [ 349489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 345 ], [ 349502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 346 ], [ 349583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 347 ], [ 349649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 348 ], [ 349698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 349 ], [ 349714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 350 ], [ 349770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 351 ], [ 349844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 352 ], [ 349845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 353 ], [ 349919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 354 ], [ 349987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 355 ], [ 350042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 356 ], [ 350095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 357 ], [ 350170, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 358 ], [ 350185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 359 ], [ 350186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 360 ], [ 350239, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 361 ], [ 350306, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 362 ], [ 350381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 363 ], [ 350446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 364 ], [ 350447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 365 ], [ 350458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 366 ], [ 350471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 367 ], [ 350541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 368 ], [ 350619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 369 ], [ 350637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 370 ], [ 350651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 371 ], [ 350664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 372 ], [ 350740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 373 ], [ 350779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 374 ], [ 350793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 375 ], [ 350805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 376 ], [ 350806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 377 ], [ 350882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 378 ], [ 350958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 379 ], [ 350995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 380 ], [ 350996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 381 ], [ 351019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 382 ], [ 351071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 383 ], [ 351112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 384 ], [ 351174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 385 ], [ 351232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 386 ], [ 351297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 387 ], [ 351331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 388 ], [ 351375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 389 ], [ 351437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 390 ], [ 351464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 391 ], [ 351496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 392 ], [ 351537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 393 ], [ 351599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 394 ], [ 351626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 395 ], [ 351678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 396 ], [ 351736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 397 ], [ 351792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 398 ], [ 351850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 399 ], [ 351864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 400 ], [ 351881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 401 ], [ 351895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 66 ], [ 351896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 67 ], [ 351900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 405 ], [ 351913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 406 ], [ 351962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 407 ], [ 352014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 408 ], [ 352070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 409 ], [ 352086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 410 ], [ 352163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 411 ], [ 352236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 412 ], [ 352314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 413 ], [ 352392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 414 ], [ 352469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 415 ], [ 352525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 416 ], [ 352595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 417 ], [ 352673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 418 ], [ 352697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 419 ], [ 352706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 420 ], [ 352707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 421 ], [ 352787, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 422 ], [ 352864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 423 ], [ 352944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 424 ], [ 352990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 425 ], [ 352991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 426 ], [ 353068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 427 ], [ 353077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 428 ], [ 353078, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 429 ], [ 353159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 430 ], [ 353221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 431 ], [ 353222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 432 ], [ 353245, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 433 ], [ 353291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 434 ], [ 353296, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 435 ], [ 353340, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 436 ], [ 353345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 437 ], [ 353374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 438 ], [ 353408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 439 ], [ 353459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 440 ], [ 353491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 441 ], [ 353496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 442 ], [ 353528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 443 ], [ 353579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 444 ], [ 353593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 445 ], [ 353610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 446 ], [ 353624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 67 ], [ 353625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 68 ], [ 353629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 450 ], [ 353642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 451 ], [ 353681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 452 ], [ 353711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 453 ], [ 353760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 454 ], [ 353799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 455 ], [ 353828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 456 ], [ 353886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 457 ], [ 353925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 458 ], [ 353948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 459 ], [ 353980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 460 ], [ 354036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 461 ], [ 354052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 462 ], [ 354129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 463 ], [ 354211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 464 ], [ 354284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 465 ], [ 354299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 466 ], [ 354308, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 467 ], [ 354313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 468 ], [ 354393, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 469 ], [ 354461, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 470 ], [ 354495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 471 ], [ 354570, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 472 ], [ 354643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 473 ], [ 354661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 474 ], [ 354666, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 475 ], [ 354747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 476 ], [ 354815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 477 ], [ 354886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 478 ], [ 354966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 479 ], [ 354975, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 480 ], [ 354976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 481 ], [ 355051, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 482 ], [ 355130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 483 ], [ 355139, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 484 ], [ 355144, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 485 ], [ 355157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 486 ], [ 355191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 487 ], [ 355249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 488 ], [ 355258, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 489 ], [ 355259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 490 ], [ 355282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 491 ], [ 355329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 492 ], [ 355380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 493 ], [ 355438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 494 ], [ 355489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 495 ], [ 355503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 496 ], [ 355520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 497 ], [ 355534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 68 ], [ 355535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 69 ], [ 355539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 501 ], [ 355552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 502 ], [ 355607, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 503 ], [ 355653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 504 ], [ 355669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 505 ], [ 355746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 506 ], [ 355824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 507 ], [ 355877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 508 ], [ 355886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 509 ], [ 355887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 510 ], [ 355910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 511 ], [ 355968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 512 ], [ 356031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 513 ], [ 356088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 514 ], [ 356122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 515 ], [ 356136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 516 ], [ 356153, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/grah\ om.xml", 517 ], [ 356167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 69 ], [ 356168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 70 ], [ 356172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1276 ], [ 356185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1277 ], [ 356232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1278 ], [ 356278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1279 ], [ 356294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1280 ], [ 356359, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1281 ], [ 356432, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1282 ], [ 356505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1283 ], [ 356584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1284 ], [ 356585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1285 ], [ 356644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1286 ], [ 356722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1287 ], [ 356797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1288 ], [ 356878, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1289 ], [ 356957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1290 ], [ 357030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1291 ], [ 357080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1292 ], [ 357135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1293 ], [ 357136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1294 ], [ 357159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1295 ], [ 357198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1296 ], [ 357200, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1297 ], [ 357243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1298 ], [ 357246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1299 ], [ 357300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1300 ], [ 357302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1301 ], [ 357362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1302 ], [ 357364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1303 ], [ 357402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1304 ], [ 357404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1305 ], [ 357447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1306 ], [ 357492, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1307 ], [ 357517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1308 ], [ 357519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1309 ], [ 357533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1310 ], [ 357550, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1311 ], [ 357564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 70 ], [ 357565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 71 ], [ 357569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1356 ], [ 357584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1357 ], [ 357627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1358 ], [ 357679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1359 ], [ 357697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1360 ], [ 357780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1361 ], [ 357862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1362 ], [ 357944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1363 ], [ 357945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1364 ], [ 358025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1365 ], [ 358103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1366 ], [ 358136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1367 ], [ 358161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1368 ], [ 358213, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1369 ], [ 358269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1370 ], [ 358290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1371 ], [ 358299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1372 ], [ 358326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1373 ], [ 358373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1374 ], [ 358394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1375 ], [ 358406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1376 ], [ 358470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1377 ], [ 358513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1378 ], [ 358534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1379 ], [ 358549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1380 ], [ 358563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1381 ], [ 358582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/attr\ .xml", 1382 ], [ 358598, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 71 ], [ 358599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 72 ], [ 358612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 73 ], [ 358613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap6.xml", 74 ], [ 358624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 42 ], [ 358648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 43 ], [ 358650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 1 ], [ 358705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 2 ], [ 358763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 3 ], [ 358764, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 4 ], [ 358842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 5 ], [ 358922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 6 ], [ 359000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 7 ], [ 359072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 8 ], [ 359152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 9 ], [ 359230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 10 ], [ 359313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 11 ], [ 359387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 12 ], [ 359407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 13 ], [ 359416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 14 ], [ 359417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 15 ], [ 359491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 16 ], [ 359567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 17 ], [ 359644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 18 ], [ 359714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 19 ], [ 359792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 20 ], [ 359865, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 21 ], [ 359940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 22 ], [ 360018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 23 ], [ 360045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 24 ], [ 360054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 25 ], [ 360055, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 26 ], [ 360132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 27 ], [ 360207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 28 ], [ 360279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 29 ], [ 360352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 30 ], [ 360419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 31 ], [ 360494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 32 ], [ 360556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 33 ], [ 360557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 34 ], [ 360568, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 35 ], [ 360581, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 36 ], [ 360670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 37 ], [ 360684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 38 ], [ 360696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 39 ], [ 360697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 40 ], [ 360747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 41 ], [ 360825, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 42 ], [ 360900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 43 ], [ 360978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 44 ], [ 361054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 45 ], [ 361129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 46 ], [ 361152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 47 ], [ 361153, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 48 ], [ 361164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 49 ], [ 361177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 50 ], [ 361255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 51 ], [ 361269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 52 ], [ 361281, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 53 ], [ 361282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 54 ], [ 361352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 55 ], [ 361414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 56 ], [ 361484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 57 ], [ 361559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 58 ], [ 361638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 59 ], [ 361712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 60 ], [ 361784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 61 ], [ 361858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 62 ], [ 361934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 63 ], [ 361983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 64 ], [ 361984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 65 ], [ 362063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 66 ], [ 362143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 67 ], [ 362221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 68 ], [ 362234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 69 ], [ 362235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 70 ], [ 362246, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 71 ], [ 362259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 72 ], [ 362344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 73 ], [ 362382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 74 ], [ 362396, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 75 ], [ 362408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 76 ], [ 362409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 77 ], [ 362482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 78 ], [ 362560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 79 ], [ 362635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 80 ], [ 362714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 81 ], [ 362784, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 82 ], [ 362851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 83 ], [ 362930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 84 ], [ 363010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 85 ], [ 363071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 86 ], [ 363072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 87 ], [ 363145, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 88 ], [ 363214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 89 ], [ 363292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 90 ], [ 363370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 91 ], [ 363399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 92 ], [ 363408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 93 ], [ 363409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 94 ], [ 363455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 95 ], [ 363459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 40 ], [ 363472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 41 ], [ 363513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 42 ], [ 363561, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 43 ], [ 363609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 44 ], [ 363623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 45 ], [ 363697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 46 ], [ 363732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 47 ], [ 363809, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 48 ], [ 363888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 49 ], [ 363909, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 50 ], [ 363983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 51 ], [ 364060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 52 ], [ 364097, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 53 ], [ 364098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 54 ], [ 364177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 55 ], [ 364247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 56 ], [ 364324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 57 ], [ 364371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 58 ], [ 364394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 59 ], [ 364425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 60 ], [ 364454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 61 ], [ 364459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 62 ], [ 364495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 63 ], [ 364501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 64 ], [ 364546, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 65 ], [ 364551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 66 ], [ 364613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 67 ], [ 364664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 68 ], [ 364693, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 69 ], [ 364699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 70 ], [ 364735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 71 ], [ 364740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 72 ], [ 364789, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 73 ], [ 364818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 74 ], [ 364836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 75 ], [ 364853, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 76 ], [ 364867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 95 ], [ 364868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 96 ], [ 364872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 531 ], [ 364885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 532 ], [ 364962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 533 ], [ 364994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 534 ], [ 365047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 535 ], [ 365063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 536 ], [ 365140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 537 ], [ 365211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 538 ], [ 365287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 539 ], [ 365304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 540 ], [ 365313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 541 ], [ 365314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 542 ], [ 365386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 543 ], [ 365443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 544 ], [ 365507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 545 ], [ 365563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 546 ], [ 365564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 547 ], [ 365575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 548 ], [ 365606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 549 ], [ 365619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 550 ], [ 365682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 551 ], [ 365683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 552 ], [ 365755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 553 ], [ 365829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 554 ], [ 365905, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 555 ], [ 365967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 556 ], [ 365968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 557 ], [ 366044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 558 ], [ 366114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 559 ], [ 366176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 560 ], [ 366190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 561 ], [ 366191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 562 ], [ 366228, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 563 ], [ 366241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 564 ], [ 366319, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 565 ], [ 366398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 566 ], [ 366474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 567 ], [ 366552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 568 ], [ 366619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 569 ], [ 366620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 570 ], [ 366690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 571 ], [ 366732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 572 ], [ 366746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 573 ], [ 366747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 574 ], [ 366779, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 575 ], [ 366792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 576 ], [ 366863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 577 ], [ 366923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 578 ], [ 366979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 579 ], [ 366993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 580 ], [ 366994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 581 ], [ 367047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 582 ], [ 367060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 583 ], [ 367138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 584 ], [ 367214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 585 ], [ 367266, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 586 ], [ 367267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 587 ], [ 367345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 588 ], [ 367419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 589 ], [ 367448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 590 ], [ 367449, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 591 ], [ 367528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 592 ], [ 367599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 593 ], [ 367613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 594 ], [ 367614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 595 ], [ 367644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 596 ], [ 367657, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 597 ], [ 367736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 598 ], [ 367811, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 599 ], [ 367890, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 600 ], [ 367905, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 601 ], [ 367919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 602 ], [ 367920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 603 ], [ 367951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 604 ], [ 367964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 605 ], [ 368031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 606 ], [ 368107, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 607 ], [ 368184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 608 ], [ 368261, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 609 ], [ 368275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 610 ], [ 368276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 611 ], [ 368307, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 612 ], [ 368320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 613 ], [ 368385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 614 ], [ 368386, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 615 ], [ 368462, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 616 ], [ 368539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 617 ], [ 368618, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 618 ], [ 368694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 619 ], [ 368771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 620 ], [ 368808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 621 ], [ 368890, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 622 ], [ 368917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 623 ], [ 368918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 624 ], [ 368990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 625 ], [ 369068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 626 ], [ 369089, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 627 ], [ 369103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 628 ], [ 369115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 629 ], [ 369116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 630 ], [ 369181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 631 ], [ 369204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 632 ], [ 369234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 633 ], [ 369279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 634 ], [ 369303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 635 ], [ 369356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 636 ], [ 369389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 637 ], [ 369397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 638 ], [ 369465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 639 ], [ 369491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 640 ], [ 369509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 641 ], [ 369578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 642 ], [ 369633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 643 ], [ 369702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 644 ], [ 369728, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 645 ], [ 369795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 646 ], [ 369817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 647 ], [ 369889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 648 ], [ 369931, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 649 ], [ 370002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 650 ], [ 370007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 651 ], [ 370055, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 652 ], [ 370099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 653 ], [ 370123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 654 ], [ 370176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 655 ], [ 370209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 656 ], [ 370217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 657 ], [ 370285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 658 ], [ 370311, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 659 ], [ 370329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 660 ], [ 370398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 661 ], [ 370453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 662 ], [ 370522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 663 ], [ 370548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 664 ], [ 370615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 665 ], [ 370637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 666 ], [ 370709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 667 ], [ 370751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 668 ], [ 370822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 669 ], [ 370840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 670 ], [ 370857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 671 ], [ 370871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 96 ], [ 370872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 97 ], [ 370876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 119 ], [ 370889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 120 ], [ 370964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 121 ], [ 371035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 122 ], [ 371050, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 123 ], [ 371127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 124 ], [ 371143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 125 ], [ 371217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 126 ], [ 371291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 127 ], [ 371368, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 128 ], [ 371448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 129 ], [ 371449, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 130 ], [ 371525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 131 ], [ 371601, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 132 ], [ 371680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 133 ], [ 371761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 134 ], [ 371837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 135 ], [ 371910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 136 ], [ 371988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 137 ], [ 372036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 138 ], [ 372037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 139 ], [ 372117, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 140 ], [ 372192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 141 ], [ 372217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 142 ], [ 372218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 143 ], [ 372229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 144 ], [ 372269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 145 ], [ 372282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 146 ], [ 372358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 147 ], [ 372437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 148 ], [ 372514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 149 ], [ 372591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 150 ], [ 372656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 151 ], [ 372670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 152 ], [ 372705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 153 ], [ 372718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 154 ], [ 372794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 155 ], [ 372873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 156 ], [ 372917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 157 ], [ 372918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 158 ], [ 372997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 159 ], [ 373072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 160 ], [ 373148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 161 ], [ 373174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 162 ], [ 373188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 163 ], [ 373222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 164 ], [ 373235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 165 ], [ 373313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 166 ], [ 373381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 167 ], [ 373440, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 168 ], [ 373521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 169 ], [ 373599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 170 ], [ 373646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 171 ], [ 373725, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 172 ], [ 373803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 173 ], [ 373824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 174 ], [ 373838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 175 ], [ 373850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 176 ], [ 373851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 177 ], [ 373874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 178 ], [ 373934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 179 ], [ 373979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 180 ], [ 374007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 181 ], [ 374013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 182 ], [ 374036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 183 ], [ 374042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 184 ], [ 374072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 185 ], [ 374078, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 186 ], [ 374109, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 187 ], [ 374121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 188 ], [ 374159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 189 ], [ 374171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 190 ], [ 374204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 191 ], [ 374213, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 192 ], [ 374256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 193 ], [ 374261, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 194 ], [ 374292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 195 ], [ 374297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 196 ], [ 374331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 197 ], [ 374340, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 198 ], [ 374376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 199 ], [ 374436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 200 ], [ 374479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 201 ], [ 374507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 202 ], [ 374513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 203 ], [ 374536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 204 ], [ 374555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 205 ], [ 374572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 206 ], [ 374586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 97 ], [ 374587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 98 ], [ 374591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 212 ], [ 374604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 213 ], [ 374696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 214 ], [ 374772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 215 ], [ 374796, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 216 ], [ 374861, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 217 ], [ 374885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 218 ], [ 374944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 219 ], [ 374978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 220 ], [ 375035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 221 ], [ 375096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 222 ], [ 375166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 223 ], [ 375182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 224 ], [ 375261, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 225 ], [ 375329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 226 ], [ 375401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 227 ], [ 375464, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 228 ], [ 375465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 229 ], [ 375541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 230 ], [ 375620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 231 ], [ 375699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 232 ], [ 375769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 233 ], [ 375846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 234 ], [ 375906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 235 ], [ 375907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 236 ], [ 375985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 237 ], [ 376062, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 238 ], [ 376130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 239 ], [ 376209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 240 ], [ 376275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 241 ], [ 376350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 242 ], [ 376425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 243 ], [ 376444, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 244 ], [ 376445, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 245 ], [ 376524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 246 ], [ 376595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 247 ], [ 376634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 248 ], [ 376690, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 249 ], [ 376691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 250 ], [ 376702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 251 ], [ 376738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 252 ], [ 376751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 253 ], [ 376828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 254 ], [ 376906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 255 ], [ 376946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 256 ], [ 376947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 257 ], [ 377021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 258 ], [ 377087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 259 ], [ 377116, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 260 ], [ 377130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 261 ], [ 377131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 262 ], [ 377183, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 263 ], [ 377196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 264 ], [ 377274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 265 ], [ 377353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 266 ], [ 377415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 267 ], [ 377416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 268 ], [ 377487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 269 ], [ 377566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 270 ], [ 377643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 271 ], [ 377712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 272 ], [ 377735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 273 ], [ 377736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 274 ], [ 377809, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 275 ], [ 377884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 276 ], [ 377964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 277 ], [ 377978, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 278 ], [ 377990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 279 ], [ 377991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 280 ], [ 378014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 281 ], [ 378034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 282 ], [ 378092, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 283 ], [ 378138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 284 ], [ 378166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 285 ], [ 378171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 286 ], [ 378203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 287 ], [ 378244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 288 ], [ 378275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 289 ], [ 378314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 290 ], [ 378349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 291 ], [ 378375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 292 ], [ 378409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 293 ], [ 378438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 294 ], [ 378469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 295 ], [ 378482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 296 ], [ 378532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 297 ], [ 378545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 298 ], [ 378598, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 299 ], [ 378603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 300 ], [ 378653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 301 ], [ 378676, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 302 ], [ 378714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 303 ], [ 378772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 304 ], [ 378816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 305 ], [ 378844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 306 ], [ 378849, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 307 ], [ 378881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 308 ], [ 378922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 309 ], [ 378953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 310 ], [ 379005, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 311 ], [ 379022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 312 ], [ 379036, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 98 ], [ 379037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 99 ], [ 379041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 12 ], [ 379054, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 13 ], [ 379098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 14 ], [ 379143, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 15 ], [ 379159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 16 ], [ 379236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 17 ], [ 379313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 18 ], [ 379373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 19 ], [ 379382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 20 ], [ 379383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 21 ], [ 379462, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 22 ], [ 379531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 23 ], [ 379580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 24 ], [ 379603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 25 ], [ 379634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 26 ], [ 379656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 27 ], [ 379658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 28 ], [ 379720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 29 ], [ 379771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 30 ], [ 379793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 31 ], [ 379795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 32 ], [ 379844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 33 ], [ 379866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 34 ], [ 379881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 35 ], [ 379896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 36 ], [ 379910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 99 ], [ 379911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 100 ], [ 379924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 101 ], [ 379925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 102 ], [ 379980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 103 ], [ 379984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 80 ], [ 379997, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 81 ], [ 380048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 82 ], [ 380106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 83 ], [ 380156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 84 ], [ 380172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 85 ], [ 380248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 86 ], [ 380285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 87 ], [ 380360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 88 ], [ 380439, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 89 ], [ 380482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 90 ], [ 380556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 91 ], [ 380631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 92 ], [ 380687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 93 ], [ 380688, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 94 ], [ 380765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 95 ], [ 380845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 96 ], [ 380915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 97 ], [ 380990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 98 ], [ 381017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 99 ], [ 381040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 100 ], [ 381068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 101 ], [ 381099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 102 ], [ 381104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 103 ], [ 381142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 104 ], [ 381148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 105 ], [ 381185, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 106 ], [ 381191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 107 ], [ 381225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 108 ], [ 381230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 109 ], [ 381271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 110 ], [ 381276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 111 ], [ 381322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 112 ], [ 381353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 113 ], [ 381371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 114 ], [ 381388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 115 ], [ 381402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 103 ], [ 381403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 104 ], [ 381407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 316 ], [ 381420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 317 ], [ 381457, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 318 ], [ 381507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 319 ], [ 381551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 320 ], [ 381590, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 321 ], [ 381605, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 322 ], [ 381682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 323 ], [ 381698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 324 ], [ 381778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 325 ], [ 381856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 326 ], [ 381935, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 327 ], [ 382001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 328 ], [ 382045, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 329 ], [ 382046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 330 ], [ 382122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 331 ], [ 382202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 332 ], [ 382277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 333 ], [ 382354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 334 ], [ 382429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 335 ], [ 382501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 336 ], [ 382580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 337 ], [ 382652, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 338 ], [ 382653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 339 ], [ 382730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 340 ], [ 382802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 341 ], [ 382844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 342 ], [ 382845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 343 ], [ 382856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 344 ], [ 382896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 345 ], [ 382909, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 346 ], [ 382989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 347 ], [ 383058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 348 ], [ 383136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 349 ], [ 383211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 350 ], [ 383265, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 351 ], [ 383335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 352 ], [ 383349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 353 ], [ 383384, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 354 ], [ 383397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 355 ], [ 383472, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 356 ], [ 383550, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 357 ], [ 383622, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 358 ], [ 383623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 359 ], [ 383702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 360 ], [ 383746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 361 ], [ 383810, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 362 ], [ 383886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 363 ], [ 383912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 364 ], [ 383926, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 365 ], [ 383960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 366 ], [ 383973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 367 ], [ 384047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 368 ], [ 384095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 369 ], [ 384175, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 370 ], [ 384253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 371 ], [ 384330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 372 ], [ 384405, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 373 ], [ 384441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 374 ], [ 384505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 375 ], [ 384564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 376 ], [ 384629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 377 ], [ 384643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 378 ], [ 384655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 379 ], [ 384678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 380 ], [ 384705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 381 ], [ 384747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 382 ], [ 384778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 383 ], [ 384790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 384 ], [ 384828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 385 ], [ 384840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 386 ], [ 384879, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 387 ], [ 384891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 388 ], [ 384937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 389 ], [ 384949, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 390 ], [ 384993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 391 ], [ 385002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 392 ], [ 385053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 393 ], [ 385058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 394 ], [ 385101, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 395 ], [ 385110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 396 ], [ 385160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 397 ], [ 385165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 398 ], [ 385215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 399 ], [ 385227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 400 ], [ 385272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 401 ], [ 385315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 402 ], [ 385346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 403 ], [ 385358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 404 ], [ 385396, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 405 ], [ 385408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 406 ], [ 385447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 407 ], [ 385459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 408 ], [ 385505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 409 ], [ 385517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 410 ], [ 385561, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 411 ], [ 385570, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 412 ], [ 385621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 413 ], [ 385626, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 414 ], [ 385669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 415 ], [ 385678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 416 ], [ 385728, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 417 ], [ 385733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 418 ], [ 385783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 419 ], [ 385808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 420 ], [ 385825, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 421 ], [ 385839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 104 ], [ 385840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 105 ], [ 385844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 425 ], [ 385857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 426 ], [ 385937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 427 ], [ 385961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 428 ], [ 386035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 429 ], [ 386069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 430 ], [ 386132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 431 ], [ 386166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 432 ], [ 386233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 433 ], [ 386267, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 434 ], [ 386332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 435 ], [ 386401, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 436 ], [ 386471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 437 ], [ 386487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 438 ], [ 386566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 439 ], [ 386644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 440 ], [ 386720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 441 ], [ 386771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 442 ], [ 386808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 443 ], [ 386809, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 444 ], [ 386885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 445 ], [ 386964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 446 ], [ 387043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 447 ], [ 387113, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 448 ], [ 387190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 449 ], [ 387250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 450 ], [ 387251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 451 ], [ 387331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 452 ], [ 387407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 453 ], [ 387473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 454 ], [ 387548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 455 ], [ 387625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 456 ], [ 387701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 457 ], [ 387780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 458 ], [ 387818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 459 ], [ 387827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 460 ], [ 387828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 461 ], [ 387910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 462 ], [ 387986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 463 ], [ 388063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 464 ], [ 388064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 465 ], [ 388075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 466 ], [ 388120, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 467 ], [ 388133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 468 ], [ 388212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 469 ], [ 388290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 470 ], [ 388353, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 471 ], [ 388354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 472 ], [ 388428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 473 ], [ 388505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 474 ], [ 388523, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 475 ], [ 388537, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 476 ], [ 388538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 477 ], [ 388612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 478 ], [ 388625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 479 ], [ 388684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 480 ], [ 388760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 481 ], [ 388838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 482 ], [ 388868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 483 ], [ 388869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 484 ], [ 388948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 485 ], [ 389012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 486 ], [ 389085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 487 ], [ 389161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 488 ], [ 389202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 489 ], [ 389203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 490 ], [ 389276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 491 ], [ 389350, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 492 ], [ 389427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 493 ], [ 389480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 494 ], [ 389494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 495 ], [ 389506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 496 ], [ 389507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 497 ], [ 389530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 498 ], [ 389557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 499 ], [ 389599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 500 ], [ 389642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 501 ], [ 389655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 502 ], [ 389691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 503 ], [ 389711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 504 ], [ 389755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 505 ], [ 389808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 506 ], [ 389852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 507 ], [ 389875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 508 ], [ 389919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 509 ], [ 389953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 510 ], [ 390003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 511 ], [ 390016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 512 ], [ 390061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 513 ], [ 390104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 514 ], [ 390147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 515 ], [ 390160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 516 ], [ 390196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 517 ], [ 390216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 518 ], [ 390260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 519 ], [ 390313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 520 ], [ 390357, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 521 ], [ 390380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 522 ], [ 390424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 523 ], [ 390458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 524 ], [ 390508, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 525 ], [ 390534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 526 ], [ 390551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/cliq\ ues.xml", 527 ], [ 390565, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 105 ], [ 390566, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 106 ], [ 390579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap8.xml", 107 ], [ 390590, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 43 ], [ 390608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 44 ], [ 390610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 1 ], [ 390684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 2 ], [ 390685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 3 ], [ 390737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 4 ], [ 390741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 12 ], [ 390756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 13 ], [ 390800, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 14 ], [ 390832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 15 ], [ 390850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 16 ], [ 390923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 17 ], [ 391007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 18 ], [ 391008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 19 ], [ 391077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 20 ], [ 391149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 21 ], [ 391229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 22 ], [ 391292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 23 ], [ 391338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 24 ], [ 391339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 25 ], [ 391417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 26 ], [ 391487, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 27 ], [ 391488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 28 ], [ 391559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 29 ], [ 391623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 30 ], [ 391624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 31 ], [ 391637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 32 ], [ 391663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 33 ], [ 391678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 34 ], [ 391757, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 35 ], [ 391832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 36 ], [ 391865, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 37 ], [ 391881, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 38 ], [ 391882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 39 ], [ 391913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 40 ], [ 391928, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 41 ], [ 392004, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 42 ], [ 392085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 43 ], [ 392154, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 44 ], [ 392155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 45 ], [ 392232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 46 ], [ 392284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 47 ], [ 392361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 48 ], [ 392377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 49 ], [ 392378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 50 ], [ 392408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 51 ], [ 392423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 52 ], [ 392497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 53 ], [ 392572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 54 ], [ 392603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 55 ], [ 392619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 56 ], [ 392620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 57 ], [ 392648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 58 ], [ 392663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 59 ], [ 392740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 60 ], [ 392820, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 61 ], [ 392836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 62 ], [ 392837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 63 ], [ 392863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 64 ], [ 392878, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 65 ], [ 392959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 66 ], [ 393034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 67 ], [ 393108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 68 ], [ 393183, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 69 ], [ 393255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 70 ], [ 393271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 71 ], [ 393272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 72 ], [ 393300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 73 ], [ 393315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 74 ], [ 393387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 75 ], [ 393466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 76 ], [ 393538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 77 ], [ 393607, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 78 ], [ 393670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 79 ], [ 393738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 80 ], [ 393788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 81 ], [ 393804, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 82 ], [ 393805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 83 ], [ 393835, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 84 ], [ 393850, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 85 ], [ 393920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 86 ], [ 393994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 87 ], [ 394056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 88 ], [ 394072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 89 ], [ 394086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 90 ], [ 394087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 91 ], [ 394168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 92 ], [ 394211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 93 ], [ 394212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 94 ], [ 394233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 95 ], [ 394276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 96 ], [ 394286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 97 ], [ 394305, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 98 ], [ 394321, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 4 ], [ 394322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 5 ], [ 394326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 102 ], [ 394341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 103 ], [ 394385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 104 ], [ 394443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 105 ], [ 394476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 106 ], [ 394494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 107 ], [ 394569, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 108 ], [ 394648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 109 ], [ 394720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 110 ], [ 394795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 111 ], [ 394818, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 112 ], [ 394819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 113 ], [ 394896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 114 ], [ 394973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 115 ], [ 395052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 116 ], [ 395102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 117 ], [ 395103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 118 ], [ 395176, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 119 ], [ 395255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 120 ], [ 395334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 121 ], [ 395335, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 122 ], [ 395385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 123 ], [ 395454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 124 ], [ 395520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 125 ], [ 395521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 126 ], [ 395542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 127 ], [ 395589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 128 ], [ 395656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 129 ], [ 395677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 130 ], [ 395679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 131 ], [ 395721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 132 ], [ 395767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 133 ], [ 395814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 134 ], [ 395827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 135 ], [ 395846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 136 ], [ 395862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 5 ], [ 395863, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 6 ], [ 395867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 140 ], [ 395882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 141 ], [ 395935, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 142 ], [ 395968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 143 ], [ 395986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 144 ], [ 396059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 145 ], [ 396131, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 146 ], [ 396193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 147 ], [ 396237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 148 ], [ 396238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 149 ], [ 396306, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 150 ], [ 396382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 151 ], [ 396455, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 152 ], [ 396530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 153 ], [ 396607, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 154 ], [ 396608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 155 ], [ 396681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 156 ], [ 396757, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 157 ], [ 396798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 158 ], [ 396845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 159 ], [ 396846, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 160 ], [ 396922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 161 ], [ 396999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 162 ], [ 397000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 163 ], [ 397021, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 164 ], [ 397080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 165 ], [ 397130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 166 ], [ 397161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 167 ], [ 397166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 168 ], [ 397224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 169 ], [ 397236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 170 ], [ 397255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 171 ], [ 397271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 6 ], [ 397272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 7 ], [ 397276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 175 ], [ 397291, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 176 ], [ 397347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 177 ], [ 397380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 178 ], [ 397398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 179 ], [ 397473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 180 ], [ 397554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 181 ], [ 397619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 182 ], [ 397663, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 183 ], [ 397664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 184 ], [ 397736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 185 ], [ 397805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 186 ], [ 397843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 187 ], [ 397922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 188 ], [ 397923, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 189 ], [ 397996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 190 ], [ 398072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 191 ], [ 398113, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 192 ], [ 398160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 193 ], [ 398161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 194 ], [ 398240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 195 ], [ 398317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 196 ], [ 398318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 197 ], [ 398339, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 198 ], [ 398392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 199 ], [ 398424, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 200 ], [ 398429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 201 ], [ 398491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 202 ], [ 398503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 203 ], [ 398522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 204 ], [ 398538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 7 ], [ 398539, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 8 ], [ 398543, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 208 ], [ 398558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 209 ], [ 398610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 210 ], [ 398664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 211 ], [ 398697, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 212 ], [ 398715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 213 ], [ 398785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 214 ], [ 398862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 215 ], [ 398922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 216 ], [ 398962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 217 ], [ 398963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 218 ], [ 399037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 219 ], [ 399105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 220 ], [ 399178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 221 ], [ 399251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 222 ], [ 399322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 223 ], [ 399396, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 224 ], [ 399476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 225 ], [ 399536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 226 ], [ 399609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 227 ], [ 399688, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 228 ], [ 399768, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 229 ], [ 399769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 230 ], [ 399842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 231 ], [ 399918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 232 ], [ 399959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 233 ], [ 400006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 234 ], [ 400007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 235 ], [ 400082, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 236 ], [ 400159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 237 ], [ 400160, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 238 ], [ 400181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 239 ], [ 400261, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 240 ], [ 400289, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 241 ], [ 400294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 242 ], [ 400352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 243 ], [ 400364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 244 ], [ 400383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 245 ], [ 400399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 8 ], [ 400400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 9 ], [ 400404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 249 ], [ 400419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 250 ], [ 400502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 251 ], [ 400535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 252 ], [ 400553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 253 ], [ 400630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 254 ], [ 400709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 255 ], [ 400786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 256 ], [ 400867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 257 ], [ 400929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 258 ], [ 401003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 259 ], [ 401004, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 260 ], [ 401079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 261 ], [ 401159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 262 ], [ 401188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 263 ], [ 401189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 264 ], [ 401260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 265 ], [ 401261, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 266 ], [ 401282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 267 ], [ 401330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 268 ], [ 401365, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 269 ], [ 401403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 270 ], [ 401462, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 271 ], [ 401475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 272 ], [ 401494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/disp\ lay.xml", 273 ], [ 401510, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 9 ], [ 401511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 10 ], [ 401524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 11 ], [ 401525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 12 ], [ 401594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 13 ], [ 401661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 14 ], [ 401704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 15 ], [ 401715, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 16 ], [ 401743, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 17 ], [ 401756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 18 ], [ 401826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 19 ], [ 401897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 20 ], [ 401968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 21 ], [ 402041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 22 ], [ 402110, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 23 ], [ 402177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 24 ], [ 402228, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 25 ], [ 402242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 26 ], [ 402243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 27 ], [ 402272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 28 ], [ 402285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 29 ], [ 402356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 30 ], [ 402427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 31 ], [ 402498, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 32 ], [ 402567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 33 ], [ 402629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 34 ], [ 402700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 35 ], [ 402770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 36 ], [ 402842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 37 ], [ 402887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 38 ], [ 402945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 39 ], [ 402959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 40 ], [ 402960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 41 ], [ 402990, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 42 ], [ 403003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 43 ], [ 403075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 44 ], [ 403133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 45 ], [ 403205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 46 ], [ 403249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 47 ], [ 403263, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 48 ], [ 403264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 49 ], [ 403295, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 50 ], [ 403308, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 51 ], [ 403373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 52 ], [ 403433, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 53 ], [ 403505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 54 ], [ 403577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 55 ], [ 403648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 56 ], [ 403661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 57 ], [ 403675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 58 ], [ 403687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 59 ], [ 403691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 161 ], [ 403704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 162 ], [ 403742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 163 ], [ 403785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 164 ], [ 403816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 165 ], [ 403832, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 166 ], [ 403903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 167 ], [ 403964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 168 ], [ 404014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 169 ], [ 404023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 170 ], [ 404024, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 171 ], [ 404090, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 172 ], [ 404159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 173 ], [ 404233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 174 ], [ 404242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 175 ], [ 404243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 176 ], [ 404309, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 177 ], [ 404375, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 178 ], [ 404419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 179 ], [ 404460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 180 ], [ 404515, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 181 ], [ 404573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 182 ], [ 404592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 183 ], [ 404619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 184 ], [ 404661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 185 ], [ 404676, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 186 ], [ 404693, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 187 ], [ 404736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 188 ], [ 404781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 189 ], [ 404797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 190 ], [ 404857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 191 ], [ 404875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 192 ], [ 404931, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 193 ], [ 404992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 194 ], [ 405037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 195 ], [ 405047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 196 ], [ 405064, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 197 ], [ 405078, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 59 ], [ 405079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 60 ], [ 405083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 201 ], [ 405096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 202 ], [ 405158, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 203 ], [ 405220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 204 ], [ 405282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 205 ], [ 405344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 206 ], [ 405376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 207 ], [ 405392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 208 ], [ 405471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 209 ], [ 405551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 210 ], [ 405627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 211 ], [ 405705, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 212 ], [ 405753, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 213 ], [ 405754, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 214 ], [ 405828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 215 ], [ 405886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 216 ], [ 405927, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 217 ], [ 405984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 218 ], [ 406013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 219 ], [ 406069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 220 ], [ 406105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 221 ], [ 406128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 222 ], [ 406163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 223 ], [ 406205, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 224 ], [ 406241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 225 ], [ 406286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 226 ], [ 406327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 227 ], [ 406373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 228 ], [ 406411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 229 ], [ 406453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 230 ], [ 406514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 231 ], [ 406557, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 232 ], [ 406598, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 233 ], [ 406643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 234 ], [ 406698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 235 ], [ 406745, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 236 ], [ 406791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 237 ], [ 406841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 238 ], [ 406855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 239 ], [ 406874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 240 ], [ 406888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 60 ], [ 406889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 61 ], [ 406893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 451 ], [ 406906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 452 ], [ 406950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 453 ], [ 406996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 454 ], [ 407041, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 455 ], [ 407088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 456 ], [ 407119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 457 ], [ 407135, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 458 ], [ 407215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 459 ], [ 407248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 460 ], [ 407249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 461 ], [ 407322, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 462 ], [ 407387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 463 ], [ 407458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 464 ], [ 407459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 465 ], [ 407496, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 466 ], [ 407519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 467 ], [ 407559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 468 ], [ 407604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 469 ], [ 407628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 470 ], [ 407634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 471 ], [ 407660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 472 ], [ 407668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 473 ], [ 407682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 474 ], [ 407699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 475 ], [ 407713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 61 ], [ 407714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 62 ], [ 407718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 49 ], [ 407731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 50 ], [ 407793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 51 ], [ 407833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 52 ], [ 407849, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 53 ], [ 407922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 54 ], [ 407996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 55 ], [ 408005, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 56 ], [ 408006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 57 ], [ 408061, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 58 ], [ 408140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 59 ], [ 408215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 60 ], [ 408294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 61 ], [ 408371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 62 ], [ 408451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 63 ], [ 408528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 64 ], [ 408606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 65 ], [ 408622, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 66 ], [ 408623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 67 ], [ 408702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 68 ], [ 408781, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 69 ], [ 408859, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 70 ], [ 408860, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 71 ], [ 408927, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 72 ], [ 409001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 73 ], [ 409074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 74 ], [ 409083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 75 ], [ 409084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 76 ], [ 409161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 77 ], [ 409237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 78 ], [ 409316, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 79 ], [ 409395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 80 ], [ 409473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 81 ], [ 409497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 82 ], [ 409506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 83 ], [ 409507, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 84 ], [ 409585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 85 ], [ 409594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 86 ], [ 409605, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 87 ], [ 409637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 88 ], [ 409650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 89 ], [ 409724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 90 ], [ 409797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 91 ], [ 409869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 92 ], [ 409940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 93 ], [ 409959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 94 ], [ 409973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 95 ], [ 410006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 96 ], [ 410019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 97 ], [ 410085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 98 ], [ 410157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 99 ], [ 410227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 100 ], [ 410241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 101 ], [ 410275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 102 ], [ 410288, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 103 ], [ 410356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 104 ], [ 410427, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 105 ], [ 410491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 106 ], [ 410505, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 107 ], [ 410541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 108 ], [ 410554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 109 ], [ 410627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 110 ], [ 410699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 111 ], [ 410739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 112 ], [ 410753, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 113 ], [ 410790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 114 ], [ 410803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 115 ], [ 410868, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 116 ], [ 410945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 117 ], [ 411024, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 118 ], [ 411105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 119 ], [ 411146, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 120 ], [ 411147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 121 ], [ 411227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 122 ], [ 411271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 123 ], [ 411285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 124 ], [ 411286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 125 ], [ 411343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 126 ], [ 411356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 127 ], [ 411435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 128 ], [ 411495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 129 ], [ 411509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 130 ], [ 411521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 131 ], [ 411522, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 132 ], [ 411545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 133 ], [ 411616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 134 ], [ 411658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 135 ], [ 411685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 136 ], [ 411740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 137 ], [ 411746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 138 ], [ 411768, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 139 ], [ 411810, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 140 ], [ 411838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 141 ], [ 411896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 142 ], [ 411915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 143 ], [ 411929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 62 ], [ 411930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 63 ], [ 411934, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 244 ], [ 411947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 245 ], [ 412008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 246 ], [ 412063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 247 ], [ 412079, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 248 ], [ 412155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 249 ], [ 412218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 250 ], [ 412292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 251 ], [ 412362, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 252 ], [ 412442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 253 ], [ 412504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 254 ], [ 412584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 255 ], [ 412602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 256 ], [ 412611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 257 ], [ 412612, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 258 ], [ 412669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 259 ], [ 412730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 260 ], [ 412806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 261 ], [ 412844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 262 ], [ 412845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 263 ], [ 412922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 264 ], [ 412994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 265 ], [ 413003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 266 ], [ 413004, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 267 ], [ 413071, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 268 ], [ 413150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 269 ], [ 413223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 270 ], [ 413303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 271 ], [ 413382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 272 ], [ 413444, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 273 ], [ 413453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 274 ], [ 413454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 275 ], [ 413532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 276 ], [ 413541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 277 ], [ 413552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 278 ], [ 413584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 279 ], [ 413597, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 280 ], [ 413671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 281 ], [ 413744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 282 ], [ 413816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 283 ], [ 413887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 284 ], [ 413906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 285 ], [ 413920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 286 ], [ 413953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 287 ], [ 413966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 288 ], [ 414032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 289 ], [ 414104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 290 ], [ 414174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 291 ], [ 414188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 292 ], [ 414222, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 293 ], [ 414235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 294 ], [ 414303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 295 ], [ 414374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 296 ], [ 414438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 297 ], [ 414452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 298 ], [ 414488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 299 ], [ 414501, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 300 ], [ 414574, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 301 ], [ 414646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 302 ], [ 414686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 303 ], [ 414700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 304 ], [ 414737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 305 ], [ 414750, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 306 ], [ 414815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 307 ], [ 414892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 308 ], [ 414971, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 309 ], [ 415052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 310 ], [ 415093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 311 ], [ 415094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 312 ], [ 415174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 313 ], [ 415218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 314 ], [ 415223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 315 ], [ 415251, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 316 ], [ 415327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 317 ], [ 415345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 318 ], [ 415349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 319 ], [ 415363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 320 ], [ 415364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 321 ], [ 415421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 322 ], [ 415434, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 323 ], [ 415513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 324 ], [ 415573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 325 ], [ 415587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 326 ], [ 415599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 327 ], [ 415600, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 328 ], [ 415623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 329 ], [ 415642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 330 ], [ 415702, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 331 ], [ 415747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 332 ], [ 415766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 333 ], [ 415826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 334 ], [ 415872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 335 ], [ 415891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 336 ], [ 415946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 337 ], [ 415995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 338 ], [ 416044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 339 ], [ 416093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 340 ], [ 416142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 341 ], [ 416191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 342 ], [ 416240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 343 ], [ 416289, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 344 ], [ 416338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 345 ], [ 416387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 346 ], [ 416436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 347 ], [ 416485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 348 ], [ 416534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 349 ], [ 416583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 350 ], [ 416645, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 351 ], [ 416664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 352 ], [ 416678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 63 ], [ 416679, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 64 ], [ 416683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 356 ], [ 416696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 357 ], [ 416772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 358 ], [ 416788, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 359 ], [ 416866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 360 ], [ 416946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 361 ], [ 417023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 362 ], [ 417100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 363 ], [ 417177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 364 ], [ 417250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 365 ], [ 417330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 366 ], [ 417406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 367 ], [ 417484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 368 ], [ 417494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 369 ], [ 417503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 370 ], [ 417504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 371 ], [ 417540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 372 ], [ 417541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 373 ], [ 417620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 374 ], [ 417700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 375 ], [ 417701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 376 ], [ 417747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 377 ], [ 417758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 378 ], [ 417790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 379 ], [ 417803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 380 ], [ 417877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 381 ], [ 417950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 382 ], [ 418022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 383 ], [ 418093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 384 ], [ 418112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 385 ], [ 418126, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 386 ], [ 418159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 387 ], [ 418172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 388 ], [ 418238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 389 ], [ 418310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 390 ], [ 418380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 391 ], [ 418394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 392 ], [ 418428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 393 ], [ 418441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 394 ], [ 418509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 395 ], [ 418580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 396 ], [ 418644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 397 ], [ 418658, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 398 ], [ 418694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 399 ], [ 418707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 400 ], [ 418780, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 401 ], [ 418852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 402 ], [ 418892, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 403 ], [ 418906, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 404 ], [ 418907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 405 ], [ 418944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 406 ], [ 418957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 407 ], [ 419022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 408 ], [ 419099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 409 ], [ 419178, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 410 ], [ 419259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 411 ], [ 419300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 412 ], [ 419301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 413 ], [ 419381, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 414 ], [ 419425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 415 ], [ 419430, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 416 ], [ 419458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 417 ], [ 419544, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 418 ], [ 419548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 419 ], [ 419562, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 420 ], [ 419619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 421 ], [ 419632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 422 ], [ 419711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 423 ], [ 419771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 424 ], [ 419785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 425 ], [ 419797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 426 ], [ 419798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 427 ], [ 419821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 428 ], [ 419838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 429 ], [ 419866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 430 ], [ 419908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 431 ], [ 419955, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 432 ], [ 420000, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 433 ], [ 420025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 434 ], [ 420063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 435 ], [ 420128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 436 ], [ 420188, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 437 ], [ 420212, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 438 ], [ 420259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 439 ], [ 420330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 440 ], [ 420370, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 441 ], [ 420376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 442 ], [ 420405, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 443 ], [ 420451, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 444 ], [ 420500, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 445 ], [ 420564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 446 ], [ 420583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 447 ], [ 420597, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 64 ], [ 420598, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 65 ], [ 420602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 12 ], [ 420615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 13 ], [ 420683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 14 ], [ 420717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 15 ], [ 420733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 16 ], [ 420811, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 17 ], [ 420889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 18 ], [ 420965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 19 ], [ 421003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 20 ], [ 421012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 21 ], [ 421013, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 22 ], [ 421088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 23 ], [ 421167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 24 ], [ 421248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 25 ], [ 421257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 26 ], [ 421258, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 27 ], [ 421332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 28 ], [ 421409, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 29 ], [ 421435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 30 ], [ 421436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 31 ], [ 421511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 32 ], [ 421512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 33 ], [ 421535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 34 ], [ 421606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 35 ], [ 421648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 36 ], [ 421675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 37 ], [ 421732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 38 ], [ 421738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 39 ], [ 421760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 40 ], [ 421808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 41 ], [ 421819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 42 ], [ 421845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 43 ], [ 421859, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 44 ], [ 421876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 45 ], [ 421890, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 65 ], [ 421891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 66 ], [ 421895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 479 ], [ 421908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 480 ], [ 421992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 481 ], [ 422076, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 482 ], [ 422107, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 483 ], [ 422123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 484 ], [ 422203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 485 ], [ 422232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 486 ], [ 422233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 487 ], [ 422312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 488 ], [ 422392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 489 ], [ 422473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 490 ], [ 422549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 491 ], [ 422627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 492 ], [ 422708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 493 ], [ 422739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 494 ], [ 422740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 495 ], [ 422794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 496 ], [ 422874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 497 ], [ 422943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 498 ], [ 422944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 499 ], [ 423019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 500 ], [ 423094, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 501 ], [ 423171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 502 ], [ 423193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 503 ], [ 423194, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 504 ], [ 423275, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 505 ], [ 423328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 506 ], [ 423329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 507 ], [ 423352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 508 ], [ 423392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 509 ], [ 423437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 510 ], [ 423494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 511 ], [ 423550, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 512 ], [ 423564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 513 ], [ 423585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 514 ], [ 423601, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 515 ], [ 423646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 516 ], [ 423660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 517 ], [ 423677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 518 ], [ 423691, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 66 ], [ 423692, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 67 ], [ 423696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 666 ], [ 423709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 667 ], [ 423758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 668 ], [ 423790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 669 ], [ 423806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 670 ], [ 423884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 671 ], [ 423963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 672 ], [ 423993, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 673 ], [ 423994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 674 ], [ 424073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 675 ], [ 424145, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 676 ], [ 424220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 677 ], [ 424249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 678 ], [ 424250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 679 ], [ 424329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 680 ], [ 424408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 681 ], [ 424484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 682 ], [ 424530, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 683 ], [ 424531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 684 ], [ 424611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 685 ], [ 424686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 686 ], [ 424766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 687 ], [ 424809, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 688 ], [ 424810, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 689 ], [ 424833, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 690 ], [ 424877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 691 ], [ 424922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 692 ], [ 424946, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 693 ], [ 424985, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 694 ], [ 424999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 695 ], [ 425016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 696 ], [ 425030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 67 ], [ 425031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 68 ], [ 425035, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 700 ], [ 425048, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 701 ], [ 425115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 702 ], [ 425147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 703 ], [ 425163, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 704 ], [ 425241, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 705 ], [ 425317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 706 ], [ 425378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 707 ], [ 425379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 708 ], [ 425458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 709 ], [ 425536, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 710 ], [ 425611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 711 ], [ 425631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 712 ], [ 425632, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 713 ], [ 425711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 714 ], [ 425790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 715 ], [ 425866, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 716 ], [ 425942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 717 ], [ 426019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 718 ], [ 426099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 719 ], [ 426147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 720 ], [ 426148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 721 ], [ 426225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 722 ], [ 426297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 723 ], [ 426298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 724 ], [ 426321, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 725 ], [ 426383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 726 ], [ 426428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 727 ], [ 426452, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 728 ], [ 426481, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 729 ], [ 426547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 730 ], [ 426592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 731 ], [ 426616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 732 ], [ 426668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 733 ], [ 426682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 734 ], [ 426699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 735 ], [ 426713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 68 ], [ 426714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 69 ], [ 426718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 739 ], [ 426731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 740 ], [ 426771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 741 ], [ 426803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 742 ], [ 426819, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 743 ], [ 426898, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 744 ], [ 426977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 745 ], [ 427022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 746 ], [ 427023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 747 ], [ 427102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 748 ], [ 427177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 749 ], [ 427257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 750 ], [ 427331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 751 ], [ 427407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 752 ], [ 427437, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 753 ], [ 427438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 754 ], [ 427511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 755 ], [ 427586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 756 ], [ 427604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 757 ], [ 427627, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 758 ], [ 427667, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 759 ], [ 427712, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 760 ], [ 427736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 761 ], [ 427759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 762 ], [ 427805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 763 ], [ 427851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 764 ], [ 427875, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 765 ], [ 427942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 766 ], [ 427957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 767 ], [ 427971, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 768 ], [ 427988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 769 ], [ 428002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 69 ], [ 428003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 70 ], [ 428007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 522 ], [ 428020, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 523 ], [ 428067, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 524 ], [ 428119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 525 ], [ 428150, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 526 ], [ 428166, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 527 ], [ 428238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 528 ], [ 428315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 529 ], [ 428394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 530 ], [ 428471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 531 ], [ 428550, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 532 ], [ 428623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 533 ], [ 428646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 534 ], [ 428647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 535 ], [ 428728, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 536 ], [ 428785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 537 ], [ 428786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 538 ], [ 428791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 539 ], [ 428843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 540 ], [ 428911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 541 ], [ 429001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 542 ], [ 429082, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 543 ], [ 429118, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 544 ], [ 429119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 545 ], [ 429142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 546 ], [ 429182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 547 ], [ 429227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 548 ], [ 429253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 549 ], [ 429274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 550 ], [ 429313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 551 ], [ 429358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 552 ], [ 429372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 553 ], [ 429389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 554 ], [ 429403, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 70 ], [ 429404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 71 ], [ 429408, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 558 ], [ 429421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 559 ], [ 429503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 560 ], [ 429583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 561 ], [ 429599, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 562 ], [ 429677, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 563 ], [ 429756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 564 ], [ 429836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 565 ], [ 429837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 566 ], [ 429914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 567 ], [ 429991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 568 ], [ 430052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 569 ], [ 430130, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 570 ], [ 430207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 571 ], [ 430287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 572 ], [ 430343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 573 ], [ 430344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 574 ], [ 430420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 575 ], [ 430443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 576 ], [ 430466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 577 ], [ 430512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 578 ], [ 430562, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 579 ], [ 430633, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 580 ], [ 430684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 581 ], [ 430741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 582 ], [ 430791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 583 ], [ 430805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 584 ], [ 430822, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 585 ], [ 430836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 71 ], [ 430837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 72 ], [ 430841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 589 ], [ 430854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 590 ], [ 430914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 591 ], [ 430964, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 592 ], [ 430980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 593 ], [ 431059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 594 ], [ 431129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 595 ], [ 431209, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 596 ], [ 431283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 597 ], [ 431343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 598 ], [ 431383, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 599 ], [ 431384, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 600 ], [ 431465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 601 ], [ 431542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 602 ], [ 431620, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 603 ], [ 431700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 604 ], [ 431709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 605 ], [ 431710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 606 ], [ 431791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 607 ], [ 431814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 608 ], [ 431825, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 609 ], [ 431838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 610 ], [ 431918, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 611 ], [ 431961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 612 ], [ 431975, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 613 ], [ 431988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 614 ], [ 432069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 615 ], [ 432146, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 616 ], [ 432215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 617 ], [ 432292, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 618 ], [ 432372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 619 ], [ 432416, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 620 ], [ 432417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 621 ], [ 432477, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 622 ], [ 432554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 623 ], [ 432624, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 624 ], [ 432638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 625 ], [ 432651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 626 ], [ 432731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 627 ], [ 432795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 628 ], [ 432874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 629 ], [ 432939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 630 ], [ 433016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 631 ], [ 433088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 632 ], [ 433167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 633 ], [ 433196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 634 ], [ 433210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 635 ], [ 433223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 636 ], [ 433290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 637 ], [ 433351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 638 ], [ 433426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 639 ], [ 433491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 640 ], [ 433570, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 641 ], [ 433638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 642 ], [ 433695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 643 ], [ 433709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 644 ], [ 433721, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 645 ], [ 433722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 646 ], [ 433785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 647 ], [ 433862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 648 ], [ 433942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 649 ], [ 433958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 650 ], [ 433967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 651 ], [ 433968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 652 ], [ 433969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 653 ], [ 433992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 654 ], [ 434046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 655 ], [ 434091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 656 ], [ 434138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 657 ], [ 434197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 658 ], [ 434237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 659 ], [ 434271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 660 ], [ 434329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 661 ], [ 434346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/io.x\ ml", 662 ], [ 434360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 72 ], [ 434361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 73 ], [ 434374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ch\ ap9.xml", 74 ], [ 434385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 44 ], [ 434411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 45 ], [ 434419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 46 ], [ 434420, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1 ], [ 434431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 2 ], [ 434443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 3 ], [ 434477, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 4 ], [ 434490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 5 ], [ 434563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 6 ], [ 434636, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 7 ], [ 434646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 8 ], [ 434647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 9 ], [ 434659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 10 ], [ 434673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 11 ], [ 434720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 12 ], [ 434735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 13 ], [ 434756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 14 ], [ 434766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 15 ], [ 434841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 16 ], [ 434862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 17 ], [ 434873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 18 ], [ 434884, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 19 ], [ 434885, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 20 ], [ 434913, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 21 ], [ 434930, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 22 ], [ 434942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 23 ], [ 434957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 24 ], [ 434983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 25 ], [ 434999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 26 ], [ 435014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 27 ], [ 435043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 28 ], [ 435059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 29 ], [ 435074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 30 ], [ 435102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 31 ], [ 435123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 32 ], [ 435140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 33 ], [ 435156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 34 ], [ 435169, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 35 ], [ 435186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 36 ], [ 435187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 37 ], [ 435199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 38 ], [ 435214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 39 ], [ 435237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 40 ], [ 435253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 41 ], [ 435268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 42 ], [ 435300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 43 ], [ 435316, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 44 ], [ 435331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 45 ], [ 435359, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 46 ], [ 435426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 47 ], [ 435495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 48 ], [ 435512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 49 ], [ 435528, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 50 ], [ 435541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 51 ], [ 435558, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 52 ], [ 435559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 53 ], [ 435571, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 54 ], [ 435586, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 55 ], [ 435619, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 56 ], [ 435635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 57 ], [ 435650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 58 ], [ 435692, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 59 ], [ 435708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 60 ], [ 435723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 61 ], [ 435751, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 62 ], [ 435827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 63 ], [ 435874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 64 ], [ 435891, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 65 ], [ 435907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 66 ], [ 435920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 67 ], [ 435937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 68 ], [ 435938, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 69 ], [ 435950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 70 ], [ 435965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 71 ], [ 435992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 72 ], [ 436008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 73 ], [ 436023, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 74 ], [ 436059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 75 ], [ 436087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 76 ], [ 436102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 77 ], [ 436141, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 78 ], [ 436158, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 79 ], [ 436174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 80 ], [ 436189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 81 ], [ 436217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 82 ], [ 436282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 83 ], [ 436357, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 84 ], [ 436436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 85 ], [ 436518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 86 ], [ 436592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 87 ], [ 436609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 88 ], [ 436625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 89 ], [ 436638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 90 ], [ 436655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 91 ], [ 436656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 92 ], [ 436668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 93 ], [ 436683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 94 ], [ 436714, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 95 ], [ 436730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 96 ], [ 436745, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 97 ], [ 436785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 98 ], [ 436801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 99 ], [ 436816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 100 ], [ 436844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 101 ], [ 436907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 102 ], [ 436979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 103 ], [ 437059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 104 ], [ 437138, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 105 ], [ 437192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 106 ], [ 437235, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 107 ], [ 437252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 108 ], [ 437268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 109 ], [ 437281, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 110 ], [ 437298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 111 ], [ 437299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 112 ], [ 437311, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 113 ], [ 437326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 114 ], [ 437356, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 115 ], [ 437372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 116 ], [ 437387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 117 ], [ 437426, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 118 ], [ 437442, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 119 ], [ 437457, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 120 ], [ 437485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 121 ], [ 437555, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 122 ], [ 437597, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 123 ], [ 437614, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 124 ], [ 437630, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 125 ], [ 437643, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 126 ], [ 437660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 127 ], [ 437661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 128 ], [ 437673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 129 ], [ 437688, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 130 ], [ 437717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 131 ], [ 437733, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 132 ], [ 437748, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 133 ], [ 437786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 134 ], [ 437802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 135 ], [ 437817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 136 ], [ 437845, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 137 ], [ 437919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 138 ], [ 437962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 139 ], [ 437979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 140 ], [ 437995, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 141 ], [ 438008, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 142 ], [ 438025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 143 ], [ 438026, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 144 ], [ 438038, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 145 ], [ 438053, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 146 ], [ 438083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 147 ], [ 438099, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 148 ], [ 438114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 149 ], [ 438158, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 150 ], [ 438174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 151 ], [ 438189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 152 ], [ 438217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 153 ], [ 438297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 154 ], [ 438379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 155 ], [ 438421, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 156 ], [ 438438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 157 ], [ 438454, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 158 ], [ 438467, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 159 ], [ 438484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 160 ], [ 438485, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 161 ], [ 438497, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 162 ], [ 438512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 163 ], [ 438545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 164 ], [ 438561, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 165 ], [ 438576, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 166 ], [ 438623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 167 ], [ 438639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 168 ], [ 438654, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 169 ], [ 438682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 170 ], [ 438762, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 171 ], [ 438844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 172 ], [ 438886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 173 ], [ 438903, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 174 ], [ 438919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 175 ], [ 438932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 176 ], [ 438949, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 177 ], [ 438950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 178 ], [ 438962, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 179 ], [ 438977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 180 ], [ 439012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 181 ], [ 439028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 182 ], [ 439043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 183 ], [ 439090, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 184 ], [ 439118, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 185 ], [ 439134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 186 ], [ 439182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 187 ], [ 439199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 188 ], [ 439215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 189 ], [ 439230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 190 ], [ 439258, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 191 ], [ 439332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 192 ], [ 439412, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 193 ], [ 439443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 194 ], [ 439460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 195 ], [ 439476, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 196 ], [ 439489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 197 ], [ 439506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 198 ], [ 439519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 199 ], [ 439532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 200 ], [ 439533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 201 ], [ 439545, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 202 ], [ 439559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 203 ], [ 439613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 204 ], [ 439628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 205 ], [ 439649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 206 ], [ 439659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 207 ], [ 439734, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 208 ], [ 439755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 209 ], [ 439766, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 210 ], [ 439777, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 211 ], [ 439778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 212 ], [ 439806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 213 ], [ 439823, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 214 ], [ 439824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 215 ], [ 439836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 216 ], [ 439851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 217 ], [ 439877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 218 ], [ 439893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 219 ], [ 439908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 220 ], [ 439937, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 221 ], [ 439953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 222 ], [ 439968, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 223 ], [ 439996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 224 ], [ 440017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 225 ], [ 440034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 226 ], [ 440050, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 227 ], [ 440063, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 228 ], [ 440080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 229 ], [ 440081, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 230 ], [ 440093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 231 ], [ 440108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 232 ], [ 440133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 233 ], [ 440149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 234 ], [ 440164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 235 ], [ 440198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 236 ], [ 440214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 237 ], [ 440229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 238 ], [ 440257, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 239 ], [ 440331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 240 ], [ 440359, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 241 ], [ 440376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 242 ], [ 440392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 243 ], [ 440405, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 244 ], [ 440422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 245 ], [ 440423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 246 ], [ 440435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 247 ], [ 440450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 248 ], [ 440478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 249 ], [ 440494, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 250 ], [ 440509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 251 ], [ 440551, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 252 ], [ 440567, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 253 ], [ 440582, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 254 ], [ 440610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 255 ], [ 440688, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 256 ], [ 440730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 257 ], [ 440747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 258 ], [ 440763, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 259 ], [ 440776, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 260 ], [ 440793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 261 ], [ 440794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 262 ], [ 440806, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 263 ], [ 440821, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 264 ], [ 440871, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 265 ], [ 440887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 266 ], [ 440902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 267 ], [ 440963, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 268 ], [ 440979, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 269 ], [ 440994, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 270 ], [ 441022, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 271 ], [ 441100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 272 ], [ 441177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 273 ], [ 441232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 274 ], [ 441300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 275 ], [ 441317, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 276 ], [ 441333, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 277 ], [ 441346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 278 ], [ 441363, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 279 ], [ 441364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 280 ], [ 441376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 281 ], [ 441391, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 282 ], [ 441419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 283 ], [ 441435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 284 ], [ 441450, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 285 ], [ 441493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 286 ], [ 441509, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 287 ], [ 441524, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 288 ], [ 441552, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 289 ], [ 441621, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 290 ], [ 441678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 291 ], [ 441695, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 292 ], [ 441711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 293 ], [ 441724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 294 ], [ 441741, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 295 ], [ 441742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 296 ], [ 441754, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 297 ], [ 441769, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 298 ], [ 441798, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 299 ], [ 441814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 300 ], [ 441829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 301 ], [ 441873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 302 ], [ 441889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 303 ], [ 441904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 304 ], [ 441932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 305 ], [ 442002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 306 ], [ 442060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 307 ], [ 442077, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 308 ], [ 442093, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 309 ], [ 442106, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 310 ], [ 442123, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 311 ], [ 442124, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 312 ], [ 442136, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 313 ], [ 442151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 314 ], [ 442177, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 315 ], [ 442193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 316 ], [ 442208, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 317 ], [ 442248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 318 ], [ 442264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 319 ], [ 442279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 320 ], [ 442307, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 321 ], [ 442385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 322 ], [ 442457, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 323 ], [ 442535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 324 ], [ 442583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 325 ], [ 442600, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 326 ], [ 442616, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 327 ], [ 442629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 328 ], [ 442646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 329 ], [ 442647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 330 ], [ 442659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 331 ], [ 442674, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 332 ], [ 442704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 333 ], [ 442720, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 334 ], [ 442735, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 335 ], [ 442777, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 336 ], [ 442805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 337 ], [ 442860, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 338 ], [ 442877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 339 ], [ 442893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 340 ], [ 442908, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 341 ], [ 442936, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 342 ], [ 443014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 343 ], [ 443058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 344 ], [ 443075, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 345 ], [ 443091, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 346 ], [ 443104, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 347 ], [ 443121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 348 ], [ 443122, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 349 ], [ 443134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 350 ], [ 443149, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 351 ], [ 443180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 352 ], [ 443196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 353 ], [ 443211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 354 ], [ 443248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 355 ], [ 443276, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 356 ], [ 443299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 357 ], [ 443344, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 358 ], [ 443382, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 359 ], [ 443419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 360 ], [ 443463, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 361 ], [ 443502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 362 ], [ 443519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 363 ], [ 443535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 364 ], [ 443550, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 365 ], [ 443578, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 366 ], [ 443651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 367 ], [ 443696, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 368 ], [ 443713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 369 ], [ 443729, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 370 ], [ 443742, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 371 ], [ 443759, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 372 ], [ 443760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 373 ], [ 443772, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 374 ], [ 443787, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 375 ], [ 443812, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 376 ], [ 443828, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 377 ], [ 443843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 378 ], [ 443883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 379 ], [ 443899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 380 ], [ 443914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 381 ], [ 443942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 382 ], [ 444018, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 383 ], [ 444057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 384 ], [ 444074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 385 ], [ 444090, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 386 ], [ 444103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 387 ], [ 444120, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 388 ], [ 444121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 389 ], [ 444133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 390 ], [ 444148, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 391 ], [ 444179, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 392 ], [ 444195, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 393 ], [ 444210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 394 ], [ 444238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 395 ], [ 444283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 396 ], [ 444334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 397 ], [ 444351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 398 ], [ 444378, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 399 ], [ 444423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 400 ], [ 444440, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 401 ], [ 444456, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 402 ], [ 444471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 403 ], [ 444499, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 404 ], [ 444570, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 405 ], [ 444615, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 406 ], [ 444667, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 407 ], [ 444684, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 408 ], [ 444700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 409 ], [ 444713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 410 ], [ 444730, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 411 ], [ 444731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 412 ], [ 444743, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 413 ], [ 444758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 414 ], [ 444785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 415 ], [ 444801, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 416 ], [ 444816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 417 ], [ 444862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 418 ], [ 444890, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 419 ], [ 444948, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 420 ], [ 444965, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 421 ], [ 444981, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 422 ], [ 444996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 423 ], [ 445024, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 424 ], [ 445103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 425 ], [ 445147, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 426 ], [ 445164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 427 ], [ 445180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 428 ], [ 445193, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 429 ], [ 445210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 430 ], [ 445211, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 431 ], [ 445223, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 432 ], [ 445238, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 433 ], [ 445262, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 434 ], [ 445278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 435 ], [ 445293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 436 ], [ 445360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 437 ], [ 445376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 438 ], [ 445391, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 439 ], [ 445419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 440 ], [ 445448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 441 ], [ 445517, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 442 ], [ 445597, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 443 ], [ 445634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 444 ], [ 445703, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 445 ], [ 445761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 446 ], [ 445778, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 447 ], [ 445794, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 448 ], [ 445807, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 449 ], [ 445824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 450 ], [ 445825, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 451 ], [ 445837, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 452 ], [ 445852, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 453 ], [ 445883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 454 ], [ 445899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 455 ], [ 445914, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 456 ], [ 445951, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 457 ], [ 445967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 458 ], [ 445982, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 459 ], [ 446010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 460 ], [ 446080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 461 ], [ 446128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 462 ], [ 446145, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 463 ], [ 446161, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 464 ], [ 446174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 465 ], [ 446191, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 466 ], [ 446192, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 467 ], [ 446204, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 468 ], [ 446219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 469 ], [ 446252, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 470 ], [ 446268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 471 ], [ 446283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 472 ], [ 446298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 473 ], [ 446314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 474 ], [ 446329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 475 ], [ 446357, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 476 ], [ 446431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 477 ], [ 446456, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 478 ], [ 446473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 479 ], [ 446489, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 480 ], [ 446502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 481 ], [ 446519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 482 ], [ 446520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 483 ], [ 446532, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 484 ], [ 446547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 485 ], [ 446573, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 486 ], [ 446589, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 487 ], [ 446604, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 488 ], [ 446650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 489 ], [ 446706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 490 ], [ 446722, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 491 ], [ 446737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 492 ], [ 446765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 493 ], [ 446827, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 494 ], [ 446900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 495 ], [ 446940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 496 ], [ 446957, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 497 ], [ 446973, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 498 ], [ 446986, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 499 ], [ 447003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 500 ], [ 447004, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 501 ], [ 447016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 502 ], [ 447031, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 503 ], [ 447057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 504 ], [ 447073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 505 ], [ 447088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 506 ], [ 447128, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 507 ], [ 447144, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 508 ], [ 447159, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 509 ], [ 447187, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 510 ], [ 447260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 511 ], [ 447303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 512 ], [ 447320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 513 ], [ 447336, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 514 ], [ 447349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 515 ], [ 447366, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 516 ], [ 447367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 517 ], [ 447379, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 518 ], [ 447394, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 519 ], [ 447417, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 520 ], [ 447433, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 521 ], [ 447448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 522 ], [ 447495, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 523 ], [ 447511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 524 ], [ 447526, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 525 ], [ 447554, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 526 ], [ 447634, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 527 ], [ 447706, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 528 ], [ 447782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 529 ], [ 447836, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 530 ], [ 447853, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 531 ], [ 447869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 532 ], [ 447882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 533 ], [ 447899, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 534 ], [ 447900, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 535 ], [ 447912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 536 ], [ 447927, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 537 ], [ 447961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 538 ], [ 447977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 539 ], [ 447992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 540 ], [ 448043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 541 ], [ 448059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 542 ], [ 448074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 543 ], [ 448102, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 544 ], [ 448181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 545 ], [ 448237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 546 ], [ 448254, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 547 ], [ 448270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 548 ], [ 448283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 549 ], [ 448300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 550 ], [ 448301, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 551 ], [ 448313, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 552 ], [ 448328, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 553 ], [ 448357, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 554 ], [ 448373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 555 ], [ 448388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 556 ], [ 448431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 557 ], [ 448459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 558 ], [ 448508, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 559 ], [ 448525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 560 ], [ 448541, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 561 ], [ 448556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 562 ], [ 448584, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 563 ], [ 448653, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 564 ], [ 448707, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 565 ], [ 448750, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 566 ], [ 448767, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 567 ], [ 448783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 568 ], [ 448796, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 569 ], [ 448813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 570 ], [ 448814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 571 ], [ 448826, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 572 ], [ 448841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 573 ], [ 448870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 574 ], [ 448886, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 575 ], [ 448901, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 576 ], [ 448939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 577 ], [ 448967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 578 ], [ 449011, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 579 ], [ 449028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 580 ], [ 449044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 581 ], [ 449059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 582 ], [ 449087, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 583 ], [ 449156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 584 ], [ 449218, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 585 ], [ 449256, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 586 ], [ 449273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 587 ], [ 449289, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 588 ], [ 449302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 589 ], [ 449319, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 590 ], [ 449320, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 591 ], [ 449332, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 592 ], [ 449347, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 593 ], [ 449380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 594 ], [ 449396, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 595 ], [ 449411, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 596 ], [ 449453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 597 ], [ 449469, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 598 ], [ 449484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 599 ], [ 449512, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 600 ], [ 449579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 601 ], [ 449605, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 602 ], [ 449675, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 603 ], [ 449727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 604 ], [ 449744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 605 ], [ 449760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 606 ], [ 449773, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 607 ], [ 449790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 608 ], [ 449791, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 609 ], [ 449792, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 610 ], [ 449803, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 611 ], [ 449816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 612 ], [ 449817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 613 ], [ 449829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 614 ], [ 449843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 615 ], [ 449904, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 616 ], [ 449919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 617 ], [ 449940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 618 ], [ 449950, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 619 ], [ 450025, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 620 ], [ 450046, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 621 ], [ 450057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 622 ], [ 450068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 623 ], [ 450069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 624 ], [ 450097, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 625 ], [ 450114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 626 ], [ 450115, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 627 ], [ 450127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 628 ], [ 450142, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 629 ], [ 450168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 630 ], [ 450184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 631 ], [ 450199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 632 ], [ 450228, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 633 ], [ 450244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 634 ], [ 450259, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 635 ], [ 450287, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 636 ], [ 450308, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 637 ], [ 450325, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 638 ], [ 450341, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 639 ], [ 450354, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 640 ], [ 450371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 641 ], [ 450372, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 642 ], [ 450384, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 643 ], [ 450399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 644 ], [ 450431, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 645 ], [ 450447, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 646 ], [ 450462, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 647 ], [ 450506, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 648 ], [ 450534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 649 ], [ 450556, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 650 ], [ 450601, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 651 ], [ 450617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 652 ], [ 450661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 653 ], [ 450678, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 654 ], [ 450694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 655 ], [ 450709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 656 ], [ 450737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 657 ], [ 450795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 658 ], [ 450856, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 659 ], [ 450873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 660 ], [ 450889, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 661 ], [ 450902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 662 ], [ 450919, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 663 ], [ 450920, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 664 ], [ 450932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 665 ], [ 450947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 666 ], [ 450980, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 667 ], [ 450996, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 668 ], [ 451011, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 669 ], [ 451026, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 670 ], [ 451042, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 671 ], [ 451057, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 672 ], [ 451084, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 673 ], [ 451158, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 674 ], [ 451236, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 675 ], [ 451253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 676 ], [ 451269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 677 ], [ 451282, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 678 ], [ 451299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 679 ], [ 451300, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 680 ], [ 451312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 681 ], [ 451327, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 682 ], [ 451361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 683 ], [ 451377, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 684 ], [ 451392, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 685 ], [ 451407, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 686 ], [ 451423, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 687 ], [ 451438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 688 ], [ 451465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 689 ], [ 451540, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 690 ], [ 451618, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 691 ], [ 451635, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 692 ], [ 451651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 693 ], [ 451664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 694 ], [ 451681, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 695 ], [ 451682, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 696 ], [ 451694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 697 ], [ 451709, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 698 ], [ 451744, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 699 ], [ 451760, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 700 ], [ 451775, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 701 ], [ 451824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 702 ], [ 451840, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 703 ], [ 451855, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 704 ], [ 451883, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 705 ], [ 451944, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 706 ], [ 452010, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 707 ], [ 452027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 708 ], [ 452043, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 709 ], [ 452056, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 710 ], [ 452073, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 711 ], [ 452074, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 712 ], [ 452086, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 713 ], [ 452101, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 714 ], [ 452140, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 715 ], [ 452156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 716 ], [ 452171, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 717 ], [ 452186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 718 ], [ 452202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 719 ], [ 452217, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 720 ], [ 452244, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 721 ], [ 452324, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 722 ], [ 452402, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 723 ], [ 452419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 724 ], [ 452435, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 725 ], [ 452448, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 726 ], [ 452465, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 727 ], [ 452466, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 728 ], [ 452478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 729 ], [ 452493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 730 ], [ 452533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 731 ], [ 452549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 732 ], [ 452564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 733 ], [ 452579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 734 ], [ 452595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 735 ], [ 452610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 736 ], [ 452637, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 737 ], [ 452718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 738 ], [ 452796, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 739 ], [ 452813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 740 ], [ 452829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 741 ], [ 452842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 742 ], [ 452859, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 743 ], [ 452860, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 744 ], [ 452872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 745 ], [ 452887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 746 ], [ 452925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 747 ], [ 452941, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 748 ], [ 452956, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 749 ], [ 452971, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 750 ], [ 452987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 751 ], [ 453002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 752 ], [ 453029, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 753 ], [ 453108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 754 ], [ 453186, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 755 ], [ 453203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 756 ], [ 453219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 757 ], [ 453232, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 758 ], [ 453249, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 759 ], [ 453250, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 760 ], [ 453263, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 761 ], [ 453264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 762 ], [ 453277, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 763 ], [ 453278, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 764 ], [ 453290, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 765 ], [ 453304, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 766 ], [ 453349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 767 ], [ 453364, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 768 ], [ 453385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 769 ], [ 453395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 770 ], [ 453470, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 771 ], [ 453491, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 772 ], [ 453502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 773 ], [ 453513, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 774 ], [ 453514, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 775 ], [ 453542, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 776 ], [ 453559, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 777 ], [ 453560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 778 ], [ 453572, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 779 ], [ 453587, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 780 ], [ 453613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 781 ], [ 453629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 782 ], [ 453644, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 783 ], [ 453673, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 784 ], [ 453689, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 785 ], [ 453704, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 786 ], [ 453732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 787 ], [ 453753, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 788 ], [ 453770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 789 ], [ 453786, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 790 ], [ 453799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 791 ], [ 453816, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 792 ], [ 453817, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 793 ], [ 453829, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 794 ], [ 453844, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 795 ], [ 453880, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 796 ], [ 453896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 797 ], [ 453911, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 798 ], [ 453961, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 799 ], [ 453977, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 800 ], [ 453992, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 801 ], [ 454020, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 802 ], [ 454080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 803 ], [ 454146, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 804 ], [ 454199, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 805 ], [ 454274, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 806 ], [ 454334, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 807 ], [ 454351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 808 ], [ 454367, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 809 ], [ 454380, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 810 ], [ 454397, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 811 ], [ 454398, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 812 ], [ 454410, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 813 ], [ 454425, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 814 ], [ 454462, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 815 ], [ 454478, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 816 ], [ 454493, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 817 ], [ 454544, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 818 ], [ 454560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 819 ], [ 454575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 820 ], [ 454603, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 821 ], [ 454650, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 822 ], [ 454717, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 823 ], [ 454771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 824 ], [ 454847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 825 ], [ 454907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 826 ], [ 454924, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 827 ], [ 454940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 828 ], [ 454953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 829 ], [ 454970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 830 ], [ 454971, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 831 ], [ 454983, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 832 ], [ 454998, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 833 ], [ 455028, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 834 ], [ 455044, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 835 ], [ 455059, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 836 ], [ 455103, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 837 ], [ 455119, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 838 ], [ 455134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 839 ], [ 455162, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 840 ], [ 455219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 841 ], [ 455279, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 842 ], [ 455326, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 843 ], [ 455406, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 844 ], [ 455483, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 845 ], [ 455560, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 846 ], [ 455596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 847 ], [ 455613, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 848 ], [ 455629, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 849 ], [ 455642, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 850 ], [ 455659, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 851 ], [ 455660, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 852 ], [ 455672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 853 ], [ 455687, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 854 ], [ 455716, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 855 ], [ 455732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 856 ], [ 455747, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 857 ], [ 455790, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 858 ], [ 455851, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 859 ], [ 455867, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 860 ], [ 455882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 861 ], [ 455910, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 862 ], [ 455969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 863 ], [ 456012, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 864 ], [ 456088, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 865 ], [ 456105, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 866 ], [ 456121, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 867 ], [ 456134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 868 ], [ 456151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 869 ], [ 456152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 870 ], [ 456164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 871 ], [ 456179, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 872 ], [ 456203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 873 ], [ 456219, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 874 ], [ 456234, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 875 ], [ 456272, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 876 ], [ 456288, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 877 ], [ 456303, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 878 ], [ 456331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 879 ], [ 456385, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 880 ], [ 456440, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 881 ], [ 456457, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 882 ], [ 456473, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 883 ], [ 456486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 884 ], [ 456503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 885 ], [ 456504, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 886 ], [ 456516, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 887 ], [ 456531, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 888 ], [ 456563, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 889 ], [ 456579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 890 ], [ 456594, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 891 ], [ 456640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 892 ], [ 456656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 893 ], [ 456671, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 894 ], [ 456699, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 895 ], [ 456761, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 896 ], [ 456824, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 897 ], [ 456841, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 898 ], [ 456857, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 899 ], [ 456870, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 900 ], [ 456887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 901 ], [ 456888, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 902 ], [ 456901, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 903 ], [ 456902, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 904 ], [ 456915, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 905 ], [ 456916, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 906 ], [ 456928, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 907 ], [ 456942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 908 ], [ 456991, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 909 ], [ 457006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 910 ], [ 457027, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 911 ], [ 457037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 912 ], [ 457112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 913 ], [ 457133, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 914 ], [ 457144, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 915 ], [ 457155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 916 ], [ 457156, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 917 ], [ 457184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 918 ], [ 457201, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 919 ], [ 457202, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 920 ], [ 457214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 921 ], [ 457229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 922 ], [ 457255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 923 ], [ 457271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 924 ], [ 457286, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 925 ], [ 457315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 926 ], [ 457331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 927 ], [ 457346, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 928 ], [ 457374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 929 ], [ 457395, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 930 ], [ 457412, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 931 ], [ 457428, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 932 ], [ 457441, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 933 ], [ 457458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 934 ], [ 457459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 935 ], [ 457471, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 936 ], [ 457486, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 937 ], [ 457519, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 938 ], [ 457535, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 939 ], [ 457550, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 940 ], [ 457592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 941 ], [ 457608, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 942 ], [ 457623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 943 ], [ 457651, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 944 ], [ 457732, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 945 ], [ 457805, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 946 ], [ 457876, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 947 ], [ 457893, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 948 ], [ 457909, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 949 ], [ 457922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 950 ], [ 457939, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 951 ], [ 457940, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 952 ], [ 457952, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 953 ], [ 457967, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 954 ], [ 458003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 955 ], [ 458019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 956 ], [ 458034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 957 ], [ 458049, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 958 ], [ 458065, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 959 ], [ 458080, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 960 ], [ 458108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 961 ], [ 458182, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 962 ], [ 458207, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 963 ], [ 458224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 964 ], [ 458240, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 965 ], [ 458253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 966 ], [ 458270, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 967 ], [ 458271, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 968 ], [ 458283, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 969 ], [ 458298, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 970 ], [ 458329, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 971 ], [ 458345, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 972 ], [ 458360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 973 ], [ 458429, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 974 ], [ 458445, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 975 ], [ 458460, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 976 ], [ 458488, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 977 ], [ 458549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 978 ], [ 458623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 979 ], [ 458647, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 980 ], [ 458664, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 981 ], [ 458680, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 982 ], [ 458693, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 983 ], [ 458710, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 984 ], [ 458711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 985 ], [ 458723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 986 ], [ 458738, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 987 ], [ 458771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 988 ], [ 458787, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 989 ], [ 458802, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 990 ], [ 458838, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 991 ], [ 458854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 992 ], [ 458869, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 993 ], [ 458897, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 994 ], [ 458966, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 995 ], [ 459039, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 996 ], [ 459107, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 997 ], [ 459134, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 998 ], [ 459151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 999 ], [ 459167, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1000 ], [ 459180, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1001 ], [ 459197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1002 ], [ 459198, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1003 ], [ 459210, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1004 ], [ 459225, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1005 ], [ 459253, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1006 ], [ 459269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1007 ], [ 459284, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1008 ], [ 459299, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1009 ], [ 459315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1010 ], [ 459330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1011 ], [ 459358, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1012 ], [ 459432, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1013 ], [ 459457, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1014 ], [ 459474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1015 ], [ 459490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1016 ], [ 459503, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1017 ], [ 459520, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1018 ], [ 459521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1019 ], [ 459533, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1020 ], [ 459548, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1021 ], [ 459575, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1022 ], [ 459591, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1023 ], [ 459606, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1024 ], [ 459652, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1025 ], [ 459668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1026 ], [ 459683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1027 ], [ 459711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1028 ], [ 459768, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1029 ], [ 459831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1030 ], [ 459848, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1031 ], [ 459864, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1032 ], [ 459877, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1033 ], [ 459894, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1034 ], [ 459895, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1035 ], [ 459907, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1036 ], [ 459922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1037 ], [ 459953, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1038 ], [ 459969, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1039 ], [ 459984, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1040 ], [ 459999, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1041 ], [ 460015, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1042 ], [ 460030, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1043 ], [ 460058, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1044 ], [ 460132, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1045 ], [ 460157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1046 ], [ 460174, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1047 ], [ 460190, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1048 ], [ 460203, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1049 ], [ 460220, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1050 ], [ 460221, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1051 ], [ 460233, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1052 ], [ 460248, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1053 ], [ 460281, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1054 ], [ 460297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1055 ], [ 460312, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1056 ], [ 460360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1057 ], [ 460376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1058 ], [ 460391, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1059 ], [ 460419, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1060 ], [ 460482, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1061 ], [ 460547, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1062 ], [ 460564, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1063 ], [ 460580, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1064 ], [ 460593, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1065 ], [ 460610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1066 ], [ 460611, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1067 ], [ 460623, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1068 ], [ 460638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1069 ], [ 460669, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1070 ], [ 460685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1071 ], [ 460700, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1072 ], [ 460740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1073 ], [ 460756, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1074 ], [ 460771, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1075 ], [ 460799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1076 ], [ 460873, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1077 ], [ 460947, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1078 ], [ 461014, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1079 ], [ 461095, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1080 ], [ 461172, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1081 ], [ 461197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1082 ], [ 461214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1083 ], [ 461230, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1084 ], [ 461243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1085 ], [ 461260, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1086 ], [ 461261, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1087 ], [ 461273, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1088 ], [ 461288, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1089 ], [ 461321, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1090 ], [ 461337, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1091 ], [ 461352, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1092 ], [ 461399, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1093 ], [ 461415, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1094 ], [ 461430, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1095 ], [ 461458, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1096 ], [ 461521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1097 ], [ 461585, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1098 ], [ 461602, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1099 ], [ 461618, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1100 ], [ 461631, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1101 ], [ 461648, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1102 ], [ 461649, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1103 ], [ 461661, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1104 ], [ 461676, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1105 ], [ 461708, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1106 ], [ 461724, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1107 ], [ 461739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1108 ], [ 461754, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1109 ], [ 461770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1110 ], [ 461785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1111 ], [ 461813, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1112 ], [ 461887, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1113 ], [ 461912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1114 ], [ 461929, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1115 ], [ 461945, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1116 ], [ 461958, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1117 ], [ 461975, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1118 ], [ 461976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1119 ], [ 461988, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1120 ], [ 462003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1121 ], [ 462052, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1122 ], [ 462068, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1123 ], [ 462083, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1124 ], [ 462098, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1125 ], [ 462114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1126 ], [ 462129, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1127 ], [ 462157, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1128 ], [ 462237, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1129 ], [ 462285, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1130 ], [ 462302, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1131 ], [ 462318, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1132 ], [ 462331, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1133 ], [ 462348, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1134 ], [ 462349, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1135 ], [ 462361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1136 ], [ 462376, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1137 ], [ 462422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1138 ], [ 462438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1139 ], [ 462453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1140 ], [ 462468, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1141 ], [ 462484, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1142 ], [ 462499, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1143 ], [ 462527, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1144 ], [ 462607, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1145 ], [ 462655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1146 ], [ 462672, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1147 ], [ 462688, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1148 ], [ 462701, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1149 ], [ 462718, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1150 ], [ 462719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1151 ], [ 462731, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1152 ], [ 462746, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1153 ], [ 462777, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1154 ], [ 462793, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1155 ], [ 462808, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1156 ], [ 462823, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1157 ], [ 462839, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1158 ], [ 462854, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1159 ], [ 462882, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1160 ], [ 462959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1161 ], [ 463037, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1162 ], [ 463108, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1163 ], [ 463151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1164 ], [ 463168, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1165 ], [ 463184, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1166 ], [ 463197, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1167 ], [ 463214, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1168 ], [ 463215, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1169 ], [ 463228, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1170 ], [ 463229, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1171 ], [ 463242, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1172 ], [ 463243, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1173 ], [ 463255, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1174 ], [ 463269, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1175 ], [ 463315, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1176 ], [ 463330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1177 ], [ 463351, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1178 ], [ 463361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1179 ], [ 463436, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1180 ], [ 463457, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1181 ], [ 463468, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1182 ], [ 463479, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1183 ], [ 463480, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1184 ], [ 463508, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1185 ], [ 463525, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1186 ], [ 463526, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1187 ], [ 463538, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1188 ], [ 463553, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1189 ], [ 463579, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1190 ], [ 463595, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1191 ], [ 463610, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1192 ], [ 463639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1193 ], [ 463655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1194 ], [ 463670, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1195 ], [ 463698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1196 ], [ 463719, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1197 ], [ 463736, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1198 ], [ 463752, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1199 ], [ 463765, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1200 ], [ 463782, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1201 ], [ 463783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1202 ], [ 463795, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1203 ], [ 463810, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1204 ], [ 463843, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1205 ], [ 463859, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1206 ], [ 463874, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1207 ], [ 463943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1208 ], [ 463959, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1209 ], [ 463974, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1210 ], [ 464002, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1211 ], [ 464070, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1212 ], [ 464151, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1213 ], [ 464227, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1214 ], [ 464247, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1215 ], [ 464264, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1216 ], [ 464280, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1217 ], [ 464293, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1218 ], [ 464310, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1219 ], [ 464311, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1220 ], [ 464323, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1221 ], [ 464338, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1222 ], [ 464373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1223 ], [ 464389, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1224 ], [ 464404, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1225 ], [ 464443, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1226 ], [ 464459, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1227 ], [ 464474, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1228 ], [ 464502, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1229 ], [ 464583, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1230 ], [ 464667, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1231 ], [ 464694, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1232 ], [ 464711, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1233 ], [ 464727, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1234 ], [ 464740, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1235 ], [ 464757, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1236 ], [ 464758, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1237 ], [ 464770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1238 ], [ 464785, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1239 ], [ 464831, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1240 ], [ 464847, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1241 ], [ 464862, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1242 ], [ 464901, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1243 ], [ 464917, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1244 ], [ 464932, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1245 ], [ 464960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1246 ], [ 465040, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1247 ], [ 465113, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1248 ], [ 465189, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1249 ], [ 465268, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1250 ], [ 465297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1251 ], [ 465314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1252 ], [ 465330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1253 ], [ 465343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1254 ], [ 465360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1255 ], [ 465361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1256 ], [ 465374, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1257 ], [ 465387, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1258 ], [ 465388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1259 ], [ 465400, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1260 ], [ 465414, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1261 ], [ 465475, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1262 ], [ 465490, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1263 ], [ 465511, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1264 ], [ 465521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1265 ], [ 465596, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1266 ], [ 465617, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1267 ], [ 465628, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1268 ], [ 465639, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1269 ], [ 465640, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1270 ], [ 465668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1271 ], [ 465685, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1272 ], [ 465686, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1273 ], [ 465698, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1274 ], [ 465713, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1275 ], [ 465739, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1276 ], [ 465755, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1277 ], [ 465770, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1278 ], [ 465799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1279 ], [ 465815, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1280 ], [ 465830, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1281 ], [ 465858, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1282 ], [ 465879, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1283 ], [ 465896, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1284 ], [ 465912, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1285 ], [ 465925, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1286 ], [ 465942, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1287 ], [ 465943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1288 ], [ 465955, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1289 ], [ 465970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1290 ], [ 466001, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1291 ], [ 466017, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1292 ], [ 466032, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1293 ], [ 466096, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1294 ], [ 466112, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1295 ], [ 466127, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1296 ], [ 466155, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1297 ], [ 466216, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1298 ], [ 466297, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1299 ], [ 466314, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1300 ], [ 466330, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1301 ], [ 466343, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1302 ], [ 466360, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1303 ], [ 466361, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1304 ], [ 466373, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1305 ], [ 466388, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1306 ], [ 466422, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1307 ], [ 466438, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1308 ], [ 466453, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1309 ], [ 466518, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1310 ], [ 466534, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1311 ], [ 466549, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1312 ], [ 466577, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1313 ], [ 466646, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1314 ], [ 466723, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1315 ], [ 466797, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1316 ], [ 466872, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1317 ], [ 466943, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1318 ], [ 466960, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1319 ], [ 466976, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1320 ], [ 466989, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1321 ], [ 467006, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1322 ], [ 467007, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1323 ], [ 467019, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1324 ], [ 467034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1325 ], [ 467069, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1326 ], [ 467085, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1327 ], [ 467100, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1328 ], [ 467165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1329 ], [ 467181, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1330 ], [ 467196, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1331 ], [ 467224, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1332 ], [ 467294, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1333 ], [ 467371, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1334 ], [ 467446, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1335 ], [ 467521, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1336 ], [ 467592, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1337 ], [ 467609, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1338 ], [ 467625, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1339 ], [ 467638, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1340 ], [ 467655, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1341 ], [ 467656, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1342 ], [ 467668, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1343 ], [ 467683, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1344 ], [ 467737, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1345 ], [ 467753, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1346 ], [ 467768, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1347 ], [ 467783, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1348 ], [ 467799, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1349 ], [ 467814, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1350 ], [ 467842, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1351 ], [ 467922, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1352 ], [ 467970, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1353 ], [ 467987, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1354 ], [ 468003, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1355 ], [ 468016, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1356 ], [ 468033, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1357 ], [ 468034, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1358 ], [ 468047, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1359 ], [ 468060, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/z-ap\ pA.xml", 1360 ], [ 468072, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 47 ], [ 468113, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 48 ], [ 468114, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 49 ], [ 468152, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 50 ], [ 468164, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 51 ], [ 468165, "/builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/main\ .xml", 52 ] ], labels := rec( AdjacencyMatrix := [ "5.2-1", "chap5_mj.html#X7DC2CD70830BEE60" ], AdjacencyMatrixMutableCopy := [ "5.2-1", "chap5_mj.html#X7DC2CD70830BEE60" ], AdjacencyMatrixUpperTriangleLineDecoder := [ "9.2-10", "chap9_mj.html#X7DF22D1687D096D6" ], ArticulationPoints := [ "5.3-14", "chap5_mj.html#X7DDE06E47E605DD7" ], AsBinaryRelation := [ "3.2-1", "chap3_mj.html#X7FBC4BDB82FBEDD2" ], AsDigraph := [ "3.2-2", "chap3_mj.html#X83CA27E67F685EB3" ], AsGraph := [ "3.2-4", "chap3_mj.html#X7C4F13E080EC16B0" ], AsMonoid := [ "5.5-1", "chap5_mj.html#X87D5C60D7B0C1309" ], ("AsSemigroup (for a filter and a digraph)") := [ "5.5-1", "chap5_mj.html#X87D5C60D7B0C1309" ], ("AsSemigroup (for a filter, semilattice digraph, and two lists)") := [ "5.5-2", "chap5_mj.html#X7C6D5EC27C51066B" ], AsTransformation := [ "3.2-5", "chap3_mj.html#X7C5360B2799943F3" ], ("Attributes and operations") := [ "5", "chap5_mj.html#X8739F6CD78C90B14" ], ("AutomorphismGroup (for a digraph and a homogeneous list)") := [ "7.2-5", "chap7_mj.html#X877732B1783C391B" ], ("AutomorphismGroup (for a digraph)") := [ "7.2-2", "chap7_mj.html#X858C32127A190175" ], ("AutomorphismGroup (for a digraph, homogeneous list, and list)") := [ "7.2-6", "chap7_mj.html#X7DA2C4FE837FFE01" ], BipartiteDoubleDigraph := [ "3.3-37", "chap3_mj.html#X7C6E6CB284982C7A" ], ("BlissAutomorphismGroup (for a digraph and homogenous list)") := [ "7.2-3", "chap7_mj.html#X7E7B0D88865A89F6" ], ("BlissAutomorphismGroup (for a digraph)") := [ "7.2-3", "chap7_mj.html#X7E7B0D88865A89F6" ], ("BlissAutomorphismGroup (for a digraph, homogenous list, and list)") :=\ [ "7.2-3", "chap7_mj.html#X7E7B0D88865A89F6" ], BlissCanonicalDigraph := [ "7.2-9", "chap7_mj.html#X877B1D377EC197D7" ], ("BlissCanonicalLabelling (for a digraph and a list)") := [ "7.2-8", "chap7_mj.html#X87DA265D803DB337" ], ("BlissCanonicalLabelling (for a digraph)") := [ "7.2-7", "chap7_mj.html#X7D676FE67A6684FF" ], BooleanAdjacencyMatrix := [ "5.2-3", "chap5_mj.html#X8507DC4F794780C1" ] , BooleanAdjacencyMatrixMutableCopy := [ "5.2-3", "chap5_mj.html#X8507DC4F794780C1" ], CayleyDigraph := [ "3.1-12", "chap3_mj.html#X7FCADADC7EC28478" ], ChainDigraph := [ "3.5-1", "chap3_mj.html#X870594FC866AC88E" ], CharacteristicPolynomial := [ "5.2-2", "chap5_mj.html#X87FA0A727CDB060B" ], ChromaticNumber := [ "7.3-17", "chap7_mj.html#X807D49358529A37C" ], CliqueNumber := [ "8.1-5", "chap8_mj.html#X78427A8B81FEB457" ], CliquesFinder := [ "8.1-2", "chap8_mj.html#X7A3BC9FF8169ABCD" ], ("Compiling the kernel module") := [ "2.3", "chap2_mj.html#X849F6196875A6DF5" ], CompleteBipartiteDigraph := [ "3.5-3", "chap3_mj.html#X8795B0AD856014FA" ], CompleteDigraph := [ "3.5-2", "chap3_mj.html#X812417E278198D9C" ], CompleteMultipartiteDigraph := [ "3.5-4", "chap3_mj.html#X873F29CC863241F8" ], ("Creating digraphs") := [ "3", "chap3_mj.html#X7D34861E863A5D93" ], CycleDigraph := [ "3.5-5", "chap3_mj.html#X80C29DDE876FFBEB" ], Definitions := [ "1.1-1", "chap1_mj.html#X84541F61810C741D" ], DegreeMatrix := [ "5.2-16", "chap5_mj.html#X7BEAE1C78267F54D" ], DiSparse6String := [ "9.2-3", "chap9_mj.html#X782A052979EA2376" ], Digraph := [ "3.1-7", "chap3_mj.html#X834843057CE86655" ], ("Digraph (for a group, list, function, and function)") := [ "3.1-7", "chap3_mj.html#X834843057CE86655" ], ("Digraph (for a list and function)") := [ "3.1-7", "chap3_mj.html#X834843057CE86655" ], Digraph6String := [ "9.2-3", "chap9_mj.html#X782A052979EA2376" ], DigraphAddAllLoops := [ "3.3-38", "chap3_mj.html#X8167A50A83256ED1" ], DigraphAddAllLoopsAttr := [ "3.3-38", "chap3_mj.html#X8167A50A83256ED1" ], ("DigraphAddEdge (for a digraph and an edge)") := [ "3.3-16", "chap3_mj.html#X7E58CC4880627658" ], ("DigraphAddEdge (for a digraph, source, and range)") := [ "3.3-16", "chap3_mj.html#X7E58CC4880627658" ], DigraphAddEdgeOrbit := [ "3.3-17", "chap3_mj.html#X7BE5C7028760B053" ], DigraphAddEdges := [ "3.3-18", "chap3_mj.html#X8693A61B7F752C76" ], DigraphAddVertex := [ "3.3-14", "chap3_mj.html#X83B2506D79453208" ], ("DigraphAddVertices (for a digraph and a list of labels)") := [ "3.3-15", "chap3_mj.html#X8134BEE7786BD3A7" ], ("DigraphAddVertices (for a digraph and an integer)") := [ "3.3-15", "chap3_mj.html#X8134BEE7786BD3A7" ], DigraphAdjacencyFunction := [ "5.2-4", "chap5_mj.html#X7AFCE34A7A04D5C1" ], DigraphAllSimpleCircuits := [ "5.3-21", "chap5_mj.html#X7ECD16838704FAAA" ], DigraphBicomponents := [ "5.3-13", "chap5_mj.html#X7F1B5A2782F598B1" ], DigraphByAdjacencyMatrix := [ "3.1-8", "chap3_mj.html#X8023FE387A3AB609" ], DigraphByEdges := [ "3.1-9", "chap3_mj.html#X7F37B6768349E269" ], DigraphByInNeighbors := [ "3.1-11", "chap3_mj.html#X81BC49B57EAADEFB" ], DigraphByInNeighbours := [ "3.1-11", "chap3_mj.html#X81BC49B57EAADEFB" ] , DigraphByOutNeighboursType := [ "3.1-6", "chap3_mj.html#X86E798B779515678" ], ("DigraphCartesianProduct (for a list of digraphs)") := [ "3.3-30", "chap3_mj.html#X7D625CC87DBFFDED" ], ("DigraphCartesianProduct (for a positive number of digraphs)") := [ "3.3-30", "chap3_mj.html#X7D625CC87DBFFDED" ], DigraphCartesianProductProjections := [ "3.3-32", "chap3_mj.html#X8795087A78FE7D54" ], DigraphClique := [ "8.1-3", "chap8_mj.html#X789854AC7B466402" ], DigraphCliques := [ "8.1-4", "chap8_mj.html#X84EA2F9482B8D4AF" ], DigraphCliquesReps := [ "8.1-4", "chap8_mj.html#X84EA2F9482B8D4AF" ], DigraphClosure := [ "3.3-40", "chap3_mj.html#X86F9CCEA839ABC48" ], ("DigraphColouring (for a digraph and a number of colours)") := [ "7.3-14", "chap7_mj.html#X86D0A74B83D6B9A7" ], DigraphConnectedComponent := [ "5.3-10", "chap5_mj.html#X8484EC557810CD31" ], DigraphConnectedComponents := [ "5.3-9", "chap5_mj.html#X842FAD6A7B835977" ], DigraphCopy := [ "3.3-1", "chap3_mj.html#X83D93A8A8251E6F9" ], DigraphCopySameMutability := [ "3.3-1", "chap3_mj.html#X83D93A8A8251E6F9" ], DigraphCore := [ "7.3-18", "chap7_mj.html#X863487EF7D64EF56" ], DigraphDegeneracy := [ "5.3-24", "chap5_mj.html#X7B2E42327DA118E0" ], DigraphDegeneracyOrdering := [ "5.3-25", "chap5_mj.html#X827C2BD17A4547E3" ], DigraphDiameter := [ "5.3-1", "chap5_mj.html#X7F16B9EB8398459C" ], ("DigraphDijkstra (for a source and target)") := [ "5.3-28", "chap5_mj.html#X79352A8286D1D8F6" ], ("DigraphDijkstra (for a source)") := [ "5.3-28", "chap5_mj.html#X79352A8286D1D8F6" ], ("DigraphDirectProduct (for a list of digraphs)") := [ "3.3-31", "chap3_mj.html#X84D24DC9833B54A5" ], ("DigraphDirectProduct (for a positive number of digraphs)") := [ "3.3-31", "chap3_mj.html#X84D24DC9833B54A5" ], DigraphDirectProductProjections := [ "3.3-33", "chap3_mj.html#X84FB64F185B804C2" ], ("DigraphDisjointUnion (for a list of digraphs)") := [ "3.3-27", "chap3_mj.html#X814F1DFC83DB273F" ], ("DigraphDisjointUnion (for an\n arbitrary number of digraphs)") := [ "3.3-27", "chap3_mj.html#X814F1DFC83DB273F" ], ("DigraphDistanceSet (for a digraph, a pos int, and a list)") := [ "5.3-5", "chap5_mj.html#X7CB7DDCD84621D38" ], ("DigraphDistanceSet (for a digraph, a pos int, and an int)") := [ "5.3-5", "chap5_mj.html#X7CB7DDCD84621D38" ], DigraphDual := [ "3.3-10", "chap3_mj.html#X7F71D99D852B130F" ], DigraphDualAttr := [ "3.3-10", "chap3_mj.html#X7F71D99D852B130F" ], DigraphEdgeLabel := [ "5.1-10", "chap5_mj.html#X79FAEACC7F438C2F" ], DigraphEdgeLabels := [ "5.1-11", "chap5_mj.html#X7C24851087D4A8FB" ], ("DigraphEdgeUnion (for a list of digraphs)") := [ "3.3-28", "chap3_mj.html#X7DA997697D310E44" ], ("DigraphEdgeUnion (for a positive number of digraphs)") := [ "3.3-28", "chap3_mj.html#X7DA997697D310E44" ], DigraphEdges := [ "5.1-3", "chap5_mj.html#X7D1C6A4D7ECEC317" ], DigraphEmbedding := [ "7.3-8", "chap7_mj.html#X7AD04CC186E86CCA" ], DigraphEpimorphism := [ "7.3-6", "chap7_mj.html#X7CB5AD9F861684FD" ], DigraphFamily := [ "3.1-6", "chap3_mj.html#X86E798B779515678" ], DigraphFile := [ "9.2-4", "chap9_mj.html#X7845ACDA7D4D333D" ], DigraphFloydWarshall := [ "5.3-16", "chap5_mj.html#X864A31A8809F61C2" ], DigraphFromDiSparse6String := [ "9.2-2", "chap9_mj.html#X873D6EB8836A3C61" ], DigraphFromDigraph6String := [ "9.2-2", "chap9_mj.html#X873D6EB8836A3C61" ], DigraphFromGraph6String := [ "9.2-2", "chap9_mj.html#X873D6EB8836A3C61" ], DigraphFromPlainTextString := [ "9.2-12", "chap9_mj.html#X8540FC21796A793F" ], DigraphFromSparse6String := [ "9.2-2", "chap9_mj.html#X873D6EB8836A3C61" ], DigraphGirth := [ "5.3-6", "chap5_mj.html#X79A3DA4078CF3C90" ], ("DigraphGreedyColouring (for a digraph and vertex order function)") := [ "7.3-15", "chap7_mj.html#X7AB7200D831013C1" ], ("DigraphGreedyColouring (for a digraph and vertex order)") := [ "7.3-15", "chap7_mj.html#X7AB7200D831013C1" ], ("DigraphGreedyColouring (for a digraph)") := [ "7.3-15", "chap7_mj.html#X7AB7200D831013C1" ], DigraphGroup := [ "7.2-10", "chap7_mj.html#X803ACEDA7BBAC5B3" ], DigraphHasLoops := [ "6.1-1", "chap6_mj.html#X7D92935C7D535187" ], DigraphHomomorphism := [ "7.3-2", "chap7_mj.html#X85E9B019877AD7FE" ], DigraphImmutableCopy := [ "3.3-1", "chap3_mj.html#X83D93A8A8251E6F9" ], DigraphImmutableCopyIfImmutable := [ "3.3-2", "chap3_mj.html#X8399F7427B227228" ], DigraphImmutableCopyIfMutable := [ "3.3-2", "chap3_mj.html#X8399F7427B227228" ], DigraphInEdges := [ "5.1-12", "chap5_mj.html#X7EFAF01B7A155157" ], DigraphIndependentSet := [ "8.2-2", "chap8_mj.html#X84350678782BFAB7" ], DigraphIndependentSets := [ "8.2-3", "chap8_mj.html#X7D2C78EB81A798A9" ] , DigraphIndependentSetsReps := [ "8.2-3", "chap8_mj.html#X7D2C78EB81A798A9" ], ("DigraphJoin (for a list of digraphs)") := [ "3.3-29", "chap3_mj.html#X7DDFC759860E3390" ], ("DigraphJoin (for a positive number of digraphs)") := [ "3.3-29", "chap3_mj.html#X7DDFC759860E3390" ], DigraphLayers := [ "5.3-23", "chap5_mj.html#X870E04307C5F213F" ], DigraphLongestDistanceFromVertex := [ "5.3-4", "chap5_mj.html#X8223718079D98A82" ], DigraphLongestSimpleCircuit := [ "5.3-22", "chap5_mj.html#X7C735C4E86BDD5F6" ], DigraphLoops := [ "5.2-14", "chap5_mj.html#X83271F607BD809CF" ], DigraphMaximalClique := [ "8.1-3", "chap8_mj.html#X789854AC7B466402" ], DigraphMaximalCliques := [ "8.1-4", "chap8_mj.html#X84EA2F9482B8D4AF" ], DigraphMaximalCliquesAttr := [ "8.1-4", "chap8_mj.html#X84EA2F9482B8D4AF" ], DigraphMaximalCliquesReps := [ "8.1-4", "chap8_mj.html#X84EA2F9482B8D4AF" ], DigraphMaximalCliquesRepsAttr := [ "8.1-4", "chap8_mj.html#X84EA2F9482B8D4AF" ], DigraphMaximalIndependentSet := [ "8.2-2", "chap8_mj.html#X84350678782BFAB7" ], DigraphMaximalIndependentSets := [ "8.2-3", "chap8_mj.html#X7D2C78EB81A798A9" ], DigraphMaximalIndependentSetsAttr := [ "8.2-3", "chap8_mj.html#X7D2C78EB81A798A9" ], DigraphMaximalIndependentSetsReps := [ "8.2-3", "chap8_mj.html#X7D2C78EB81A798A9" ], DigraphMaximalIndependentSetsRepsAttr := [ "8.2-3", "chap8_mj.html#X7D2C78EB81A798A9" ], DigraphMaximalMatching := [ "5.1-16", "chap5_mj.html#X7B7A67277B1C9A02" ], DigraphMaximumMatching := [ "5.1-17", "chap5_mj.html#X78E9847A858788D1" ], DigraphMonomorphism := [ "7.3-4", "chap7_mj.html#X82D0FCD87D47ACA8" ], DigraphMutableCopy := [ "3.3-1", "chap3_mj.html#X83D93A8A8251E6F9" ], DigraphMutableCopyIfImmutable := [ "3.3-2", "chap3_mj.html#X8399F7427B227228" ], DigraphMutableCopyIfMutable := [ "3.3-2", "chap3_mj.html#X8399F7427B227228" ], DigraphMycielskian := [ "3.3-41", "chap3_mj.html#X7B5AC5FE859F4D80" ], DigraphMycielskianAttr := [ "3.3-41", "chap3_mj.html#X7B5AC5FE859F4D80" ], DigraphNrConnectedComponents := [ "5.3-9", "chap5_mj.html#X842FAD6A7B835977" ], DigraphNrEdges := [ "5.1-4", "chap5_mj.html#X85E1CFDD7E164AD0" ], DigraphNrStronglyConnectedComponents := [ "5.3-11", "chap5_mj.html#X833ECD6B7A84944C" ], DigraphNrVertices := [ "5.1-2", "chap5_mj.html#X7C6F19B57CB2E882" ], DigraphOddGirth := [ "5.3-7", "chap5_mj.html#X8374B7357EC189C1" ], DigraphOrbitReps := [ "7.2-12", "chap7_mj.html#X8386028782F2D3FF" ], DigraphOrbits := [ "7.2-11", "chap7_mj.html#X8096C5287E459279" ], DigraphOutEdges := [ "5.1-13", "chap5_mj.html#X7BECFE6687ECD028" ], DigraphPath := [ "5.3-18", "chap5_mj.html#X8039170B82A32257" ], DigraphPeriod := [ "5.3-15", "chap5_mj.html#X853D0B0981A33433" ], DigraphPlainTextLineDecoder := [ "9.2-8", "chap9_mj.html#X7AAA35867B5D8BF4" ], DigraphPlainTextLineEncoder := [ "9.2-8", "chap9_mj.html#X7AAA35867B5D8BF4" ], DigraphRange := [ "5.2-5", "chap5_mj.html#X7FDEBF3279759961" ], DigraphReflexiveTransitiveClosure := [ "3.3-12", "chap3_mj.html#X7A6C419080AD41DE" ], DigraphReflexiveTransitiveClosureAttr := [ "3.3-12", "chap3_mj.html#X7A6C419080AD41DE" ], DigraphReflexiveTransitiveReduction := [ "3.3-13", "chap3_mj.html#X82AD17517E273600" ], DigraphReflexiveTransitiveReductionAttr := [ "3.3-13", "chap3_mj.html#X82AD17517E273600" ], DigraphRemoveAllMultipleEdges := [ "3.3-25", "chap3_mj.html#X7DCCD0247897A3DE" ], DigraphRemoveAllMultipleEdgesAttr := [ "3.3-25", "chap3_mj.html#X7DCCD0247897A3DE" ], ("DigraphRemoveEdge (for a digraph and an edge)") := [ "3.3-21", "chap3_mj.html#X8433E3BC7E5EA6BF" ], ("DigraphRemoveEdge (for a digraph, source, and range)") := [ "3.3-21", "chap3_mj.html#X8433E3BC7E5EA6BF" ], DigraphRemoveEdgeOrbit := [ "3.3-22", "chap3_mj.html#X85981D9187F49018" ], DigraphRemoveEdges := [ "3.3-23", "chap3_mj.html#X87093FDA7F88E732" ], DigraphRemoveLoops := [ "3.3-24", "chap3_mj.html#X79324AF7818C0C02" ], DigraphRemoveLoopsAttr := [ "3.3-24", "chap3_mj.html#X79324AF7818C0C02" ], DigraphRemoveVertex := [ "3.3-19", "chap3_mj.html#X7B634A2B83C08B16" ], DigraphRemoveVertices := [ "3.3-20", "chap3_mj.html#X7E290E847A5A299A" ] , DigraphReverse := [ "3.3-9", "chap3_mj.html#X78DECD26811EFD7C" ], DigraphReverseAttr := [ "3.3-9", "chap3_mj.html#X78DECD26811EFD7C" ], ("DigraphReverseEdge (for a digraph and an edge)") := [ "3.3-26", "chap3_mj.html#X7821753D85402A8C" ], ("DigraphReverseEdge (for a digraph, source, and range)") := [ "3.3-26", "chap3_mj.html#X7821753D85402A8C" ], ("DigraphReverseEdges (for a digraph and a list of edges)") := [ "3.3-26", "chap3_mj.html#X7821753D85402A8C" ], DigraphSchreierVector := [ "7.2-13", "chap7_mj.html#X8657604E87A25E5F" ] , ("DigraphShortestDistance (for a digraph and a list)") := [ "5.3-2", "chap5_mj.html#X8104A9D37BCD8A05" ], ("DigraphShortestDistance (for a digraph and two vertices)") := [ "5.3-2", "chap5_mj.html#X8104A9D37BCD8A05" ], ("DigraphShortestDistance (for a digraph, a list, and a list)") := [ "5.3-2", "chap5_mj.html#X8104A9D37BCD8A05" ], DigraphShortestDistances := [ "5.3-3", "chap5_mj.html#X81F99BC67E9D050F" ], DigraphShortestPath := [ "5.3-19", "chap5_mj.html#X80E9D645843973A6" ], DigraphSinks := [ "5.1-5", "chap5_mj.html#X85D5E08280914EE4" ], DigraphSource := [ "5.2-5", "chap5_mj.html#X7FDEBF3279759961" ], DigraphSources := [ "5.1-6", "chap5_mj.html#X7F5C6268839BE98C" ], DigraphStabilizer := [ "7.2-14", "chap7_mj.html#X78913684795FB256" ], DigraphStronglyConnectedComponent := [ "5.3-12", "chap5_mj.html#X7EFCB5017D662254" ], DigraphStronglyConnectedComponents := [ "5.3-11", "chap5_mj.html#X833ECD6B7A84944C" ], DigraphSymmetricClosure := [ "3.3-11", "chap3_mj.html#X874883DD7DD450C4" ], DigraphSymmetricClosureAttr := [ "3.3-11", "chap3_mj.html#X874883DD7DD450C4" ], DigraphTopologicalSort := [ "5.1-7", "chap5_mj.html#X785C30378064CF47" ] , DigraphTransitiveClosure := [ "3.3-12", "chap3_mj.html#X7A6C419080AD41DE" ], DigraphTransitiveClosureAttr := [ "3.3-12", "chap3_mj.html#X7A6C419080AD41DE" ], DigraphTransitiveReduction := [ "3.3-13", "chap3_mj.html#X82AD17517E273600" ], DigraphTransitiveReductionAttr := [ "3.3-13", "chap3_mj.html#X82AD17517E273600" ], DigraphUndirectedGirth := [ "5.3-8", "chap5_mj.html#X84688B337BDDBB09" ] , DigraphVertexLabel := [ "5.1-8", "chap5_mj.html#X7CA91E4B7904F793" ] , DigraphVertexLabels := [ "5.1-9", "chap5_mj.html#X7E51F2FE87140B32" ], DigraphVertices := [ "5.1-1", "chap5_mj.html#X7C45F7D878D896AC" ], DigraphWelshPowellOrder := [ "7.3-16", "chap7_mj.html#X7F9CB3B27B9590DB" ], DigraphsMakeDoc := [ "2.4-1", "chap2_mj.html#X870631C38610AC25" ], DigraphsRespectsColouring := [ "7.3-12", "chap7_mj.html#X7F80709A80CBFA98" ], DigraphsTestExtreme := [ "2.5-3", "chap2_mj.html#X7885EF3E785D4298" ], DigraphsTestInstall := [ "2.5-1", "chap2_mj.html#X86AF4DAE80B978DA" ], DigraphsTestStandard := [ "2.5-2", "chap2_mj.html#X7A20088B7C406C4A" ], DigraphsUseBliss := [ "7.2-1", "chap7_mj.html#X83E593F3855B122E" ], DigraphsUseNauty := [ "7.2-1", "chap7_mj.html#X83E593F3855B122E" ], ("DistanceDigraph (for digraph and int)") := [ "3.3-39", "chap3_mj.html#X865436437DF95FEF" ], ("DistanceDigraph (for digraph and list)") := [ "3.3-39", "chap3_mj.html#X865436437DF95FEF" ], DotDigraph := [ "9.1-2", "chap9_mj.html#X7F9B99C478EE093A" ], DotHighlightedDigraph := [ "9.1-6", "chap9_mj.html#X808D12CF81E2C19F" ], DotPartialOrderDigraph := [ "9.1-4", "chap9_mj.html#X84120D447E2CAC23" ] , DotPreorderDigraph := [ "9.1-5", "chap9_mj.html#X7F5653C8854FAEA6" ] , DotQuasiorderDigraph := [ "9.1-5", "chap9_mj.html#X7F5653C8854FAEA6" ], DotSymmetricDigraph := [ "9.1-3", "chap9_mj.html#X78DA31D1869D2F94" ], DotVertexLabelledDigraph := [ "9.1-2", "chap9_mj.html#X7F9B99C478EE093A" ], DoubleDigraph := [ "3.3-36", "chap3_mj.html#X7FB8B48C87C0ED16" ], EdgeDigraph := [ "3.3-34", "chap3_mj.html#X8595BF937B749F22" ], EdgeOrbitsDigraph := [ "3.1-10", "chap3_mj.html#X7B75C1D680757D6F" ], EdgeUndirectedDigraph := [ "3.3-35", "chap3_mj.html#X8364C6F17A1680CB" ] , EmbeddingsDigraphs := [ "7.3-9", "chap7_mj.html#X82EBDF137EEDC5FD" ] , EmbeddingsDigraphsRepresentatives := [ "7.3-9", "chap7_mj.html#X82EBDF137EEDC5FD" ], EmptyDigraph := [ "3.5-6", "chap3_mj.html#X80DAE31A79FEFD40" ], EpimorphismsDigraphs := [ "7.3-7", "chap7_mj.html#X7DFB1F5D873937B3" ], EpimorphismsDigraphsRepresentatives := [ "7.3-7", "chap7_mj.html#X7DFB1F5D873937B3" ], ("Finding cliques and independent sets") := [ "8", "chap8_mj.html#X7A7E0B957932DF44" ], ("For those in a hurry") := [ "2.1", "chap2_mj.html#X7DA3059C79842BF3" ] , GeneralisedPetersenGraph := [ "3.5-9", "chap3_mj.html#X7B5441F386BD105E" ], GeneratorsOfCayleyDigraph := [ "5.4-2", "chap5_mj.html#X8528455987D7D2BF" ], GeneratorsOfEndomorphismMonoid := [ "7.3-13", "chap7_mj.html#X7E93B268823F6478" ], GeneratorsOfEndomorphismMonoidAttr := [ "7.3-13", "chap7_mj.html#X7E93B268823F6478" ], Graph := [ "3.2-3", "chap3_mj.html#X7B335342839E5146" ], Graph6String := [ "9.2-3", "chap9_mj.html#X782A052979EA2376" ], GroupOfCayleyDigraph := [ "5.4-1", "chap5_mj.html#X7A000B1D7CCF7093" ], HamiltonianPath := [ "5.3-26", "chap5_mj.html#X863FDFC4839A3B82" ], HomomorphismDigraphsFinder := [ "7.3-1", "chap7_mj.html#X79ABF0E783FD67C7" ], Homomorphisms := [ "7", "chap7_mj.html#X84975388859F203D" ], HomomorphismsDigraphs := [ "7.3-3", "chap7_mj.html#X8653EDA183E06D05" ], HomomorphismsDigraphsRepresentatives := [ "7.3-3", "chap7_mj.html#X8653EDA183E06D05" ], InDegreeOfVertex := [ "5.2-12", "chap5_mj.html#X7C9CD0527CB9E6EF" ], InDegreeSequence := [ "5.2-9", "chap5_mj.html#X7ADDFBFD7A365775" ], InDegreeSet := [ "5.2-9", "chap5_mj.html#X7ADDFBFD7A365775" ], InDegrees := [ "5.2-9", "chap5_mj.html#X7ADDFBFD7A365775" ], InNeighbors := [ "5.2-7", "chap5_mj.html#X85C7AA5A81DA6E11" ], InNeighborsMutableCopy := [ "5.2-7", "chap5_mj.html#X85C7AA5A81DA6E11" ] , InNeighborsOfVertex := [ "5.2-13", "chap5_mj.html#X7C0DA18B8291F302" ], InNeighbours := [ "5.2-7", "chap5_mj.html#X85C7AA5A81DA6E11" ], InNeighboursMutableCopy := [ "5.2-7", "chap5_mj.html#X85C7AA5A81DA6E11" ], InNeighboursOfVertex := [ "5.2-13", "chap5_mj.html#X7C0DA18B8291F302" ], InducedSubdigraph := [ "3.3-3", "chap3_mj.html#X83C51DA182CCEA2F" ], ("Installing Digraphs") := [ "2", "chap2_mj.html#X817088B27F90D596" ], IsAcyclicDigraph := [ "6.3-1", "chap6_mj.html#X7BD08D4478218F77" ], IsAntiSymmetricDigraph := [ "6.1-2", "chap6_mj.html#X7DB1BC2286FC08E2" ] , IsAntisymmetricDigraph := [ "6.1-2", "chap6_mj.html#X7DB1BC2286FC08E2" ] , IsAperiodicDigraph := [ "6.3-6", "chap6_mj.html#X80E883967EBE839E" ] , IsBiconnectedDigraph := [ "6.3-4", "chap6_mj.html#X838FAF2D825977BE" ], IsBipartiteDigraph := [ "6.1-3", "chap6_mj.html#X860CFB0C8665F356" ], IsCayleyDigraph := [ "3.1-4", "chap3_mj.html#X7E749324800B38A5" ], IsChainDigraph := [ "6.3-2", "chap6_mj.html#X79563B297C220FB5" ], IsClique := [ "8.1-1", "chap8_mj.html#X80670E3E7C36183F" ], IsCompleteBipartiteDigraph := [ "6.1-4", "chap6_mj.html#X790A4DBF8533516E" ], IsCompleteDigraph := [ "6.1-5", "chap6_mj.html#X81F28D4D879FE3B2" ], IsCompleteMultipartiteDigraph := [ "6.1-6", "chap6_mj.html#X7FD1A15779FEC341" ], IsConnectedDigraph := [ "6.3-3", "chap6_mj.html#X83C08C0B7EC1A91F" ], IsCycleDigraph := [ "6.3-11", "chap6_mj.html#X7E91320B8028F5D8" ], IsDigraph := [ "3.1-1", "chap3_mj.html#X7877ADC77F85E630" ], IsDigraphAutomorphism := [ "7.2-20", "chap7_mj.html#X80183D4A7C51365A" ] , ("IsDigraphAutomorphism (for a digraph and a transformation or permutati\ on)") := [ "7.2-20", "chap7_mj.html#X80183D4A7C51365A" ], IsDigraphColouring := [ "7.2-21", "chap7_mj.html#X7F16B8B3825A627A" ], ("IsDigraphColouring (for a transformation)") := [ "7.2-21", "chap7_mj.html#X7F16B8B3825A627A" ], IsDigraphCore := [ "6.5-1", "chap6_mj.html#X78C0B2637985648B" ], ("IsDigraphEdge (for digraph and list)") := [ "5.1-14", "chap5_mj.html#X7BB8ED88835F07B4" ], ("IsDigraphEdge (for digraph and two pos ints)") := [ "5.1-14", "chap5_mj.html#X7BB8ED88835F07B4" ], IsDigraphEmbedding := [ "7.3-11", "chap7_mj.html#X7D6B5A0887903810" ], ("IsDigraphEmbedding (for digraphs and a permutation or transformation)"\ ) := [ "7.3-11", "chap7_mj.html#X7D6B5A0887903810" ], IsDigraphEndomorphism := [ "7.3-10", "chap7_mj.html#X80FE9FCB79718A61" ] , ("IsDigraphEndomorphism (for digraphs and a permutation or transformatio\ n)") := [ "7.3-10", "chap7_mj.html#X80FE9FCB79718A61" ], IsDigraphEpimorphism := [ "7.3-10", "chap7_mj.html#X80FE9FCB79718A61" ], ("IsDigraphEpimorphism (for digraphs and a permutation or transformation\ )") := [ "7.3-10", "chap7_mj.html#X80FE9FCB79718A61" ], IsDigraphHomomorphism := [ "7.3-10", "chap7_mj.html#X80FE9FCB79718A61" ] , ("IsDigraphHomomorphism (for digraphs and a permutation or transformatio\ n)") := [ "7.3-10", "chap7_mj.html#X80FE9FCB79718A61" ], IsDigraphIsomorphism := [ "7.2-20", "chap7_mj.html#X80183D4A7C51365A" ], ("IsDigraphIsomorphism (for digraphs and transformation or permutation)"\ ) := [ "7.2-20", "chap7_mj.html#X80183D4A7C51365A" ], IsDigraphMonomorphism := [ "7.3-10", "chap7_mj.html#X80FE9FCB79718A61" ] , ("IsDigraphMonomorphism (for digraphs and a permutation or transformatio\ n)") := [ "7.3-10", "chap7_mj.html#X80FE9FCB79718A61" ], IsDigraphWithAdjacencyFunction := [ "3.1-5", "chap3_mj.html#X80F1B6D28478D8B9" ], IsDirectedTree := [ "6.3-7", "chap6_mj.html#X7B46EA6C7B2DF2FB" ], IsDistanceRegularDigraph := [ "6.2-4", "chap6_mj.html#X7E2082AC7CAE59CD" ], IsEdgeTransitive := [ "6.5-2", "chap6_mj.html#X8361CA6E8401FF26" ], IsEmptyDigraph := [ "6.1-7", "chap6_mj.html#X7E894CCF7B1C27AE" ], IsEquivalenceDigraph := [ "6.1-8", "chap6_mj.html#X83762C257DED2751" ], IsEulerianDigraph := [ "6.3-9", "chap6_mj.html#X79DFBB198525544E" ], IsFunctionalDigraph := [ "6.1-9", "chap6_mj.html#X7E8F37E585DAED52" ], IsHamiltonianDigraph := [ "6.3-10", "chap6_mj.html#X79EFEBC37C2D262D" ], IsImmutableDigraph := [ "3.1-3", "chap3_mj.html#X7CAFAA89804F80BD" ], IsInRegularDigraph := [ "6.2-1", "chap6_mj.html#X7A3F78B37E31D9E1" ], IsIndependentSet := [ "8.2-1", "chap8_mj.html#X790733B67B0BC894" ], ("IsIsomorphicDigraph (for digraphs and homogeneous lists)") := [ "7.2-16", "chap7_mj.html#X7D4A1FA8868DA930" ], ("IsIsomorphicDigraph (for digraphs)") := [ "7.2-15", "chap7_mj.html#X7B4F24B283C9EE28" ], IsJoinSemilatticeDigraph := [ "6.1-17", "chap6_mj.html#X78D3E17B7F737516" ], IsLatticeDigraph := [ "6.1-17", "chap6_mj.html#X78D3E17B7F737516" ], IsMatching := [ "5.1-15", "chap5_mj.html#X848FED0B7B4ACD1F" ], IsMaximalClique := [ "8.1-1", "chap8_mj.html#X80670E3E7C36183F" ], IsMaximalIndependentSet := [ "8.2-1", "chap8_mj.html#X790733B67B0BC894" ], IsMaximalMatching := [ "5.1-15", "chap5_mj.html#X848FED0B7B4ACD1F" ], IsMaximumMatching := [ "5.1-15", "chap5_mj.html#X848FED0B7B4ACD1F" ], IsMeetSemilatticeDigraph := [ "6.1-17", "chap6_mj.html#X78D3E17B7F737516" ], IsMultiDigraph := [ "6.1-10", "chap6_mj.html#X7BB84CFC7E8B2B26" ], IsMutableDigraph := [ "3.1-2", "chap3_mj.html#X7D7EDF83820ED6F5" ], IsNullDigraph := [ "6.1-7", "chap6_mj.html#X7E894CCF7B1C27AE" ], IsOutRegularDigraph := [ "6.2-2", "chap6_mj.html#X7F0A806E7BCB413C" ], IsOuterPlanarDigraph := [ "6.4-2", "chap6_mj.html#X8251E8B187E7F059" ], IsPartialOrderDigraph := [ "6.1-16", "chap6_mj.html#X82BAE6D37D49A145" ] , IsPerfectMatching := [ "5.1-15", "chap5_mj.html#X848FED0B7B4ACD1F" ] , IsPlanarDigraph := [ "6.4-1", "chap6_mj.html#X8606D415858C40AA" ], IsPreorderDigraph := [ "6.1-15", "chap6_mj.html#X8617726C7829F796" ], IsQuasiorderDigraph := [ "6.1-15", "chap6_mj.html#X8617726C7829F796" ], IsReachable := [ "5.3-17", "chap5_mj.html#X7FBAB09E7C0BE5CF" ], IsReflexiveDigraph := [ "6.1-11", "chap6_mj.html#X8462D8E2792B23F6" ], IsRegularDigraph := [ "6.2-3", "chap6_mj.html#X7AF9DB1E7DB12306" ], IsStronglyConnectedDigraph := [ "6.3-5", "chap6_mj.html#X7B37B9467C68C208" ], IsSubdigraph := [ "4.1-1", "chap4_mj.html#X829B911D7EFD2D85" ], IsSymmetricDigraph := [ "6.1-12", "chap6_mj.html#X81B3EA7887219860" ], IsTournament := [ "6.1-13", "chap6_mj.html#X7DD8D1A185EBE865" ], IsTransitiveDigraph := [ "6.1-14", "chap6_mj.html#X7F0835667F29F0C0" ], IsUndirectedForest := [ "6.3-8", "chap6_mj.html#X80FC20FA7AC4BC2A" ], IsUndirectedSpanningForest := [ "4.1-2", "chap4_mj.html#X833C3299787E2309" ], IsUndirectedSpanningTree := [ "4.1-2", "chap4_mj.html#X833C3299787E2309" ], IsUndirectedTree := [ "6.3-8", "chap6_mj.html#X80FC20FA7AC4BC2A" ], IsVertexTransitive := [ "6.5-3", "chap6_mj.html#X7B26E4447A1611E9" ], ("IsomorphismDigraphs (for digraphs and homogeneous lists)") := [ "7.2-18", "chap7_mj.html#X7ED93C0F86D9D34F" ], ("IsomorphismDigraphs (for digraphs)") := [ "7.2-17", "chap7_mj.html#X8219FE6C839D9457" ], ("Isomorphisms and canonical labellings") := [ "7.2", "chap7_mj.html#X7E48B9F87A0F22D4" ], IteratorFromDigraphFile := [ "9.2-7", "chap9_mj.html#X86D531B287733561" ], IteratorOfPaths := [ "5.3-20", "chap5_mj.html#X7C0416FE7A69CA2C" ] , JohnsonDigraph := [ "3.5-7", "chap3_mj.html#X80ED9CE785819607" ], KuratowskiOuterPlanarSubdigraph := [ "5.6-2", "chap5_mj.html#X78E8F09A8286501B" ], KuratowskiPlanarSubdigraph := [ "5.6-1", "chap5_mj.html#X7DC478637E8C190D" ], LaplacianMatrix := [ "5.2-17", "chap5_mj.html#X865390B08331936B" ], LineDigraph := [ "3.3-34", "chap3_mj.html#X8595BF937B749F22" ], LineUndirectedDigraph := [ "3.3-35", "chap3_mj.html#X8364C6F17A1680CB" ] , MaximalAntiSymmetricSubdigraph := [ "3.3-6", "chap3_mj.html#X79BA6A66846D5A95" ], MaximalAntiSymmetricSubdigraphAttr := [ "3.3-6", "chap3_mj.html#X79BA6A66846D5A95" ], MaximalSymmetricSubdigraph := [ "3.3-5", "chap3_mj.html#X829E3EAC7C4B3B1E" ], MaximalSymmetricSubdigraphAttr := [ "3.3-5", "chap3_mj.html#X829E3EAC7C4B3B1E" ], MaximalSymmetricSubdigraphWithoutLoops := [ "3.3-5", "chap3_mj.html#X829E3EAC7C4B3B1E" ], MaximalSymmetricSubdigraphWithoutLoopsAttr := [ "3.3-5", "chap3_mj.html#X829E3EAC7C4B3B1E" ], MonomorphismsDigraphs := [ "7.3-5", "chap7_mj.html#X84B4BDB984C2A9A8" ], MonomorphismsDigraphsRepresentatives := [ "7.3-5", "chap7_mj.html#X84B4BDB984C2A9A8" ], NautyAutomorphismGroup := [ "7.2-4", "chap7_mj.html#X857758B18144C0CD" ] , NautyCanonicalDigraph := [ "7.2-9", "chap7_mj.html#X877B1D377EC197D7" ], ("NautyCanonicalLabelling (for a digraph and a list)") := [ "7.2-8", "chap7_mj.html#X87DA265D803DB337" ], ("NautyCanonicalLabelling (for a digraph)") := [ "7.2-7", "chap7_mj.html#X7D676FE67A6684FF" ], NrSpanningTrees := [ "5.3-27", "chap5_mj.html#X82F30D5681466BC6" ], NullDigraph := [ "3.5-6", "chap3_mj.html#X80DAE31A79FEFD40" ], ("OnDigraphs (for a digraph and a perm)") := [ "7.1-1", "chap7_mj.html#X808972017C486F1F" ], ("OnDigraphs (for a digraph and a transformation)") := [ "7.1-1", "chap7_mj.html#X808972017C486F1F" ], OnMultiDigraphs := [ "7.1-2", "chap7_mj.html#X7AFBA7608498F9CE" ], ("OnMultiDigraphs (for a digraph, perm, and perm)") := [ "7.1-2", "chap7_mj.html#X7AFBA7608498F9CE" ], Operators := [ "4", "chap4_mj.html#X7AD6F77E7D95C996" ], ("Optional package dependencies") := [ "2.2", "chap2_mj.html#X780AA9D97EBCA95D" ], OutDegreeOfVertex := [ "5.2-10", "chap5_mj.html#X7A09EB648070276D" ], OutDegreeSequence := [ "5.2-8", "chap5_mj.html#X7F5ACE807D1BC2E2" ], OutDegreeSet := [ "5.2-8", "chap5_mj.html#X7F5ACE807D1BC2E2" ], OutDegrees := [ "5.2-8", "chap5_mj.html#X7F5ACE807D1BC2E2" ], OutNeighbors := [ "5.2-6", "chap5_mj.html#X7E9880767AE68E00" ], OutNeighborsMutableCopy := [ "5.2-6", "chap5_mj.html#X7E9880767AE68E00" ], OutNeighborsOfVertex := [ "5.2-11", "chap5_mj.html#X83315B0186850806" ], OutNeighbours := [ "5.2-6", "chap5_mj.html#X7E9880767AE68E00" ], OutNeighboursMutableCopy := [ "5.2-6", "chap5_mj.html#X7E9880767AE68E00" ], OutNeighboursOfVertex := [ "5.2-11", "chap5_mj.html#X83315B0186850806" ] , OuterPlanarEmbedding := [ "5.6-4", "chap5_mj.html#X85DFB8C18088711F" ], PartialOrderDigraphJoinOfVertices := [ "5.2-15", "chap5_mj.html#X7DDB33B686B3A2C6" ], PartialOrderDigraphMeetOfVertices := [ "5.2-15", "chap5_mj.html#X7DDB33B686B3A2C6" ], PetersenGraph := [ "3.5-8", "chap3_mj.html#X823F43217A6C375D" ], PlainTextString := [ "9.2-12", "chap9_mj.html#X8540FC21796A793F" ], PlanarEmbedding := [ "5.6-3", "chap5_mj.html#X84E3947E7D39BA64" ], PrintString := [ "9.2-1", "chap9_mj.html#X81FB5BE27903EC32" ], ("Properties of digraphs") := [ "6", "chap6_mj.html#X7ADDEFD478D470D5" ] , QuotientDigraph := [ "3.3-8", "chap3_mj.html#X7D1D26D27F5B56C2" ], RandomDigraph := [ "3.4-1", "chap3_mj.html#X86CF9F66788B2A24" ], RandomLattice := [ "3.4-4", "chap3_mj.html#X7A023E4787682475" ], RandomMultiDigraph := [ "3.4-2", "chap3_mj.html#X78FE275E7E77D56F" ], RandomTournament := [ "3.4-3", "chap3_mj.html#X7D36B5E57F055051" ], ReadDIMACSDigraph := [ "9.2-14", "chap9_mj.html#X804FDF6A7ED64049" ], ReadDigraphs := [ "9.2-5", "chap9_mj.html#X7E8142007ED0CB9F" ], ReadPlainTextDigraph := [ "9.2-13", "chap9_mj.html#X81BD23697857B244" ], ("Rebuilding the documentation") := [ "2.4", "chap2_mj.html#X857CBE5484CF703A" ], ReducedDigraph := [ "3.3-4", "chap3_mj.html#X7CAF093B85A93D2F" ], ReducedDigraphAttr := [ "3.3-4", "chap3_mj.html#X7CAF093B85A93D2F" ], RepresentativeOutNeighbours := [ "7.2-19", "chap7_mj.html#X7E1C806D81DFE15E" ], SemigroupOfCayleyDigraph := [ "5.4-1", "chap5_mj.html#X7A000B1D7CCF7093" ], SetDigraphEdgeLabel := [ "5.1-10", "chap5_mj.html#X79FAEACC7F438C2F" ], ("SetDigraphEdgeLabels (for a digraph and a function)") := [ "5.1-11", "chap5_mj.html#X7C24851087D4A8FB" ], ("SetDigraphEdgeLabels (for a digraph and a list of lists)") := [ "5.1-11", "chap5_mj.html#X7C24851087D4A8FB" ], SetDigraphVertexLabel := [ "5.1-8", "chap5_mj.html#X7CA91E4B7904F793" ], SetDigraphVertexLabels := [ "5.1-9", "chap5_mj.html#X7E51F2FE87140B32" ] , Sparse6String := [ "9.2-3", "chap9_mj.html#X782A052979EA2376" ], Splash := [ "9.1-1", "chap9_mj.html#X83B3318784E78415" ], String := [ "9.2-1", "chap9_mj.html#X81FB5BE27903EC32" ], SubdigraphHomeomorphicToK23 := [ "5.6-5", "chap5_mj.html#X806D2D6B85E0B269" ], SubdigraphHomeomorphicToK33 := [ "5.6-5", "chap5_mj.html#X806D2D6B85E0B269" ], SubdigraphHomeomorphicToK4 := [ "5.6-5", "chap5_mj.html#X806D2D6B85E0B269" ], TCodeDecoder := [ "9.2-11", "chap9_mj.html#X875393338486D77D" ], ("Testing your installation") := [ "2.5", "chap2_mj.html#X7862D3F37C5BBDEF" ], ("The Digraphs package") := [ "1", "chap1_mj.html#X7F202ABA780E595D" ], ("The Grape package") := [ "2.2-1", "chap2_mj.html#X8493C7587FCF6D8B" ], TournamentLineDecoder := [ "9.2-9", "chap9_mj.html#X7808D99079295C22" ], UndirectedSpanningForest := [ "3.3-7", "chap3_mj.html#X7DD9766C86D3ED20" ], UndirectedSpanningForestAttr := [ "3.3-7", "chap3_mj.html#X7DD9766C86D3ED20" ], UndirectedSpanningTree := [ "3.3-7", "chap3_mj.html#X7DD9766C86D3ED20" ] , UndirectedSpanningTreeAttr := [ "3.3-7", "chap3_mj.html#X7DD9766C86D3ED20" ], ("Visualising and IO") := [ "9", "chap9_mj.html#X81714DBC80CC4BCB" ], WriteDIMACSDigraph := [ "9.2-14", "chap9_mj.html#X804FDF6A7ED64049" ], WriteDigraphs := [ "9.2-6", "chap9_mj.html#X82A4F0767C9EFC87" ], WritePlainTextDigraph := [ "9.2-13", "chap9_mj.html#X81BD23697857B244" ] ), labeltexts := rec( ("Attributes and operations") := "Attributes and\ operations", ("Compiling the kernel module") := "Compiling th\ e kernel module", ("Creating digraphs") := "Creating digraphs", Definitions := "Definitions", ("Finding cliques and independent sets") := "Fin\ ding cliques and independent sets", ("For those in a hurry") := "For those in a hurr\ y", Homomorphisms := "Homomorphisms", ("Installing Digraphs") := "Installing Digraphs", ("Isomorphisms and canonical labellings") := "Is\ omorphisms and canonical labellings", Operators := "Operators", ("Optional package dependencies") := "Optional p\ ackage dependencies", ("Properties of digraphs") := "Properties of dig\ raphs", ("Rebuilding the documentation") := "Rebuilding \ the documentation", ("Testing your installation") := "Testing your i\ nstallation", ("The Digraphs package") := "\n The Digraphs package\n ", ("The Grape package") := "The Grape package", ("Visualising and IO") := "Visualising and IO" ), linelength := 76, mathmode := "MathJax", name := "WHOLEDOCUMENT", next := 468189, root := ~, six := [ [ "Title page", ".", [ 0, 0, 0 ], 1, 1, "title page", "X7D2C85EC87DD46E5" ], [ "Abstract", ".-2", [ 0, 0, 2 ], 56, 2, "abstract", "X7AA6C5737B711C89" ], [ "Copyright", ".-1", [ 0, 0, 1 ], 62, 2, "copyright", "X81488B807F2A1CF1" ], [ "Acknowledgements", ".-3", [ 0, 0, 3 ], 74, 2, "acknowledgements", "X82A988D47DFAFCFA" ], [ "Table of Contents", ".-4", [ 0, 0, 4 ], 81, 3, "table of contents", "X8537FEB07AF2BEC8" ], [ "\033[1X\033[33X\033[0;-2YThe \033[5XDigraphs\033[105X\033[101X\027\\ 033[1X\027 package\033[133X\033[101X", "1", [ 1, 0, 0 ], 1, 5, "the digraphs package", "X7F202ABA780E595D" ], [ "\033[1X\033[33X\033[0;-2YIntroduction\033[133X\033[101X", "1.1", [ 1, 1, 0 ], 4, 5, "introduction", "X7DFB63A97E67C0A1" ], [ "\033[1X\033[33X\033[0;-2YDefinitions\033[133X\033[101X", "1.1-1", [ 1, 1, 1 ], 75, 6, "definitions", "X84541F61810C741D" ], [ "\033[1X\033[33X\033[0;-2YInstalling \033[5XDigraphs\033[105X\033[101X\\ 027\033[1X\027\033[133X\033[101X", "2", [ 2, 0, 0 ], 1, 7, "installing digraphs", "X817088B27F90D596" ], [ "\033[1X\033[33X\033[0;-2YFor those in a hurry\033[133X\033[101X", "2.1", [ 2, 1, 0 ], 4, 7, "for those in a hurry", "X7DA3059C79842BF3" ], [ "\033[1X\033[33X\033[0;-2YOptional package dependencies\033[133X\033[10\ 1X", "2.2", [ 2, 2, 0 ], 69, 8, "optional package dependencies", "X780AA9D97EBCA95D" ], [ "\033[1X\033[33X\033[0;-2YThe Grape package\033[133X\033[101X", "2.2-1", [ 2, 2, 1 ], 76, 8, "the grape package", "X8493C7587FCF6D8B" ], [ "\033[1X\033[33X\033[0;-2YCompiling the kernel module\033[133X\033[101X\ ", "2.3", [ 2, 3, 0 ], 91, 8, "compiling the kernel module", "X849F6196875A6DF5" ], [ "\033[1X\033[33X\033[0;-2YRebuilding the documentation\033[133X\033[101\ X", "2.4", [ 2, 4, 0 ], 125, 9, "rebuilding the documentation", "X857CBE5484CF703A" ], [ "\033[1X\033[33X\033[0;-2YTesting your installation\033[133X\033[101X" , "2.5", [ 2, 5, 0 ], 141, 9, "testing your installation", "X7862D3F37C5BBDEF" ], [ "\033[1X\033[33X\033[0;-2YCreating digraphs\033[133X\033[101X", "3", [ 3, 0, 0 ], 1, 11, "creating digraphs", "X7D34861E863A5D93" ], [ "\033[1X\033[33X\033[0;-2YCreating digraphs\033[133X\033[101X", "3.1", [ 3, 1, 0 ], 6, 11, "creating digraphs", "X7D34861E863A5D93" ], [ "\033[1X\033[33X\033[0;-2YChanging representations\033[133X\033[101X", "3.2", [ 3, 2, 0 ], 371, 17, "changing representations", "X83608C407CC8836D" ], [ "\033[1X\033[33X\033[0;-2YNew digraphs from old\033[133X\033[101X", "3.3", [ 3, 3, 0 ], 517, 20, "new digraphs from old", "X85126078848B420A" ], [ "\033[1X\033[33X\033[0;-2YRandom digraphs\033[133X\033[101X", "3.4", [ 3, 4, 0 ], 2055, 45, "random digraphs", "X85B5D9B97F5187B7" ], [ "\033[1X\033[33X\033[0;-2YStandard examples\033[133X\033[101X", "3.5", [ 3, 5, 0 ], 2155, 47, "standard examples", "X7C76D1DC7DAF03D3" ], [ "\033[1X\033[33X\033[0;-2YOperators\033[133X\033[101X", "4", [ 4, 0, 0 ], 1, 51, "operators", "X7AD6F77E7D95C996" ], [ "\033[1X\033[33X\033[0;-2YOperators for digraphs\033[133X\033[101X", "4.1", [ 4, 1, 0 ], 4, 51, "operators for digraphs", "X84E0B5B88358C96B" ], [ "\033[1X\033[33X\033[0;-2YAttributes and operations\033[133X\033[101X" , "5", [ 5, 0, 0 ], 1, 54, "attributes and operations", "X8739F6CD78C90B14" ], [ "\033[1X\033[33X\033[0;-2YVertices and edges\033[133X\033[101X", "5.1", [ 5, 1, 0 ], 4, 54, "vertices and edges", "X7E814B6478F7D015" ], [ "\033[1X\033[33X\033[0;-2YNeighbours and degree\033[133X\033[101X", "5.2", [ 5, 2, 0 ], 537, 63, "neighbours and degree", "X7D7CE8328187D0DF" ], [ "\033[1X\033[33X\033[0;-2YReachability and connectivity\033[133X\033[10\ 1X", "5.3", [ 5, 3, 0 ], 1097, 73, "reachability and connectivity", "X8537F4088400DC48" ], [ "\033[1X\033[33X\033[0;-2YCayley graphs of groups\033[133X\033[101X", "5.4", [ 5, 4, 0 ], 2073, 89, "cayley graphs of groups", "X82F900777D677F55" ], [ "\033[1X\033[33X\033[0;-2YAssociated semigroups\033[133X\033[101X", "5.5", [ 5, 5, 0 ], 2124, 90, "associated semigroups", "X790FD6647ECCAE3C" ], [ "\033[1X\033[33X\033[0;-2YPlanarity\033[133X\033[101X", "5.6", [ 5, 6, 0 ], 2212, 91, "planarity", "X7E2305528492DDC0" ], [ "\033[1X\033[33X\033[0;-2YProperties of digraphs\033[133X\033[101X", "6", [ 6, 0, 0 ], 1, 97, "properties of digraphs", "X7ADDEFD478D470D5" ], [ "\033[1X\033[33X\033[0;-2YEdge properties\033[133X\033[101X", "6.1", [ 6, 1, 0 ], 4, 97, "edge properties", "X7F49388F8245F0E9" ], [ "\033[1X\033[33X\033[0;-2YRegularity\033[133X\033[101X", "6.2", [ 6, 2, 0 ], 561, 106, "regularity", "X7AAF896982EC22FA" ], [ "\033[1X\033[33X\033[0;-2YConnectivity and cycles\033[133X\033[101X", "6.3", [ 6, 3, 0 ], 658, 108, "connectivity and cycles", "X780DAEB37C5E07FD" ], [ "\033[1X\033[33X\033[0;-2YPlanarity\033[133X\033[101X", "6.4", [ 6, 4, 0 ], 1064, 114, "planarity", "X7E2305528492DDC0" ], [ "\033[1X\033[33X\033[0;-2YHomomorphisms and transformations\033[133X\\ 033[101X", "6.5", [ 6, 5, 0 ], 1153, 116, "homomorphisms and transformations", "X83DC8AD283C41326" ], [ "\033[1X\033[33X\033[0;-2YHomomorphisms\033[133X\033[101X", "7", [ 7, 0, 0 ], 1, 118, "homomorphisms", "X84975388859F203D" ], [ "\033[1X\033[33X\033[0;-2YActing on digraphs\033[133X\033[101X", "7.1", [ 7, 1, 0 ], 4, 118, "acting on digraphs", "X8200192B80AD2071" ], [ "\033[1X\033[33X\033[0;-2YIsomorphisms and canonical labellings\033[133\ X\033[101X", "7.2", [ 7, 2, 0 ], 88, 119, "isomorphisms and canonical labellings", "X7E48B9F87A0F22D4" ], [ "\033[1X\033[33X\033[0;-2YHomomorphisms of digraphs\033[133X\033[101X" , "7.3", [ 7, 3, 0 ], 1019, 135, "homomorphisms of digraphs", "X7E1A02FE8384C03C" ], [ "\033[1X\033[33X\033[0;-2YFinding cliques and independent sets\033[133X\ \033[101X", "8", [ 8, 0, 0 ], 1, 147, "finding cliques and independent sets", "X7A7E0B957932DF44" ], [ "\033[1X\033[33X\033[0;-2YFinding cliques\033[133X\033[101X", "8.1", [ 8, 1, 0 ], 72, 148, "finding cliques", "X788474E38446039B" ], [ "\033[1X\033[33X\033[0;-2YFinding independent sets\033[133X\033[101X", "8.2", [ 8, 2, 0 ], 416, 154, "finding independent sets", "X7E31253287708348" ], [ "\033[1X\033[33X\033[0;-2YVisualising and IO\033[133X\033[101X", "9", [ 9, 0, 0 ], 1, 158, "visualising and io", "X81714DBC80CC4BCB" ], [ "\033[1X\033[33X\033[0;-2YVisualising a digraph\033[133X\033[101X", "9.1", [ 9, 1, 0 ], 4, 158, "visualising a digraph", "X7CF67F8278D9469C" ], [ "\033[1X\033[33X\033[0;-2YReading and writing digraphs to a file\033[13\ 3X\033[101X", "9.2", [ 9, 2, 0 ], 224, 161, "reading and writing digraphs to a file", "X81C9B1DC791C0BBD" ], [ "\033[1X\033[33X\033[0;-2YGrape to Digraphs Command Map\033[133X\033[10\ 1X", "A", [ "A", 0, 0 ], 1, 173, "grape to digraphs command map", "X800DAF137BA8E25B" ], [ "\033[1X\033[33X\033[0;-2YFunctions to construct and modify graphs\033[\ 133X\033[101X", "A.1", [ "A", 1, 0 ], 7, 173, "functions to construct and modify graphs", "X7CC8A9DB86F9F0F4" ], [ "\033[1X\033[33X\033[0;-2YFunctions to inspect graphs, vertices and ed\ ges\033[133X\033[101X", "A.2", [ "A", 2, 0 ], 35, 173, "functions to inspect graphs vertices and edges", "X7C38A6397D2770FB" ], [ "\033[1X\033[33X\033[0;-2YFunctions to determine regularity properties \ of graphs\033[133X\033[101X", "A.3", [ "A", 3, 0 ], 87, 174, "functions to determine regularity properties of graphs", "X78A5A34783C70CD7" ], [ "\033[1X\033[33X\033[0;-2YSome special vertex subsets of a graph\033[13\ 3X\033[101X", "A.4", [ "A", 4, 0 ], 111, 174, "some special vertex subsets of a graph", "X7C74978D85F7AF5C" ], [ "\033[1X\033[33X\033[0;-2YFunctions to construct new graphs from old\\ 033[133X\033[101X", "A.5", [ "A", 5, 0 ], 133, 175, "functions to construct new graphs from old", "X7E51B92F7E89E266" ], [ "\033[1X\033[33X\033[0;-2YVertex-Colouring and Complete Subgraphs\033[\ 133X\033[101X", "A.6", [ "A", 6, 0 ], 171, 175, "vertex-colouring and complete subgraphs", "X7A61E3FC7A2BB50E" ], [ "\033[1X\033[33X\033[0;-2YAutomorphism groups and isomorphism testing f\ or graphs\033[133X\033[101X", "A.7", [ "A", 7, 0 ], 187, 175, "automorphism groups and isomorphism testing for graphs", "X7DFC61EC7CBDBC7E" ], [ "Bibliography", "Bib", [ "Bib", 0, 0 ], 1, 176, "bibliography", "X7A6F98FD85F02BFE" ], [ "References", "Bib", [ "Bib", 0, 0 ], 1, 176, "references", "X7A6F98FD85F02BFE" ], [ "Index", "Ind", [ "Ind", 0, 0 ], 1, 177, "index", "X83A0356F839C696F" ], [ "\033[5XDigraphs\033[105X package overview", "1.", [ 1, 0, 0 ], 1, 5, "digraphs package overview", "X7F202ABA780E595D" ], [ "\033[2XDigraphsMakeDoc\033[102X", "2.4-1", [ 2, 4, 1 ], 133, 9, "digraphsmakedoc", "X870631C38610AC25" ], [ "\033[2XDigraphsTestInstall\033[102X", "2.5-1", [ 2, 5, 1 ], 155, 9, "digraphstestinstall", "X86AF4DAE80B978DA" ], [ "\033[2XDigraphsTestStandard\033[102X", "2.5-2", [ 2, 5, 2 ], 165, 9, "digraphsteststandard", "X7A20088B7C406C4A" ], [ "\033[2XDigraphsTestExtreme\033[102X", "2.5-3", [ 2, 5, 3 ], 177, 9, "digraphstestextreme", "X7885EF3E785D4298" ], [ "\033[2XIsDigraph\033[102X", "3.1-1", [ 3, 1, 1 ], 9, 11, "isdigraph", "X7877ADC77F85E630" ], [ "\033[2XIsMutableDigraph\033[102X", "3.1-2", [ 3, 1, 2 ], 17, 11, "ismutabledigraph", "X7D7EDF83820ED6F5" ], [ "\033[2XIsImmutableDigraph\033[102X", "3.1-3", [ 3, 1, 3 ], 29, 11, "isimmutabledigraph", "X7CAFAA89804F80BD" ], [ "\033[2XIsCayleyDigraph\033[102X", "3.1-4", [ 3, 1, 4 ], 45, 12, "iscayleydigraph", "X7E749324800B38A5" ], [ "\033[2XIsDigraphWithAdjacencyFunction\033[102X", "3.1-5", [ 3, 1, 5 ], 53, 12, "isdigraphwithadjacencyfunction", "X80F1B6D28478D8B9" ], [ "\033[2XDigraphByOutNeighboursType\033[102X", "3.1-6", [ 3, 1, 6 ], 60, 12, "digraphbyoutneighbourstype", "X86E798B779515678" ], [ "\033[2XDigraphFamily\033[102X", "3.1-6", [ 3, 1, 6 ], 60, 12, "digraphfamily", "X86E798B779515678" ], [ "\033[2XDigraph\033[102X", "3.1-7", [ 3, 1, 7 ], 68, 12, "digraph", "X834843057CE86655" ], [ "\033[2XDigraph\033[102X for a list and function", "3.1-7", [ 3, 1, 7 ], 68, 12, "digraph for a list and function", "X834843057CE86655" ], [ "\033[2XDigraph\033[102X for a group, list, function, and function", "3.1-7", [ 3, 1, 7 ], 68, 12, "digraph for a group list function and function", "X834843057CE86655" ], [ "\033[2XDigraphByAdjacencyMatrix\033[102X", "3.1-8", [ 3, 1, 8 ], 194, 14, "digraphbyadjacencymatrix", "X8023FE387A3AB609" ], [ "\033[2XDigraphByEdges\033[102X", "3.1-9", [ 3, 1, 9 ], 235, 15, "digraphbyedges", "X7F37B6768349E269" ], [ "\033[2XEdgeOrbitsDigraph\033[102X", "3.1-10", [ 3, 1, 10 ], 272, 15, "edgeorbitsdigraph", "X7B75C1D680757D6F" ], [ "\033[2XDigraphByInNeighbours\033[102X", "3.1-11", [ 3, 1, 11 ], 296, 16, "digraphbyinneighbours", "X81BC49B57EAADEFB" ], [ "\033[2XDigraphByInNeighbors\033[102X", "3.1-11", [ 3, 1, 11 ], 296, 16, "digraphbyinneighbors", "X81BC49B57EAADEFB" ], [ "\033[2XCayleyDigraph\033[102X", "3.1-12", [ 3, 1, 12 ], 333, 16, "cayleydigraph", "X7FCADADC7EC28478" ], [ "\033[2XAsBinaryRelation\033[102X", "3.2-1", [ 3, 2, 1 ], 374, 17, "asbinaryrelation", "X7FBC4BDB82FBEDD2" ], [ "\033[2XAsDigraph\033[102X", "3.2-2", [ 3, 2, 2 ], 391, 17, "asdigraph", "X83CA27E67F685EB3" ], [ "\033[2XGraph\033[102X", "3.2-3", [ 3, 2, 3 ], 433, 18, "graph", "X7B335342839E5146" ], [ "\033[2XAsGraph\033[102X", "3.2-4", [ 3, 2, 4 ], 467, 19, "asgraph", "X7C4F13E080EC16B0" ], [ "\033[2XAsTransformation\033[102X", "3.2-5", [ 3, 2, 5 ], 486, 19, "astransformation", "X7C5360B2799943F3" ], [ "\033[2XDigraphImmutableCopy\033[102X", "3.3-1", [ 3, 3, 1 ], 520, 20, "digraphimmutablecopy", "X83D93A8A8251E6F9" ], [ "\033[2XDigraphMutableCopy\033[102X", "3.3-1", [ 3, 3, 1 ], 520, 20, "digraphmutablecopy", "X83D93A8A8251E6F9" ], [ "\033[2XDigraphCopySameMutability\033[102X", "3.3-1", [ 3, 3, 1 ], 520, 20, "digraphcopysamemutability", "X83D93A8A8251E6F9" ], [ "\033[2XDigraphCopy\033[102X", "3.3-1", [ 3, 3, 1 ], 520, 20, "digraphcopy", "X83D93A8A8251E6F9" ], [ "\033[2XDigraphImmutableCopyIfImmutable\033[102X", "3.3-2", [ 3, 3, 2 ], 544, 20, "digraphimmutablecopyifimmutable", "X8399F7427B227228" ], [ "\033[2XDigraphImmutableCopyIfMutable\033[102X", "3.3-2", [ 3, 3, 2 ], 544, 20, "digraphimmutablecopyifmutable", "X8399F7427B227228" ], [ "\033[2XDigraphMutableCopyIfMutable\033[102X", "3.3-2", [ 3, 3, 2 ], 544, 20, "digraphmutablecopyifmutable", "X8399F7427B227228" ], [ "\033[2XDigraphMutableCopyIfImmutable\033[102X", "3.3-2", [ 3, 3, 2 ], 544, 20, "digraphmutablecopyifimmutable", "X8399F7427B227228" ], [ "\033[2XInducedSubdigraph\033[102X", "3.3-3", [ 3, 3, 3 ], 605, 21, "inducedsubdigraph", "X83C51DA182CCEA2F" ], [ "\033[2XReducedDigraph\033[102X", "3.3-4", [ 3, 3, 4 ], 637, 22, "reduceddigraph", "X7CAF093B85A93D2F" ], [ "\033[2XReducedDigraphAttr\033[102X", "3.3-4", [ 3, 3, 4 ], 637, 22, "reduceddigraphattr", "X7CAF093B85A93D2F" ], [ "\033[2XMaximalSymmetricSubdigraph\033[102X", "3.3-5", [ 3, 3, 5 ], 680, 22, "maximalsymmetricsubdigraph", "X829E3EAC7C4B3B1E" ], [ "\033[2XMaximalSymmetricSubdigraphAttr\033[102X", "3.3-5", [ 3, 3, 5 ], 680, 22, "maximalsymmetricsubdigraphattr", "X829E3EAC7C4B3B1E" ], [ "\033[2XMaximalSymmetricSubdigraphWithoutLoops\033[102X", "3.3-5", [ 3, 3, 5 ], 680, 22, "maximalsymmetricsubdigraphwithoutloops", "X829E3EAC7C4B3B1E" ], [ "\033[2XMaximalSymmetricSubdigraphWithoutLoopsAttr\033[102X", "3.3-5", [ 3, 3, 5 ], 680, 22, "maximalsymmetricsubdigraphwithoutloopsattr", "X829E3EAC7C4B3B1E" ], [ "\033[2XMaximalAntiSymmetricSubdigraph\033[102X", "3.3-6", [ 3, 3, 6 ], 725, 23, "maximalantisymmetricsubdigraph", "X79BA6A66846D5A95" ], [ "\033[2XMaximalAntiSymmetricSubdigraphAttr\033[102X", "3.3-6", [ 3, 3, 6 ], 725, 23, "maximalantisymmetricsubdigraphattr", "X79BA6A66846D5A95" ], [ "\033[2XUndirectedSpanningForest\033[102X", "3.3-7", [ 3, 3, 7 ], 764, 24, "undirectedspanningforest", "X7DD9766C86D3ED20" ], [ "\033[2XUndirectedSpanningForestAttr\033[102X", "3.3-7", [ 3, 3, 7 ], 764, 24, "undirectedspanningforestattr", "X7DD9766C86D3ED20" ], [ "\033[2XUndirectedSpanningTree\033[102X", "3.3-7", [ 3, 3, 7 ], 764, 24, "undirectedspanningtree", "X7DD9766C86D3ED20" ], [ "\033[2XUndirectedSpanningTreeAttr\033[102X", "3.3-7", [ 3, 3, 7 ], 764, 24, "undirectedspanningtreeattr", "X7DD9766C86D3ED20" ], [ "\033[2XQuotientDigraph\033[102X", "3.3-8", [ 3, 3, 8 ], 827, 25, "quotientdigraph", "X7D1D26D27F5B56C2" ], [ "\033[2XDigraphReverse\033[102X", "3.3-9", [ 3, 3, 9 ], 870, 26, "digraphreverse", "X78DECD26811EFD7C" ], [ "\033[2XDigraphReverseAttr\033[102X", "3.3-9", [ 3, 3, 9 ], 870, 26, "digraphreverseattr", "X78DECD26811EFD7C" ], [ "\033[2XDigraphDual\033[102X", "3.3-10", [ 3, 3, 10 ], 907, 26, "digraphdual", "X7F71D99D852B130F" ], [ "\033[2XDigraphDualAttr\033[102X", "3.3-10", [ 3, 3, 10 ], 907, 26, "digraphdualattr", "X7F71D99D852B130F" ], [ "\033[2XDigraphSymmetricClosure\033[102X", "3.3-11", [ 3, 3, 11 ], 935, 27, "digraphsymmetricclosure", "X874883DD7DD450C4" ], [ "\033[2XDigraphSymmetricClosureAttr\033[102X", "3.3-11", [ 3, 3, 11 ], 935, 27, "digraphsymmetricclosureattr", "X874883DD7DD450C4" ], [ "\033[2XDigraphTransitiveClosure\033[102X", "3.3-12", [ 3, 3, 12 ], 976, 27, "digraphtransitiveclosure", "X7A6C419080AD41DE" ], [ "\033[2XDigraphTransitiveClosureAttr\033[102X", "3.3-12", [ 3, 3, 12 ], 976, 27, "digraphtransitiveclosureattr", "X7A6C419080AD41DE" ], [ "\033[2XDigraphReflexiveTransitiveClosure\033[102X", "3.3-12", [ 3, 3, 12 ], 976, 27, "digraphreflexivetransitiveclosure", "X7A6C419080AD41DE" ], [ "\033[2XDigraphReflexiveTransitiveClosureAttr\033[102X", "3.3-12", [ 3, 3, 12 ], 976, 27, "digraphreflexivetransitiveclosureattr", "X7A6C419080AD41DE" ], [ "\033[2XDigraphTransitiveReduction\033[102X", "3.3-13", [ 3, 3, 13 ], 1029, 28, "digraphtransitivereduction", "X82AD17517E273600" ], [ "\033[2XDigraphTransitiveReductionAttr\033[102X", "3.3-13", [ 3, 3, 13 ], 1029, 28, "digraphtransitivereductionattr", "X82AD17517E273600" ], [ "\033[2XDigraphReflexiveTransitiveReduction\033[102X", "3.3-13", [ 3, 3, 13 ], 1029, 28, "digraphreflexivetransitivereduction", "X82AD17517E273600" ], [ "\033[2XDigraphReflexiveTransitiveReductionAttr\033[102X", "3.3-13", [ 3, 3, 13 ], 1029, 28, "digraphreflexivetransitivereductionattr", "X82AD17517E273600" ], [ "\033[2XDigraphAddVertex\033[102X", "3.3-14", [ 3, 3, 14 ], 1085, 29, "digraphaddvertex", "X83B2506D79453208" ], [ "\033[2XDigraphAddVertices\033[102X for a digraph and an integer", "3.3-15", [ 3, 3, 15 ], 1121, 30, "digraphaddvertices for a digraph and an integer", "X8134BEE7786BD3A7" ], [ "\033[2XDigraphAddVertices\033[102X for a digraph and a list of labels" , "3.3-15", [ 3, 3, 15 ], 1121, 30, "digraphaddvertices for a digraph and a list of labels", "X8134BEE7786BD3A7" ], [ "\033[2XDigraphAddEdge\033[102X for a digraph and an edge", "3.3-16", [ 3, 3, 16 ], 1160, 30, "digraphaddedge for a digraph and an edge", "X7E58CC4880627658" ], [ "\033[2XDigraphAddEdge\033[102X for a digraph, source, and range", "3.3-16", [ 3, 3, 16 ], 1160, 30, "digraphaddedge for a digraph source and range", "X7E58CC4880627658" ], [ "\033[2XDigraphAddEdgeOrbit\033[102X", "3.3-17", [ 3, 3, 17 ], 1197, 31, "digraphaddedgeorbit", "X7BE5C7028760B053" ], [ "\033[2XDigraphAddEdges\033[102X", "3.3-18", [ 3, 3, 18 ], 1233, 32, "digraphaddedges", "X8693A61B7F752C76" ], [ "\033[2XDigraphRemoveVertex\033[102X", "3.3-19", [ 3, 3, 19 ], 1275, 32, "digraphremovevertex", "X7B634A2B83C08B16" ], [ "\033[2XDigraphRemoveVertices\033[102X", "3.3-20", [ 3, 3, 20 ], 1315, 33, "digraphremovevertices", "X7E290E847A5A299A" ], [ "\033[2XDigraphRemoveEdge\033[102X for a digraph and an edge", "3.3-21", [ 3, 3, 21 ], 1351, 34, "digraphremoveedge for a digraph and an edge", "X8433E3BC7E5EA6BF" ] , [ "\033[2XDigraphRemoveEdge\033[102X for a digraph, source, and range", "3.3-21", [ 3, 3, 21 ], 1351, 34, "digraphremoveedge for a digraph source and range", "X8433E3BC7E5EA6BF" ], [ "\033[2XDigraphRemoveEdgeOrbit\033[102X", "3.3-22", [ 3, 3, 22 ], 1386, 34, "digraphremoveedgeorbit", "X85981D9187F49018" ], [ "\033[2XDigraphRemoveEdges\033[102X", "3.3-23", [ 3, 3, 23 ], 1422, 35, "digraphremoveedges", "X87093FDA7F88E732" ], [ "\033[2XDigraphRemoveLoops\033[102X", "3.3-24", [ 3, 3, 24 ], 1459, 35, "digraphremoveloops", "X79324AF7818C0C02" ], [ "\033[2XDigraphRemoveLoopsAttr\033[102X", "3.3-24", [ 3, 3, 24 ], 1459, 35, "digraphremoveloopsattr", "X79324AF7818C0C02" ], [ "\033[2XDigraphRemoveAllMultipleEdges\033[102X", "3.3-25", [ 3, 3, 25 ], 1485, 36, "digraphremoveallmultipleedges", "X7DCCD0247897A3DE" ], [ "\033[2XDigraphRemoveAllMultipleEdgesAttr\033[102X", "3.3-25", [ 3, 3, 25 ], 1485, 36, "digraphremoveallmultipleedgesattr", "X7DCCD0247897A3DE" ], [ "\033[2XDigraphReverseEdges\033[102X for a digraph and a list of edges" , "3.3-26", [ 3, 3, 26 ], 1514, 36, "digraphreverseedges for a digraph and a list of edges", "X7821753D85402A8C" ], [ "\033[2XDigraphReverseEdge\033[102X for a digraph and an edge", "3.3-26", [ 3, 3, 26 ], 1514, 36, "digraphreverseedge for a digraph and an edge", "X7821753D85402A8C" ], [ "\033[2XDigraphReverseEdge\033[102X for a digraph, source, and range", "3.3-26", [ 3, 3, 26 ], 1514, 36, "digraphreverseedge for a digraph source and range", "X7821753D85402A8C" ], [ "\033[2XDigraphDisjointUnion\033[102X for an\n arbitrary number of d\ igraphs", "3.3-27", [ 3, 3, 27 ], 1556, 37, "digraphdisjointunion for an arbitrary number of digraphs", "X814F1DFC83DB273F" ], [ "\033[2XDigraphDisjointUnion\033[102X for a list of digraphs", "3.3-27", [ 3, 3, 27 ], 1556, 37, "digraphdisjointunion for a list of digraphs", "X814F1DFC83DB273F" ] , [ "\033[2XDigraphEdgeUnion\033[102X for a positive number of digraphs", "3.3-28", [ 3, 3, 28 ], 1600, 38, "digraphedgeunion for a positive number of digraphs", "X7DA997697D310E44" ], [ "\033[2XDigraphEdgeUnion\033[102X for a list of digraphs", "3.3-28", [ 3, 3, 28 ], 1600, 38, "digraphedgeunion for a list of digraphs", "X7DA997697D310E44" ], [ "\033[2XDigraphJoin\033[102X for a positive number of digraphs", "3.3-29", [ 3, 3, 29 ], 1643, 38, "digraphjoin for a positive number of digraphs", "X7DDFC759860E3390" ], [ "\033[2XDigraphJoin\033[102X for a list of digraphs", "3.3-29", [ 3, 3, 29 ], 1643, 38, "digraphjoin for a list of digraphs", "X7DDFC759860E3390" ], [ "\033[2XDigraphCartesianProduct\033[102X for a positive number of digra\ phs", "3.3-30", [ 3, 3, 30 ], 1679, 39, "digraphcartesianproduct for a positive number of digraphs", "X7D625CC87DBFFDED" ], [ "\033[2XDigraphCartesianProduct\033[102X for a list of digraphs", "3.3-30", [ 3, 3, 30 ], 1679, 39, "digraphcartesianproduct for a list of digraphs", "X7D625CC87DBFFDED" ], [ "\033[2XDigraphDirectProduct\033[102X for a positive number of digraphs\ ", "3.3-31", [ 3, 3, 31 ], 1725, 40, "digraphdirectproduct for a positive number of digraphs", "X84D24DC9833B54A5" ], [ "\033[2XDigraphDirectProduct\033[102X for a list of digraphs", "3.3-31", [ 3, 3, 31 ], 1725, 40, "digraphdirectproduct for a list of digraphs", "X84D24DC9833B54A5" ] , [ "\033[2XDigraphCartesianProductProjections\033[102X", "3.3-32", [ 3, 3, 32 ], 1770, 40, "digraphcartesianproductprojections", "X8795087A78FE7D54" ], [ "\033[2XDigraphDirectProductProjections\033[102X", "3.3-33", [ 3, 3, 33 ], 1806, 41, "digraphdirectproductprojections", "X84FB64F185B804C2" ], [ "\033[2XLineDigraph\033[102X", "3.3-34", [ 3, 3, 34 ], 1842, 42, "linedigraph", "X8595BF937B749F22" ], [ "\033[2XEdgeDigraph\033[102X", "3.3-34", [ 3, 3, 34 ], 1842, 42, "edgedigraph", "X8595BF937B749F22" ], [ "\033[2XLineUndirectedDigraph\033[102X", "3.3-35", [ 3, 3, 35 ], 1863, 42, "lineundirecteddigraph", "X8364C6F17A1680CB" ], [ "\033[2XEdgeUndirectedDigraph\033[102X", "3.3-35", [ 3, 3, 35 ], 1863, 42, "edgeundirecteddigraph", "X8364C6F17A1680CB" ], [ "\033[2XDoubleDigraph\033[102X", "3.3-36", [ 3, 3, 36 ], 1884, 42, "doubledigraph", "X7FB8B48C87C0ED16" ], [ "\033[2XBipartiteDoubleDigraph\033[102X", "3.3-37", [ 3, 3, 37 ], 1906, 43, "bipartitedoubledigraph", "X7C6E6CB284982C7A" ], [ "\033[2XDigraphAddAllLoops\033[102X", "3.3-38", [ 3, 3, 38 ], 1929, 43, "digraphaddallloops", "X8167A50A83256ED1" ], [ "\033[2XDigraphAddAllLoopsAttr\033[102X", "3.3-38", [ 3, 3, 38 ], 1929, 43, "digraphaddallloopsattr", "X8167A50A83256ED1" ], [ "\033[2XDistanceDigraph\033[102X for digraph and int", "3.3-39", [ 3, 3, 39 ], 1965, 43, "distancedigraph for digraph and int", "X865436437DF95FEF" ], [ "\033[2XDistanceDigraph\033[102X for digraph and list", "3.3-39", [ 3, 3, 39 ], 1965, 43, "distancedigraph for digraph and list", "X865436437DF95FEF" ], [ "\033[2XDigraphClosure\033[102X", "3.3-40", [ 3, 3, 40 ], 1991, 44, "digraphclosure", "X86F9CCEA839ABC48" ], [ "\033[2XDigraphMycielskian\033[102X", "3.3-41", [ 3, 3, 41 ], 2017, 44, "digraphmycielskian", "X7B5AC5FE859F4D80" ], [ "\033[2XDigraphMycielskianAttr\033[102X", "3.3-41", [ 3, 3, 41 ], 2017, 44, "digraphmycielskianattr", "X7B5AC5FE859F4D80" ], [ "\033[2XRandomDigraph\033[102X", "3.4-1", [ 3, 4, 1 ], 2058, 45, "randomdigraph", "X86CF9F66788B2A24" ], [ "\033[2XRandomMultiDigraph\033[102X", "3.4-2", [ 3, 4, 2 ], 2087, 45, "randommultidigraph", "X78FE275E7E77D56F" ], [ "\033[2XRandomTournament\033[102X", "3.4-3", [ 3, 4, 3 ], 2110, 46, "randomtournament", "X7D36B5E57F055051" ], [ "\033[2XRandomLattice\033[102X", "3.4-4", [ 3, 4, 4 ], 2132, 46, "randomlattice", "X7A023E4787682475" ], [ "\033[2XChainDigraph\033[102X", "3.5-1", [ 3, 5, 1 ], 2158, 47, "chaindigraph", "X870594FC866AC88E" ], [ "\033[2XCompleteDigraph\033[102X", "3.5-2", [ 3, 5, 2 ], 2184, 47, "completedigraph", "X812417E278198D9C" ], [ "\033[2XCompleteBipartiteDigraph\033[102X", "3.5-3", [ 3, 5, 3 ], 2206, 47, "completebipartitedigraph", "X8795B0AD856014FA" ], [ "\033[2XCompleteMultipartiteDigraph\033[102X", "3.5-4", [ 3, 5, 4 ], 2233, 48, "completemultipartitedigraph", "X873F29CC863241F8" ], [ "\033[2XCycleDigraph\033[102X", "3.5-5", [ 3, 5, 5 ], 2257, 48, "cycledigraph", "X80C29DDE876FFBEB" ], [ "\033[2XEmptyDigraph\033[102X", "3.5-6", [ 3, 5, 6 ], 2283, 49, "emptydigraph", "X80DAE31A79FEFD40" ], [ "\033[2XNullDigraph\033[102X", "3.5-6", [ 3, 5, 6 ], 2283, 49, "nulldigraph", "X80DAE31A79FEFD40" ], [ "\033[2XJohnsonDigraph\033[102X", "3.5-7", [ 3, 5, 7 ], 2310, 49, "johnsondigraph", "X80ED9CE785819607" ], [ "\033[2XPetersenGraph\033[102X", "3.5-8", [ 3, 5, 8 ], 2345, 50, "petersengraph", "X823F43217A6C375D" ], [ "\033[2XGeneralisedPetersenGraph\033[102X", "3.5-9", [ 3, 5, 9 ], 2374, 50, "generalisedpetersengraph", "X7B5441F386BD105E" ], [ "\033[10X=\033[110X (for digraphs)", "4.1", [ 4, 1, 0 ], 4, 51, "= for digraphs", "X84E0B5B88358C96B" ], [ "\033[10X<\033[110X (for digraphs)", "4.1", [ 4, 1, 0 ], 4, 51, "< for digraphs", "X84E0B5B88358C96B" ], [ "\033[2XIsSubdigraph\033[102X", "4.1-1", [ 4, 1, 1 ], 28, 51, "issubdigraph", "X829B911D7EFD2D85" ], [ "\033[2XIsUndirectedSpanningTree\033[102X", "4.1-2", [ 4, 1, 2 ], 68, 52, "isundirectedspanningtree", "X833C3299787E2309" ], [ "\033[2XIsUndirectedSpanningForest\033[102X", "4.1-2", [ 4, 1, 2 ], 68, 52, "isundirectedspanningforest", "X833C3299787E2309" ], [ "\033[2XDigraphVertices\033[102X", "5.1-1", [ 5, 1, 1 ], 7, 54, "digraphvertices", "X7C45F7D878D896AC" ], [ "\033[2XDigraphNrVertices\033[102X", "5.1-2", [ 5, 1, 2 ], 38, 54, "digraphnrvertices", "X7C6F19B57CB2E882" ], [ "\033[2XDigraphEdges\033[102X", "5.1-3", [ 5, 1, 3 ], 66, 55, "digraphedges", "X7D1C6A4D7ECEC317" ], [ "\033[2XDigraphNrEdges\033[102X", "5.1-4", [ 5, 1, 4 ], 96, 55, "digraphnredges", "X85E1CFDD7E164AD0" ], [ "\033[2XDigraphSinks\033[102X", "5.1-5", [ 5, 1, 5 ], 120, 56, "digraphsinks", "X85D5E08280914EE4" ], [ "\033[2XDigraphSources\033[102X", "5.1-6", [ 5, 1, 6 ], 139, 56, "digraphsources", "X7F5C6268839BE98C" ], [ "\033[2XDigraphTopologicalSort\033[102X", "5.1-7", [ 5, 1, 7 ], 159, 56, "digraphtopologicalsort", "X785C30378064CF47" ], [ "\033[2XDigraphVertexLabel\033[102X", "5.1-8", [ 5, 1, 8 ], 189, 57, "digraphvertexlabel", "X7CA91E4B7904F793" ], [ "\033[2XSetDigraphVertexLabel\033[102X", "5.1-8", [ 5, 1, 8 ], 189, 57, "setdigraphvertexlabel", "X7CA91E4B7904F793" ], [ "\033[2XDigraphVertexLabels\033[102X", "5.1-9", [ 5, 1, 9 ], 236, 58, "digraphvertexlabels", "X7E51F2FE87140B32" ], [ "\033[2XSetDigraphVertexLabels\033[102X", "5.1-9", [ 5, 1, 9 ], 236, 58, "setdigraphvertexlabels", "X7E51F2FE87140B32" ], [ "\033[2XDigraphEdgeLabel\033[102X", "5.1-10", [ 5, 1, 10 ], 282, 59, "digraphedgelabel", "X79FAEACC7F438C2F" ], [ "\033[2XSetDigraphEdgeLabel\033[102X", "5.1-10", [ 5, 1, 10 ], 282, 59, "setdigraphedgelabel", "X79FAEACC7F438C2F" ], [ "\033[2XDigraphEdgeLabels\033[102X", "5.1-11", [ 5, 1, 11 ], 324, 59, "digraphedgelabels", "X7C24851087D4A8FB" ], [ "\033[2XSetDigraphEdgeLabels\033[102X for a digraph and a list of lists\ ", "5.1-11", [ 5, 1, 11 ], 324, 59, "setdigraphedgelabels for a digraph and a list of lists", "X7C24851087D4A8FB" ], [ "\033[2XSetDigraphEdgeLabels\033[102X for a digraph and a function", "5.1-11", [ 5, 1, 11 ], 324, 59, "setdigraphedgelabels for a digraph and a function", "X7C24851087D4A8FB" ], [ "\033[2XDigraphInEdges\033[102X", "5.1-12", [ 5, 1, 12 ], 376, 60, "digraphinedges", "X7EFAF01B7A155157" ], [ "\033[2XDigraphOutEdges\033[102X", "5.1-13", [ 5, 1, 13 ], 391, 60, "digraphoutedges", "X7BECFE6687ECD028" ], [ "\033[2XIsDigraphEdge\033[102X for digraph and list", "5.1-14", [ 5, 1, 14 ], 406, 61, "isdigraphedge for digraph and list", "X7BB8ED88835F07B4" ], [ "\033[2XIsDigraphEdge\033[102X for digraph and two pos ints", "5.1-14", [ 5, 1, 14 ], 406, 61, "isdigraphedge for digraph and two pos ints", "X7BB8ED88835F07B4" ], [ "\033[2XIsMatching\033[102X", "5.1-15", [ 5, 1, 15 ], 431, 61, "ismatching", "X848FED0B7B4ACD1F" ], [ "\033[2XIsMaximalMatching\033[102X", "5.1-15", [ 5, 1, 15 ], 431, 61, "ismaximalmatching", "X848FED0B7B4ACD1F" ], [ "\033[2XIsMaximumMatching\033[102X", "5.1-15", [ 5, 1, 15 ], 431, 61, "ismaximummatching", "X848FED0B7B4ACD1F" ], [ "\033[2XIsPerfectMatching\033[102X", "5.1-15", [ 5, 1, 15 ], 431, 61, "isperfectmatching", "X848FED0B7B4ACD1F" ], [ "\033[2XDigraphMaximalMatching\033[102X", "5.1-16", [ 5, 1, 16 ], 481, 62, "digraphmaximalmatching", "X7B7A67277B1C9A02" ], [ "\033[2XDigraphMaximumMatching\033[102X", "5.1-17", [ 5, 1, 17 ], 504, 62, "digraphmaximummatching", "X78E9847A858788D1" ], [ "\033[2XAdjacencyMatrix\033[102X", "5.2-1", [ 5, 2, 1 ], 540, 63, "adjacencymatrix", "X7DC2CD70830BEE60" ], [ "\033[2XAdjacencyMatrixMutableCopy\033[102X", "5.2-1", [ 5, 2, 1 ], 540, 63, "adjacencymatrixmutablecopy", "X7DC2CD70830BEE60" ], [ "\033[2XCharacteristicPolynomial\033[102X", "5.2-2", [ 5, 2, 2 ], 582, 64, "characteristicpolynomial", "X87FA0A727CDB060B" ], [ "\033[2XBooleanAdjacencyMatrix\033[102X", "5.2-3", [ 5, 2, 3 ], 611, 64, "booleanadjacencymatrix", "X8507DC4F794780C1" ], [ "\033[2XBooleanAdjacencyMatrixMutableCopy\033[102X", "5.2-3", [ 5, 2, 3 ], 611, 64, "booleanadjacencymatrixmutablecopy", "X8507DC4F794780C1" ], [ "\033[2XDigraphAdjacencyFunction\033[102X", "5.2-4", [ 5, 2, 4 ], 654, 65, "digraphadjacencyfunction", "X7AFCE34A7A04D5C1" ], [ "\033[2XDigraphRange\033[102X", "5.2-5", [ 5, 2, 5 ], 698, 66, "digraphrange", "X7FDEBF3279759961" ], [ "\033[2XDigraphSource\033[102X", "5.2-5", [ 5, 2, 5 ], 698, 66, "digraphsource", "X7FDEBF3279759961" ], [ "\033[2XOutNeighbours\033[102X", "5.2-6", [ 5, 2, 6 ], 728, 66, "outneighbours", "X7E9880767AE68E00" ], [ "\033[2XOutNeighbors\033[102X", "5.2-6", [ 5, 2, 6 ], 728, 66, "outneighbors", "X7E9880767AE68E00" ], [ "\033[2XOutNeighboursMutableCopy\033[102X", "5.2-6", [ 5, 2, 6 ], 728, 66, "outneighboursmutablecopy", "X7E9880767AE68E00" ], [ "\033[2XOutNeighborsMutableCopy\033[102X", "5.2-6", [ 5, 2, 6 ], 728, 66, "outneighborsmutablecopy", "X7E9880767AE68E00" ], [ "\033[2XInNeighbours\033[102X", "5.2-7", [ 5, 2, 7 ], 770, 67, "inneighbours", "X85C7AA5A81DA6E11" ], [ "\033[2XInNeighbors\033[102X", "5.2-7", [ 5, 2, 7 ], 770, 67, "inneighbors", "X85C7AA5A81DA6E11" ], [ "\033[2XInNeighboursMutableCopy\033[102X", "5.2-7", [ 5, 2, 7 ], 770, 67, "inneighboursmutablecopy", "X85C7AA5A81DA6E11" ], [ "\033[2XInNeighborsMutableCopy\033[102X", "5.2-7", [ 5, 2, 7 ], 770, 67, "inneighborsmutablecopy", "X85C7AA5A81DA6E11" ], [ "\033[2XOutDegrees\033[102X", "5.2-8", [ 5, 2, 8 ], 814, 68, "outdegrees", "X7F5ACE807D1BC2E2" ], [ "\033[2XOutDegreeSequence\033[102X", "5.2-8", [ 5, 2, 8 ], 814, 68, "outdegreesequence", "X7F5ACE807D1BC2E2" ], [ "\033[2XOutDegreeSet\033[102X", "5.2-8", [ 5, 2, 8 ], 814, 68, "outdegreeset", "X7F5ACE807D1BC2E2" ], [ "\033[2XInDegrees\033[102X", "5.2-9", [ 5, 2, 9 ], 847, 68, "indegrees", "X7ADDFBFD7A365775" ], [ "\033[2XInDegreeSequence\033[102X", "5.2-9", [ 5, 2, 9 ], 847, 68, "indegreesequence", "X7ADDFBFD7A365775" ], [ "\033[2XInDegreeSet\033[102X", "5.2-9", [ 5, 2, 9 ], 847, 68, "indegreeset", "X7ADDFBFD7A365775" ], [ "\033[2XOutDegreeOfVertex\033[102X", "5.2-10", [ 5, 2, 10 ], 879, 69, "outdegreeofvertex", "X7A09EB648070276D" ], [ "\033[2XOutNeighboursOfVertex\033[102X", "5.2-11", [ 5, 2, 11 ], 902, 69, "outneighboursofvertex", "X83315B0186850806" ], [ "\033[2XOutNeighborsOfVertex\033[102X", "5.2-11", [ 5, 2, 11 ], 902, 69, "outneighborsofvertex", "X83315B0186850806" ], [ "\033[2XInDegreeOfVertex\033[102X", "5.2-12", [ 5, 2, 12 ], 923, 70, "indegreeofvertex", "X7C9CD0527CB9E6EF" ], [ "\033[2XInNeighboursOfVertex\033[102X", "5.2-13", [ 5, 2, 13 ], 946, 70, "inneighboursofvertex", "X7C0DA18B8291F302" ], [ "\033[2XInNeighborsOfVertex\033[102X", "5.2-13", [ 5, 2, 13 ], 946, 70, "inneighborsofvertex", "X7C0DA18B8291F302" ], [ "\033[2XDigraphLoops\033[102X", "5.2-14", [ 5, 2, 14 ], 967, 70, "digraphloops", "X83271F607BD809CF" ], [ "\033[2XPartialOrderDigraphMeetOfVertices\033[102X", "5.2-15", [ 5, 2, 15 ], 993, 71, "partialorderdigraphmeetofvertices", "X7DDB33B686B3A2C6" ], [ "\033[2XPartialOrderDigraphJoinOfVertices\033[102X", "5.2-15", [ 5, 2, 15 ], 993, 71, "partialorderdigraphjoinofvertices", "X7DDB33B686B3A2C6" ], [ "\033[2XDegreeMatrix\033[102X", "5.2-16", [ 5, 2, 16 ], 1030, 71, "degreematrix", "X7BEAE1C78267F54D" ], [ "\033[2XLaplacianMatrix\033[102X", "5.2-17", [ 5, 2, 17 ], 1067, 72, "laplacianmatrix", "X865390B08331936B" ], [ "\033[2XDigraphDiameter\033[102X", "5.3-1", [ 5, 3, 1 ], 1100, 73, "digraphdiameter", "X7F16B9EB8398459C" ], [ "\033[2XDigraphShortestDistance\033[102X for a digraph and two vertices\ ", "5.3-2", [ 5, 3, 2 ], 1131, 73, "digraphshortestdistance for a digraph and two vertices", "X8104A9D37BCD8A05" ], [ "\033[2XDigraphShortestDistance\033[102X for a digraph and a list", "5.3-2", [ 5, 3, 2 ], 1131, 73, "digraphshortestdistance for a digraph and a list", "X8104A9D37BCD8A05" ], [ "\033[2XDigraphShortestDistance\033[102X for a digraph, a list, and a l\ ist", "5.3-2", [ 5, 3, 2 ], 1131, 73, "digraphshortestdistance for a digraph a list and a list", "X8104A9D37BCD8A05" ], [ "\033[2XDigraphShortestDistances\033[102X", "5.3-3", [ 5, 3, 3 ], 1169, 74, "digraphshortestdistances", "X81F99BC67E9D050F" ], [ "\033[2XDigraphLongestDistanceFromVertex\033[102X", "5.3-4", [ 5, 3, 4 ], 1202, 74, "digraphlongestdistancefromvertex", "X8223718079D98A82" ], [ "\033[2XDigraphDistanceSet\033[102X for a digraph, a pos int, and an in\ t", "5.3-5", [ 5, 3, 5 ], 1239, 75, "digraphdistanceset for a digraph a pos int and an int", "X7CB7DDCD84621D38" ], [ "\033[2XDigraphDistanceSet\033[102X for a digraph, a pos int, and a lis\ t", "5.3-5", [ 5, 3, 5 ], 1239, 75, "digraphdistanceset for a digraph a pos int and a list", "X7CB7DDCD84621D38" ], [ "\033[2XDigraphGirth\033[102X", "5.3-6", [ 5, 3, 6 ], 1264, 75, "digraphgirth", "X79A3DA4078CF3C90" ], [ "\033[2XDigraphOddGirth\033[102X", "5.3-7", [ 5, 3, 7 ], 1302, 76, "digraphoddgirth", "X8374B7357EC189C1" ], [ "\033[2XDigraphUndirectedGirth\033[102X", "5.3-8", [ 5, 3, 8 ], 1339, 77, "digraphundirectedgirth", "X84688B337BDDBB09" ], [ "\033[2XDigraphConnectedComponents\033[102X", "5.3-9", [ 5, 3, 9 ], 1373, 77, "digraphconnectedcomponents", "X842FAD6A7B835977" ], [ "\033[2XDigraphNrConnectedComponents\033[102X", "5.3-9", [ 5, 3, 9 ], 1373, 77, "digraphnrconnectedcomponents", "X842FAD6A7B835977" ], [ "\033[2XDigraphConnectedComponent\033[102X", "5.3-10", [ 5, 3, 10 ], 1427, 78, "digraphconnectedcomponent", "X8484EC557810CD31" ], [ "\033[2XDigraphStronglyConnectedComponents\033[102X", "5.3-11", [ 5, 3, 11 ], 1447, 78, "digraphstronglyconnectedcomponents", "X833ECD6B7A84944C" ], [ "\033[2XDigraphNrStronglyConnectedComponents\033[102X", "5.3-11", [ 5, 3, 11 ], 1447, 78, "digraphnrstronglyconnectedcomponents", "X833ECD6B7A84944C" ], [ "\033[2XDigraphStronglyConnectedComponent\033[102X", "5.3-12", [ 5, 3, 12 ], 1497, 79, "digraphstronglyconnectedcomponent", "X7EFCB5017D662254" ], [ "\033[2XDigraphBicomponents\033[102X", "5.3-13", [ 5, 3, 13 ], 1517, 80, "digraphbicomponents", "X7F1B5A2782F598B1" ], [ "\033[2XArticulationPoints\033[102X", "5.3-14", [ 5, 3, 14 ], 1555, 80, "articulationpoints", "X7DDE06E47E605DD7" ], [ "\033[2XDigraphPeriod\033[102X", "5.3-15", [ 5, 3, 15 ], 1592, 81, "digraphperiod", "X853D0B0981A33433" ], [ "\033[2XDigraphFloydWarshall\033[102X", "5.3-16", [ 5, 3, 16 ], 1628, 81, "digraphfloydwarshall", "X864A31A8809F61C2" ], [ "\033[2XIsReachable\033[102X", "5.3-17", [ 5, 3, 17 ], 1684, 82, "isreachable", "X7FBAB09E7C0BE5CF" ], [ "\033[2XDigraphPath\033[102X", "5.3-18", [ 5, 3, 18 ], 1710, 83, "digraphpath", "X8039170B82A32257" ], [ "\033[2XDigraphShortestPath\033[102X", "5.3-19", [ 5, 3, 19 ], 1748, 83, "digraphshortestpath", "X80E9D645843973A6" ], [ "\033[2XIteratorOfPaths\033[102X", "5.3-20", [ 5, 3, 20 ], 1776, 84, "iteratorofpaths", "X7C0416FE7A69CA2C" ], [ "\033[2XDigraphAllSimpleCircuits\033[102X", "5.3-21", [ 5, 3, 21 ], 1810, 84, "digraphallsimplecircuits", "X7ECD16838704FAAA" ], [ "\033[2XDigraphLongestSimpleCircuit\033[102X", "5.3-22", [ 5, 3, 22 ], 1858, 85, "digraphlongestsimplecircuit", "X7C735C4E86BDD5F6" ], [ "\033[2XDigraphLayers\033[102X", "5.3-23", [ 5, 3, 23 ], 1892, 86, "digraphlayers", "X870E04307C5F213F" ], [ "\033[2XDigraphDegeneracy\033[102X", "5.3-24", [ 5, 3, 24 ], 1907, 86, "digraphdegeneracy", "X7B2E42327DA118E0" ], [ "\033[2XDigraphDegeneracyOrdering\033[102X", "5.3-25", [ 5, 3, 25 ], 1940, 86, "digraphdegeneracyordering", "X827C2BD17A4547E3" ], [ "\033[2XHamiltonianPath\033[102X", "5.3-26", [ 5, 3, 26 ], 1974, 87, "hamiltonianpath", "X863FDFC4839A3B82" ], [ "\033[2XNrSpanningTrees\033[102X", "5.3-27", [ 5, 3, 27 ], 2013, 88, "nrspanningtrees", "X82F30D5681466BC6" ], [ "\033[2XDigraphDijkstra\033[102X for a source and target", "5.3-28", [ 5, 3, 28 ], 2040, 88, "digraphdijkstra for a source and target", "X79352A8286D1D8F6" ], [ "\033[2XDigraphDijkstra\033[102X for a source", "5.3-28", [ 5, 3, 28 ], 2040, 88, "digraphdijkstra for a source", "X79352A8286D1D8F6" ], [ "\033[2XGroupOfCayleyDigraph\033[102X", "5.4-1", [ 5, 4, 1 ], 2076, 89, "groupofcayleydigraph", "X7A000B1D7CCF7093" ], [ "\033[2XSemigroupOfCayleyDigraph\033[102X", "5.4-1", [ 5, 4, 1 ], 2076, 89, "semigroupofcayleydigraph", "X7A000B1D7CCF7093" ], [ "\033[2XGeneratorsOfCayleyDigraph\033[102X", "5.4-2", [ 5, 4, 2 ], 2099, 89, "generatorsofcayleydigraph", "X8528455987D7D2BF" ], [ "\033[2XAsSemigroup\033[102X for a filter and a digraph", "5.5-1", [ 5, 5, 1 ], 2127, 90, "assemigroup for a filter and a digraph", "X87D5C60D7B0C1309" ], [ "\033[2XAsMonoid\033[102X", "5.5-1", [ 5, 5, 1 ], 2127, 90, "asmonoid", "X87D5C60D7B0C1309" ], [ "\033[2XAsSemigroup\033[102X for a filter, semilattice digraph, and two\ lists", "5.5-2", [ 5, 5, 2 ], 2174, 90, "assemigroup for a filter semilattice digraph and two lists", "X7C6D5EC27C51066B" ], [ "\033[2XKuratowskiPlanarSubdigraph\033[102X", "5.6-1", [ 5, 6, 1 ], 2215, 91, "kuratowskiplanarsubdigraph", "X7DC478637E8C190D" ], [ "\033[2XKuratowskiOuterPlanarSubdigraph\033[102X", "5.6-2", [ 5, 6, 2 ], 2269, 92, "kuratowskiouterplanarsubdigraph", "X78E8F09A8286501B" ], [ "\033[2XPlanarEmbedding\033[102X", "5.6-3", [ 5, 6, 3 ], 2326, 93, "planarembedding", "X84E3947E7D39BA64" ], [ "\033[2XOuterPlanarEmbedding\033[102X", "5.6-4", [ 5, 6, 4 ], 2373, 94, "outerplanarembedding", "X85DFB8C18088711F" ], [ "\033[2XSubdigraphHomeomorphicToK23\033[102X", "5.6-5", [ 5, 6, 5 ], 2422, 95, "subdigraphhomeomorphictok23", "X806D2D6B85E0B269" ], [ "\033[2XSubdigraphHomeomorphicToK33\033[102X", "5.6-5", [ 5, 6, 5 ], 2422, 95, "subdigraphhomeomorphictok33", "X806D2D6B85E0B269" ], [ "\033[2XSubdigraphHomeomorphicToK4\033[102X", "5.6-5", [ 5, 6, 5 ], 2422, 95, "subdigraphhomeomorphictok4", "X806D2D6B85E0B269" ], [ "\033[2XDigraphHasLoops\033[102X", "6.1-1", [ 6, 1, 1 ], 7, 97, "digraphhasloops", "X7D92935C7D535187" ], [ "\033[2XIsAntiSymmetricDigraph\033[102X", "6.1-2", [ 6, 1, 2 ], 37, 97, "isantisymmetricdigraph", "X7DB1BC2286FC08E2" ], [ "\033[2XIsAntisymmetricDigraph\033[102X", "6.1-2", [ 6, 1, 2 ], 37, 97, "isantisymmetricdigraph", "X7DB1BC2286FC08E2" ], [ "\033[2XIsBipartiteDigraph\033[102X", "6.1-3", [ 6, 1, 3 ], 68, 98, "isbipartitedigraph", "X860CFB0C8665F356" ], [ "\033[2XIsCompleteBipartiteDigraph\033[102X", "6.1-4", [ 6, 1, 4 ], 99, 98, "iscompletebipartitedigraph", "X790A4DBF8533516E" ], [ "\033[2XIsCompleteDigraph\033[102X", "6.1-5", [ 6, 1, 5 ], 137, 99, "iscompletedigraph", "X81F28D4D879FE3B2" ], [ "\033[2XIsCompleteMultipartiteDigraph\033[102X", "6.1-6", [ 6, 1, 6 ], 167, 99, "iscompletemultipartitedigraph", "X7FD1A15779FEC341" ], [ "\033[2XIsEmptyDigraph\033[102X", "6.1-7", [ 6, 1, 7 ], 194, 100, "isemptydigraph", "X7E894CCF7B1C27AE" ], [ "\033[2XIsNullDigraph\033[102X", "6.1-7", [ 6, 1, 7 ], 194, 100, "isnulldigraph", "X7E894CCF7B1C27AE" ], [ "\033[2XIsEquivalenceDigraph\033[102X", "6.1-8", [ 6, 1, 8 ], 223, 100, "isequivalencedigraph", "X83762C257DED2751" ], [ "\033[2XIsFunctionalDigraph\033[102X", "6.1-9", [ 6, 1, 9 ], 243, 101, "isfunctionaldigraph", "X7E8F37E585DAED52" ], [ "\033[2XIsMultiDigraph\033[102X", "6.1-10", [ 6, 1, 10 ], 270, 101, "ismultidigraph", "X7BB84CFC7E8B2B26" ], [ "\033[2XIsReflexiveDigraph\033[102X", "6.1-11", [ 6, 1, 11 ], 304, 102, "isreflexivedigraph", "X8462D8E2792B23F6" ], [ "\033[2XIsSymmetricDigraph\033[102X", "6.1-12", [ 6, 1, 12 ], 326, 102, "issymmetricdigraph", "X81B3EA7887219860" ], [ "\033[2XIsTournament\033[102X", "6.1-13", [ 6, 1, 13 ], 370, 103, "istournament", "X7DD8D1A185EBE865" ], [ "\033[2XIsTransitiveDigraph\033[102X", "6.1-14", [ 6, 1, 14 ], 404, 103, "istransitivedigraph", "X7F0835667F29F0C0" ], [ "\033[2XIsPreorderDigraph\033[102X", "6.1-15", [ 6, 1, 15 ], 440, 104, "ispreorderdigraph", "X8617726C7829F796" ], [ "\033[2XIsQuasiorderDigraph\033[102X", "6.1-15", [ 6, 1, 15 ], 440, 104, "isquasiorderdigraph", "X8617726C7829F796" ], [ "\033[2XIsPartialOrderDigraph\033[102X", "6.1-16", [ 6, 1, 16 ], 473, 105, "ispartialorderdigraph", "X82BAE6D37D49A145" ], [ "\033[2XIsMeetSemilatticeDigraph\033[102X", "6.1-17", [ 6, 1, 17 ], 502, 105, "ismeetsemilatticedigraph", "X78D3E17B7F737516" ], [ "\033[2XIsJoinSemilatticeDigraph\033[102X", "6.1-17", [ 6, 1, 17 ], 502, 105, "isjoinsemilatticedigraph", "X78D3E17B7F737516" ], [ "\033[2XIsLatticeDigraph\033[102X", "6.1-17", [ 6, 1, 17 ], 502, 105, "islatticedigraph", "X78D3E17B7F737516" ], [ "\033[2XIsInRegularDigraph\033[102X", "6.2-1", [ 6, 2, 1 ], 564, 106, "isinregulardigraph", "X7A3F78B37E31D9E1" ], [ "\033[2XIsOutRegularDigraph\033[102X", "6.2-2", [ 6, 2, 2 ], 583, 106, "isoutregulardigraph", "X7F0A806E7BCB413C" ], [ "\033[2XIsRegularDigraph\033[102X", "6.2-3", [ 6, 2, 3 ], 603, 107, "isregulardigraph", "X7AF9DB1E7DB12306" ], [ "\033[2XIsDistanceRegularDigraph\033[102X", "6.2-4", [ 6, 2, 4 ], 624, 107, "isdistanceregulardigraph", "X7E2082AC7CAE59CD" ], [ "\033[2XIsAcyclicDigraph\033[102X", "6.3-1", [ 6, 3, 1 ], 661, 108, "isacyclicdigraph", "X7BD08D4478218F77" ], [ "\033[2XIsChainDigraph\033[102X", "6.3-2", [ 6, 3, 2 ], 702, 108, "ischaindigraph", "X79563B297C220FB5" ], [ "\033[2XIsConnectedDigraph\033[102X", "6.3-3", [ 6, 3, 3 ], 741, 109, "isconnecteddigraph", "X83C08C0B7EC1A91F" ], [ "\033[2XIsBiconnectedDigraph\033[102X", "6.3-4", [ 6, 3, 4 ], 774, 109, "isbiconnecteddigraph", "X838FAF2D825977BE" ], [ "\033[2XIsStronglyConnectedDigraph\033[102X", "6.3-5", [ 6, 3, 5 ], 810, 110, "isstronglyconnecteddigraph", "X7B37B9467C68C208" ], [ "\033[2XIsAperiodicDigraph\033[102X", "6.3-6", [ 6, 3, 6 ], 848, 111, "isaperiodicdigraph", "X80E883967EBE839E" ], [ "\033[2XIsDirectedTree\033[102X", "6.3-7", [ 6, 3, 7 ], 874, 111, "isdirectedtree", "X7B46EA6C7B2DF2FB" ], [ "\033[2XIsUndirectedTree\033[102X", "6.3-8", [ 6, 3, 8 ], 910, 112, "isundirectedtree", "X80FC20FA7AC4BC2A" ], [ "\033[2XIsUndirectedForest\033[102X", "6.3-8", [ 6, 3, 8 ], 910, 112, "isundirectedforest", "X80FC20FA7AC4BC2A" ], [ "\033[2XIsEulerianDigraph\033[102X", "6.3-9", [ 6, 3, 9 ], 961, 112, "iseuleriandigraph", "X79DFBB198525544E" ], [ "\033[2XIsHamiltonianDigraph\033[102X", "6.3-10", [ 6, 3, 10 ], 995, 113, "ishamiltoniandigraph", "X79EFEBC37C2D262D" ], [ "\033[2XIsCycleDigraph\033[102X", "6.3-11", [ 6, 3, 11 ], 1032, 114, "iscycledigraph", "X7E91320B8028F5D8" ], [ "\033[2XIsPlanarDigraph\033[102X", "6.4-1", [ 6, 4, 1 ], 1067, 114, "isplanardigraph", "X8606D415858C40AA" ], [ "\033[2XIsOuterPlanarDigraph\033[102X", "6.4-2", [ 6, 4, 2 ], 1107, 115, "isouterplanardigraph", "X8251E8B187E7F059" ], [ "\033[2XIsDigraphCore\033[102X", "6.5-1", [ 6, 5, 1 ], 1156, 116, "isdigraphcore", "X78C0B2637985648B" ], [ "\033[2XIsEdgeTransitive\033[102X", "6.5-2", [ 6, 5, 2 ], 1183, 116, "isedgetransitive", "X8361CA6E8401FF26" ], [ "\033[2XIsVertexTransitive\033[102X", "6.5-3", [ 6, 5, 3 ], 1205, 116, "isvertextransitive", "X7B26E4447A1611E9" ], [ "\033[2XOnDigraphs\033[102X for a digraph and a perm", "7.1-1", [ 7, 1, 1 ], 7, 118, "ondigraphs for a digraph and a perm", "X808972017C486F1F" ], [ "\033[2XOnDigraphs\033[102X for a digraph and a transformation", "7.1-1", [ 7, 1, 1 ], 7, 118, "ondigraphs for a digraph and a transformation", "X808972017C486F1F" ], [ "\033[2XOnMultiDigraphs\033[102X", "7.1-2", [ 7, 1, 2 ], 53, 119, "onmultidigraphs", "X7AFBA7608498F9CE" ], [ "\033[2XOnMultiDigraphs\033[102X for a digraph, perm, and perm", "7.1-2", [ 7, 1, 2 ], 53, 119, "onmultidigraphs for a digraph perm and perm", "X7AFBA7608498F9CE" ] , [ "\033[2XDigraphsUseNauty\033[102X", "7.2-1", [ 7, 2, 1 ], 96, 119, "digraphsusenauty", "X83E593F3855B122E" ], [ "\033[2XDigraphsUseBliss\033[102X", "7.2-1", [ 7, 2, 1 ], 96, 119, "digraphsusebliss", "X83E593F3855B122E" ], [ "\033[2XAutomorphismGroup\033[102X for a digraph", "7.2-2", [ 7, 2, 2 ], 118, 120, "automorphismgroup for a digraph", "X858C32127A190175" ], [ "\033[2XBlissAutomorphismGroup\033[102X for a digraph", "7.2-3", [ 7, 2, 3 ], 159, 120, "blissautomorphismgroup for a digraph", "X7E7B0D88865A89F6" ], [ "\033[2XBlissAutomorphismGroup\033[102X for a digraph and homogenous li\ st", "7.2-3", [ 7, 2, 3 ], 159, 120, "blissautomorphismgroup for a digraph and homogenous list", "X7E7B0D88865A89F6" ], [ "\033[2XBlissAutomorphismGroup\033[102X for a digraph, homogenous list,\ and list", "7.2-3", [ 7, 2, 3 ], 159, 120, "blissautomorphismgroup for a digraph homogenous list and list", "X7E7B0D88865A89F6" ], [ "\033[2XNautyAutomorphismGroup\033[102X", "7.2-4", [ 7, 2, 4 ], 192, 121, "nautyautomorphismgroup", "X857758B18144C0CD" ], [ "\033[2XAutomorphismGroup\033[102X for a digraph and a homogeneous list\ ", "7.2-5", [ 7, 2, 5 ], 215, 121, "automorphismgroup for a digraph and a homogeneous list", "X877732B1783C391B" ], [ "\033[2XAutomorphismGroup\033[102X for a digraph, homogeneous list, and\ list", "7.2-6", [ 7, 2, 6 ], 273, 122, "automorphismgroup for a digraph homogeneous list and list", "X7DA2C4FE837FFE01" ], [ "\033[2XBlissCanonicalLabelling\033[102X for a digraph", "7.2-7", [ 7, 2, 7 ], 340, 123, "blisscanonicallabelling for a digraph", "X7D676FE67A6684FF" ], [ "\033[2XNautyCanonicalLabelling\033[102X for a digraph", "7.2-7", [ 7, 2, 7 ], 340, 123, "nautycanonicallabelling for a digraph", "X7D676FE67A6684FF" ], [ "\033[2XBlissCanonicalLabelling\033[102X for a digraph and a list", "7.2-8", [ 7, 2, 8 ], 382, 124, "blisscanonicallabelling for a digraph and a list", "X87DA265D803DB337" ], [ "\033[2XNautyCanonicalLabelling\033[102X for a digraph and a list", "7.2-8", [ 7, 2, 8 ], 382, 124, "nautycanonicallabelling for a digraph and a list", "X87DA265D803DB337" ], [ "\033[2XBlissCanonicalDigraph\033[102X", "7.2-9", [ 7, 2, 9 ], 466, 125, "blisscanonicaldigraph", "X877B1D377EC197D7" ], [ "\033[2XNautyCanonicalDigraph\033[102X", "7.2-9", [ 7, 2, 9 ], 466, 125, "nautycanonicaldigraph", "X877B1D377EC197D7" ], [ "\033[2XDigraphGroup\033[102X", "7.2-10", [ 7, 2, 10 ], 498, 126, "digraphgroup", "X803ACEDA7BBAC5B3" ], [ "\033[2XDigraphOrbits\033[102X", "7.2-11", [ 7, 2, 11 ], 567, 127, "digraphorbits", "X8096C5287E459279" ], [ "\033[2XDigraphOrbitReps\033[102X", "7.2-12", [ 7, 2, 12 ], 587, 127, "digraphorbitreps", "X8386028782F2D3FF" ], [ "\033[2XDigraphSchreierVector\033[102X", "7.2-13", [ 7, 2, 13 ], 612, 128, "digraphschreiervector", "X8657604E87A25E5F" ], [ "\033[2XDigraphStabilizer\033[102X", "7.2-14", [ 7, 2, 14 ], 658, 129, "digraphstabilizer", "X78913684795FB256" ], [ "\033[2XIsIsomorphicDigraph\033[102X for digraphs", "7.2-15", [ 7, 2, 15 ], 681, 129, "isisomorphicdigraph for digraphs", "X7B4F24B283C9EE28" ], [ "\033[2XIsIsomorphicDigraph\033[102X for digraphs and homogeneous lists\ ", "7.2-16", [ 7, 2, 16 ], 715, 130, "isisomorphicdigraph for digraphs and homogeneous lists", "X7D4A1FA8868DA930" ], [ "\033[2XIsomorphismDigraphs\033[102X for digraphs", "7.2-17", [ 7, 2, 17 ], 765, 130, "isomorphismdigraphs for digraphs", "X8219FE6C839D9457" ], [ "\033[2XIsomorphismDigraphs\033[102X for digraphs and homogeneous lists\ ", "7.2-18", [ 7, 2, 18 ], 805, 131, "isomorphismdigraphs for digraphs and homogeneous lists", "X7ED93C0F86D9D34F" ], [ "\033[2XRepresentativeOutNeighbours\033[102X", "7.2-19", [ 7, 2, 19 ], 872, 132, "representativeoutneighbours", "X7E1C806D81DFE15E" ], [ "\033[2XIsDigraphIsomorphism\033[102X for digraphs and transformation o\ r permutation", "7.2-20", [ 7, 2, 20 ], 911, 133, "isdigraphisomorphism for digraphs and transformation or permutation\ ", "X80183D4A7C51365A" ], [ "\033[2XIsDigraphIsomorphism\033[102X", "7.2-20", [ 7, 2, 20 ], 911, 133, "isdigraphisomorphism", "X80183D4A7C51365A" ], [ "\033[2XIsDigraphAutomorphism\033[102X for a digraph and a transformati\ on or permutation", "7.2-20", [ 7, 2, 20 ], 911, 133, "isdigraphautomorphism for a digraph and a transformation or permuta\ tion", "X80183D4A7C51365A" ], [ "\033[2XIsDigraphAutomorphism\033[102X", "7.2-20", [ 7, 2, 20 ], 911, 133, "isdigraphautomorphism", "X80183D4A7C51365A" ], [ "\033[2XIsDigraphColouring\033[102X", "7.2-21", [ 7, 2, 21 ], 984, 134, "isdigraphcolouring", "X7F16B8B3825A627A" ], [ "\033[2XIsDigraphColouring\033[102X for a transformation", "7.2-21", [ 7, 2, 21 ], 984, 134, "isdigraphcolouring for a transformation", "X7F16B8B3825A627A" ], [ "\033[2XHomomorphismDigraphsFinder\033[102X", "7.3-1", [ 7, 3, 1 ], 1027, 135, "homomorphismdigraphsfinder", "X79ABF0E783FD67C7" ], [ "\033[2XDigraphHomomorphism\033[102X", "7.3-2", [ 7, 3, 2 ], 1159, 137, "digraphhomomorphism", "X85E9B019877AD7FE" ], [ "\033[2XHomomorphismsDigraphs\033[102X", "7.3-3", [ 7, 3, 3 ], 1185, 137, "homomorphismsdigraphs", "X8653EDA183E06D05" ], [ "\033[2XHomomorphismsDigraphsRepresentatives\033[102X", "7.3-3", [ 7, 3, 3 ], 1185, 137, "homomorphismsdigraphsrepresentatives", "X8653EDA183E06D05" ], [ "\033[2XDigraphMonomorphism\033[102X", "7.3-4", [ 7, 3, 4 ], 1214, 138, "digraphmonomorphism", "X82D0FCD87D47ACA8" ], [ "\033[2XMonomorphismsDigraphs\033[102X", "7.3-5", [ 7, 3, 5 ], 1232, 138, "monomorphismsdigraphs", "X84B4BDB984C2A9A8" ], [ "\033[2XMonomorphismsDigraphsRepresentatives\033[102X", "7.3-5", [ 7, 3, 5 ], 1232, 138, "monomorphismsdigraphsrepresentatives", "X84B4BDB984C2A9A8" ], [ "\033[2XDigraphEpimorphism\033[102X", "7.3-6", [ 7, 3, 6 ], 1253, 139, "digraphepimorphism", "X7CB5AD9F861684FD" ], [ "\033[2XEpimorphismsDigraphs\033[102X", "7.3-7", [ 7, 3, 7 ], 1272, 139, "epimorphismsdigraphs", "X7DFB1F5D873937B3" ], [ "\033[2XEpimorphismsDigraphsRepresentatives\033[102X", "7.3-7", [ 7, 3, 7 ], 1272, 139, "epimorphismsdigraphsrepresentatives", "X7DFB1F5D873937B3" ], [ "\033[2XDigraphEmbedding\033[102X", "7.3-8", [ 7, 3, 8 ], 1302, 139, "digraphembedding", "X7AD04CC186E86CCA" ], [ "\033[2XEmbeddingsDigraphs\033[102X", "7.3-9", [ 7, 3, 9 ], 1328, 140, "embeddingsdigraphs", "X82EBDF137EEDC5FD" ], [ "\033[2XEmbeddingsDigraphsRepresentatives\033[102X", "7.3-9", [ 7, 3, 9 ], 1328, 140, "embeddingsdigraphsrepresentatives", "X82EBDF137EEDC5FD" ], [ "\033[2XIsDigraphHomomorphism\033[102X for digraphs and a permutation o\ r transformation", "7.3-10", [ 7, 3, 10 ], 1359, 140, "isdigraphhomomorphism for digraphs and a permutation or transformat\ ion", "X80FE9FCB79718A61" ], [ "\033[2XIsDigraphHomomorphism\033[102X", "7.3-10", [ 7, 3, 10 ], 1359, 140, "isdigraphhomomorphism", "X80FE9FCB79718A61" ], [ "\033[2XIsDigraphEpimorphism\033[102X for digraphs and a permutation or\ transformation", "7.3-10", [ 7, 3, 10 ], 1359, 140, "isdigraphepimorphism for digraphs and a permutation or transformati\ on", "X80FE9FCB79718A61" ], [ "\033[2XIsDigraphEpimorphism\033[102X", "7.3-10", [ 7, 3, 10 ], 1359, 140, "isdigraphepimorphism", "X80FE9FCB79718A61" ], [ "\033[2XIsDigraphMonomorphism\033[102X for digraphs and a permutation o\ r transformation", "7.3-10", [ 7, 3, 10 ], 1359, 140, "isdigraphmonomorphism for digraphs and a permutation or transformat\ ion", "X80FE9FCB79718A61" ], [ "\033[2XIsDigraphMonomorphism\033[102X", "7.3-10", [ 7, 3, 10 ], 1359, 140, "isdigraphmonomorphism", "X80FE9FCB79718A61" ], [ "\033[2XIsDigraphEndomorphism\033[102X for digraphs and a permutation o\ r transformation", "7.3-10", [ 7, 3, 10 ], 1359, 140, "isdigraphendomorphism for digraphs and a permutation or transformat\ ion", "X80FE9FCB79718A61" ], [ "\033[2XIsDigraphEndomorphism\033[102X", "7.3-10", [ 7, 3, 10 ], 1359, 140, "isdigraphendomorphism", "X80FE9FCB79718A61" ], [ "\033[2XIsDigraphEmbedding\033[102X for digraphs and a permutation or t\ ransformation", "7.3-11", [ 7, 3, 11 ], 1441, 142, "isdigraphembedding for digraphs and a permutation or transformation\ ", "X7D6B5A0887903810" ], [ "\033[2XIsDigraphEmbedding\033[102X", "7.3-11", [ 7, 3, 11 ], 1441, 142, "isdigraphembedding", "X7D6B5A0887903810" ], [ "\033[2XDigraphsRespectsColouring\033[102X", "7.3-12", [ 7, 3, 12 ], 1477, 142, "digraphsrespectscolouring", "X7F80709A80CBFA98" ], [ "\033[2XGeneratorsOfEndomorphismMonoid\033[102X", "7.3-13", [ 7, 3, 13 ], 1498, 143, "generatorsofendomorphismmonoid", "X7E93B268823F6478" ], [ "\033[2XGeneratorsOfEndomorphismMonoidAttr\033[102X", "7.3-13", [ 7, 3, 13 ], 1498, 143, "generatorsofendomorphismmonoidattr", "X7E93B268823F6478" ], [ "\033[2XDigraphColouring\033[102X for a digraph and a number of colours\ ", "7.3-14", [ 7, 3, 14 ], 1544, 144, "digraphcolouring for a digraph and a number of colours", "X86D0A74B83D6B9A7" ], [ "\033[2XDigraphGreedyColouring\033[102X for a digraph and vertex order" , "7.3-15", [ 7, 3, 15 ], 1580, 144, "digraphgreedycolouring for a digraph and vertex order", "X7AB7200D831013C1" ], [ "\033[2XDigraphGreedyColouring\033[102X for a digraph and vertex order \ function", "7.3-15", [ 7, 3, 15 ], 1580, 144, "digraphgreedycolouring for a digraph and vertex order function", "X7AB7200D831013C1" ], [ "\033[2XDigraphGreedyColouring\033[102X for a digraph", "7.3-15", [ 7, 3, 15 ], 1580, 144, "digraphgreedycolouring for a digraph", "X7AB7200D831013C1" ], [ "\033[2XDigraphWelshPowellOrder\033[102X", "7.3-16", [ 7, 3, 16 ], 1612, 145, "digraphwelshpowellorder", "X7F9CB3B27B9590DB" ], [ "\033[2XChromaticNumber\033[102X", "7.3-17", [ 7, 3, 17 ], 1628, 145, "chromaticnumber", "X807D49358529A37C" ], [ "\033[2XDigraphCore\033[102X", "7.3-18", [ 7, 3, 18 ], 1662, 145, "digraphcore", "X863487EF7D64EF56" ], [ "\033[2XIsClique\033[102X", "8.1-1", [ 8, 1, 1 ], 75, 148, "isclique", "X80670E3E7C36183F" ], [ "\033[2XIsMaximalClique\033[102X", "8.1-1", [ 8, 1, 1 ], 75, 148, "ismaximalclique", "X80670E3E7C36183F" ], [ "\033[2XCliquesFinder\033[102X", "8.1-2", [ 8, 1, 2 ], 110, 149, "cliquesfinder", "X7A3BC9FF8169ABCD" ], [ "\033[2XDigraphClique\033[102X", "8.1-3", [ 8, 1, 3 ], 227, 151, "digraphclique", "X789854AC7B466402" ], [ "\033[2XDigraphMaximalClique\033[102X", "8.1-3", [ 8, 1, 3 ], 227, 151, "digraphmaximalclique", "X789854AC7B466402" ], [ "\033[2XDigraphMaximalCliques\033[102X", "8.1-4", [ 8, 1, 4 ], 304, 152, "digraphmaximalcliques", "X84EA2F9482B8D4AF" ], [ "\033[2XDigraphMaximalCliquesReps\033[102X", "8.1-4", [ 8, 1, 4 ], 304, 152, "digraphmaximalcliquesreps", "X84EA2F9482B8D4AF" ], [ "\033[2XDigraphCliques\033[102X", "8.1-4", [ 8, 1, 4 ], 304, 152, "digraphcliques", "X84EA2F9482B8D4AF" ], [ "\033[2XDigraphCliquesReps\033[102X", "8.1-4", [ 8, 1, 4 ], 304, 152, "digraphcliquesreps", "X84EA2F9482B8D4AF" ], [ "\033[2XDigraphMaximalCliquesAttr\033[102X", "8.1-4", [ 8, 1, 4 ], 304, 152, "digraphmaximalcliquesattr", "X84EA2F9482B8D4AF" ], [ "\033[2XDigraphMaximalCliquesRepsAttr\033[102X", "8.1-4", [ 8, 1, 4 ], 304, 152, "digraphmaximalcliquesrepsattr", "X84EA2F9482B8D4AF" ], [ "\033[2XCliqueNumber\033[102X", "8.1-5", [ 8, 1, 5 ], 390, 153, "cliquenumber", "X78427A8B81FEB457" ], [ "\033[2XIsIndependentSet\033[102X", "8.2-1", [ 8, 2, 1 ], 419, 154, "isindependentset", "X790733B67B0BC894" ], [ "\033[2XIsMaximalIndependentSet\033[102X", "8.2-1", [ 8, 2, 1 ], 419, 154, "ismaximalindependentset", "X790733B67B0BC894" ], [ "\033[2XDigraphIndependentSet\033[102X", "8.2-2", [ 8, 2, 2 ], 453, 154, "digraphindependentset", "X84350678782BFAB7" ], [ "\033[2XDigraphMaximalIndependentSet\033[102X", "8.2-2", [ 8, 2, 2 ], 453, 154, "digraphmaximalindependentset", "X84350678782BFAB7" ], [ "\033[2XDigraphMaximalIndependentSets\033[102X", "8.2-3", [ 8, 2, 3 ], 547, 156, "digraphmaximalindependentsets", "X7D2C78EB81A798A9" ], [ "\033[2XDigraphMaximalIndependentSetsReps\033[102X", "8.2-3", [ 8, 2, 3 ], 547, 156, "digraphmaximalindependentsetsreps", "X7D2C78EB81A798A9" ], [ "\033[2XDigraphIndependentSets\033[102X", "8.2-3", [ 8, 2, 3 ], 547, 156, "digraphindependentsets", "X7D2C78EB81A798A9" ], [ "\033[2XDigraphIndependentSetsReps\033[102X", "8.2-3", [ 8, 2, 3 ], 547, 156, "digraphindependentsetsreps", "X7D2C78EB81A798A9" ], [ "\033[2XDigraphMaximalIndependentSetsAttr\033[102X", "8.2-3", [ 8, 2, 3 ], 547, 156, "digraphmaximalindependentsetsattr", "X7D2C78EB81A798A9" ], [ "\033[2XDigraphMaximalIndependentSetsRepsAttr\033[102X", "8.2-3", [ 8, 2, 3 ], 547, 156, "digraphmaximalindependentsetsrepsattr", "X7D2C78EB81A798A9" ], [ "\033[2XSplash\033[102X", "9.1-1", [ 9, 1, 1 ], 7, 158, "splash", "X83B3318784E78415" ], [ "\033[2XDotDigraph\033[102X", "9.1-2", [ 9, 1, 2 ], 73, 159, "dotdigraph", "X7F9B99C478EE093A" ], [ "\033[2XDotVertexLabelledDigraph\033[102X", "9.1-2", [ 9, 1, 2 ], 73, 159, "dotvertexlabelleddigraph", "X7F9B99C478EE093A" ], [ "\033[2XDotSymmetricDigraph\033[102X", "9.1-3", [ 9, 1, 3 ], 106, 159, "dotsymmetricdigraph", "X78DA31D1869D2F94" ], [ "\033[2XDotPartialOrderDigraph\033[102X", "9.1-4", [ 9, 1, 4 ], 137, 160, "dotpartialorderdigraph", "X84120D447E2CAC23" ], [ "\033[2XDotPreorderDigraph\033[102X", "9.1-5", [ 9, 1, 5 ], 165, 160, "dotpreorderdigraph", "X7F5653C8854FAEA6" ], [ "\033[2XDotQuasiorderDigraph\033[102X", "9.1-5", [ 9, 1, 5 ], 165, 160, "dotquasiorderdigraph", "X7F5653C8854FAEA6" ], [ "\033[2XDotHighlightedDigraph\033[102X", "9.1-6", [ 9, 1, 6 ], 201, 161, "dothighlighteddigraph", "X808D12CF81E2C19F" ], [ "\033[2XString\033[102X", "9.2-1", [ 9, 2, 1 ], 263, 162, "string", "X81FB5BE27903EC32" ], [ "\033[2XPrintString\033[102X", "9.2-1", [ 9, 2, 1 ], 263, 162, "printstring", "X81FB5BE27903EC32" ], [ "\033[2XDigraphFromGraph6String\033[102X", "9.2-2", [ 9, 2, 2 ], 296, 162, "digraphfromgraph6string", "X873D6EB8836A3C61" ], [ "\033[2XDigraphFromDigraph6String\033[102X", "9.2-2", [ 9, 2, 2 ], 296, 162, "digraphfromdigraph6string", "X873D6EB8836A3C61" ], [ "\033[2XDigraphFromSparse6String\033[102X", "9.2-2", [ 9, 2, 2 ], 296, 162, "digraphfromsparse6string", "X873D6EB8836A3C61" ], [ "\033[2XDigraphFromDiSparse6String\033[102X", "9.2-2", [ 9, 2, 2 ], 296, 162, "digraphfromdisparse6string", "X873D6EB8836A3C61" ], [ "\033[2XGraph6String\033[102X", "9.2-3", [ 9, 2, 3 ], 335, 163, "graph6string", "X782A052979EA2376" ], [ "\033[2XDigraph6String\033[102X", "9.2-3", [ 9, 2, 3 ], 335, 163, "digraph6string", "X782A052979EA2376" ], [ "\033[2XSparse6String\033[102X", "9.2-3", [ 9, 2, 3 ], 335, 163, "sparse6string", "X782A052979EA2376" ], [ "\033[2XDiSparse6String\033[102X", "9.2-3", [ 9, 2, 3 ], 335, 163, "disparse6string", "X782A052979EA2376" ], [ "\033[2XDigraphFile\033[102X", "9.2-4", [ 9, 2, 4 ], 361, 163, "digraphfile", "X7845ACDA7D4D333D" ], [ "\033[2XReadDigraphs\033[102X", "9.2-5", [ 9, 2, 5 ], 442, 165, "readdigraphs", "X7E8142007ED0CB9F" ], [ "\033[2XWriteDigraphs\033[102X", "9.2-6", [ 9, 2, 6 ], 531, 166, "writedigraphs", "X82A4F0767C9EFC87" ], [ "\033[2XIteratorFromDigraphFile\033[102X", "9.2-7", [ 9, 2, 7 ], 607, 168, "iteratorfromdigraphfile", "X86D531B287733561" ], [ "\033[2XDigraphPlainTextLineEncoder\033[102X", "9.2-8", [ 9, 2, 8 ], 639, 168, "digraphplaintextlineencoder", "X7AAA35867B5D8BF4" ], [ "\033[2XDigraphPlainTextLineDecoder\033[102X", "9.2-8", [ 9, 2, 8 ], 639, 168, "digraphplaintextlinedecoder", "X7AAA35867B5D8BF4" ], [ "\033[2XTournamentLineDecoder\033[102X", "9.2-9", [ 9, 2, 9 ], 677, 169, "tournamentlinedecoder", "X7808D99079295C22" ], [ "\033[2XAdjacencyMatrixUpperTriangleLineDecoder\033[102X", "9.2-10", [ 9, 2, 10 ], 707, 169, "adjacencymatrixuppertrianglelinedecoder", "X7DF22D1687D096D6" ], [ "\033[2XTCodeDecoder\033[102X", "9.2-11", [ 9, 2, 11 ], 741, 170, "tcodedecoder", "X875393338486D77D" ], [ "\033[2XPlainTextString\033[102X", "9.2-12", [ 9, 2, 12 ], 771, 170, "plaintextstring", "X8540FC21796A793F" ], [ "\033[2XDigraphFromPlainTextString\033[102X", "9.2-12", [ 9, 2, 12 ], 771, 170, "digraphfromplaintextstring", "X8540FC21796A793F" ], [ "\033[2XWritePlainTextDigraph\033[102X", "9.2-13", [ 9, 2, 13 ], 801, 171, "writeplaintextdigraph", "X81BD23697857B244" ], [ "\033[2XReadPlainTextDigraph\033[102X", "9.2-13", [ 9, 2, 13 ], 801, 171, "readplaintextdigraph", "X81BD23697857B244" ], [ "\033[2XWriteDIMACSDigraph\033[102X", "9.2-14", [ 9, 2, 14 ], 829, 171, "writedimacsdigraph", "X804FDF6A7ED64049" ], [ "\033[2XReadDIMACSDigraph\033[102X", "9.2-14", [ 9, 2, 14 ], 829, 171, "readdimacsdigraph", "X804FDF6A7ED64049" ] ], sixcount := [ [ 0, 0, 0 ], [ 0, 0, 1 ], [ 0, 0, 2 ], [ 0, 0, 3 ], [ 0, 0, 4 ], [ 1, 0, 0 ], [ 1, 0, 0 ], [ 1, 1, 0 ], [ 1, 1, 1 ], [ 2, 0, 0 ], [ 2, 1, 0 ], [ 2, 2, 0 ], [ 2, 2, 1 ], [ 2, 3, 0 ], [ 2, 4, 0 ], [ 2, 4, 1 ], [ 2, 5, 0 ], [ 2, 5, 1 ], [ 2, 5, 2 ], [ 2, 5, 3 ], [ 3, 0, 0 ], [ 3, 1, 0 ], [ 3, 1, 1 ], [ 3, 1, 2 ], [ 3, 1, 3 ], [ 3, 1, 4 ], [ 3, 1, 5 ], [ 3, 1, 6 ], [ 3, 1, 6 ], [ 3, 1, 7 ], [ 3, 1, 7 ], [ 3, 1, 7 ], [ 3, 1, 8 ], [ 3, 1, 9 ], [ 3, 1, 10 ], [ 3, 1, 11 ], [ 3, 1, 11 ], [ 3, 1, 12 ], [ 3, 2, 0 ], [ 3, 2, 1 ], [ 3, 2, 2 ], [ 3, 2, 3 ], [ 3, 2, 4 ], [ 3, 2, 5 ], [ 3, 3, 0 ], [ 3, 3, 1 ], [ 3, 3, 1 ], [ 3, 3, 1 ], [ 3, 3, 1 ], [ 3, 3, 2 ], [ 3, 3, 2 ], [ 3, 3, 2 ], [ 3, 3, 2 ], [ 3, 3, 3 ], [ 3, 3, 4 ], [ 3, 3, 4 ], [ 3, 3, 5 ], [ 3, 3, 5 ], [ 3, 3, 5 ], [ 3, 3, 5 ], [ 3, 3, 6 ], [ 3, 3, 6 ], [ 3, 3, 7 ], [ 3, 3, 7 ], [ 3, 3, 7 ], [ 3, 3, 7 ], [ 3, 3, 8 ], [ 3, 3, 9 ], [ 3, 3, 9 ], [ 3, 3, 10 ], [ 3, 3, 10 ], [ 3, 3, 11 ], [ 3, 3, 11 ], [ 3, 3, 12 ], [ 3, 3, 12 ], [ 3, 3, 12 ], [ 3, 3, 12 ], [ 3, 3, 13 ], [ 3, 3, 13 ], [ 3, 3, 13 ], [ 3, 3, 13 ], [ 3, 3, 14 ], [ 3, 3, 15 ], [ 3, 3, 15 ], [ 3, 3, 16 ], [ 3, 3, 16 ], [ 3, 3, 17 ], [ 3, 3, 18 ], [ 3, 3, 19 ], [ 3, 3, 20 ], [ 3, 3, 21 ], [ 3, 3, 21 ], [ 3, 3, 22 ], [ 3, 3, 23 ], [ 3, 3, 24 ], [ 3, 3, 24 ], [ 3, 3, 25 ], [ 3, 3, 25 ], [ 3, 3, 26 ], [ 3, 3, 26 ], [ 3, 3, 26 ], [ 3, 3, 27 ], [ 3, 3, 27 ], [ 3, 3, 28 ], [ 3, 3, 28 ], [ 3, 3, 29 ], [ 3, 3, 29 ], [ 3, 3, 30 ], [ 3, 3, 30 ], [ 3, 3, 31 ], [ 3, 3, 31 ], [ 3, 3, 32 ], [ 3, 3, 33 ], [ 3, 3, 34 ], [ 3, 3, 34 ], [ 3, 3, 35 ], [ 3, 3, 35 ], [ 3, 3, 36 ], [ 3, 3, 37 ], [ 3, 3, 38 ], [ 3, 3, 38 ], [ 3, 3, 39 ], [ 3, 3, 39 ], [ 3, 3, 40 ], [ 3, 3, 41 ], [ 3, 3, 41 ], [ 3, 4, 0 ], [ 3, 4, 1 ], [ 3, 4, 2 ], [ 3, 4, 3 ], [ 3, 4, 4 ], [ 3, 5, 0 ], [ 3, 5, 1 ], [ 3, 5, 2 ], [ 3, 5, 3 ], [ 3, 5, 4 ], [ 3, 5, 5 ], [ 3, 5, 6 ], [ 3, 5, 6 ], [ 3, 5, 7 ], [ 3, 5, 8 ], [ 3, 5, 9 ], [ 4, 0, 0 ], [ 4, 1, 0 ], [ 4, 1, 0 ], [ 4, 1, 0 ], [ 4, 1, 1 ], [ 4, 1, 2 ], [ 4, 1, 2 ], [ 5, 0, 0 ], [ 5, 1, 0 ], [ 5, 1, 1 ], [ 5, 1, 2 ], [ 5, 1, 3 ], [ 5, 1, 4 ], [ 5, 1, 5 ], [ 5, 1, 6 ], [ 5, 1, 7 ], [ 5, 1, 8 ], [ 5, 1, 8 ], [ 5, 1, 9 ], [ 5, 1, 9 ], [ 5, 1, 10 ], [ 5, 1, 10 ], [ 5, 1, 11 ], [ 5, 1, 11 ], [ 5, 1, 11 ], [ 5, 1, 12 ], [ 5, 1, 13 ], [ 5, 1, 14 ], [ 5, 1, 14 ], [ 5, 1, 15 ], [ 5, 1, 15 ], [ 5, 1, 15 ], [ 5, 1, 15 ], [ 5, 1, 16 ], [ 5, 1, 17 ], [ 5, 2, 0 ], [ 5, 2, 1 ], [ 5, 2, 1 ], [ 5, 2, 2 ], [ 5, 2, 3 ], [ 5, 2, 3 ], [ 5, 2, 4 ], [ 5, 2, 5 ], [ 5, 2, 5 ], [ 5, 2, 6 ], [ 5, 2, 6 ], [ 5, 2, 6 ], [ 5, 2, 6 ], [ 5, 2, 7 ], [ 5, 2, 7 ], [ 5, 2, 7 ], [ 5, 2, 7 ], [ 5, 2, 8 ], [ 5, 2, 8 ], [ 5, 2, 8 ], [ 5, 2, 9 ], [ 5, 2, 9 ], [ 5, 2, 9 ], [ 5, 2, 10 ], [ 5, 2, 11 ], [ 5, 2, 11 ], [ 5, 2, 12 ], [ 5, 2, 13 ], [ 5, 2, 13 ], [ 5, 2, 14 ], [ 5, 2, 15 ], [ 5, 2, 15 ], [ 5, 2, 16 ], [ 5, 2, 17 ], [ 5, 3, 0 ], [ 5, 3, 1 ], [ 5, 3, 2 ], [ 5, 3, 2 ], [ 5, 3, 2 ], [ 5, 3, 3 ], [ 5, 3, 4 ], [ 5, 3, 5 ], [ 5, 3, 5 ], [ 5, 3, 6 ], [ 5, 3, 7 ], [ 5, 3, 8 ], [ 5, 3, 9 ], [ 5, 3, 9 ], [ 5, 3, 10 ], [ 5, 3, 11 ], [ 5, 3, 11 ], [ 5, 3, 12 ], [ 5, 3, 13 ], [ 5, 3, 14 ], [ 5, 3, 15 ], [ 5, 3, 16 ], [ 5, 3, 17 ], [ 5, 3, 18 ], [ 5, 3, 19 ], [ 5, 3, 20 ], [ 5, 3, 21 ], [ 5, 3, 22 ], [ 5, 3, 23 ], [ 5, 3, 24 ], [ 5, 3, 25 ], [ 5, 3, 26 ], [ 5, 3, 27 ], [ 5, 3, 28 ], [ 5, 3, 28 ], [ 5, 4, 0 ], [ 5, 4, 1 ], [ 5, 4, 1 ], [ 5, 4, 2 ], [ 5, 5, 0 ], [ 5, 5, 1 ], [ 5, 5, 1 ], [ 5, 5, 2 ], [ 5, 6, 0 ], [ 5, 6, 1 ], [ 5, 6, 2 ], [ 5, 6, 3 ], [ 5, 6, 4 ], [ 5, 6, 5 ], [ 5, 6, 5 ], [ 5, 6, 5 ], [ 6, 0, 0 ], [ 6, 1, 0 ], [ 6, 1, 1 ], [ 6, 1, 2 ], [ 6, 1, 2 ], [ 6, 1, 3 ], [ 6, 1, 4 ], [ 6, 1, 5 ], [ 6, 1, 6 ], [ 6, 1, 7 ], [ 6, 1, 7 ], [ 6, 1, 8 ], [ 6, 1, 9 ], [ 6, 1, 10 ], [ 6, 1, 11 ], [ 6, 1, 12 ], [ 6, 1, 13 ], [ 6, 1, 14 ], [ 6, 1, 15 ], [ 6, 1, 15 ], [ 6, 1, 16 ], [ 6, 1, 17 ], [ 6, 1, 17 ], [ 6, 1, 17 ], [ 6, 2, 0 ], [ 6, 2, 1 ], [ 6, 2, 2 ], [ 6, 2, 3 ], [ 6, 2, 4 ], [ 6, 3, 0 ], [ 6, 3, 1 ], [ 6, 3, 2 ], [ 6, 3, 3 ], [ 6, 3, 4 ], [ 6, 3, 5 ], [ 6, 3, 6 ], [ 6, 3, 7 ], [ 6, 3, 8 ], [ 6, 3, 8 ], [ 6, 3, 9 ], [ 6, 3, 10 ], [ 6, 3, 11 ], [ 6, 4, 0 ], [ 6, 4, 1 ], [ 6, 4, 2 ], [ 6, 5, 0 ], [ 6, 5, 1 ], [ 6, 5, 2 ], [ 6, 5, 3 ], [ 7, 0, 0 ], [ 7, 1, 0 ], [ 7, 1, 1 ], [ 7, 1, 1 ], [ 7, 1, 2 ], [ 7, 1, 2 ], [ 7, 2, 0 ], [ 7, 2, 1 ], [ 7, 2, 1 ], [ 7, 2, 2 ], [ 7, 2, 3 ], [ 7, 2, 3 ], [ 7, 2, 3 ], [ 7, 2, 4 ], [ 7, 2, 5 ], [ 7, 2, 6 ], [ 7, 2, 7 ], [ 7, 2, 7 ], [ 7, 2, 8 ], [ 7, 2, 8 ], [ 7, 2, 9 ], [ 7, 2, 9 ], [ 7, 2, 10 ], [ 7, 2, 11 ], [ 7, 2, 12 ], [ 7, 2, 13 ], [ 7, 2, 14 ], [ 7, 2, 15 ], [ 7, 2, 16 ], [ 7, 2, 17 ], [ 7, 2, 18 ], [ 7, 2, 19 ], [ 7, 2, 20 ], [ 7, 2, 20 ], [ 7, 2, 20 ], [ 7, 2, 20 ], [ 7, 2, 21 ], [ 7, 2, 21 ], [ 7, 3, 0 ], [ 7, 3, 1 ], [ 7, 3, 2 ], [ 7, 3, 3 ], [ 7, 3, 3 ], [ 7, 3, 4 ], [ 7, 3, 5 ], [ 7, 3, 5 ], [ 7, 3, 6 ], [ 7, 3, 7 ], [ 7, 3, 7 ], [ 7, 3, 8 ], [ 7, 3, 9 ], [ 7, 3, 9 ], [ 7, 3, 10 ], [ 7, 3, 10 ], [ 7, 3, 10 ], [ 7, 3, 10 ], [ 7, 3, 10 ], [ 7, 3, 10 ], [ 7, 3, 10 ], [ 7, 3, 10 ], [ 7, 3, 11 ], [ 7, 3, 11 ], [ 7, 3, 12 ], [ 7, 3, 13 ], [ 7, 3, 13 ], [ 7, 3, 14 ], [ 7, 3, 15 ], [ 7, 3, 15 ], [ 7, 3, 15 ], [ 7, 3, 16 ], [ 7, 3, 17 ], [ 7, 3, 18 ], [ 8, 0, 0 ], [ 8, 1, 0 ], [ 8, 1, 1 ], [ 8, 1, 1 ], [ 8, 1, 2 ], [ 8, 1, 3 ], [ 8, 1, 3 ], [ 8, 1, 4 ], [ 8, 1, 4 ], [ 8, 1, 4 ], [ 8, 1, 4 ], [ 8, 1, 4 ], [ 8, 1, 4 ], [ 8, 1, 5 ], [ 8, 2, 0 ], [ 8, 2, 1 ], [ 8, 2, 1 ], [ 8, 2, 2 ], [ 8, 2, 2 ], [ 8, 2, 3 ], [ 8, 2, 3 ], [ 8, 2, 3 ], [ 8, 2, 3 ], [ 8, 2, 3 ], [ 8, 2, 3 ], [ 9, 0, 0 ], [ 9, 1, 0 ], [ 9, 1, 1 ], [ 9, 1, 2 ], [ 9, 1, 2 ], [ 9, 1, 3 ], [ 9, 1, 4 ], [ 9, 1, 5 ], [ 9, 1, 5 ], [ 9, 1, 6 ], [ 9, 2, 0 ], [ 9, 2, 1 ], [ 9, 2, 1 ], [ 9, 2, 2 ], [ 9, 2, 2 ], [ 9, 2, 2 ], [ 9, 2, 2 ], [ 9, 2, 3 ], [ 9, 2, 3 ], [ 9, 2, 3 ], [ 9, 2, 3 ], [ 9, 2, 4 ], [ 9, 2, 5 ], [ 9, 2, 6 ], [ 9, 2, 7 ], [ 9, 2, 8 ], [ 9, 2, 8 ], [ 9, 2, 9 ], [ 9, 2, 10 ], [ 9, 2, 11 ], [ 9, 2, 12 ], [ 9, 2, 12 ], [ 9, 2, 13 ], [ 9, 2, 13 ], [ 9, 2, 14 ], [ 9, 2, 14 ], [ "A", 0, 0 ], [ "A", 1, 0 ], [ "A", 2, 0 ], [ "A", 3, 0 ], [ "A", 4, 0 ], [ "A", 5, 0 ], [ "A", 6, 0 ], [ "A", 7, 0 ], [ "Bib", 0, 0 ], [ "Bib", 0, 0 ], [ "Ind", 0, 0 ] ], sixindex := [ 1, 3, 2, 4, 5, 6, 58, 7, 8, 9, 10, 11, 12, 13, 14, 59, 15, 60, 61, 62, 16, 17, 63, 64, 65, 66, 67, 69, 68, 72, 70, 71, 73, 74, 75, 77, 76, 78, 18, 79, 80, 81, 82, 83, 19, 84, 85, 86, 87, 89, 90, 91, 88, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 115, 113, 112, 114, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 130, 129, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 149, 148, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 20, 165, 166, 167, 168, 21, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 22, 23, 180, 179, 181, 182, 183, 24, 25, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 199, 198, 197, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 26, 211, 210, 212, 214, 213, 215, 217, 216, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 231, 230, 229, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 27, 243, 246, 245, 244, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 276, 275, 28, 277, 278, 279, 29, 280, 281, 282, 30, 283, 284, 285, 286, 289, 288, 287, 31, 32, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 33, 312, 313, 314, 315, 34, 316, 317, 318, 319, 320, 321, 322, 324, 323, 325, 326, 327, 35, 328, 329, 36, 330, 331, 332, 37, 38, 334, 333, 335, 336, 39, 338, 337, 339, 340, 342, 341, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 40, 368, 369, 370, 371, 372, 374, 373, 375, 377, 376, 378, 380, 379, 381, 383, 384, 388, 387, 386, 385, 382, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 41, 42, 402, 401, 403, 405, 404, 407, 406, 409, 410, 408, 411, 412, 43, 414, 413, 415, 416, 417, 419, 420, 421, 422, 418, 44, 45, 423, 425, 424, 426, 427, 429, 428, 430, 46, 432, 431, 436, 433, 434, 435, 440, 439, 438, 437, 441, 442, 443, 444, 446, 445, 447, 448, 449, 451, 450, 453, 452, 454, 455, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57 ], start := 0, stop := 468188, toctext := "1 \n The Digraphs package\n \n 1.1\ Introduction\n\n\n   1.1-1 De\ finitions\n\n \n \n<\ a href=\"chap2_mj.html#X817088B27F90D596\">2 Installin\ g Digraphs\n\ 2.1 For those in a hurry\n\n \n 2.2 \ Optional package dependencies\n\n\n &\ nbsp; 2.2-1 The Grape package\n\n \n 2.3 Compiling th\ e kernel module\n\n \n 2.4 Rebuilding the documentation\n\n\n   2.4-1 DigraphsMakeDoc\n \n 2.5 Testing your installation\n\n\n <\ span class=\"nocss\">  2.5-1 DigraphsTestInstall\n   2.5-2 DigraphsTestStandard\n   \ 2.5-3 DigraphsTestExtreme\n \n
\n
3 Cr\ eating digraphs\n
3\ .1 Creating digraphs\n\n
\n
&nb\ sp;3.1-1 IsDigraph\n
  3.1-2 IsMutableDigraph\n
  3.1-3 IsImmutableDigraph\n
  3.1-4 IsCayleyDigraph\n
  3.1-5 IsDigraphWithAdjacencyFunction\n
  3.1-6 DigraphByOutNeighboursType\n
  3.1-7 Digraph\n
  3.1-8 DigraphByAdjacencyMatrix\n
  3.1-9 DigraphByEdges\n
\   3.1-10 EdgeOrbitsDigraph\n
  3.1-11 DigraphByInNeighbours\n
  3.1-12 CayleyDigraph\n
\n
3.2 Changing representations\n\n
\n
  3.2-1 AsBinaryRelation\n
  3.2\ -2 AsDigraph\n
&n\ bsp; 3.2-3 Graph\n
  <\ a href=\"chap3_mj.html#X7C4F13E080EC16B0\">3.2-4 AsGraph\n
  3.2-5 AsTransformation\n
\n 3.3 New\ digraphs from old\n\n
\n
  3.3-1 DigraphImmutableCopy\n
  3.3-2 DigraphImmutableCopyIfImmutable\n
  3.3-3 InducedSubdigraph\n
  3.3-4 ReducedDigraph\n
  3.3-5 MaximalSymmetricSubdigraph\n
  3.3-6 MaximalAntiSymmetricSubdigraph\n
  3.3-7 UndirectedSpanningForest\n
  3.3-8 QuotientDigraph\n
  3.3-9 DigraphReverse\n  3.3-10 DigraphDual\n
  \ 3.3-11 DigraphSymmetricClosure\n
  3.3-12 DigraphTransitiveClosure\n
  3.3-13 DigraphTransitiveReduction\n
\   3.3-14 DigraphAddVertex\n
  3.3-15 DigraphAddVertices\n
  3.3\ -16 DigraphAddEdge\n
  3.3-17 Digr\ aphAddEdgeOrbit\n
  3.3-18 Digraph\ AddEdges\n
\ 3.3-19 DigraphRemoveV\ ertex\n
&nb\ sp;3.3-20 DigraphRemoveVert\ ices\n
&nbs\ p;3.3-21 DigraphRemoveEdge<\ /a>\n
  3.3-22 DigraphRemoveEdgeOrbit<\ /a>\n
  3.3-23 DigraphRemoveEdges<\ /span>\n
  \ 3.3-24 DigraphRemoveLoops\n
  3.3-25 DigraphRemoveAllMultipleEdges\n
  3.3-26 DigraphReverseEdges<\ /span>\n
  \ 3.3-27 DigraphDisjointUnion\n
  3.3-28 DigraphEdgeUnion\n\
  3.3-29 DigraphJoin\n
  3.3-30 DigraphCartesianProduct\n
  3.3-31 DigraphDirectProduct\n
  3.3-32 DigraphCartesianProductProjections\n\
  3.3-33 DigraphDirectProductProjections\ \n
  3.3-34 LineDigraph\n
  3.3-35 LineUndirectedDigraph\n
  3.3-36 DoubleDigraph\n
  3.3-37 BipartiteDoubleDigraph\n
  3.3-38 DigraphAddAllLoops\n
  3.3-39 DistanceDigraph\n\
  3.3-40 DigraphClosure\n
  3.3-41 DigraphMycielskian\n
\n
3.4 Random digraphs\ \n\n
\n
  3.4-1 RandomDigraph\n
  3.4-2 R\ andomMultiDigraph\n
  3.4-3 Random\ Tournament\n
&nbs\ p; 3.4-4 RandomLattice\ \n
\n
3.\ 5 Standard examples\n\n
\n
  \ ;3.5-1 ChainDigraph\n
  3.5-2 CompleteDigraph\n
  3.5-3 CompleteBipartiteDigraph\n
  3.5-4 CompleteMultipartiteDigraph\ \n
  3.5-5 CycleDigraph\n
  3.5-6 EmptyDigraph\n
  3.5-7 JohnsonDigraph\n
\   3.5-8 PetersenGraph\n
  3.5\ -9 GeneralisedPetersenGraph\n
\n
\n
4 \ Operators\n
4.1 Operators for digraphs\n\n
\n
  \ ;4.1-1 IsSubdigraph\n
  4.1-2 IsUndirectedSpanningTree\n
\n
\n
5 Attributes and operations\n
&nbs\ p;5.1 Vertices and edges\n\n
\n
  5.1-1 DigraphVertices\n
  5.1-2 DigraphNrVertices\n
  5.1-3 DigraphEdges\n
  5.1-4 DigraphNrEdges\n
  5.1-\ 5 DigraphSinks\n
\   5.1-6 DigraphSo\ urces\n
&nb\ sp;5.1-7 DigraphTopological\ Sort\n
&nbs\ p;5.1-8 DigraphVertexLabel<\ /a>\n
  5.1-9 DigraphVertexLabels<\ /span>\n
  \ 5.1-10 DigraphEdgeLabel\ \n
  5.1-11 DigraphEdgeLabels\n
  5.1-12 DigraphInEdges\n
  5.1-13 DigraphOutEdges\n
  5.1-14 IsDigraphEdge\n
  5.1-15 IsMatching\n
  5.1\ -16 DigraphMaximalMatching\n
  5.1\ -17 DigraphMaximumMatching\n
\n
<\ span class=\"tocline\"> 5.2 Neighbours and degree\n\n
\n
  5.2-1 AdjacencyMatrix\n
  5.2-\ 2 CharacteristicPolynomial\n
  5.2\ -3 BooleanAdjacencyMatrix\n
  5.2-\ 4 DigraphAdjacencyFunction\n
  5.2\ -5 DigraphRange\n
  5.2-6 OutNeigh\ bours\n
&nb\ sp;5.2-7 InNeighbours\n
  <\ a href=\"chap5_mj.html#X7F5ACE807D1BC2E2\">5.2-8 OutDegrees\n
  5.2-9 InDegrees\n
  5.2-10 OutDegreeOfVertex\n  5.2-11 OutNeighboursOfVertex\n  5.2-12 InDegreeOfVertex\n
  5.2-13 InNeighboursOfVertex\n
  5.2-14 DigraphLoops\n
  5.2-15 \ PartialOrderDigraphMeetOfVertices\n
  5.2-16 DegreeMatrix\n
  5.2-1\ 7 LaplacianMatrix\n
\n
5.3 Reachability and connectivity\n\n
\n
  5.3-1 DigraphDiameter\n
  5.3-2\ DigraphShortestDistance\n
  5.3-3\ DigraphShortestDistances\n
  5.3-\ 4 DigraphLongestDistanceFromVertex\n
  5.3-5 DigraphDistanceSet\n
  \ 5.3-6 DigraphGirth\n
  5.3-7 Digra\ phOddGirth\n
&nbs\ p; 5.3-8 DigraphUndire\ ctedGirth\n
\ ; 5.3-9 DigraphConnect\ edComponents\n
&n\ bsp; 5.3-10 DigraphCon\ nectedComponent\n
  5.3-11 Digraph\ StronglyConnectedComponents\n
  5.\ 3-12 DigraphStronglyConnectedComponent\n
  5.3-13 DigraphBicomponents\n
<\ span class=\"nocss\">  5.3-14 ArticulationPoints\n
  5.3-15 DigraphPeriod\n
  5.3-1\ 6 DigraphFloydWarshall\n
  5.3-17 \ IsReachable\n
&nb\ sp; 5.3-18 DigraphPath\ \n
  5.3-19 DigraphShortestPath\n
  5.3-20 IteratorOfPaths\n
  5.3-21 DigraphAllSimpleCircuits\n
  5.3-22 DigraphLongestSimpleCircuit\n
  5.3-23 DigraphLayers\ \n
  5.3-24 DigraphDegeneracy\n
  5.3-25 DigraphDegeneracyOrdering\n\
  5.3-26 HamiltonianPath\n
  5.3-27 NrSpanningTrees\n
  5.3-28 DigraphDijkstra\n
\n
5.4 Cayley g\ raphs of groups\n\n
\n
  5.4-1 GroupOfCayleyDigraph\n
  5.4-2 GeneratorsOfCayleyDigraph\n
\ \n
\ 5.5 Associated semigroups\n\n
\n
  5.5-1 AsSemigroup\n
  5.5-2 AsSemigroup\n
\n
5.6 Planarity\ \n\n
\n
  5.6-1 KuratowskiPlanarSubdigraph\n
<\ span class=\"nocss\">  5.6-2 KuratowskiOuterPlanarSubdigraph\n
  5.6-3 PlanarEmbedding\n
<\ span class=\"nocss\">  5.6-4 OuterPlanarEmbedding\n
  5.6-5 SubdigraphHomeomorphicToK23\n
\n
\n
6 Properties of digraphs\n
6.1 Edge properties\n\ \n
\n
  6.1-1 Digra\ phHasLoops\n
&nbs\ p; 6.1-2 IsAntiSymmetr\ icDigraph\n
\ ; 6.1-3 IsBipartiteDig\ raph\n
&nbs\ p;6.1-4 IsCompleteBipartite\ Digraph\n
&\ nbsp;6.1-5 IsCompleteDigrap\ h\n
  <\ /span>6.1-6 IsCompleteMultipartite\ Digraph\n
&\ nbsp;6.1-7 IsEmptyDigraph\n
  6.1-8 IsEquivalenceDigraph<\ /span>\n
  \ 6.1-9 IsFunctionalDigraph\n
  6.1-10 IsMultiDigraph\n
  6.1-11 IsReflexiveDigraph\n
  6.1-12 IsSymmetricDigraph\n
  6.1-13 IsTournament\n
  6.1-14 IsTransitiveDigraph\n  6.1-15 IsPreorderDigraph\n
<\ span class=\"nocss\">  6.1-16 IsPartialOrderDigraph\n
  6.1-17 IsMeetSemilatticeDigraph\n
\n
6.2 Regularity\n\n
\n
  6.2-1 IsInRegularDigraph\n
  6.\ 2-2 IsOutRegularDigraph\n
  6.2-3\ IsRegularDigraph\n
  6.2-4 IsDist\ anceRegularDigraph\n
\n
6.3 Connectivity and cycles\ \n\n
\n
  6.\ 3-1 IsAcyclicDigraph\n
  6.3-2 IsC\ hainDigraph\n
&nb\ sp; 6.3-3 IsConnectedD\ igraph\n
&n\ bsp;6.3-4 IsBiconnectedDigr\ aph\n
  \ ;6.3-5 IsStronglyConnectedD\ igraph\n
&n\ bsp;6.3-6 IsAperiodicDigrap\ h\n
  <\ /span>6.3-7 IsDirectedTree\n
  6.3-8 IsUndirectedTree\n
  6.3-9 IsEulerianDigraph\n
  6.3-10 IsHamiltonianDigraph\n
  6.3-11 IsCycleDigraph\n
\n 6.4 Plana\ rity\n\n
\n\
  6.4-1 IsPlanarDigraph\n
  6.4-2 IsOuterPlanarDigraph\n
\n
6.5 Homomorphisms and tra\ nsformations\n\n
\n
  6.5-1 IsDigraphCore\n  6.5-2 IsEdgeTransitive\n
  6.5-3 IsVertexTransitive\n
\n
\n
7 Homomorphisms\n
7.\ 1 Acting on digraphs\n\n
\n
&nb\ sp;7.1-1 OnDigraphs\n
  7.1-2 OnMultiDigraphs\n
\n
7.2 Isomorphisms and canonical labellings\n\n
\n
&\ nbsp;7.2-1 DigraphsUseNauty\ \n
  7.2-2 AutomorphismGroup\n
  <\ a href=\"chap7_mj.html#X7E7B0D88865A89F6\">7.2-3 BlissAutomorphismGroup\n
  7.2-4 NautyAutomorphismGroup\n
  7.2-5 AutomorphismGroup\n<\ span class=\"ContSS\">
  7.2-6 AutomorphismGroup\n
  7.2-7 BlissCanonicalLabelling\n
  7.2-8 BlissCanonicalLabelling\n
  7.2-9 BlissCanonicalDigraph\n
  7.2-10 DigraphGroup\n
  7.2-11 DigraphOrbits\n
  7.2-12 DigraphOrbitReps\n
  7.2-13 DigraphSchreierVector\n
  7.2-14 DigraphStabilizer\n
  7.\ 2-15 IsIsomorphicDigraph\n
  7.2-1\ 6 IsIsomorphicDigraph\n
  7.2-17 I\ somorphismDigraphs\n
  7.2-18 Isom\ orphismDigraphs\n
  7.2-19 Represe\ ntativeOutNeighbours\n
  7.2-20 Is\ DigraphIsomorphism\n
  7.2-21 IsDi\ graphColouring\n
\n
7.3 Homomorphisms of digraphs\ \n\n
\n
  7.\ 3-1 HomomorphismDigraphsFinder\n
  7.3-2 DigraphHomomorphism\n
  7.3\ -3 HomomorphismsDigraphs\n
  7.3-4\ DigraphMonomorphism\n
  7.3-5 Mon\ omorphismsDigraphs\n
  7.3-6 Digra\ phEpimorphism\n
&\ nbsp; 7.3-7 Epimorphis\ msDigraphs\n
&nbs\ p; 7.3-8 DigraphEmbedd\ ing\n
  \ ;7.3-9 EmbeddingsDigraphs\n
  7.3-10 IsDigraphHomomorphism\n
  7.3-11 IsDigraphEmbedding\n
  7.3-12 DigraphsRespectsColouring\ \n
  7.3-13 GeneratorsOfEndomorphismMo\ noid\n
&nbs\ p;7.3-14 DigraphColouring\n
  7.3-15 DigraphGreedyColouring\n
  7.3-16 DigraphWelshPowellOrder<\ /a>\n
  7.3-17 ChromaticNumber\n
  7.3-18 DigraphCore\n
\
\n
\n
8 Finding cliques and independent sets\n
\ ;8.1 Finding cliques\n\n
\n
  8.1-1 IsClique\n<\ br />  8.1-2 CliquesFinder\n
  8.1-3 DigraphClique\n
  8.1-4 D\ igraphMaximalCliques\n
  8.1-5 Cli\ queNumber\n
\n
8.2 Finding independent sets\n\n
\n
  8.2-1 IsIn\ dependentSet\n
&n\ bsp; 8.2-2 DigraphInde\ pendentSet\n
&nbs\ p; 8.2-3 DigraphMaxima\ lIndependentSets\n
\n
\n
9 Visualising\ and IO\n
9.1 Visualising a digraph\n\n
\n
  9.1-1 Splash\n
  9.1-2 DotDigraph\n
  9.1-3 DotSymmetricDigraph\n
  9.1-4 DotPartialOrderDigraph\n
  9.1-5 DotPreorderDigraph\n  9.1-6 DotHighlightedDigraph\n
\n
9.2 Reading and wr\ iting digraphs to a file\n\n
\n
  9.2-1 String\n
  9.2-2 DigraphFromGraph6String\n
  9.2-3 Graph6String\n
  9.2-4 DigraphFile\n
  9.2-5 R\ eadDigraphs\n
&nb\ sp; 9.2-6 WriteDigraph\ s\n
  <\ /span>9.2-7 IteratorFromDigraphFil\ e\n
  <\ /span>9.2-8 DigraphPlainTextLineEn\ coder\n
&nb\ sp;9.2-9 TournamentLineDeco\ der\n
  \ ;9.2-10 AdjacencyMatrixUppe\ rTriangleLineDecoder\n
  9.2-11 TC\ odeDecoder\n
&nbs\ p; 9.2-12 PlainTextStr\ ing\n
  \ ;9.2-13 WritePlainTextDigra\ ph\n
  \ 9.2-14 WriteDIMACSDigraph\n
\n
\n
A \n Grape to Digraphs Comma\ nd Map\n \n
A.1 \n Functions to construct and modify graphs\n \n\n
\n
A\ .2 \n Functions to inspect graphs, vertices and e\ dges\n \n\n
\n
A.3 \n Functions to determine regulari\ ty properties of graphs\n \n\n
\n
A.4 \n Some special\ vertex subsets of a graph\n \n\n
\n
A.5 \n Functions\ to construct new graphs from old\n \n\n
\n
A.6 \n Ve\ rtex-Colouring and Complete Subgraphs\n \n\n
\n
\ A.7 \n \ Automorphism groups and isomorphism testing for graphs\n \n\n
\n
\n
References
\n
Index
\n
1 \n The Digraphs package\n <\ /a>\n
&nb\ sp;1.1 Introduction\n\n
\n
  1.1-1 Definitions\ \n\n
\n
\n
2 Installing Digraphs\n
2.1 For those in a hurry\n\n\n
&nb\ sp;2.2 Optional package dependencies\n\n
\n
  2.2-1 The Gr\ ape package\n\n
\n
2.3 Compiling the kernel module\n\n
\n
2.4 \ Rebuilding the documentation\n\n\n
&n\ bsp; 2.4-1 DigraphsMak\ eDoc\n
\n
2.5 Testing your installation\n\n\
\n
  2.5-1 Digrap\ hsTestInstall\n
&\ nbsp; 2.5-2 DigraphsTe\ stStandard\n
&nbs\ p; 2.5-3 DigraphsTestE\ xtreme\n
\n
\n
3 Creating digraphs\n
3.1 Creating digraphs\n\n
\n
  3.1-1 IsDigraph\n
  3.1-2 IsMutableDigraph\n\
  3.1-3 IsImmutableDigraph\n
  3.1-4 IsCayleyDigraph\n
  \ 3.1-5 IsDigraphWithAdjacencyFunction\n
\   3.1-6 DigraphByOutNeighboursType\n  3.1-7 Digraph\n
  3.1-8\ DigraphByAdjacencyMatrix\n
  3.1-\ 9 DigraphByEdges\n
  3.1-10 EdgeO\ rbitsDigraph\n
&n\ bsp; 3.1-11 DigraphByI\ nNeighbours\n
&nb\ sp; 3.1-12 CayleyDigra\ ph\n
\n
<\ span class=\"nocss\"> \ 3.2 Changing representations\n\n\n
&n\ bsp; 3.2-1 AsBinaryRel\ ation\n
&nb\ sp;3.2-2 AsDigraph\n
  3.2-3 Graph\n
  3.2-4 AsGraph\n
<\ span class=\"nocss\">  3.2-5 AsTransformation\n
\n
3.3 New digraphs from old\n\n
\n
<\ span class=\"nocss\">  3.3-1 DigraphImmutableCopy\n
  3.3-2 DigraphImmutableCopyIfImmutable\n  3.3-3 InducedSubdigraph\n
  3.3-4 ReducedDigraph\n
  3.3-\ 5 MaximalSymmetricSubdigraph\n
  3\ .3-6 MaximalAntiSymmetricSubdigraph\n
<\ span class=\"nocss\">  3.3-7 UndirectedSpanningForest\n
\   3.3-8 QuotientDigraph\n
  3\ .3-9 DigraphReverse\n
  3.3-10 Dig\ raphDual\n
\ 3.3-11 DigraphSymmetr\ icClosure\n
\ ; 3.3-12 DigraphTransi\ tiveClosure\n
&nb\ sp; 3.3-13 DigraphTran\ sitiveReduction\n
  3.3-14 Digraph\ AddVertex\n
\ ; 3.3-15 DigraphAddVer\ tices\n
&nb\ sp;3.3-16 DigraphAddEdge\n
  3.3-17 DigraphAddEdgeOrbit\n
  <\ a href=\"chap3_mj.html#X8693A61B7F752C76\">3.3-18 DigraphAddEdges\n\
  3.3-19 DigraphRemoveVertex\n
  3.3-20 DigraphRemoveVertices\n
  3.3-21 DigraphRemoveEdge\n
  3.3-22 DigraphRemoveEdgeOrbit\n
  3.3-23 DigraphRemoveEdges\n
  3.3-24 DigraphRemoveLoops\n
  3.3-25 DigraphRemoveAllMultipleEdges\n
  3.3-26 DigraphReverseEdges\n
  3.3-27 DigraphDisjointUnion\n
  3.3-28 DigraphEdgeUnion\n
  3.3-29 DigraphJoin\n
  3.3-30 DigraphCartesianProduct\n
<\ span class=\"nocss\">  3.3-31 DigraphDirectProduct\n
  3.3-32 DigraphCartesianProductProjections\n
  3.3-33 DigraphDirectProductProjections\n
  3.3-34 LineDigraph\n
  3.3-35 LineUndirectedDigraph\n\
  3.3-36 DoubleDigraph\n
  3.3-37 BipartiteDoubleDigraph\n
  3.3-38 DigraphAddAllLoops\n
  \ 3.3-39 DistanceDigraph\n
  3.3-40 \ DigraphClosure\n
\   3.3-41 DigraphM\ ycielskian\n
\n
3.4 Random digraphs\n\n
\n
&nb\ sp; 3.4-1 RandomDigrap\ h\n
  <\ /span>3.4-2 RandomMultiDigraph\ \n
  3.4-3 RandomTournament\ \n
  3.4-4 RandomLattice\n
\n
&n\ bsp;3.5 Standard examples\n\n
\n
  3.5-1 ChainDigraph\n
  3.5-2 CompleteDigraph\n<\ br />  3.5-3 CompleteBipartiteDigraph\n\
  3.5-4 CompleteMultipartiteDigraph\n
  3.5-5 CycleDigraph\n
<\ span class=\"nocss\">  3.5-6 EmptyDigraph\n
  3.5-7\ JohnsonDigraph\n
  3.5-8 Petersen\ Graph\n
&nb\ sp;3.5-9 GeneralisedPeterse\ nGraph\n
\n
\n
4 Operators\ \n
\ 4.1 Operators for digraphs\n\n
\n
  4.1-1 IsSubdigraph\n
  4.1-2 IsUndirectedSpanningTree\n
\n\
\n
5 \ Attributes and operations\n
5.1 Vertices and edge\ s\n\n
\n  5.1-1 DigraphVertices\n
  5.1-2 DigraphNrVertices\n
  5.1\ -3 DigraphEdges\n
  5.1-4 DigraphN\ rEdges\n
&n\ bsp;5.1-5 DigraphSinks<\ /span>\n
  \ 5.1-6 DigraphSources\n<\ span class=\"ContSS\">
  5.1-7 DigraphTopologicalSort\n<\ span class=\"ContSS\">
  5.1-8 DigraphVertexLabel\n
  5.1-9 DigraphVertexLabels\n
  5.1-10 DigraphEdgeLabel\n
  5.1-11 DigraphEdgeLabels\n
  5.1-12 DigraphInEdges\n
  5.1-13 DigraphOutEdges\n
  5.1-14 IsDigraphEdge\n
  5.1-15 I\ sMatching\n
\ ; 5.1-16 DigraphMaxima\ lMatching\n
\ ; 5.1-17 DigraphMaximu\ mMatching\n
\n
5.2 Neighbours and degree\n\n\
\n
  5.2-1 Adjace\ ncyMatrix\n
\ ; 5.2-2 Characteristic\ Polynomial\n
&nbs\ p; 5.2-3 BooleanAdjace\ ncyMatrix\n
\ ; 5.2-4 DigraphAdjacen\ cyFunction\n
&nbs\ p; 5.2-5 DigraphRange<\ /a>\n
  5.2-6 OutNeighbours\ \n
  5.2-7 InNeighbours\n
  5.2-8 OutDegrees\n
  5.2-9 InDegrees\n
  \ 5.2-10 OutDegreeOfVertex\n
  5.2-1\ 1 OutNeighboursOfVertex\n
  5.2-1\ 2 InDegreeOfVertex\n
  5.2-13 InNe\ ighboursOfVertex\n
  5.2-14 Digra\ phLoops\n
&\ nbsp;5.2-15 PartialOrderDig\ raphMeetOfVertices\n
  5.2-16 Degr\ eeMatrix\n
\ 5.2-17 LaplacianMatri\ x\n
\n
5\ .3 Reachability and connectivity\n\n\
\n
  5.3-1 Digrap\ hDiameter\n
\ ; 5.3-2 DigraphShortes\ tDistance\n
\ ; 5.3-3 DigraphShortes\ tDistances\n
&nbs\ p; 5.3-4 DigraphLonges\ tDistanceFromVertex\n
  5.3-5 Digr\ aphDistanceSet\n
\   5.3-6 DigraphGi\ rth\n
  \ ;5.3-7 DigraphOddGirth<\ /span>\n
  \ 5.3-8 DigraphUndirectedGirth\n
  <\ a href=\"chap5_mj.html#X842FAD6A7B835977\">5.3-9 DigraphConnectedComponents\n
  5.3-10 DigraphConnectedComponent\ \n
  5.3-11 DigraphStronglyConnect\ edComponents\n
&n\ bsp; 5.3-12 DigraphStr\ onglyConnectedComponent\n
  5.3-1\ 3 DigraphBicomponents\n
  5.3-14 A\ rticulationPoints\n
  5.3-15 Digra\ phPeriod\n
\ 5.3-16 DigraphFloydWa\ rshall\n
&n\ bsp;5.3-17 IsReachable<\ /span>\n
  \ 5.3-18 DigraphPath\n
  5.3-19 DigraphShortestPath\n
  5.3-20 IteratorOfPaths\n
  5.3-21 DigraphAllSimpleCircuits\n
  5.3-22 DigraphLongestSimpleCircuit\n
  5.3-23 DigraphLayers\n
  5.3-24 DigraphDegeneracy\n
  5.3-25 DigraphDegeneracyOrdering\n
  5.3-26 HamiltonianPath\n\
  5.3-27 NrSpanningTrees\n
<\ span class=\"nocss\">  5.3-28 DigraphDijkstra\n
\n
5.4 Cayley graphs of groups<\ /span>\n\n
\n
  5.4-1 GroupOfCayleyDigraph\n
  5.4-2 GeneratorsOfCayleyDigraph\n
\n
5.5 Associated semig\ roups\n\n
\n
  5.5-1 AsSemigroup\n
  5.5-2 AsSemigroup\n
\n
5.6 Planarity\n\n<\ div class=\"ContSSBlock\">\n
  5.6-1 Kuratows\ kiPlanarSubdigraph\n
  5.6-2 Kurat\ owskiOuterPlanarSubdigraph\n
  5.6\ -3 PlanarEmbedding\n
  5.6-4 Outer\ PlanarEmbedding\n
  5.6-5 Subdigra\ phHomeomorphicToK23\n
\n
\n
\ 6 Properti\ es of digraphs\n
6.\ 1 Edge properties\n\n
\n
  <\ /span>6.1-1 DigraphHasLoops\n
  6.1-2 IsAntiSymmetricDigraph\n
  6.1-3 IsBipartiteDigraph\n\
  6.1-4 IsCompleteBipartiteDigraph\n
  6.1-5 IsCompleteDigraph\n
  6.1-6 IsCompleteMultipartiteDigraph\n
  6.1-7 IsEmptyDigraph\n
  6.1-8 IsEquivalenceDigraph\n
  6.1-9 IsFunctionalDigraph\n
  6.1-10 IsMultiDigraph\n
  6.1-11 IsReflexiveDigraph\n<\ br />  6.1-12 IsSymmetricDigraph\n
  6.1-13 IsTournament\n
  6.\ 1-14 IsTransitiveDigraph\n
  6.1-1\ 5 IsPreorderDigraph\n
  6.1-16 IsP\ artialOrderDigraph\n
  6.1-17 IsMe\ etSemilatticeDigraph\n
\n
6.2 Regularity\n\n\
\n
  6.2-1 IsInRe\ gularDigraph\n
&n\ bsp; 6.2-2 IsOutRegula\ rDigraph\n
\ 6.2-3 IsRegularDigrap\ h\n
  <\ /span>6.2-4 IsDistanceRegularDigra\ ph\n
\n
<\ span class=\"nocss\"> \ 6.3 Connectivity and cycles\n\n
\n
&nb\ sp; 6.3-1 IsAcyclicDig\ raph\n
&nbs\ p;6.3-2 IsChainDigraph<\ /span>\n
  \ 6.3-3 IsConnectedDigraph\n
  6.3-4 IsBiconnectedDigraph\n\
  6.3-5 IsStronglyConnectedDigraph\n
  6.3-6 IsAperiodicDigraph\n
  6.3-7 IsDirectedTree\n
  6.3-8 IsUndirectedTree\n
  6.3-9 IsEulerianDigraph\n<\ br />  6.3-10 IsHamiltonianDigraph\n  6.3-11 IsCycleDigraph\n
\n
6.4 Planarity\ \n\n
\n
  6.\ 4-1 IsPlanarDigraph\n
  6.4-2 IsOu\ terPlanarDigraph\n
\n
6.5 Homomorphisms and transformations\n\n
\n
<\ span class=\"nocss\">  6.5-1 IsDigraphCore\n
  6.5-\ 2 IsEdgeTransitive\n
  6.5-3 IsVer\ texTransitive\n
\n
\n
7 Homomorphisms<\ /span>\n
7.1 Acting on digraphs\n\n
\n
  7.1-1 OnDigraphs\n
  7.1-2 OnMultiDigraphs\n
\n 7.2 Isomo\ rphisms and canonical labellings\n\n
\n
  7.2-1 DigraphsUseNauty\n
  7.2-2 AutomorphismGroup\n
  7.2-3 BlissAutomorphismGroup\n
  7.2-4 NautyAutomorphismGroup\n
  7.2-5 AutomorphismGroup\n
  7.2-6 AutomorphismGroup\n
  7.2-7 BlissCanonicalLabelling\n
  7.2-8 BlissCanonicalLabelling\n
  7.2-9 BlissCanonicalDigraph\n<\ br />  7.2-10 DigraphGroup\n
  7.2-11 DigraphOrbits\n
  7.2-1\ 2 DigraphOrbitReps\n
  7.2-13 Digr\ aphSchreierVector\n
  7.2-14 Digra\ phStabilizer\n
&n\ bsp; 7.2-15 IsIsomorph\ icDigraph\n
\ ; 7.2-16 IsIsomorphicD\ igraph\n
&n\ bsp;7.2-17 IsomorphismDigra\ phs\n
  \ ;7.2-18 IsomorphismDigraphs\ \n
  7.2-19 RepresentativeOutNeigh\ bours\n
&nb\ sp;7.2-20 IsDigraphIsomorph\ ism\n
  \ ;7.2-21 IsDigraphColouring<\ /a>\n
\n
7.3\ Homomorphisms of digraphs\n\n
\n
&nbs\ p; 7.3-1 HomomorphismD\ igraphsFinder\n
&\ nbsp; 7.3-2 DigraphHom\ omorphism\n
\ ; 7.3-3 HomomorphismsD\ igraphs\n
&\ nbsp;7.3-4 DigraphMonomorph\ ism\n
  \ ;7.3-5 MonomorphismsDigraph\ s\n
  <\ /span>7.3-6 DigraphEpimorphism\ \n
  7.3-7 EpimorphismsDigraphs\n
  7.3-8 DigraphEmbedding\n<\ span class=\"ContSS\">
  7.3-9 EmbeddingsDigraphs\n
  7.3-10 IsDigraphHomomorphism\n
  7.3-11 IsDigraphEmbedding\n
  7.3-12 DigraphsRespectsColouring\n
  7.3-13 GeneratorsOfEndomorphismMonoid\ \n
  7.3-14 DigraphColouring\n
  7.3-15 DigraphGreedyColouring\n
  7.3-16 DigraphWelshPowellOrder\n
  7.3-17 ChromaticNumber\n
  7.3-18 DigraphCore\n
\n
\ \n
8 Finding cliques and independent sets\n
8.1 Finding cliq\ ues\n\n
\n<\ br />  8.1-1 IsClique\n
  8.1\ -2 CliquesFinder\n
  8.1-3 Digrap\ hClique\n
&\ nbsp;8.1-4 DigraphMaximalCl\ iques\n
&nb\ sp;8.1-5 CliqueNumber\n
\n
8.2 Finding independent sets\n\n
\n
&nb\ sp;8.2-1 IsIndependentSet\n
  8.2-2 DigraphIndependentSet\ \n
  8.2-3 DigraphMaximalIndependentSe\ ts\n
\n
\n
9 Visualising and IO\ \n
&n\ bsp;9.1 Visualising a digraph\n\n
\n<\ span class=\"ContSS\">
  9.1-1 Splash\n
  9.1-2 DotDigraph\n
<\ span class=\"nocss\">  9.1-3 DotSymmetricDigraph\n
  9.1-4 DotPartialOrderDigraph\n
  9.1-5 DotPreorderDigraph\n
  9.\ 1-6 DotHighlightedDigraph\n
\n
9.2 Reading and writing digraph\ s to a file\n\n
\n
  9.2-1 String\n
  9.2-2 DigraphFromGraph6String\n
  9.2-3 Graph6String\n
  9.2-4 Di\ graphFile\n
\ ; 9.2-5 ReadDigraphs\n
  9.2-6 WriteDigraphs\ \n
  9.2-7 IteratorFromDigraphFile\ \n
  9.2-8 DigraphPlainTextLineEncoder\n
  9.2-9 TournamentLineDecoder\n
  9.2-10 AdjacencyMatrixUpperTriangleLin\ eDecoder\n
\ 9.2-11 TCodeDecoder\n
  9.2-12 PlainTextString\n
  9.2-13 WritePlainTextDigraph\n
  9.2-14 WriteDIMACSDigraph\n<\ /div>
\n
\n
A \n Grape to Digraphs Command Map\n \n
A.1 \n Functions to construct and modify graphs\n \n<\ /span>\n
\n
A.2 \n Functions to inspect graphs, vertices and edges\n \n\n
\n
A\ .3 \n Functions to determine regularity propertie\ s of graphs\n \n\n
\n
A.4 \n Some special vertex subs\ ets of a graph\n \n\n
\n
A.5 \n Functions to construc\ t new graphs from old\n \n\n
\n
A.6 \n Vertex-Colouri\ ng and Complete Subgraphs\n \n\n
\n
A.7 \n Automorphi\ sm groups and isomorphism testing for graphs\n \n\n
\ \n
\n
References
\n
Index
\n" ) gap> gap> #I Digraphs package is not available. To see further details, enter #I SetInfoLevel(InfoPackageLoading,4); and try to load the package again. #I File: /builddir/build/BUILD/digraphs-1.2.1/../pkg/digraphs-1.2.1/doc/manual.lab written. gap> gap> + rm -fr ../pkg + RPM_EC=0 ++ jobs -p + exit 0 Executing(%install): /bin/sh -e /var/tmp/rpm-tmp.zDSTyK + umask 022 + cd /builddir/build/BUILD + '[' /builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64 '!=' / ']' + rm -rf /builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64 ++ dirname /builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64 + mkdir -p /builddir/build/BUILDROOT + mkdir /builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64 + cd digraphs-1.2.1 + mkdir -p /builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64/usr/lib/gap/pkg/digraphs-1.2.1/doc + cp -a bin data gap tst VERSIONS PackageInfo.g init.g makedoc.g read.g /builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64/usr/lib/gap/pkg/digraphs-1.2.1 + cp -p doc/digraphs.bib doc/lefttoc.css doc/manual.css doc/nocolorprompt.css doc/ragged.css doc/times.css doc/toggless.css doc/chap0.html doc/chap0_mj.html doc/chap1.html doc/chap1_mj.html doc/chap2.html doc/chap2_mj.html doc/chap3.html doc/chap3_mj.html doc/chap4.html doc/chap4_mj.html doc/chap5.html doc/chap5_mj.html doc/chap6.html doc/chap6_mj.html doc/chap7.html doc/chap7_mj.html doc/chap8.html doc/chap8_mj.html doc/chap9.html doc/chap9_mj.html doc/chapA.html doc/chapA_mj.html doc/chapBib.html doc/chapBib_mj.html doc/chapInd.html doc/chapInd_mj.html doc/chooser.html doc/manual.js doc/rainbow.js doc/toggless.js doc/manual.lab doc/manual.pdf doc/manual.six doc/chap0.txt doc/chap1.txt doc/chap2.txt doc/chap3.txt doc/chap4.txt doc/chap5.txt doc/chap6.txt doc/chap7.txt doc/chap8.txt doc/chap9.txt doc/chapA.txt doc/chapBib.txt doc/chapInd.txt doc/attr.xml doc/cliques.xml doc/constructors.xml doc/digraph.xml doc/display.xml doc/examples.xml doc/grahom.xml doc/grape.xml doc/io.xml doc/isomorph.xml doc/labels.xml doc/main.xml doc/oper.xml doc/orbits.xml doc/planar.xml doc/prop.xml doc/utils.xml doc/z-appA.xml doc/z-chap0.xml doc/z-chap1.xml doc/z-chap2.xml doc/z-chap3.xml doc/z-chap4.xml doc/z-chap5.xml doc/z-chap6.xml doc/z-chap8.xml doc/z-chap9.xml doc/z-title.xml /builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64/usr/lib/gap/pkg/digraphs-1.2.1/doc + /usr/lib/rpm/find-debuginfo.sh -j8 --strict-build-id -m -i --build-id-seed 1.2.1-1.fc33 --unique-debug-suffix -1.2.1-1.fc33.riscv64 --unique-debug-src-base gap-pkg-digraphs-1.2.1-1.fc33.riscv64 --run-dwz --dwz-low-mem-die-limit 10000000 --dwz-max-die-limit 50000000 -S debugsourcefiles.list /builddir/build/BUILD/digraphs-1.2.1 explicitly decompress any DWARF compressed ELF sections in /builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64/usr/lib/gap/pkg/digraphs-1.2.1/bin/riscv64-redhat-linux-gnu-default64-kv7/digraphs.so extracting debug info from /builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64/usr/lib/gap/pkg/digraphs-1.2.1/bin/riscv64-redhat-linux-gnu-default64-kv7/digraphs.so original debug info size: 2840kB, size after compression: 2676kB /usr/lib/rpm/sepdebugcrcfix: Updated 1 CRC32s, 0 CRC32s did match. 980 blocks + /usr/lib/rpm/check-buildroot + /usr/lib/rpm/redhat/brp-ldconfig + /usr/lib/rpm/brp-compress + /usr/lib/rpm/redhat/brp-strip-lto /usr/bin/strip + /usr/lib/rpm/brp-strip-static-archive /usr/bin/strip + /usr/lib/rpm/redhat/brp-python-bytecompile /usr/bin/python 1 0 + /usr/lib/rpm/brp-python-hardlink + /usr/lib/rpm/redhat/brp-mangle-shebangs *** WARNING: ./usr/src/debug/gap-pkg-digraphs-1.2.1-1.fc33.riscv64/extern/bliss-0.73/graph.cc is executable but has no shebang, removing executable bit Executing(%check): /bin/sh -e /var/tmp/rpm-tmp.saif8L + umask 022 + cd /builddir/build/BUILD + cd digraphs-1.2.1 + export LC_ALL=C.UTF-8 + LC_ALL=C.UTF-8 + cd tst + gap -l '/builddir/build/BUILDROOT/gap-pkg-digraphs-1.2.1-1.fc33.riscv64/usr/lib/gap;/usr/lib/gap' ┌───────┐ GAP 4.11.0 of 29-Feb-2020 │ GAP │ https://www.gap-system.org └───────┘ Architecture: riscv64-redhat-linux-gnu-default64-kv7 Configuration: gmp 6.2.0, GASMAN, readline Loading the library and packages ... #I autpgrp package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I alnuth package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I crisp package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I ctbllib package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I factint package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I fga package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I irredsol package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I laguna package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I polenta package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I polycyclic package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I resclasses package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I sophus package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') #I tomlib package is not available. Check that the name is correct #I and it is present in one of the GAP root directories (see '??RootPaths') Packages: GAPDoc 1.6.3, PrimGrp 3.4.1, SmallGrp 1.4.1, TransGrp 2.0.5 Try '??help' for help. See also '?copyright', '?cite' and '?authors' gap> #I Digraphs package is not available. To see further details, enter #I SetInfoLevel(InfoPackageLoading,4); and try to load the package again. fail gap> ########> Diff in testinstall.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in testinstall.tst:17 # Input is: gr := Digraph( [[8], [4, 5, 6, 8, 9], [2, 4, 5, 7, 10], [9], [1, 4, 6, 7, 9], [2, 3, 6, 7, 10], [3, 4, 5, 8, 9], [3, 4, 9, 10], [1, 2, 3, 5, 6, 9, 10], [2, 4, 5, 6, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:22 # Input is: OutNeighbours(gr); # Expected output: [ [ 8 ], [ 4, 5, 6, 8, 9 ], [ 2, 4, 5, 7, 10 ], [ 9 ], [ 1, 4, 6, 7, 9 ], [ 2, 3, 6, 7, 10 ], [ 3, 4, 5, 8, 9 ], [ 3, 4, 9, 10 ], [ 1, 2, 3, 5, 6, 9, 10 ], [ 2, 4, 5, 6, 9 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in testinstall.tst:26 # Input is: not DIGRAPHS_IsGrapeLoaded or (DIGRAPHS_IsGrapeLoaded and Digraph(Graph(gr)) = gr); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_IsGrapeLoaded' must have a value ######## ########> Diff in testinstall.tst:29 # Input is: not DIGRAPHS_IsGrapeLoaded or (DIGRAPHS_IsGrapeLoaded and Graph(Digraph(Graph(gr))).adjacencies = Graph(gr).adjacencies); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_IsGrapeLoaded' must have a value ######## ########> Diff in testinstall.tst:41 # Input is: not DIGRAPHS_IsGrapeLoaded or (DIGRAPHS_IsGrapeLoaded and Digraph(Graph(Group(()), [1 .. 20], OnPoints, func, true)) = Digraph(adj)); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_IsGrapeLoaded' must have a value ######## ########> Diff in testinstall.tst:47 # Input is: gr := Digraph([ [1, 2, 4, 10], [3, 15], [3, 15], [1, 3, 7, 8, 9, 11, 12, 13], [4, 8], [1, 2, 4, 5, 6, 7, 8, 10, 14, 15], [3, 4, 6, 11, 13, 15], [3, 5, 6, 7, 8, 9, 10, 15], [2, 5, 6, 7, 8, 9, 10, 11, 12], [2, 3, 10, 11, 14], [3, 5, 14, 15], [7, 9, 10, 14, 15], [1, 4, 7, 8, 10, 14, 15], [1, 2, 4, 7, 13, 14, 15], [1, 2, 3, 9, 10, 11, 12, 13, 14, 15]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:55 # Input is: IsMultiDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in testinstall.tst:57 # Input is: IsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in testinstall.tst:67 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:69 # Input is: IsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in testinstall.tst:71 # Input is: gr := DigraphRemoveEdge(gr, 10000, 1); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in testinstall.tst:73 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in testinstall.tst:75 # Input is: gr := Digraph([[2, 3], [4, 5], [5, 6], [], [], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:77 # Input is: IsDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsDigraph' must have a value ######## ########> Diff in testinstall.tst:82 # Input is: gr := Digraph(rec(DigraphNrVertices := 1000, DigraphSource := [1 .. 1000], DigraphRange := Concatenation([2 .. 1000], [1])));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:85 # Input is: OutNeighbours(gr);; # Expected output: # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in testinstall.tst:88 # Input is: d := Digraph(rec(DigraphVertices := [1 .. 5], DigraphRange := [], DigraphSource := [])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:92 # Input is: IsMultiDigraph(d); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in testinstall.tst:96 # Input is: DigraphFromSparse6String(":Fa@x^"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in testinstall.tst:100 # Input is: gr := Digraph([[4], [2, 2], [2, 3, 1, 4], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:102 # Input is: InDegreeOfVertex(gr, 2); # Expected output: 3 # But found: Error, Variable: 'InDegreeOfVertex' must have a value ######## ########> Diff in testinstall.tst:104 # Input is: InNeighboursOfVertex(gr, 2); # Expected output: [ 2, 2, 3 ] # But found: Error, Variable: 'InNeighboursOfVertex' must have a value ######## ########> Diff in testinstall.tst:106 # Input is: InNeighbours(gr); # Expected output: [ [ 3, 4 ], [ 2, 2, 3 ], [ 3 ], [ 1, 3 ] ] # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in testinstall.tst:108 # Input is: gr := Digraph(rec(DigraphNrVertices := 10, DigraphSource := [1, 1, 2, 3, 3, 3], DigraphRange := [3, 1, 1, 4, 4, 1])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:112 # Input is: InNeighboursOfVertex(gr, 5); # Expected output: [ ] # But found: Error, Variable: 'InNeighboursOfVertex' must have a value ######## ########> Diff in testinstall.tst:114 # Input is: InDegreeOfVertex(gr, 5); # Expected output: 0 # But found: Error, Variable: 'InDegreeOfVertex' must have a value ######## ########> Diff in testinstall.tst:116 # Input is: InNeighbours(gr); # Expected output: [ [ 1, 2, 3 ], [ ], [ 1 ], [ 3, 3 ], [ ], [ ], [ ], [ ], [ ], [ ] ] # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in testinstall.tst:118 # Input is: InDegreeOfVertex(gr, 1); # Expected output: 3 # But found: Error, Variable: 'InDegreeOfVertex' must have a value ######## ########> Diff in testinstall.tst:120 # Input is: OutDegreeOfVertex(gr, 3); # Expected output: 3 # But found: Error, Variable: 'OutDegreeOfVertex' must have a value ######## ########> Diff in testinstall.tst:122 # Input is: OutNeighboursOfVertex(gr, 3); # Expected output: [ 4, 4, 1 ] # But found: Error, Variable: 'OutNeighboursOfVertex' must have a value ######## ########> Diff in testinstall.tst:124 # Input is: OutNeighbours(gr); # Expected output: [ [ 3, 1 ], [ 1 ], [ 4, 4, 1 ], [ ], [ ], [ ], [ ], [ ], [ ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in testinstall.tst:128 # Input is: gr := Digraph([[5, 5, 1, 5], [], [], [2, 3, 1], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:130 # Input is: DigraphInEdges(gr, 5); # Expected output: [ [ 1, 5 ], [ 1, 5 ], [ 1, 5 ] ] # But found: Error, Variable: 'DigraphInEdges' must have a value ######## ########> Diff in testinstall.tst:132 # Input is: DigraphOutEdges(gr, 2); # Expected output: [ ] # But found: Error, Variable: 'DigraphOutEdges' must have a value ######## ########> Diff in testinstall.tst:134 # Input is: DigraphOutEdges(gr, 4); # Expected output: [ [ 4, 2 ], [ 4, 3 ], [ 4, 1 ] ] # But found: Error, Variable: 'DigraphOutEdges' must have a value ######## ########> Diff in testinstall.tst:138 # Input is: gr := Digraph([[2], [3], [4], [5], [1], [7], [6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:140 # Input is: DigraphPeriod(gr); # Expected output: 1 # But found: Error, Variable: 'DigraphPeriod' must have a value ######## ########> Diff in testinstall.tst:142 # Input is: IsAperiodicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAperiodicDigraph' must have a value ######## ########> Diff in testinstall.tst:144 # Input is: gr := Digraph([[2], [3], [4], [5], [6], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:146 # Input is: DigraphPeriod(gr); # Expected output: 6 # But found: Error, Variable: 'DigraphPeriod' must have a value ######## ########> Diff in testinstall.tst:148 # Input is: IsAperiodicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAperiodicDigraph' must have a value ######## ########> Diff in testinstall.tst:152 # Input is: gr := Digraph(rec(DigraphNrVertices := 5, DigraphSource := [1, 2, 3, 4, 5], DigraphRange := [2, 3, 4, 5, 1])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:156 # Input is: IsDigraphEdge(gr, [1, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in testinstall.tst:158 # Input is: IsDigraphEdge(gr, [2, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in testinstall.tst:164 # Input is: gr := Digraph([[2], [3, 5], [4], [5], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:166 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 2 ], [ 2, 3 ], [ 2, 5 ], [ 3, 4 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in testinstall.tst:168 # Input is: gr2 := DigraphReverseEdge(gr, [2, 3]); # Expected output: # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in testinstall.tst:170 # Input is: DigraphEdges(gr2); # Expected output: [ [ 1, 2 ], [ 2, 5 ], [ 3, 4 ], [ 3, 2 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in testinstall.tst:174 # Input is: gr := Digraph([[1, 2, 3], [3, 5], [4], [5], [1, 2], [5, 7], [6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:176 # Input is: gr2 := DigraphReverseEdge(gr, [1, 1]); # Expected output: # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in testinstall.tst:178 # Input is: gr = gr2; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in testinstall.tst:180 # Input is: gr2 := DigraphReverseEdge(gr, 1, 2); # Expected output: # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in testinstall.tst:184 # Input is: gr := Digraph([[2, 3], [3], [], [5, 6], [6], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:186 # Input is: topo := DigraphTopologicalSort(gr); # Expected output: [ 3, 2, 1, 6, 5, 4 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in testinstall.tst:188 # Input is: p := Permutation(Transformation(topo), topo); # Expected output: (1,3)(4,6) # But found: Error, Variable: 'topo' must have a value ######## ########> Diff in testinstall.tst:190 # Input is: gr1 := OnDigraphs(gr, p);; # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in testinstall.tst:191 # Input is: DigraphTopologicalSort(gr1) = DigraphVertices(gr1); # Expected output: true # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in testinstall.tst:193 # Input is: gr := Digraph([[], [3], [], [5], [], [2, 3, 7, 1], [1], [2, 3, 4, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:195 # Input is: topo := DigraphTopologicalSort(gr); # Expected output: [ 1, 3, 2, 5, 4, 7, 6, 8 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in testinstall.tst:197 # Input is: p := Permutation(Transformation(topo), topo); # Expected output: (2,3)(4,5)(6,7) # But found: Error, Variable: 'topo' must have a value ######## ########> Diff in testinstall.tst:199 # Input is: gr1 := OnDigraphs(gr, p ^ -1);; # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in testinstall.tst:200 # Input is: DigraphTopologicalSort(gr1) = DigraphVertices(gr1); # Expected output: true # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in testinstall.tst:206 # Input is: gr := Digraph(List([1 .. 5], x -> [1 .. 5]));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:207 # Input is: out := OutNeighbours(gr); # Expected output: [ [ 1 .. 5 ], [ 1 .. 5 ], [ 1 .. 5 ], [ 1 .. 5 ], [ 1 .. 5 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in testinstall.tst:209 # Input is: IsMultiDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in testinstall.tst:211 # Input is: out; # Expected output: [ [ 1, 2, 3, 4, 5 ], [ 1, 2, 3, 4, 5 ], [ 1, 2, 3, 4, 5 ], [ 1, 2, 3, 4, 5 ], [ 1, 2, 3, 4, 5 ] ] # But found: Error, Variable: 'out' must have a value ######## ########> Diff in testinstall.tst:214 # Input is: InNeighbours(gr) = out; # Expected output: true # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in testinstall.tst:218 # Input is: gr := Digraph([[3], [4], [5], [1, 5], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:220 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ [ 1, 3, 5 ], [ 1, 3, 5, 2, 4 ], [ 5, 2, 4 ] ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in testinstall.tst:226 # Input is: gr := DigraphFromGraph6String("L~~~ySrJ[N{NT^"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in testinstall.tst:228 # Input is: gr = MaximalSymmetricSubdigraphWithoutLoops(gr); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in testinstall.tst:230 # Input is: DigraphMaximalCliquesReps(gr); # Expected output: [ [ 1, 2, 3, 4, 5, 6, 7 ], [ 1, 2, 3, 12 ], [ 2, 8, 12, 13 ], [ 4, 9, 13 ], [ 8, 9, 10, 11, 12, 13 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesReps' must have a value ######## ########> Diff in testinstall.tst:233 # Input is: gr := DigraphFromGraph6String("I~~wzfJhw"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in testinstall.tst:235 # Input is: gr = MaximalSymmetricSubdigraphWithoutLoops(gr); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in testinstall.tst:237 # Input is: DigraphMaximalCliquesReps(gr); # Expected output: [ [ 1, 2, 3, 4, 5, 6 ], [ 1, 2, 5, 9 ], [ 1, 9, 10 ], [ 7, 8, 9, 10 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesReps' must have a value ######## ########> Diff in testinstall.tst:241 # Input is: gr := CompleteDigraph(7);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in testinstall.tst:242 # Input is: gr2 := DigraphClosure(gr, 7);; # Expected output: # But found: Error, Variable: 'DigraphClosure' must have a value ######## ########> Diff in testinstall.tst:243 # Input is: gr = gr2; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in testinstall.tst:245 # Input is: gr := DigraphRemoveEdge(gr, [1, 2]);; # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in testinstall.tst:246 # Input is: gr := DigraphRemoveEdges(gr, [[1, 2], [2, 1]]);; # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in testinstall.tst:247 # Input is: DigraphNrEdges(gr); # Expected output: 40 # But found: Error, Variable: 'DigraphNrEdges' must have a value ######## ########> Diff in testinstall.tst:249 # Input is: gr2 := DigraphClosure(gr, 7);; # Expected output: # But found: Error, Variable: 'DigraphClosure' must have a value ######## ########> Diff in testinstall.tst:250 # Input is: DigraphNrEdges(gr2); # Expected output: 42 # But found: Error, Variable: 'DigraphNrEdges' must have a value ######## ########> Diff in testinstall.tst:255 # Input is: gr := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:257 # Input is: DigraphSource(gr); # Expected output: [ ] # But found: Error, Variable: 'DigraphSource' must have a value ######## ########> Diff in testinstall.tst:259 # Input is: DigraphRange(gr); # Expected output: [ ] # But found: Error, Variable: 'DigraphRange' must have a value ######## ########> Diff in testinstall.tst:263 # Input is: d := Digraph([[2], [3], [1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:265 # Input is: OutNeighbours(OnDigraphs(d, PermList([2, 3, 1]))); # Expected output: [ [ 2, 2 ], [ 3 ], [ 1 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in testinstall.tst:267 # Input is: OutNeighbours(OnDigraphs(d, Transformation([2, 3, 1]))); # Expected output: [ [ 2, 2 ], [ 3 ], [ 1 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in testinstall.tst:273 # Input is: AsDigraph(f); # Expected output: # But found: Error, Variable: 'AsDigraph' must have a value ######## ########> Diff in testinstall.tst:275 # Input is: AsDigraph(f, 4); # Expected output: fail # But found: Error, Variable: 'AsDigraph' must have a value ######## ########> Diff in testinstall.tst:279 # Input is: gr := Digraph([[1], [2], [1 .. 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:280 # Input is: IsAntisymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in testinstall.tst:284 # Input is: gr := Digraph([[1 .. 4], [2, 4], [3, 4], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:286 # Input is: DigraphTopologicalSort(gr); # Expected output: [ 4, 2, 3, 1 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in testinstall.tst:290 # Input is: gr := Digraph([[1],, [2]]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphCons' on 2 arguments # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:293 # Input is: gr := Digraph([[1], 2, [2]]); # Expected output: Error, the argument must be a list of lists of positive integers not ex\ \ ceeding the length of the argument, # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:298 # Input is: gr := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in testinstall.tst:299 # Input is: DigraphSymmetricClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in testinstall.tst:303 # Input is: not DIGRAPHS_NautyAvailable or NautyAutomorphismGroup(NullDigraph(0)) = Group(()); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in testinstall.tst:306 # Input is: not DIGRAPHS_NautyAvailable or NautyAutomorphismGroup(NullDigraph(0), []) = Group(()); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in testinstall.tst:309 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(NullDigraph(0)) = (); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in testinstall.tst:312 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(NullDigraph(0), []) = (); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in testinstall.tst:317 # Input is: SortedList(DigraphEdges(DigraphFromDigraph6String("&DI?AO?")) - 1); # Expected output: [ [ 0, 2 ], [ 0, 4 ], [ 3, 1 ], [ 3, 4 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in testinstall.tst:320 # Input is: gr := DigraphFromDigraph6String(str); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in testinstall.tst:322 # Input is: str = Digraph6String(gr); # Expected output: true # But found: Error, Variable: 'Digraph6String' must have a value ######## ########> Diff in testinstall.tst:326 # Input is: D := NullDigraph(IsMutableDigraph, 10); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in testinstall.tst:328 # Input is: MakeImmutable(D); # Expected output: # But found: Error, Variable: 'D' must have a value ######## ########> Diff in testinstall.tst:332 # Input is: D := Digraph([[2], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in testinstall.tst:333 # Input is: IsCompleteDigraph(D); # Expected output: false # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in testinstall.tst:335 # Input is: D; # Expected output: # But found: Error, Variable: 'D' must have a value ######## ########> Diff in testinstall.tst:339 # Input is: D := EmptyDigraph(IsMutableDigraph, 3); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in testinstall.tst:341 # Input is: IsAcyclicDigraph(D); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in testinstall.tst:343 # Input is: DigraphDisjointUnion(D, CycleDigraph(IsMutableDigraph, 3)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in testinstall.tst:345 # Input is: IsAcyclicDigraph(D); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in testinstall.tst:347 # Input is: D := EmptyDigraph(IsMutableDigraph, 3); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in testinstall.tst:349 # Input is: IsAcyclicDigraph(D); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in testinstall.tst:351 # Input is: DigraphDisjointUnion(D, CycleDigraph(IsImmutableDigraph, 3)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in testinstall.tst:353 # Input is: IsAcyclicDigraph(D); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in testinstall.tst:357 # Input is: D := EmptyDigraph(IsMutableDigraph, 3); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in testinstall.tst:359 # Input is: DigraphDisjointUnion(D, CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in testinstall.tst:361 # Input is: IsMutable(D!.OutNeighbours); # Expected output: true # But found: Error, Variable: 'D' must have a value ######## ########> Diff in testinstall.tst:363 # Input is: ForAll(D!.OutNeighbours, IsMutable); # Expected output: true # But found: Error, Variable: 'D' must have a value ######## ########> Diff in testinstall.tst:367 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(100), fail, [], infinit\ y, fail, 2, [1 .. 100], [], fail, fail); # Expected output: [ IdentityTransformation ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in testinstall.tst:370 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(100), fail, [], infinit\ y, fail, 2, [1 .. 100], [], fail, fail); # Expected output: [ IdentityTransformation ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in testinstall.tst:373 # Input is: HomomorphismDigraphsFinder(NullDigraph(2), NullDigraph(2), fail, [], infinity,\ fail, 2, [1, 2], [], fail, fail); # Expected output: [ IdentityTransformation ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in testinstall.tst:376 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(100), fail, [], infinit\ y, fail, 2, [1 .. 100], [], fail, fail); # Expected output: [ IdentityTransformation ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in testinstall.tst:396 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: testinstall.tst msecs: 245 false gap> ########> Diff in standard/attr.tst:15 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/attr.tst:26 # Input is: gr := Digraph(nbs); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:28 # Input is: HasDigraphSource(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphSource' must have a value ######## ########> Diff in standard/attr.tst:30 # Input is: HasDigraphRange(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphRange' must have a value ######## ########> Diff in standard/attr.tst:32 # Input is: DigraphNrVertices(gr); # Expected output: 25 # But found: Error, Variable: 'DigraphNrVertices' must have a value ######## ########> Diff in standard/attr.tst:34 # Input is: DigraphSource(gr); # Expected output: [ 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 16, 17, 17, 17, 17, 18, 18, 18, 18, 18, 19, 20, 20, 21, 21, 22, 22, 22, 23, 23, 23, 24, 24, 24, 24, 24, 24, 25, 25, 25 ] # But found: Error, Variable: 'DigraphSource' must have a value ######## ########> Diff in standard/attr.tst:40 # Input is: HasDigraphSource(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphSource' must have a value ######## ########> Diff in standard/attr.tst:42 # Input is: HasDigraphRange(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphRange' must have a value ######## ########> Diff in standard/attr.tst:44 # Input is: DigraphRange(gr); # Expected output: [ 12, 22, 17, 1, 10, 11, 23, 21, 21, 16, 15, 5, 22, 11, 12, 8, 10, 1, 21, 15, 23, 5, 23, 8, 24, 20, 17, 25, 25, 5, 24, 22, 5, 2, 11, 8, 19, 18, 20, 13, 3, 11, 15, 18, 12, 10, 8, 23, 15, 25, 8, 19, 17, 19, 2, 17, 21, 18, 9, 4, 7, 3, 14, 10, 2, 11, 24, 14, 2, 21, 12, 9, 2, 11, 9, 21, 24, 16, 8, 8, 3, 5, 6, 14, 2, 24, 24, 20, 19, 8, 20, 7, 1, 2, 15, 13, 9, 16, 12, 19 ] # But found: Error, Variable: 'DigraphRange' must have a value ######## ########> Diff in standard/attr.tst:50 # Input is: gr := Digraph(nbs); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:52 # Input is: HasDigraphSource(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphSource' must have a value ######## ########> Diff in standard/attr.tst:54 # Input is: HasDigraphRange(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphRange' must have a value ######## ########> Diff in standard/attr.tst:56 # Input is: DigraphRange(gr); # Expected output: [ 12, 22, 17, 1, 10, 11, 23, 21, 21, 16, 15, 5, 22, 11, 12, 8, 10, 1, 21, 15, 23, 5, 23, 8, 24, 20, 17, 25, 25, 5, 24, 22, 5, 2, 11, 8, 19, 18, 20, 13, 3, 11, 15, 18, 12, 10, 8, 23, 15, 25, 8, 19, 17, 19, 2, 17, 21, 18, 9, 4, 7, 3, 14, 10, 2, 11, 24, 14, 2, 21, 12, 9, 2, 11, 9, 21, 24, 16, 8, 8, 3, 5, 6, 14, 2, 24, 24, 20, 19, 8, 20, 7, 1, 2, 15, 13, 9, 16, 12, 19 ] # But found: Error, Variable: 'DigraphRange' must have a value ######## ########> Diff in standard/attr.tst:62 # Input is: HasDigraphSource(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphSource' must have a value ######## ########> Diff in standard/attr.tst:64 # Input is: HasDigraphRange(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphRange' must have a value ######## ########> Diff in standard/attr.tst:66 # Input is: DigraphSource(gr); # Expected output: [ 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 16, 17, 17, 17, 17, 18, 18, 18, 18, 18, 19, 20, 20, 21, 21, 22, 22, 22, 23, 23, 23, 24, 24, 24, 24, 24, 24, 25, 25, 25 ] # But found: Error, Variable: 'DigraphSource' must have a value ######## ########> Diff in standard/attr.tst:74 # Input is: gr := Digraph([[6, 7], [6, 9], [1, 3, 4, 5, 8, 9], [1, 2, 3, 4, 5, 6, 7, 10], [1, 5, 6, 7, 10], [2, 4, 5, 9, 10], [3, 4, 5, 6, 7, 8, 9, 10], [1, 3, 5, 7, 8, 9], [1, 2, 5], [1, 2, 4, 6, 7, 8]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:78 # Input is: OutNeighbours(DigraphDual(gr)); # Expected output: [ [ 1, 2, 3, 4, 5, 8, 9, 10 ], [ 1, 2, 3, 4, 5, 7, 8, 10 ], [ 2, 6, 7, 10 ], [ 8, 9 ], [ 2, 3, 4, 8, 9 ], [ 1, 3, 6, 7, 8 ], [ 1, 2 ], [ 2, 4, 6, 10 ], [ 3, 4, 6, 7, 8, 9, 10 ], [ 3, 5, 9, 10 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:82 # Input is: gr := Digraph(rec(DigraphVertices := ["a", "b"], DigraphSource := ["b", "b"], DigraphRange := ["a", "a"])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:85 # Input is: DigraphDual(gr); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:87 # Input is: DigraphDual(DigraphMutableCopy(gr)); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:89 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:91 # Input is: DigraphDual(gr); # Expected output: # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:93 # Input is: DigraphDual(gr); # Expected output: # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:95 # Input is: gr := Digraph([[], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:97 # Input is: DigraphDual(gr); # Expected output: # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:99 # Input is: gr := Digraph(rec(DigraphNrVertices := 2, DigraphSource := [], DigraphRange :=\ [])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:101 # Input is: DigraphDual(gr); # Expected output: # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:103 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:105 # Input is: DigraphDual(gr); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:110 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:112 # Input is: DigraphDual(gr); # Expected output: # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:115 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:117 # Input is: DigraphDual(gr); # Expected output: # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:119 # Input is: gr := Digraph(r);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:120 # Input is: SetDigraphVertexLabels(gr, [4, 3, 2, 1]); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/attr.tst:121 # Input is: gr2 := DigraphDual(gr);; # Expected output: # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:122 # Input is: DigraphVertexLabels(gr2); # Expected output: [ 4, 3, 2, 1 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/attr.tst:124 # Input is: DigraphNrVertices(gr2); # Expected output: 4 # But found: Error, Variable: 'DigraphNrVertices' must have a value ######## ########> Diff in standard/attr.tst:126 # Input is: gr := Digraph([[1], [1, 3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:128 # Input is: DigraphGroup(gr) = Group((2, 3)); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:130 # Input is: gr2 := DigraphDual(gr); # Expected output: # But found: Error, Variable: 'DigraphDual' must have a value ######## ########> Diff in standard/attr.tst:132 # Input is: OutNeighbours(gr2); # Expected output: [ [ 2, 3 ], [ 2 ], [ 3 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:134 # Input is: HasDigraphGroup(gr2); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:136 # Input is: DigraphGroup(gr2) = Group((2, 3)); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:138 # Input is: DigraphGroup(gr2) = DigraphGroup(gr); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:142 # Input is: gr := Digraph(rec(DigraphNrVertices := 10, DigraphSource := [1, 1, 1, 1, 1, 1, 1, 1], DigraphRange := [2, 2, 3, 3, 4, 4, 5, 5])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:146 # Input is: AdjacencyMatrix(gr); # Expected output: [ [ 0, 2, 2, 2, 2, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] ] # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:152 # Input is: AdjacencyMatrix(Digraph([[]])); # Expected output: [ [ 0 ] ] # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:154 # Input is: AdjacencyMatrix(Digraph([])); # Expected output: [ ] # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:159 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:161 # Input is: adj1 := AdjacencyMatrix(gr); # Expected output: [ [ 0, 0, 1, 1, 0, 0, 0 ], [ 0, 1, 0, 1, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 1, 0 ], [ 0, 0, 0, 0, 0, 1, 1 ], [ 0, 1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 1 ], [ 0, 0, 0, 0, 2, 0, 0 ] ] # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:165 # Input is: gr := Digraph(OutNeighbours(gr)); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:167 # Input is: adj2 := AdjacencyMatrix(gr); # Expected output: [ [ 0, 0, 1, 1, 0, 0, 0 ], [ 0, 1, 0, 1, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 1, 0 ], [ 0, 0, 0, 0, 0, 1, 1 ], [ 0, 1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 1 ], [ 0, 0, 0, 0, 2, 0, 0 ] ] # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:171 # Input is: adj1 = adj2; # Expected output: true # But found: Error, Variable: 'adj1' must have a value ######## ########> Diff in standard/attr.tst:174 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:176 # Input is: adj1 := AdjacencyMatrix(gr); # Expected output: [ [ 2 ] ] # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:178 # Input is: gr := Digraph(OutNeighbours(gr)); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:180 # Input is: adj2 := AdjacencyMatrix(gr); # Expected output: [ [ 2 ] ] # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:182 # Input is: adj1 = adj2; # Expected output: true # But found: Error, Variable: 'adj1' must have a value ######## ########> Diff in standard/attr.tst:184 # Input is: AdjacencyMatrix(Digraph([])); # Expected output: [ ] # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:186 # Input is: AdjacencyMatrix( Digraph(rec(DigraphNrVertices := 0, DigraphSource := [], DigraphRange := [])))\ ; # Expected output: [ ] # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:202 # Input is: circuit := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:204 # Input is: topo := DigraphTopologicalSort(circuit);; # Expected output: # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:205 # Input is: Length(topo); # Expected output: 20000 # But found: Error, Variable: 'topo' must have a value ######## ########> Diff in standard/attr.tst:207 # Input is: topo[1] = 20000; # Expected output: true # But found: Error, Variable: 'topo' must have a value ######## ########> Diff in standard/attr.tst:209 # Input is: topo[20000] = 10001; # Expected output: true # But found: Error, Variable: 'topo' must have a value ######## ########> Diff in standard/attr.tst:211 # Input is: topo[12345]; # Expected output: 17656 # But found: Error, Variable: 'topo' must have a value ######## ########> Diff in standard/attr.tst:213 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:215 # Input is: DigraphTopologicalSort(gr); # Expected output: fail # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:218 # Input is: multiple := Digraph(r);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:219 # Input is: DigraphTopologicalSort(multiple); # Expected output: [ 2, 1 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:221 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:223 # Input is: DigraphTopologicalSort(gr); # Expected output: [ ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:225 # Input is: gr := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:227 # Input is: DigraphTopologicalSort(gr); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:229 # Input is: gr := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:231 # Input is: DigraphTopologicalSort(gr); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:233 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:235 # Input is: DigraphTopologicalSort(gr); # Expected output: fail # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:240 # Input is: grid := Digraph(r);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:241 # Input is: DigraphTopologicalSort(grid); # Expected output: [ 8, 2, 6, 4, 3, 1, 7, 5 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:244 # Input is: gr := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:246 # Input is: IsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/attr.tst:248 # Input is: DigraphTopologicalSort(gr); # Expected output: [ 2, 4, 3, 1 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:250 # Input is: gr := Digraph([ [7], [], [], [6], [], [3], [], [], [5, 15], [], [], [6], [19], [], [11], [13], [], [17], [], [17]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:254 # Input is: DigraphTopologicalSort(gr); # Expected output: [ 7, 1, 2, 3, 6, 4, 5, 8, 11, 15, 9, 10, 12, 19, 13, 14, 16, 17, 18, 20 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:256 # Input is: gr := Digraph([[2], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:258 # Input is: DigraphTopologicalSort(gr); # Expected output: [ 2, 1, 3 ] # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:271 # Input is: gr := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:273 # Input is: DigraphStronglyConnectedComponents(gr); # Expected output: rec( comps := [ [ 1, 11, 15 ], [ 2, 3, 10, 14 ], [ 4, 6, 9, 13 ], [ 5, 7, 8, 12 ] ], id := [ 1, 2, 2, 3, 4, 3, 4, 4, 3, 2, 1, 4, 3, 2, 1 ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:281 # Input is: gr := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:283 # Input is: scc := DigraphStronglyConnectedComponents(gr); # Expected output: rec( comps := [ [ 1, 3, 2, 4, 9, 8, 5, 6, 7, 10, 11 ] ], id := [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:286 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:288 # Input is: DigraphStronglyConnectedComponents(gr); # Expected output: rec( comps := [ ], id := [ ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:293 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:295 # Input is: scc := DigraphStronglyConnectedComponents(gr); # Expected output: rec( comps := [ [ 3 ], [ 1, 7, 9 ], [ 8, 4 ], [ 2, 6, 5 ] ], id := [ 2, 4, 1, 3, 4, 4, 2, 3, 2 ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:298 # Input is: wcc := DigraphConnectedComponents(gr); # Expected output: rec( comps := [ [ 1, 2, 3, 4, 5, 6, 7, 8, 9 ] ], id := [ 1, 1, 1, 1, 1, 1, 1, 1, 1 ] ) # But found: Error, Variable: 'DigraphConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:301 # Input is: scc := DigraphStronglyConnectedComponents(circuit);; # Expected output: # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:302 # Input is: Length(scc.comps); # Expected output: 20000 # But found: Error, Variable: 'scc' must have a value ######## ########> Diff in standard/attr.tst:304 # Input is: Length(scc.comps) = DigraphNrVertices(circuit); # Expected output: true # But found: Error, Variable: 'scc' must have a value ######## ########> Diff in standard/attr.tst:306 # Input is: gr := CycleDigraph(10); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:308 # Input is: gr2 := DigraphRemoveEdge(gr, 10, 1); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/attr.tst:310 # Input is: IsStronglyConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/attr.tst:312 # Input is: DigraphStronglyConnectedComponents(gr); # Expected output: rec( comps := [ [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ] ], id := [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:315 # Input is: IsAcyclicDigraph(gr2); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/attr.tst:317 # Input is: DigraphStronglyConnectedComponents(gr2); # Expected output: rec( comps := [ [ 1 ], [ 2 ], [ 3 ], [ 4 ], [ 5 ], [ 6 ], [ 7 ], [ 8 ], [ 9 ], [ 10 ] ], id := [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:322 # Input is: D := CycleDigraph(10);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:323 # Input is: for i in [1 .. 50] do D := DigraphDisjointUnion(D, CycleDigraph(10)); od; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have an assigned value ######## ########> Diff in standard/attr.tst:326 # Input is: DigraphNrStronglyConnectedComponents(D); # Expected output: 51 # But found: Error, Variable: 'DigraphNrStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:328 # Input is: D := CayleyDigraph(SymmetricGroup(6));; # Expected output: # But found: Error, Variable: 'CayleyDigraph' must have a value ######## ########> Diff in standard/attr.tst:329 # Input is: DigraphNrStronglyConnectedComponents(D); # Expected output: 1 # But found: Error, Variable: 'DigraphNrStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:331 # Input is: D := Digraph([[2, 3], [1, 4, 5], [3], [2, 5], [6], [3, 5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:332 # Input is: DigraphNrStronglyConnectedComponents(D); # Expected output: 3 # But found: Error, Variable: 'DigraphNrStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:334 # Input is: D := Digraph([[]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:335 # Input is: DigraphNrStronglyConnectedComponents(D); # Expected output: 1 # But found: Error, Variable: 'DigraphNrStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:337 # Input is: D := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:338 # Input is: DigraphNrStronglyConnectedComponents(D); # Expected output: 0 # But found: Error, Variable: 'DigraphNrStronglyConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:342 # Input is: gr := Digraph([[1, 2], [1], [2], [5], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:344 # Input is: wcc := DigraphConnectedComponents(gr); # Expected output: rec( comps := [ [ 1, 2, 3 ], [ 4, 5 ] ], id := [ 1, 1, 1, 2, 2 ] ) # But found: Error, Variable: 'DigraphConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:346 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:348 # Input is: DigraphConnectedComponents(gr); # Expected output: rec( comps := [ ], id := [ ] ) # But found: Error, Variable: 'DigraphConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:350 # Input is: gr := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:352 # Input is: DigraphConnectedComponents(gr); # Expected output: rec( comps := [ [ 1 ] ], id := [ 1 ] ) # But found: Error, Variable: 'DigraphConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:354 # Input is: gr := Digraph([[1], [2], [3], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:356 # Input is: DigraphConnectedComponents(gr); # Expected output: rec( comps := [ [ 1 ], [ 2 ], [ 3 ], [ 4 ] ], id := [ 1, 2, 3, 4 ] ) # But found: Error, Variable: 'DigraphConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:358 # Input is: gr := Digraph([[3, 4, 5, 7, 8, 9], [1, 4, 5, 8, 9, 5, 10], [2, 4, 5, 6, 7, 10], [6], [1, 1, 1, 7, 8, 9], [2, 2, 6, 8], [1, 5, 6, 9, 10], [3, 4, 6, 7], [1, 2, 3, 5], [5, 7]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:362 # Input is: DigraphConnectedComponents(gr); # Expected output: rec( comps := [ [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ] ], id := [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ] ) # But found: Error, Variable: 'DigraphConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:365 # Input is: gr := Digraph(rec( DigraphNrVertices := 100, DigraphSource := [8, 9, 11, 11, 12, 13, 14, 14, 18, 19, 22, 27, 31, 32, 32, 34\ , 37, 40, 45, 48, 50, 52, 58, 58, 58, 59, 60, 60, 65, 66, 73, 75, 79, 81, 81, 83, 84, 86, 86, 89, 96, 100, 100, 100], DigraphRange := [54, 62, 28, 55, 70, 37, 20, 32, 53, 16, 42, 66, 63, 13, 73, 8\ 9, 36, 5, 4, 58, 26, 48, 36, 56, 65, 78, 95, 96, 97, 60, 11, 66, 66, 19, 79, 21, 13, 29, 78, 98, 100, 44, 53, 69])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:374 # Input is: OutNeighbours(gr); # Expected output: [ [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ 54 ], [ 62 ], [ ], [ 28, 55 ], [ 70 ], [ 37 ], [ 20, 32 ], [ ], [ ], [ ], [ 53 ], [ 16 ], [ ], [ ], [ 42 ], [ ], [ ], [ ], [ ], [ 66 ], [ ], [ ], [ ], [ 63 ], [ 13, 73 ], [ ], [ 89 ], [ ], [ ], [ 36 ], [ ], [ ], [ 5 ], [ ], [ ], [ ], [ ], [ 4 ], [ ], [ ], [ 58 ], [ ], [ 26 ], [ ], [ 48 ], [ ], [ ], [ ], [ ], [ ], [ 36, 56, 65 ], [ 78 ], [ 95, 96 ], [ ], [ ], [ ], [ ], [ 97 ], [ 60 ], [ ], [ ], [ ], [ ], [ ], [ ], [ 11 ], [ ], [ 66 ], [ ], [ ], [ ], [ 66 ], [ ], [ 19, 79 ], [ ], [ 21 ], [ 13 ], [ ], [ 29, 78 ], [ ], [ ], [ 98 ], [ ], [ ], [ ], [ ], [ ], [ ], [ 100 ], [ ], [ ], [ ], [ 44, 53, 69 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:385 # Input is: DigraphConnectedComponents(gr); # Expected output: rec( comps := [ [ 1 ], [ 2 ], [ 3 ], [ 4, 45 ], [ 5, 40 ], [ 6 ], [ 7 ], [ 8, 54 ], [ 9, 62 ], [ 10 ], [ 11, 13, 14, 20, 28, 32, 36, 37, 48, 52, 55, 56, 58, 65, 73, 84, 97 ], [ 12, 70 ], [ 15 ], [ 16, 18, 19, 27, 44, 53, 60, 66, 69, 75, 79, 81, 95, 96, 100 ], [ 17 ], [ 21, 83 ], [ 22, 42 ], [ 23 ], [ 24 ], [ 25 ], [ 26, 50 ], [ 29, 59, 78, 86 ], [ 30 ], [ 31, 63 ], [ 33 ], [ 34, 89, 98 ], [ 35 ], [ 38 ], [ 39 ], [ 41 ], [ 43 ], [ 46 ], [ 47 ], [ 49 ], [ 51 ], [ 57 ], [ 61 ], [ 64 ], [ 67 ], [ 68 ], [ 71 ], [ 72 ], [ 74 ], [ 76 ], [ 77 ], [ 80 ], [ 82 ], [ 85 ], [ 87 ], [ 88 ], [ 90 ], [ 91 ], [ 92 ], [ 93 ], [ 94 ], [ 99 ] ], id := [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 11, 13, 14, 15, 14, 14, 11, 16, 17, 18, 19, 20, 21, 14, 11, 22, 23, 24, 11, 25, 26, 27, 11, 11, 28, 29, 5, 30, 17, 31, 14, 4, 32, 33, 11, 34, 21, 35, 11, 14, 8, 11, 11, 36, 11, 22, 14, 37, 9, 24, 38, 11, 14, 39, 40, 14, 12, 41, 42, 11, 43, 14, 44, 45, 22, 14, 46, 14, 47, 16, 11, 48, 22, 49, 50, 26, 51, 52, 53, 54, 55, 14, 14, 11, 26, 56, 14 ] ) # But found: Error, Variable: 'DigraphConnectedComponents' must have a value ######## ########> Diff in standard/attr.tst:406 # Input is: cycle12 := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:408 # Input is: mat := DigraphShortestDistances(cycle12);; # Expected output: # But found: Error, Variable: 'DigraphShortestDistances' must have a value ######## ########> Diff in standard/attr.tst:409 # Input is: Display(mat); # Expected output: [ [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 ], [ 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ], [ 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ], [ 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8 ], [ 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7 ], [ 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6 ], [ 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5 ], [ 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4 ], [ 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3 ], [ 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2 ], [ 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1 ], [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0 ] ] # But found: Error, Variable: 'mat' must have a value ######## ########> Diff in standard/attr.tst:422 # Input is: DigraphShortestDistances(Digraph([])); # Expected output: [ ] # But found: Error, Variable: 'DigraphShortestDistances' must have a value ######## ########> Diff in standard/attr.tst:424 # Input is: mat := DigraphShortestDistances(Digraph([[], []])); # Expected output: [ [ 0, fail ], [ fail, 0 ] ] # But found: Error, Variable: 'DigraphShortestDistances' must have a value ######## ########> Diff in standard/attr.tst:433 # Input is: complete15 := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:435 # Input is: Display(DigraphShortestDistances(complete15)); # Expected output: [ [ 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ], [ 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ], [ 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ], [ 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1 ], [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1 ], [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1 ], [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0 ] ] # But found: Error, Variable: 'DigraphShortestDistances' must have a value ######## ########> Diff in standard/attr.tst:453 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:455 # Input is: Display(DigraphShortestDistances(gr)); # Expected output: [ [ 0, 2, 1, 3, 1, 3, 2 ], [ fail, 0, 2, 1, 3, 1, 4 ], [ fail, 1, 0, 2, 1, 2, 2 ], [ fail, 2, 1, 0, 2, 3, 3 ], [ fail, 2, 1, 3, 0, 3, 1 ], [ fail, fail, fail, fail, fail, 0, fail ], [ fail, 1, 3, 2, 4, 2, 0 ] ] # But found: Error, Variable: 'DigraphShortestDistances' must have a value ######## ########> Diff in standard/attr.tst:465 # Input is: gr := CycleDigraph(3);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:466 # Input is: DIGRAPHS_ConnectivityData(gr); # Expected output: [ ] # But found: Error, Variable: 'DIGRAPHS_ConnectivityData' must have a value ######## ########> Diff in standard/attr.tst:468 # Input is: DigraphShortestDistances(gr); # Expected output: [ [ 0, 1, 2 ], [ 2, 0, 1 ], [ 1, 2, 0 ] ] # But found: Error, Variable: 'DigraphShortestDistances' must have a value ######## ########> Diff in standard/attr.tst:470 # Input is: gr := CompleteDigraph(3);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:471 # Input is: DIGRAPH_ConnectivityDataForVertex(gr, 2);; # Expected output: # But found: Error, Variable: 'DIGRAPH_ConnectivityDataForVertex' must have a value ######## ########> Diff in standard/attr.tst:472 # Input is: DigraphShortestDistances(gr); # Expected output: [ [ 0, 1, 1 ], [ 1, 0, 1 ], [ 1, 1, 0 ] ] # But found: Error, Variable: 'DigraphShortestDistances' must have a value ######## ########> Diff in standard/attr.tst:476 # Input is: gr := Digraph(rec(DigraphNrVertices := 10, DigraphSource := [1, 1, 5, 5, 7, 10\ ], DigraphRange := [3, 3, 1, 10, 7, 1])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:479 # Input is: InNeighbours(gr); # Expected output: [ [ 5, 10 ], [ ], [ 1, 1 ], [ ], [ ], [ ], [ 7 ], [ ], [ ], [ 5 ] ] # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in standard/attr.tst:481 # Input is: OutNeighbours(gr); # Expected output: [ [ 3, 3 ], [ ], [ ], [ ], [ 1, 10 ], [ ], [ 7 ], [ ], [ ], [ 1 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:483 # Input is: gr := Digraph([[1, 1, 4], [2, 3, 4], [2, 4, 4, 4], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:485 # Input is: InNeighbours(gr); # Expected output: [ [ 1, 1 ], [ 2, 3, 4 ], [ 2 ], [ 1, 2, 3, 3, 3 ] ] # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in standard/attr.tst:487 # Input is: OutNeighbours(gr); # Expected output: [ [ 1, 1, 4 ], [ 2, 3, 4 ], [ 2, 4, 4, 4 ], [ 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:492 # Input is: gr1 := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:494 # Input is: OutDegrees(gr1); # Expected output: [ ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:496 # Input is: OutDegreeSequence(gr1); # Expected output: [ ] # But found: Error, Variable: 'OutDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:498 # Input is: InDegrees(gr1); # Expected output: [ ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:500 # Input is: InDegreeSequence(gr1); # Expected output: [ ] # But found: Error, Variable: 'InDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:502 # Input is: gr2 := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:504 # Input is: OutDegrees(gr2); # Expected output: [ ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:506 # Input is: OutDegreeSequence(gr2); # Expected output: [ ] # But found: Error, Variable: 'OutDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:508 # Input is: InDegrees(gr2); # Expected output: [ ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:510 # Input is: InDegreeSequence(gr2); # Expected output: [ ] # But found: Error, Variable: 'InDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:512 # Input is: gr3 := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:514 # Input is: InNeighbours(gr3); # Expected output: [ ] # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in standard/attr.tst:516 # Input is: OutDegrees(gr3); # Expected output: [ ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:518 # Input is: OutDegreeSequence(gr3); # Expected output: [ ] # But found: Error, Variable: 'OutDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:520 # Input is: InDegrees(gr3); # Expected output: [ ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:522 # Input is: InDegreeSequence(gr3); # Expected output: [ ] # But found: Error, Variable: 'InDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:527 # Input is: gr1 := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:529 # Input is: OutDegrees(gr1); # Expected output: [ 3, 4, 1, 5, 5, 2, 6, 2 ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:531 # Input is: OutDegreeSequence(gr1); # Expected output: [ 6, 5, 5, 4, 3, 2, 2, 1 ] # But found: Error, Variable: 'OutDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:533 # Input is: InDegrees(gr1); # Expected output: [ 5, 0, 3, 5, 4, 5, 5, 1 ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:535 # Input is: InDegreeSequence(gr1); # Expected output: [ 5, 5, 5, 5, 4, 3, 1, 0 ] # But found: Error, Variable: 'InDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:537 # Input is: gr2 := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:539 # Input is: InNeighbours(gr2);; # Expected output: # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in standard/attr.tst:540 # Input is: InDegrees(gr2); # Expected output: [ 5, 0, 3, 5, 4, 5, 5, 1 ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:542 # Input is: InDegreeSequence(gr2); # Expected output: [ 5, 5, 5, 5, 4, 3, 1, 0 ] # But found: Error, Variable: 'InDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:549 # Input is: gr3 := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:551 # Input is: OutDegrees(gr3); # Expected output: [ 3, 4, 1, 5, 5, 2, 6, 2 ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:553 # Input is: OutDegreeSequence(gr3); # Expected output: [ 6, 5, 5, 4, 3, 2, 2, 1 ] # But found: Error, Variable: 'OutDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:555 # Input is: InDegrees(gr3); # Expected output: [ 5, 0, 3, 5, 4, 5, 5, 1 ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:557 # Input is: InDegreeSequence(gr3); # Expected output: [ 5, 5, 5, 5, 4, 3, 1, 0 ] # But found: Error, Variable: 'InDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:559 # Input is: OutDegrees(EmptyDigraph(5)); # Expected output: [ 0, 0, 0, 0, 0 ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:561 # Input is: InDegrees(EmptyDigraph(5)); # Expected output: [ 0, 0, 0, 0, 0 ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:563 # Input is: gr := EmptyDigraph(5);; OutNeighbours(gr);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:564 # Input is: OutDegrees(gr); # Expected output: [ 0, 0, 0, 0, 0 ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:566 # Input is: gr := EmptyDigraph(5);; OutNeighbours(gr);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:567 # Input is: InDegrees(gr); # Expected output: [ 0, 0, 0, 0, 0 ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:577 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:579 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 1 ], [ 1, 4 ], [ 2, 3 ], [ 3, 5 ], [ 5, 2 ], [ 5, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/attr.tst:581 # Input is: gr := Digraph([[4], [2, 3, 1, 3], [3, 3], [], [1, 4, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:583 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 4 ], [ 2, 2 ], [ 2, 3 ], [ 2, 1 ], [ 2, 3 ], [ 3, 3 ], [ 3, 3 ], [ 5, 1 ], [ 5, 4 ], [ 5, 5 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/attr.tst:586 # Input is: gr := Digraph([[1, 2, 3, 5, 6, 8], [6, 6, 7, 8], [1, 2, 3, 4, 6, 7], [2, 3, 5, 6, 2, 7], [5, 6, 5, 5], [3, 2, 8], [1, 5, 7], [6, 7]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:589 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 1 ], [ 1, 2 ], [ 1, 3 ], [ 1, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 6 ], [ 2, 6 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 3, 2 ], [ 3, 3 ], [ 3, 4 ], [ 3, 6 ], [ 3, 7 ], [ 4, 2 ], [ 4, 3 ], [ 4, 5 ], [ 4, 6 ], [ 4, 2 ], [ 4, 7 ], [ 5, 5 ], [ 5, 6 ], [ 5, 5 ], [ 5, 5 ], [ 6, 3 ], [ 6, 2 ], [ 6, 8 ], [ 7, 1 ], [ 7, 5 ], [ 7, 7 ], [ 8, 6 ], [ 8, 7 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/attr.tst:600 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:602 # Input is: DigraphSinks(gr); # Expected output: [ 1, 4, 6, 8, 10 ] # But found: Error, Variable: 'DigraphSinks' must have a value ######## ########> Diff in standard/attr.tst:604 # Input is: DigraphSources(gr); # Expected output: [ 1, 3, 7, 9, 10 ] # But found: Error, Variable: 'DigraphSources' must have a value ######## ########> Diff in standard/attr.tst:606 # Input is: gr := Digraph(OutNeighbours(gr));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:607 # Input is: DigraphSinks(gr); # Expected output: [ 1, 4, 6, 8, 10 ] # But found: Error, Variable: 'DigraphSinks' must have a value ######## ########> Diff in standard/attr.tst:609 # Input is: DigraphSources(gr); # Expected output: [ 1, 3, 7, 9, 10 ] # But found: Error, Variable: 'DigraphSources' must have a value ######## ########> Diff in standard/attr.tst:611 # Input is: gr := Digraph(r);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:612 # Input is: InNeighbours(gr); # Expected output: [ [ ], [ 2, 2, 3, 7, 9 ], [ ], [ 5, 9 ], [ 9 ], [ 3, 7, 7 ], [ ], [ 3, 7, 9, 9 ], [ ], [ ] ] # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in standard/attr.tst:615 # Input is: DigraphSinks(gr); # Expected output: [ 1, 4, 6, 8, 10 ] # But found: Error, Variable: 'DigraphSinks' must have a value ######## ########> Diff in standard/attr.tst:617 # Input is: DigraphSources(gr); # Expected output: [ 1, 3, 7, 9, 10 ] # But found: Error, Variable: 'DigraphSources' must have a value ######## ########> Diff in standard/attr.tst:619 # Input is: gr := Digraph(r);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:620 # Input is: OutDegrees(gr); # Expected output: [ 0, 2, 3, 0, 1, 0, 4, 0, 5, 0 ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:622 # Input is: InDegrees(gr); # Expected output: [ 0, 5, 0, 2, 1, 3, 0, 4, 0, 0 ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:624 # Input is: DigraphSinks(gr); # Expected output: [ 1, 4, 6, 8, 10 ] # But found: Error, Variable: 'DigraphSinks' must have a value ######## ########> Diff in standard/attr.tst:626 # Input is: DigraphSources(gr); # Expected output: [ 1, 3, 7, 9, 10 ] # But found: Error, Variable: 'DigraphSources' must have a value ######## ########> Diff in standard/attr.tst:630 # Input is: gr := EmptyDigraph(100); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:632 # Input is: DigraphPeriod(gr); # Expected output: 0 # But found: Error, Variable: 'DigraphPeriod' must have a value ######## ########> Diff in standard/attr.tst:634 # Input is: gr := CompleteDigraph(100); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:636 # Input is: DigraphPeriod(gr); # Expected output: 1 # But found: Error, Variable: 'DigraphPeriod' must have a value ######## ########> Diff in standard/attr.tst:638 # Input is: gr := Digraph([[2, 2], [3], [4], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:640 # Input is: DigraphPeriod(gr); # Expected output: 4 # But found: Error, Variable: 'DigraphPeriod' must have a value ######## ########> Diff in standard/attr.tst:642 # Input is: gr := Digraph([[2], [3], [4], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:644 # Input is: HasIsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/attr.tst:646 # Input is: DigraphPeriod(gr); # Expected output: 0 # But found: Error, Variable: 'DigraphPeriod' must have a value ######## ########> Diff in standard/attr.tst:648 # Input is: HasIsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/attr.tst:650 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/attr.tst:652 # Input is: gr := Digraph([[2], [3], [4], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:654 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/attr.tst:656 # Input is: DigraphPeriod(gr); # Expected output: 0 # But found: Error, Variable: 'DigraphPeriod' must have a value ######## ########> Diff in standard/attr.tst:660 # Input is: gr := Digraph([[2], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:661 # Input is: DigraphDiameter(gr); # Expected output: fail # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:663 # Input is: gr := Digraph([[2], [3], [4, 5], [5], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:664 # Input is: DigraphDiameter(gr); # Expected output: 4 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:666 # Input is: gr := Digraph([[1, 2], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:667 # Input is: DigraphDiameter(gr); # Expected output: 1 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:669 # Input is: gr := Digraph([[2], [3], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:670 # Input is: IsStronglyConnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/attr.tst:672 # Input is: DigraphDiameter(gr); # Expected output: fail # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:674 # Input is: gr := Digraph([[1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:675 # Input is: DigraphDiameter(gr); # Expected output: 0 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:677 # Input is: gr := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:678 # Input is: DigraphDiameter(gr); # Expected output: fail # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:680 # Input is: gr := EmptyDigraph(1);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:681 # Input is: DigraphDiameter(gr); # Expected output: 0 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:725 # Input is: gr := DigraphFromDiSparse6String(str); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:727 # Input is: DigraphDiameter(gr); # Expected output: fail # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:731 # Input is: gr1 := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:733 # Input is: IsSymmetricDigraph(gr1); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:735 # Input is: gr2 := DigraphSymmetricClosure(gr1); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:737 # Input is: IsIdenticalObj(gr1, gr2); # Expected output: true # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/attr.tst:739 # Input is: gr1 = gr2; # Expected output: true # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/attr.tst:741 # Input is: gr1 := Digraph([[1, 1, 1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:743 # Input is: gr2 := DigraphSymmetricClosure(gr1); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:745 # Input is: IsIdenticalObj(gr1, gr2); # Expected output: true # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/attr.tst:747 # Input is: gr1 = gr2; # Expected output: true # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/attr.tst:749 # Input is: gr1 := Digraph( [[], [4, 5], [12], [3], [2, 10, 11, 12], [2, 8, 10, 12], [5], [11, 12], [12], [12], [2, 6, 7, 8], [3, 8, 10]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:753 # Input is: IsSymmetricDigraph(gr1); # Expected output: false # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:755 # Input is: gr2 := DigraphSymmetricClosure(gr1); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:757 # Input is: HasIsSymmetricDigraph(gr2); # Expected output: true # But found: Error, Variable: 'HasIsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:759 # Input is: IsSymmetricDigraph(gr2); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:761 # Input is: gr3 := Digraph( [[], [4, 5, 11, 6], [4, 12], [2, 3], [2, 10, 11, 12, 7], [8, 10, 12, 2, 11], [5, 11], [11, 12, 6], [12], [5, 6, 12], [7, 6, 2, 5, 8], [10, 5, 3, 8, 6, 9]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:765 # Input is: gr2 = gr3; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/attr.tst:767 # Input is: gr := DigraphSymmetricClosure(ChainDigraph(10000)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:769 # Input is: IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:771 # Input is: gr := DigraphCopy(gr); # Expected output: # But found: Error, Variable: 'DigraphCopy' must have a value ######## ########> Diff in standard/attr.tst:773 # Input is: IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:777 # Input is: gr := Digraph(rec(DigraphNrVertices := 2, DigraphSource := [1, 1], DigraphRange := [2, 2])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:781 # Input is: DigraphReflexiveTransitiveClosure(gr); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:783 # Input is: DigraphTransitiveClosure(gr); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:787 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:789 # Input is: IsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/attr.tst:791 # Input is: DigraphTopologicalSort(gr); # Expected output: fail # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/attr.tst:793 # Input is: gr1 := DigraphTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:795 # Input is: gr2 := DigraphReflexiveTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:797 # Input is: gr1 = gr2; # Expected output: true # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/attr.tst:799 # Input is: gr1 = DigraphReflexiveTransitiveClosure(DigraphMutableCopy(gr)); # Expected output: true # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/attr.tst:802 # Input is: gr := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:804 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/attr.tst:806 # Input is: gr1 := DigraphTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:808 # Input is: gr2 := DigraphReflexiveTransitiveClosure(DigraphImmutableCopy(gr)); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:810 # Input is: gr := Digraph([[2], [3], [4], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:812 # Input is: gr1 := DigraphTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:814 # Input is: gr2 := DigraphReflexiveTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:816 # Input is: gr := Digraph([[2], [3], [4, 5], [], [5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:818 # Input is: gr1 := DigraphTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:820 # Input is: gr2 := DigraphReflexiveTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:822 # Input is: gr := Digraph( [[1, 4, 5, 6, 7, 8], [5, 7, 8, 9, 10, 13], [2, 4, 6, 10], [7, 9, 10, 11], [7, 9, 10, 12, 13, 15], [7, 8, 10, 13], [10, 11], [7, 10, 12, 13, 14, 15, 16], [7, 10, 11, 14, 16], [11], [11], [7, 13, 14], [10, 11], [7, 10, 11], [7, 13, 16], [7, 10, 11]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:828 # Input is: trans1 := DigraphTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:830 # Input is: trans2 := DigraphByAdjacencyMatrix(DIGRAPH_TRANS_CLOSURE(gr)); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:832 # Input is: trans1 = trans2; # Expected output: true # But found: Error, Variable: 'trans1' must have a value ######## ########> Diff in standard/attr.tst:834 # Input is: trans := Digraph(OutNeighbours(trans1)); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:836 # Input is: IsReflexiveDigraph(trans); # Expected output: false # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/attr.tst:838 # Input is: IsTransitiveDigraph(trans); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/attr.tst:840 # Input is: IS_TRANSITIVE_DIGRAPH(trans); # Expected output: true # But found: Error, Variable: 'IS_TRANSITIVE_DIGRAPH' must have a value ######## ########> Diff in standard/attr.tst:842 # Input is: reflextrans1 := DigraphReflexiveTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:844 # Input is: reflextrans2 := DigraphByAdjacencyMatrix(DIGRAPH_REFLEX_TRANS_CLOSURE(gr)); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:847 # Input is: reflextrans1 = reflextrans2; # Expected output: true # But found: Error, Variable: 'reflextrans1' must have a value ######## ########> Diff in standard/attr.tst:849 # Input is: reflextrans := Digraph(OutNeighbours(reflextrans1)); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:851 # Input is: IsReflexiveDigraph(reflextrans); # Expected output: true # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/attr.tst:853 # Input is: IsTransitiveDigraph(reflextrans); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/attr.tst:855 # Input is: IS_TRANSITIVE_DIGRAPH(reflextrans); # Expected output: true # But found: Error, Variable: 'IS_TRANSITIVE_DIGRAPH' must have a value ######## ########> Diff in standard/attr.tst:859 # Input is: gr := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:860 # Input is: ReducedDigraph(gr) = gr; # Expected output: true # But found: Error, Variable: 'ReducedDigraph' must have a value ######## ########> Diff in standard/attr.tst:862 # Input is: DigraphEdges(ReducedDigraph(Digraph(IsMutableDigraph, [[2], []]))); # Expected output: [ [ 1, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/attr.tst:864 # Input is: gr := Digraph([[2, 4, 2, 6, 1], [], [], [2, 1, 4], [], [1, 7, 7, 7], [4, 6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:867 # Input is: rd := ReducedDigraph(gr); # Expected output: # But found: Error, Variable: 'ReducedDigraph' must have a value ######## ########> Diff in standard/attr.tst:869 # Input is: DigraphVertexLabels(rd); # Expected output: [ 1, 2, 4, 6, 7 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/attr.tst:871 # Input is: gr := CompleteDigraph(10); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:873 # Input is: rd := ReducedDigraph(gr); # Expected output: # But found: Error, Variable: 'ReducedDigraph' must have a value ######## ########> Diff in standard/attr.tst:875 # Input is: rd = gr; # Expected output: true # But found: Error, Variable: 'rd' must have a value ######## ########> Diff in standard/attr.tst:877 # Input is: DigraphVertexLabels(gr) = DigraphVertexLabels(rd); # Expected output: true # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/attr.tst:879 # Input is: gr := Digraph([[], [4, 2], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:881 # Input is: SetDigraphVertexLabels(gr, ["one", "two", "three", "four"]); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/attr.tst:882 # Input is: rd := ReducedDigraph(gr); # Expected output: # But found: Error, Variable: 'ReducedDigraph' must have a value ######## ########> Diff in standard/attr.tst:884 # Input is: DigraphVertexLabels(gr); # Expected output: [ "one", "two", "three", "four" ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/attr.tst:886 # Input is: DigraphVertexLabels(rd); # Expected output: [ "two", "three", "four" ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/attr.tst:888 # Input is: gr := Digraph([[], [4, 2], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:890 # Input is: SetDigraphEdgeLabels(gr, [[], ["a", "b"], [], ["c"]]); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabels' must have a value ######## ########> Diff in standard/attr.tst:891 # Input is: rd := ReducedDigraph(gr); # Expected output: # But found: Error, Variable: 'ReducedDigraph' must have a value ######## ########> Diff in standard/attr.tst:893 # Input is: DigraphEdgeLabels(gr); # Expected output: [ [ ], [ "a", "b" ], [ ], [ "c" ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/attr.tst:895 # Input is: DigraphEdgeLabels(rd); # Expected output: [ [ "a", "b" ], [ ], [ "c" ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/attr.tst:899 # Input is: gr := Digraph([]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:900 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:902 # Input is: gr := ChainDigraph(4);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/attr.tst:903 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:905 # Input is: gr := CompleteDigraph(2);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:906 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ [ 1, 2 ] ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:908 # Input is: gr := CompleteDigraph(3);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:909 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ [ 1, 2 ], [ 1, 2, 3 ], [ 1, 3 ], [ 1, 3, 2 ], [ 2, 3 ] ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:911 # Input is: gr := Digraph(["a", "b"], ["a", "b"], ["b", "a"]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:913 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ [ 1, 2 ] ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:915 # Input is: gr := Digraph([[], [3], [2, 4], [5, 4], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:917 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ [ 4 ], [ 4, 5 ], [ 2, 3 ] ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:919 # Input is: gr := Digraph([[], [], [], [4], [], [], [8], [7]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:921 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ [ 4 ], [ 7, 8 ] ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:923 # Input is: gr := Digraph([[1, 2], [2, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:925 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ [ 1 ], [ 2 ], [ 1, 2 ] ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:927 # Input is: gr := Digraph([[4], [1, 3], [1, 2], [2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:928 # Input is: DigraphAllSimpleCircuits(gr); # Expected output: [ [ 1, 4, 2 ], [ 1, 4, 2, 3 ], [ 1, 4, 3 ], [ 1, 4, 3, 2 ], [ 2, 3 ] ] # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:930 # Input is: gr := Digraph([[3, 6, 7], [3, 6, 8], [1, 2, 3, 6, 7, 8], [2, 3, 4, 8], [2, 3, 4, 5, 6, 7], [1, 3, 4, 5, 7], [2, 3, 6, 8], [1, 2, 3, 8]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:933 # Input is: Length(DigraphAllSimpleCircuits(gr)); # Expected output: 259 # But found: Error, Variable: 'DigraphAllSimpleCircuits' must have a value ######## ########> Diff in standard/attr.tst:937 # Input is: gr := Digraph([]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:938 # Input is: DigraphLongestSimpleCircuit(gr); # Expected output: fail # But found: Error, Variable: 'DigraphLongestSimpleCircuit' must have a value ######## ########> Diff in standard/attr.tst:940 # Input is: gr := Digraph([[], [2]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:941 # Input is: DigraphLongestSimpleCircuit(gr); # Expected output: [ 2 ] # But found: Error, Variable: 'DigraphLongestSimpleCircuit' must have a value ######## ########> Diff in standard/attr.tst:943 # Input is: gr := Digraph([[], [3], [2, 4], [5, 4], [4]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:944 # Input is: DigraphLongestSimpleCircuit(gr); # Expected output: [ 4, 5 ] # But found: Error, Variable: 'DigraphLongestSimpleCircuit' must have a value ######## ########> Diff in standard/attr.tst:946 # Input is: gr := ChainDigraph(10);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/attr.tst:947 # Input is: DigraphLongestSimpleCircuit(gr); # Expected output: fail # But found: Error, Variable: 'DigraphLongestSimpleCircuit' must have a value ######## ########> Diff in standard/attr.tst:949 # Input is: gr := Digraph([[3], [1], [1, 4], [1, 1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:950 # Input is: DigraphLongestSimpleCircuit(gr); # Expected output: [ 1, 3, 4 ] # But found: Error, Variable: 'DigraphLongestSimpleCircuit' must have a value ######## ########> Diff in standard/attr.tst:952 # Input is: gr := Digraph([[2, 6, 10], [3], [4], [5], [1], [7], [8], [9], [1], [11], [12], [13], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:954 # Input is: DigraphLongestSimpleCircuit(gr); # Expected output: [ 1, 2, 3, 4, 5 ] # But found: Error, Variable: 'DigraphLongestSimpleCircuit' must have a value ######## ########> Diff in standard/attr.tst:956 # Input is: gr := Digraph([[2, 6, 10], [3], [4], [5], [1], [7], [8], [9], [1], [11], [12], [1, 13], [14], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:958 # Input is: DigraphLongestSimpleCircuit(gr); # Expected output: [ 1, 10, 11, 12, 13, 14 ] # But found: Error, Variable: 'DigraphLongestSimpleCircuit' must have a value ######## ########> Diff in standard/attr.tst:962 # Input is: gr := Digraph([[2], [1, 3], [4], [3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:963 # Input is: AsTransformation(gr); # Expected output: fail # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/attr.tst:965 # Input is: gr := AsDigraph(Transformation([1, 1, 1]), 5); # Expected output: # But found: Error, Variable: 'AsDigraph' must have a value ######## ########> Diff in standard/attr.tst:967 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 1 ], [ 2, 1 ], [ 3, 1 ], [ 4, 4 ], [ 5, 5 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/attr.tst:969 # Input is: AsTransformation(gr); # Expected output: Transformation( [ 1, 1, 1 ] ) # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/attr.tst:973 # Input is: DigraphBicomponents(EmptyDigraph(0)); # Expected output: fail # But found: Error, Variable: 'DigraphBicomponents' must have a value ######## ########> Diff in standard/attr.tst:975 # Input is: DigraphBicomponents(EmptyDigraph(1)); # Expected output: fail # But found: Error, Variable: 'DigraphBicomponents' must have a value ######## ########> Diff in standard/attr.tst:977 # Input is: DigraphBicomponents(EmptyDigraph(2)); # Expected output: [ [ 1 ], [ 2 ] ] # But found: Error, Variable: 'DigraphBicomponents' must have a value ######## ########> Diff in standard/attr.tst:979 # Input is: DigraphBicomponents(EmptyDigraph(3)); # Expected output: [ [ 1, 2 ], [ 3 ] ] # But found: Error, Variable: 'DigraphBicomponents' must have a value ######## ########> Diff in standard/attr.tst:981 # Input is: DigraphBicomponents(EmptyDigraph(4)); # Expected output: [ [ 1, 2, 3 ], [ 4 ] ] # But found: Error, Variable: 'DigraphBicomponents' must have a value ######## ########> Diff in standard/attr.tst:983 # Input is: DigraphBicomponents(CompleteBipartiteDigraph(3, 5)); # Expected output: [ [ 1, 2, 3 ], [ 4, 5, 6, 7, 8 ] ] # But found: Error, Variable: 'DigraphBicomponents' must have a value ######## ########> Diff in standard/attr.tst:985 # Input is: DigraphBicomponents(Digraph([[2], [], [], [3]])); # Expected output: [ [ 1, 3 ], [ 2, 4 ] ] # But found: Error, Variable: 'DigraphBicomponents' must have a value ######## ########> Diff in standard/attr.tst:987 # Input is: DigraphBicomponents(CycleDigraph(3)); # Expected output: fail # But found: Error, Variable: 'DigraphBicomponents' must have a value ######## ########> Diff in standard/attr.tst:991 # Input is: gr := ChainDigraph(4);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/attr.tst:992 # Input is: DigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/attr.tst:994 # Input is: DigraphLoops(gr); # Expected output: [ ] # But found: Error, Variable: 'DigraphLoops' must have a value ######## ########> Diff in standard/attr.tst:996 # Input is: gr := Digraph([[2], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:997 # Input is: DigraphLoops(gr); # Expected output: [ ] # But found: Error, Variable: 'DigraphLoops' must have a value ######## ########> Diff in standard/attr.tst:999 # Input is: gr := Digraph([[1, 5, 6], [1, 3, 4, 5, 6], [1, 3, 4], [2, 4, 6], [2], [1, 4, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1002 # Input is: DigraphLoops(gr); # Expected output: [ 1, 3, 4 ] # But found: Error, Variable: 'DigraphLoops' must have a value ######## ########> Diff in standard/attr.tst:1006 # Input is: gr := Digraph([[2, 3, 4, 5], [], [], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1007 # Input is: OutDegrees(gr); # Expected output: [ 4, 0, 0, 0, 0 ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:1009 # Input is: InDegrees(gr); # Expected output: [ 0, 1, 1, 1, 1 ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/attr.tst:1011 # Input is: InDegreeSet(gr); # Expected output: [ 0, 1 ] # But found: Error, Variable: 'InDegreeSet' must have a value ######## ########> Diff in standard/attr.tst:1013 # Input is: OutDegrees(gr); # Expected output: [ 4, 0, 0, 0, 0 ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/attr.tst:1015 # Input is: OutDegreeSet(gr); # Expected output: [ 0, 4 ] # But found: Error, Variable: 'OutDegreeSet' must have a value ######## ########> Diff in standard/attr.tst:1017 # Input is: gr := Digraph([[2, 3, 4, 5], [], [], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1018 # Input is: InNeighbours(gr);; # Expected output: # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in standard/attr.tst:1019 # Input is: DigraphGroup(gr); # Expected output: Group([ (4,5), (3,4), (2,3) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1021 # Input is: InDegreeSequence(gr); # Expected output: [ 1, 1, 1, 1, 0 ] # But found: Error, Variable: 'InDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:1023 # Input is: gr := DigraphSymmetricClosure(ChainDigraph(4));; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1024 # Input is: DigraphGroup(gr); # Expected output: Group([ (1,4)(2,3) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1026 # Input is: HasDigraphGroup(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1028 # Input is: OutDegreeSequence(gr); # Expected output: [ 2, 2, 1, 1 ] # But found: Error, Variable: 'OutDegreeSequence' must have a value ######## ########> Diff in standard/attr.tst:1032 # Input is: gr := Digraph([[2, 3, 4, 5], [], [], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1033 # Input is: DigraphGroup(gr); # Expected output: Group([ (4,5), (3,4), (2,3) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1035 # Input is: DigraphDiameter(gr); # Expected output: fail # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:1037 # Input is: gr := Digraph([[2, 3, 4, 5], [6], [6], [6], [6], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1038 # Input is: DigraphGroup(gr); # Expected output: Group([ (4,5), (3,4), (2,3) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1040 # Input is: DigraphDiameter(gr); # Expected output: 3 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:1042 # Input is: gr := DigraphSymmetricClosure(CycleDigraph(7));; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1043 # Input is: DigraphUndirectedGirth(gr); # Expected output: 7 # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1045 # Input is: DigraphDiameter(gr); # Expected output: 3 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:1047 # Input is: DigraphGroup(gr) = DihedralGroup(IsPermGroup, 14); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1049 # Input is: gr := DigraphSymmetricClosure(CycleDigraph(7));; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1050 # Input is: DigraphDiameter(gr); # Expected output: 3 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:1052 # Input is: DigraphUndirectedGirth(gr); # Expected output: 7 # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1054 # Input is: DigraphGroup(gr) = DihedralGroup(IsPermGroup, 14); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1056 # Input is: gr := Digraph([[], [3], [2]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1057 # Input is: DigraphUndirectedGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1059 # Input is: DigraphDiameter(gr); # Expected output: fail # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:1061 # Input is: gr := Digraph([[2, 4], [1, 3], [2, 3], [1, 5], [4, 5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1062 # Input is: DigraphGroup(gr); # Expected output: Group([ (2,4)(3,5) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1064 # Input is: DigraphDiameter(gr); # Expected output: 4 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:1066 # Input is: DigraphUndirectedGirth(gr); # Expected output: 1 # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1068 # Input is: gr := Digraph([[2, 2, 4, 4], [1, 1, 3], [2], [1, 1, 5], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1070 # Input is: DigraphDiameter(gr); # Expected output: 4 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:1072 # Input is: DigraphUndirectedGirth(gr); # Expected output: 2 # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1074 # Input is: gr := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1075 # Input is: DigraphUndirectedGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1077 # Input is: DigraphDiameter(gr); # Expected output: fail # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/attr.tst:1081 # Input is: gr := CompleteDigraph(4);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:1082 # Input is: mat := BooleanAdjacencyMatrix(gr); # Expected output: [ [ false, true, true, true ], [ true, false, true, true ], [ true, true, false, true ], [ true, true, true, false ] ] # But found: Error, Variable: 'BooleanAdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:1085 # Input is: IsSymmetricDigraph(gr) and mat = TransposedMat(mat); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1087 # Input is: gr := EmptyDigraph(5);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1088 # Input is: mat := BooleanAdjacencyMatrix(gr); # Expected output: [ [ false, false, false, false, false ], [ false, false, false, false, false ] , [ false, false, false, false, false ], [ false, false, false, false, false ], [ false, false, false, false, false ] ] # But found: Error, Variable: 'BooleanAdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:1093 # Input is: IsSymmetricDigraph(gr) and mat = TransposedMat(mat); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1095 # Input is: gr := CycleDigraph(4);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1096 # Input is: mat := BooleanAdjacencyMatrix(gr); # Expected output: [ [ false, true, false, false ], [ false, false, true, false ], [ false, false, false, true ], [ true, false, false, false ] ] # But found: Error, Variable: 'BooleanAdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:1099 # Input is: not (IsSymmetricDigraph(gr) or mat = TransposedMat(mat)); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1101 # Input is: gr := ChainDigraph(4);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/attr.tst:1102 # Input is: mat := BooleanAdjacencyMatrix(gr); # Expected output: [ [ false, true, false, false ], [ false, false, true, false ], [ false, false, false, true ], [ false, false, false, false ] ] # But found: Error, Variable: 'BooleanAdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:1105 # Input is: not (IsSymmetricDigraph(gr) or mat = TransposedMat(mat)); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1107 # Input is: gr := Digraph([ [1, 4, 6, 8], [2, 8, 10], [4], [1, 6], [6, 7], [1, 2, 4, 10], [3], [3], [1, 8], [2, 5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1110 # Input is: mat := BooleanAdjacencyMatrix(gr); # Expected output: [ [ true, false, false, true, false, true, false, true, false, false ], [ false, true, false, false, false, false, false, true, false, true ], [ false, false, false, true, false, false, false, false, false, false ], [ true, false, false, false, false, true, false, false, false, false ], [ false, false, false, false, false, true, true, false, false, false ], [ true, true, false, true, false, false, false, false, false, true ], [ false, false, true, false, false, false, false, false, false, false ], [ false, false, true, false, false, false, false, false, false, false ], [ true, false, false, false, false, false, false, true, false, false ], [ false, true, false, false, true, false, false, false, false, false ] ] # But found: Error, Variable: 'BooleanAdjacencyMatrix' must have a value ######## ########> Diff in standard/attr.tst:1121 # Input is: gr = DigraphByAdjacencyMatrix(mat); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/attr.tst:1125 # Input is: gr := Digraph([[2], [3], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1126 # Input is: DigraphUndirectedGirth(gr); # Expected output: Error, the argument must be a symmetric digraph, # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1128 # Input is: gr := Digraph([[2], [1, 3], [2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1129 # Input is: DigraphUndirectedGirth(gr); # Expected output: 1 # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1131 # Input is: gr := Digraph([[2, 2], [1, 1, 3], [2]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1132 # Input is: DigraphUndirectedGirth(gr); # Expected output: 2 # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1136 # Input is: gr := Digraph([[1], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1138 # Input is: DigraphGirth(gr); # Expected output: 1 # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1140 # Input is: gr := Digraph([[2, 3], [3], [4], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1142 # Input is: DigraphGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1144 # Input is: gr := Digraph([[2, 3], [3], [4], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1146 # Input is: DigraphGirth(gr); # Expected output: 3 # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1148 # Input is: gr := EmptyDigraph(42);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1149 # Input is: DigraphGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1151 # Input is: gr := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1152 # Input is: DigraphGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1154 # Input is: gr := Digraph([[2], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1155 # Input is: DigraphGirth(gr); # Expected output: 2 # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1157 # Input is: DigraphUndirectedGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1159 # Input is: gr := Digraph([[2], [1], [4], [5, 6], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1160 # Input is: DigraphGirth(gr); # Expected output: 2 # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1162 # Input is: DigraphUndirectedGirth(gr); # Expected output: Error, the argument must be a symmetric digraph, # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/attr.tst:1166 # Input is: gr := Digraph([[2, 3], [3], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1168 # Input is: DigraphOddGirth(gr); # Expected output: 3 # But found: Error, Variable: 'DigraphOddGirth' must have a value ######## ########> Diff in standard/attr.tst:1170 # Input is: gr := Digraph([[2], [3], [], [3], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1172 # Input is: DigraphOddGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphOddGirth' must have a value ######## ########> Diff in standard/attr.tst:1174 # Input is: gr := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1176 # Input is: DigraphOddGirth(gr); # Expected output: 1 # But found: Error, Variable: 'DigraphOddGirth' must have a value ######## ########> Diff in standard/attr.tst:1178 # Input is: gr := Digraph([[2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1180 # Input is: DigraphOddGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphOddGirth' must have a value ######## ########> Diff in standard/attr.tst:1182 # Input is: gr := CycleDigraph(4); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1184 # Input is: DigraphOddGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphOddGirth' must have a value ######## ########> Diff in standard/attr.tst:1186 # Input is: gr := DigraphDisjointUnion(CycleDigraph(2), CycleDigraph(3));; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/attr.tst:1187 # Input is: for i in [1 .. 50] do gr := DigraphDisjointUnion(gr, CycleDigraph(3)); od; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have an assigned value ######## ########> Diff in standard/attr.tst:1190 # Input is: DigraphOddGirth(gr); # Expected output: 3 # But found: Error, Variable: 'DigraphOddGirth' must have a value ######## ########> Diff in standard/attr.tst:1192 # Input is: G := Digraph(IsMutableDigraph, [[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1194 # Input is: for i in [2 .. 200] do DigraphAddVertex(G, i); DigraphAddEdges(G, [[1, i], [i, 1]]); od; # Expected output: # But found: Error, Variable: 'DigraphAddVertex' must have an assigned value ######## ########> Diff in standard/attr.tst:1198 # Input is: D := CycleDigraph(IsMutableDigraph, 7); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1200 # Input is: for i in [1 .. 20] do DigraphDisjointUnion(D, G); od; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have an assigned value ######## ########> Diff in standard/attr.tst:1203 # Input is: DigraphOddGirth(D); # Expected output: 7 # But found: Error, Variable: 'DigraphOddGirth' must have a value ######## ########> Diff in standard/attr.tst:1207 # Input is: D1 := DigraphSymmetricClosure(CycleDigraph(2)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1209 # Input is: D2 := DigraphSymmetricClosure(CycleDigraph(5)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1211 # Input is: IsIsomorphicDigraph(DigraphMycielskian(D1), D2); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/attr.tst:1213 # Input is: D := DigraphSymmetricClosure(CayleyDigraph(DihedralGroup(8))); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1215 # Input is: ChromaticNumber(D); # Expected output: 4 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1217 # Input is: D := DigraphMycielskian(D); # Expected output: # But found: Error, Variable: 'DigraphMycielskian' must have a value ######## ########> Diff in standard/attr.tst:1219 # Input is: ChromaticNumber(D); # Expected output: 5 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1221 # Input is: D1 := Digraph([[], [3], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1223 # Input is: D2 := Digraph([[], [3, 4], [2, 5], [2, 6], [3, 6], [4, 5, 7], [6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1225 # Input is: IsIsomorphicDigraph(DigraphMycielskian(D1), D2); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/attr.tst:1227 # Input is: D := DigraphSymmetricClosure(CycleDigraph(5)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1229 # Input is: D := DigraphMutableCopy(D); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/attr.tst:1231 # Input is: DigraphMycielskian(D); # Expected output: # But found: Error, Variable: 'DigraphMycielskian' must have a value ######## ########> Diff in standard/attr.tst:1233 # Input is: D := DigraphSymmetricClosure(Digraph([[1, 2], [1]])); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1235 # Input is: D := DigraphMutableCopy(D); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/attr.tst:1237 # Input is: DigraphMycielskian(D); # Expected output: # But found: Error, Variable: 'DigraphMycielskian' must have a value ######## ########> Diff in standard/attr.tst:1239 # Input is: D := DigraphEdgeUnion(CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/attr.tst:1241 # Input is: DigraphMycielskian(D); # Expected output: Error, the argument must be a symmetric digraph with no multiple edges, # But found: Error, Variable: 'DigraphMycielskian' must have a value ######## ########> Diff in standard/attr.tst:1243 # Input is: DigraphMycielskian(DigraphMutableCopy(D)); # Expected output: Error, the argument must be a symmetric digraph with no multiple edges, # But found: Error, Variable: 'DigraphMycielskian' must have a value ######## ########> Diff in standard/attr.tst:1245 # Input is: D := DigraphEdgeUnion(CompleteDigraph(3), CompleteDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/attr.tst:1247 # Input is: DigraphMycielskian(D); # Expected output: Error, the argument must be a symmetric digraph with no multiple edges, # But found: Error, Variable: 'DigraphMycielskian' must have a value ######## ########> Diff in standard/attr.tst:1249 # Input is: DigraphMycielskian(DigraphMutableCopy(D)); # Expected output: Error, the argument must be a symmetric digraph with no multiple edges, # But found: Error, Variable: 'DigraphMycielskian' must have a value ######## ########> Diff in standard/attr.tst:1253 # Input is: gr := Digraph([[2, 2], [1, 1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1254 # Input is: IsMultiDigraph(gr) and IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/attr.tst:1256 # Input is: DigraphDegeneracy(gr); # Expected output: Error, the argument must be a symmetric digraph with no multiple edges, # But found: Error, Variable: 'DigraphDegeneracy' must have a value ######## ########> Diff in standard/attr.tst:1258 # Input is: DigraphDegeneracyOrdering(gr); # Expected output: Error, the argument must be a symmetric digraph with no multiple edges, # But found: Error, Variable: 'DigraphDegeneracyOrdering' must have a value ######## ########> Diff in standard/attr.tst:1260 # Input is: gr := Digraph([[2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1262 # Input is: not IsMultiDigraph(gr) and not IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/attr.tst:1264 # Input is: DigraphDegeneracy(gr); # Expected output: Error, the argument must be a symmetric digraph with no multiple edges, # But found: Error, Variable: 'DigraphDegeneracy' must have a value ######## ########> Diff in standard/attr.tst:1266 # Input is: DigraphDegeneracyOrdering(gr); # Expected output: Error, the argument must be a symmetric digraph with no multiple edges, # But found: Error, Variable: 'DigraphDegeneracyOrdering' must have a value ######## ########> Diff in standard/attr.tst:1268 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:1269 # Input is: DigraphDegeneracy(gr); # Expected output: 4 # But found: Error, Variable: 'DigraphDegeneracy' must have a value ######## ########> Diff in standard/attr.tst:1271 # Input is: DigraphDegeneracyOrdering(gr); # Expected output: [ 5, 4, 3, 2, 1 ] # But found: Error, Variable: 'DigraphDegeneracyOrdering' must have a value ######## ########> Diff in standard/attr.tst:1273 # Input is: gr := DigraphSymmetricClosure(ChainDigraph(4)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1275 # Input is: DigraphDegeneracy(gr); # Expected output: 1 # But found: Error, Variable: 'DigraphDegeneracy' must have a value ######## ########> Diff in standard/attr.tst:1277 # Input is: DigraphDegeneracyOrdering(gr); # Expected output: [ 4, 3, 2, 1 ] # But found: Error, Variable: 'DigraphDegeneracyOrdering' must have a value ######## ########> Diff in standard/attr.tst:1279 # Input is: gr := Digraph([[3], [], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1281 # Input is: DigraphDegeneracy(gr); # Expected output: 1 # But found: Error, Variable: 'DigraphDegeneracy' must have a value ######## ########> Diff in standard/attr.tst:1283 # Input is: gr := DigraphSymmetricClosure(Digraph( [[2, 5], [3, 5], [4], [5, 6], [], []])); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1286 # Input is: DigraphDegeneracy(gr); # Expected output: 2 # But found: Error, Variable: 'DigraphDegeneracy' must have a value ######## ########> Diff in standard/attr.tst:1288 # Input is: DigraphDegeneracyOrdering(gr); # Expected output: [ 6, 4, 3, 2, 5, 1 ] # But found: Error, Variable: 'DigraphDegeneracyOrdering' must have a value ######## ########> Diff in standard/attr.tst:1292 # Input is: gr := Digraph([[2, 3, 4, 5], [6, 3], [6, 2], [6], [6], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1293 # Input is: DigraphGirth(gr); # Expected output: 2 # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1295 # Input is: gr := Digraph([[2, 3, 4, 5], [6, 3], [6, 2], [6], [6], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1296 # Input is: DigraphGroup(gr) = Group([(4, 5), (2, 3)]); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1298 # Input is: DigraphGirth(gr); # Expected output: 2 # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1300 # Input is: gr := Digraph([[2, 6, 10], [3], [4], [5], [1], [7], [8], [9], [1], [11], [12], [13], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1302 # Input is: DigraphGirth(gr); # Expected output: 5 # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1304 # Input is: gr := Digraph([[2, 6, 10], [3], [4], [5], [1], [7], [8], [9], [1], [11], [12], [13], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1306 # Input is: DigraphGroup(gr); # Expected output: Group([ (6,10)(7,11)(8,12)(9,13), (2,6)(3,7)(4,8)(5,9) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/attr.tst:1308 # Input is: DigraphGirth(gr); # Expected output: 5 # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/attr.tst:1312 # Input is: gr := Digraph([[2], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1313 # Input is: IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1315 # Input is: MaximalSymmetricSubdigraph(gr) = gr; # Expected output: true # But found: Error, Variable: 'MaximalSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1317 # Input is: gr2 := Digraph([[2, 2], [1, 1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1318 # Input is: IsSymmetricDigraph(gr2) and IsMultiDigraph(gr2); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1320 # Input is: MaximalSymmetricSubdigraph(gr2) = gr; # Expected output: true # But found: Error, Variable: 'MaximalSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1322 # Input is: gr := Digraph([[2, 3], [1, 3], [4], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1324 # Input is: IsSymmetricDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1326 # Input is: gr2 := MaximalSymmetricSubdigraph(gr); # Expected output: # But found: Error, Variable: 'MaximalSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1328 # Input is: OutNeighbours(gr2); # Expected output: [ [ 2 ], [ 1 ], [ ], [ 4 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:1330 # Input is: gr2 := MaximalSymmetricSubdigraphWithoutLoops(gr); # Expected output: # But found: Error, Variable: 'MaximalSymmetricSubdigraphWithoutLoops' must have a value ######## ########> Diff in standard/attr.tst:1332 # Input is: OutNeighbours(gr2); # Expected output: [ [ 2 ], [ 1 ], [ ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:1334 # Input is: gr := Digraph([[2, 2], [1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1336 # Input is: gr2 := MaximalSymmetricSubdigraphWithoutLoops(gr); # Expected output: # But found: Error, Variable: 'MaximalSymmetricSubdigraphWithoutLoops' must have a value ######## ########> Diff in standard/attr.tst:1338 # Input is: OutNeighbours(gr2); # Expected output: [ [ 2 ], [ 1 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:1340 # Input is: gr := Digraph([[1, 2, 2], [1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1342 # Input is: IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1344 # Input is: gr3 := MaximalSymmetricSubdigraphWithoutLoops(gr); # Expected output: # But found: Error, Variable: 'MaximalSymmetricSubdigraphWithoutLoops' must have a value ######## ########> Diff in standard/attr.tst:1346 # Input is: gr2 = gr3; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/attr.tst:1348 # Input is: gr := Digraph([[2, 3], [1], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1350 # Input is: IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1352 # Input is: gr := MaximalSymmetricSubdigraphWithoutLoops(gr); # Expected output: # But found: Error, Variable: 'MaximalSymmetricSubdigraphWithoutLoops' must have a value ######## ########> Diff in standard/attr.tst:1354 # Input is: OutNeighbours(gr); # Expected output: [ [ 2, 3 ], [ 1 ], [ 1 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:1358 # Input is: gr := CycleDigraph(5); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1360 # Input is: RepresentativeOutNeighbours(gr); # Expected output: [ [ 2 ] ] # But found: Error, Variable: 'RepresentativeOutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:1362 # Input is: DigraphOrbitReps(gr); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphOrbitReps' must have a value ######## ########> Diff in standard/attr.tst:1364 # Input is: gr := Digraph([[2], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1366 # Input is: RepresentativeOutNeighbours(gr); # Expected output: [ [ 2 ], [ 3 ], [ ] ] # But found: Error, Variable: 'RepresentativeOutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:1370 # Input is: gr := Digraph([[1, 3], [2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1372 # Input is: adj := DigraphAdjacencyFunction(gr); # Expected output: function( u, v ) ... end # But found: Error, Variable: 'DigraphAdjacencyFunction' must have a value ######## ########> Diff in standard/attr.tst:1374 # Input is: adj(1, 1); # Expected output: true # But found: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `CallFuncList' on 2 arguments ######## ########> Diff in standard/attr.tst:1376 # Input is: adj(3, 1); # Expected output: false # But found: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `CallFuncList' on 2 arguments ######## ########> Diff in standard/attr.tst:1378 # Input is: adj(2, 7); # Expected output: false # But found: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `CallFuncList' on 2 arguments ######## ########> Diff in standard/attr.tst:1382 # Input is: ChromaticNumber(Digraph([[1]])); # Expected output: Error, the argument must be a digraph with no loops, # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1384 # Input is: ChromaticNumber(NullDigraph(10)); # Expected output: 1 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1386 # Input is: ChromaticNumber(CompleteDigraph(10)); # Expected output: 10 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1388 # Input is: ChromaticNumber(CompleteBipartiteDigraph(5, 5)); # Expected output: 2 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1390 # Input is: ChromaticNumber(DigraphRemoveEdge(CompleteDigraph(10), [1, 2])); # Expected output: 10 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1392 # Input is: ChromaticNumber(DigraphDisjointUnion(CompleteDigraph(10), CompleteBipartiteDigraph(50, 50))); # Expected output: 10 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1395 # Input is: ChromaticNumber(Digraph([[4, 8], [6, 10], [9], [2, 3, 9], [], [3], [4], [6], [], [5, 7]])); # Expected output: 3 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1398 # Input is: DigraphColouring(Digraph([[4, 8], [6, 10], [9], [2, 3, 9], [], [3], [4], [6], [], [5, 7]]), 2); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/attr.tst:1401 # Input is: DigraphColouring(Digraph([[4, 8], [6, 10], [9], [2, 3, 9], [], [3], [4], [6], [], [5, 7]]), 3); # Expected output: Transformation( [ 2, 2, 3, 1, 2, 1, 2, 3, 2, 1 ] ) # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/attr.tst:1404 # Input is: ChromaticNumber(DigraphDisjointUnion(CompleteDigraph(1), Digraph([[2], [4], [1, 2], [3]]))); # Expected output: 3 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1407 # Input is: ChromaticNumber(DigraphDisjointUnion(CompleteDigraph(1), Digraph([[2], [4], [1, 2], [3], [1, 2, 3]]))); # Expected output: 4 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1410 # Input is: gr := DigraphFromDigraph6String(Concatenation( "&l??O?C?A_@???CE????GAAG?C??M?????@_?OO??G??@?IC???_C?G?o??C?AO???c_??A?", "A?S???OAA???OG???G_A??C?@?cC????_@G???S??C_?C???[??A?A?OA?O?@?A?@A???GGO", "??`?_O??G?@?A??G?@AH????AA?O@??_??b???Cg??C???_??W?G????d?G?C@A?C???GC?W", "?????K???__O[??????O?W???O@??_G?@?CG??G?@G?C??@G???_Q?O?O?c???OAO?C??C?G", "?O??A@??D??G?C_?A??O?_GA??@@?_?G???E?IW??????_@G?C??")); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/attr.tst:1417 # Input is: ChromaticNumber(gr); # Expected output: 3 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1419 # Input is: DigraphColouring(gr, 3); # Expected output: Transformation( [ 1, 2, 1, 2, 3, 2, 1, 1, 1, 2, 2, 1, 2, 3, 3, 1, 1, 1, 2, 1, 2, 2, 3, 3, 3, 1, 1, 2, 3, 3, 3, 2, 3, 2, 3, 2, 3, 1, 2, 1, 3, 1, 2, 3, 3 ] ) # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/attr.tst:1423 # Input is: DigraphColouring(gr, 2); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/attr.tst:1425 # Input is: DigraphGreedyColouring(gr); # Expected output: Transformation( [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 2, 2, 3, 3, 2, 3, 3, 3, 2, 1, 4, 4, 2, 3, 3, 3, 3, 3, 1, 3, 4, 4, 3, 2, 1, 4, 3, 1 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/attr.tst:1429 # Input is: gr := Digraph([[2, 3, 4], [3], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1431 # Input is: ChromaticNumber(gr); # Expected output: 3 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1433 # Input is: ChromaticNumber(EmptyDigraph(0)); # Expected output: 0 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1435 # Input is: gr := CompleteDigraph(4);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:1436 # Input is: gr := DigraphAddVertex(gr);; # Expected output: # But found: Error, Variable: 'DigraphAddVertex' must have a value ######## ########> Diff in standard/attr.tst:1437 # Input is: ChromaticNumber(gr); # Expected output: 4 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1439 # Input is: gr := DigraphFromDiSparse6String(Concatenation( ".~?C?_O?WF?MD?L`[DgX?}@oX`o?W^?}Fgb@mHOTa_?Od`ODOd`}EGnA?HW]`?IGfaULOLak", "LGA?sBoYAiMOt`[Lw_AGJWP`WHGs_gNWSBIMGF@oKhCASIWxc[BWUAgLGY@uFhKAY?OBBuRp", "EdGH_i_cDOaDEHGf_{COdcQNw|DEV?MCuPG`ASUhH`[I@ADqKOqEAHOiCiTgT`gNPSaWSgNB", "iSGTAeLpIcwS@SD[YGeE]L@UbGVGNBwSGE@_M@^`SHotBi[oBBOXH^_SEou_oG?sB[UGeA{\\", "Gq_CBo`AgK@WDeHPNE_[wXeq@oXDuGP\\aSIo{bK^hC`WJp`fMC_bEW\\G`AOK`[E_^iFF}IOy", "CMapZ_?BoWAw[@vGeN?~CKZGNBcPPwaOH_rD{ax?DKXAD_[P`u_CLISCsUgaAkbwKAKMGTAK", "O`BCgZQO_oT@T_oB_kB?[YTHaCoYA?OPkF?dGKEk\\ACHmAodAcL`RHiJPYDmW`jFYFpba_Pq", "MH[gGE@CJovE[aH}HUXa^e?ZWFA_I`jb?PpOF}?OODwXqRa?MGQCSRq___CoiCoVgOAcKOvE", "qQGBA{UQh`gG@YEkZh|akU@XGofaeIaYpsF{fwB?wCPKC{^q]_I@piJAMphEk_aB_KF`[D{X", "PngMJaCjkL`FHcgAw`{MPMDWkghB_W@sIAH`oH{jAzc{TPwHOjA|_WD_yC?TQ^ew[AQHwhap", "bKda`JUDo_G[hw[@{_aMc?P@JGOewPECXq[IGobB_cNbBa[XQBICjqs_gO`NDWhqoJMC_SAM", "CoYAWKpUIYFqj_?BpXEG[q?JCoycdygw|FGgqpaKK_vCC]A@Gskr@ao^AP_sG@EEwZqZISjw", "CIU?_iDOXP}JCogsKKpBEdKdxWE]V`gJksbS_?@_JGGaaxLiGOcBWTAt_KJ_tBoeXzG{oI?H", "[iRTL]GwK@STqLIoqG\\AwKp`ESfwaCOVPyGK`BK_GHowFoabPc[YPuGkmbR`?ZrIm_BOOFIA", "_\\HGjgKBGP`QEGWqjJ_nBSdwYrXMeK@mGweg?CCPG?FobrDMaEPUFo`bl`sQ`qHMU@^EC[aT", "HsrWFCCQ@IDSbROLWugPKOsW?Akhr[akL`\\FK`aFKmGQq`wS`dF_]apKeCp`Fg`qRL_yRl`S", "|goGG`h@JOlrnaSXq_LWwrs_oJ`?CKSqMIu^ry_WOqGHWtk?_G?GF?EB?B_{AgB_MD?A`MDo", "U`kAgG@KEwK?sCOR`]AOQaW?gU_kBGiAaDOX_CH_gawD_hb???SbGEGWbMCgG@cE__AaM?v_", "oE_paSHwV_SDw}?sHgF@]OOW@cLgCcOCOdAaC?kc_JhJByBgec{F_i_cD_l_ARwI?kDpPawK", "@J`?TG??SEomd_NxY?C@h[A?KgcASI`Yce?OF?cFOgbWSGi_gIPPDYQGdacI_yEINpWcGPPK", "__AO^BsRwL?{MwmB?QPR`yR`QEiRxH`SE?^`CC_l`oPgMA?Uhs?}A`j`KD?bCOXW`Ck[@ueA", "B?vDMJ_vEeM@kEyNp@fwCpi`OD`beYKPlFeK@WEk^IC?gBoRBoWHiFaKqBfmMpCDOVg`CORg", "KB?Xa@_SYP{fC`x`EW]GbaeYiQAaHhVEq[AOh[M@PF[]QF_WBogB?NpoFUA?pBOYgMD_VaP_", "WGpFE?`HGEmV``aCKpLDmPpjGmgPDDGUPz_oD`CHY?PK`cF@CaC`GRCOS@~bcW@xF}B?mGKa", "WK@oNO~CWU`wdKV@kGAB_VASKpgFoeWC?sD@gEkaAa_sEO~EW]`}IUK?{H{hH?D_^qHGkbQf", "_oJ@kGCdQdf[_wpBwRpRE?Z`x`GGpXDg^gL?wL@FGOiWRAOXAUJEIPgFQI@rGiN`OFcex|HW", "eqv`WE?_AsU`}fi@oZAOSa@__]QQJ]C@LGocWbA[RPMDO^qBa[O@NDUVQBGWhGZF?`aHIsjw", "HCGdXkFKaQwa?L@hGWjwqC?Yq[KUAPyGK`aqe[cyw_oH@GD{\\xjF}C`]EkbaPJAI?tC?YQ@_", "KO@bKm??RE_^Q}_WRAAHULpCC_\\AGKm?PeFS\\qyKmBoOIopBEKqAQCHSsi^LEMgF@olQuLQC", "@OHotwUEEuoPA{^A_K?pw`CG[@tHYH`a_sO`BCo`a__SCp]IspxGI?nrSdCdbILiCOsJStiZ", "JeDOqC?PaPHYC?jDSXR^hOpwTA_UQOHggG?@yK@@C_\\rEbwRQHKYG?aA[N`HK}A?gCKVwSAQ", "??mFEIpLFoiHZGWgqiLaK`wFsrILLmSQ[KC{XhGyVPnHoubdaoS`]D{lrl`WG?nB?QPPEwyg", "JD?Ta@Io|GX@wG@lHkkbYaCHOoJgrWqGkmRCL_wWIBo[AFIgpbZ_kQ`~IKlrD`GD_sGoewiB", "?QaKJr")); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:1475 # Input is: gr := DigraphDisjointUnion(gr, CompleteDigraph(5)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/attr.tst:1477 # Input is: ChromaticNumber(gr); # Expected output: 5 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1479 # Input is: gr := Digraph([[2, 4, 7, 3], [3, 5, 8, 1], [1, 6, 9, 2], [5, 7, 1, 6], [6, 8, 2, 4], [4, 9, 3, 5], [8, 1, 4, 9], [9, 2, 5, 7], [7, 3, 6, 8]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1482 # Input is: ChromaticNumber(gr); # Expected output: 3 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1484 # Input is: gr := DigraphSymmetricClosure(ChainDigraph(5)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:1486 # Input is: DigraphGreedyColouring(gr);; # Expected output: # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/attr.tst:1487 # Input is: ChromaticNumber(gr); # Expected output: 2 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1489 # Input is: gr := DigraphFromGraph6String("KmKk~K??G@_@"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/attr.tst:1491 # Input is: ChromaticNumber(gr); # Expected output: 4 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1493 # Input is: gr := CycleDigraph(7); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1495 # Input is: ChromaticNumber(gr); # Expected output: 3 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1497 # Input is: gr := CycleDigraph(71); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1499 # Input is: ChromaticNumber(gr); # Expected output: 3 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1501 # Input is: gr := CycleDigraph(1001); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1503 # Input is: ChromaticNumber(gr); # Expected output: 3 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1505 # Input is: a := DigraphRemoveEdges(CompleteDigraph(50), [[1, 2], [2, 1]]);; # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/attr.tst:1506 # Input is: b := DigraphAddVertex(a);; # Expected output: # But found: Error, Variable: 'DigraphAddVertex' must have a value ######## ########> Diff in standard/attr.tst:1507 # Input is: ChromaticNumber(a); # Expected output: 49 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1509 # Input is: ChromaticNumber(b); # Expected output: 49 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/attr.tst:1513 # Input is: gr := Digraph([[2, 3, 4], [2, 5], [1, 5, 4], [1], [1, 1, 2, 4]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1514 # Input is: DegreeMatrix(gr); # Expected output: [ [ 3, 0, 0, 0, 0 ], [ 0, 2, 0, 0, 0 ], [ 0, 0, 3, 0, 0 ], [ 0, 0, 0, 1, 0 ], [ 0, 0, 0, 0, 4 ] ] # But found: Error, Variable: 'DegreeMatrix' must have a value ######## ########> Diff in standard/attr.tst:1517 # Input is: DegreeMatrix(Digraph([])); # Expected output: [ ] # But found: Error, Variable: 'DegreeMatrix' must have a value ######## ########> Diff in standard/attr.tst:1519 # Input is: DegreeMatrix(Digraph([[]])); # Expected output: [ [ 0 ] ] # But found: Error, Variable: 'DegreeMatrix' must have a value ######## ########> Diff in standard/attr.tst:1521 # Input is: DegreeMatrix(Digraph([[1]])); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DegreeMatrix' must have a value ######## ########> Diff in standard/attr.tst:1525 # Input is: gr := Digraph([[2, 3, 4], [2, 5], [1, 5, 4], [1], [1, 1, 2, 4]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1526 # Input is: LaplacianMatrix(gr); # Expected output: [ [ 3, -1, -1, -1, 0 ], [ 0, 1, 0, 0, -1 ], [ -1, 0, 3, -1, -1 ], [ -1, 0, 0, 1, 0 ], [ -2, -1, 0, -1, 4 ] ] # But found: Error, Variable: 'LaplacianMatrix' must have a value ######## ########> Diff in standard/attr.tst:1529 # Input is: LaplacianMatrix(Digraph([])); # Expected output: [ ] # But found: Error, Variable: 'LaplacianMatrix' must have a value ######## ########> Diff in standard/attr.tst:1531 # Input is: LaplacianMatrix(Digraph([[1]])); # Expected output: [ [ 0 ] ] # But found: Error, Variable: 'LaplacianMatrix' must have a value ######## ########> Diff in standard/attr.tst:1533 # Input is: LaplacianMatrix(CycleDigraph(5)); # Expected output: [ [ 1, -1, 0, 0, 0 ], [ 0, 1, -1, 0, 0 ], [ 0, 0, 1, -1, 0 ], [ 0, 0, 0, 1, -1 ], [ -1, 0, 0, 0, 1 ] ] # But found: Error, Variable: 'LaplacianMatrix' must have a value ######## ########> Diff in standard/attr.tst:1536 # Input is: LaplacianMatrix(CompleteDigraph(5)); # Expected output: [ [ 4, -1, -1, -1, -1 ], [ -1, 4, -1, -1, -1 ], [ -1, -1, 4, -1, -1 ], [ -1, -1, -1, 4, -1 ], [ -1, -1, -1, -1, 4 ] ] # But found: Error, Variable: 'LaplacianMatrix' must have a value ######## ########> Diff in standard/attr.tst:1541 # Input is: NrSpanningTrees(CompleteDigraph(5)); # Expected output: 125 # But found: Error, Variable: 'NrSpanningTrees' must have a value ######## ########> Diff in standard/attr.tst:1543 # Input is: NrSpanningTrees(CycleDigraph(5)); # Expected output: Error, the argument must be a symmetric digraph, # But found: Error, Variable: 'NrSpanningTrees' must have a value ######## ########> Diff in standard/attr.tst:1545 # Input is: NrSpanningTrees(DigraphSymmetricClosure(CycleDigraph(5))); # Expected output: 5 # But found: Error, Variable: 'NrSpanningTrees' must have a value ######## ########> Diff in standard/attr.tst:1547 # Input is: NrSpanningTrees(Digraph([])); # Expected output: 0 # But found: Error, Variable: 'NrSpanningTrees' must have a value ######## ########> Diff in standard/attr.tst:1549 # Input is: NrSpanningTrees(Digraph([[1]])); # Expected output: 1 # But found: Error, Variable: 'NrSpanningTrees' must have a value ######## ########> Diff in standard/attr.tst:1551 # Input is: NrSpanningTrees(Digraph([[2, 3, 4], [1, 5], [1, 5], [1, 5], [2, 3, 4]])); # Expected output: 12 # But found: Error, Variable: 'NrSpanningTrees' must have a value ######## ########> Diff in standard/attr.tst:1555 # Input is: gr := EmptyDigraph(0); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1557 # Input is: tree := UndirectedSpanningTree(gr); # Expected output: fail # But found: Error, Variable: 'UndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1559 # Input is: forest := UndirectedSpanningForest(gr); # Expected output: fail # But found: Error, Variable: 'UndirectedSpanningForest' must have a value ######## ########> Diff in standard/attr.tst:1561 # Input is: UndirectedSpanningForest(EmptyDigraph(IsMutableDigraph, 0)); # Expected output: fail # But found: Error, Variable: 'UndirectedSpanningForest' must have a value ######## ########> Diff in standard/attr.tst:1563 # Input is: gr := EmptyDigraph(1); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1565 # Input is: tree := UndirectedSpanningTree(gr); # Expected output: # But found: Error, Variable: 'UndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1567 # Input is: forest := UndirectedSpanningForest(gr); # Expected output: # But found: Error, Variable: 'UndirectedSpanningForest' must have a value ######## ########> Diff in standard/attr.tst:1569 # Input is: IsUndirectedSpanningTree(gr, gr); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1571 # Input is: IsUndirectedSpanningTree(gr, forest); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1573 # Input is: gr = forest; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/attr.tst:1575 # Input is: gr := EmptyDigraph(2); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1577 # Input is: tree := UndirectedSpanningTree(gr); # Expected output: fail # But found: Error, Variable: 'UndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1579 # Input is: forest := UndirectedSpanningForest(gr); # Expected output: # But found: Error, Variable: 'UndirectedSpanningForest' must have a value ######## ########> Diff in standard/attr.tst:1581 # Input is: IsUndirectedTree(forest); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/attr.tst:1583 # Input is: IsUndirectedSpanningForest(gr, forest); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningForest' must have a value ######## ########> Diff in standard/attr.tst:1585 # Input is: gr = forest; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/attr.tst:1587 # Input is: gr := DigraphFromDigraph6String("&IG@qqW?HO?BSQGA?CG"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/attr.tst:1589 # Input is: IsStronglyConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/attr.tst:1591 # Input is: UndirectedSpanningTree(gr); # Expected output: fail # But found: Error, Variable: 'UndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1593 # Input is: UndirectedSpanningTree(gr); # Expected output: fail # But found: Error, Variable: 'UndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1595 # Input is: DigraphEdges(UndirectedSpanningForest(gr)); # Expected output: [ [ 2, 7 ], [ 7, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/attr.tst:1597 # Input is: DigraphEdges(UndirectedSpanningForest(gr)); # Expected output: [ [ 2, 7 ], [ 7, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/attr.tst:1599 # Input is: IsUndirectedSpanningForest(gr, UndirectedSpanningForest(gr)); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningForest' must have a value ######## ########> Diff in standard/attr.tst:1601 # Input is: D := DigraphFromDigraph6String("&I~~~~^Znn~|~~x^|v{"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/attr.tst:1603 # Input is: tree := UndirectedSpanningTree(D); # Expected output: # But found: Error, Variable: 'UndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1605 # Input is: IsUndirectedSpanningTree(D, tree); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1607 # Input is: tree := UndirectedSpanningTree(DigraphMutableCopy(D)); # Expected output: # But found: Error, Variable: 'UndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1609 # Input is: IsUndirectedSpanningTree(D, tree); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/attr.tst:1613 # Input is: ArticulationPoints(CycleDigraph(5)); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1615 # Input is: ArticulationPoints(Digraph([[2, 7], [3, 5], [4], [2], [6], [1], []])); # Expected output: [ 2, 1 ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1617 # Input is: ArticulationPoints(ChainDigraph(5)); # Expected output: [ 4, 3, 2 ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1619 # Input is: ArticulationPoints(NullDigraph(5)); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1621 # Input is: gr := Digraph([[35, 55, 87], [38], [6, 53], [], [66], [56], [36], [] , [], [19], [23], [], [40, 76], [72, 79], [46, 48], [22, 68], [ 26], [17, 60], [17], [42], [34, 91], [68, 87], [14, 46], [23, 80 ], [6, 8], [], [], [], [], [], [28, 35], [], [18, 40, 94], [], [ 27, 44, 78], [], [25], [71], [72], [2, 33], [87], [], [42], [ ], [43], [63], [], [58, 89], [68, 97], [24, 40], [13], [9], [ 44], [80], [], [40], [78], [9], [], [35, 44, 57], [], [], [67, 74, 81], [], [86], [], [54, 93], [66, 79], [], [], [], [], [100 ], [19], [62, 68], [87], [4, 15, 89], [61, 86], [], [41], [21, 41], [59, 64], [], [53], [59], [14, 33], [], [], [37, 71, 92], [ 3, 20], [56], [56], [], [89], [], [1, 14, 38, 85], [], [19], [ 30], [56, 98]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1635 # Input is: IsConnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/attr.tst:1637 # Input is: ArticulationPoints(gr); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1639 # Input is: gr := DigraphCopy(gr); # Expected output: # But found: Error, Variable: 'DigraphCopy' must have a value ######## ########> Diff in standard/attr.tst:1641 # Input is: ArticulationPoints(gr); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1643 # Input is: IsConnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/attr.tst:1645 # Input is: ArticulationPoints(Digraph([[1, 2], [2]])); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1647 # Input is: gr := Digraph([[1, 1, 2, 2, 2, 2, 2], [2, 2, 3, 3], []]); # path # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1649 # Input is: ArticulationPoints(gr); # Expected output: [ 2 ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1651 # Input is: gr := Digraph([[1, 1, 2, 2, 2, 2, 2], [2, 2, 3, 3], [1, 1, 1]]); # cycle # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1653 # Input is: ArticulationPoints(gr); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1655 # Input is: gr := Digraph([[2], [3], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1657 # Input is: ArticulationPoints(gr); # Expected output: [ 3, 2 ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1659 # Input is: IsConnectedDigraph(DigraphRemoveVertex(gr, 3)); # Expected output: false # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/attr.tst:1661 # Input is: IsConnectedDigraph(DigraphRemoveVertex(gr, 2)); # Expected output: false # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/attr.tst:1663 # Input is: IsConnectedDigraph(DigraphRemoveVertex(gr, 1)); # Expected output: true # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/attr.tst:1665 # Input is: IsConnectedDigraph(DigraphRemoveVertex(gr, 4)); # Expected output: true # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/attr.tst:1667 # Input is: ArticulationPoints(Digraph([])); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1669 # Input is: ArticulationPoints(Digraph([[]])); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1671 # Input is: ArticulationPoints(Digraph([[1]])); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1673 # Input is: ArticulationPoints(Digraph([[1, 1]])); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1675 # Input is: ArticulationPoints(Digraph([[1], [2]])); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1677 # Input is: ArticulationPoints(Digraph([[2], [1]])); # Expected output: [ ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1679 # Input is: ArticulationPoints(DigraphFromGraph6String("FlCX?")); # Expected output: [ 3, 4 ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1681 # Input is: ArticulationPoints(Digraph([[2, 4, 5], [1, 4], [4, 7], [1, 2, 3, 5, 6, 7], [1, 4], [4, 7], [3, 4, 6]])); # Expected output: [ 4 ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1684 # Input is: gr := DigraphFromSparse6String( ":~?@V`OINBg_McouHAxQD@gyYEW}Q_@_YdgE`?OgZgpEbfYQKDGqiDQEI`wGdjoADGZG\ FIJONFQSplq]y@IwvbPKhMh}JGK?OLzW{agKKfRCtarqTGayQGb]rMIurapkxPG?RGcI]\ IBtB_`EQKJ@LmxlL_?k^QieOkB|T"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/attr.tst:1689 # Input is: Set(ArticulationPoints(gr)); # Expected output: [ 1, 3, 8, 11, 12, 15, 17, 18, 19, 21, 23, 27, 30, 36, 37, 41, 42, 46, 51, 52, 59, 60, 61, 63, 66, 68, 69, 73, 75, 76, 79, 84, 87 ] # But found: Error, Variable: 'ArticulationPoints' must have a value ######## ########> Diff in standard/attr.tst:1692 # Input is: IsDuplicateFree(last); # Expected output: true # But found: false ######## ########> Diff in standard/attr.tst:1694 # Input is: ForAll(ArticulationPoints(gr), x -> not IsConnectedDigraph(DigraphRemoveVertex(gr, x))); # Expected output: true # But found: Error, Variable: 'ArticulationPoints' must have a value Syntax warning: Unbound global variable in stream:2 x -> not IsConnectedDigraph(DigraphRemoveVertex(gr, x))); ^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> not IsConnectedDigraph(DigraphRemoveVertex(gr, x))); ^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> not IsConnectedDigraph(DigraphRemoveVertex(gr, x))); ^^ ######## ########> Diff in standard/attr.tst:1697 # Input is: Set(ArticulationPoints(gr)) = Filtered(DigraphVertices(gr), x -> not IsConnectedDigraph(DigraphRemoveVertex(gr, x))); # Expected output: true # But found: Error, Variable: 'ArticulationPoints' must have a value Syntax warning: Unbound global variable in stream:3 x -> not IsConnectedDigraph(DigraphRemoveVertex(gr, x))); ^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:3 x -> not IsConnectedDigraph(DigraphRemoveVertex(gr, x))); ^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:3 x -> not IsConnectedDigraph(DigraphRemoveVertex(gr, x))); ^^ ######## ########> Diff in standard/attr.tst:1703 # Input is: g := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1705 # Input is: HamiltonianPath(g); # Expected output: [ ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1707 # Input is: g := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1709 # Input is: HamiltonianPath(g); # Expected output: [ 1 ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1711 # Input is: g := Digraph([[], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1713 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1715 # Input is: g := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1717 # Input is: HamiltonianPath(g); # Expected output: [ 1 ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1719 # Input is: g := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1721 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1723 # Input is: g := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1725 # Input is: HamiltonianPath(g); # Expected output: [ 1, 2 ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1727 # Input is: g := Digraph([[3], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1729 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1731 # Input is: g := Digraph([[3], [3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1733 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1735 # Input is: g := Digraph([[3], [], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1737 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1739 # Input is: g := Digraph([[2], [3], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1741 # Input is: HamiltonianPath(g); # Expected output: [ 1, 2, 3 ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1743 # Input is: g := Digraph([[2], [3], [1], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1745 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1747 # Input is: g := Digraph([[2], [3], [1, 4], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1749 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1751 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1753 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1755 # Input is: g := Digraph([[3, 6], [4, 1], [2, 1], [5, 1], [3], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1757 # Input is: HamiltonianPath(g); # Expected output: [ 1, 6, 4, 5, 3, 2 ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1759 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4, 7], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1761 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1763 # Input is: g := Digraph([[3, 6, 7], [4, 1], [2, 1], [5, 1], [3], [4, 7], [6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1765 # Input is: HamiltonianPath(g); # Expected output: [ 1, 7, 6, 4, 5, 3, 2 ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1767 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4, 7], [6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1769 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1771 # Input is: g := Digraph([[5, 6, 10], [2, 9], [3, 7], [2, 3], [9, 10], [2, 9], [1], [2, 3, 4, 7, 9], [3, 10], [4, 5, 6, 8]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1774 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1776 # Input is: g := Digraph([[2, 4, 6, 10], [1, 3, 4, 5, 6, 7, 9, 10], [1, 5, 7, 8], [6, 10], [1, 7], [3, 4, 6, 7, 9], [2, 3, 4, 7], [2, 4, 5, 6], [2, 3, 5, 6, 7, 9, 10], [2, 3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1780 # Input is: HamiltonianPath(g); # Expected output: [ 1, 4, 6, 9, 10, 3, 8, 5, 7, 2 ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1782 # Input is: IsDigraphMonomorphism(CycleDigraph(10), g, Transformation(HamiltonianPath(g))); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/attr.tst:1786 # Input is: g := CompleteMultipartiteDigraph([1, 30]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/attr.tst:1788 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1790 # Input is: g := Digraph([[2, 5, 6], [3, 1, 7], [4, 2, 8], [5, 3, 9], [1, 4, 10], [1, 8, 9], [2, 9, 10], [3, 10, 6], [4, 6, 7], [5, 7, 8]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1793 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1795 # Input is: g := CompleteMultipartiteDigraph([16, 15]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/attr.tst:1797 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1799 # Input is: g := CompleteMultipartiteDigraph([1, 15, 1, 1, 1, 1, 1, 1]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/attr.tst:1801 # Input is: HamiltonianPath(g); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1803 # Input is: g := CycleDigraph(100); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1805 # Input is: HamiltonianPath(g); # Expected output: [ 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76 ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1812 # Input is: g := CycleDigraph(513); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1814 # Input is: g := DigraphAddEdges(g, [[6, 8], [8, 7], [7, 9]]); # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/attr.tst:1816 # Input is: g := DigraphRemoveEdge(g, [6, 7]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/attr.tst:1818 # Input is: HamiltonianPath(g); # Expected output: [ 1, 2, 3, 4, 5, 6, 8, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 1 ] # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1852 # Input is: gr := DigraphAddEdges(DigraphAddVertex(CycleDigraph(600)), [[600, 601], [601, 600]]); # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/attr.tst:1855 # Input is: HamiltonianPath(gr); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/attr.tst:1859 # Input is: D := Digraph([[3, 6], [1], [4], [5, 7], [1], [2, 7], [4, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1861 # Input is: DigraphCore(D); # Expected output: [ 1, 3, 4, 6, 7 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1863 # Input is: D := Digraph([[2, 3], [1, 3], [1, 2, 4], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1865 # Input is: DigraphCore(D); # Expected output: [ 1, 2, 3 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1867 # Input is: DigraphHomomorphism(D, InducedSubdigraph(D, DigraphCore(D))); # Expected output: Transformation( [ 1, 3, 2, 3 ] ) # But found: Error, Variable: 'DigraphHomomorphism' must have a value ######## ########> Diff in standard/attr.tst:1869 # Input is: D := CompleteDigraph(10); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:1871 # Input is: DigraphCore(D); # Expected output: [ 1 .. 10 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1873 # Input is: D := Digraph([[2], [3], [4], [5], [6], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1875 # Input is: DigraphCore(D); # Expected output: [ 2, 3, 4, 5, 6 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1877 # Input is: D := Digraph([[2], [1], [4, 5], [5], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1879 # Input is: DigraphCore(D); # Expected output: [ 3, 4, 5 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1881 # Input is: D := EmptyDigraph(0); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1883 # Input is: DigraphCore(D); # Expected output: [ ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1885 # Input is: D := EmptyDigraph(1000); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1887 # Input is: DigraphCore(D); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1889 # Input is: D := EmptyDigraph(IsMutableDigraph, 0); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/attr.tst:1891 # Input is: for i in [2 .. 15] do DigraphDisjointUnion(D, CycleDigraph(i)); od; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have an assigned value ######## ########> Diff in standard/attr.tst:1894 # Input is: DigraphCore(D); # Expected output: [ 1, 2, 3, 4, 5, 10, 11, 12, 13, 14, 21, 22, 23, 24, 25, 26, 27, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1898 # Input is: D1 := DigraphFromDigraph6String("&FJBWqNbXV?"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/attr.tst:1900 # Input is: IsDigraphCore(D1); # Expected output: true # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1902 # Input is: D2 := DigraphFromDigraph6String("&FJbWqNbWu?"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/attr.tst:1904 # Input is: IsDigraphCore(D2); # Expected output: true # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1906 # Input is: M1 := DigraphMycielskian(D1); # Expected output: # But found: Error, Variable: 'DigraphMycielskian' must have a value ######## ########> Diff in standard/attr.tst:1908 # Input is: IsDigraphCore(M1); # Expected output: true # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1910 # Input is: D := DigraphDisjointUnion(D1, D2, M1); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/attr.tst:1912 # Input is: DigraphCore(D); # Expected output: [ 8 .. 29 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1914 # Input is: IsDigraphCore(InducedSubdigraph(D, DigraphCore(D))); # Expected output: true # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1918 # Input is: D := DigraphFromDiSparse6String(str); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:1920 # Input is: DigraphCore(D); # Expected output: [ 1, 2, 4, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 25, 26, 29, 30, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1923 # Input is: D := Digraph([[2, 8], [3], [1], [5], [6], [7], [4], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1925 # Input is: DigraphCore(D); # Expected output: [ 1 .. 7 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1927 # Input is: D := Digraph([[], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1929 # Input is: DigraphCore(D); # Expected output: [ 2 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1931 # Input is: D := DigraphDisjointUnion(EmptyDigraph(1), CompleteBipartiteDigraph(3, 3)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/attr.tst:1933 # Input is: DigraphCore(D); # Expected output: [ 2, 5 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1935 # Input is: D := DigraphFromDigraph6String("&IO?_@?A?CG??O?_G??"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/attr.tst:1937 # Input is: DigraphCore(D); # Expected output: [ 7, 8, 9 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1939 # Input is: D := CycleDigraph(IsMutableDigraph, 2); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:1941 # Input is: for i in [1 .. 9] do DigraphDisjointUnion(D, D); od; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have an assigned value ######## ########> Diff in standard/attr.tst:1944 # Input is: DigraphCore(D); # Expected output: [ 1, 2 ] # But found: Error, Variable: 'DigraphCore' must have a value ######## ########> Diff in standard/attr.tst:1948 # Input is: MaximalAntiSymmetricSubdigraph(Digraph([[2, 2], [1]])); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1950 # Input is: MaximalAntiSymmetricSubdigraph(Digraph(IsMutableDigraph, [[2, 2], [1]])); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1952 # Input is: D := Digraph(IsMutableDigraph, [[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1954 # Input is: MaximalAntiSymmetricSubdigraph(D) = D; # Expected output: true # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1956 # Input is: MaximalAntiSymmetricSubdigraph(NullDigraph(0)); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1958 # Input is: IsAntisymmetricDigraph(DigraphCopy(last)); # Expected output: true # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1960 # Input is: MaximalAntiSymmetricSubdigraph(NullDigraph(1)); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1962 # Input is: IsAntisymmetricDigraph(DigraphCopy(last)); # Expected output: true # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1964 # Input is: MaximalAntiSymmetricSubdigraph(CompleteDigraph(1)); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1966 # Input is: IsAntisymmetricDigraph(DigraphCopy(last)); # Expected output: true # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1968 # Input is: MaximalAntiSymmetricSubdigraph(CompleteBipartiteDigraph(2, 30000)); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1970 # Input is: IsAntisymmetricDigraph(DigraphCopy(last)); # Expected output: true # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:1972 # Input is: MaximalAntiSymmetricSubdigraph(Digraph([[1, 1, 2, 2], []])); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1974 # Input is: OutNeighbours(last); # Expected output: [ [ 1, 2 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:1976 # Input is: MaximalAntiSymmetricSubdigraph(CompleteDigraph(10)); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1978 # Input is: D := CompleteDigraph(10); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:1980 # Input is: MaximalAntiSymmetricSubdigraph(D); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1982 # Input is: MaximalAntiSymmetricSubdigraph(D); # Expected output: # But found: Error, Variable: 'MaximalAntiSymmetricSubdigraph' must have a value ######## ########> Diff in standard/attr.tst:1986 # Input is: gr := Digraph([ [2, 2, 2], [1, 3, 6, 8, 9, 10], [4, 6, 8], [1, 2, 3, 9], [3, 3], [3, 5, 6, 10], [1, 2, 7], [1, 2, 3, 10, 5, 6, 10], [1, 3, 4, 5, 8, 10], [2, 3, 4, 6, 7, 10]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:1992 # Input is: CharacteristicPolynomial(gr); # Expected output: x_1^10-3*x_1^9-7*x_1^8-x_1^7+14*x_1^6+x_1^5-26*x_1^4+51*x_1^3-10*x_1^2+18*x_1-\ \ 30 # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/attr.tst:1995 # Input is: gr := CompleteDigraph(5); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/attr.tst:1997 # Input is: CharacteristicPolynomial(gr); # Expected output: x_1^5-10*x_1^3-20*x_1^2-15*x_1-4 # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/attr.tst:2001 # Input is: IsVertexTransitive(Digraph([])); # Expected output: true # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/attr.tst:2003 # Input is: IsVertexTransitive(Digraph([[1], [2]])); # Expected output: true # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/attr.tst:2005 # Input is: IsVertexTransitive(Digraph([[2], [3], []])); # Expected output: false # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/attr.tst:2007 # Input is: IsVertexTransitive(CompleteDigraph(20)); # Expected output: true # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/attr.tst:2011 # Input is: IsEdgeTransitive(Digraph([])); # Expected output: true # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/attr.tst:2013 # Input is: IsEdgeTransitive(Digraph([[1], [2]])); # Expected output: true # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/attr.tst:2015 # Input is: IsEdgeTransitive(Digraph([[2], [3], []])); # Expected output: false # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/attr.tst:2017 # Input is: IsEdgeTransitive(CompleteDigraph(20)); # Expected output: true # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/attr.tst:2019 # Input is: IsEdgeTransitive(Digraph([[2], [3, 3, 3], []])); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/attr.tst:2023 # Input is: D := NullDigraph(IsMutableDigraph, 3); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/attr.tst:2025 # Input is: AsGraph(D); # Expected output: rec( adjacencies := [ [ ], [ ], [ ] ], group := Group(()), isGraph := true, names := [ 1 .. 3 ], order := 3, representatives := [ 1, 2, 3 ], schreierVector := [ -1, -2, -3 ] ) # But found: Error, Variable: 'AsGraph' must have a value ######## ########> Diff in standard/attr.tst:2031 # Input is: D := NullDigraph(IsMutableDigraph, 3); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/attr.tst:2033 # Input is: DigraphSource(D); # Expected output: [ ] # But found: Error, Variable: 'DigraphSource' must have a value ######## ########> Diff in standard/attr.tst:2035 # Input is: DigraphRange(D); # Expected output: [ ] # But found: Error, Variable: 'DigraphRange' must have a value ######## ########> Diff in standard/attr.tst:2037 # Input is: DigraphSymmetricClosure(NullDigraph(IsMutableDigraph, 1)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:2039 # Input is: D := Digraph([[2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2041 # Input is: DigraphSymmetricClosure(D); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:2043 # Input is: DigraphSymmetricClosure(D); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/attr.tst:2045 # Input is: D := Digraph(IsMutableDigraph, [[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2047 # Input is: DigraphTransitiveClosure(D); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:2049 # Input is: DigraphReflexiveTransitiveClosure(D); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:2051 # Input is: MakeImmutable(D); # Expected output: # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/attr.tst:2053 # Input is: DigraphTransitiveClosure(D); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:2055 # Input is: D := Digraph([[2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2057 # Input is: DigraphTransitiveClosure(D); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:2059 # Input is: DigraphTransitiveClosure(D); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:2061 # Input is: DigraphReflexiveTransitiveClosure(D); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:2063 # Input is: DigraphReflexiveTransitiveClosure(D); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:2065 # Input is: D := DigraphMutableCopy(DigraphSymmetricClosure(D)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/attr.tst:2067 # Input is: MaximalSymmetricSubdigraphWithoutLoops(D); # Expected output: # But found: Error, Variable: 'MaximalSymmetricSubdigraphWithoutLoops' must have a value ######## ########> Diff in standard/attr.tst:2069 # Input is: MaximalSymmetricSubdigraphWithoutLoops(MakeImmutable(D)); # Expected output: # But found: Error, Variable: 'MaximalSymmetricSubdigraphWithoutLoops' must have a value ######## ########> Diff in standard/attr.tst:2071 # Input is: MaximalSymmetricSubdigraphWithoutLoops(D); # Expected output: # But found: Error, Variable: 'MaximalSymmetricSubdigraphWithoutLoops' must have a value ######## ########> Diff in standard/attr.tst:2073 # Input is: D := CycleDigraph(IsMutableDigraph, 10); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/attr.tst:2075 # Input is: UndirectedSpanningForest(D); # Expected output: # But found: Error, Variable: 'UndirectedSpanningForest' must have a value ######## ########> Diff in standard/attr.tst:2081 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2083 # Input is: DigraphTransitiveReduction(gr); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2085 # Input is: DigraphReflexiveTransitiveReduction(gr); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphReflexiveTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2087 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2089 # Input is: DigraphTransitiveReduction(gr); # Expected output: Error, not yet implemented for non-topologically sortable digraphs, # But found: Error, Variable: 'DigraphTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2091 # Input is: DigraphReflexiveTransitiveReduction(gr); # Expected output: Error, not yet implemented for non-topologically sortable digraphs, # But found: Error, Variable: 'DigraphReflexiveTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2095 # Input is: gr1 := ChainDigraph(6); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/attr.tst:2097 # Input is: gr2 := DigraphReflexiveTransitiveClosure(gr1); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:2099 # Input is: DigraphTransitiveReduction(gr2) = gr1; # trans reduction contains loops # Expected output: false # But found: Error, Variable: 'DigraphTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2101 # Input is: DigraphReflexiveTransitiveReduction(gr2) = gr1; # ref trans reduct doesnt # Expected output: true # But found: Error, Variable: 'DigraphReflexiveTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2103 # Input is: gr3 := DigraphAddEdge(gr1, [3, 3]); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/attr.tst:2105 # Input is: DigraphHasLoops(gr3); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/attr.tst:2107 # Input is: gr4 := DigraphTransitiveClosure(gr3); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/attr.tst:2109 # Input is: gr2 = gr4; # Expected output: false # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/attr.tst:2111 # Input is: DigraphReflexiveTransitiveReduction(gr4) = gr1; # Expected output: true # But found: Error, Variable: 'DigraphReflexiveTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2113 # Input is: DigraphReflexiveTransitiveReduction(gr4) = gr3; # Expected output: false # But found: Error, Variable: 'DigraphReflexiveTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2115 # Input is: DigraphTransitiveReduction(gr4) = gr3; # Expected output: true # But found: Error, Variable: 'DigraphTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2119 # Input is: DigraphTransitiveReduction(EmptyDigraph(0)) = EmptyDigraph(0); # Expected output: true # But found: Error, Variable: 'DigraphTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2121 # Input is: DigraphReflexiveTransitiveReduction(EmptyDigraph(0)) = EmptyDigraph(0); # Expected output: true # But found: Error, Variable: 'DigraphReflexiveTransitiveReduction' must have a value ######## ########> Diff in standard/attr.tst:2125 # Input is: gr := DigraphFromDigraph6String("&DHUEe_"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/attr.tst:2127 # Input is: rgr := DigraphReverse(gr); # Expected output: # But found: Error, Variable: 'DigraphReverse' must have a value ######## ########> Diff in standard/attr.tst:2129 # Input is: OutNeighbours(rgr); # Expected output: [ [ 2, 3, 4 ], [ 4, 5 ], [ 1, 2, 5 ], [ 4 ], [ 2, 5 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/attr.tst:2131 # Input is: gr = DigraphReverse(rgr); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/attr.tst:2133 # Input is: gr := Digraph(rec(DigraphNrVertices := 5, DigraphSource := [1, 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 5, 5, 5], DigraphRange := [1, 3, 1, 2, 2, 4, 5, 4, 1, 3, 5, 1, 1, 3])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2137 # Input is: e := DigraphEdges(gr); # Expected output: [ [ 1, 1 ], [ 1, 3 ], [ 2, 1 ], [ 2, 2 ], [ 2, 2 ], [ 2, 4 ], [ 2, 5 ], [ 3, 4 ], [ 4, 1 ], [ 4, 3 ], [ 4, 5 ], [ 5, 1 ], [ 5, 1 ], [ 5, 3 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/attr.tst:2140 # Input is: rev := DigraphReverse(gr); # Expected output: # But found: Error, Variable: 'DigraphReverse' must have a value ######## ########> Diff in standard/attr.tst:2142 # Input is: erev := DigraphEdges(rev);; # Expected output: # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/attr.tst:2143 # Input is: temp := List(erev, x -> [x[2], x[1]]);; # Expected output: # But found: Error, Variable: 'erev' must have a value ######## ########> Diff in standard/attr.tst:2144 # Input is: Sort(temp); # Expected output: # But found: Error, Variable: 'temp' must have a value ######## ########> Diff in standard/attr.tst:2145 # Input is: e = temp; # Expected output: true # But found: Error, Variable: 'e' must have a value ######## ########> Diff in standard/attr.tst:2147 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2149 # Input is: IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:2151 # Input is: DigraphReverse(gr) = gr; # Expected output: true # But found: Error, Variable: 'DigraphReverse' must have a value ######## ########> Diff in standard/attr.tst:2153 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2155 # Input is: SetIsSymmetricDigraph(gr, true); # Expected output: # But found: Error, Variable: 'SetIsSymmetricDigraph' must have a value ######## ########> Diff in standard/attr.tst:2156 # Input is: gr = DigraphReverse(gr); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/attr.tst:2158 # Input is: DigraphReverse(Digraph(IsMutableDigraph, [[2], [1]])) = CompleteDigraph(2); # Expected output: true # But found: Error, Variable: 'DigraphReverse' must have a value ######## ########> Diff in standard/attr.tst:2162 # Input is: D := DigraphCartesianProduct(ChainDigraph(3), CycleDigraph(4), Digraph([[2], [2]]));; # Expected output: # But found: Error, Variable: 'DigraphCartesianProduct' must have a value ######## ########> Diff in standard/attr.tst:2164 # Input is: HasDigraphCartesianProductProjections(D); # Expected output: true # But found: Error, Variable: 'HasDigraphCartesianProductProjections' must have a value ######## ########> Diff in standard/attr.tst:2166 # Input is: proj := DigraphCartesianProductProjections(D);; Length(proj); # Expected output: 3 # But found: Error, Variable: 'DigraphCartesianProductProjections' must have a value Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2168 # Input is: IsIdempotent(proj[2]); # Expected output: true # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2170 # Input is: RankOfTransformation(proj[3]); # Expected output: 2 # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2172 # Input is: S := ImageSetOfTransformation(proj[2]);; # Expected output: # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2173 # Input is: IsIsomorphicDigraph(CycleDigraph(4), InducedSubdigraph(D, S)); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/attr.tst:2175 # Input is: G := DigraphRemoveLoops(RandomDigraph(12));; # Expected output: # But found: Error, Variable: 'DigraphRemoveLoops' must have a value ######## ########> Diff in standard/attr.tst:2176 # Input is: H := DigraphRemoveLoops(RandomDigraph(50));; # Expected output: # But found: Error, Variable: 'DigraphRemoveLoops' must have a value ######## ########> Diff in standard/attr.tst:2177 # Input is: D := DigraphCartesianProduct(G, H);; # Expected output: # But found: Error, Variable: 'DigraphCartesianProduct' must have a value ######## ########> Diff in standard/attr.tst:2178 # Input is: proj := DigraphCartesianProductProjections(D);; # Expected output: # But found: Error, Variable: 'DigraphCartesianProductProjections' must have a value ######## ########> Diff in standard/attr.tst:2179 # Input is: IsIdempotent(proj[1]); # Expected output: true # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2181 # Input is: RankOfTransformation(proj[2]); # Expected output: 50 # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2183 # Input is: S := ImageSetOfTransformation(proj[2]);; # Expected output: # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2184 # Input is: IsIsomorphicDigraph(H, InducedSubdigraph(D, S)); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/attr.tst:2188 # Input is: D := DigraphDirectProduct(ChainDigraph(3), CycleDigraph(4), Digraph([[2], [2]]));; # Expected output: # But found: Error, Variable: 'DigraphDirectProduct' must have a value ######## ########> Diff in standard/attr.tst:2190 # Input is: HasDigraphDirectProductProjections(D); # Expected output: true # But found: Error, Variable: 'HasDigraphDirectProductProjections' must have a value ######## ########> Diff in standard/attr.tst:2192 # Input is: proj := DigraphDirectProductProjections(D);; Length(proj); # Expected output: 3 # But found: Error, Variable: 'DigraphDirectProductProjections' must have a value Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2194 # Input is: IsIdempotent(proj[2]); # Expected output: true # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2196 # Input is: RankOfTransformation(proj[3]); # Expected output: 2 # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2198 # Input is: P := DigraphRemoveAllMultipleEdges(ReducedDigraph(OnDigraphs(D, proj[2])));; # Expected output: # But found: Error, Variable: 'DigraphRemoveAllMultipleEdges' must have a value ######## ########> Diff in standard/attr.tst:2199 # Input is: IsIsomorphicDigraph(CycleDigraph(4), P); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/attr.tst:2201 # Input is: G := RandomDigraph(12);; # Expected output: # But found: Error, Variable: 'RandomDigraph' must have a value ######## ########> Diff in standard/attr.tst:2202 # Input is: H := RandomDigraph(50);; # Expected output: # But found: Error, Variable: 'RandomDigraph' must have a value ######## ########> Diff in standard/attr.tst:2203 # Input is: D := DigraphDirectProduct(G, H);; # Expected output: # But found: Error, Variable: 'DigraphDirectProduct' must have a value ######## ########> Diff in standard/attr.tst:2204 # Input is: proj := DigraphDirectProductProjections(D);; # Expected output: # But found: Error, Variable: 'DigraphDirectProductProjections' must have a value ######## ########> Diff in standard/attr.tst:2205 # Input is: IsIdempotent(proj[1]); # Expected output: true # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2207 # Input is: RankOfTransformation(proj[2]); # Expected output: 50 # But found: Error, Variable: 'proj' must have a value ######## ########> Diff in standard/attr.tst:2209 # Input is: P := DigraphRemoveAllMultipleEdges(ReducedDigraph(OnDigraphs(D, proj[2])));; # Expected output: # But found: Error, Variable: 'DigraphRemoveAllMultipleEdges' must have a value ######## ########> Diff in standard/attr.tst:2210 # Input is: IsIsomorphicDigraph(H, P); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/attr.tst:2214 # Input is: D := DigraphFromDigraph6String("&Sq_MN|bDCLy~Xj}u}GxOLlGfqJtnSQ|l\ Q?lYvjbqN~XNNAQYDJE[UHOhyGOqtsjCWJy["); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/attr.tst:2217 # Input is: M := DigraphMaximalMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximalMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2219 # Input is: D := DigraphFromDigraph6String(IsMutable, "&Sq_MN|bDCLy~Xj}u}GxOLlGfqJtnSQ|l\ Q?lYvjbqN~XNNAQYDJE[UHOhyGOqtsjCWJy["); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/attr.tst:2222 # Input is: M := DigraphMaximalMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximalMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2224 # Input is: D := Digraph(IsMutable, [[2], [3], [4], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2226 # Input is: M := DigraphMaximalMatching(D);; # Expected output: # But found: Error, Variable: 'DigraphMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2227 # Input is: M = [[1, 2], [3, 4]] or M = [[2, 3], [4, 1]]; # Expected output: true # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2229 # Input is: D; # Expected output: # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/attr.tst:2233 # Input is: D := DigraphFromDiSparse6String(".]cBn@kqAlt?EpclQp|M}bAgFjHkoDsIuACyCM_Hj"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:2235 # Input is: M := DigraphMaximumMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximumMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2237 # Input is: Length(M); # Expected output: 14 # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2239 # Input is: D := Digraph([[5, 6, 7, 8], [6, 7, 8], [7, 8], [8], [], [], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2241 # Input is: DigraphMaximumMatching(D); # Expected output: [ [ 1, 5 ], [ 2, 6 ], [ 3, 7 ], [ 4, 8 ] ] # But found: Error, Variable: 'DigraphMaximumMatching' must have a value ######## ########> Diff in standard/attr.tst:2243 # Input is: D := Digraph(IsMutable, [[2, 3], [1, 4], [2, 4], [5], [3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/attr.tst:2245 # Input is: M := DigraphMaximumMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximumMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2247 # Input is: Length(M); # Expected output: 3 # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2249 # Input is: D := DigraphFromDiSparse6String("\ .~?B]zsE?cB?kH?cK?{M?{O?SIaWHaoQ_{X??@?wJ@gT`{[BKF@s^BG[_OOAca?{@@gXB_^bK?A\ gXbGc_gF@o\\dGG`gXC[X`K__OC?oG@GI@wOAGQAWSAoWBOZBo_CGgDGkDk?BGd_wMBgfdsFC{Q\ Ao]CGmdsJBGbC_ebGdD{ZDsXCgnEsC?oHAWkDsFbK@BGb`?PDsD?wfcGmE[Fb?ZD?mEWsE{LBGb\ DSmEW~aOmE[XB_^C[XbKmEW~G[gDp@_x?dop_wfdosGKWDp@dsJBGt`wYDopFHJH{FA{F_waG@I\ I[OC?mbGtdsUDor`?IAG_DGmFhVbWgDovGHH_GXBwbFcFCwqdpVJKXG{XGx]_wVISC?omFKXF[X\ CkFCP?IXSaOmEXCbGtIsXGs?BGddpP_xS_wKAwfIP_dpVJH\\_?TBGdDWnEowFXEGx]JxaKXfLC\ mEHJIKUDorJCFL[XDXfLkWDosGHLHpY`GkDox`WXEhOIsmEW~dorFxtbGjLhpcGmEW~MkA?_E@?\ H@ONA?PAWSBO_DGkDgmEGxFhJHxPIhVJH\\KHhL`mM[A@?IA?PA__DGlDo|IhVJH\\L`x_WF`wY\ DpPNKQAo]DorFxCJ@dL{IAGmJHkNHydopHxPNKUDorNkgDp@JS?BGdL@lbGeEk@@WLBG[BwbC_e\ DOtF`AGhOIpZKplMaBcGmEW~c?lDpxNSFdorFxBHCFL[mIHhNKmFHx_wfEP[aOUB?ZBo`D?mEWs\ Ew~GHBG`GHHLHpWJPdLxqMhuN@xNi?OIDPCSC?mNHybGbDPDOcFNYFbGbOaN_waIcF_wyQ[FLYH\ do|JHxNSFHPSLSmEW~OiLbOmIHhLpxPSF@`jaWmFHx__E@GNAWYD_mEGxHXNIH`LHmMXxNP{NyI\ PYXR[XChbLkXCgnKXlRkmGHMMQLdo|JHxNQUaWmFHxPY[dp@JQLbWmEx@HHYPkmFHxPY[SKFAxj\ PITdp@HhqPi^a?_DpTNHydp@JQLSSXEhUKqC_WFFQS_yFQCB?waFP?HPRI`cLPzOyOQQRQaVTQj\ dp@JQLSQbTCD?wK@oVBgfE?qFpKIP[K@jMAHPaTRQdTcFCxKJam_xSLQVTc_DgmNHyOsmGHMMQL\ dorNi?PkXCotOYCbHEKPfLk]DorNi?PkgDp@HHYPkFCw}HamT{FQYkdorFyDPiWdosGHLMQL_WF\ NYkdp@JQ@PkRDoxNIZRcAC?lDpxNSmGHqPi^SsWDp@MQLbGzJpaLkXC_tKqCagXChl_?TBGdLjC\ cGmEW~NALbGcEiCW[FIXSKak_WFFPSNYFQARQaiTYkVI{_gFCwoFqmb?mGHqPj@dp@JQ@Pi|a__\ DpTNHyPsmHxPNH~RcmEW~GXtMqLbGdDWzGpFJp^KPfLhpMytWSXCYCPyP_waIaQTcFLXoQimdor\ Ni?Pir_yRTaxXKF@`jRQm_x?HPSTc??GB?gF@WK@gMAgVBG[Bg^CObC_dCofDOjDonE?qEguF?y\ FW{Fp?GPDGpFHPKI@QIXSIpZJ`]Jx_KPbK`eKxgLPjLhoMHsMxzOQBOaFPIKPyOQIQQYSQiVRQ\\ \RqdTIiTYkTqnUAsUiwVI{WRBWbDWzGXJIYBPYRRYjUY{GDGmJHxNSAC?mNHyV{mGHMMQLUS]Do\ rNiLUsFLXoTrRYrW");; # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:2273 # Input is: M := DigraphMaximumMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximumMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2275 # Input is: Length(M); # Expected output: 111 # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2295 # Input is: M = M1; # Expected output: true # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2297 # Input is: D := DigraphFromDiSparse6String("\ .~?@}~ggEb?eM@X?@_?CC@OWIAowO_PEPdOOPcX_HBHaPDgWICW[GAOoLE@e?@`ESbp]PfG_[cP\ M?@_gMCPk\\_OOJC@CQDPWYd@yHB@_[`pqPD`gdcQA[IH_XFHCUEaShapCd_?SEA_wPCpk\\GAK\ cHQiPJwMPHQeGFAE^frQPCqKn_OOJCPSUEaShJQwq__MA?o[GAOoLBpCSDp_XF@w^GQGeHq_jJB\ CrLBSwfrOtMWSMCQ}@CPGdfBePDaShKb]PCq{u_?SEA_wPEpscJrm]MW{^MXCdIRGvNgCPCaS{`\ os[IAkxNXCiJrAFFA_xPXCRGAgnKCYPGAgnQGOJCPSdIQwv_@C\\HA|?_PCdNCQA?pwpMBe@C@C\ db`CnOGCPHWCPHSPK_rCxRWs[IBc|PX[^MW_[GbeSFbd@`@CTHQwvQgkPHQwvQgGBBpOVF@w^Hb\ CsLR_xMcDARTHSTgCOCQTMbp{sMSHXdp{xTDe@CQTO_b_xRTeDB`CnMsA^MTPXVGGBD@w^HbCwM\ SDLSdXXVg_WFACaKrdTaP_XFAoxcPKnNx[^MTd[a?cKE@c[GQGfJBKxPTTaWwCOCQTCRd@YVWs[\ MSTRdp{xUTpdfbd@Tdd`fACrMUHeb`CnOC|^bp{sLRcyOddZVHCRJr|cfrdSUTp_b`CnOC|kcQ{\ oPca@CQTMSDtffBc|PTMPCqKnLhCRGAKiJr?uNs@EQCdcZfDsd@weMTd`_PCQHRpC`pogMSTF_P\ CdPCpPfA_jMSULFBdDSuaFFA_jMSTyfBc|PTLr]~");; # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:2309 # Input is: M := DigraphMaximumMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximumMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2311 # Input is: Length(M); # Expected output: 63 # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2323 # Input is: M = M1; # Expected output: true # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2325 # Input is: D := DigraphFromDiSparse6String("\ .~?BG`WHawSbOT_wJbwYcOOcgCCS`d?SBkj?gedo_`sp?OOdSuCCC?o^bS[cwgdD?A[wdC}gofF\ [FGLJA_\\GhIi?uio_j?RF[bH|OaGyjgjjwOFdAHXYdhMbSQIDdE`KKTf?PalGh__jIKYHXPe@H\ gD]kLfdXcekPA`pmoSfslG[[n_CCGx_gpGd~CGdDhfic}IKBAhPbS@?XJJpnbogGHdg\\_kXslS\ aHeKJKaeXphhqk@pqOODABe[fKHgqoTfCKEPOrOSFxEHHqNQKr`qd@|cTc`YSqMb@G]CsRptl`h\ LSc@G`QrSZSS@?G~h`hPKD@X@GpTTLiMifSyjc@[NYUmq@PAOp[D?o]bG\\Gq[T|uiMvCq]Ryjv\ H^LUbchZKejUsoRC]mqga`}RaocpHH`wNczJ@WPY]hHPJ|DKa@OqHUK@DhMNYbij@axmQr@xCJ@\ KP@sVAcYAkA?wJboOcOOcgabSgBkjCsmCCMCkP_Sieo__cCb_ifWggGwdC}gofF[FGLJBhDHSMh\ oMi?uiONHSCH|U@w_fcocXNfhOaLBjwCAD`Dk~ILOkhKKTf?PSKThDLPbSoHKPGD]m@fkctaGUM\ LYmoSC{}LklG\\{CGxnw`K|SfsBAmCBp]L{gGHd_@BJ{jKDbg@bLSaHXKpgafS@BpijxpqOADAB\ eWycxHKHgNeUAmW@_qI@YhCSFxEHHqr`^MSgN@|cOokeSqMb@?WBoeaXHptl`hLSc@GdkRSZfxw\ pIc_gJGHEIiblHiMijc@CN[_OIGQCNOYJuWXBhERancXuuy^nSZCxis[VChZK`ddijvo]H@YLYV\ dPuaaohHKNCzJ@WKY]w`DOIH_GHDhzS\\TTlmQv");; # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:2338 # Input is: M := DigraphMaximumMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximumMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2340 # Input is: Length(M); # Expected output: 96 # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2342 # Input is: D := DigraphFromDiSparse6String("\ .~?BZ_O?__B_SF?CE_kC_[A@[M@KP?sDACC@{M_OL`cJ`OV`GU`?T_{EA[DASCAKB_O]_GMBk?@\ g[b[JBSIBKHBCGA{FC{TCsDAcCAWc_WQ_OP_G`_?_`sL`_\\`W[D{IDsHBOl`?XDcFB?ja{U__g\ _WSC{AAWe_GQCgy_?PC_xa?w`waE{MCGuekKB{JBor`O\\ESH`?ZdxE_oXDpDb?lGcVD`B_WUDX\ A_OTDSSDH?_?RDCfFsPCo|cg{c_z`obFPR`gaFHQ`_wIK_ExO`O^H{HEhM`?\\Ecr_oZESDBOpH\ SCBGob?nHCVDpF_GUDhE_?TGh_a_jJ{idHAJkPD@@JcOCx?J[NCo~JSMFsLJCb`WaIsICGyIk_F\ HS`?wI[FBovL{uIKDB_tLkCBWsHxk_WYHpjhk@EHKLK?AwoHXgdxIK{THLdaWkGxcaOjK[PDPDK\ SODHCKKgGX_cxAJx}`geGL{`[ICXZ`GaJPx`?`NC_JC^FPVMsDBoxIpt__wIhs_W[ExrbWu_GY_\ ?XIKWEXOL{VEPNLqNaopHplPsTLaLa_nHaKaWmH[lHPhPSPPKODXfPCNDPFKshGpdOsgGhc`_fG\ aCgXaO[ICh`OScKCGCX?Jy?_waF{ECH\\NsDC?|J`|SCCBw{JX{R{BBozJQ]bhXNQ\\fHWNI[_?\ ZF@VNAZexUMyYbGuIhuRKWEhSMiWawsIXsQ{UIPrQsTEPPMQTa_pMIShyRaOnHpnaGmLqPdhKLi\ O`wkHXkP{MDXILYMU[LDPHLShHAp`WgGxgUCfPQn`GeGhePImchCPAlc`BKaFTcECXbOt@KQDTS\ CCH?KIhc?~KABTCAFp^OQf_G]Fh]Ss?Bg{OAdbacfPZNqbfHYNiajI`b@zSCVNREehUNI]WkTIh\ wWcSI`vRbBaWqIXuRZAaOpIPtRR@aGoIHsWCnI@rRA~dpNMQV`olHppQq|`gkHhoQi{`_jH`nV[\ JDPJLqRVSIDHILiQVKHD@HLcfQAvcpFPyu_pELIM_hDUfZ__B_o@_CE`WB_OJ_GI_CG_{EaWC_[\ A@k@@c?@[V`GUakFAcEaSCAKBACA@{@Bk?@g[`_Z`[I`GW`CFAof_oT_gd_cQC[AAGa_GOCK?@w\ _b{]`_\\ECJB_n`OZDsHBOl`?XDcFBCEAwi_gUDKTDCSf[@AOd_?Pa?bFCNCOvcGu`g_EkKBws`\ W]`O\\ESHB_pbWo_wYDxE_om_glGcCAwkG[BD[AAgiGK@GCRF{QFsPCsOCkNC_zfPR`gaFHQ`_`\ F@P`W_ExOepNbotHssHkFB`K_oqH\\IbHH_WWDxG_OVG{@Aold`DKCjGcRGX]aPAJkPGKOG@Z`w\ eF{MCg}JKLC_|JCKF`VcOz`O`FPT`G_IcGBww_wvIPn_o\\EpPLsDB`OLkZHxk_WrHpj_OXEPib\ C?H[UHSmKsSDhGKkRD`caPEaHDKSODHCKKND@BKCMNt]NkKCh?JkcFx[N[ICW}JXy`GaFhYNKGF\ `X_w_FXWM{EBwyIxu_g]FHUbhTMcBB_vI`r_OZEpRMS@BOtIPpbGsIHob?rI@nawqHxmaopHsTE\ @LLcSDxKLYKaXJLQJaOlHQIaGkHHgdXGK{NDQF`ohGqE`ggKaD`_fK[JCpa`OdGP`OSHC`@OKGJ\ {FCO~Jp~cG}Jh}fh[Ni___^JX{R{]FXYN[AFPX_G[FI[_?ZF@VR[YExUM{XEpTRKtIaWawsIYVa\ oragqQkpI@paWoHxoQ[QDxMLyQaGmHhmQKODhKLkND`JLaN`ojLYr`giHILUSKDHhPap`XFLAJ`\ OfGpfPQncpDKsGKiG_xBKaFTdAKYET[DCPa__`G@`Oah_W_KAg_O^JyAS{]Fi@Ss?F`\\OC[FX[\ NycbXZNqbbOxNkXF@{SKWExWSCuIxyR{UIpxWksIi\\WcrI`vRbBaXuRZAaPQMkPIIXa?nIAW`w\ mHxqQy}dhMMIUVkLD`LQkjH`nQdJQ[IDHlVKHD@HLaPVCGCxGL[FCpiUsEChELIMUkDC`DLALUf\ ");; # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:2371 # Input is: M := DigraphMaximumMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximumMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2373 # Input is: Length(M); # Expected output: 109 # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2375 # Input is: D := DigraphFromDiSparse6String("\ .~?B]`?C`OFc?B`kbBcd@cf@si@sXeWDCswCczE{|A{~?wGgGRgWeF|E?tJBs_DtP??HC?le_xi\ `DipFj?kctZEozd\\LkGNGdbDT\\kxAh|BlWdlgHlwME[CapkcpAm_ompin?JeD{DD]ap[jeAAO\ kDpcOK@FX\\KxsN{SooKA}GE?zK[@G@Mp_@?x?fqA`?~GeO?gOA?kk{^B|CIMT?xWcpyP}ZE[TI\ [Ps@QNdyc@}R[He@^mLYh|xc`gNtpQ[XCgxGi^tgnNIgnMoBimbXHhYAep\\Lq\\uoYQ[YNUE_I\ YiDFf@zNsoG]~BPLc}EwW{OcSTUIoB@s|lV[NAG~skIFPA`PedGiIAOu[ByP[LyKpL\\lJGivJi\ xePSzJ{}H`zPAmuAoap]_HxYN]`gJbOTc?BcgKcKMbsjBKm?[r?kyDoqe{~?wG@|@A\\BF|KCCh\ iG?DlS?wXGlUAXF`czIDYBCzkGNGdbDT\\e\\fGTNlWdlgHgcA@omE[Yapkm_`mpi`wUnHHkD|J\ sUJeADpc_GWKxsN|XnCap?[E@H_MK?x?fpD`?fF{FB{DADfbw^geT?xNJEN`MXCU[AgUs@QOTyc\ AP`KoK\\_gdN_HxNLgmKXCgxGi^tgCJHxTEoBimhKDOSuJhmRk]M}uBPfQ[YNUE_IYvXFf@zNso\ G]~BPLc}ER|wocSPQiwq?x@lV[NAIrskyGQ|kshGhOxxFyHDNaTj`ny`\\lJGf@UcDVfX^fpKN\\ \qUD]nJP");; # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:2387 # Input is: M := DigraphMaximumMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximumMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2389 # Input is: Length(M); # Expected output: 97 # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2391 # Input is: D := DigraphFromDiSparse6String("\ .~?B]_O?__B_S@`?E_kC_[A@[I_?H`CF_sD_cB@sA`c?@[IA{Y@CFAcE_gQ__Pc?A@{@BkLBcKB\ [J`SW`?VasEAge_gSCkC_WQC[AAGa_GOCK?CCp@g]eCJD{IBWm`Gl`?XDcwAwi_gUDKTDCBA_fa\ WeF[QCgy_?PCcOC[NCSMCK_`_^EcJBor`Oq`G[EKG_wn_om_gWDkCAwkG[BApA_OTDP@_GSDH?_\ ?RD?~cw}aGeFkO`wcF[MCWy`hQ`_w`W_E{IBxNbotHsGBhL_w[E[EBXJ_gYEHI__XECBB?nHCAA\ xFdhE_?TD`DKCSDXCJ{RDPBdHAJkPD@@JcOG@Z`{MCg}`gcFhW`_bF`V`WaF[y`KGBwwI[]ExQL\ {EBhPLsDEhO__ZE`NLcrHpj_OX_GWEHKLKVE@JLCnHPfdpHa_lH@dd`FKdbaGiKShG``dCMCxAJ\ {LCp|`_dJh{`W~J`z`ObFpZNSHCPx`?`F`X_w_J@vbwyIxuboxIptf@T_W[Exr_OZEpRMSYEhQM\ K?IHob?rI@nhyNhsoHhkPljPcmHXiP[QDhILIIaHHLAHhCiGxedHEKiE`ggGhcOlCKYCgXaO[IC\ hAKIA`GcKA@`?bG@^cP]_o`Fp\\_g|J`|SCCBw{JX{R{BNY]_O\\FPyRk@B_xNK?NAZbQYbKWEh\ SMkVE`RQ{UEXQQsqIHqQkSEHOMISaWoHxoQ[nHpnaHLLqPa?lHaO`xJLaNdXjPqr`hHLQLh@hPa\ p`WgLCICxfT{HGiHTsGChCKiGTkFC`BKak_obGPbT[aGHaOii__`G@`TKBC?~KABTC}JyAS{@Bo\ |Jq@_?{OAdb_zJ`~ScZFP}S[YFH|SSXF@XNa`exWNY_awuI{UIpxRrDe`TNBCa_rI`vRcRIXuRZ\ AaOpIPtWKPE@sRKODxOMYWV|NMQ}`olHqUVkkHhoQi{`_jH`nV[JDPJLsIDHlQQx`HHLaPVFWGx\ i_odGqMUkcLALUcbG`fPar_WaGXeURZgPdPQpZV]_O?__B_o@_CE_kK@[@@S?`CP?sDACC@{B@s\ A@k@@c?@[I`GU`?T_wS_oR_k^?WO_ONBs@@s?`cJBSIBKH`CFAof_oTCsDCkRCcBC[AAGa_K?@w\ _`o^bsKBgobcm`GY`?XDcFB?j_oVDSUDKCDCBC{AAWeF[@AOdFS?AGcFKOFCv`o`EsLC?t`_^Ec\ JE[\\b_p`?ZECYDxE_oXGkWDhC__kG[jGSAAgiGK@A_hGC?AWgaOffkOCg{c_zi[aFHQ`_`F@Pc\ @ObwuH{HBot`?sHlK_oZEPJbOpHTH_WnHCAAwm_GUDhEd`DKCSG`^dPBJsQDHAJkPD@@JcfG@Z`\ weFxY`odJKcFhW``V`WzIsICHT`G_FHS`?wI[FBovIPnbguIHmb_tLkCBWs_WYL[XEPLLS@B@KL\ K?AxJaonK{TKslKkRDcQDXEK[PDPDKSO`xBKCfGP^NsLCp@JsKG@\\NcJC_~J`z`ObFsHCO|JPx\ `?{JHw_w_F[EBxVMsDBoxIpt__\\IhsexSM\\R_GtISXE`oeXnawqHxmaopLiMahka_nH`jPcRH\ YJaOlPSPDcODXGKyG`wiGxeO{MGpdOtDKcKCxCOcJCpachAgH_OL^OCFCO~N{`Fp}_g_Fh|SCCF\ a^_W]FXYNY]bgyJLWRc?BWwIxwR[YExUMyYepTMqXb@SRCVE`RMcUIPrQsTEPPMSSe@NMARaPnQ\ SPDpLLqPdhKLiO`wkLcMHSLDPiUSKDHGPcJD@FLAJUCICxEKyIT{HCpeTsGChd_wcGYFTcEGPbO\ qj_gaGHaOii__`GACTKBC?~O[ABx^OS@Bp]OIe_?\\Ji?Sk[FX[NycbWyJ[YFHYNiaf@XNa`b?v\ JA_epVNQ^WstRrDagsIi\\WcrRbBePRMqZaOpRR@aHPMaXWCnMYWV{NDpNMQVVsMDhpVkLD`LMA\ TVcKHaSV[JDPmQYy`OhHPlVKHD@kQKGCxGLYOU{FCpFLQNUsEGphPsDC`DPkCKyKU[BPYqZ[ACH\ APRY");; # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/attr.tst:2420 # Input is: M := DigraphMaximumMatching(D);; IsMaximalMatching(D, M); # Expected output: true # But found: Error, Variable: 'DigraphMaximumMatching' must have a value Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/attr.tst:2422 # Input is: Length(M); # Expected output: 111 # But found: Error, Variable: 'M' must have a value ######## ########> Diff in standard/attr.tst:2458 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/attr.tst msecs: 1153 false gap> ########> Diff in standard/cliques.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/cliques.tst:17 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/cliques.tst:18 # Input is: IsClique(gr, [6]); # Expected output: Error, the 2nd argument must be a duplicate-free list of vertices of \ \ the digraph that is the 1st argument, # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:21 # Input is: IsClique(gr, []); # Expected output: true # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:23 # Input is: IsClique(gr, [4]); # Expected output: true # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:25 # Input is: IsClique(gr, [4, 3]); # Expected output: true # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:27 # Input is: IsClique(gr, [4, 1, 3]); # Expected output: true # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:29 # Input is: IsClique(gr, [4, 2, 3, 1]); # Expected output: true # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:31 # Input is: IsClique(gr, [1, 5, 3, 4, 2]); # Expected output: true # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:33 # Input is: IsClique(gr, [1, 1]); # Expected output: Error, the 2nd argument must be a duplicate-free list of vertices of \ \ the digraph that is the 1st argument, # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:36 # Input is: gr := Digraph([ [2, 3, 4, 5, 7, 8, 11, 12], [1, 3, 4, 6, 7, 9, 11, 13], [1, 2, 5, 6, 8, 9, 12, 13], [1, 2, 5, 6, 7, 10, 11, 14], [1, 3, 4, 6, 8, 10, 12, 14], [2, 3, 4, 5, 9, 10, 13, 14], [1, 2, 4, 8, 9, 10, 11, 15], [1, 3, 5, 7, 9, 10, 12, 15], [2, 3, 6, 7, 8, 10, 13, 15], [4, 5, 6, 7, 8, 9, 14, 15], [1, 2, 4, 7, 12, 13, 14, 15], [1, 3, 5, 8, 11, 13, 14, 15], [2, 3, 6, 9, 11, 12, 14, 15], [4, 5, 6, 10, 11, 12, 13, 15], [7, 8, 9, 10, 11, 12, 13, 14]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/cliques.tst:46 # Input is: IsClique(gr, [1, 2, 4, 7, 11]); # Expected output: true # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:48 # Input is: IsClique(gr, [1, 2, 3]); # Expected output: true # But found: Error, Variable: 'IsClique' must have a value ######## ########> Diff in standard/cliques.tst:50 # Input is: gr := Digraph([ [2, 3, 4, 5, 7, 8, 11, 12], [1, 3, 4, 6, 7, 9, 11, 13], [1, 2, 5, 6, 8, 9, 12, 13], [1, 2, 5, 6, 7, 10, 11, 14], [1, 3, 4, 6, 8, 10, 12, 14], [2, 3, 4, 5, 9, 10, 13, 14], [1, 2, 4, 8, 9, 10, 11, 15], [1, 3, 5, 7, 9, 10, 12, 15], [2, 3, 6, 7, 8, 10, 13, 15], [4, 5, 6, 7, 8, 9, 14, 15], [1, 2, 4, 7, 12, 13, 14, 15], [1, 3, 5, 8, 11, 13, 14, 15], [2, 3, 6, 9, 11, 12, 14, 15], [4, 5, 6, 10, 11, 12, 13, 15], [7, 8, 9, 10, 11, 12, 13, 14]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/cliques.tst:60 # Input is: IsMaximalClique(gr, [1, 2, 4, 7, 11]); # Expected output: true # But found: Error, Variable: 'IsMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:62 # Input is: IsMaximalClique(gr, [1, 2, 3]); # Expected output: true # But found: Error, Variable: 'IsMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:64 # Input is: IsMaximalClique(gr, [16]); # Expected output: Error, the 2nd argument must be a duplicate-free list of vertices of \ \ the digraph that is the 1st argument, # But found: Error, Variable: 'IsMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:67 # Input is: IsMaximalClique(gr, [1, 1]); # Expected output: Error, the 2nd argument must be a duplicate-free list of vertices of \ \ the digraph that is the 1st argument, # But found: Error, Variable: 'IsMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:70 # Input is: IsMaximalClique(gr, [1, 2, 4, 7, 11, 13]); # Expected output: false # But found: Error, Variable: 'IsMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:72 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/cliques.tst:73 # Input is: IsMaximalClique(gr, [1]); # Expected output: false # But found: Error, Variable: 'IsMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:77 # Input is: gr := CycleDigraph(10);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/cliques.tst:78 # Input is: IsIndependentSet(gr, []); # Expected output: true # But found: Error, Variable: 'IsIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:80 # Input is: IsIndependentSet(gr, [1, 1]); # Expected output: Error, the 2nd argument must be a duplicate-free list of vertices of th\ \ e digraph that is the 1st argument, # But found: Error, Variable: 'IsIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:83 # Input is: IsIndependentSet(gr, [11]); # Expected output: Error, the 2nd argument must be a duplicate-free list of vertices of th\ \ e digraph that is the 1st argument, # But found: Error, Variable: 'IsIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:86 # Input is: IsIndependentSet(gr, [1, 2]); # Expected output: false # But found: Error, Variable: 'IsIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:88 # Input is: IsIndependentSet(gr, [1, 3]); # Expected output: true # But found: Error, Variable: 'IsIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:90 # Input is: IsMaximalIndependentSet(gr, []); # Expected output: false # But found: Error, Variable: 'IsMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:92 # Input is: IsMaximalIndependentSet(gr, [1, 2]); # Expected output: false # But found: Error, Variable: 'IsMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:94 # Input is: IsMaximalIndependentSet(gr, [1, 3]); # Expected output: false # But found: Error, Variable: 'IsMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:96 # Input is: gr := Digraph([[], [], [], [1, 2, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/cliques.tst:98 # Input is: IsIndependentSet(gr, [1, 2]); # Expected output: true # But found: Error, Variable: 'IsIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:100 # Input is: IsMaximalIndependentSet(gr, [1, 2]); # Expected output: false # But found: Error, Variable: 'IsMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:102 # Input is: IsIndependentSet(gr, [1, 2, 3]); # Expected output: true # But found: Error, Variable: 'IsIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:104 # Input is: IsMaximalIndependentSet(gr, [1, 2, 3]); # Expected output: true # But found: Error, Variable: 'IsMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:106 # Input is: gr := Digraph([[3], [3], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/cliques.tst:108 # Input is: IsMaximalIndependentSet(gr, [1, 2]); # Expected output: true # But found: Error, Variable: 'IsMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:112 # Input is: gr := Digraph([[3], [3], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/cliques.tst:114 # Input is: DigraphMaximalIndependentSet(); # Expected output: Error, at least 1 argument is required, # But found: Error, Variable: 'DigraphMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:116 # Input is: DigraphMaximalIndependentSet(3); # Expected output: Error, the 1st argument must be a digraph, # But found: Error, Variable: 'DigraphMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:118 # Input is: DigraphIndependentSet(); # Expected output: Error, at least 1 argument is required, # But found: Error, Variable: 'DigraphIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:120 # Input is: DigraphIndependentSet(3); # Expected output: Error, the 1st argument must be a digraph, # But found: Error, Variable: 'DigraphIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:122 # Input is: DigraphMaximalIndependentSet(gr); # Expected output: [ 3 ] # But found: Error, Variable: 'DigraphMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:124 # Input is: DigraphIndependentSet(gr); # Expected output: [ 3 ] # But found: Error, Variable: 'DigraphIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:126 # Input is: DigraphMaximalIndependentSet(gr, [], [], 2); # Expected output: [ 1, 2 ] # But found: Error, Variable: 'DigraphMaximalIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:128 # Input is: DigraphIndependentSet(gr, [], [], 3); # Expected output: fail # But found: Error, Variable: 'DigraphIndependentSet' must have a value ######## ########> Diff in standard/cliques.tst:132 # Input is: gr := EmptyDigraph(1);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/cliques.tst:133 # Input is: DigraphMaximalIndependentSetsReps(); # Expected output: Error, at least 1 argument is required, # But found: Error, Variable: 'DigraphMaximalIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:135 # Input is: DigraphIndependentSetsReps(); # Expected output: Error, at least 1 argument is required, # But found: Error, Variable: 'DigraphIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:137 # Input is: DigraphMaximalIndependentSets(); # Expected output: Error, at least 1 argument is required, # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:139 # Input is: DigraphIndependentSets(); # Expected output: Error, at least 1 argument is required, # But found: Error, Variable: 'DigraphIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:141 # Input is: DigraphMaximalIndependentSetsReps(1); # Expected output: Error, the 1st argument must be a digraph, # But found: Error, Variable: 'DigraphMaximalIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:143 # Input is: DigraphIndependentSetsReps(1); # Expected output: Error, the 1st argument must be a digraph, # But found: Error, Variable: 'DigraphIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:145 # Input is: DigraphMaximalIndependentSets(1); # Expected output: Error, the 1st argument must be a digraph, # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:147 # Input is: DigraphIndependentSets(1); # Expected output: Error, the 1st argument must be a digraph, # But found: Error, Variable: 'DigraphIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:149 # Input is: DigraphMaximalIndependentSetsReps(gr); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:151 # Input is: DigraphMaximalIndependentSetsReps(gr); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:153 # Input is: DigraphIndependentSetsReps(gr); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:155 # Input is: DigraphMaximalIndependentSets(gr); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:157 # Input is: DigraphIndependentSets(gr); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:159 # Input is: DigraphMaximalIndependentSetsReps(gr, []); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:161 # Input is: DigraphIndependentSetsReps(gr, []); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:163 # Input is: DigraphMaximalIndependentSets(gr, []); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:165 # Input is: DigraphIndependentSets(gr, []); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:167 # Input is: DigraphMaximalIndependentSetsReps(gr, [], []); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:169 # Input is: DigraphIndependentSetsReps(gr, [], []); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:171 # Input is: DigraphMaximalIndependentSets(gr, [], []); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:173 # Input is: DigraphIndependentSets(gr, [], []); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:175 # Input is: DigraphMaximalIndependentSetsReps(gr, [], [], 1); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:177 # Input is: DigraphIndependentSetsReps(gr, [], [], 1); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:179 # Input is: DigraphMaximalIndependentSets(gr, [], [], 1); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:181 # Input is: DigraphIndependentSets(gr, [], [], 1); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:183 # Input is: DigraphMaximalIndependentSetsReps(gr, [], [], 1, 1); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:185 # Input is: DigraphIndependentSetsReps(gr, [], [], 1, 1); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:187 # Input is: DigraphMaximalIndependentSets(gr, [], [], 1, 1); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:189 # Input is: DigraphIndependentSets(gr, [], [], 1, 1); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:191 # Input is: gr := CompleteDigraph(10);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/cliques.tst:192 # Input is: DigraphMaximalIndependentSetsRepsAttr(gr); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSetsRepsAttr' must have a value ######## ########> Diff in standard/cliques.tst:194 # Input is: DigraphMaximalIndependentSetsAttr(gr); # Expected output: [ [ 1 ], [ 2 ], [ 3 ], [ 4 ], [ 5 ], [ 6 ], [ 7 ], [ 8 ], [ 9 ], [ 10 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSetsAttr' must have a value ######## ########> Diff in standard/cliques.tst:198 # Input is: gr := ChainDigraph(2);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/cliques.tst:199 # Input is: DigraphMaximalIndependentSets(gr); # Expected output: [ [ 1 ], [ 2 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:201 # Input is: gr := CompleteDigraph(2);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/cliques.tst:202 # Input is: DigraphMaximalIndependentSets(gr); # Expected output: [ [ 1 ], [ 2 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:204 # Input is: gr := DigraphFromDigraph6String("&FWsK?WSKC?"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/cliques.tst:206 # Input is: DigraphMaximalIndependentSetsReps(gr); # Expected output: [ [ 1, 4 ], [ 1, 5 ], [ 2, 5, 7 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:208 # Input is: Set(DigraphMaximalIndependentSets(gr)); # Expected output: [ [ 1, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 4 ], [ 2, 5, 7 ], [ 2, 6, 7 ], [ 3, 4 ], [ 3, 5, 7 ], [ 3, 6, 7 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:211 # Input is: Set(DigraphMaximalIndependentSets(gr)); # Expected output: [ [ 1, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 4 ], [ 2, 5, 7 ], [ 2, 6, 7 ], [ 3, 4 ], [ 3, 5, 7 ], [ 3, 6, 7 ] ] # But found: Error, Variable: 'DigraphMaximalIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:214 # Input is: DigraphIndependentSetsReps(gr); # Expected output: [ [ 1 ], [ 1, 4 ], [ 1, 5 ], [ 2 ], [ 2, 5 ], [ 2, 5, 7 ], [ 2, 7 ], [ 7 ] ] # But found: Error, Variable: 'DigraphIndependentSetsReps' must have a value ######## ########> Diff in standard/cliques.tst:216 # Input is: Set(DigraphIndependentSets(gr)); # Expected output: [ [ 1 ], [ 1, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2 ], [ 2, 4 ], [ 2, 5 ], [ 2, 5, 7 ], [ 2, 6 ], [ 2, 6, 7 ], [ 2, 7 ], [ 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 5, 7 ], [ 3, 6 ], [ 3, 6, 7 ], [ 3, 7 ], [ 4 ], [ 5 ], [ 5, 7 ], [ 6 ], [ 6, 7 ], [ 7 ] ] # But found: Error, Variable: 'DigraphIndependentSets' must have a value ######## ########> Diff in standard/cliques.tst:223 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/cliques.tst:224 # Input is: DigraphMaximalClique(); # Expected output: Error, at least 1 argument is required, # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:226 # Input is: DigraphClique(); # Expected output: Error, at least 1 argument is required, # But found: Error, Variable: 'DigraphClique' must have a value ######## ########> Diff in standard/cliques.tst:228 # Input is: DigraphMaximalClique(1); # Expected output: Error, the 1st argument must be a digraph by out-neighbours, # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:230 # Input is: DigraphClique(1); # Expected output: Error, the 1st argument must be a digraph by out-neighbours, # But found: Error, Variable: 'DigraphClique' must have a value ######## ########> Diff in standard/cliques.tst:232 # Input is: DigraphMaximalClique(gr); # Expected output: [ 5, 4, 3, 2, 1 ] # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:234 # Input is: DigraphClique(gr); # Expected output: [ 5, 4, 3, 2, 1 ] # But found: Error, Variable: 'DigraphClique' must have a value ######## ########> Diff in standard/cliques.tst:236 # Input is: DigraphMaximalClique(gr, [1, 1]); # Expected output: Error, the optional 2nd argument must be a duplicate-free list of ve\ \ rtices of the digraph that is the 1st argument, # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:239 # Input is: DigraphMaximalClique(gr, [1], [1, 1]); # Expected output: Error, the optional 3rd argument must be a duplicate-free list of ve\ \ rtices of the digraph that is the 1st argument, # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:242 # Input is: DigraphMaximalClique(gr, [1], [1], 0); # Expected output: Error, the optional 4th argument must be a positive integer, # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:244 # Input is: gr := EmptyDigraph(5);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/cliques.tst:245 # Input is: DigraphMaximalClique(gr, [1, 2], [3]); # Expected output: fail # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:247 # Input is: DigraphMaximalClique(gr, [1, 2], [2]); # Expected output: fail # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:249 # Input is: DigraphMaximalClique(gr, [1, 2], [3]); # Expected output: fail # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:251 # Input is: DigraphMaximalClique(gr, [1], [2]); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:253 # Input is: DigraphClique(gr, [1], [1]); # Expected output: fail # But found: Error, Variable: 'DigraphClique' must have a value ######## ########> Diff in standard/cliques.tst:255 # Input is: DigraphMaximalClique(CompleteDigraph(5), [1, 2], [3]); # Expected output: fail # But found: Error, Variable: 'DigraphMaximalClique' must have a value ######## ########> Diff in standard/cliques.tst:257 # Input is: DigraphClique(CompleteDigraph(5), [1, 2], []); # Expected output: [ 1, 2, 5, 4, 3 ] # But found: Error, Variable: 'DigraphClique' must have a value ######## ########> Diff in standard/cliques.tst:261 # Input is: DigraphCliquesReps(); # Expected output: Error, there must be at least 1 argument, # But found: Error, Variable: 'DigraphCliquesReps' must have a value ######## ########> Diff in standard/cliques.tst:263 # Input is: DigraphCliques(); # Expected output: Error, there must be at least 1 argument, # But found: Error, Variable: 'DigraphCliques' must have a value ######## ########> Diff in standard/cliques.tst:265 # Input is: gr := EmptyDigraph(5);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/cliques.tst:266 # Input is: DigraphMaximalCliquesRepsAttr(gr); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesRepsAttr' must have a value ######## ########> Diff in standard/cliques.tst:268 # Input is: DigraphMaximalCliquesReps(); # Expected output: Error, there must be at least 1 argument, # But found: Error, Variable: 'DigraphMaximalCliquesReps' must have a value ######## ########> Diff in standard/cliques.tst:270 # Input is: DigraphMaximalCliquesReps(gr); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesReps' must have a value ######## ########> Diff in standard/cliques.tst:272 # Input is: DigraphMaximalCliquesAttr(gr); # Expected output: [ [ 1 ], [ 2 ], [ 3 ], [ 4 ], [ 5 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesAttr' must have a value ######## ########> Diff in standard/cliques.tst:274 # Input is: DigraphMaximalCliques(); # Expected output: Error, there must be at least 1 argument, # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:276 # Input is: DigraphMaximalCliques(gr); # Expected output: [ [ 1 ], [ 2 ], [ 3 ], [ 4 ], [ 5 ] ] # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:278 # Input is: gr := EmptyDigraph(1);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/cliques.tst:279 # Input is: DigraphMaximalCliques(gr); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:281 # Input is: gr := DigraphFromDigraph6String("&DNNNF?"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/cliques.tst:283 # Input is: DigraphMaximalCliquesReps(gr); # Expected output: [ [ 1, 3 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesReps' must have a value ######## ########> Diff in standard/cliques.tst:285 # Input is: Set(DigraphMaximalCliques(gr)); # Expected output: [ [ 1, 3 ], [ 1, 4 ], [ 2, 4 ], [ 2, 5 ], [ 3, 5 ] ] # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:287 # Input is: gr := DigraphFromGraph6String("N~~~~~~~wzmxufyZsvw"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/cliques.tst:289 # Input is: DigraphMaximalCliquesReps(gr); # Expected output: [ [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ], [ 1, 2, 3, 5, 8, 9, 14 ], [ 1, 2, 5, 13, 14 ], [ 1, 13, 14, 15 ], [ 11, 12, 13, 14, 15 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesReps' must have a value ######## ########> Diff in standard/cliques.tst:292 # Input is: gr := DigraphFromGraph6String( "X~~~~~~~~~~~~~~~~~wvaSD{iLzBU{JJ}B]^FQn|gq~~Gb~TjF~"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/cliques.tst:295 # Input is: DigraphMaximalCliquesReps(gr); # Expected output: [ [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 ], [ 1, 2, 3, 4, 5, 8, 12, 24 ], [ 2, 4, 12, 17, 24, 25 ], [ 4, 16, 17, 22, 23, 24, 25 ], [ 4, 7, 9, 16, 25 ], [ 3, 18, 19, 23, 24 ], [ 5, 16, 18, 22, 24 ], [ 16, 17, 18, 19, 20, 21, 22, 23, 24, 25 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesReps' must have a value ######## ########> Diff in standard/cliques.tst:302 # Input is: CliquesFinder(Group(()), fail, fail, fail, fail, fail, fail, fail, fail); # Expected output: Error, the 1st argument must be a digraph, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:304 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/cliques.tst:305 # Input is: CliquesFinder(gr, [], fail, fail, fail, fail, fail, fail, fail); # Expected output: Error, the 2nd argument must be fail, or a function with 2 arguments, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:308 # Input is: CliquesFinder(gr, f, fail, fail, fail, fail, fail, fail, fail); # Expected output: Error, the 2nd argument must be fail, or a function with 2 arguments, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:310 # Input is: CliquesFinder(gr, fail, fail, fail, fail, fail, fail, fail, fail); # Expected output: Error, when the 2nd argument is fail, the 3rd argument mus\ \ t be a list, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:314 # Input is: CliquesFinder(gr, f, fail, fail, fail, fail, fail, fail, fail); # Expected output: Error, the 4th argument must be infinity, or a positive integer, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:316 # Input is: CliquesFinder(gr, fail, [], infinity, fail, fail, fail, fail, fail); # Expected output: Error, the 5th argument and the 6th argument must be (poss\ \ ibly empty) duplicate-free lists of vertices of the 1st argument # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:319 # Input is: CliquesFinder(gr, fail, [], infinity, [0, 'a'], fail, fail, fail, fail); # Expected output: Error, the 5th argument and the 6th argument must be (poss\ \ ibly empty) duplicate-free lists of vertices of the 1st argument # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:322 # Input is: CliquesFinder(gr, fail, [], infinity, [0], fail, fail, fail, fail); # Expected output: Error, the 5th argument and the 6th argument must be (poss\ \ ibly empty) duplicate-free lists of vertices of the 1st argument # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:325 # Input is: CliquesFinder(gr, fail, [], infinity, [1, 1], fail, fail, fail, fail); # Expected output: Error, the 5th argument and the 6th argument must be (poss\ \ ibly empty) duplicate-free lists of vertices of the 1st argument # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:328 # Input is: CliquesFinder(gr, fail, [], infinity, [1], fail, fail, fail, fail); # Expected output: Error, the 5th argument and the 6th argument must be (poss\ \ ibly empty) duplicate-free lists of vertices of the 1st argument # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:331 # Input is: CliquesFinder(gr, fail, [], infinity, [1], [0, 'a'], fail, fail, fail); # Expected output: Error, the 5th argument and the 6th argument must be (poss\ \ ibly empty) duplicate-free lists of vertices of the 1st argument # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:334 # Input is: CliquesFinder(gr, fail, [], infinity, [1], [0], fail, fail, fail); # Expected output: Error, the 5th argument and the 6th argument must be (poss\ \ ibly empty) duplicate-free lists of vertices of the 1st argument # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:337 # Input is: CliquesFinder(gr, fail, [], infinity, [1], [1, 1], fail, fail, fail); # Expected output: Error, the 5th argument and the 6th argument must be (poss\ \ ibly empty) duplicate-free lists of vertices of the 1st argument # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:340 # Input is: CliquesFinder(gr, fail, [], infinity, [1], [1], fail, fail, fail); # Expected output: Error, the 7th argument must be true or false, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:342 # Input is: CliquesFinder(gr, fail, [], infinity, [1], [1], false, 0, fail); # Expected output: Error, the 8th argument must be fail, or a positive integer, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:344 # Input is: CliquesFinder(gr, fail, [], infinity, [1], [1], false, 1, fail); # Expected output: Error, the 9th argument must be true or false, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:346 # Input is: CliquesFinder(gr, fail, [], infinity, [1], [], false, 1, true); # Expected output: Error, if the 9th argument is true, then the 4th and 5th arguments and must be invariant under the action of the automorphism gro\ \ up of the maximal symmetric subdigraph without loops, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:350 # Input is: CliquesFinder(gr, fail, [], infinity, [], [1], false, 1, true); # Expected output: Error, if the 9th argument is true, then the 4th and 5th arguments and must be invariant under the action of the automorphism gro\ \ up of the maximal symmetric subdigraph without loops, # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:354 # Input is: CliquesFinder(gr, fail, [], infinity, [1 .. 5], [1 .. 5], false, 1, true); # Expected output: [ ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:356 # Input is: CliquesFinder(gr, fail, [], infinity, [1], [1], false, 1, false); # Expected output: [ ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:360 # Input is: gr := ChainDigraph(5);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/cliques.tst:361 # Input is: CliquesFinder(gr, fail, [], infinity, [], [1 .. 4], false, 3, false); # Expected output: [ ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:363 # Input is: CliquesFinder(gr, fail, [], infinity, [1, 2], [], false, 3, false); # Expected output: [ ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:365 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/cliques.tst:366 # Input is: CliquesFinder(gr, fail, [], infinity, [1 .. 5], [], false, 1, false); # Expected output: [ ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:368 # Input is: CliquesFinder(gr, fail, [], infinity, [1 .. 5], [1 .. 5], false, fail, false); # Expected output: [ ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:371 # Input is: CliquesFinder(gr, fail, [], infinity, [1], [], false, 1, false); # Expected output: [ [ 1 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:373 # Input is: CliquesFinder(gr, fail, [], infinity, [], [], false, 1, false); # Expected output: [ [ 1 ], [ 2 ], [ 3 ], [ 4 ], [ 5 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:377 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/cliques.tst:378 # Input is: CliquesFinder(gr, fail, [], infinity, [], [], true, 4, true); # Expected output: [ ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:380 # Input is: CliquesFinder(gr, fail, [], infinity, [], [], true, 5, true); # Expected output: [ [ 1, 2, 3, 4, 5 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:382 # Input is: CliquesFinder(gr, fail, [], infinity, [], [], true, fail, true); # Expected output: [ [ 1, 2, 3, 4, 5 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:384 # Input is: CliquesFinder(gr, fail, [], infinity, [], [], false, fail, true); # Expected output: [ [ 1 ], [ 1, 2 ], [ 1, 2, 3 ], [ 1, 2, 3, 4 ], [ 1, 2, 3, 4, 5 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:386 # Input is: out := Set(CliquesFinder(gr, fail, [], infinity, [], [], false, fail, false)); # Expected output: [ [ 1 ], [ 1, 2 ], [ 1, 2, 3 ], [ 1, 2, 3, 4 ], [ 1, 2, 3, 4, 5 ], [ 1, 2, 3, 5 ], [ 1, 2, 4 ], [ 1, 2, 4, 5 ], [ 1, 2, 5 ], [ 1, 3 ], [ 1, 3, 4 ], [ 1, 3, 4, 5 ], [ 1, 3, 5 ], [ 1, 4 ], [ 1, 4, 5 ], [ 1, 5 ], [ 2 ], [ 2, 3 ], [ 2, 3, 4 ], [ 2, 3, 4, 5 ], [ 2, 3, 5 ], [ 2, 4 ], [ 2, 4, 5 ], [ 2, 5 ], [ 3 ], [ 3, 4 ], [ 3, 4, 5 ], [ 3, 5 ], [ 4 ], [ 4, 5 ], [ 5 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:394 # Input is: Length(out); # Expected output: 31 # But found: Error, Variable: 'out' must have a value ######## ########> Diff in standard/cliques.tst:397 # Input is: Set(CliquesFinder(gr, fail, [], lim, [], [], false, fail, false)) = out; # Expected output: true # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:400 # Input is: out := Set(CliquesFinder(gr, fail, [], lim, [], [], false, fail, false)); # Expected output: [ [ 1 ], [ 1, 2 ], [ 1, 3 ], [ 1, 4 ], [ 1, 5 ], [ 2 ], [ 2, 3 ], [ 2, 4 ], [ 2, 5 ], [ 3 ], [ 4 ], [ 5 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:403 # Input is: Length(out) = lim; # Expected output: true # But found: Error, Variable: 'out' must have a value ######## ########> Diff in standard/cliques.tst:405 # Input is: out := Set(CliquesFinder(gr, fail, [], lim, [1, 4], [], false, fail, false)); # Expected output: [ [ 1, 2, 3, 4 ], [ 1, 2, 3, 4, 5 ], [ 1, 2, 4 ], [ 1, 2, 4, 5 ], [ 1, 3, 4 ], [ 1, 3, 4, 5 ], [ 1, 4 ], [ 1, 4, 5 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:409 # Input is: out := Set(CliquesFinder(gr, fail, [], lim, [1, 4], [], false, 4, false)); # Expected output: [ [ 1, 2, 3, 4 ], [ 1, 2, 4, 5 ], [ 1, 3, 4, 5 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:412 # Input is: out := CliquesFinder(gr, fail, [], lim, [2], [4, 5], false, fail, false); # Expected output: [ [ 2 ], [ 1, 2 ], [ 2, 3 ], [ 1, 2, 3 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:414 # Input is: out := CliquesFinder(gr, fail, [], lim, [], [3, 4, 5], false, fail, false); # Expected output: [ [ 1 ], [ 2 ], [ 1, 2 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:416 # Input is: out := CliquesFinder(gr, fail, [], lim, [], [3, 4, 5], false, 2, false); # Expected output: [ [ 1, 2 ] ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:418 # Input is: gr := DigraphSymmetricClosure(ChainDigraph(5));; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/cliques.tst:419 # Input is: out := CliquesFinder(gr, fail, [], lim, [], [], true, 3, true); # Expected output: [ ] # But found: Error, Variable: 'CliquesFinder' must have a value ######## ########> Diff in standard/cliques.tst:423 # Input is: gr := DigraphFromGraph6String( "X~~~~~~~~~~~~~~~~~}EkpJK_vyRUwvH{fL^FFfzdo~tmB~cU^~"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/cliques.tst:426 # Input is: AutomorphismGroup(gr);; # Expected output: # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/cliques.tst:427 # Input is: c := DigraphMaximalCliques(gr);; # Expected output: # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:428 # Input is: Length(c); # Expected output: 52 # But found: Error, Variable: 'c' must have a value ######## ########> Diff in standard/cliques.tst:430 # Input is: gr := DigraphFromGraph6String(Concatenation( "b~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~bx[^fbY^zbMznyvej^AX~", "v|Zf\\r~jXmr~}|LD~t}iF~ztlNV~_")); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/cliques.tst:434 # Input is: AutomorphismGroup(gr);; # Expected output: # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/cliques.tst:435 # Input is: c := DigraphMaximalCliques(gr);; # Expected output: # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:436 # Input is: Length(c); # Expected output: 302 # But found: Error, Variable: 'c' must have a value ######## ########> Diff in standard/cliques.tst:438 # Input is: gr := DigraphFromGraph6String(Concatenation( "~?@O~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~", "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~", "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~", "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~", "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~}NrN}}~~[F", "~X}H}jr~~t]~zwvmv\\zzy}n~y~m~Tzjy}M~{Jr^YZ~V|~~~V|uuu|^^Z|^w^emV|n~^}z~j", "uYz\\u~l~zz~~T|nllvb}~Z~~~~it~a}zvD~~j}tY~f~x~qn~~z~Z||{V]Sn~~~~z~jnfzod", "V~}nzn}}}~MFVn~z|F|F~|tNx~~~{")); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/cliques.tst:448 # Input is: AutomorphismGroup(gr);; # Expected output: # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/cliques.tst:449 # Input is: c := DigraphMaximalCliques(gr);; # Expected output: # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:450 # Input is: Length(c); # Expected output: 12815 # But found: Error, Variable: 'c' must have a value ######## ########> Diff in standard/cliques.tst:454 # Input is: gr := DigraphFromSparse6String(":~?@c__EC?_F"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/cliques.tst:456 # Input is: DigraphMaximalCliquesReps(gr); # Expected output: [ [ 1 ], [ 2, 3, 5 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesReps' must have a value ######## ########> Diff in standard/cliques.tst:458 # Input is: DigraphMaximalCliques(gr); # Expected output: [ [ 1 ], [ 4 ], [ 6 ], [ 7 ], [ 8 ], [ 9 ], [ 10 ], [ 11 ], [ 12 ], [ 13 ], [ 14 ], [ 15 ], [ 16 ], [ 17 ], [ 18 ], [ 19 ], [ 20 ], [ 21 ], [ 22 ], [ 23 ], [ 24 ], [ 25 ], [ 26 ], [ 27 ], [ 28 ], [ 29 ], [ 30 ], [ 31 ], [ 32 ], [ 33 ], [ 34 ], [ 35 ], [ 36 ], [ 37 ], [ 38 ], [ 39 ], [ 40 ], [ 41 ], [ 42 ], [ 43 ], [ 44 ], [ 45 ], [ 46 ], [ 47 ], [ 48 ], [ 49 ], [ 50 ], [ 51 ], [ 52 ], [ 53 ], [ 54 ], [ 55 ], [ 56 ], [ 57 ], [ 58 ], [ 59 ], [ 60 ], [ 61 ], [ 62 ], [ 63 ], [ 64 ], [ 65 ], [ 66 ], [ 67 ], [ 68 ], [ 69 ], [ 70 ], [ 71 ], [ 72 ], [ 73 ], [ 74 ], [ 75 ], [ 76 ], [ 77 ], [ 78 ], [ 79 ], [ 80 ], [ 81 ], [ 82 ], [ 83 ], [ 84 ], [ 85 ], [ 86 ], [ 87 ], [ 88 ], [ 89 ], [ 90 ], [ 91 ], [ 92 ], [ 93 ], [ 94 ], [ 95 ], [ 96 ], [ 97 ], [ 98 ], [ 99 ], [ 100 ], [ 2, 3, 5 ] ] # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:472 # Input is: CliqueNumber(NullDigraph(10)); # Expected output: 1 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:474 # Input is: CliqueNumber(NullDigraph(0)); # Expected output: 0 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:476 # Input is: CliqueNumber(CompleteDigraph(10)); # Expected output: 10 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:478 # Input is: CliqueNumber(DigraphRemoveEdge(CompleteDigraph(10), [1, 2])); # Expected output: 9 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:480 # Input is: CliqueNumber(JohnsonDigraph(10, 2)); # Expected output: 9 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:482 # Input is: CliqueNumber(ChainDigraph(10)); # Expected output: 1 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:484 # Input is: CliqueNumber(ChainDigraph(9)); # Expected output: 1 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:486 # Input is: CliqueNumber(CycleDigraph(9)); # Expected output: 1 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:488 # Input is: CliqueNumber(CycleDigraph(8)); # Expected output: 1 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:490 # Input is: CliqueNumber(DigraphSymmetricClosure(CycleDigraph(8))); # Expected output: 2 # But found: Error, Variable: 'CliqueNumber' must have a value ######## ########> Diff in standard/cliques.tst:494 # Input is: D := Digraph(IsMutableDigraph, [[2, 3], [1, 3], [1, 2, 4], [3, 5, 6], [4, 6], [4, 5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/cliques.tst:496 # Input is: cliques := DigraphMaximalCliquesReps(D); # Expected output: [ [ 1, 2, 3 ], [ 3, 4 ] ] # But found: Error, Variable: 'DigraphMaximalCliquesReps' must have a value ######## ########> Diff in standard/cliques.tst:498 # Input is: IsMutable(cliques) or ForAny(cliques, IsMutable); # Expected output: false # But found: Error, Variable: 'cliques' must have a value ######## ########> Diff in standard/cliques.tst:500 # Input is: cliques := DigraphMaximalCliques(D); # Expected output: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 3, 4 ] ] # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:502 # Input is: IsMutable(cliques) or ForAny(cliques, IsMutable); # Expected output: false # But found: Error, Variable: 'cliques' must have a value ######## ########> Diff in standard/cliques.tst:504 # Input is: cliques := DigraphMaximalCliques(D, [1]); # Expected output: [ [ 1, 2, 3 ] ] # But found: Error, Variable: 'DigraphMaximalCliques' must have a value ######## ########> Diff in standard/cliques.tst:506 # Input is: IsMutable(cliques) or ForAny(cliques, IsMutable); # Expected output: false # But found: Error, Variable: 'cliques' must have a value ######## ########> Diff in standard/cliques.tst:517 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/cliques.tst msecs: 191 false gap> ########> Diff in standard/constructors.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/constructors.tst:25 # Input is: digraph := Digraph(group, [1 .. n], \^, adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/constructors.tst:27 # Input is: bddigraph := BipartiteDoubleDigraph(digraph); # Expected output: # But found: Error, Variable: 'BipartiteDoubleDigraph' must have a value ######## ########> Diff in standard/constructors.tst:29 # Input is: bdgroup := DigraphGroup(bddigraph); # Expected output: Group([ (1,2,3,4,5)(6,7,8,9,10), (1,6)(2,7)(3,8)(4,9)(5,10) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/constructors.tst:37 # Input is: digraph := Digraph(out); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/constructors.tst:39 # Input is: SetDigraphGroup(digraph, group); # Expected output: # But found: Error, Variable: 'SetDigraphGroup' must have a value ######## ########> Diff in standard/constructors.tst:40 # Input is: ddigraph := BipartiteDoubleDigraph(digraph); # Expected output: # But found: Error, Variable: 'BipartiteDoubleDigraph' must have a value ######## ########> Diff in standard/constructors.tst:42 # Input is: DigraphGroup(ddigraph); # Expected output: Group([ (2,3)(6,7), (2,4)(6,8), (1,5)(2,6)(3,7)(4,8) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/constructors.tst:44 # Input is: ddigraph := DoubleDigraph(digraph); # Expected output: # But found: Error, Variable: 'DoubleDigraph' must have a value ######## ########> Diff in standard/constructors.tst:46 # Input is: DigraphGroup(ddigraph); # Expected output: Group([ (2,3)(6,7), (2,4)(6,8), (1,5)(2,6)(3,7)(4,8) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/constructors.tst:50 # Input is: gr := Digraph([[2, 3], [1], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/constructors.tst:51 # Input is: gr2 := DoubleDigraph(gr); # Expected output: # But found: Error, Variable: 'DoubleDigraph' must have a value ######## ########> Diff in standard/constructors.tst:53 # Input is: OutNeighbours(gr2); # Expected output: [ [ 2, 3, 5, 6 ], [ 1, 4 ], [ ], [ 5, 6, 2, 3 ], [ 4, 1 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:55 # Input is: gr2 := BipartiteDoubleDigraph(gr); # Expected output: # But found: Error, Variable: 'BipartiteDoubleDigraph' must have a value ######## ########> Diff in standard/constructors.tst:57 # Input is: OutNeighbours(gr2); # Expected output: [ [ 5, 6 ], [ 4 ], [ ], [ 2, 3 ], [ 1 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:59 # Input is: gr := Digraph([[2, 2, 3], [1], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/constructors.tst:60 # Input is: gr2 := DoubleDigraph(gr); # Expected output: # But found: Error, Variable: 'DoubleDigraph' must have a value ######## ########> Diff in standard/constructors.tst:62 # Input is: OutNeighbours(gr2); # Expected output: [ [ 2, 2, 3, 5, 5, 6 ], [ 1, 4 ], [ ], [ 5, 5, 6, 2, 2, 3 ], [ 4, 1 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:64 # Input is: gr2 := BipartiteDoubleDigraph(gr); # Expected output: # But found: Error, Variable: 'BipartiteDoubleDigraph' must have a value ######## ########> Diff in standard/constructors.tst:66 # Input is: OutNeighbours(gr2); # Expected output: [ [ 5, 5, 6 ], [ 4 ], [ ], [ 2, 2, 3 ], [ 1 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:101 # Input is: digraph := Digraph(out); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/constructors.tst:103 # Input is: DigraphDiameter(digraph); # Expected output: 6 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/constructors.tst:105 # Input is: DistanceDigraph(digraph, 4); # Expected output: # But found: Error, Variable: 'DistanceDigraph' must have a value ######## ########> Diff in standard/constructors.tst:107 # Input is: DistanceDigraph(digraph, [1, 3, 5]); # Expected output: # But found: Error, Variable: 'DistanceDigraph' must have a value ######## ########> Diff in standard/constructors.tst:109 # Input is: gr := DistanceDigraph(digraph, 0); # Expected output: # But found: Error, Variable: 'DistanceDigraph' must have a value ######## ########> Diff in standard/constructors.tst:111 # Input is: OutNeighbours(gr) = List([1 .. 126], x -> [x]); # Expected output: true # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:115 # Input is: gr := Digraph([[1, 2], [], [2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/constructors.tst:116 # Input is: DigraphGroup(gr) = Group((1, 3)); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/constructors.tst:118 # Input is: OutNeighbours(DistanceDigraph(gr, 0)); # Expected output: [ [ 1 ], [ 2 ], [ 3 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:120 # Input is: OutNeighbours(DistanceDigraph(gr, 1)); # Expected output: [ [ 2 ], [ ], [ 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:122 # Input is: OutNeighbours(DistanceDigraph(gr, 2)); # Expected output: [ [ ], [ ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:126 # Input is: gr := Digraph([[1, 2], [2, 3], [4], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/constructors.tst:127 # Input is: DistanceDigraph(gr, -2); # Expected output: Error, the 2nd argument must be a non-negative integer, # But found: Error, Variable: 'DistanceDigraph' must have a value ######## ########> Diff in standard/constructors.tst:131 # Input is: gr := LineUndirectedDigraph(CompleteDigraph(3)); # Expected output: # But found: Error, Variable: 'LineUndirectedDigraph' must have a value ######## ########> Diff in standard/constructors.tst:133 # Input is: gr = CompleteDigraph(3); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/constructors.tst:135 # Input is: gr := LineDigraph(CompleteDigraph(3)); # Expected output: # But found: Error, Variable: 'LineDigraph' must have a value ######## ########> Diff in standard/constructors.tst:137 # Input is: OutNeighbours(gr); # Expected output: [ [ 3, 4 ], [ 5, 6 ], [ 1, 2 ], [ 6, 5 ], [ 2, 1 ], [ 4, 3 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:139 # Input is: gr := LineUndirectedDigraph(CompleteDigraph(4));; # Expected output: # But found: Error, Variable: 'LineUndirectedDigraph' must have a value ######## ########> Diff in standard/constructors.tst:140 # Input is: OutNeighbours(gr); # Expected output: [ [ 2, 4, 5, 3 ], [ 3, 6, 4, 1 ], [ 5, 1, 2, 6 ], [ 5, 6, 2, 1 ], [ 1, 3, 6, 4 ], [ 2, 3, 5, 4 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:143 # Input is: gr := Digraph([[2, 4], [1, 3, 4], [2, 4], [1, 2, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/constructors.tst:145 # Input is: gr2 := LineUndirectedDigraph(gr); # Expected output: # But found: Error, Variable: 'LineUndirectedDigraph' must have a value ######## ########> Diff in standard/constructors.tst:147 # Input is: OutNeighbours(gr2); # Expected output: [ [ 2, 3, 4 ], [ 1, 4, 5 ], [ 1, 4, 5 ], [ 1, 2, 3, 5 ], [ 2, 3, 4 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:149 # Input is: gr := Digraph([[2, 4], [3], [1, 2, 4], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/constructors.tst:151 # Input is: gr2 := LineDigraph(gr); # Expected output: # But found: Error, Variable: 'LineDigraph' must have a value ######## ########> Diff in standard/constructors.tst:153 # Input is: OutNeighbours(gr2); # Expected output: [ [ 3 ], [ 7 ], [ 4, 5, 6 ], [ 1, 2 ], [ 3 ], [ 7 ], [ 4, 5, 6 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/constructors.tst:155 # Input is: gr := CompleteDigraph(6);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/constructors.tst:156 # Input is: gr2 := LineUndirectedDigraph(gr); # Expected output: # But found: Error, Variable: 'LineUndirectedDigraph' must have a value ######## ########> Diff in standard/constructors.tst:158 # Input is: DigraphGroup(gr) = SymmetricGroup(6); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/constructors.tst:160 # Input is: gr3 := LineUndirectedDigraph(gr); # Expected output: # But found: Error, Variable: 'LineUndirectedDigraph' must have a value ######## ########> Diff in standard/constructors.tst:162 # Input is: gr2 = gr3; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/constructors.tst:164 # Input is: gr := CycleDigraph(8); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/constructors.tst:166 # Input is: gr2 := LineDigraph(gr); # Expected output: # But found: Error, Variable: 'LineDigraph' must have a value ######## ########> Diff in standard/constructors.tst:168 # Input is: DigraphGroup(gr); # Expected output: Group([ (1,2,3,4,5,6,7,8) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/constructors.tst:170 # Input is: gr3 := LineDigraph(gr); # Expected output: # But found: Error, Variable: 'LineDigraph' must have a value ######## ########> Diff in standard/constructors.tst:172 # Input is: gr2 = gr3; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/constructors.tst:174 # Input is: gr := ChainDigraph(4); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/constructors.tst:176 # Input is: LineUndirectedDigraph(gr); # Expected output: Error, the argument must be a symmetric digraph, # But found: Error, Variable: 'LineUndirectedDigraph' must have a value ######## ########> Diff in standard/constructors.tst:180 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/constructors.tst msecs: 87 false gap> ########> Diff in standard/display.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/display.tst:17 # Input is: Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:19 # Input is: Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:21 # Input is: Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:23 # Input is: Digraph([[2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:25 # Input is: gr := Digraph([[1, 2], [2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:27 # Input is: PrintString(gr); # Expected output: "DigraphFromDigraph6String(\"&Bq?\")" # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/display.tst:29 # Input is: String(gr); # Expected output: "DigraphFromDigraph6String(\"&Bq?\")" # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/display.tst:31 # Input is: gr := Digraph([[2], [1], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:33 # Input is: PrintString(gr); # Expected output: "DigraphFromDigraph6String(\"&CQ?G\")" # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/display.tst:35 # Input is: String(gr); # Expected output: "DigraphFromDigraph6String(\"&CQ?G\")" # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/display.tst:40 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:42 # Input is: PrintString(gr); # Expected output: "ChainDigraph(3)" # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/display.tst:44 # Input is: String(gr); # Expected output: "ChainDigraph(3)" # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/display.tst:50 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:52 # Input is: dot := DotDigraph(gr);; # Expected output: # But found: Error, Variable: 'DotDigraph' must have a value ######## ########> Diff in standard/display.tst:53 # Input is: dot{[1 .. 50]}; # Expected output: "//dot\ndigraph hgn{\nnode [shape=circle]\n1\n2\n3\n1 -> " # But found: Error, Variable: 'dot' must have a value ######## ########> Diff in standard/display.tst:55 # Input is: dot{[51 .. 75]}; # Expected output: "1\n1 -> 2\n1 -> 2\n1 -> 3\n}\n" # But found: Error, Variable: 'dot' must have a value ######## ########> Diff in standard/display.tst:60 # Input is: gr1 := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:62 # Input is: DotDigraph(gr1){[50 .. 109]}; # Expected output: "6\n7\n8\n1 -> 6\n1 -> 7\n2 -> 1\n2 -> 6\n3 -> 5\n4 -> 1\n4 -> 4\n4 -> " # But found: Error, Variable: 'DotDigraph' must have a value ######## ########> Diff in standard/display.tst:66 # Input is: gr2 := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:68 # Input is: DotDigraph(gr2){[11 .. 75]}; # Expected output: "aph hgn{\nnode [shape=circle]\n1\n2\n3\n4\n1 -> 2\n2 -> 1\n2 -> 3\n3 -> 2\n" # But found: Error, Variable: 'DotDigraph' must have a value ######## ########> Diff in standard/display.tst:70 # Input is: DotSymmetricDigraph(gr2){[12 .. 70]}; # Expected output: " hgn{\nnode [shape=circle]\n\n1\n2\n3\n4\n1 -- 2\n2 -- 3\n3 -- 3\n3 -" # But found: Error, Variable: 'DotSymmetricDigraph' must have a value ######## ########> Diff in standard/display.tst:72 # Input is: DotSymmetricDigraph(gr1); # Expected output: Error, the argument must be a symmetric digraph, # But found: Error, Variable: 'DotSymmetricDigraph' must have a value ######## ########> Diff in standard/display.tst:78 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:80 # Input is: dot := DotVertexLabelledDigraph(gr);; # Expected output: # But found: Error, Variable: 'DotVertexLabelledDigraph' must have a value ######## ########> Diff in standard/display.tst:81 # Input is: dot{[1 .. 50]}; # Expected output: "//dot\ndigraph hgn{\nnode [shape=circle]\n1 [label=\"1" # But found: Error, Variable: 'dot' must have a value ######## ########> Diff in standard/display.tst:83 # Input is: SetDigraphVertexLabel(gr, 1, 2); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabel' must have a value ######## ########> Diff in standard/display.tst:84 # Input is: dot := DotVertexLabelledDigraph(gr);; # Expected output: # But found: Error, Variable: 'DotVertexLabelledDigraph' must have a value ######## ########> Diff in standard/display.tst:85 # Input is: dot{[1 .. 50]}; # Expected output: "//dot\ndigraph hgn{\nnode [shape=circle]\n1 [label=\"2" # But found: Error, Variable: 'dot' must have a value ######## ########> Diff in standard/display.tst:111 # Input is: gr := Digraph([[1], [1, 2], [1, 3], [1, 4], [1 .. 5], [1 .. 6], [1, 2, 3, 4, 5, 7], [1, 8]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:113 # Input is: Print(DotPartialOrderDigraph(gr)); # Expected output: //dot digraph hgn{ node [shape=circle] 1 2 3 4 5 6 7 8 2 -> 1 3 -> 1 4 -> 1 5 -> 2 5 -> 3 5 -> 4 6 -> 5 7 -> 5 8 -> 1 } # But found: Error, Variable: 'DotPartialOrderDigraph' must have a value ######## ########> Diff in standard/display.tst:135 # Input is: gr := Digraph([[1], [2], [1, 3], [2, 4], [1, 2, 3, 4, 5], [1, 2, 3, 6]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:136 # Input is: Print(DotPartialOrderDigraph(gr)); # Expected output: //dot digraph hgn{ node [shape=circle] 1 2 3 4 5 6 3 -> 1 4 -> 2 5 -> 3 5 -> 4 6 -> 3 6 -> 2 } # But found: Error, Variable: 'DotPartialOrderDigraph' must have a value ######## ########> Diff in standard/display.tst:153 # Input is: gr := Digraph([[1], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:154 # Input is: DotPartialOrderDigraph(gr); # Expected output: Error, the argument must be a partial order digraph, # But found: Error, Variable: 'DotPartialOrderDigraph' must have a value ######## ########> Diff in standard/display.tst:158 # Input is: gr := Digraph([[1], [1, 2], [1, 3], [1, 4], [1 .. 5], [1 .. 6], [1, 2, 3, 4, 5, 7], [1, 8]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:160 # Input is: Print(DotPreorderDigraph(gr), "\n"); # Expected output: //dot digraph graphname { node [shape=Mrecord, height=0.5, fixedsize=true]ranksep=1; 1 [label="1", width=0.5] 2 [label="2", width=0.5] 3 [label="3", width=0.5] 4 [label="4", width=0.5] 5 [label="5", width=0.5] 6 [label="6", width=0.5] 7 [label="7", width=0.5] 8 [label="8", width=0.5] 2 -> 1 3 -> 1 4 -> 1 5 -> 2 5 -> 3 5 -> 4 6 -> 5 7 -> 5 8 -> 1 } # But found: Error, Variable: 'DotPreorderDigraph' must have a value ######## ########> Diff in standard/display.tst:184 # Input is: gr := DigraphFromDigraph6String(gr);; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/display.tst:185 # Input is: Print(DotPreorderDigraph(gr){[1 .. 94]}, "\n"); # Expected output: //dot digraph graphname { node [shape=Mrecord, height=0.5, fixedsize=true]ranksep=1; 1 [label= # But found: Error, Variable: 'DotPreorderDigraph' must have a value ######## ########> Diff in standard/display.tst:190 # Input is: gr := DigraphDisjointUnion(CompleteDigraph(10), CompleteDigraph(5), CycleDigra\ ph(2));; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/display.tst:191 # Input is: gr := DigraphReflexiveTransitiveClosure(DigraphAddEdge(gr, [10, 11]));; # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/display.tst:192 # Input is: IsPreorderDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsPreorderDigraph' must have a value ######## ########> Diff in standard/display.tst:194 # Input is: Print(DotPreorderDigraph(gr), "\n"); # Expected output: //dot digraph graphname { node [shape=Mrecord, height=0.5, fixedsize=true]ranksep=1; 1 [label="11|12|13|14|15", width=2.5] 2 [label="1|2|3|4|5|6|7|8|9|10", width=5.] 3 [label="16|17", width=1.] 2 -> 1 } # But found: Error, Variable: 'DotPreorderDigraph' must have a value ######## ########> Diff in standard/display.tst:205 # Input is: gr := Digraph([[2, 3], [2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/display.tst:207 # Input is: Print(DotHighlightedDigraph(gr, [1, 2], "red", "black")); # Expected output: //dot digraph hgn{ subgraph lowverts{ node [shape=circle, color=black] edge [color=black] 3 } subgraph highverts{ node [shape=circle, color=red] edge [color=red] 1 2 } subgraph lowverts{ 3 -> 1 3 -> 3 } subgraph highverts{ 1 -> 2 1 -> 3 [color=black] 2 -> 2 } } # But found: Error, Variable: 'DotHighlightedDigraph' must have a value ######## ########> Diff in standard/display.tst:233 # Input is: Splash(DotDigraph(RandomDigraph(10)), rec(viewer := 1)); # Expected output: Error, the option `viewer` must be a string, not an integer, # But found: Error, Variable: 'Splash' must have a value ######## ########> Diff in standard/display.tst:235 # Input is: Splash(DotDigraph(RandomDigraph(10)), rec(viewer := "asdfasfa")); # Expected output: Error, the viewer "asdfasfa" specified in the option `viewer` is not available\ \ , # But found: Error, Variable: 'Splash' must have a value ######## ########> Diff in standard/display.tst:248 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/display.tst msecs: 80 false gap> ########> Diff in standard/examples.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/examples.tst:17 # Input is: ChromaticNumber(PetersenGraph()); # Expected output: 3 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/examples.tst:19 # Input is: DigraphGirth(PetersenGraph()); # Expected output: 2 # But found: Error, Variable: 'DigraphGirth' must have a value ######## ########> Diff in standard/examples.tst:21 # Input is: PetersenGraph(IsMutableDigraph); # Expected output: # But found: Error, Variable: 'PetersenGraph' must have a value ######## ########> Diff in standard/examples.tst:25 # Input is: D := GeneralisedPetersenGraph(8, 3); # Expected output: # But found: Error, Variable: 'GeneralisedPetersenGraph' must have a value ######## ########> Diff in standard/examples.tst:27 # Input is: IsBipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:29 # Input is: D := GeneralisedPetersenGraph(15, 7); # Expected output: # But found: Error, Variable: 'GeneralisedPetersenGraph' must have a value ######## ########> Diff in standard/examples.tst:31 # Input is: IsBipartiteDigraph(D); # Expected output: false # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:33 # Input is: D := GeneralisedPetersenGraph(10, 2); # Expected output: # But found: Error, Variable: 'GeneralisedPetersenGraph' must have a value ######## ########> Diff in standard/examples.tst:35 # Input is: IsVertexTransitive(D); # Expected output: true # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/examples.tst:37 # Input is: D := GeneralisedPetersenGraph(11, 2); # Expected output: # But found: Error, Variable: 'GeneralisedPetersenGraph' must have a value ######## ########> Diff in standard/examples.tst:39 # Input is: IsVertexTransitive(D); # Expected output: false # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/examples.tst:41 # Input is: D := GeneralisedPetersenGraph(5, 2); # Expected output: # But found: Error, Variable: 'GeneralisedPetersenGraph' must have a value ######## ########> Diff in standard/examples.tst:43 # Input is: IsIsomorphicDigraph(D, PetersenGraph()); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/examples.tst:45 # Input is: G8_3 := DigraphFromGraph6String("OCQa`Q?OH?a@A@@?_OGB@"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/examples.tst:47 # Input is: D := GeneralisedPetersenGraph(8, 3); # Expected output: # But found: Error, Variable: 'GeneralisedPetersenGraph' must have a value ######## ########> Diff in standard/examples.tst:49 # Input is: IsIsomorphicDigraph(D, G8_3); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/examples.tst:53 # Input is: gr := CompleteDigraph(5); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/examples.tst:55 # Input is: AutomorphismGroup(gr) = SymmetricGroup(5); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/examples.tst:57 # Input is: CompleteDigraph(1) = EmptyDigraph(1); # Expected output: true # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/examples.tst:59 # Input is: CompleteDigraph(0); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/examples.tst:61 # Input is: CompleteDigraph(-1); # Expected output: Error, the argument must be a non-negative integer, # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/examples.tst:63 # Input is: CompleteDigraph(IsMutableDigraph, 10); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/examples.tst:67 # Input is: gr := EmptyDigraph(5); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/examples.tst:69 # Input is: AutomorphismGroup(gr) = SymmetricGroup(5); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/examples.tst:71 # Input is: EmptyDigraph(0); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/examples.tst:73 # Input is: EmptyDigraph(-1); # Expected output: Error, the argument must be a non-negative integer, # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/examples.tst:75 # Input is: EmptyDigraph(IsMutableDigraph, -1); # Expected output: Error, the argument must be a non-negative integer, # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/examples.tst:79 # Input is: gr := CycleDigraph(0); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `CycleDigraph' on 1 arguments # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/examples.tst:82 # Input is: gr := CycleDigraph(1); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/examples.tst:84 # Input is: AutomorphismGroup(gr) = Group(()); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/examples.tst:86 # Input is: gr := CycleDigraph(6);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/examples.tst:87 # Input is: AutomorphismGroup(gr) = Group((1, 2, 3, 4, 5, 6)); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/examples.tst:89 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 2 ], [ 2, 3 ], [ 3, 4 ], [ 4, 5 ], [ 5, 6 ], [ 6, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/examples.tst:91 # Input is: gr := CycleDigraph(1000); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/examples.tst:93 # Input is: gr := CycleDigraph(IsMutableDigraph, 6); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/examples.tst:97 # Input is: gr := ChainDigraph(0); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `ChainDigraph' on 1 arguments # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/examples.tst:100 # Input is: gr := ChainDigraph(1); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/examples.tst:102 # Input is: IsEmptyDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsEmptyDigraph' must have a value ######## ########> Diff in standard/examples.tst:104 # Input is: gr = EmptyDigraph(1); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/examples.tst:106 # Input is: gr := ChainDigraph(2); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/examples.tst:108 # Input is: AutomorphismGroup(gr) = Group(()); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/examples.tst:110 # Input is: HasIsTransitiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'HasIsTransitiveDigraph' must have a value ######## ########> Diff in standard/examples.tst:112 # Input is: IsTransitiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/examples.tst:114 # Input is: gr := ChainDigraph(10); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/examples.tst:116 # Input is: OutNeighbours(gr); # Expected output: [ [ 2 ], [ 3 ], [ 4 ], [ 5 ], [ 6 ], [ 7 ], [ 8 ], [ 9 ], [ 10 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/examples.tst:118 # Input is: AutomorphismGroup(gr) = Group(()); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/examples.tst:120 # Input is: grrt := DigraphReflexiveTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/examples.tst:122 # Input is: IsPartialOrderBinaryRelation(AsBinaryRelation(grrt)); # Expected output: true # But found: Error, Variable: 'grrt' must have a value ######## ########> Diff in standard/examples.tst:124 # Input is: IsAntisymmetricDigraph(grrt); # Expected output: true # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/examples.tst:126 # Input is: grrt; # Expected output: # But found: Error, Variable: 'grrt' must have a value ######## ########> Diff in standard/examples.tst:128 # Input is: ChainDigraph(IsMutableDigraph, 10); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/examples.tst:132 # Input is: gr := CompleteBipartiteDigraph(2, 0); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `CompleteBipartiteDigraph' on 2 argument\ \ s # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:136 # Input is: gr := CompleteBipartiteDigraph(0, 2); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `CompleteBipartiteDigraph' on 2 argument\ \ s # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:140 # Input is: gr := CompleteBipartiteDigraph(4, 3); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:142 # Input is: AutomorphismGroup(gr) = Group((1, 2, 3, 4), (1, 2), (5, 6, 7), (5, 6)); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/examples.tst:144 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 2, 5 ], [ 2, 6 ], [ 2, 7 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 5 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 5, 2 ], [ 5, 3 ], [ 5, 4 ], [ 6, 1 ], [ 6, 2 ], [ 6, 3 ], [ 6, 4 ], [ 7, 1 ], [ 7, 2 ], [ 7, 3 ], [ 7, 4 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/examples.tst:149 # Input is: gr := CompleteBipartiteDigraph(4, 4); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:151 # Input is: AutomorphismGroup(gr) = Group((1, 2, 3, 4), (1, 2), (5, 6, 7, 8), (5, 6), (1, 5)(2, 6)(3, 7)(4, 8)); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/examples.tst:156 # Input is: CompleteMultipartiteDigraph([5, 4, 2]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:158 # Input is: CompleteMultipartiteDigraph([5, 4, 2, 10, 1000]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:160 # Input is: CompleteMultipartiteDigraph([5]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:162 # Input is: CompleteMultipartiteDigraph([]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:164 # Input is: CompleteMultipartiteDigraph([5, 4, 2, 10, -5]); # Expected output: Error, the argument must be a list of positive integers, # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:166 # Input is: CompleteMultipartiteDigraph([5, 0, 2]); # Expected output: Error, the argument must be a list of positive integers, # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/examples.tst:168 # Input is: DigraphEdges(CompleteMultipartiteDigraph([3, 2])); # Expected output: [ [ 1, 4 ], [ 1, 5 ], [ 2, 4 ], [ 2, 5 ], [ 3, 4 ], [ 3, 5 ], [ 4, 1 ], [ 4, 2 ], [ 4, 3 ], [ 5, 1 ], [ 5, 2 ], [ 5, 3 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/examples.tst:171 # Input is: DigraphVertices(CompleteMultipartiteDigraph([2, 1, 2])); # Expected output: [ 1 .. 5 ] # But found: Error, Variable: 'DigraphVertices' must have a value ######## ########> Diff in standard/examples.tst:173 # Input is: DigraphEdges(CompleteMultipartiteDigraph([7, 8, 2])); # Expected output: [ [ 1, 8 ], [ 1, 9 ], [ 1, 10 ], [ 1, 11 ], [ 1, 12 ], [ 1, 13 ], [ 1, 14 ], [ 1, 15 ], [ 1, 16 ], [ 1, 17 ], [ 2, 8 ], [ 2, 9 ], [ 2, 10 ], [ 2, 11 ], [ 2, 12 ], [ 2, 13 ], [ 2, 14 ], [ 2, 15 ], [ 2, 16 ], [ 2, 17 ], [ 3, 8 ], [ 3, 9 ], [ 3, 10 ], [ 3, 11 ], [ 3, 12 ], [ 3, 13 ], [ 3, 14 ], [ 3, 15 ], [ 3, 16 ], [ 3, 17 ], [ 4, 8 ], [ 4, 9 ], [ 4, 10 ], [ 4, 11 ], [ 4, 12 ], [ 4, 13 ], [ 4, 14 ], [ 4, 15 ], [ 4, 16 ], [ 4, 17 ], [ 5, 8 ], [ 5, 9 ], [ 5, 10 ], [ 5, 11 ], [ 5, 12 ], [ 5, 13 ], [ 5, 14 ], [ 5, 15 ], [ 5, 16 ], [ 5, 17 ], [ 6, 8 ], [ 6, 9 ], [ 6, 10 ], [ 6, 11 ], [ 6, 12 ], [ 6, 13 ], [ 6, 14 ], [ 6, 15 ], [ 6, 16 ], [ 6, 17 ], [ 7, 8 ], [ 7, 9 ], [ 7, 10 ], [ 7, 11 ], [ 7, 12 ], [ 7, 13 ], [ 7, 14 ], [ 7, 15 ], [ 7, 16 ], [ 7, 17 ], [ 8, 1 ], [ 8, 2 ], [ 8, 3 ], [ 8, 4 ], [ 8, 5 ], [ 8, 6 ], [ 8, 7 ], [ 8, 16 ], [ 8, 17 ], [ 9, 1 ], [ 9, 2 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 9, 6 ], [ 9, 7 ], [ 9, 16 ], [ 9, 17 ], [ 10, 1 ], [ 10, 2 ], [ 10, 3 ], [ 10, 4 ], [ 10, 5 ], [ 10, 6 ], [ 10, 7 ], [ 10, 16 ], [ 10, 17 ], [ 11, 1 ], [ 11, 2 ], [ 11, 3 ], [ 11, 4 ], [ 11, 5 ], [ 11, 6 ], [ 11, 7 ], [ 11, 16 ], [ 11, 17 ], [ 12, 1 ], [ 12, 2 ], [ 12, 3 ], [ 12, 4 ], [ 12, 5 ], [ 12, 6 ], [ 12, 7 ], [ 12, 16 ], [ 12, 17 ], [ 13, 1 ], [ 13, 2 ], [ 13, 3 ], [ 13, 4 ], [ 13, 5 ], [ 13, 6 ], [ 13, 7 ], [ 13, 16 ], [ 13, 17 ], [ 14, 1 ], [ 14, 2 ], [ 14, 3 ], [ 14, 4 ], [ 14, 5 ], [ 14, 6 ], [ 14, 7 ], [ 14, 16 ], [ 14, 17 ], [ 15, 1 ], [ 15, 2 ], [ 15, 3 ], [ 15, 4 ], [ 15, 5 ], [ 15, 6 ], [ 15, 7 ], [ 15, 16 ], [ 15, 17 ], [ 16, 1 ], [ 16, 2 ], [ 16, 3 ], [ 16, 4 ], [ 16, 5 ], [ 16, 6 ], [ 16, 7 ], [ 16, 8 ], [ 16, 9 ], [ 16, 10 ], [ 16, 11 ], [ 16, 12 ], [ 16, 13 ], [ 16, 14 ], [ 16, 15 ], [ 17, 1 ], [ 17, 2 ], [ 17, 3 ], [ 17, 4 ], [ 17, 5 ], [ 17, 6 ], [ 17, 7 ], [ 17, 8 ], [ 17, 9 ], [ 17, 10 ], [ 17, 11 ], [ 17, 12 ], [ 17, 13 ], [ 17, 14 ], [ 17, 15 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/examples.tst:203 # Input is: JohnsonDigraph(0, 4); # Expected output: # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:205 # Input is: JohnsonDigraph(0, 0); # Expected output: # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:207 # Input is: JohnsonDigraph(3, 0); # Expected output: # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:209 # Input is: JohnsonDigraph(1, 0); # Expected output: # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:211 # Input is: gr := JohnsonDigraph(3, 1); # Expected output: # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:213 # Input is: OutNeighbours(gr); # Expected output: [ [ 2, 3 ], [ 1, 3 ], [ 1, 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/examples.tst:215 # Input is: gr := JohnsonDigraph(4, 2); # Expected output: # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:217 # Input is: OutNeighbours(gr); # Expected output: [ [ 2, 3, 4, 5 ], [ 1, 3, 4, 6 ], [ 1, 2, 5, 6 ], [ 1, 2, 5, 6 ], [ 1, 3, 4, 6 ], [ 2, 3, 4, 5 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/examples.tst:220 # Input is: JohnsonDigraph(5, 1) = CompleteDigraph(5); # Expected output: true # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:222 # Input is: JohnsonDigraph(3, -2); # Expected output: Error, the arguments and must be non-negative integers, # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:224 # Input is: JohnsonDigraph(-1, 2); # Expected output: Error, the arguments and must be non-negative integers, # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:226 # Input is: JohnsonDigraph(IsMutableDigraph, 4, 2); # Expected output: # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/examples.tst:230 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/examples.tst msecs: 102 false gap> ########> Diff in standard/grahom.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/grahom.tst:17 # Input is: HomomorphismDigraphsFinder(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); # Expected output: Error, the 1st argument must be a digraph, not integer, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:19 # Input is: gr1 := ChainDigraph(2);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/grahom.tst:20 # Input is: gr2 := CompleteDigraph(3);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:21 # Input is: HomomorphismDigraphsFinder(0, gr2, 0, 0, 0, 0, 0, 0, 0, 0, 0); # Expected output: Error, the 1st argument must be a digraph, not integer, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:23 # Input is: HomomorphismDigraphsFinder(gr1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); # Expected output: Error, the 2nd argument must be a digraph, not integer, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:25 # Input is: HomomorphismDigraphsFinder(gr1, gr2, 0, 0, 0, 0, 0, 0, 0, 0, 0); # Expected output: Error, the 3rd argument must be a function with 2 arguments, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:27 # Input is: HomomorphismDigraphsFinder(gr2, gr1, 0, 0, 0, 0, 0, 0, 0, 0, 0); # Expected output: Error, the 3rd argument must be a function with 2 arguments, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:29 # Input is: gr1 := CompleteDigraph(2);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:30 # Input is: HomomorphismDigraphsFinder(gr1, gr2, 0, 0, 0, 0, 0, 0, 0, 0, 0); # Expected output: Error, the 3rd argument must be a function with 2 arguments, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:32 # Input is: HomomorphismDigraphsFinder(gr1, gr2, IsTournament, 0, 0, 0, 0, 0, 0, 0, 0); # Expected output: Error, the 3rd argument must be a function with 2 arguments, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:34 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, 0, 0, 0, 0, 0, 0, 0, 0); # Expected output: Error, the 3rd argument is fail and so the 4th argument must be a mutab\ \ le list, not integer, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:37 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, "a", "a", 0, 0, 0, 0, 0, 0); # Expected output: Error, the 5th argument must be an integer or infinity, not list\ \ (string), # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:40 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, "a", 1, 0, 0, 0, 0, 0, 0); # Expected output: Error, the 6th argument must be a positive integer, not 0, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:42 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, "a", 5, 1, "b", 0, 0, 0, 0); # Expected output: Error, the 7th argument must be an integer or true or false, not l\ \ ist (string), # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:45 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, "a", infinity, fail, -1, 0, 0, 0, 0); # Expected output: Error, the 7th argument must 0, 1, or 2, not -1, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:48 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, "a", infinity, 2, 1, 0, 0, 0, 0); # Expected output: Error, the 8th argument must be a list or fail, not integer, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:61 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 1, 1, [0, 1], 0, 0, 0); # Expected output: Error, the 8th argument must only contain positive integers, but found\ \ integer in position 1, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:65 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 1, 1, [4, 4], 0, 0, 0); # Expected output: Error, in the 8th argument position 1 is out of range, must be in the \ \ range [1, 3], # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:69 # Input is: HomomorphismDigraphsFinder(gr2, gr1, fail, [], 1, 1, 1, [3], 0, 0, 0); # Expected output: Error, in the 8th argument position 1 is out of range, must be in the \ \ range [1, 2], # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:72 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 1, 1, [3], 0, 0, 0); # Expected output: Error, the 9th argument must be a list or fail, not integer, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:74 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 1, 1, [3], [1 .. 4], 0, 0); # Expected output: Error, the 9th argument is too long, must be at most 2, found 4, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:77 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 1, 1, [], [1, 2, 3, 2], 0, 0); # Expected output: Error, the 9th argument is too long, must be at most 2, found 4, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:80 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 1, 1, [1], [1], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:83 # Input is: HomomorphismDigraphsFinder(CompleteDigraph(2), CompleteDigraph(3), fail, # hook [], # user_param 1, # limit 2, # hint (rank 2) 1, # injective (yes) [1, 2], # only values 1 and 2 in the image [1], # 1 -> 1 fail, # no colours fail); # no colours # Expected output: [ IdentityTransformation ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:95 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 3, 0, [1, 2], [1], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:98 # Input is: HomomorphismDigraphsFinder(gr2, gr1, fail, [], 1, 3, 0, [1, 2], [1], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:101 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 1, 0, [], [], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:104 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 1, 0, [1, 2], [], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:107 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 1, 0, [1, 2], [], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:110 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], 1, 2, 0, [1], [], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:113 # Input is: HomomorphismDigraphsFinder(gr1, gr1, fail, [], 1, 2, 0, [1, 2], [], fail, fail); # Expected output: [ IdentityTransformation ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:116 # Input is: HomomorphismDigraphsFinder(gr1, gr1, fail, [], 1, 2, 0, [1, 2], [], [[1, 2]], fail); # Expected output: Error, the 10th and 11th arguments and must both be lists \ \ or both be fail, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:120 # Input is: HomomorphismDigraphsFinder(gr1, gr1, fail, [], 1, 2, 0, [1, 2], [], fail, [[1, 2]]); # Expected output: Error, the 10th and 11th arguments and must both be lists \ \ or both be fail, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:124 # Input is: HomomorphismDigraphsFinder(gr1, gr1, fail, [], 1, 2, 0, [1, 2], [], [[1, 2]], [[1, 2]]); # Expected output: [ IdentityTransformation ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:127 # Input is: HomomorphismDigraphsFinder(gr1, gr1, fail, [], 1, 2, 0, [1, 2], [], [[1, 2], [2]], [[1, 2]]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2], since it contains the vertex 2 more than once, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:131 # Input is: gr := CompleteDigraph(513);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:132 # Input is: HomomorphismDigraphsFinder(gr, gr, fail, [], 1, fail, 0, [1 .. 513], [], fail, fail); # Expected output: Error, the 1st argument must have at most 512 vertices, found 513, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:135 # Input is: HomomorphismDigraphsFinder(gr1, gr1, fail, [], 1, 2, 0, [1, 2], [], [1, 2], [2, 1]); # Expected output: [ Transformation( [ 2, 1 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:138 # Input is: HomomorphismDigraphsFinder(gr1, gr1, fail, [], 1, 2, 0, [1, 2], [], [1, 2, 3], [2, 1]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 2 consisting of every integer in the range [1 .. m], for some m <= 2; or 2. a list of non-empty disjoint lists whose union is [1 .. 2]. # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:146 # Input is: HomomorphismDigraphsFinder(gr1, gr1, fail, [], 1, 2, 0, [1, 2], [], [1, 3], [2, 1]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2], since it contains the integer 3, which is greater than 2, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:150 # Input is: HomomorphismDigraphsFinder(gr1, gr1, fail, [], 1, 2, 0, [1, 2], [], [1, fail], [2, 1]); # Expected output: Error, the 2nd argument must be a homogeneous list, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:153 # Input is: gr := ChainDigraph(2); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/grahom.tst:155 # Input is: GeneratorsOfEndomorphismMonoid(); # Expected output: Error, at least 1 argument expected, found 0, # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:157 # Input is: GeneratorsOfEndomorphismMonoid(Group(())); # Expected output: Error, the 1st argument must be a digraph, # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:159 # Input is: GeneratorsOfEndomorphismMonoid(gr); # Expected output: [ IdentityTransformation ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:161 # Input is: gr := DigraphTransitiveClosure(CompleteDigraph(2)); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/grahom.tst:163 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/grahom.tst:165 # Input is: GeneratorsOfEndomorphismMonoid(gr); # Expected output: [ Transformation( [ 2, 1 ] ), IdentityTransformation, Transformation( [ 1, 1 ] ) ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:168 # Input is: gr := EmptyDigraph(2); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:170 # Input is: GeneratorsOfEndomorphismMonoid(gr, Group(()), Group((1, 2))); # Expected output: Error, the 2nd argument must be a homogenous list, # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:172 # Input is: gr := EmptyDigraph(2);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:173 # Input is: GeneratorsOfEndomorphismMonoid(gr, Group(())); # Expected output: Error, the 2nd argument must be a homogenous list, # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:175 # Input is: gr := EmptyDigraph(2);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:176 # Input is: GeneratorsOfEndomorphismMonoid(gr, 1); # Expected output: [ Transformation( [ 2, 1 ] ) ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:178 # Input is: gr := EmptyDigraph(2);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:179 # Input is: GeneratorsOfEndomorphismMonoid(gr, 2); # Expected output: [ Transformation( [ 2, 1 ] ), IdentityTransformation ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:181 # Input is: gr := EmptyDigraph(2);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:182 # Input is: GeneratorsOfEndomorphismMonoidAttr(gr);; # Expected output: # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoidAttr' must have a value ######## ########> Diff in standard/grahom.tst:183 # Input is: GeneratorsOfEndomorphismMonoid(gr, 4) = last; # Expected output: true # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:185 # Input is: gens := GeneratorsOfEndomorphismMonoid(gr, 3); # Expected output: [ Transformation( [ 2, 1 ] ), IdentityTransformation, Transformation( [ 1, 1 ] ) ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:188 # Input is: IsFullTransformationSemigroup(Semigroup(gens)); # Expected output: true # But found: Error, Variable: 'gens' must have a value ######## ########> Diff in standard/grahom.tst:190 # Input is: Size(Semigroup(gens)); # Expected output: 4 # But found: Error, Variable: 'gens' must have a value ######## ########> Diff in standard/grahom.tst:192 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:193 # Input is: GeneratorsOfEndomorphismMonoid(gr, [1, 2, 3, 4, 5]); # Expected output: [ IdentityTransformation ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:195 # Input is: GeneratorsOfEndomorphismMonoid(gr); # Expected output: [ Transformation( [ 2, 3, 4, 5, 1 ] ), Transformation( [ 2, 1 ] ), IdentityTransformation ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:198 # Input is: GeneratorsOfEndomorphismMonoid(gr, [1, 1, 1, 2, 2]); # Expected output: [ Transformation( [ 1, 2, 3, 5, 4 ] ), Transformation( [ 1, 3, 2 ] ), Transformation( [ 2, 1 ] ), IdentityTransformation ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:201 # Input is: GeneratorsOfEndomorphismMonoid(gr, [1, 1, 1, 2, 2], 1); # Expected output: [ Transformation( [ 1, 2, 3, 5, 4 ] ), Transformation( [ 1, 3, 2 ] ), Transformation( [ 2, 1 ] ) ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:204 # Input is: GeneratorsOfEndomorphismMonoid(gr, [1, 1, 1, 2, 2], 0); # Expected output: Error, the 3rd argument must be a positive integer or infinity, # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:210 # Input is: gr := Digraph([[], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:212 # Input is: GeneratorsOfEndomorphismMonoid(gr); # Expected output: [ IdentityTransformation, Transformation( [ 2, 2 ] ) ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:216 # Input is: gr := Digraph([[2], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:218 # Input is: GeneratorsOfEndomorphismMonoid(gr); # Expected output: [ IdentityTransformation, Transformation( [ 3, 3, 3 ] ) ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:222 # Input is: gr := Digraph([[2], [1], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:224 # Input is: GeneratorsOfEndomorphismMonoid(gr); # Expected output: [ Transformation( [ 2, 1 ] ), IdentityTransformation, Transformation( [ 3, 3, 3 ] ) ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:229 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:231 # Input is: DigraphColouring(gr, 1); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:233 # Input is: gr := EmptyDigraph(3); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:235 # Input is: DigraphColouring(gr, 4); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:237 # Input is: DigraphColouring(gr, 3); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:239 # Input is: DigraphColouring(gr, 2); # Expected output: Transformation( [ 1, 1, 2 ] ) # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:241 # Input is: DigraphColouring(gr, 1); # Expected output: Transformation( [ 1, 1, 1 ] ) # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:243 # Input is: gr := CompleteDigraph(3); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:245 # Input is: DigraphColouring(gr, 1); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:247 # Input is: DigraphColouring(gr, 2); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:249 # Input is: DigraphColouring(gr, 3); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:251 # Input is: gr := EmptyDigraph(0); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:253 # Input is: DigraphColouring(gr, 1); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:255 # Input is: DigraphColouring(gr, 2); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:257 # Input is: DigraphColouring(gr, 3); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:259 # Input is: gr := EmptyDigraph(1); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:261 # Input is: DigraphColouring(gr, 1); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:263 # Input is: DigraphColouring(gr, 2); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:265 # Input is: gr := Digraph([[1, 2], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:266 # Input is: DigraphColouring(gr, -1); # Expected output: Error, the 2nd argument must be a non-negative integer, # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:268 # Input is: DigraphColouring(NullDigraph(0), 1); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:270 # Input is: DigraphColouring(NullDigraph(0), 0); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:272 # Input is: DigraphColouring(CompleteDigraph(1), 0); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:274 # Input is: DigraphColouring(Digraph([[1]]), 1); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:276 # Input is: gr := DigraphFromDigraph6String(Concatenation( "+l??O?C?A_@???CE????GAAG?C??M?????@_?OO??G??@?IC???_C?G?o??C?AO???c_??A?", "A?S???OAA???OG???G_A??C?@?cC????_@G???S??C_?C???[??A?A?OA?O?@?A?@A???GGO", "??`?_O??G?@?A??G?@AH????AA?O@??_??b???Cg??C???_??W?G????d?G?C@A?C???GC?W", "?????K???__O[??????O?W???O@??_G?@?CG??G?@G?C??@G???_Q?O?O?c???OAO?C??C?G", "?O??A@??D??G?C_?A??O?_GA??@@?_?G???E?IW??????_@G?C??")); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/grahom.tst:283 # Input is: DigraphGreedyColouring(gr); # Expected output: Transformation( [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 2, 2, 3, 3, 2, 3, 3, 3, 2, 1, 4, 4, 2, 3, 3, 3, 3, 3, 1, 3, 4, 4, 3, 2, 1, 4, 3, 1 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:287 # Input is: DigraphColouring(gr, 4); # Expected output: Transformation( [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 2, 2, 3, 3, 2, 3, 3, 3, 2, 1, 4, 4, 2, 3, 3, 3, 3, 3, 1, 3, 4, 4, 3, 2, 1, 4, 3, 1 ] ) # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:291 # Input is: D := Digraph([[4, 6, 8], [], [], [], [7], [2], [], [], [8], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:293 # Input is: DigraphColouring(D, 2); # Expected output: Transformation( [ 1, 1, 1, 2, 1, 2, 2, 2, 1, 1 ] ) # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:295 # Input is: DigraphColouring(Digraph([[1], []]), 2); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:299 # Input is: DigraphGreedyColouring(EmptyDigraph(0)); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:301 # Input is: DigraphGreedyColouring(Digraph([[]])); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:303 # Input is: DigraphGreedyColouring(Digraph([[1]])); # Expected output: fail # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:305 # Input is: DigraphGreedyColouring(CycleDigraph(2)); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:307 # Input is: DigraphGreedyColouring(CycleDigraph(3)); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:309 # Input is: DigraphGreedyColouring(CycleDigraph(4)); # Expected output: Transformation( [ 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:311 # Input is: DigraphGreedyColouring(CycleDigraph(5)); # Expected output: Transformation( [ 1, 2, 1, 2, 3 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:313 # Input is: DigraphGreedyColouring(CycleDigraph(6)); # Expected output: Transformation( [ 1, 2, 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:315 # Input is: DigraphGreedyColouring(CompleteDigraph(10)); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:317 # Input is: gr := CompleteDigraph(4);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:318 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:320 # Input is: DigraphGreedyColouring(gr); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:322 # Input is: HasDigraphGreedyColouring(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:324 # Input is: gr := CycleDigraph(4);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/grahom.tst:325 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:327 # Input is: DigraphGreedyColouring(gr); # Expected output: Transformation( [ 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:329 # Input is: HasDigraphGreedyColouring(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:331 # Input is: DigraphGreedyColouring(ChainDigraph(10));; # Expected output: # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:332 # Input is: DigraphGreedyColouring(CompleteDigraph(10));; # Expected output: # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:333 # Input is: gr := DigraphFromSparse6String( ":]nA?LcB@_EDfEB`GIaHGdJIgEKcLK`?MdCHiFLaBJhFMkJM"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/grahom.tst:336 # Input is: DigraphGreedyColouring(gr);; # Expected output: # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:337 # Input is: DigraphGreedyColouring(EmptyDigraph(0)); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:339 # Input is: DigraphGreedyColouring(gr, [1 .. 10]); # Expected output: Error, the 2nd argument must be a permutation of [1 .. 30] # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:341 # Input is: DigraphGreedyColouring(gr, [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, -1]); # Expected output: Error, the 2nd argument must be a permutation of [1 .. 30] # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:344 # Input is: DigraphGreedyColouring(gr, [1 .. 30]); # Expected output: Transformation( [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:347 # Input is: D := Digraph([[3, 4, 6, 8], [4, 6, 7, 8, 10], [2, 6, 7, 8, 9], [3, 5, 7], [1, 2, 3, 6, 9], [2, 6, 8, 10], [7], [1, 10], [2, 7, 8], [1, 2, 6, 8, 10]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:349 # Input is: DigraphHasLoops(D); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/grahom.tst:351 # Input is: DigraphGreedyColouring(D); # Expected output: fail # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:353 # Input is: DigraphColouring(D, 3); # Expected output: fail # But found: Error, Variable: 'DigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:355 # Input is: D := Digraph([[3], [], [2]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:356 # Input is: DigraphGreedyColouring(D, [1 .. 3]); # Expected output: Transformation( [ 1, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:360 # Input is: DigraphGreedyColouring(EmptyDigraph(0), DigraphWelshPowellOrder); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:362 # Input is: DigraphGreedyColouring(Digraph([[]]), DigraphWelshPowellOrder); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:364 # Input is: DigraphGreedyColouring(Digraph([[1]]), DigraphWelshPowellOrder); # Expected output: fail # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:366 # Input is: DigraphGreedyColouring(CycleDigraph(2), DigraphWelshPowellOrder); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:368 # Input is: DigraphGreedyColouring(CycleDigraph(3), DigraphWelshPowellOrder); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:370 # Input is: DigraphGreedyColouring(CycleDigraph(4), DigraphWelshPowellOrder); # Expected output: Transformation( [ 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:372 # Input is: DigraphGreedyColouring(CycleDigraph(5), DigraphWelshPowellOrder); # Expected output: Transformation( [ 1, 2, 1, 2, 3 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:374 # Input is: DigraphGreedyColouring(CycleDigraph(6), DigraphWelshPowellOrder); # Expected output: Transformation( [ 1, 2, 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:376 # Input is: DigraphGreedyColouring(CompleteDigraph(10), DigraphWelshPowellOrder); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:378 # Input is: gr := CompleteDigraph(4);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:379 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:381 # Input is: DigraphGreedyColouring(gr, DigraphWelshPowellOrder); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:383 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:385 # Input is: gr := CycleDigraph(4);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/grahom.tst:386 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:388 # Input is: DigraphGreedyColouring(gr, DigraphWelshPowellOrder); # Expected output: Transformation( [ 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:390 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:392 # Input is: DigraphGreedyColouring(ChainDigraph(10), DigraphWelshPowellOrder); # Expected output: Transformation( [ 2, 1, 2, 1, 2, 1, 2, 1, 2, 1 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:394 # Input is: DigraphGreedyColouring(CompleteDigraph(10), DigraphWelshPowellOrder); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:396 # Input is: gr := DigraphFromSparse6String( ":]nA?LcB@_EDfEB`GIaHGdJIgEKcLK`?MdCHiFLaBJhFMkJM"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/grahom.tst:399 # Input is: DigraphGreedyColouring(gr, DigraphWelshPowellOrder); # Expected output: Transformation( [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:402 # Input is: DigraphGreedyColouring(EmptyDigraph(0)); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:406 # Input is: order_func := D -> [1 .. DigraphNrVertices(D)];; # Expected output: # But found: Syntax warning: Unbound global variable in stream:1 order_func := D -> [1 .. DigraphNrVertices(D)];; ^^^^^^^^^^^^^^^^^ ######## ########> Diff in standard/grahom.tst:407 # Input is: DigraphGreedyColouring(EmptyDigraph(0), order_func); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:409 # Input is: DigraphGreedyColouring(Digraph([[]]), order_func); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:411 # Input is: DigraphGreedyColouring(Digraph([[1]]), order_func); # Expected output: fail # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:413 # Input is: DigraphGreedyColouring(CycleDigraph(2), order_func); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:415 # Input is: DigraphGreedyColouring(CycleDigraph(3), order_func); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:417 # Input is: DigraphGreedyColouring(CycleDigraph(4), order_func); # Expected output: Transformation( [ 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:419 # Input is: DigraphGreedyColouring(CycleDigraph(5), order_func); # Expected output: Transformation( [ 1, 2, 1, 2, 3 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:421 # Input is: DigraphGreedyColouring(CycleDigraph(6), order_func); # Expected output: Transformation( [ 1, 2, 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:423 # Input is: DigraphGreedyColouring(CompleteDigraph(10), order_func); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:425 # Input is: gr := CompleteDigraph(4);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:426 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:428 # Input is: DigraphGreedyColouring(gr, order_func); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:430 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:432 # Input is: gr := CycleDigraph(4);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/grahom.tst:433 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:435 # Input is: DigraphGreedyColouring(gr, order_func); # Expected output: Transformation( [ 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:437 # Input is: HasDigraphGreedyColouring(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:439 # Input is: DigraphGreedyColouring(ChainDigraph(10), order_func); # Expected output: Transformation( [ 1, 2, 1, 2, 1, 2, 1, 2, 1, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:441 # Input is: DigraphGreedyColouring(CompleteDigraph(10), order_func); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:443 # Input is: gr := DigraphFromSparse6String( ":]nA?LcB@_EDfEB`GIaHGdJIgEKcLK`?MdCHiFLaBJhFMkJM"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/grahom.tst:446 # Input is: DigraphGreedyColouring(gr, order_func); # Expected output: Transformation( [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ] ) # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:449 # Input is: DigraphGreedyColouring(EmptyDigraph(0)); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphGreedyColouring' must have a value ######## ########> Diff in standard/grahom.tst:453 # Input is: gr := Digraph([[2, 3], [], [], [5], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:454 # Input is: gr := DigraphSymmetricClosure(gr);; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/grahom.tst:456 # Input is: HomomorphismDigraphsFinder(gr, gr, fail, x, infinity, fail, 0, [1 .. 6], [], fail, fail); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 3, 4, 5, 1 ] ), Transformation( [ 1, 2, 3, 4, 5, 2 ] ), Transformation( [ 1, 2, 3, 4, 5, 3 ] ), Transformation( [ 1, 2, 3, 4, 5, 4 ] ), Transformation( [ 1, 2, 3, 4, 5, 5 ] ), Transformation( [ 1, 2, 3, 1, 2, 4 ] ), Transformation( [ 1, 2, 3, 1, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 1 ] ), Transformation( [ 1, 2, 3, 1, 2, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 4 ] ), Transformation( [ 1, 2, 3, 1, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 1 ] ), Transformation( [ 1, 2, 3, 1, 3, 2 ] ), Transformation( [ 1, 2, 3, 1, 3, 3 ] ), Transformation( [ 1, 2, 3, 2, 1, 4 ] ), Transformation( [ 1, 2, 3, 2, 1 ] ), Transformation( [ 1, 2, 3, 2, 1, 1 ] ), Transformation( [ 1, 2, 3, 2, 1, 2 ] ), Transformation( [ 1, 2, 3, 2, 1, 3 ] ), Transformation( [ 1, 2, 3, 3, 1, 4 ] ), Transformation( [ 1, 2, 3, 3, 1 ] ), Transformation( [ 1, 2, 3, 3, 1, 1 ] ), Transformation( [ 1, 2, 3, 3, 1, 2 ] ), Transformation( [ 1, 2, 3, 3, 1, 3 ] ), Transformation( [ 1, 2, 2, 3, 1, 4 ] ), Transformation( [ 1, 2, 2, 3, 1 ] ), Transformation( [ 1, 2, 2, 3, 1, 1 ] ), Transformation( [ 1, 2, 2, 3, 1, 2 ] ), Transformation( [ 1, 2, 2, 3, 1, 3 ] ), Transformation( [ 1, 2, 2, 4, 5, 3 ] ), Transformation( [ 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 1 ] ), Transformation( [ 1, 2, 2, 4, 5, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 4 ] ), Transformation( [ 1, 2, 2, 4, 5, 5 ] ), Transformation( [ 1, 2, 2, 1, 3, 4 ] ), Transformation( [ 1, 2, 2, 1, 3 ] ), Transformation( [ 1, 2, 2, 1, 3, 1 ] ), Transformation( [ 1, 2, 2, 1, 3, 2 ] ), Transformation( [ 1, 2, 2, 1, 3, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 4 ] ), Transformation( [ 1, 2, 2, 1, 2 ] ), Transformation( [ 1, 2, 2, 1, 2, 1 ] ), Transformation( [ 1, 2, 2, 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 2, 1, 3 ] ), Transformation( [ 1, 2, 2, 2, 1, 4 ] ), Transformation( [ 1, 2, 2, 2, 1 ] ), Transformation( [ 1, 2, 2, 2, 1, 1 ] ), Transformation( [ 1, 2, 2, 2, 1, 2 ] ), Transformation( [ 2, 1, 1, 3, 1, 4 ] ), Transformation( [ 2, 1, 1, 3, 1 ] ), Transformation( [ 2, 1, 1, 3, 1, 1 ] ), Transformation( [ 2, 1, 1, 3, 1, 2 ] ), Transformation( [ 2, 1, 1, 3, 1, 3 ] ), Transformation( [ 2, 1, 1, 4, 5, 3 ] ), Transformation( [ 2, 1, 1 ] ), Transformation( [ 2, 1, 1, 4, 5, 1 ] ), Transformation( [ 2, 1, 1, 4, 5, 2 ] ), Transformation( [ 2, 1, 1, 4, 5, 4 ] ), Transformation( [ 2, 1, 1, 4, 5, 5 ] ), Transformation( [ 2, 1, 1, 1, 3, 4 ] ), Transformation( [ 2, 1, 1, 1, 3 ] ), Transformation( [ 2, 1, 1, 1, 3, 1 ] ), Transformation( [ 2, 1, 1, 1, 3, 2 ] ), Transformation( [ 2, 1, 1, 1, 3, 3 ] ), Transformation( [ 2, 1, 1, 1, 2, 3 ] ), Transformation( [ 2, 1, 1, 1, 2, 4 ] ), Transformation( [ 2, 1, 1, 1, 2 ] ), Transformation( [ 2, 1, 1, 1, 2, 1 ] ), Transformation( [ 2, 1, 1, 1, 2, 2 ] ), Transformation( [ 2, 1, 1, 2, 1, 3 ] ), Transformation( [ 2, 1, 1, 2, 1, 4 ] ), Transformation( [ 2, 1, 1, 2, 1 ] ), Transformation( [ 2, 1, 1, 2, 1, 1 ] ), Transformation( [ 2, 1, 1, 2, 1, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 3 ] ), Transformation( [ 4, 5, 5, 1, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 1 ] ), Transformation( [ 4, 5, 5, 1, 2, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 4 ] ), Transformation( [ 4, 5, 5, 1, 2, 5 ] ), Transformation( [ 4, 5, 5, 2, 1, 3 ] ), Transformation( [ 4, 5, 5, 2, 1 ] ), Transformation( [ 4, 5, 5, 2, 1, 1 ] ), Transformation( [ 4, 5, 5, 2, 1, 2 ] ), Transformation( [ 4, 5, 5, 2, 1, 4 ] ), Transformation( [ 4, 5, 5, 2, 1, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 1 ] ), Transformation( [ 4, 5, 5, 4, 5, 2 ] ), Transformation( [ 4, 5, 5, 4, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 4 ] ), Transformation( [ 4, 5, 5, 4, 5, 5 ] ), Transformation( [ 4, 5, 5, 5, 4, 1 ] ), Transformation( [ 4, 5, 5, 5, 4, 2 ] ), Transformation( [ 4, 5, 5, 5, 4 ] ), Transformation( [ 4, 5, 5, 5, 4, 4 ] ), Transformation( [ 4, 5, 5, 5, 4, 5 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:539 # Input is: Length(x); # Expected output: 100 # But found: 0 ######## ########> Diff in standard/grahom.tst:541 # Input is: HomomorphismDigraphsFinder(gr, gr, fail, x, infinity, fail, 0, [1 .. 6], [], fail, fail); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 3, 4, 5, 1 ] ), Transformation( [ 1, 2, 3, 4, 5, 2 ] ), Transformation( [ 1, 2, 3, 4, 5, 3 ] ), Transformation( [ 1, 2, 3, 4, 5, 4 ] ), Transformation( [ 1, 2, 3, 4, 5, 5 ] ), Transformation( [ 1, 2, 3, 1, 2, 4 ] ), Transformation( [ 1, 2, 3, 1, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 1 ] ), Transformation( [ 1, 2, 3, 1, 2, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 4 ] ), Transformation( [ 1, 2, 3, 1, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 1 ] ), Transformation( [ 1, 2, 3, 1, 3, 2 ] ), Transformation( [ 1, 2, 3, 1, 3, 3 ] ), Transformation( [ 1, 2, 3, 2, 1, 4 ] ), Transformation( [ 1, 2, 3, 2, 1 ] ), Transformation( [ 1, 2, 3, 2, 1, 1 ] ), Transformation( [ 1, 2, 3, 2, 1, 2 ] ), Transformation( [ 1, 2, 3, 2, 1, 3 ] ), Transformation( [ 1, 2, 3, 3, 1, 4 ] ), Transformation( [ 1, 2, 3, 3, 1 ] ), Transformation( [ 1, 2, 3, 3, 1, 1 ] ), Transformation( [ 1, 2, 3, 3, 1, 2 ] ), Transformation( [ 1, 2, 3, 3, 1, 3 ] ), Transformation( [ 1, 2, 2, 3, 1, 4 ] ), Transformation( [ 1, 2, 2, 3, 1 ] ), Transformation( [ 1, 2, 2, 3, 1, 1 ] ), Transformation( [ 1, 2, 2, 3, 1, 2 ] ), Transformation( [ 1, 2, 2, 3, 1, 3 ] ), Transformation( [ 1, 2, 2, 4, 5, 3 ] ), Transformation( [ 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 1 ] ), Transformation( [ 1, 2, 2, 4, 5, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 4 ] ), Transformation( [ 1, 2, 2, 4, 5, 5 ] ), Transformation( [ 1, 2, 2, 1, 3, 4 ] ), Transformation( [ 1, 2, 2, 1, 3 ] ), Transformation( [ 1, 2, 2, 1, 3, 1 ] ), Transformation( [ 1, 2, 2, 1, 3, 2 ] ), Transformation( [ 1, 2, 2, 1, 3, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 4 ] ), Transformation( [ 1, 2, 2, 1, 2 ] ), Transformation( [ 1, 2, 2, 1, 2, 1 ] ), Transformation( [ 1, 2, 2, 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 2, 1, 3 ] ), Transformation( [ 1, 2, 2, 2, 1, 4 ] ), Transformation( [ 1, 2, 2, 2, 1 ] ), Transformation( [ 1, 2, 2, 2, 1, 1 ] ), Transformation( [ 1, 2, 2, 2, 1, 2 ] ), Transformation( [ 2, 1, 1, 3, 1, 4 ] ), Transformation( [ 2, 1, 1, 3, 1 ] ), Transformation( [ 2, 1, 1, 3, 1, 1 ] ), Transformation( [ 2, 1, 1, 3, 1, 2 ] ), Transformation( [ 2, 1, 1, 3, 1, 3 ] ), Transformation( [ 2, 1, 1, 4, 5, 3 ] ), Transformation( [ 2, 1, 1 ] ), Transformation( [ 2, 1, 1, 4, 5, 1 ] ), Transformation( [ 2, 1, 1, 4, 5, 2 ] ), Transformation( [ 2, 1, 1, 4, 5, 4 ] ), Transformation( [ 2, 1, 1, 4, 5, 5 ] ), Transformation( [ 2, 1, 1, 1, 3, 4 ] ), Transformation( [ 2, 1, 1, 1, 3 ] ), Transformation( [ 2, 1, 1, 1, 3, 1 ] ), Transformation( [ 2, 1, 1, 1, 3, 2 ] ), Transformation( [ 2, 1, 1, 1, 3, 3 ] ), Transformation( [ 2, 1, 1, 1, 2, 3 ] ), Transformation( [ 2, 1, 1, 1, 2, 4 ] ), Transformation( [ 2, 1, 1, 1, 2 ] ), Transformation( [ 2, 1, 1, 1, 2, 1 ] ), Transformation( [ 2, 1, 1, 1, 2, 2 ] ), Transformation( [ 2, 1, 1, 2, 1, 3 ] ), Transformation( [ 2, 1, 1, 2, 1, 4 ] ), Transformation( [ 2, 1, 1, 2, 1 ] ), Transformation( [ 2, 1, 1, 2, 1, 1 ] ), Transformation( [ 2, 1, 1, 2, 1, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 3 ] ), Transformation( [ 4, 5, 5, 1, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 1 ] ), Transformation( [ 4, 5, 5, 1, 2, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 4 ] ), Transformation( [ 4, 5, 5, 1, 2, 5 ] ), Transformation( [ 4, 5, 5, 2, 1, 3 ] ), Transformation( [ 4, 5, 5, 2, 1 ] ), Transformation( [ 4, 5, 5, 2, 1, 1 ] ), Transformation( [ 4, 5, 5, 2, 1, 2 ] ), Transformation( [ 4, 5, 5, 2, 1, 4 ] ), Transformation( [ 4, 5, 5, 2, 1, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 1 ] ), Transformation( [ 4, 5, 5, 4, 5, 2 ] ), Transformation( [ 4, 5, 5, 4, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 4 ] ), Transformation( [ 4, 5, 5, 4, 5, 5 ] ), Transformation( [ 4, 5, 5, 5, 4, 1 ] ), Transformation( [ 4, 5, 5, 5, 4, 2 ] ), Transformation( [ 4, 5, 5, 5, 4 ] ), Transformation( [ 4, 5, 5, 5, 4, 4 ] ), Transformation( [ 4, 5, 5, 5, 4, 5 ] ), IdentityTransformation, Transformation( [ 1, 2, 3, 4, 5, 1 ] ), Transformation( [ 1, 2, 3, 4, 5, 2 ] ), Transformation( [ 1, 2, 3, 4, 5, 3 ] ), Transformation( [ 1, 2, 3, 4, 5, 4 ] ), Transformation( [ 1, 2, 3, 4, 5, 5 ] ), Transformation( [ 1, 2, 3, 1, 2, 4 ] ), Transformation( [ 1, 2, 3, 1, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 1 ] ), Transformation( [ 1, 2, 3, 1, 2, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 4 ] ), Transformation( [ 1, 2, 3, 1, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 1 ] ), Transformation( [ 1, 2, 3, 1, 3, 2 ] ), Transformation( [ 1, 2, 3, 1, 3, 3 ] ), Transformation( [ 1, 2, 3, 2, 1, 4 ] ), Transformation( [ 1, 2, 3, 2, 1 ] ), Transformation( [ 1, 2, 3, 2, 1, 1 ] ), Transformation( [ 1, 2, 3, 2, 1, 2 ] ), Transformation( [ 1, 2, 3, 2, 1, 3 ] ), Transformation( [ 1, 2, 3, 3, 1, 4 ] ), Transformation( [ 1, 2, 3, 3, 1 ] ), Transformation( [ 1, 2, 3, 3, 1, 1 ] ), Transformation( [ 1, 2, 3, 3, 1, 2 ] ), Transformation( [ 1, 2, 3, 3, 1, 3 ] ), Transformation( [ 1, 2, 2, 3, 1, 4 ] ), Transformation( [ 1, 2, 2, 3, 1 ] ), Transformation( [ 1, 2, 2, 3, 1, 1 ] ), Transformation( [ 1, 2, 2, 3, 1, 2 ] ), Transformation( [ 1, 2, 2, 3, 1, 3 ] ), Transformation( [ 1, 2, 2, 4, 5, 3 ] ), Transformation( [ 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 1 ] ), Transformation( [ 1, 2, 2, 4, 5, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 4 ] ), Transformation( [ 1, 2, 2, 4, 5, 5 ] ), Transformation( [ 1, 2, 2, 1, 3, 4 ] ), Transformation( [ 1, 2, 2, 1, 3 ] ), Transformation( [ 1, 2, 2, 1, 3, 1 ] ), Transformation( [ 1, 2, 2, 1, 3, 2 ] ), Transformation( [ 1, 2, 2, 1, 3, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 4 ] ), Transformation( [ 1, 2, 2, 1, 2 ] ), Transformation( [ 1, 2, 2, 1, 2, 1 ] ), Transformation( [ 1, 2, 2, 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 2, 1, 3 ] ), Transformation( [ 1, 2, 2, 2, 1, 4 ] ), Transformation( [ 1, 2, 2, 2, 1 ] ), Transformation( [ 1, 2, 2, 2, 1, 1 ] ), Transformation( [ 1, 2, 2, 2, 1, 2 ] ), Transformation( [ 2, 1, 1, 3, 1, 4 ] ), Transformation( [ 2, 1, 1, 3, 1 ] ), Transformation( [ 2, 1, 1, 3, 1, 1 ] ), Transformation( [ 2, 1, 1, 3, 1, 2 ] ), Transformation( [ 2, 1, 1, 3, 1, 3 ] ), Transformation( [ 2, 1, 1, 4, 5, 3 ] ), Transformation( [ 2, 1, 1 ] ), Transformation( [ 2, 1, 1, 4, 5, 1 ] ), Transformation( [ 2, 1, 1, 4, 5, 2 ] ), Transformation( [ 2, 1, 1, 4, 5, 4 ] ), Transformation( [ 2, 1, 1, 4, 5, 5 ] ), Transformation( [ 2, 1, 1, 1, 3, 4 ] ), Transformation( [ 2, 1, 1, 1, 3 ] ), Transformation( [ 2, 1, 1, 1, 3, 1 ] ), Transformation( [ 2, 1, 1, 1, 3, 2 ] ), Transformation( [ 2, 1, 1, 1, 3, 3 ] ), Transformation( [ 2, 1, 1, 1, 2, 3 ] ), Transformation( [ 2, 1, 1, 1, 2, 4 ] ), Transformation( [ 2, 1, 1, 1, 2 ] ), Transformation( [ 2, 1, 1, 1, 2, 1 ] ), Transformation( [ 2, 1, 1, 1, 2, 2 ] ), Transformation( [ 2, 1, 1, 2, 1, 3 ] ), Transformation( [ 2, 1, 1, 2, 1, 4 ] ), Transformation( [ 2, 1, 1, 2, 1 ] ), Transformation( [ 2, 1, 1, 2, 1, 1 ] ), Transformation( [ 2, 1, 1, 2, 1, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 3 ] ), Transformation( [ 4, 5, 5, 1, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 1 ] ), Transformation( [ 4, 5, 5, 1, 2, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 4 ] ), Transformation( [ 4, 5, 5, 1, 2, 5 ] ), Transformation( [ 4, 5, 5, 2, 1, 3 ] ), Transformation( [ 4, 5, 5, 2, 1 ] ), Transformation( [ 4, 5, 5, 2, 1, 1 ] ), Transformation( [ 4, 5, 5, 2, 1, 2 ] ), Transformation( [ 4, 5, 5, 2, 1, 4 ] ), Transformation( [ 4, 5, 5, 2, 1, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 1 ] ), Transformation( [ 4, 5, 5, 4, 5, 2 ] ), Transformation( [ 4, 5, 5, 4, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 4 ] ), Transformation( [ 4, 5, 5, 4, 5, 5 ] ), Transformation( [ 4, 5, 5, 5, 4, 1 ] ), Transformation( [ 4, 5, 5, 5, 4, 2 ] ), Transformation( [ 4, 5, 5, 5, 4 ] ), Transformation( [ 4, 5, 5, 5, 4, 4 ] ), Transformation( [ 4, 5, 5, 5, 4, 5 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:705 # Input is: Length(x); # Expected output: 200 # But found: 0 ######## ########> Diff in standard/grahom.tst:707 # Input is: x{[1 .. 100]} = x{[101 .. 200]}; # Expected output: true # But found: Error, List Elements: [1] must have an assigned value ######## ########> Diff in standard/grahom.tst:711 # Input is: gr := Digraph([[2, 3], [], [], [5], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:713 # Input is: HomomorphismDigraphsFinder(gr, gr, fail, [], infinity, fail, 0, [1 .. 5], [], fail, fail); # Expected output: [ Transformation( [ 1, 2, 3, 4, 5, 1 ] ), Transformation( [ 1, 2, 3, 4, 5, 2 ] ), Transformation( [ 1, 2, 3, 4, 5, 3 ] ), Transformation( [ 1, 2, 3, 4, 5, 4 ] ), Transformation( [ 1, 2, 3, 4, 5, 5 ] ), Transformation( [ 1, 2, 3, 1, 2, 4 ] ), Transformation( [ 1, 2, 3, 1, 2, 5 ] ), Transformation( [ 1, 2, 3, 1, 2, 1 ] ), Transformation( [ 1, 2, 3, 1, 2, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 4 ] ), Transformation( [ 1, 2, 3, 1, 3, 5 ] ), Transformation( [ 1, 2, 3, 1, 3, 1 ] ), Transformation( [ 1, 2, 3, 1, 3, 2 ] ), Transformation( [ 1, 2, 3, 1, 3, 3 ] ), Transformation( [ 1, 2, 2, 4, 5, 3 ] ), Transformation( [ 1, 2, 2, 4, 5, 1 ] ), Transformation( [ 1, 2, 2, 4, 5, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 4 ] ), Transformation( [ 1, 2, 2, 4, 5, 5 ] ), Transformation( [ 1, 2, 2, 1, 3, 4 ] ), Transformation( [ 1, 2, 2, 1, 3, 5 ] ), Transformation( [ 1, 2, 2, 1, 3, 1 ] ), Transformation( [ 1, 2, 2, 1, 3, 2 ] ), Transformation( [ 1, 2, 2, 1, 3, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 4 ] ), Transformation( [ 1, 2, 2, 1, 2, 5 ] ), Transformation( [ 1, 2, 2, 1, 2, 1 ] ), Transformation( [ 1, 2, 2, 1, 2, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 3 ] ), Transformation( [ 4, 5, 5, 1, 2, 1 ] ), Transformation( [ 4, 5, 5, 1, 2, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 4 ] ), Transformation( [ 4, 5, 5, 1, 2, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 1 ] ), Transformation( [ 4, 5, 5, 4, 5, 2 ] ), Transformation( [ 4, 5, 5, 4, 5, 4 ] ), Transformation( [ 4, 5, 5, 4, 5, 5 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:754 # Input is: Length(last); # Expected output: 39 # But found: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `Length' on 1 arguments ######## ########> Diff in standard/grahom.tst:758 # Input is: gr := Digraph([[2, 3], [], [], [5], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:760 # Input is: HomomorphismDigraphsFinder(gr, gr, fail, [], infinity, fail, 0, [1 .. 6], [], fail, fail); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 3, 4, 5, 1 ] ), Transformation( [ 1, 2, 3, 4, 5, 2 ] ), Transformation( [ 1, 2, 3, 4, 5, 3 ] ), Transformation( [ 1, 2, 3, 4, 5, 4 ] ), Transformation( [ 1, 2, 3, 4, 5, 5 ] ), Transformation( [ 1, 2, 3, 1, 2, 4 ] ), Transformation( [ 1, 2, 3, 1, 2, 5 ] ), Transformation( [ 1, 2, 3, 1, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 1 ] ), Transformation( [ 1, 2, 3, 1, 2, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 4 ] ), Transformation( [ 1, 2, 3, 1, 3, 5 ] ), Transformation( [ 1, 2, 3, 1, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 1 ] ), Transformation( [ 1, 2, 3, 1, 3, 2 ] ), Transformation( [ 1, 2, 3, 1, 3, 3 ] ), Transformation( [ 1, 2, 2, 4, 5, 3 ] ), Transformation( [ 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 1 ] ), Transformation( [ 1, 2, 2, 4, 5, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 4 ] ), Transformation( [ 1, 2, 2, 4, 5, 5 ] ), Transformation( [ 1, 2, 2, 1, 3, 4 ] ), Transformation( [ 1, 2, 2, 1, 3, 5 ] ), Transformation( [ 1, 2, 2, 1, 3 ] ), Transformation( [ 1, 2, 2, 1, 3, 1 ] ), Transformation( [ 1, 2, 2, 1, 3, 2 ] ), Transformation( [ 1, 2, 2, 1, 3, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 4 ] ), Transformation( [ 1, 2, 2, 1, 2, 5 ] ), Transformation( [ 1, 2, 2, 1, 2 ] ), Transformation( [ 1, 2, 2, 1, 2, 1 ] ), Transformation( [ 1, 2, 2, 1, 2, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 3 ] ), Transformation( [ 4, 5, 5, 1, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 1 ] ), Transformation( [ 4, 5, 5, 1, 2, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 4 ] ), Transformation( [ 4, 5, 5, 1, 2, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 1 ] ), Transformation( [ 4, 5, 5, 4, 5, 2 ] ), Transformation( [ 4, 5, 5, 4, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 4 ] ), Transformation( [ 4, 5, 5, 4, 5, 5 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:801 # Input is: Length(last); # Expected output: 47 # But found: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `Length' on 1 arguments ######## ########> Diff in standard/grahom.tst:805 # Input is: gr := Digraph([[2, 3], [], [], [5], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:807 # Input is: gr := DigraphSymmetricClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/grahom.tst:809 # Input is: HomomorphismDigraphsFinder(gr, gr, fail, [], infinity, fail, 0, [1 .. 6], [], fail, fail); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 3, 4, 5, 1 ] ), Transformation( [ 1, 2, 3, 4, 5, 2 ] ), Transformation( [ 1, 2, 3, 4, 5, 3 ] ), Transformation( [ 1, 2, 3, 4, 5, 4 ] ), Transformation( [ 1, 2, 3, 4, 5, 5 ] ), Transformation( [ 1, 2, 3, 1, 2, 4 ] ), Transformation( [ 1, 2, 3, 1, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 1 ] ), Transformation( [ 1, 2, 3, 1, 2, 2 ] ), Transformation( [ 1, 2, 3, 1, 2, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 4 ] ), Transformation( [ 1, 2, 3, 1, 3 ] ), Transformation( [ 1, 2, 3, 1, 3, 1 ] ), Transformation( [ 1, 2, 3, 1, 3, 2 ] ), Transformation( [ 1, 2, 3, 1, 3, 3 ] ), Transformation( [ 1, 2, 3, 2, 1, 4 ] ), Transformation( [ 1, 2, 3, 2, 1 ] ), Transformation( [ 1, 2, 3, 2, 1, 1 ] ), Transformation( [ 1, 2, 3, 2, 1, 2 ] ), Transformation( [ 1, 2, 3, 2, 1, 3 ] ), Transformation( [ 1, 2, 3, 3, 1, 4 ] ), Transformation( [ 1, 2, 3, 3, 1 ] ), Transformation( [ 1, 2, 3, 3, 1, 1 ] ), Transformation( [ 1, 2, 3, 3, 1, 2 ] ), Transformation( [ 1, 2, 3, 3, 1, 3 ] ), Transformation( [ 1, 2, 2, 3, 1, 4 ] ), Transformation( [ 1, 2, 2, 3, 1 ] ), Transformation( [ 1, 2, 2, 3, 1, 1 ] ), Transformation( [ 1, 2, 2, 3, 1, 2 ] ), Transformation( [ 1, 2, 2, 3, 1, 3 ] ), Transformation( [ 1, 2, 2, 4, 5, 3 ] ), Transformation( [ 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 1 ] ), Transformation( [ 1, 2, 2, 4, 5, 2 ] ), Transformation( [ 1, 2, 2, 4, 5, 4 ] ), Transformation( [ 1, 2, 2, 4, 5, 5 ] ), Transformation( [ 1, 2, 2, 1, 3, 4 ] ), Transformation( [ 1, 2, 2, 1, 3 ] ), Transformation( [ 1, 2, 2, 1, 3, 1 ] ), Transformation( [ 1, 2, 2, 1, 3, 2 ] ), Transformation( [ 1, 2, 2, 1, 3, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 3 ] ), Transformation( [ 1, 2, 2, 1, 2, 4 ] ), Transformation( [ 1, 2, 2, 1, 2 ] ), Transformation( [ 1, 2, 2, 1, 2, 1 ] ), Transformation( [ 1, 2, 2, 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 2, 1, 3 ] ), Transformation( [ 1, 2, 2, 2, 1, 4 ] ), Transformation( [ 1, 2, 2, 2, 1 ] ), Transformation( [ 1, 2, 2, 2, 1, 1 ] ), Transformation( [ 1, 2, 2, 2, 1, 2 ] ), Transformation( [ 2, 1, 1, 3, 1, 4 ] ), Transformation( [ 2, 1, 1, 3, 1 ] ), Transformation( [ 2, 1, 1, 3, 1, 1 ] ), Transformation( [ 2, 1, 1, 3, 1, 2 ] ), Transformation( [ 2, 1, 1, 3, 1, 3 ] ), Transformation( [ 2, 1, 1, 4, 5, 3 ] ), Transformation( [ 2, 1, 1 ] ), Transformation( [ 2, 1, 1, 4, 5, 1 ] ), Transformation( [ 2, 1, 1, 4, 5, 2 ] ), Transformation( [ 2, 1, 1, 4, 5, 4 ] ), Transformation( [ 2, 1, 1, 4, 5, 5 ] ), Transformation( [ 2, 1, 1, 1, 3, 4 ] ), Transformation( [ 2, 1, 1, 1, 3 ] ), Transformation( [ 2, 1, 1, 1, 3, 1 ] ), Transformation( [ 2, 1, 1, 1, 3, 2 ] ), Transformation( [ 2, 1, 1, 1, 3, 3 ] ), Transformation( [ 2, 1, 1, 1, 2, 3 ] ), Transformation( [ 2, 1, 1, 1, 2, 4 ] ), Transformation( [ 2, 1, 1, 1, 2 ] ), Transformation( [ 2, 1, 1, 1, 2, 1 ] ), Transformation( [ 2, 1, 1, 1, 2, 2 ] ), Transformation( [ 2, 1, 1, 2, 1, 3 ] ), Transformation( [ 2, 1, 1, 2, 1, 4 ] ), Transformation( [ 2, 1, 1, 2, 1 ] ), Transformation( [ 2, 1, 1, 2, 1, 1 ] ), Transformation( [ 2, 1, 1, 2, 1, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 3 ] ), Transformation( [ 4, 5, 5, 1, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 1 ] ), Transformation( [ 4, 5, 5, 1, 2, 2 ] ), Transformation( [ 4, 5, 5, 1, 2, 4 ] ), Transformation( [ 4, 5, 5, 1, 2, 5 ] ), Transformation( [ 4, 5, 5, 2, 1, 3 ] ), Transformation( [ 4, 5, 5, 2, 1 ] ), Transformation( [ 4, 5, 5, 2, 1, 1 ] ), Transformation( [ 4, 5, 5, 2, 1, 2 ] ), Transformation( [ 4, 5, 5, 2, 1, 4 ] ), Transformation( [ 4, 5, 5, 2, 1, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 1 ] ), Transformation( [ 4, 5, 5, 4, 5, 2 ] ), Transformation( [ 4, 5, 5, 4, 5 ] ), Transformation( [ 4, 5, 5, 4, 5, 4 ] ), Transformation( [ 4, 5, 5, 4, 5, 5 ] ), Transformation( [ 4, 5, 5, 5, 4, 1 ] ), Transformation( [ 4, 5, 5, 5, 4, 2 ] ), Transformation( [ 4, 5, 5, 5, 4 ] ), Transformation( [ 4, 5, 5, 5, 4, 4 ] ), Transformation( [ 4, 5, 5, 5, 4, 5 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:892 # Input is: Length(last); # Expected output: 100 # But found: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `Length' on 1 arguments ######## ########> Diff in standard/grahom.tst:896 # Input is: gr1 := Digraph([[], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:897 # Input is: gr1 := DigraphSymmetricClosure(gr1);; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/grahom.tst:898 # Input is: gr2 := Digraph([[], [1], [1, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:899 # Input is: gr2 := DigraphSymmetricClosure(gr2);; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/grahom.tst:900 # Input is: HomomorphismDigraphsFinder(gr1, gr2, fail, [], infinity, fail, 1, [1, 2, 3], [], fail, fail); # Expected output: [ IdentityTransformation, Transformation( [ 1, 3, 3 ] ), Transformation( [ 2, 1 ] ), Transformation( [ 3, 1, 3 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:906 # Input is: HomomorphismDigraphsFinder(NullDigraph(4), CompleteDigraph(4), fail, [], infinity, fail, 1, [1 .. 4], [], fail, fail, Group(())); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 4, 3 ] ), Transformation( [ 1, 3, 2 ] ), Transformation( [ 1, 3, 4, 2 ] ), Transformation( [ 1, 4, 2, 3 ] ), Transformation( [ 1, 4, 3, 2 ] ), Transformation( [ 2, 1 ] ), Transformation( [ 2, 1, 4, 3 ] ), Transformation( [ 2, 3, 1 ] ), Transformation( [ 2, 3, 4, 1 ] ), Transformation( [ 2, 4, 1, 3 ] ), Transformation( [ 2, 4, 3, 1 ] ), Transformation( [ 3, 1, 2 ] ), Transformation( [ 3, 1, 4, 2 ] ), Transformation( [ 3, 2, 1 ] ), Transformation( [ 3, 2, 4, 1 ] ), Transformation( [ 3, 4, 1, 2 ] ), Transformation( [ 3, 4, 2, 1 ] ), Transformation( [ 4, 1, 2, 3 ] ), Transformation( [ 4, 1, 3, 2 ] ), Transformation( [ 4, 2, 1, 3 ] ), Transformation( [ 4, 2, 3, 1 ] ), Transformation( [ 4, 3, 1, 2 ] ), Transformation( [ 4, 3, 2, 1 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:921 # Input is: HomomorphismDigraphsFinder(NullDigraph(4), CompleteDigraph(4), fail, [], infinity, fail, 1, [1 .. 4], [], fail, fail, Group((2, 3))); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 4, 3 ] ), Transformation( [ 1, 4, 2, 3 ] ), Transformation( [ 2, 1 ] ), Transformation( [ 2, 1, 4, 3 ] ), Transformation( [ 2, 3, 1 ] ), Transformation( [ 2, 3, 4, 1 ] ), Transformation( [ 2, 4, 1, 3 ] ), Transformation( [ 2, 4, 3, 1 ] ), Transformation( [ 4, 1, 2, 3 ] ), Transformation( [ 4, 2, 1, 3 ] ), Transformation( [ 4, 2, 3, 1 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:930 # Input is: HomomorphismDigraphsFinder(NullDigraph(4), CompleteDigraph(4), fail, [], infinity, fail, 1, [1 .. 4], [], fail, fail, Group((1, 2, 3))); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 4, 3 ] ), Transformation( [ 1, 3, 2 ] ), Transformation( [ 1, 3, 4, 2 ] ), Transformation( [ 1, 4, 2, 3 ] ), Transformation( [ 1, 4, 3, 2 ] ), Transformation( [ 4, 1, 2, 3 ] ), Transformation( [ 4, 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:937 # Input is: HomomorphismDigraphsFinder(NullDigraph(4), CompleteDigraph(4), fail, [], infinity, fail, 2, [1 .. 4], [], fail, fail, Group((2, 3))); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:941 # Input is: HomomorphismDigraphsFinder(NullDigraph(4), CompleteDigraph(4), fail, [], infinity, fail, 0, [1 .. 4], [], fail, fail, Group((1, 2), (2, 3))); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 3, 1 ] ), Transformation( [ 1, 2, 3, 2 ] ), Transformation( [ 1, 2, 3, 3 ] ), Transformation( [ 1, 2, 4, 3 ] ), Transformation( [ 1, 2, 4, 1 ] ), Transformation( [ 1, 2, 4, 2 ] ), Transformation( [ 1, 2, 4, 4 ] ), Transformation( [ 1, 2, 1, 3 ] ), Transformation( [ 1, 2, 1 ] ), Transformation( [ 1, 2, 1, 1 ] ), Transformation( [ 1, 2, 1, 2 ] ), Transformation( [ 1, 2, 2, 3 ] ), Transformation( [ 1, 2, 2 ] ), Transformation( [ 1, 2, 2, 1 ] ), Transformation( [ 1, 2, 2, 2 ] ), Transformation( [ 1, 4, 2, 3 ] ), Transformation( [ 1, 4, 2, 1 ] ), Transformation( [ 1, 4, 2, 2 ] ), Transformation( [ 1, 4, 2, 4 ] ), Transformation( [ 1, 4, 1, 2 ] ), Transformation( [ 1, 4, 1, 1 ] ), Transformation( [ 1, 4, 1, 4 ] ), Transformation( [ 1, 4, 4, 2 ] ), Transformation( [ 1, 4, 4, 1 ] ), Transformation( [ 1, 4, 4, 4 ] ), Transformation( [ 1, 1, 2, 3 ] ), Transformation( [ 1, 1, 2 ] ), Transformation( [ 1, 1, 2, 1 ] ), Transformation( [ 1, 1, 2, 2 ] ), Transformation( [ 1, 1, 4, 2 ] ), Transformation( [ 1, 1, 4, 1 ] ), Transformation( [ 1, 1, 4, 4 ] ), Transformation( [ 1, 1, 1, 2 ] ), Transformation( [ 1, 1, 1 ] ), Transformation( [ 1, 1, 1, 1 ] ), Transformation( [ 4, 1, 2, 3 ] ), Transformation( [ 4, 1, 2, 1 ] ), Transformation( [ 4, 1, 2, 2 ] ), Transformation( [ 4, 1, 2, 4 ] ), Transformation( [ 4, 1, 1, 2 ] ), Transformation( [ 4, 1, 1, 1 ] ), Transformation( [ 4, 1, 1, 4 ] ), Transformation( [ 4, 1, 4, 2 ] ), Transformation( [ 4, 1, 4, 1 ] ), Transformation( [ 4, 1, 4, 4 ] ), Transformation( [ 4, 4, 1, 2 ] ), Transformation( [ 4, 4, 1, 1 ] ), Transformation( [ 4, 4, 1, 4 ] ), Transformation( [ 4, 4, 4, 1 ] ), Transformation( [ 4, 4, 4, 4 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:970 # Input is: HomomorphismDigraphsFinder(NullDigraph(4), CompleteDigraph(4), fail, [], infinity, fail, 0, [1 .. 4], [], fail, fail, Group((1, 2, 3, 4), (1, 2))); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 3, 1 ] ), Transformation( [ 1, 2, 3, 2 ] ), Transformation( [ 1, 2, 3, 3 ] ), Transformation( [ 1, 2, 1, 3 ] ), Transformation( [ 1, 2, 1, 1 ] ), Transformation( [ 1, 2, 1, 2 ] ), Transformation( [ 1, 2, 2, 3 ] ), Transformation( [ 1, 2, 2, 1 ] ), Transformation( [ 1, 2, 2, 2 ] ), Transformation( [ 1, 1, 2, 3 ] ), Transformation( [ 1, 1, 2, 1 ] ), Transformation( [ 1, 1, 2, 2 ] ), Transformation( [ 1, 1, 1, 2 ] ), Transformation( [ 1, 1, 1, 1 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:981 # Input is: HomomorphismDigraphsFinder(NullDigraph(4), CompleteDigraph(4), fail, [], infinity, fail, 0, [1 .. 4], [], fail, fail); # Expected output: [ IdentityTransformation, Transformation( [ 1, 2, 3, 1 ] ), Transformation( [ 1, 2, 3, 2 ] ), Transformation( [ 1, 2, 3, 3 ] ), Transformation( [ 1, 2, 1, 3 ] ), Transformation( [ 1, 2, 1, 1 ] ), Transformation( [ 1, 2, 1, 2 ] ), Transformation( [ 1, 2, 2, 3 ] ), Transformation( [ 1, 2, 2, 1 ] ), Transformation( [ 1, 2, 2, 2 ] ), Transformation( [ 1, 1, 2, 3 ] ), Transformation( [ 1, 1, 2, 1 ] ), Transformation( [ 1, 1, 2, 2 ] ), Transformation( [ 1, 1, 1, 2 ] ), Transformation( [ 1, 1, 1, 1 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:991 # Input is: HomomorphismDigraphsFinder(CompleteDigraph(3), CompleteDigraph(3), fail, [], infinity, fail, 1, [1 .. 3], [], fail, fail, Group((1, 2, 3))); # Expected output: [ IdentityTransformation, Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:997 # Input is: gr1 := Digraph([[], [3], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:998 # Input is: gr2 := EmptyDigraph(10);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:999 # Input is: DigraphHomomorphism(gr1, gr2); # Expected output: fail # But found: Error, Variable: 'DigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1001 # Input is: gr2 := Digraph([[], [], [], [], [4], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1002 # Input is: DigraphHomomorphism(gr1, gr2); # Expected output: Transformation( [ 1, 5, 4, 4, 5 ] ) # But found: Error, Variable: 'DigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1006 # Input is: gr1 := Digraph([[], [3], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1007 # Input is: gr2 := Digraph([[], [], [], [], [4], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1008 # Input is: HomomorphismsDigraphsRepresentatives(gr1, gr2); # Expected output: [ Transformation( [ 1, 5, 4, 4, 5 ] ), Transformation( [ 4, 5, 4, 4, 5 ] ), Transformation( [ 5, 5, 4, 4, 5 ] ) ] # But found: Error, Variable: 'HomomorphismsDigraphsRepresentatives' must have a value ######## ########> Diff in standard/grahom.tst:1011 # Input is: homos := HomomorphismsDigraphs(gr1, gr2); # Expected output: [ Transformation( [ 1, 5, 4, 4, 5, 2 ] ), Transformation( [ 1, 5, 4, 4, 5, 3 ] ), Transformation( [ 1, 5, 4, 4, 5 ] ), Transformation( [ 2, 5, 4, 4, 5, 1 ] ), Transformation( [ 2, 5, 4, 4, 5, 3 ] ), Transformation( [ 2, 5, 4, 4, 5 ] ), Transformation( [ 3, 5, 4, 4, 5, 1 ] ), Transformation( [ 3, 5, 4, 4, 5, 2 ] ), Transformation( [ 3, 5, 4, 4, 5 ] ), Transformation( [ 4, 5, 4, 4, 5, 1 ] ), Transformation( [ 4, 5, 4, 4, 5, 2 ] ), Transformation( [ 4, 5, 4, 4, 5, 3 ] ), Transformation( [ 4, 5, 4, 4, 5 ] ), Transformation( [ 5, 5, 4, 4, 5, 1 ] ), Transformation( [ 5, 5, 4, 4, 5, 2 ] ), Transformation( [ 5, 5, 4, 4, 5, 3 ] ), Transformation( [ 5, 5, 4, 4, 5 ] ), Transformation( [ 6, 5, 4, 4, 5, 1 ] ), Transformation( [ 6, 5, 4, 4, 5, 2 ] ), Transformation( [ 6, 5, 4, 4, 5, 3 ] ) ] # But found: Error, Variable: 'HomomorphismsDigraphs' must have a value ######## ########> Diff in standard/grahom.tst:1027 # Input is: edges := DigraphEdges(gr1);; # Expected output: # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/grahom.tst:1028 # Input is: mat := AdjacencyMatrix(gr2);; # Expected output: # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/grahom.tst:1029 # Input is: ForAll(homos, t -> ForAll(edges, e -> mat[e[1] ^ t][e[2] ^ t] = 1)); # Expected output: true # But found: Error, Variable: 'homos' must have a value Syntax warning: Unbound global variable in stream:1 ForAll(homos, t -> ForAll(edges, e -> mat[e[1] ^ t][e[2] ^ t] = 1)); ^^^^^ Syntax warning: Unbound global variable in stream:1 ForAll(homos, t -> ForAll(edges, e -> mat[e[1] ^ t][e[2] ^ t] = 1)); ^^^ ######## ########> Diff in standard/grahom.tst:1033 # Input is: gr1 := EmptyDigraph(1);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1034 # Input is: DigraphMonomorphism(gr1, gr1); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1036 # Input is: gr2 := EmptyDigraph(2);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1037 # Input is: DigraphMonomorphism(gr2, gr1); # Expected output: fail # But found: Error, Variable: 'DigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1039 # Input is: DigraphMonomorphism(gr1, gr2); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1041 # Input is: DigraphMonomorphism(CompleteDigraph(2), Digraph([[2], [1, 3], [2]])); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1045 # Input is: gr1 := ChainDigraph(2);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1046 # Input is: MonomorphismsDigraphs(gr1, EmptyDigraph(1)); # Expected output: [ ] # But found: Error, Variable: 'MonomorphismsDigraphs' must have a value ######## ########> Diff in standard/grahom.tst:1048 # Input is: gr2 := DigraphFromDigraph6String("&DZTAW?");; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/grahom.tst:1049 # Input is: monos := MonomorphismsDigraphs(gr1, gr2); # Expected output: [ IdentityTransformation, Transformation( [ 1, 3, 3 ] ), Transformation( [ 1, 5, 3, 4, 5 ] ), Transformation( [ 2, 1 ] ), Transformation( [ 2, 3, 3 ] ), Transformation( [ 2, 5, 3, 4, 5 ] ), Transformation( [ 3, 2, 3 ] ), Transformation( [ 4, 2, 3, 4 ] ), Transformation( [ 4, 5, 3, 4, 5 ] ), Transformation( [ 5, 1, 3, 4, 5 ] ) ] # But found: Error, Variable: 'MonomorphismsDigraphs' must have a value ######## ########> Diff in standard/grahom.tst:1055 # Input is: monos = MonomorphismsDigraphsRepresentatives(gr1, gr2); # Expected output: true # But found: Error, Variable: 'monos' must have a value ######## ########> Diff in standard/grahom.tst:1057 # Input is: monos = HomomorphismsDigraphsRepresentatives(gr1, gr2); # Expected output: true # But found: Error, Variable: 'monos' must have a value ######## ########> Diff in standard/grahom.tst:1061 # Input is: gr1 := CycleDigraph(6);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1062 # Input is: gr2 := CycleDigraph(3);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1063 # Input is: DigraphEpimorphism(gr1, gr2); # Expected output: Transformation( [ 1, 2, 3, 1, 2, 3 ] ) # But found: Error, Variable: 'DigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1065 # Input is: DigraphEpimorphism(gr2, gr1); # Expected output: fail # But found: Error, Variable: 'DigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1069 # Input is: gr1 := CompleteDigraph(2);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1070 # Input is: gr2 := CompleteDigraph(3);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1071 # Input is: EpimorphismsDigraphs(gr1, gr2); # Expected output: [ ] # But found: Error, Variable: 'EpimorphismsDigraphs' must have a value ######## ########> Diff in standard/grahom.tst:1073 # Input is: gr1 := DigraphFromDigraph6String("&I@??HO???????A????");; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/grahom.tst:1074 # Input is: DigraphEpimorphism(gr1, gr2); # Expected output: Transformation( [ 2, 1, 1, 2, 1, 3, 1, 2, 1, 1 ] ) # But found: Error, Variable: 'DigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1076 # Input is: epis := EpimorphismsDigraphsRepresentatives(gr1, gr2);; # Expected output: # But found: Error, Variable: 'EpimorphismsDigraphsRepresentatives' must have a value ######## ########> Diff in standard/grahom.tst:1077 # Input is: Length(epis); # Expected output: 972 # But found: Error, Variable: 'epis' must have a value ######## ########> Diff in standard/grahom.tst:1079 # Input is: epis := EpimorphismsDigraphs(gr1, gr2);; # Expected output: # But found: Error, Variable: 'EpimorphismsDigraphs' must have a value ######## ########> Diff in standard/grahom.tst:1080 # Input is: Length(epis); # Expected output: 5832 # But found: Error, Variable: 'epis' must have a value ######## ########> Diff in standard/grahom.tst:1082 # Input is: ForAll(epis, x -> RankOfTransformation(x, DigraphNrVertices(gr1)) = 3); # Expected output: true # But found: Error, Variable: 'epis' must have a value Syntax warning: Unbound global variable in stream:1 ForAll(epis, x -> RankOfTransformation(x, DigraphNrVertices(gr1)) = 3); ^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:1 ForAll(epis, x -> RankOfTransformation(x, DigraphNrVertices(gr1)) = 3); ^^^ ######## ########> Diff in standard/grahom.tst:1086 # Input is: gr1 := CycleDigraph(3);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1087 # Input is: gr2 := CompleteBipartiteDigraph(4, 3);; # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1088 # Input is: DigraphEmbedding(gr1, gr2); # Expected output: fail # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1090 # Input is: gr2 := CompleteDigraph(4);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1091 # Input is: DigraphEmbedding(gr1, gr2); # Expected output: fail # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1093 # Input is: gr2 := Digraph([[2], [4, 1], [2], [3], [4]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1094 # Input is: DigraphEmbedding(gr1, gr2); # Expected output: Transformation( [ 2, 4, 3, 4 ] ) # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1096 # Input is: gr2 := CompleteDigraph(3);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1097 # Input is: DigraphEmbedding(gr1, gr2); # Expected output: fail # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1099 # Input is: DigraphEmbedding(gr1, gr1); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1101 # Input is: D := NullDigraph(2);; # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1102 # Input is: DD := DigraphFromDiSparse6String( ".~?C?_W@GN?e??@`W?wJ`cAG^?EG_@AEH?CacDWj@M??ga{Igq?WG_gbO?_J?}L_I_IFG~@?G_u_A\ \ AhBAiPOD`IB_QCEOxAck@HNB}KpK_KMhSBQ?`Hd[L?z`CIxY?}VOU`OGGteCVxHbcNXBd}JxO_uYo|\ \ bwVxmBiXxqEy\\ODf[SwOfwL`tgCOpncU`p~`e[WcA_JxYgsD@dg{Bpu`[bYRAc]hoHAd_BDIe@`hg\ \ Boed{ZwiaGOxFCs]HyeQ]XAbYL`}fmhogCSaYhEyTaR_?JAIdOYaTiwD@EEm@hFFObiqBSiYs@CQPK\ \ EaQWHBAMW]`Whw\\IIC?hAgPIKJQ[qjaciiTeYSP\\IWiXk_s[@pf?^BBa?SpkfiUwBAGRH[ck_zL@\ \ oJZNKq?PCGknHi_wciolS@O\\IuaGJLANx]LQD_]bW]J\\@_QPxK?uG@m?I_tCcnrDLMD@XKQLQ[b[\ \ cqX_?QA[e{]qlislBXjmGozLyXYTMQUQP_grj?aSkz^f{qrTiiQAtgWsrUhYXb@jsorreWbRCNAA_b\ \ IqSwxL}CQ_I_zru`sK@]GShrQNIziUes^K?`c?gSa?CGEaKDghAYEGkAmL_bbg@WHAyGHB?YPobcg@\ \ gHAuR_TdC?`D_KGhUAONxY@IVOC@IVpUDqVGkeKDW[B?KXf@MJGXdySg[e{YgfEiL`CCwSPUfKVpm`\ \ sH?ef[NgECY^?XfwB@u`SNiAEE[WD@uOiGCOSII@Y`Hk_W[yNDmGIQ?O\\iOeId_\\daCwOCgWGW@w\ \ Sp_hobyOb_]y_A{OpLhIJaO`wTydAOdhugQiPaikN@GIa\\HBGmJaIj?Xw@A?ZhC`ElOHj[@HsjgRA\ \ THqG@AF}PpJHyoQtkKM`bGenigk[oWNIokHH_{LaugGlbG_sJGZEkhWMA[gGPFusOcKEsoyEqtP~aG\ \ MPll_T`iKuBOWgIArIdAG@C`{PGGb]^Zb?ehwnKewWiLWwhPmUBjemsgGvIu{@RLIDrB`i{IQM]bBq\ \ cKyWLFcnzxKICIyKyEgI@g{XDeGbN");; # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/grahom.tst:1117 # Input is: DigraphEmbedding(D, DD); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1119 # Input is: D := DigraphDisjointUnion(CycleDigraph(3), CycleDigraph(5));; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/grahom.tst:1120 # Input is: D := DigraphSymmetricClosure(D);; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/grahom.tst:1121 # Input is: DigraphEmbedding(CycleDigraph(5), D); # Expected output: fail # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1123 # Input is: DigraphEmbedding(DigraphSymmetricClosure(CycleDigraph(5)), D); # Expected output: Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1127 # Input is: gr := DigraphFromDigraph6String(Concatenation( "+U^{?A?BrwAHv_CNu@SMwHQm`GpyGbUYLAbfGTO?Enool[WrI", "HBSatQlC[TIC{iSBlo_VrO@u[_Eyk?]YS?")); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/grahom.tst:1131 # Input is: t := HomomorphismDigraphsFinder(gr, gr, fail, [], 1, fail, 0, [2, 6, 7, 11, 12, 13, 14, 15, 19, 20, 21], [], fail, fail)[1]; # Expected output: Transformation( [ 2, 13, 20, 19, 21, 19, 14, 13, 15, 14, 20, 6, 15, 21, 11, 12, 6, 7, 7, 12, 2, 11 ] ) # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1135 # Input is: ForAll(DigraphEdges(gr), e -> IsDigraphEdge(gr, e[1] ^ t, e[2] ^ t)); # Expected output: true # But found: Error, Variable: 'DigraphEdges' must have a value Syntax warning: Unbound global variable in stream:1 ForAll(DigraphEdges(gr), e -> IsDigraphEdge(gr, e[1] ^ t, e[2] ^ t)); ^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:1 ForAll(DigraphEdges(gr), e -> IsDigraphEdge(gr, e[1] ^ t, e[2] ^ t)); ^^ Syntax warning: Unbound global variable in stream:1 ForAll(DigraphEdges(gr), e -> IsDigraphEdge(gr, e[1] ^ t, e[2] ^ t)); ^ Syntax warning: Unbound global variable in stream:1 ForAll(DigraphEdges(gr), e -> IsDigraphEdge(gr, e[1] ^ t, e[2] ^ t)); ^ ######## ########> Diff in standard/grahom.tst:1139 # Input is: gr := Digraph([[3, 4], [1, 3], [4], [1, 2, 3, 5], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1141 # Input is: ForAll(GeneratorsOfEndomorphismMonoid(gr), x -> IsDigraphEndomorphism(gr, x)); # Expected output: true # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr, x)); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr, x)); ^^ ######## ########> Diff in standard/grahom.tst:1146 # Input is: IsDigraphEndomorphism(gr, x); # Expected output: false # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1148 # Input is: IsDigraphHomomorphism(gr, gr, (1, 2)); # Expected output: false # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1150 # Input is: gr := Digraph([[1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1154 # Input is: IsDigraphEndomorphism(gr, x); # Expected output: Error, the 1st and 2nd arguments and must be digraphs with no mult\ \ iple edges, # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1157 # Input is: IsDigraphEndomorphism(gr, ()); # Expected output: Error, the 1st and 2nd arguments and must not have multiple edges, # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1159 # Input is: IsDigraphHomomorphism(gr, gr, ()); # Expected output: Error, the 1st and 2nd arguments and must be digraphs with no mult\ \ iple edges, # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1162 # Input is: gr := DigraphTransitiveClosure(CompleteDigraph(2)); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/grahom.tst:1164 # Input is: ForAll(GeneratorsOfEndomorphismMonoid(gr), x -> IsDigraphEndomorphism(gr, x)); # Expected output: true # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr, x)); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr, x)); ^^ ######## ########> Diff in standard/grahom.tst:1168 # Input is: IsDigraphEndomorphism(gr, x); # Expected output: false # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1171 # Input is: IsDigraphEndomorphism(gr, x); # Expected output: false # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1173 # Input is: IsDigraphEndomorphism(gr, ()); # Expected output: true # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1175 # Input is: IsDigraphEndomorphism(gr, (1, 2)); # Expected output: true # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1177 # Input is: IsDigraphEndomorphism(gr, (1, 2)(3, 4)); # Expected output: false # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1179 # Input is: IsDigraphEndomorphism(gr, (1, 2, 3, 4)); # Expected output: false # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1181 # Input is: IsDigraphHomomorphism(NullDigraph(1), NullDigraph(3), Transformation([2, 2])); # Expected output: true # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1187 # Input is: src := Digraph([[1], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1189 # Input is: ran := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1191 # Input is: IsDigraphEpimorphism(src, ran, Transformation([1, 2, 2])); # Expected output: true # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1193 # Input is: IsDigraphEpimorphism(src, ran, Transformation([1, 2, 3])); # Expected output: false # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1195 # Input is: IsDigraphEpimorphism(src, src, Transformation([1, 2, 3])); # Expected output: true # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1197 # Input is: IsDigraphEpimorphism(src, src, Transformation([2, 2, 2])); # Expected output: false # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1199 # Input is: IsDigraphEpimorphism(src, ran, Transformation([2, 2, 2])); # Expected output: false # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1203 # Input is: src := Digraph([[1], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1205 # Input is: ran := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1207 # Input is: IsDigraphEpimorphism(src, ran, ()); # Expected output: false # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1209 # Input is: IsDigraphEpimorphism(src, ran, (1, 2)); # Expected output: false # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1211 # Input is: IsDigraphEpimorphism(src, src, ()); # Expected output: true # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1213 # Input is: IsDigraphEpimorphism(src, src, (2, 3)); # Expected output: true # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1215 # Input is: IsDigraphEpimorphism(ran, src, ()); # Expected output: false # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:1219 # Input is: src := Digraph([[1], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1221 # Input is: ran := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1223 # Input is: IsDigraphMonomorphism(src, ran, Transformation([1, 2, 2])); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1225 # Input is: IsDigraphMonomorphism(src, ran, Transformation([1, 2, 3])); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1227 # Input is: IsDigraphMonomorphism(src, src, Transformation([1, 2, 3])); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1229 # Input is: IsDigraphMonomorphism(src, src, Transformation([2, 2, 2])); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1231 # Input is: IsDigraphMonomorphism(src, ran, Transformation([2, 2, 2])); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1233 # Input is: IsDigraphMonomorphism(ran, src, Transformation([2, 1])); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1235 # Input is: IsDigraphMonomorphism(ran, src, Transformation([1, 2])); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1239 # Input is: src := Digraph([[1], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1241 # Input is: ran := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1243 # Input is: IsDigraphMonomorphism(src, ran, (1, 2)); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1245 # Input is: IsDigraphMonomorphism(src, ran, ()); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1247 # Input is: IsDigraphMonomorphism(src, src, ()); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1249 # Input is: IsDigraphMonomorphism(ran, src, (1, 2)); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1251 # Input is: IsDigraphMonomorphism(ran, src, ()); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1255 # Input is: src := Digraph([[1], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1257 # Input is: ran := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1259 # Input is: IsDigraphEmbedding(src, ran, Transformation([1, 2, 2])); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1261 # Input is: IsDigraphEmbedding(src, ran, Transformation([1, 2, 3])); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1263 # Input is: IsDigraphEmbedding(src, src, Transformation([1, 2, 3])); # Expected output: true # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1265 # Input is: IsDigraphEmbedding(src, src, Transformation([2, 2, 2])); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1267 # Input is: IsDigraphEmbedding(src, ran, Transformation([2, 2, 2])); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1269 # Input is: IsDigraphEmbedding(ran, src, Transformation([2, 1])); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1271 # Input is: IsDigraphEmbedding(ran, src, Transformation([1, 2])); # Expected output: true # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1273 # Input is: src := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1275 # Input is: ran := Digraph([[1, 2], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1277 # Input is: IsDigraphMonomorphism(src, ran, Transformation([1, 2])); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1279 # Input is: IsDigraphEmbedding(src, ran, Transformation([1, 2])); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1283 # Input is: src := Digraph([[1], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1285 # Input is: ran := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1287 # Input is: IsDigraphEmbedding(src, ran, (1, 2)); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1289 # Input is: IsDigraphEmbedding(src, ran, ()); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1291 # Input is: IsDigraphEmbedding(src, src, ()); # Expected output: true # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1293 # Input is: IsDigraphEmbedding(ran, src, (1, 2)); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1295 # Input is: IsDigraphEmbedding(ran, src, ()); # Expected output: true # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1297 # Input is: src := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1299 # Input is: ran := Digraph([[1, 2], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1301 # Input is: IsDigraphMonomorphism(src, ran, ()); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1303 # Input is: IsDigraphEmbedding(src, ran, ()); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1307 # Input is: D := JohnsonDigraph(5, 3); # Expected output: # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1309 # Input is: IsDigraphColouring(D, [1, 2, 3, 3, 2, 1, 4, 5, 6, 7]); # Expected output: true # But found: Error, Variable: 'IsDigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:1311 # Input is: IsDigraphColouring(D, [1, 2, 3, 3, 2, 1, 2, 5, 6, 7]); # Expected output: false # But found: Error, Variable: 'IsDigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:1313 # Input is: IsDigraphColouring(D, [1, 2, 3, 3, 2, 1, 2, 5, 6, -1]); # Expected output: false # But found: Error, Variable: 'IsDigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:1315 # Input is: IsDigraphColouring(D, [1, 2, 3]); # Expected output: false # But found: Error, Variable: 'IsDigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:1317 # Input is: IsDigraphColouring(D, IdentityTransformation); # Expected output: true # But found: Error, Variable: 'IsDigraphColouring' must have a value ######## ########> Diff in standard/grahom.tst:1321 # Input is: D := Digraph([[2, 3], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1322 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit 3, # hint 0, # injective [1, 2, 3], # image [], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1336 # Input is: D := Digraph([[2, 3], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1337 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit 3, # hint 0, # injective [1, 2, 3], # image [,, 2], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1349 # Input is: D := Digraph([[2, 3], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1350 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit 1, # hint 0, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1362 # Input is: D := Digraph([[2, 3], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1363 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit 2, # hint 0, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 3 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1375 # Input is: D := Digraph([[2, 3], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1376 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit 3, # hint 0, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1388 # Input is: D := Digraph([[2, 3], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1389 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 0, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1403 # Input is: D := Digraph([[2, 3], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1404 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1416 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [3, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1428 # Input is: D := Digraph([[2, 3], [2], [3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1429 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1441 # Input is: D := Digraph([[2, 3], [2], [3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1442 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1454 # Input is: D := Digraph([[2, 3], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1455 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [, 3], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1467 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1479 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1491 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [3, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1505 # Input is: D := Digraph([[2, 3], [2], [3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1506 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1518 # Input is: D := Digraph([[2, 3], [2], [3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1519 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1531 # Input is: D := Digraph([[2, 3], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1532 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [, 3], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1544 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1556 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [2, 3], # image [], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1568 # Input is: EmbeddingsDigraphsRepresentatives(NullDigraph(2), Digraph([[2, 3], [], []])); # Expected output: [ Transformation( [ 2, 3, 3 ] ) ] # But found: Error, Variable: 'EmbeddingsDigraphsRepresentatives' must have a value ######## ########> Diff in standard/grahom.tst:1573 # Input is: D1 := NullDigraph(2);; # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1574 # Input is: D2 := DigraphFromDiSparse6String( ".~?@c_oAN?xSA_XcBf?q^?YK?iooXja]oBJGlgZ_CLzgQoAn?kWjDIK[?P[c_qpNLM{{KFRMns`Wm\ \ tSNCuT^Z?a[rvOeCCdvGixXG`ZFc__AF?hKMg?IaGH]gGIAm?z?_lpGdmRUzMYQmoASkoKS]prafo[\ \ wws?[R_AcjsseVtaiXLcvXSwg`v@gfKBQ^KJc|n]D\\thb");; # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/grahom.tst:1578 # Input is: DigraphMonomorphism(D1, D2); # Expected output: IdentityTransformation # But found: Error, Variable: 'DigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1580 # Input is: D1 := CompleteDigraph(2);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:1581 # Input is: DigraphMonomorphism(D1, D2); # Expected output: Transformation( [ 65, 66, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66 ] ) # But found: Error, Variable: 'DigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1586 # Input is: D := DigraphFromDigraph6String(Concatenation( "+U^{?A?BrwAHv_CNu@SMwHQm`GpyGbUYLAbfGTO?Enool[WrI", "HBSatQlC[TIC{iSBlo_VrO@u[_Eyk?]YS?"));; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/grahom.tst:1589 # Input is: HomomorphismDigraphsFinder(D, D, fail, [], 1, fail, 1, [2, 6, 7, 11, 12, 13, 14, 15, 19, 20, 21], [], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1592 # Input is: D := Digraph([[2], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1593 # Input is: HomomorphismDigraphsFinder(D, D, fail, [], 1, fail, 1, [1], [], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1598 # Input is: D := Digraph([[2, 3], [1], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1599 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1611 # Input is: D := Digraph([[2, 3], [1], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1612 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 0, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1624 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [3, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1636 # Input is: D := Digraph([[2, 3], [1, 2], [1, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1637 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1649 # Input is: D := Digraph([[2, 3], [1, 2], [1, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1650 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1662 # Input is: D := Digraph([[2, 3], [1], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1663 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [, 3], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1675 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1687 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1699 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [3, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1711 # Input is: D := DigraphAddAllLoops(Digraph([[2, 3], [1], [1], [], []]));; # Expected output: # But found: Error, Variable: 'DigraphAddAllLoops' must have a value ######## ########> Diff in standard/grahom.tst:1712 # Input is: EmbeddingsDigraphsRepresentatives(NullDigraph(2), D); # Expected output: [ Transformation( [ 1, 4, 3, 4 ] ), Transformation( [ 2, 3, 3 ] ), Transformation( [ 2, 4, 3, 4 ] ), Transformation( [ 4, 1, 3, 4 ] ), Transformation( [ 4, 2, 3, 4 ] ), Transformation( [ 4, 5, 3, 4, 5 ] ) ] # But found: Error, Variable: 'EmbeddingsDigraphsRepresentatives' must have a value ######## ########> Diff in standard/grahom.tst:1716 # Input is: D := Digraph([[2, 3], [1, 2], [1, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1717 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 1, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1729 # Input is: D := Digraph([[2, 3], [1, 2], [1, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1730 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1742 # Input is: D := Digraph([[2, 3], [1], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1743 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [, 3], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1755 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [], # map [1, 2, 3], # colours1 [1, 3, 2]); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1767 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ Transformation( [ 1, 3, 2 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1779 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1, 2, 3], # image [3, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1791 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [2, 3], # image [, 3], # map fail, # colours1 fail); # colours2 # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1803 # Input is: D := DigraphAddAllLoops(Digraph([[2, 3], [1], [1], [], [5]]));; # Expected output: # But found: Error, Variable: 'DigraphAddAllLoops' must have a value ######## ########> Diff in standard/grahom.tst:1804 # Input is: EmbeddingsDigraphsRepresentatives(NullDigraph(2), D); # Expected output: [ Transformation( [ 1, 4, 3, 4 ] ), Transformation( [ 2, 3, 3 ] ), Transformation( [ 2, 4, 3, 4 ] ), Transformation( [ 4, 1, 3, 4 ] ), Transformation( [ 4, 2, 3, 4 ] ), Transformation( [ 4, 5, 3, 4, 5 ] ) ] # But found: Error, Variable: 'EmbeddingsDigraphsRepresentatives' must have a value ######## ########> Diff in standard/grahom.tst:1808 # Input is: EmbeddingsDigraphsRepresentatives(CompleteDigraph(2), D); # Expected output: [ IdentityTransformation, Transformation( [ 2, 1 ] ) ] # But found: Error, Variable: 'EmbeddingsDigraphsRepresentatives' must have a value ######## ########> Diff in standard/grahom.tst:1810 # Input is: MonomorphismsDigraphsRepresentatives(CompleteDigraph(2), D); # Expected output: [ IdentityTransformation, Transformation( [ 2, 1 ] ) ] # But found: Error, Variable: 'MonomorphismsDigraphsRepresentatives' must have a value ######## ########> Diff in standard/grahom.tst:1812 # Input is: D := Digraph([[3], [8], [9], [11], [2, 7, 8, 18], [18, 20], [1], [], [], [], [4, 8, 16], [13, 19], [], [4], [15], [1, 4, 6, 8], [], [7, 12], [], [8]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1815 # Input is: EmbeddingsDigraphsRepresentatives(CompleteDigraph(2), D); # Expected output: [ Transformation( [ 4, 11, 3, 4, 5, 6, 7, 8, 9, 10, 11 ] ), Transformation( [ 11, 4, 3, 4, 5, 6, 7, 8, 9, 10, 11 ] ) ] # But found: Error, Variable: 'EmbeddingsDigraphsRepresentatives' must have a value ######## ########> Diff in standard/grahom.tst:1818 # Input is: EmbeddingsDigraphs(CompleteDigraph(2), D); # Expected output: [ Transformation( [ 4, 11, 3, 4, 5, 6, 7, 8, 9, 10, 11 ] ), Transformation( [ 4, 11, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 19, 14, 15, 16, 17, 18, 13 ] ), Transformation( [ 4, 11, 3, 4, 5, 6, 7, 8, 9, 17, 11, 12, 13, 14, 15, 16, 10 ] ), Transformation( [ 4, 11, 3, 4, 5, 6, 7, 8, 9, 17, 11, 12, 19, 14, 15, 16, 10, 18, 13 ] ), Transformation( [ 11, 4, 3, 4, 5, 6, 7, 8, 9, 10, 11 ] ) , Transformation( [ 11, 4, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 19, 14, 15, 16, 17, 18, 13 ] ), Transformation( [ 11, 4, 3, 4, 5, 6, 7, 8, 9, 17, 11, 12, 13, 14, 15, 16, 10 ] ), Transformation( [ 11, 4, 3, 4, 5, 6, 7, 8, 9, 17, 11, 12, 19, 14, 15, 16, 10, 18, 13 ] ) ] # But found: Error, Variable: 'EmbeddingsDigraphs' must have a value ######## ########> Diff in standard/grahom.tst:1830 # Input is: D := DigraphAddAllLoops(Digraph([[2, 3], [1], [1], [], [5]]));; # Expected output: # But found: Error, Variable: 'DigraphAddAllLoops' must have a value ######## ########> Diff in standard/grahom.tst:1831 # Input is: HomomorphismDigraphsFinder(D, D, fail, # hook [], # user_param 1, # limit fail, # hint 2, # injective [1 .. 5], # image [1,, 4], # map fail, # colours1 fail); # colours2 # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1847 # Input is: D := Digraph(parts, {x, y} -> ForAll(x, z -> not z in y)); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:1849 # Input is: t := DigraphHomomorphism(CompleteDigraph(25), D); # Expected output: # But found: Error, Variable: 'DigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1851 # Input is: tt := HomomorphismDigraphsFinder(CompleteDigraph(26), D, fail, # hook [], # user_param 1, # max_results fail, 0, [1 .. 280], OnTuples([2 .. 25], t), fail, fail)[1]; # Expected output: # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1863 # Input is: OnTuples([2 .. 25], t) = OnTuples([2 .. 25], tt); # Expected output: false # But found: Error, Variable: 't' must have a value ######## ########> Diff in standard/grahom.tst:1869 # Input is: D := DigraphSymmetricClosure(Digraph([[2, 3], [], [], [5], [], []]));; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/grahom.tst:1870 # Input is: HomomorphismDigraphsFinder(D, D, hook, true, infinity, fail, 0, [1 .. 6], [], fail, fail); # Expected output: true # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1873 # Input is: found; # Expected output: 100 # But found: 0 ######## ########> Diff in standard/grahom.tst:1880 # Input is: D := DigraphSymmetricClosure(Digraph([[2, 3], [], [], [5], [], []]));; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/grahom.tst:1881 # Input is: HomomorphismDigraphsFinder(D, D, hook, true, infinity, fail, 0, [1 .. 6], [], fail, fail); # Expected output: true # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1884 # Input is: found; # Expected output: 12 # But found: 0 ######## ########> Diff in standard/grahom.tst:1888 # Input is: D := DigraphDisjointUnion(CycleDigraph(3), CycleDigraph(5));; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/grahom.tst:1889 # Input is: D := DigraphSymmetricClosure(D);; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/grahom.tst:1890 # Input is: t := DigraphHomomorphism(DigraphSymmetricClosure(CycleDigraph(5)), D); # Expected output: Transformation( [ 1, 2, 3, 1, 2 ] ) # But found: Error, Variable: 'DigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1892 # Input is: t := HomomorphismDigraphsFinder(DigraphSymmetricClosure(CycleDigraph(5)), D, fail, # hook [], # user_param 1, # max_results fail, 0, [1 .. 8], ListTransformation(t, 5), fail, fail)[1]; # Expected output: Transformation( [ 1, 2, 3, 1, 2 ] ) # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1904 # Input is: t := DigraphMonomorphism(DigraphSymmetricClosure(CycleDigraph(5)), D); # Expected output: Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) # But found: Error, Variable: 'DigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1906 # Input is: t := HomomorphismDigraphsFinder(DigraphSymmetricClosure(CycleDigraph(5)), D, fail, # hook [], # user_param 1, # max_results fail, 1, [1 .. 8], ListTransformation(t, 5), fail, fail); # Expected output: [ Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1918 # Input is: t := DigraphEmbedding(DigraphSymmetricClosure(CycleDigraph(5)), D); # Expected output: Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:1920 # Input is: HomomorphismDigraphsFinder(DigraphSymmetricClosure(CycleDigraph(5)), D, fail, # hook [], # user_param 1, # max_results fail, 2, [1 .. 8], ListTransformation(t, 5), fail, fail); # Expected output: [ Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1932 # Input is: t := HomomorphismDigraphsFinder(DigraphSymmetricClosure(CycleDigraph(5)), D, fail, # hook [], # user_param 1, # max_results fail, 2, [1 .. 8], ListTransformation(t, 6), fail, fail); # Expected output: Error, the 9th argument is too long, must be at most 5, found 6, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1944 # Input is: t := HomomorphismDigraphsFinder(DigraphSymmetricClosure(CycleDigraph(5)), D, fail, # hook [], # user_param 1, # max_results fail, 0, [1 .. 8], [1, 1, 1, 1], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1956 # Input is: t := HomomorphismDigraphsFinder(DigraphSymmetricClosure(CycleDigraph(5)), D, fail, # hook [], # user_param 1, # max_results fail, 1, [1 .. 8], [1, 2, 3, 4], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1968 # Input is: t := HomomorphismDigraphsFinder(DigraphSymmetricClosure(CycleDigraph(5)), D, fail, # hook [], # user_param 2, # max_results fail, 1, [1 .. 8], [1, 1, 1, 1], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1980 # Input is: t := HomomorphismDigraphsFinder(DigraphSymmetricClosure(CycleDigraph(5)), D, fail, # hook [], # user_param 1, # max_results 2, 0, [1 .. 8], [4, 5, 6, 7], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:1994 # Input is: D := DigraphDisjointUnion(CycleDigraph(3), CycleDigraph(5));; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/grahom.tst:1995 # Input is: t := DigraphHomomorphism(CycleDigraph(5), D); # Expected output: Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) # But found: Error, Variable: 'DigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:1997 # Input is: t := HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results fail, 0, [1 .. 8], ListTransformation(t, 5), fail, fail)[1]; # Expected output: Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2009 # Input is: t := DigraphMonomorphism(CycleDigraph(5), D); # Expected output: Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) # But found: Error, Variable: 'DigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2011 # Input is: t := HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results fail, 1, [1 .. 8], ListTransformation(t, 5), fail, fail); # Expected output: [ Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2023 # Input is: t := DigraphEmbedding(CycleDigraph(5), D); # Expected output: Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2025 # Input is: HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results fail, 2, [1 .. 8], ListTransformation(t, 5), fail, fail); # Expected output: [ Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2037 # Input is: HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results fail, 2, [1 .. 8], ListTransformation(t, 6), fail, fail); # Expected output: Error, the 9th argument is too long, must be at most 5, found 6, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2049 # Input is: D := DigraphDisjointUnion(CycleDigraph(3), CycleDigraph(5));; # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/grahom.tst:2050 # Input is: t := DigraphEmbedding(CycleDigraph(5), D); # Expected output: Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) # But found: Error, Variable: 'DigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2052 # Input is: HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results fail, 2, [1 .. 8], ListTransformation(t, 6), fail, fail); # Expected output: Error, the 9th argument is too long, must be at most 5, found 6, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2064 # Input is: HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results fail, 0, [1 .. 8], [1, 1, 1, 1], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2076 # Input is: HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results fail, 1, [1 .. 8], [1, 1, 1, 1], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2088 # Input is: HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results fail, 2, [1 .. 8], [1, 1, 1, 1], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2100 # Input is: HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results 2, 0, [1 .. 8], [4, 5, 6, 7], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2112 # Input is: HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results 2, 0, [1 .. 8], [4, 5, 6, 7], fail, fail, [1, 3, 4, 5, 2]); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2125 # Input is: HomomorphismDigraphsFinder(CycleDigraph(5), D, fail, # hook [], # user_param 1, # max_results fail, 0, [1 .. 8], [4, 5, 6, 7], fail, fail, [1, 3, 4, 5, 2]); # Expected output: [ Transformation( [ 4, 5, 6, 7, 8, 6, 7, 8 ] ) ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2140 # Input is: HomomorphismDigraphsFinder(0); # Expected output: Error, there must be 11 or 12 arguments, found 1, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2142 # Input is: DigraphHomomorphism(NullDigraph(1), NullDigraph(513)); # Expected output: Error, the 2nd argument must have at most 512 vertices, found 513, # But found: Error, Variable: 'DigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2144 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, false, 0, 0, 0, 0, 0); # Expected output: Error, the 6th argument must be an integer or fail, not boolean or fail\ \ , # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2148 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, fail, true, 0, 0, 0, 0); # Expected output: Error, the 8th argument must be a list or fail, not integer, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2151 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, fail, false, 0, 0, 0, 0); # Expected output: Error, the 8th argument must be a list or fail, not integer, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2154 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, fail, true, [1,, 3], 0, 0, 0); # Expected output: Error, the 8th argument must be a dense list, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2157 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, fail, true, [1, 1, 3], 0, 0, 0); # Expected output: Error, in the 8th argument position 2 is a duplicate, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2160 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [5], 0, 0); # Expected output: Error, in the 9th argument the value 5 in position 1 does not be\ \ long to the 7th argument , # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2164 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], true, 0); # Expected output: Error, the 10th argument must be a list or fail, not boolean or fail\ \ , # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2168 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, false); # Expected output: Error, the 11th argument must be a list or fail, not boolean or fail\ \ , # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2172 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, true); # Expected output: Error, the 12th or 13th argument must be a permutation group or fail\ \ , not boolean or fail, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2176 # Input is: HomomorphismDigraphsFinder(NullDigraph(10), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, [1]); # Expected output: Error, the 12th argument must be a list of length 10, not 1, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2179 # Input is: HomomorphismDigraphsFinder(NullDigraph(1), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, "1"); # Expected output: Error, the 12th argument must consist of integers, but found list (str\ \ ing) in position 1, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2183 # Input is: HomomorphismDigraphsFinder(NullDigraph(2), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, [, 1]); # Expected output: Error, the 12th argument must be a dense list, but position 1 is not b\ \ ound, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2187 # Input is: HomomorphismDigraphsFinder(NullDigraph(3), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, [1, 3, 5]); # Expected output: Error, the 12th argument must consist of integers, in the range [1, 3]\ \ but found 5, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2191 # Input is: HomomorphismDigraphsFinder(NullDigraph(3), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, [1, 1, 3]); # Expected output: Error, the 12th argument must be duplicate-free, but the value 1 in po\ \ sition 2 is a duplicate, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2195 # Input is: HomomorphismDigraphsFinder(NullDigraph(3), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, 12); # Expected output: Error, the 12th or 13th argument must be a permutation group or fail\ \ , not integer, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2199 # Input is: HomomorphismDigraphsFinder(NullDigraph(3), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, true); # Expected output: Error, the 12th or 13th argument must be a permutation group or fail\ \ , not boolean or fail, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2203 # Input is: HomomorphismDigraphsFinder(NullDigraph(3), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, Group(MappingPermListList([1 .. 1000], [5 .. 1004]))); # Expected output: Error, expected group of automorphisms, but found a non-automorphism in positi\ \ on 1 of the group generators, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2208 # Input is: HomomorphismDigraphsFinder(NullDigraph(3), NullDigraph(510), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, Group((1, 2), MappingPermListList([1 .. 1000], [5 .. 1004]))); # Expected output: Error, expected group of automorphisms, but found a non-automorphism in positi\ \ on 2 of the group generators, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2213 # Input is: HomomorphismDigraphsFinder(NullDigraph(3), ChainDigraph(3), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, Group((1, 2, 3))); # Expected output: Error, expected group of automorphisms, but found a non-automorphism in positi\ \ on 1 of the group generators, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2217 # Input is: HomomorphismDigraphsFinder(NullDigraph(3), NullDigraph(3), fail, [], 1, fail, true, [1, 2, 3], [1], [1, 1, 1], [1, 2, 3], Group((1, 2, 3))); # Expected output: Error, expected group of automorphisms, but found a non-automorphism in positi\ \ on 1 of the group generators, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2221 # Input is: HomomorphismDigraphsFinder(NullDigraph(3), NullDigraph(3), fail, [], 1, fail, true, [1, 2, 3], [1], fail, fail, Group((1, 2, 3), (1, 2), (1, 3))); # Expected output: Error, expected at most 2 generators in the 12th or 13th argument but got 3, # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2227 # Input is: D1 := DigraphSymmetricClosure(Digraph([[2], [3], []]));; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/grahom.tst:2228 # Input is: D2 := CompleteDigraph(3);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:2229 # Input is: HomomorphismDigraphsFinder(D1, D2, fail, [], 1, fail, 2, [1, 2, 3], [1, 2, 3], fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2232 # Input is: HomomorphismDigraphsFinder(D1, D2, fail, [], 1, fail, 2, [1, 2, 3], fail, fail, fail); # Expected output: [ ] # But found: Error, Variable: 'HomomorphismDigraphsFinder' must have a value ######## ########> Diff in standard/grahom.tst:2237 # Input is: DigraphSmallestLastOrder(D1); # Expected output: [ 3, 2, 1 ] # But found: Error, Variable: 'DigraphSmallestLastOrder' must have a value ######## ########> Diff in standard/grahom.tst:2239 # Input is: DigraphSmallestLastOrder(D2); # Expected output: [ 3, 2, 1 ] # But found: Error, Variable: 'DigraphSmallestLastOrder' must have a value ######## ########> Diff in standard/grahom.tst:2243 # Input is: D1 := DigraphFromGraph6String("E}hO"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/grahom.tst:2245 # Input is: D2 := DigraphFromGraph6String("E}h_"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/grahom.tst:2247 # Input is: mono := MonomorphismsDigraphs(D1, D2); # Expected output: [ ] # But found: Error, Variable: 'MonomorphismsDigraphs' must have a value ######## ########> Diff in standard/grahom.tst:2251 # Input is: gr := CompleteDigraph(5); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:2253 # Input is: GeneratorsOfEndomorphismMonoid(gr); # Expected output: [ Transformation( [ 2, 3, 4, 5, 1 ] ), Transformation( [ 2, 1 ] ), IdentityTransformation ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:2256 # Input is: gr := CompleteDigraph(5); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grahom.tst:2258 # Input is: GeneratorsOfEndomorphismMonoid(gr, [1, 1, 1, 2, 3]); # Expected output: [ Transformation( [ 1, 3, 2 ] ), Transformation( [ 2, 1 ] ), IdentityTransformation ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:2261 # Input is: GeneratorsOfEndomorphismMonoid(gr); # Expected output: [ Transformation( [ 2, 3, 4, 5, 1 ] ), Transformation( [ 2, 1 ] ), IdentityTransformation ] # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value ######## ########> Diff in standard/grahom.tst:2266 # Input is: gr1 := Digraph([[], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2268 # Input is: gr2 := Digraph([[], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2270 # Input is: IsDigraphAutomorphism(gr1, Transformation([1, 2])); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2272 # Input is: IsDigraphAutomorphism(gr1, Transformation([1, 2]), [1, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2274 # Input is: IsDigraphAutomorphism(gr2, Transformation([1, 2]), [1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2276 # Input is: IsDigraphHomomorphism(gr1, gr2, Transformation([1, 2])); # Expected output: true # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2278 # Input is: IsDigraphHomomorphism(gr1, gr2, Transformation([1, 2]), [1, 2], [1, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2280 # Input is: IsDigraphHomomorphism(gr1, gr2, Transformation([1, 2]), [1, 1], [1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2282 # Input is: IsDigraphHomomorphism(gr1, gr2, Transformation([1, 2]), [1, 1], [1, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2284 # Input is: gr1 := Digraph([[], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2286 # Input is: gr1 := ChainDigraph(3); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/grahom.tst:2288 # Input is: gr2 := ChainDigraph(6); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/grahom.tst:2290 # Input is: IsDigraphHomomorphism(gr1, gr2, Transformation([1, 2, 3]), [1 .. 3], [1 .. 6])\ ; # Expected output: true # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2292 # Input is: IsDigraphHomomorphism(gr1, gr2, Transformation([1, 2, 3]), [1 .. 3], [1, 1, 2,\ 3, 4, 5]); # Expected output: false # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2294 # Input is: IsDigraphHomomorphism(gr1, gr2, Transformation([1, 2, 3]), [2, 2, 1], [2, 2, 1, 3, 4, 5]); # Expected output: true # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2297 # Input is: IsDigraphHomomorphism(gr1, gr2, Transformation([1, 2, 3]), [2, 2, 1], [1, 1, 2, 3, 4, 5]); # Expected output: false # But found: Error, Variable: 'IsDigraphHomomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2300 # Input is: IsDigraphAutomorphism(gr1, Transformation([3, 2, 1]), [1, 2, 3]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2302 # Input is: gr1 := CycleDigraph(6); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/grahom.tst:2308 # Input is: IsDigraphAutomorphism(gr1, x, [1 .. 6]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2310 # Input is: IsDigraphAutomorphism(gr1, x, [1, 1, 2, 2, 3, 3]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2312 # Input is: IsDigraphAutomorphism(gr1, x, [1, 1, 1, 1, 1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2314 # Input is: IsDigraphAutomorphism(gr1, x, [1, 1, 2, 2, 3, 3]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2316 # Input is: IsDigraphAutomorphism(gr1, x ^ 2, [1, 1, 2, 2, 3, 3]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2318 # Input is: IsDigraphAutomorphism(gr1, x ^ 2, [1, 2, 2, 3, 4, 4]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2320 # Input is: IsDigraphAutomorphism(gr1, x ^ 2, [1, 1, 1, 1, 1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2322 # Input is: IsDigraphAutomorphism(gr1, x ^ 3, [1, 2, 2, 3, 4, 4]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2324 # Input is: IsDigraphAutomorphism(gr1, x ^ 3, [1, 1, 1, 1, 1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2326 # Input is: IsDigraphAutomorphism(gr1, t, [1 .. 6]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2328 # Input is: IsDigraphAutomorphism(gr1, t, [1, 1, 2, 2, 3, 3]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2330 # Input is: IsDigraphAutomorphism(gr1, t ^ 2, [1, 1, 2, 2, 3, 3]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2332 # Input is: IsDigraphAutomorphism(gr1, t ^ 2, [1, 2, 2, 3, 4, 4]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2334 # Input is: IsDigraphAutomorphism(gr1, t ^ 3, [1, 2, 2, 3, 4, 4]); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2336 # Input is: gr1 := DigraphFromDigraph6String("&D~~~~_"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/grahom.tst:2338 # Input is: ForAll(AutomorphismGroup(gr1), x -> x = () or not IsDigraphAutomorphism(gr1, x, [1 .. 5])); # Expected output: true # But found: Error, Variable: 'gr1' must have a value Syntax warning: Unbound global variable in stream:2 x -> x = () or not IsDigraphAutomorphism(gr1, x, [1 .. 5])); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> x = () or not IsDigraphAutomorphism(gr1, x, [1 .. 5])); ^^^ ######## ########> Diff in standard/grahom.tst:2341 # Input is: ForAll(AutomorphismGroup(gr1), x -> IsDigraphAutomorphism(gr1, x, [1, 1, 1, 1, 1])); # Expected output: true # But found: Error, Variable: 'gr1' must have a value Syntax warning: Unbound global variable in stream:2 x -> IsDigraphAutomorphism(gr1, x, [1, 1, 1, 1, 1])); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> IsDigraphAutomorphism(gr1, x, [1, 1, 1, 1, 1])); ^^^ ######## ########> Diff in standard/grahom.tst:2346 # Input is: gr1 := DigraphTransitiveClosure(CompleteDigraph(2)); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/grahom.tst:2348 # Input is: IsDigraphEndomorphism(gr1, (1, 2), [1, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2350 # Input is: IsDigraphEndomorphism(gr1, (1, 2), [1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2352 # Input is: IsDigraphEndomorphism(gr1, Transformation([1, 1]), [1, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2354 # Input is: IsDigraphEndomorphism(gr1, Transformation([1, 1]), [1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphEndomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2356 # Input is: ForAll(GeneratorsOfEndomorphismMonoid(gr1), x -> IsDigraphEndomorphism(gr1, x, [1, 1])); # Expected output: true # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr1, x, [1, 1])); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr1, x, [1, 1])); ^^^ ######## ########> Diff in standard/grahom.tst:2359 # Input is: gr2 := Digraph([[3, 4], [1, 3], [4], [1, 2, 3, 5], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2361 # Input is: ForAll(GeneratorsOfEndomorphismMonoid(gr2), x -> IsDigraphEndomorphism(gr2, x, [1, 1, 1, 1, 1])); # Expected output: true # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr2, x, [1, 1, 1, 1, 1])); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr2, x, [1, 1, 1, 1, 1])); ^^^ ######## ########> Diff in standard/grahom.tst:2364 # Input is: gr1 := DigraphFromDigraph6String("&D~~~~_"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/grahom.tst:2366 # Input is: ForAll(GeneratorsOfEndomorphismMonoid(gr1), x -> IsDigraphEndomorphism(gr1, x, [1, 1, 1, 1, 1])); # Expected output: true # But found: Error, Variable: 'GeneratorsOfEndomorphismMonoid' must have a value Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr1, x, [1, 1, 1, 1, 1])); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr1, x, [1, 1, 1, 1, 1])); ^^^ ######## ########> Diff in standard/grahom.tst:2369 # Input is: ForAll(AutomorphismGroup(gr1), x -> IsDigraphEndomorphism(gr1, x, [1, 1, 1, 1, 1])); # Expected output: true # But found: Error, Variable: 'gr1' must have a value Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr1, x, [1, 1, 1, 1, 1])); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> IsDigraphEndomorphism(gr1, x, [1, 1, 1, 1, 1])); ^^^ ######## ########> Diff in standard/grahom.tst:2374 # Input is: src := Digraph([[1], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2376 # Input is: ran := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2378 # Input is: IsDigraphEpimorphism(src, ran, Transformation([1, 2, 2]), [1, 2, 2], [1, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:2380 # Input is: IsDigraphEpimorphism(src, ran, Transformation([1, 2, 2]), [1, 2, 3], [1, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:2382 # Input is: IsDigraphEpimorphism(src, src, Transformation([1, 2, 3]), [1, 1, 2], [1, 1, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:2385 # Input is: IsDigraphEpimorphism(src, src, Transformation([1, 2, 3]), [1, 2, 3], [1, 1, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:2388 # Input is: IsDigraphEpimorphism(src, src, (), [1, 2, 2], [1, 2, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:2390 # Input is: IsDigraphEpimorphism(src, src, (2, 3), [1, 2, 3], [2, 3, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:2392 # Input is: IsDigraphEpimorphism(src, src, (2, 3), [2, 1, 3], [2, 3, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphEpimorphism' must have a value ######## ########> Diff in standard/grahom.tst:2396 # Input is: src := Digraph([[1], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2398 # Input is: ran := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2400 # Input is: IsDigraphMonomorphism(src, src, Transformation([1, 3, 2]), [2, 3, 1], [2, 1, 3]); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2403 # Input is: IsDigraphMonomorphism(src, src, Transformation([1, 3, 2]), [2, 3, 1], [2, 3, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2406 # Input is: IsDigraphMonomorphism(src, src, Transformation([1, 2, 3]), [2, 1, 1], [1, 2, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2409 # Input is: IsDigraphMonomorphism(src, src, Transformation([1, 2, 3]), [1, 2, 2], [1, 2, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2412 # Input is: IsDigraphMonomorphism(ran, src, Transformation([1, 2]), [2, 1], [1, 2, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2415 # Input is: IsDigraphMonomorphism(ran, src, Transformation([1, 2]), [2, 1], [1, 1, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2418 # Input is: IsDigraphMonomorphism(ran, src, Transformation([1, 2]), [1, 1], [1, 1, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2421 # Input is: IsDigraphMonomorphism(src, src, (), [1, 2, 2], [1, 2, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2423 # Input is: IsDigraphMonomorphism(src, src, (), [1, 1, 2], [1, 2, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2425 # Input is: IsDigraphMonomorphism(ran, src, (), [1, 1], [1, 1, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2427 # Input is: IsDigraphMonomorphism(ran, src, (), [1, 1], [2, 2, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2429 # Input is: IsDigraphMonomorphism(ran, src, (), [1, 2], [1, 2, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphMonomorphism' must have a value ######## ########> Diff in standard/grahom.tst:2433 # Input is: src := Digraph([[1], [1, 2], [1, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2435 # Input is: ran := Digraph([[1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grahom.tst:2437 # Input is: IsDigraphEmbedding(src, src, Transformation([1, 2, 3]), [1, 1, 1], [1, 1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2440 # Input is: IsDigraphEmbedding(src, src, Transformation([1, 2, 3]), [1, 1, 2], [1, 1, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2443 # Input is: IsDigraphEmbedding(ran, src, Transformation([1, 2])); # Expected output: true # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2445 # Input is: IsDigraphEmbedding(src, src, (), [1, 1, 1], [1, 1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2447 # Input is: IsDigraphEmbedding(src, src, (), [2, 1, 1], [1, 1, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2449 # Input is: IsDigraphEmbedding(ran, src, (), [1, 1], [1, 1, 2]); # Expected output: true # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2451 # Input is: IsDigraphEmbedding(ran, src, (), [2, 1], [1, 2, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2453 # Input is: IsDigraphEmbedding(ran, src, (), [2, 1], [1, 1, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEmbedding' must have a value ######## ########> Diff in standard/grahom.tst:2469 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/grahom.tst msecs: 944 false gap> ########> Diff in standard/grape.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/grape.tst:19 # Input is: digraph := CayleyDigraph(group); # Expected output: # But found: Error, Variable: 'CayleyDigraph' must have a value ######## ########> Diff in standard/grape.tst:23 # Input is: digraph := CayleyDigraph(group); # Expected output: # But found: Error, Variable: 'CayleyDigraph' must have a value ######## ########> Diff in standard/grape.tst:25 # Input is: IsCayleyDigraph(digraph); # Expected output: true # But found: Error, Variable: 'IsCayleyDigraph' must have a value ######## ########> Diff in standard/grape.tst:27 # Input is: IsDigraph(digraph); # Expected output: true # But found: Error, Variable: 'IsDigraph' must have a value ######## ########> Diff in standard/grape.tst:29 # Input is: digraph := CayleyDigraph(group, [()]); # Expected output: # But found: Error, Variable: 'CayleyDigraph' must have a value ######## ########> Diff in standard/grape.tst:31 # Input is: GroupOfCayleyDigraph(digraph) = group; # Expected output: true # But found: Error, Variable: 'GroupOfCayleyDigraph' must have a value ######## ########> Diff in standard/grape.tst:33 # Input is: GeneratorsOfCayleyDigraph(digraph); # Expected output: [ () ] # But found: Error, Variable: 'GeneratorsOfCayleyDigraph' must have a value ######## ########> Diff in standard/grape.tst:35 # Input is: digraph := CayleyDigraph(group, [(1, 2, 3, 4), (2, 5)]); # Expected output: Error, the 2nd argument must consist of elements of the 1st argument, # But found: Error, Variable: 'CayleyDigraph' must have a value ######## ########> Diff in standard/grape.tst:38 # Input is: digraph := CayleyDigraph(group); # Expected output: Error, the 1st argument must be a finite group, # But found: Error, Variable: 'CayleyDigraph' must have a value ######## ########> Diff in standard/grape.tst:42 # Input is: digraph := NullDigraph(4); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/grape.tst:44 # Input is: HasDigraphGroup(digraph); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:46 # Input is: digraph := DigraphCopy(digraph); # Expected output: # But found: Error, Variable: 'DigraphCopy' must have a value ######## ########> Diff in standard/grape.tst:48 # Input is: HasDigraphGroup(digraph); # Expected output: false # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:50 # Input is: SetDigraphGroup(digraph, Group((1, 3), (1, 2)(3, 4))); # Expected output: # But found: Error, Variable: 'SetDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:51 # Input is: digraph := DigraphAddEdgeOrbit(digraph, [4, 3]); # Expected output: # But found: Error, Variable: 'DigraphAddEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:53 # Input is: Graph(digraph); # Expected output: rec( adjacencies := [ [ 2, 4 ] ], group := Group([ (1,3), (1,2)(3,4) ]), isGraph := true, names := [ 1 .. 4 ], order := 4, representatives := [ 1 ], schreierVector := [ -1, 2, 1, 2 ] ) # But found: Error, Variable: 'Graph' must have a value ######## ########> Diff in standard/grape.tst:57 # Input is: IsNullDigraph(DigraphRemoveEdgeOrbit(digraph, [4, 3])); # Expected output: true # But found: Error, Variable: 'IsNullDigraph' must have a value ######## ########> Diff in standard/grape.tst:61 # Input is: digraph := CompleteDigraph(4); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/grape.tst:63 # Input is: HasDigraphGroup(digraph); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:65 # Input is: digraph := DigraphCopy(digraph); # Expected output: # But found: Error, Variable: 'DigraphCopy' must have a value ######## ########> Diff in standard/grape.tst:67 # Input is: HasDigraphGroup(digraph); # Expected output: false # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:69 # Input is: SetDigraphGroup(digraph, Group((1, 3), (1, 2)(3, 4))); # Expected output: # But found: Error, Variable: 'SetDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:70 # Input is: digraph := DigraphRemoveEdgeOrbit(digraph, [1, 3]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:72 # Input is: IsCompleteDigraph(DigraphAddEdgeOrbit(digraph, [1, 3])); # Expected output: true # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in standard/grape.tst:74 # Input is: Graph(digraph); # Expected output: rec( adjacencies := [ [ 2, 4 ] ], group := Group([ (1,3), (1,2)(3,4) ]), isGraph := true, names := [ 1 .. 4 ], order := 4, representatives := [ 1 ], schreierVector := [ -1, 2, 1, 2 ] ) # But found: Error, Variable: 'Graph' must have a value ######## ########> Diff in standard/grape.tst:80 # Input is: if DIGRAPHS_IsGrapeLoaded then gr := Digraph(JohnsonGraph(5, 3)); else gr := JohnsonDigraph(5, 3); SetDigraphGroup(gr, Group((1, 7, 10, 6, 3)(2, 8, 4, 9, 5), (4, 7)(5, 8)(6, 9))); fi; # Expected output: # But found: Error, Variable: 'DIGRAPHS_IsGrapeLoaded' must have a value ######## ########> Diff in standard/grape.tst:87 # Input is: HasDigraphGroup(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:89 # Input is: DigraphGroup(gr); # Expected output: Group([ (1,7,10,6,3)(2,8,4,9,5), (4,7)(5,8)(6,9) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:91 # Input is: if DIGRAPHS_IsGrapeLoaded then gr := Digraph(CompleteGraph(Group((1, 2, 3), (1, 2)))); else gr := Digraph([[2, 3], [1, 3], [1, 2]]); SetDigraphGroup(gr, Group((1, 2, 3), (1, 2))); fi; # Expected output: # But found: Error, Variable: 'DIGRAPHS_IsGrapeLoaded' must have a value ######## ########> Diff in standard/grape.tst:97 # Input is: HasDigraphGroup(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:99 # Input is: DigraphGroup(gr); # Expected output: Group([ (1,2,3), (1,2) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:101 # Input is: if DIGRAPHS_IsGrapeLoaded then gr := Digraph(Graph(Group([()]), [1, 2, 3], OnPoints, function(x, y) return x < y; end)); else gr := Digraph([[2, 3], [3], []]); fi; # Expected output: # But found: Error, Variable: 'DIGRAPHS_IsGrapeLoaded' must have a value ######## ########> Diff in standard/grape.tst:111 # Input is: HasDigraphGroup(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:113 # Input is: DigraphGroup(gr); # Expected output: Group(()) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:115 # Input is: HasDigraphGroup(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:119 # Input is: digraph := EdgeOrbitsDigraph(Group((1, 3), (1, 2)(3, 4)), [[1, 2], [4, 5]], 5); # Expected output: # But found: Error, Variable: 'EdgeOrbitsDigraph' must have a value ######## ########> Diff in standard/grape.tst:122 # Input is: OutNeighbours(digraph); # Expected output: [ [ 2, 4, 5 ], [ 1, 3, 5 ], [ 2, 4, 5 ], [ 1, 3, 5 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/grape.tst:124 # Input is: RepresentativeOutNeighbours(digraph); # Expected output: [ [ 2, 4, 5 ], [ ] ] # But found: Error, Variable: 'RepresentativeOutNeighbours' must have a value ######## ########> Diff in standard/grape.tst:126 # Input is: HasDigraphGroup(digraph); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:128 # Input is: DigraphGroup(digraph) = Group((1, 3), (1, 2)(3, 4)); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:130 # Input is: digraph := EdgeOrbitsDigraph(Group(()), [3, 2], 3); # Expected output: # But found: Error, Variable: 'EdgeOrbitsDigraph' must have a value ######## ########> Diff in standard/grape.tst:132 # Input is: OutNeighbours(digraph); # Expected output: [ [ ], [ ], [ 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/grape.tst:134 # Input is: HasDigraphGroup(digraph); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:136 # Input is: HasDigraphGroup(DigraphCopy(digraph)); # Expected output: false # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:138 # Input is: digraph := EdgeOrbitsDigraph(Group(()), [3, 2]); # Expected output: # But found: Error, Variable: 'EdgeOrbitsDigraph' must have a value ######## ########> Diff in standard/grape.tst:140 # Input is: OutNeighbours(digraph); # Expected output: [ ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/grape.tst:142 # Input is: HasDigraphGroup(digraph); # Expected output: true # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/grape.tst:144 # Input is: digraph := EdgeOrbitsDigraph(Group((1, 2)), [[1, 2], [3, 6, 5]]); # Expected output: Error, the 2nd argument must be a list of pairs of positive integers, # But found: Error, Variable: 'EdgeOrbitsDigraph' must have a value ######## ########> Diff in standard/grape.tst:146 # Input is: digraph := EdgeOrbitsDigraph(Group((1, 2)), [[1, 2], [3, -6]]); # Expected output: Error, the 2nd argument must be a list of pairs of positive integers, # But found: Error, Variable: 'EdgeOrbitsDigraph' must have a value ######## ########> Diff in standard/grape.tst:148 # Input is: digraph := EdgeOrbitsDigraph(Group((1, 2)), [[1, 2], [3, 6]], -1); # Expected output: Error, the 3rd argument must be a non-negative integer, # But found: Error, Variable: 'EdgeOrbitsDigraph' must have a value ######## ########> Diff in standard/grape.tst:152 # Input is: gr1 := CayleyDigraph(DihedralGroup(8)); # Expected output: # But found: Error, Variable: 'CayleyDigraph' must have a value ######## ########> Diff in standard/grape.tst:154 # Input is: gr2 := DigraphAddEdgeOrbit(gr1, [1, 8]); # Expected output: # But found: Error, Variable: 'DigraphAddEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:156 # Input is: DigraphEdges(gr1); # Expected output: [ [ 1, 2 ], [ 1, 3 ], [ 1, 4 ], [ 2, 1 ], [ 2, 8 ], [ 2, 6 ], [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [ 4, 6 ], [ 4, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 2 ], [ 5, 8 ], [ 6, 4 ], [ 6, 5 ], [ 6, 2 ], [ 7, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 7 ], [ 8, 6 ], [ 8, 5 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/grape.tst:161 # Input is: DigraphEdges(gr2); # Expected output: [ [ 1, 2 ], [ 1, 3 ], [ 1, 4 ], [ 1, 8 ], [ 2, 1 ], [ 2, 8 ], [ 2, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 4 ], [ 3, 7 ], [ 3, 2 ], [ 4, 6 ], [ 4, 7 ], [ 4, 1 ], [ 4, 5 ], [ 5, 3 ], [ 5, 2 ], [ 5, 8 ], [ 5, 4 ], [ 6, 4 ], [ 6, 5 ], [ 6, 2 ], [ 6, 7 ], [ 7, 8 ], [ 7, 1 ], [ 7, 3 ], [ 7, 6 ], [ 8, 7 ], [ 8, 6 ], [ 8, 5 ], [ 8, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/grape.tst:167 # Input is: gr3 := DigraphRemoveEdgeOrbit(gr2, [1, 8]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:169 # Input is: gr3 = gr1; # Expected output: true # But found: Error, Variable: 'gr3' must have a value ######## ########> Diff in standard/grape.tst:171 # Input is: gr3 := DigraphRemoveEdgeOrbit(gr1, [1, 3]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:173 # Input is: gr3 := DigraphRemoveEdgeOrbit(gr3, [1, 2]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:175 # Input is: gr3 := DigraphRemoveEdgeOrbit(gr3, [1, 4]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:177 # Input is: DigraphAddEdgeOrbit(gr1, [0, 3]); # Expected output: Error, the 2nd argument must be a list of 2 positive integers, # But found: Error, Variable: 'DigraphAddEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:179 # Input is: DigraphAddEdgeOrbit(gr1, [1, 2, 3]); # Expected output: Error, the 2nd argument must be a list of 2 positive integers, # But found: Error, Variable: 'DigraphAddEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:181 # Input is: DigraphRemoveEdgeOrbit(gr1, [0, 3]); # Expected output: Error, the 2nd argument must be a pair of positive integers, # But found: Error, Variable: 'DigraphRemoveEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:183 # Input is: DigraphRemoveEdgeOrbit(gr1, [1, 2, 3]); # Expected output: Error, the 2nd argument must be a pair of positive integers, # But found: Error, Variable: 'DigraphRemoveEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:185 # Input is: gr2 := DigraphAddEdgeOrbit(gr1, [1, 4]); # Expected output: # But found: Error, Variable: 'DigraphAddEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:187 # Input is: gr1 = gr2; # Expected output: true # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/grape.tst:189 # Input is: DigraphAddEdgeOrbit(gr1, [3, 9]); # Expected output: Error, the 2nd argument must be a list of 2 vertices of the 1st argumen\ \ t , # But found: Error, Variable: 'DigraphAddEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:192 # Input is: DigraphRemoveEdgeOrbit(gr1, [3, 9]); # Expected output: Error, the 2nd argument must be a pair of vertices of the 1st argument \ \ , # But found: Error, Variable: 'DigraphRemoveEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:195 # Input is: gr2 := DigraphRemoveEdgeOrbit(gr1, [1, 8]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdgeOrbit' must have a value ######## ########> Diff in standard/grape.tst:197 # Input is: gr1 = gr2; # Expected output: true # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/grape.tst:201 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grape.tst:203 # Input is: if DIGRAPHS_IsGrapeLoaded then Graph(gr); fi; # Expected output: # But found: Error, Variable: 'DIGRAPHS_IsGrapeLoaded' must have a value ######## ########> Diff in standard/grape.tst:208 # Input is: Digraph(SymmetricGroup(3), [1, 2, 3], OnPoints, {x, y} -> x <> y); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/grape.tst:212 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/grape.tst msecs: 150 false gap> ########> Diff in standard/io.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/io.tst:17 # Input is: DigraphFromGraph6String("?"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/io.tst:19 # Input is: DigraphFromGraph6String("E?A?"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/io.tst:21 # Input is: DigraphFromGraph6String("@"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/io.tst:23 # Input is: gr := Digraph(300, [1, 2], [2, 1]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:25 # Input is: str := Graph6String(gr);; # Expected output: # But found: Error, Variable: 'Graph6String' must have a value ######## ########> Diff in standard/io.tst:26 # Input is: DigraphFromGraph6String(str) = gr; # Expected output: true # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/io.tst:28 # Input is: gr := Digraph([[2], [1, 4], [5], [2], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:30 # Input is: str := Graph6String(gr); # Expected output: "DaG" # But found: Error, Variable: 'Graph6String' must have a value ######## ########> Diff in standard/io.tst:32 # Input is: DigraphFromGraph6String(str); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/io.tst:36 # Input is: List(l, x -> DigraphFromGraph6String(x)); # Expected output: [ , , , , , , , ] # But found: Syntax warning: Unbound global variable in stream:1 List(l, x -> DigraphFromGraph6String(x)); ^^^^^^^^^^^^^^^^^^^^^^^ Error, Variable: 'DigraphFromGraph6String' must have an assigned value ######## ########> Diff in standard/io.tst:45 # Input is: DigraphFromGraph6String(ListWithIdenticalEntries(500, '~')); # Expected output: Error, the 2nd argument is not a valid graph6 string, # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/io.tst:47 # Input is: D := DigraphFromGraph6String(IsMutableDigraph, "Dhc"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/io.tst:51 # Input is: str := Concatenation(DIGRAPHS_Dir(), "/data/graph5.g6.gz");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:52 # Input is: list := ReadDigraphs(str);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:53 # Input is: Size(list); # Expected output: 34 # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:55 # Input is: list2 := ReadDigraphs(str, DigraphFromGraph6String);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:56 # Input is: list = list2; # Expected output: true # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:58 # Input is: gr := ReadDigraphs(str, 10); # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:60 # Input is: list = gr; # Expected output: false # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:62 # Input is: list[10] = gr; # Expected output: true # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:64 # Input is: ReadDigraphs(34, DigraphFromGraph6String, 5); # Expected output: Error, the 1st argument must be a string or IO file object, # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:66 # Input is: ReadDigraphs(str, (1, 6, 5), 5); # Expected output: Error, the argument must be a function or fail, # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:68 # Input is: ReadDigraphs(str, DigraphFromGraph6String, 0); # Expected output: Error, the argument must be a positive integer or infinity # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:70 # Input is: str := Concatenation(DIGRAPHS_Dir(), "/data/tree9.4.txt");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:71 # Input is: list := ReadDigraphs(str);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:72 # Input is: list2 := ReadDigraphs(str, DigraphPlainTextLineDecoder(" ", " ", 1), infinity);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:75 # Input is: list = list2; # Expected output: true # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:77 # Input is: ReadDigraphs(str, 2, true, "elephant"); # Expected output: Error, there must be 1, 2, or 3 arguments, # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:80 # Input is: ReadDigraphs(badfilename, 3); # Expected output: Error, cannot open the file given as the 1st argument , # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:84 # Input is: DigraphFromSparse6String(":@"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:86 # Input is: DigraphFromSparse6String(Concatenation(":[___dCfEcdFjCIideLhIfJ", "kLgkQge`RSbPTaOTbMNaS`QY")); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:89 # Input is: DigraphFromSparse6String(":I`ACWqHKhhccTF"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:91 # Input is: DigraphFromSparse6String(":U___gFecGdHcEdFcFdE`GHbILaJKbNaM`RS"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:93 # Input is: DigraphFromSparse6String(":U___fEcdcdIeHfGcFdE`GHbILaJKbNaM`RS"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:95 # Input is: DigraphFromSparse6String(":U___fEcdGcdeJfIcFdEbLNaKM`H`GbIRaJQ"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:97 # Input is: gr := Digraph([[2], [1, 4], [5], [2], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:99 # Input is: str := Sparse6String(gr); # Expected output: ":Dapj" # But found: Error, Variable: 'Sparse6String' must have a value ######## ########> Diff in standard/io.tst:101 # Input is: DigraphFromSparse6String(str); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:103 # Input is: gr := Digraph(231, [1, 1, 3, 4], [3, 4, 1, 1]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:105 # Input is: str := Sparse6String(gr); # Expected output: ":~?Bf_O?_F" # But found: Error, Variable: 'Sparse6String' must have a value ######## ########> Diff in standard/io.tst:107 # Input is: DigraphFromSparse6String(str); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:109 # Input is: gr := Digraph(rec(DigraphNrVertices := 2 ^ 17, DigraphSource := [1, 1, 3, 4, 1\ 0, 100], DigraphRange := [3, 4, 1, 1, 100, 10])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:112 # Input is: str := Sparse6String(gr); # Expected output: ":~_??_?A???_??_@b??H" # But found: Error, Variable: 'Sparse6String' must have a value ######## ########> Diff in standard/io.tst:114 # Input is: DigraphFromSparse6String(str); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:116 # Input is: DigraphFromSparse6String(IsMutableDigraph, ":Sa?dBDf?aiH`El@AjK_@gqBIp"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:120 # Input is: gr := Digraph([[5], [1, 2, 5], [1], [2], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:122 # Input is: str := Digraph6String(gr); # Expected output: "&DBeA@?" # But found: Error, Variable: 'Digraph6String' must have a value ######## ########> Diff in standard/io.tst:124 # Input is: gr = DigraphFromDigraph6String("+DWg?[?"); # deprecated format # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/io.tst:126 # Input is: DigraphFromDigraph6String(str); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/io.tst:128 # Input is: gr := Digraph(231, [1 .. 100], [1 .. 100] * 0 + 200); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:130 # Input is: str := Digraph6String(gr);; # Expected output: # But found: Error, Variable: 'Digraph6String' must have a value ######## ########> Diff in standard/io.tst:131 # Input is: DigraphFromDigraph6String(str); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/io.tst:133 # Input is: D := DigraphFromDigraph6String(IsMutableDigraph, "&DOOOW?"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/io.tst:137 # Input is: gr := Digraph([[1, 4], [2, 3, 4], [2, 4], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:139 # Input is: str := DiSparse6String(gr); # Expected output: ".CgXoHe@J" # But found: Error, Variable: 'DiSparse6String' must have a value ######## ########> Diff in standard/io.tst:141 # Input is: DigraphFromDiSparse6String(str) = gr; # Expected output: true # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:143 # Input is: gr := Digraph(rec(DigraphNrVertices := 1617, DigraphSource := [1 .. 100], DigraphRange := Concatenation([1 .. 50], [1 .. 50] * 0 + 51))); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:146 # Input is: str := DiSparse6String(gr);; # Expected output: # But found: Error, Variable: 'DiSparse6String' must have a value ######## ########> Diff in standard/io.tst:147 # Input is: DigraphFromDiSparse6String(str) = gr; # Expected output: true # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:149 # Input is: gr := Digraph(rec(DigraphNrVertices := 2 ^ 17, DigraphSource := [1 .. 100], DigraphRange := Concatenation([50 .. 98], [-1050 .. -1000] * -1))); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:152 # Input is: str := DiSparse6String(gr);; # Expected output: # But found: Error, Variable: 'DiSparse6String' must have a value ######## ########> Diff in standard/io.tst:153 # Input is: DigraphFromDiSparse6String(str) = gr; # Expected output: true # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:155 # Input is: gr := Digraph([[1, 1, 4], [2, 3, 4], [2, 4], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:157 # Input is: str := DiSparse6String(gr); # Expected output: ".CgXo?eWCn" # But found: Error, Variable: 'DiSparse6String' must have a value ######## ########> Diff in standard/io.tst:159 # Input is: gr = DigraphFromDiSparse6String(str); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/io.tst:161 # Input is: gr := Digraph(rec(DigraphNrVertices := 7890, DigraphSource := [1 .. 100] * 0 +\ 1000, DigraphRange := [1 .. 100] * 0 + 2000)); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:164 # Input is: str := DiSparse6String(gr);; # Expected output: # But found: Error, Variable: 'DiSparse6String' must have a value ######## ########> Diff in standard/io.tst:165 # Input is: gr = DigraphFromDiSparse6String(str); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/io.tst:167 # Input is: DigraphFromDiSparse6String(IsMutableDigraph, ".IoCuh?oR"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:172 # Input is: gr[1] := Digraph(2 ^ 16, [1, 1, 3, 4, 7, 10, 100], [3, 4, 1, 1, 3, 100, 10]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:175 # Input is: gr[2] := Digraph(1000, [1 .. 1000], Concatenation([2 .. 1000], [1])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:179 # Input is: gr[3] := Digraph([[1, 1, 4], [2, 3, 4], [2, 4], [2], [1, 3, 3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:181 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.ds6");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:182 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:184 # Input is: ReadDigraphs(filename); # Expected output: [ , , ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:188 # Input is: gr[1] := Digraph([[5], [1, 2, 5], [1], [2], [4]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:189 # Input is: gr[2] := Digraph(rec(DigraphNrVertices := 105, DigraphSource := [1 .. 100], DigraphRange := [1 .. 100] * 0 + 52));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:191 # Input is: gr[3] := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/io.tst:192 # Input is: gr[4] := Digraph([[6, 7], [6, 9], [1, 3, 4, 5, 8, 9], [1, 2, 3, 4, 5, 6, 7, 10], [1, 5, 6, 7, 10], [2, 4, 5, 9, 10], [3, 4, 5, 6, 7, 8, 9, 10], [1, 3, 5, 7, 8, 9], [1, 2, 5], [1, 2]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:195 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.d6");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:196 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:198 # Input is: ReadDigraphs(filename); # Expected output: [ , , , ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:203 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.txt");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:204 # Input is: WriteDigraphs(filename, CompleteDigraph(2), DigraphPlainTextLineEncoder(" ", " ", -1)); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:208 # Input is: gr[1] := Digraph([[5], [1, 2, 5], [1], [2], [4]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:209 # Input is: DigraphGroup(gr[1]); # Expected output: Group(()) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/io.tst:211 # Input is: gr[2] := Digraph(rec(DigraphNrVertices := 105, DigraphSource := [1 .. 100], DigraphRange := [1 .. 100] * 0 + 52));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:213 # Input is: gr[3] := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/io.tst:214 # Input is: gr[4] := Digraph([[6, 7], [6, 9], [1, 3, 4, 5, 8, 9], [1, 2, 3, 4, 5, 6, 7, 10], [1, 5, 6, 7, 10], [2, 4, 5, 9, 10], [3, 4, 5, 6, 7, 8, 9, 10], [1, 3, 5, 7, 8, 9], [1, 2, 5], [1, 2]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:217 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.p");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:218 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:220 # Input is: ReadDigraphs(filename); # Expected output: [ , , , ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:225 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.txt");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:226 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:232 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.txt");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:233 # Input is: ReadDigraphs(filename); # Expected output: [ , , , ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:238 # Input is: gr := [CompleteDigraph(30)];; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:239 # Input is: DigraphGroup(gr[1]) = SymmetricGroup(30); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/io.tst:241 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.p");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:242 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:244 # Input is: ReadDigraphs(filename); # Expected output: [ ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:247 # Input is: gr[1] := Digraph(30, [1, 2], [2, 1]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:249 # Input is: gr[2] := Digraph([[2], [1, 4], [5], [2], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:251 # Input is: gr[3] := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:253 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.g6");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:254 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:256 # Input is: rdgr := ReadDigraphs(filename);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:257 # Input is: gr = rdgr; # Expected output: true # But found: Error, Variable: 'rdgr' must have a value ######## ########> Diff in standard/io.tst:259 # Input is: WriteDigraphs(filename, gr, Graph6String, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:261 # Input is: gr = ReadDigraphs(filename); # Expected output: true # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:263 # Input is: gr[3] := Digraph([[1, 2], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:265 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.s6.bz2");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:266 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:268 # Input is: rdgr := ReadDigraphs(filename);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:269 # Input is: gr = rdgr; # Expected output: true # But found: Error, Variable: 'rdgr' must have a value ######## ########> Diff in standard/io.tst:271 # Input is: newfilename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.bz2");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:272 # Input is: IO_rename(filename, newfilename); # Expected output: true # But found: Error, Variable: 'IO_rename' must have a value ######## ########> Diff in standard/io.tst:274 # Input is: rdgr := ReadDigraphs(newfilename); # Expected output: Error, cannot determine the file format, # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:276 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.h6.bz2");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:277 # Input is: IO_rename(newfilename, filename); # Expected output: true # But found: Error, Variable: 'IO_rename' must have a value ######## ########> Diff in standard/io.tst:279 # Input is: rdgr := ReadDigraphs(filename); # Expected output: Error, cannot determine the file format, # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:283 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/helloworld.g6");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:284 # Input is: f := DigraphFile(filename, "w");; # Expected output: # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:285 # Input is: WriteDigraphs(f, List([1 .. 5], CompleteDigraph)); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:287 # Input is: f := DigraphFile(filename, "r");; # Expected output: # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:288 # Input is: ReadDigraphs(f); # Expected output: [ , , , , ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:294 # Input is: f := DigraphFile(filename, "a");; # Expected output: # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:295 # Input is: WriteDigraphs(f, CycleDigraph(5)); # Expected output: Error, the argument must be a symmetric digraph with no loops or multiple \ \ edges, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:298 # Input is: WriteDigraphs(f, JohnsonDigraph(6, 3)); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:300 # Input is: f := DigraphFile(filename, "r");; # Expected output: # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:301 # Input is: ReadDigraphs(f); # Expected output: [ , , , , , ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:308 # Input is: newfilename := Concatenation(DIGRAPHS_Dir(), "/tst/out/hello2.g6");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:309 # Input is: IO_rename(filename, newfilename); # Expected output: true # But found: Error, Variable: 'IO_rename' must have a value ######## ########> Diff in standard/io.tst:311 # Input is: ReadDigraphs(f); # Expected output: [ ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:313 # Input is: it := IteratorFromDigraphFile(newfilename); # Expected output: # But found: Error, Variable: 'IteratorFromDigraphFile' must have a value ######## ########> Diff in standard/io.tst:315 # Input is: NextIterator(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:317 # Input is: NextIterator(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:319 # Input is: it := IteratorFromDigraphFile(newfilename, DigraphFromGraph6String); # Expected output: # But found: Error, Variable: 'IteratorFromDigraphFile' must have a value ######## ########> Diff in standard/io.tst:321 # Input is: NextIterator(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:323 # Input is: IsDoneIterator(it); # Expected output: false # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:325 # Input is: NextIterator(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:327 # Input is: NextIterator(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:329 # Input is: NextIterator(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:331 # Input is: NextIterator(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:333 # Input is: NextIterator(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:335 # Input is: NextIterator(it); # Expected output: IO_Nothing # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:337 # Input is: NextIterator(it); # Expected output: IO_Nothing # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:339 # Input is: IsDoneIterator(it); # Expected output: true # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:341 # Input is: it := ShallowCopy(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:343 # Input is: NextIterator(it); # Expected output: # But found: Error, Variable: 'it' must have a value ######## ########> Diff in standard/io.tst:345 # Input is: IteratorFromDigraphFile(1, 2, 3); # Expected output: Error, there must be 1 or 2 arguments, # But found: Error, Variable: 'IteratorFromDigraphFile' must have a value ######## ########> Diff in standard/io.tst:347 # Input is: IteratorFromDigraphFile(1, 2); # Expected output: Error, the 1st argument must be a string, # But found: Error, Variable: 'IteratorFromDigraphFile' must have a value ######## ########> Diff in standard/io.tst:349 # Input is: IteratorFromDigraphFile("happy", "happy"); # Expected output: Error, the 2nd argument must be a function or fail, # But found: Error, Variable: 'IteratorFromDigraphFile' must have a value ######## ########> Diff in standard/io.tst:351 # Input is: f := DigraphFile(Concatenation(DIGRAPHS_Dir(), "/data/test-1.d6"));; # Expected output: # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:352 # Input is: IO_Close(f); # Expected output: true # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:354 # Input is: f := DigraphFile(Concatenation(DIGRAPHS_Dir(), "/data/test-1.d6"), Digraph6String);; # Expected output: # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:356 # Input is: IO_Close(f); # Expected output: true # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:358 # Input is: f := DigraphFile(1, 2, 3, 4); # Expected output: Error, there must be 1, 2, or 3 arguments, # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:360 # Input is: DigraphFile(Concatenation(DIGRAPHS_Dir(), "/data/test-1.d6"), Digraph6String, "wtf");; # Expected output: Error, the 3rd argument must be one of "a", "w", or "r" # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:363 # Input is: ReadDigraphs(f); # Expected output: Error, the 1st argument is a closed file, # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:365 # Input is: f := DigraphFile(Concatenation(DIGRAPHS_Dir(), "/tst/out/test.d6"), Digraph6String, "w");; # Expected output: # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:367 # Input is: ReadDigraphs(f); # Expected output: Error, the mode of the 1st argument must be "r", # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:369 # Input is: IO_Close(f); # Expected output: true # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:373 # Input is: gr := Digraph([[1, 2], [2, 3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:375 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/plain.txt");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:376 # Input is: WritePlainTextDigraph(1, 2, 3, 4); # Expected output: Error, the 1st argument must be a string, # But found: Error, Variable: 'WritePlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:378 # Input is: WritePlainTextDigraph(".", gr, ",", -2); # Expected output: Error, cannot open the file given as the 1st argument , # But found: Error, Variable: 'WritePlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:380 # Input is: WritePlainTextDigraph(filename, gr, ",", -3); # Expected output: # But found: Error, Variable: 'WritePlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:381 # Input is: WritePlainTextDigraph(filename, gr, ",", -1); # Expected output: # But found: Error, Variable: 'WritePlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:382 # Input is: ReadPlainTextDigraph(1, 2, 3, 4); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `ReadPlainTextDigraph' on 4 arguments # But found: Error, Variable: 'ReadPlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:385 # Input is: ReadPlainTextDigraph(filename, ",", 1, "i"); # Expected output: # But found: Error, Variable: 'ReadPlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:390 # Input is: ReadPlainTextDigraph(filename, ",", 1, "i"); # Expected output: Error, cannot open the file given as the 2nd argument , # But found: Error, Variable: 'ReadPlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:392 # Input is: WritePlainTextDigraph(filename, gr, ',', -1); # Expected output: Error, the 3rd argument must be a string, # But found: Error, Variable: 'WritePlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:394 # Input is: WritePlainTextDigraph(1, gr, ',', -1); # Expected output: Error, the 1st argument must be a string, # But found: Error, Variable: 'WritePlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:396 # Input is: WritePlainTextDigraph(1, gr, ",", "a"); # Expected output: Error, the 1st argument must be a string, # But found: Error, Variable: 'WritePlainTextDigraph' must have a value ######## ########> Diff in standard/io.tst:400 # Input is: gr := TournamentLineDecoder("101001"); # Expected output: # But found: Error, Variable: 'TournamentLineDecoder' must have a value ######## ########> Diff in standard/io.tst:402 # Input is: OutNeighbours(gr); # Expected output: [ [ 2, 4 ], [ ], [ 1, 2, 4 ], [ 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/io.tst:404 # Input is: gr := TournamentLineDecoder(""); # Expected output: # But found: Error, Variable: 'TournamentLineDecoder' must have a value ######## ########> Diff in standard/io.tst:408 # Input is: gr := AdjacencyMatrixUpperTriangleLineDecoder("100101"); # Expected output: # But found: Error, Variable: 'AdjacencyMatrixUpperTriangleLineDecoder' must have a value ######## ########> Diff in standard/io.tst:410 # Input is: OutNeighbours(gr); # Expected output: [ [ 2 ], [ 3 ], [ 4 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/io.tst:412 # Input is: gr := AdjacencyMatrixUpperTriangleLineDecoder("11y111x111"); # Expected output: # But found: Error, Variable: 'AdjacencyMatrixUpperTriangleLineDecoder' must have a value ######## ########> Diff in standard/io.tst:414 # Input is: OutNeighbours(gr); # Expected output: [ [ 2, 3, 5 ], [ 3, 4 ], [ 4, 5 ], [ 5 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/io.tst:416 # Input is: gr := AdjacencyMatrixUpperTriangleLineDecoder(""); # Expected output: # But found: Error, Variable: 'AdjacencyMatrixUpperTriangleLineDecoder' must have a value ######## ########> Diff in standard/io.tst:420 # Input is: gr := TCodeDecoder("3 2 0 2 2 1"); # Expected output: # But found: Error, Variable: 'TCodeDecoder' must have a value ######## ########> Diff in standard/io.tst:422 # Input is: OutNeighbours(gr); # Expected output: [ [ 3 ], [ ], [ 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/io.tst:424 # Input is: gr = TCodeDecoderNC("3 2 0 2 2 1"); # Expected output: true # But found: Error, Variable: 'TCodeDecoderNC' must have a value ######## ########> Diff in standard/io.tst:426 # Input is: gr := TCodeDecoder("12 3 0 10 6 2 8 8"); # Expected output: # But found: Error, Variable: 'TCodeDecoder' must have a value ######## ########> Diff in standard/io.tst:428 # Input is: OutNeighbours(gr); # Expected output: [ [ 11 ], [ ], [ ], [ ], [ ], [ ], [ 3 ], [ ], [ 9 ], [ ], [ ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/io.tst:430 # Input is: gr := TCodeDecoder(3); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `TCodeDecoder' on 1 arguments # But found: Error, Variable: 'TCodeDecoder' must have a value ######## ########> Diff in standard/io.tst:433 # Input is: gr := TCodeDecoder("gr 5"); # Expected output: Error, the 2nd argument must be a string of space-separated non-negative i\ \ ntegers, # But found: Error, Variable: 'TCodeDecoder' must have a value ######## ########> Diff in standard/io.tst:436 # Input is: gr := TCodeDecoder("10"); # Expected output: Error, the 2nd argument must be a string of at least two integers, # But found: Error, Variable: 'TCodeDecoder' must have a value ######## ########> Diff in standard/io.tst:438 # Input is: gr := TCodeDecoder("2 2 0 4 1 2"); # Expected output: Error, the 2nd argument must be a string consisting of integers in the ran\ \ ge [0 .. 2], # But found: Error, Variable: 'TCodeDecoder' must have a value ######## ########> Diff in standard/io.tst:441 # Input is: gr := TCodeDecoder("3 2 0 2"); # Expected output: Error, the 2nd argument must be a string of length at least 6 # But found: Error, Variable: 'TCodeDecoder' must have a value ######## ########> Diff in standard/io.tst:443 # Input is: gr := TCodeDecoderNC("100 5 0 12 48 49 99 1 54 49 49 49"); # Expected output: # But found: Error, Variable: 'TCodeDecoderNC' must have a value ######## ########> Diff in standard/io.tst:447 # Input is: DigraphFromGraph6String(""); # Expected output: Error, the 2nd argument must be a non-empty string, # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/io.tst:449 # Input is: DigraphFromDigraph6String(""); # Expected output: Error, the 2nd argument must be a non-empty string, # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/io.tst:451 # Input is: DigraphFromSparse6String(""); # Expected output: Error, the 2nd argument must be a non-empty string, # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:453 # Input is: DigraphFromDiSparse6String(""); # Expected output: Error, the 2nd argument must be a non-empty string, # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:457 # Input is: DigraphFromDiSparse6String("I'm a string"); # Expected output: Error, the 2nd argument is not a valid disparse6 string, # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:459 # Input is: DigraphFromDiSparse6String(".~~"); # Expected output: Error, the 2nd argument is not a valid disparse6 string, # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:461 # Input is: DigraphFromDiSparse6String(".~~??@???o??N"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:463 # Input is: DigraphFromDiSparse6String(".~??"); # Expected output: Error, the 2nd argument is not a valid disparse6 string, # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:465 # Input is: DiSparse6String(CompleteDigraph(1)); # Expected output: ".@~" # But found: Error, Variable: 'DiSparse6String' must have a value ######## ########> Diff in standard/io.tst:467 # Input is: DigraphFromDiSparse6String(".@~"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:469 # Input is: gr := Digraph([[], [], [1, 2]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:470 # Input is: DiSparse6String(gr); # Expected output: ".BoN" # But found: Error, Variable: 'DiSparse6String' must have a value ######## ########> Diff in standard/io.tst:474 # Input is: gr := CompleteDigraph(3); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:476 # Input is: str := PlainTextString(gr); # Expected output: "0 1 0 2 1 0 1 2 2 0 2 1" # But found: Error, Variable: 'PlainTextString' must have a value ######## ########> Diff in standard/io.tst:478 # Input is: gr2 := DigraphFromPlainTextString(str); # Expected output: # But found: Error, Variable: 'DigraphFromPlainTextString' must have a value ######## ########> Diff in standard/io.tst:480 # Input is: gr = gr2; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/io.tst:482 # Input is: D := DigraphFromPlainTextString(IsMutableDigraph, "0 1 1 2 2 3 3 4 4 0"); # Expected output: # But found: Error, Variable: 'DigraphFromPlainTextString' must have a value ######## ########> Diff in standard/io.tst:487 # Input is: DigraphFromGraph6String("~llk"); # Expected output: Error, the 2nd argument is not a valid graph6 string, # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/io.tst:489 # Input is: DigraphFromDigraph6String("&~llk"); # Expected output: Error, the 2nd argument is not a valid digraph6 string, # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/io.tst:491 # Input is: DigraphFromSparse6String(":~~l"); # Expected output: Error, the 2nd argument is not a valid sparse6 string, # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:493 # Input is: DigraphFromSparse6String(":~hl"); # Expected output: Error, the 2nd argument is not a valid sparse6 string, # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:495 # Input is: DigraphFromDiSparse6String(".~~l"); # Expected output: Error, the 2nd argument is not a valid disparse6 string, # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:499 # Input is: DigraphFromDigraph6String("x"); # Expected output: Error, the 2nd argument is not a valid digraph6 string, # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/io.tst:501 # Input is: DigraphFromSparse6String("y"); # Expected output: Error, the 2nd argument is not a valid sparse6 string, # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:503 # Input is: DigraphFromDiSparse6String("z"); # Expected output: Error, the 2nd argument is not a valid disparse6 string, # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/io.tst:507 # Input is: Sparse6String(ChainDigraph(3)); # Expected output: Error, the argument must be a symmetric digraph, # But found: Error, Variable: 'Sparse6String' must have a value ######## ########> Diff in standard/io.tst:509 # Input is: Sparse6String(CompleteDigraph(1)); # Expected output: ":@" # But found: Error, Variable: 'Sparse6String' must have a value ######## ########> Diff in standard/io.tst:511 # Input is: gr := Digraph([[1], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:512 # Input is: Sparse6String(gr); # Expected output: ":AF" # But found: Error, Variable: 'Sparse6String' must have a value ######## ########> Diff in standard/io.tst:516 # Input is: DigraphFromSparse6String(":TdBkJ`Kq?x"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:518 # Input is: Sparse6String(last); # Expected output: ":TdBkJ`Kq?" # But found: Error, Variable: 'Sparse6String' must have a value ######## ########> Diff in standard/io.tst:522 # Input is: DigraphPlainTextLineDecoder(" ", " ", 1, "."); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphPlainTextLineDecoder' on 4 argum\ \ ents # But found: Error, Variable: 'DigraphPlainTextLineDecoder' must have a value ######## ########> Diff in standard/io.tst:528 # Input is: list := [CompleteDigraph(4), CycleDigraph(8), "hello world"];; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:529 # Input is: WriteDigraphs(72, list, "w"); # Expected output: Error, the 1st argument must be a string or a file, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:531 # Input is: WriteDigraphs("mylist", list, "w"); # Expected output: Error, the 2nd argument must be a digraph or list of digraphs, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:533 # Input is: WriteDigraphs(1, 2, 3, 4, 5); # Expected output: Error, there must be 2, 3, or 4 arguments, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:535 # Input is: WriteDigraphs(filename, CompleteDigraph(2), 3, "w"); # Expected output: Error, the argument must be a function or fail, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:537 # Input is: WriteDigraphs(filename, CompleteDigraph(2), Graph6String, "r"); # Expected output: Error, the argument must be "a" or "w", # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:539 # Input is: filename := DigraphFile(Concatenation(DIGRAPHS_Dir(), "/tst/out/test.g6"));; # Expected output: # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:541 # Input is: gr := CompleteDigraph(1);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:542 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: Error, the 1st argument is a file, and so there must only be 2 argu\ \ ments, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:545 # Input is: WriteDigraphs(filename, gr, fail, "w"); # Expected output: Error, the 1st argument is a file, and so there must only be 2 argu\ \ ments, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:548 # Input is: IO_Close(filename); # Expected output: true # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:550 # Input is: WriteDigraphs(filename, gr); # Expected output: Error, the 1st argument is closed, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:552 # Input is: f := DigraphFile(Concatenation(DIGRAPHS_Dir(), "/tst/out/test.d6"), Digraph6String, "r");; # Expected output: # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:554 # Input is: WriteDigraphs(f, EmptyDigraph(4)); # Expected output: Error, the mode of the 1st argument must be "w" or "a", # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:556 # Input is: IO_Close(f); # Expected output: true # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:560 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/choose.gz");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:561 # Input is: list := [CompleteDigraph(5), EmptyDigraph(100), CompleteDigraph(3)];; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:562 # Input is: ForAll(list, IsSymmetricDigraph); # Expected output: true # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:564 # Input is: WriteDigraphs(filename, list, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:566 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/choose.s6.gz");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:567 # Input is: list2 := ReadDigraphs(filename);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:568 # Input is: list = list2; # Expected output: true # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:570 # Input is: mult := Digraph([[1, 2], [1, 1, 3], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:571 # Input is: list := [CompleteDigraph(5), EmptyDigraph(100), mult];; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:572 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/choosemult.gz");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:573 # Input is: WriteDigraphs(filename, list, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:575 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/choosemult.ds6.gz");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:576 # Input is: list2 := ReadDigraphs(filename);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:577 # Input is: list = list2; # Expected output: true # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:579 # Input is: list := [CompleteDigraph(3), CycleDigraph(100), EmptyDigraph(2)];; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:580 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/choose");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:581 # Input is: WriteDigraphs(filename, list, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:583 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/choose.ds6");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:584 # Input is: list2 := ReadDigraphs(filename);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:585 # Input is: list = list2; # Expected output: true # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:587 # Input is: gr := Digraph([[2, 2], [1, 1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:588 # Input is: IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/io.tst:590 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/alone");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:591 # Input is: WriteDigraphs(filename, [gr], "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:593 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/alone.ds6");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:594 # Input is: list2 := ReadDigraphs(filename); # Expected output: [ ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:596 # Input is: list2[1] = gr; # Expected output: true # But found: Error, Variable: 'list2' must have a value ######## ########> Diff in standard/io.tst:598 # Input is: list := [CompleteDigraph(10), CompleteDigraph(15)];; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:599 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/dense.bz2");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:600 # Input is: WriteDigraphs(filename, list, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:602 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/dense.g6.bz2");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:603 # Input is: list2 := ReadDigraphs(filename);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:604 # Input is: list = list2; # Expected output: true # But found: Error, Variable: 'list' must have a value ######## ########> Diff in standard/io.tst:606 # Input is: gr := [Digraph([[1, 2, 3, 4], [1, 2, 3, 4], [1, 3, 4], [1, 2, 3, 4]])]; # Expected output: [ ] # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:608 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/dense");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:609 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: IO_OK # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:611 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/dense.d6");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:612 # Input is: list2 := ReadDigraphs(filename);; # Expected output: # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:613 # Input is: gr = list2; # Expected output: true # But found: Error, Variable: 'list2' must have a value ######## ########> Diff in standard/io.tst:616 # Input is: WriteDigraphs(filename, gr, "w"); # Expected output: Error, cannot open the file given as the 1st argument , # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:620 # Input is: Graph6String(ChainDigraph(4)); # Expected output: Error, the argument must be a symmetric digraph with no loops or multiple \ \ edges, # But found: Error, Variable: 'Graph6String' must have a value ######## ########> Diff in standard/io.tst:623 # Input is: DIGRAPHS_Graph6Length(-1); # Expected output: fail # But found: Error, Variable: 'DIGRAPHS_Graph6Length' must have a value ######## ########> Diff in standard/io.tst:625 # Input is: DIGRAPHS_Graph6Length(68719476737); # Expected output: fail # But found: Error, Variable: 'DIGRAPHS_Graph6Length' must have a value ######## ########> Diff in standard/io.tst:627 # Input is: DIGRAPHS_Graph6Length(258748); # Expected output: [ 63, 63, 0, 0, 0, 63, 10, 60 ] # But found: Error, Variable: 'DIGRAPHS_Graph6Length' must have a value ######## ########> Diff in standard/io.tst:629 # Input is: WriteDigraphs(1, 1, "w"); # Expected output: Error, the 1st argument must be a string or a file, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:631 # Input is: WriteDigraphs("string", [1], "w"); # Expected output: Error, the 2nd argument must be a digraph or list of digraphs, # But found: Error, Variable: 'WriteDigraphs' must have a value ######## ########> Diff in standard/io.tst:633 # Input is: Sparse6String(EmptyDigraph(2 ^ 20)); # Expected output: ":~~??C???" # But found: Error, Variable: 'Sparse6String' must have a value ######## ########> Diff in standard/io.tst:635 # Input is: DigraphFromSparse6String(":~~??C???"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/io.tst:640 # Input is: gr := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/io.tst:642 # Input is: WriteDIMACSDigraph(filename, 0); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `WriteDIMACSDigraph' on 2 arguments # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:645 # Input is: WriteDIMACSDigraph(0, gr); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `WriteDIMACSDigraph' on 2 arguments # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:648 # Input is: WriteDIMACSDigraph(gr, filename); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `WriteDIMACSDigraph' on 2 arguments # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:651 # Input is: WriteDIMACSDigraph("file", ChainDigraph(2)); # Expected output: Error, the 2nd argument must be a symmetric digraph, # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:653 # Input is: WriteDIMACSDigraph(filename, gr); # Expected output: Error, cannot open the file given as the 1st argument , # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:656 # Input is: D := CompleteDigraph(3); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:658 # Input is: SetDigraphVertexLabels(D, ["a", "b", "c"]); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/io.tst:659 # Input is: WriteDIMACSDigraph(filename, CompleteDigraph(3)); # Expected output: IO_OK # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:664 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/loops.dimacs");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:665 # Input is: gr := EmptyDigraph(1); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/io.tst:667 # Input is: DigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/io.tst:669 # Input is: HasDigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphHasLoops' must have a value ######## ########> Diff in standard/io.tst:671 # Input is: WriteDIMACSDigraph(filename, gr); # Expected output: IO_OK # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:673 # Input is: gr := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:675 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/io.tst:677 # Input is: HasDigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'HasDigraphHasLoops' must have a value ######## ########> Diff in standard/io.tst:679 # Input is: WriteDIMACSDigraph(filename, gr); # Expected output: IO_OK # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:681 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/loops.dimacs.gz");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:682 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:684 # Input is: HasDigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphHasLoops' must have a value ######## ########> Diff in standard/io.tst:686 # Input is: WriteDIMACSDigraph(filename, gr); # Expected output: IO_OK # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:690 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/labels.dimacs");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:691 # Input is: gr := Digraph([[2], [1, 3], [2]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:692 # Input is: SetDigraphVertexLabels(gr, Elements(CyclicGroup(3))); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/io.tst:693 # Input is: WriteDIMACSDigraph(filename, gr); # Expected output: IO_OK # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:697 # Input is: ReadDIMACSDigraph("does/not/exist.gz"); # Expected output: Error, cannot open the file given as the 2nd argument , # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:699 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/bad.dimacs");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:702 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:703 # Input is: IO_WriteLine(file, "file for testing purposes");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:704 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:705 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:710 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:711 # Input is: IO_WriteLine(file, "c file for testing purposes");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:712 # Input is: IO_WriteLine(file, "p edge 'a' 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:713 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:714 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:717 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:718 # Input is: IO_WriteLine(file, "p edge 2 -1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:719 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:720 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:723 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:724 # Input is: IO_WriteLine(file, "p edge 1 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:725 # Input is: IO_WriteLine(file, "p edge 1 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:726 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:727 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:730 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:731 # Input is: IO_WriteLine(file, "p edge 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:732 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:733 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:736 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:737 # Input is: IO_WriteLine(file, "p fail 1 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:738 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:739 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:742 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:743 # Input is: IO_WriteLine(file, "c empty file");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:744 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:745 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:750 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:751 # Input is: IO_WriteLine(file, "e 1 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:752 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:753 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:758 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:759 # Input is: IO_WriteLine(file, "p edge 2 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:760 # Input is: IO_WriteLine(file, "n 2");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:761 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:762 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:765 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:766 # Input is: IO_WriteLine(file, "p edge 2 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:767 # Input is: IO_WriteLine(file, "n 3 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:768 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:769 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:772 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:773 # Input is: IO_WriteLine(file, "p edge 2 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:774 # Input is: IO_WriteLine(file, "n 2 a");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:775 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:776 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:781 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:782 # Input is: IO_WriteLine(file, "p edge 2 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:783 # Input is: IO_WriteLine(file, "e 2 1 3");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:784 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:785 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:788 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:789 # Input is: IO_WriteLine(file, "p edge 2 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:790 # Input is: IO_WriteLine(file, "e 2 a");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:791 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:792 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:795 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:796 # Input is: IO_WriteLine(file, "p edge 2 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:797 # Input is: IO_WriteLine(file, "e 3 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:798 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:799 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:802 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:803 # Input is: IO_WriteLine(file, "p edge 2 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:804 # Input is: IO_WriteLine(file, "e 1 3");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:805 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:806 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:811 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:812 # Input is: IO_WriteLine(file, "p edge 2 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:813 # Input is: IO_WriteLine(file, "d");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:814 # Input is: IO_WriteLine(file, "v");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:815 # Input is: IO_WriteLine(file, "x");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:816 # Input is: IO_WriteLine(file, "j");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:817 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:818 # Input is: ReadDIMACSDigraph(filename); # Expected output: Error, the format of the file given as the 2nd argument cannot be deter\ \ mined, # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:823 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:824 # Input is: IO_WriteLine(file, "p edge 2 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:825 # Input is: IO_WriteLine(file, "e 1 2");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:826 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:827 # Input is: ReadDIMACSDigraph(filename); # Expected output: # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:829 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:830 # Input is: IO_WriteLine(file, "p edge 2 2");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:831 # Input is: IO_WriteLine(file, "e 1 2");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:832 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:833 # Input is: ReadDIMACSDigraph(filename); # Expected output: # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:835 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:836 # Input is: IO_WriteLine(file, "p edge 2 3");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:837 # Input is: IO_WriteLine(file, "e 1 2");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:838 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:839 # Input is: ReadDIMACSDigraph(filename); # Expected output: # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:841 # Input is: file := IO_CompressedFile(UserHomeExpand(filename), "w");; # Expected output: # But found: Error, Variable: 'IO_CompressedFile' must have a value ######## ########> Diff in standard/io.tst:842 # Input is: IO_WriteLine(file, "p edge 2 6");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:843 # Input is: IO_WriteLine(file, "e 1 1");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:844 # Input is: IO_WriteLine(file, "e 1 2");; # Expected output: # But found: Error, Variable: 'IO_WriteLine' must have a value ######## ########> Diff in standard/io.tst:845 # Input is: IO_Close(file);; # Expected output: # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:846 # Input is: ReadDIMACSDigraph(filename); # Expected output: # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:850 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/good.dimacs");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:851 # Input is: gr := Digraph([[2], [1, 3, 4], [2, 3], [2], [5], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:853 # Input is: SetDigraphVertexLabels(gr, [2, 3, 5, 7, 11, 13]);; # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/io.tst:854 # Input is: WriteDIMACSDigraph(filename, gr); # Expected output: IO_OK # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:856 # Input is: read := ReadDIMACSDigraph(filename); # Expected output: # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:858 # Input is: gr = read; # Expected output: true # But found: Error, Variable: 'read' must have a value ######## ########> Diff in standard/io.tst:860 # Input is: DigraphVertexLabels(read); # Expected output: [ 2, 3, 5, 7, 11, 13 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/io.tst:862 # Input is: gr := Digraph([[2], [1, 3, 3], [2, 3, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:864 # Input is: DigraphVertexLabels(gr); # Expected output: [ 1 .. 3 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/io.tst:866 # Input is: WriteDIMACSDigraph(filename, gr); # Expected output: IO_OK # But found: Error, Variable: 'WriteDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:868 # Input is: read := ReadDIMACSDigraph(filename); # Expected output: # But found: Error, Variable: 'ReadDIMACSDigraph' must have a value ######## ########> Diff in standard/io.tst:870 # Input is: gr = read; # Expected output: true # But found: Error, Variable: 'read' must have a value ######## ########> Diff in standard/io.tst:872 # Input is: DigraphVertexLabels(gr); # Expected output: [ 1 .. 3 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/io.tst:876 # Input is: DIGRAPHS_ChooseFileDecoder(1); # Expected output: Error, the argument must be a string, # But found: Error, Variable: 'DIGRAPHS_ChooseFileDecoder' must have a value ######## ########> Diff in standard/io.tst:878 # Input is: DIGRAPHS_ChooseFileEncoder(1); # Expected output: Error, the argument must be a string, # But found: Error, Variable: 'DIGRAPHS_ChooseFileEncoder' must have a value ######## ########> Diff in standard/io.tst:882 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/good.dimacs");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:883 # Input is: file := IO_File(filename, "r");; # Expected output: # But found: Error, Variable: 'IO_File' must have a value ######## ########> Diff in standard/io.tst:884 # Input is: gr := CompleteDigraph(2); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/io.tst:886 # Input is: DigraphGroup(gr); # Expected output: Sym( [ 1 .. 2 ] ) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/io.tst:888 # Input is: IO_Pickle(file, gr); # Expected output: IO_Error # But found: Error, Variable: 'IO_Pickle' must have a value ######## ########> Diff in standard/io.tst:890 # Input is: gr := Digraph([[2], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/io.tst:892 # Input is: HasDigraphGroup(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphGroup' must have a value ######## ########> Diff in standard/io.tst:894 # Input is: IO_Pickle(file, gr); # Expected output: IO_Error # But found: Error, Variable: 'IO_Pickle' must have a value ######## ########> Diff in standard/io.tst:896 # Input is: IO_Close(file); # Expected output: true # But found: Error, Variable: 'IO_Close' must have a value ######## ########> Diff in standard/io.tst:900 # Input is: DigraphFile(10); # Expected output: Error, the 1st argument must be a string, # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:902 # Input is: DigraphFile("tmp", false); # Expected output: Error, the 2nd argument must be a function or fail, # But found: Error, Variable: 'DigraphFile' must have a value ######## ########> Diff in standard/io.tst:904 # Input is: filename := Concatenation(DIGRAPHS_Dir(), "/tst/out/test.p");; # Expected output: # But found: Error, Variable: 'DIGRAPHS_Dir' must have a value ######## ########> Diff in standard/io.tst:905 # Input is: ReadDigraphs(filename, IO_Unpickle); # Expected output: [ ] # But found: Error, Variable: 'ReadDigraphs' must have a value ######## ########> Diff in standard/io.tst:926 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/io.tst msecs: 479 false gap> ########> Diff in standard/isomorph.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/isomorph.tst:20 # Input is: gr := CompleteDigraph(n); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:22 # Input is: AutomorphismGroup(gr) = SymmetricGroup(n); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:24 # Input is: not DIGRAPHS_NautyAvailable or NautyAutomorphismGroup(gr) = SymmetricGroup(n); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:30 # Input is: gr := EmptyDigraph(n); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:32 # Input is: AutomorphismGroup(gr) = SymmetricGroup(n); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:34 # Input is: not DIGRAPHS_NautyAvailable or NautyAutomorphismGroup(gr) = SymmetricGroup(n); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:40 # Input is: gr := ChainDigraph(n); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:42 # Input is: IsTrivial(AutomorphismGroup(gr)); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:44 # Input is: not DIGRAPHS_NautyAvailable or IsTrivial(NautyAutomorphismGroup(gr)); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:46 # Input is: gr := DigraphCopy(ChainDigraph(n));; # Expected output: # But found: Error, Variable: 'DigraphCopy' must have a value ######## ########> Diff in standard/isomorph.tst:47 # Input is: not DIGRAPHS_NautyAvailable or IsTrivial(NautyAutomorphismGroup(gr)); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:49 # Input is: not DIGRAPHS_NautyAvailable or IsTrivial(NautyAutomorphismGroup(gr, [1, 2, 3, 1, 2])); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:55 # Input is: gr := CycleDigraph(n); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:57 # Input is: IsCyclic(AutomorphismGroup(gr)); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:59 # Input is: Size(AutomorphismGroup(gr)) = n; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:61 # Input is: not DIGRAPHS_NautyAvailable or Size(NautyAutomorphismGroup(gr)) = n; # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:68 # Input is: gr := CompleteBipartiteDigraph(m, n); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:70 # Input is: G := AutomorphismGroup(gr);; # Expected output: # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:71 # Input is: G = DirectProduct(SymmetricGroup(m), SymmetricGroup(n)); # Expected output: true # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:73 # Input is: G := NautyAutomorphismGroup(gr);; # Expected output: # But found: Error, Variable: 'NautyAutomorphismGroup' must have a value ######## ########> Diff in standard/isomorph.tst:74 # Input is: not DIGRAPHS_NautyAvailable or G = DirectProduct(SymmetricGroup(m), SymmetricGroup(n)); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:79 # Input is: gr := Digraph([[2], [], [2], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:81 # Input is: AutomorphismGroup(gr) = SymmetricGroup([1, 3, 4]); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:83 # Input is: not DIGRAPHS_NautyAvailable or NautyAutomorphismGroup(gr) = SymmetricGroup([1, 3, 4]); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:90 # Input is: gr := Digraph([[2], [], [2], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:92 # Input is: gr = gr; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:94 # Input is: IsIsomorphicDigraph(gr, gr); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:96 # Input is: gr1 := OnDigraphs(gr, (1, 3, 4)); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:98 # Input is: gr = gr1; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:100 # Input is: IsIsomorphicDigraph(gr, gr1); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:102 # Input is: gr2 := OnDigraphs(gr, (1, 3)(2, 4)); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:104 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(gr2) = (1, 2, 3, 4); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:106 # Input is: gr = gr2; # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:108 # Input is: IsIsomorphicDigraph(gr, gr2); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:110 # Input is: gr3 := DigraphReverseEdge(gr, [4, 2]); # Expected output: # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/isomorph.tst:112 # Input is: gr = gr3; # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:114 # Input is: IsIsomorphicDigraph(gr, gr3); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:118 # Input is: gr4 := DigraphAddEdge(gr, [1, 3]); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/isomorph.tst:120 # Input is: gr = gr4; # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:122 # Input is: IsIsomorphicDigraph(gr, gr4); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:126 # Input is: gr5 := DigraphAddVertex(gr); # Expected output: # But found: Error, Variable: 'DigraphAddVertex' must have a value ######## ########> Diff in standard/isomorph.tst:128 # Input is: gr = gr5; # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:130 # Input is: IsIsomorphicDigraph(gr, gr5); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:134 # Input is: gr := Digraph([ [10], [4, 8], [3, 9], [7, 13, 16, 20], [5, 10, 14, 18], [14], [], [1, 6], [16], [6, 12], [8], [2, 14], [2, 12], [17], [4, 20], [1, 5, 6, 14, 18], [3], [5, 7], [4], [6, 11]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:141 # Input is: gr1 := OnDigraphs(gr, p); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:143 # Input is: gr = gr1; # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:145 # Input is: IsIsomorphicDigraph(gr, gr1); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:147 # Input is: gr2 := OnDigraphs(gr, Transformation([1, 1])); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:149 # Input is: gr = gr2; # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:151 # Input is: IsIsomorphicDigraph(gr, gr2); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:157 # Input is: gr1 := Digraph([[1, 2, 3, 2], [1, 3], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:159 # Input is: gr2 := Digraph([[1, 2, 3, 2], [1, 3], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:161 # Input is: IsIsomorphicDigraph(gr1, gr2); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:165 # Input is: gr1 := Digraph([[1, 2, 3, 2], [1, 3], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:167 # Input is: gr2 := Digraph([[1, 2, 3, 2], [1, 3], [3, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:169 # Input is: IsIsomorphicDigraph(gr1, gr2); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:173 # Input is: gr1 := Digraph([[1, 2, 3, 2], [1, 3], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:175 # Input is: gr2 := Digraph([[1, 2, 3], [1, 2, 3], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:177 # Input is: IsIsomorphicDigraph(gr1, gr2); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:181 # Input is: gr1 := Digraph([[2, 2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:183 # Input is: gr2 := CompleteDigraph(2); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:185 # Input is: IsIsomorphicDigraph(gr1, gr2, [1, 1], [1, 1]); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:187 # Input is: IsIsomorphicDigraph(gr2, gr1, [1, 1], [1, 1]); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:189 # Input is: IsIsomorphicDigraph(gr1, gr1, [1, 1], [1, 1]); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:191 # Input is: IsIsomorphicDigraph(gr2, gr2, [], [1, 1]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 2 consisting of every integer in the range [1 .. m], for some m <= 2; or 2. a list of non-empty disjoint lists whose union is [1 .. 2]. # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:198 # Input is: IsIsomorphicDigraph(gr2, gr2, [2, 2], []); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2], since it contains the colour 2, but it lacks the colour 1 . A colouring must use precisely the colours [1 .. m], for some positive inte\ g\ er m <= 2, # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:204 # Input is: IsIsomorphicDigraph(EmptyDigraph(1), EmptyDigraph(2), [1], [1, 1]); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:206 # Input is: IsIsomorphicDigraph(EmptyDigraph(1), Digraph([[1]]), [1], [1]); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:208 # Input is: IsIsomorphicDigraph(EmptyDigraph(2), EmptyDigraph(2), [1, 1], [1, 2]); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:210 # Input is: IsIsomorphicDigraph(EmptyDigraph(2), EmptyDigraph(2), [1, 1], [1, 1]); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:212 # Input is: IsIsomorphicDigraph(gr2, gr2, [1, 1], [2, 2]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2], since it contains the colour 2, but it lacks the colour 1 . A colouring must use precisely the colours [1 .. m], for some positive inte\ g\ er m <= 2, # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:218 # Input is: IsIsomorphicDigraph(gr2, gr2, [1, 2], [2, 1]); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:220 # Input is: gr1 := CycleDigraph(4); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:222 # Input is: gr2 := DigraphDisjointUnion(CycleDigraph(2), CycleDigraph(2)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/isomorph.tst:224 # Input is: IsIsomorphicDigraph(gr1, gr2, [1, 1, 1, 1], [1, 1, 1, 1]); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:226 # Input is: IsIsomorphicDigraph(gr1, gr1, [1, 1, 2, 2], [1, 1, 1, 2]); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:232 # Input is: gr1 := EmptyDigraph(3); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:234 # Input is: gr2 := ChainDigraph(3); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:236 # Input is: IsomorphismDigraphs(gr1, gr2); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:238 # Input is: IsomorphismDigraphs(gr2, gr1); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:240 # Input is: IsIsomorphicDigraph(gr1, gr2); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:244 # Input is: gr := Digraph([[3], [2, 3, 4], [1, 3], [], [1, 4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:246 # Input is: IsomorphismDigraphs(gr, gr); # Expected output: () # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:248 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(gr) = (1, 2, 5, 4); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:250 # Input is: for i in SymmetricGroup(DigraphNrVertices(gr)) do new := OnDigraphs(gr, i); if not IsomorphismDigraphs(gr, new) = i and IsomorphismDigraphs(new, gr) = i ^ -1 then Print("fail"); fi; od; # Expected output: # But found: Error, Variable: 'DigraphNrVertices' must have an assigned value ######## ########> Diff in standard/isomorph.tst:259 # Input is: gr := Digraph([[3], [2, 3, 4], [1, 3], [], [1, 4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:261 # Input is: IsomorphismDigraphs(gr, gr); # Expected output: () # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:263 # Input is: for i in SymmetricGroup(DigraphNrVertices(gr)) do new := OnDigraphs(gr, i); if not IsomorphismDigraphs(gr, new) = i and IsomorphismDigraphs(new, gr) = i ^ -1 then Print("fail"); fi; od; # Expected output: # But found: Error, Variable: 'DigraphNrVertices' must have an assigned value ######## ########> Diff in standard/isomorph.tst:272 # Input is: gr1 := Digraph([[], [2, 3, 4], [1, 3], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:273 # Input is: gr2 := OnDigraphs(gr1, (1, 2, 3));; # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:274 # Input is: gr1 <> gr2; # Expected output: true # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/isomorph.tst:276 # Input is: IsMultiDigraph(gr1); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:278 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(gr1) = (1, 2, 4); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:280 # Input is: HasBlissCanonicalLabelling(gr1) and HasBlissCanonicalLabelling(gr2); # Expected output: false # But found: Error, Variable: 'HasBlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:282 # Input is: not DIGRAPHS_NautyAvailable or HasNautyCanonicalLabelling(gr1) and NautyCanonicalLabelling(gr1) <> fail; # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:285 # Input is: not DIGRAPHS_NautyAvailable or not HasNautyCanonicalLabelling(gr2); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:287 # Input is: IsomorphismDigraphs(gr1, gr2);; # Expected output: # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:290 # Input is: gr1 := Digraph([[2, 2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:292 # Input is: gr2 := CompleteDigraph(2); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:294 # Input is: IsomorphismDigraphs(gr1, gr2, [1, 1], [1, 1]); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:296 # Input is: IsomorphismDigraphs(gr2, gr1, [1, 1], [1, 1]); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:298 # Input is: IsomorphismDigraphs(gr1, gr1, [1, 1], [1, 1]); # Expected output: [ (), () ] # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:300 # Input is: IsomorphismDigraphs(gr2, gr2, [], [1, 1]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 2 consisting of every integer in the range [1 .. m], for some m <= 2; or 2. a list of non-empty disjoint lists whose union is [1 .. 2]. # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:307 # Input is: IsomorphismDigraphs(gr2, gr2, [2, 2], []); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2], since it contains the colour 2, but it lacks the colour 1 . A colouring must use precisely the colours [1 .. m], for some positive inte\ g\ er m <= 2, # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:313 # Input is: IsomorphismDigraphs(EmptyDigraph(1), EmptyDigraph(2), [1], [1, 1]); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:315 # Input is: IsomorphismDigraphs(EmptyDigraph(1), Digraph([[1]]), [1], [1]); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:317 # Input is: IsomorphismDigraphs(EmptyDigraph(2), EmptyDigraph(2), [1, 1], [1, 2]); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:319 # Input is: IsomorphismDigraphs(EmptyDigraph(2), EmptyDigraph(2), [1, 1], [1, 1]); # Expected output: () # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:321 # Input is: IsomorphismDigraphs(gr2, gr2, [1, 1], [[1, 2]]); # Expected output: () # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:323 # Input is: IsomorphismDigraphs(gr2, gr2, [1, 2], [2, 1]); # Expected output: (1,2) # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:325 # Input is: gr1 := CycleDigraph(4); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:327 # Input is: gr2 := DigraphDisjointUnion(CycleDigraph(2), CycleDigraph(2)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/isomorph.tst:329 # Input is: IsomorphismDigraphs(gr1, gr2, [1, 1, 1, 1], [1, 1, 1, 1]); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:331 # Input is: gr1 := CompleteDigraph(3);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:332 # Input is: IsomorphismDigraphs(gr1, gr1, [1, 2, 2], [[1, 3], [2]]); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:338 # Input is: gr := Digraph([[2], [3, 5, 6], [3], [4, 6], [1, 4], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:340 # Input is: BlissCanonicalLabelling(gr); # Expected output: (1,2,6,3)(4,5) # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:342 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(gr) = (1, 3, 2, 6)(4, 5); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:345 # Input is: canon := OutNeighbours(BlissCanonicalDigraph(gr)); # Expected output: [ [ 1 ], [ 6 ], [ 5 ], [ 2, 5 ], [ 5, 3 ], [ 1, 4, 3 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/isomorph.tst:347 # Input is: for i in SymmetricGroup(DigraphNrVertices(gr)) do new := OnDigraphs(gr, i); if not OutNeighbours(OnDigraphs(new, BlissCanonicalLabelling(new))) = canon then Print("fail\n"); fi; od; # Expected output: # But found: Error, Variable: 'DigraphNrVertices' must have an assigned value ######## ########> Diff in standard/isomorph.tst:354 # Input is: gr1 := DigraphReverseEdge(gr, [2, 5]); # Expected output: # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/isomorph.tst:356 # Input is: gr = gr1; # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:358 # Input is: IsIsomorphicDigraph(gr, gr1); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:360 # Input is: canon = OnDigraphs(gr1, BlissCanonicalLabelling(gr1)); # Expected output: false # But found: Error, Variable: 'canon' must have a value ######## ########> Diff in standard/isomorph.tst:362 # Input is: canon := NautyCanonicalDigraph(gr);; # Expected output: # But found: Error, Variable: 'NautyCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:363 # Input is: canon = fail or OutNeighbours(canon) = [[5], [2], [6], [3, 5], [5, 1], [2, 4, 1]]; # Expected output: true # But found: Error, Variable: 'canon' must have a value ######## ########> Diff in standard/isomorph.tst:366 # Input is: if canon <> fail then for i in SymmetricGroup(DigraphNrVertices(gr)) do new := OnDigraphs(gr, i); if OnDigraphs(new, NautyCanonicalLabelling(new)) <> canon then Print("fail\n"); fi; od; fi; # Expected output: # But found: Error, Variable: 'canon' must have a value ######## ########> Diff in standard/isomorph.tst:376 # Input is: G := Digraph(10, [1, 1, 3, 4, 4, 5, 8, 8], [6, 3, 3, 9, 10, 9, 4, 10]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:377 # Input is: BlissCanonicalLabelling(G, [[1 .. 5], [6 .. 10]]); # Expected output: (1,5,2)(6,9)(8,10) # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:379 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(G, [[1 .. 5], [6 .. 10]]) = (1, 5, 3, 4)(6, 8, 10)(7, 9); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:383 # Input is: BlissCanonicalLabelling(G, [1, 1, 1, 1, 1, 2, 2, 2, 2, 2]); # Expected output: (1,5,2)(6,9)(8,10) # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:385 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(G, [1, 1, 1, 1, 1, 2, 2, 2, 2, 2]) = (1, 5, 3, 4)(6, 8, 10)(7, 9); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:391 # Input is: gr := CompleteBipartiteDigraph(4, 4); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:393 # Input is: AutomorphismGroup(gr) = Group([ (7, 8), (6, 7), (5, 6), (3, 4), (2, 3), (1, 2), (1, 5)(2, 6)(3, 7)(4, 8)]); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:396 # Input is: AutomorphismGroup(gr, [[1 .. 4], [5 .. 8]]); # Expected output: Group([ (7,8), (6,7), (5,6), (3,4), (2,3), (1,2) ]) # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:398 # Input is: AutomorphismGroup(gr, [1 .. 8]); # Expected output: Group(()) # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:402 # Input is: gr := CompleteBipartiteDigraph(4, 4); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:404 # Input is: AutomorphismGroup(gr, [[1 .. 4], [5 .. 9]]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 8], since the entry in position 2 contains 9 which is not an integer in the range [1 .. 8], # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:408 # Input is: AutomorphismGroup(gr, ["a", "b"]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 8], since the entry in position 1 contains 'a' which is not an integer in the range [1 .. 8], # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:412 # Input is: AutomorphismGroup(gr, [1 .. 10]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 8 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 8 consisting of every integer in the range [1 .. m], for some m <= 8; or 2. a list of non-empty disjoint lists whose union is [1 .. 8]. # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:419 # Input is: AutomorphismGroup(gr, [-1 .. -10]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 8 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 8 consisting of every integer in the range [1 .. m], for some m <= 8; or 2. a list of non-empty disjoint lists whose union is [1 .. 8]. # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:428 # Input is: gr := CompleteBipartiteDigraph(4, 4); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:430 # Input is: BlissCanonicalLabelling(gr); # Expected output: (1,8,4)(2,3)(5,7) # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:432 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(gr) = (2, 6, 3, 7, 4, 8, 5); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:435 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(gr, [1 .. 8]) = (); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:438 # Input is: BlissCanonicalLabelling(gr, [[1 .. 4], [5 .. 8]]); # Expected output: (1,4)(2,3)(5,8)(6,7) # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:440 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalLabelling(gr, [[1 .. 4], [5 .. 8]]) = (); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:445 # Input is: gr := ChainDigraph(5); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:447 # Input is: BlissCanonicalLabelling(gr); # Expected output: (1,5)(2,4) # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:449 # Input is: BlissCanonicalLabelling(BlissCanonicalDigraph(gr)); # Expected output: () # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:453 # Input is: gr := CompleteBipartiteDigraph(4, 4); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:455 # Input is: BlissCanonicalLabelling(gr, [[1 .. 4], [5 .. 9]]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 8], since the entry in position 2 contains 9 which is not an integer in the range [1 .. 8], # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:459 # Input is: BlissCanonicalLabelling(gr, ["a", "b"]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 8], since the entry in position 1 contains 'a' which is not an integer in the range [1 .. 8], # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:463 # Input is: BlissCanonicalLabelling(gr, [1 .. 10]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 8 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 8 consisting of every integer in the range [1 .. m], for some m <= 8; or 2. a list of non-empty disjoint lists whose union is [1 .. 8]. # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:470 # Input is: BlissCanonicalLabelling(gr, [-1 .. -10]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 8 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 8 consisting of every integer in the range [1 .. m], for some m <= 8; or 2. a list of non-empty disjoint lists whose union is [1 .. 8]. # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:479 # Input is: DIGRAPHS_ValidateVertexColouring(); # Expected output: Error, Function: number of arguments must be 2 (not 0) # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:481 # Input is: DIGRAPHS_ValidateVertexColouring(fail); # Expected output: Error, Function: number of arguments must be 2 (not 1) # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:483 # Input is: DIGRAPHS_ValidateVertexColouring(fail, fail); # Expected output: Error, the 1st argument must be a non-negative integer, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:485 # Input is: DIGRAPHS_ValidateVertexColouring(0, fail); # Expected output: Error, the 2nd argument must be a homogeneous list, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:487 # Input is: DIGRAPHS_ValidateVertexColouring(fail, []); # Expected output: Error, the 1st argument must be a non-negative integer, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:489 # Input is: DIGRAPHS_ValidateVertexColouring(0, [], fail); # Expected output: Error, Function: number of arguments must be 2 (not 3) # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:493 # Input is: DIGRAPHS_ValidateVertexColouring(0, []); # Expected output: [ ] # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:495 # Input is: DIGRAPHS_ValidateVertexColouring(0, [2]); # Expected output: Error, the only valid partition of the vertices of the digraph with 0 vertices\ \ is the empty list, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:498 # Input is: DIGRAPHS_ValidateVertexColouring(1, []); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 1 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 1 consisting of every integer in the range [1 .. m], for some m <= 1; or 2. a list of non-empty disjoint lists whose union is [1 .. 1]. # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:505 # Input is: DIGRAPHS_ValidateVertexColouring(1, [fail]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 1 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 1 consisting of every integer in the range [1 .. m], for some m <= 1; or 2. a list of non-empty disjoint lists whose union is [1 .. 1]. # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:512 # Input is: DIGRAPHS_ValidateVertexColouring(1, [1, 1]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 1 ]. The 2nd argument must have one of the following forms: 1. a list of length\ 1 consisting of every integer in the range [1 .. m], for some m <= 1; or 2. a list of non-empty disjoint lists whose union is [1 .. 1]. # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:519 # Input is: DIGRAPHS_ValidateVertexColouring(2, [1, -1]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2], since it contains the element -1, which is not a positive integer, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:522 # Input is: DIGRAPHS_ValidateVertexColouring(2, [2, 3]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2], since it contains the integer 3, which is greater than 2, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:525 # Input is: DIGRAPHS_ValidateVertexColouring(2, [2, 0]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2], since it contains the element 0, which is not a positive integer, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:528 # Input is: DIGRAPHS_ValidateVertexColouring(2, [[]]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 2], since it does not assign a colour to the vertex 1, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:531 # Input is: DIGRAPHS_ValidateVertexColouring(1, [[1, 1]]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 1], since it contains the vertex 1 more than once, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:534 # Input is: DIGRAPHS_ValidateVertexColouring(1, [[0, 1]]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 1], since the entry in position 1 contains 0 which is not an integer in the range [1 .. 1], # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:538 # Input is: DIGRAPHS_ValidateVertexColouring(1, [[2]]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 1], since the entry in position 1 contains 2 which is not an integer in the range [1 .. 1], # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:542 # Input is: DIGRAPHS_ValidateVertexColouring(4, [[3], [2, 1], [4]]); # Expected output: [ 2, 2, 1, 3 ] # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:544 # Input is: DIGRAPHS_ValidateVertexColouring(4, [1, 1, 3, 4]); # Expected output: Error, the 2nd argument does not define a colouring of the vertice\ \ s [1 .. 4], since it contains the colour 4, but it lacks the colour 2 . A colouring must use precisely the colours [1 .. m], for some positive inte\ g\ er m <= 4, # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:550 # Input is: DIGRAPHS_ValidateVertexColouring(4, [1, 1, 3, 2]); # Expected output: [ 1, 1, 3, 2 ] # But found: Error, Variable: 'DIGRAPHS_ValidateVertexColouring' must have a value ######## ########> Diff in standard/isomorph.tst:554 # Input is: D := ChainDigraph(3);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:555 # Input is: DIGRAPHS_ValidateEdgeColouring(3, 3); # Expected output: Error, the 1st argument must be a digraph, # But found: Error, Variable: 'DIGRAPHS_ValidateEdgeColouring' must have a value ######## ########> Diff in standard/isomorph.tst:557 # Input is: DIGRAPHS_ValidateEdgeColouring(D, 3); # Expected output: Error, the 2nd argument must be a list of the same shape as OutNeighbours(grap\ \ h), where graph is the 1st argument, # But found: Error, Variable: 'DIGRAPHS_ValidateEdgeColouring' must have a value ######## ########> Diff in standard/isomorph.tst:560 # Input is: DIGRAPHS_ValidateEdgeColouring(D, [3]); # Expected output: Error, the 2nd argument must be a list of the same shape as OutNeighbours(grap\ \ h), where graph is the 1st argument, # But found: Error, Variable: 'DIGRAPHS_ValidateEdgeColouring' must have a value ######## ########> Diff in standard/isomorph.tst:563 # Input is: DIGRAPHS_ValidateEdgeColouring(D, [[1], [], [2]]); # Expected output: Error, the 2nd argument must be a list of the same shape as OutNeighbours(grap\ \ h), where graph is the 1st argument, # But found: Error, Variable: 'DIGRAPHS_ValidateEdgeColouring' must have a value ######## ########> Diff in standard/isomorph.tst:566 # Input is: DIGRAPHS_ValidateEdgeColouring(D, [[-1], [2], []]); # Expected output: Error, the 2nd argument should be a list of lists of positive integers, # But found: Error, Variable: 'DIGRAPHS_ValidateEdgeColouring' must have a value ######## ########> Diff in standard/isomorph.tst:568 # Input is: DIGRAPHS_ValidateEdgeColouring(D, [[3], [2], []]); # Expected output: Error, the 2nd argument should be a list of lists whose union is [1 .. number \ \ of colours], # But found: Error, Variable: 'DIGRAPHS_ValidateEdgeColouring' must have a value ######## ########> Diff in standard/isomorph.tst:571 # Input is: DIGRAPHS_ValidateEdgeColouring(D, fail); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_ValidateEdgeColouring' must have a value ######## ########> Diff in standard/isomorph.tst:575 # Input is: gr1 := Digraph([[1, 2], [1, 2], [2, 3], [1, 2, 3], [5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:576 # Input is: gr2 := Digraph([[1, 3], [2, 3], [2, 3], [1, 2, 3], [5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:577 # Input is: BlissCanonicalDigraph(gr1) = BlissCanonicalDigraph(gr2); # Expected output: true # But found: Error, Variable: 'BlissCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:579 # Input is: gr3 := Digraph([[2, 3], [2, 3], [1, 3], [1, 2, 3], [5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:580 # Input is: BlissCanonicalDigraph(gr1) = BlissCanonicalDigraph(gr3); # Expected output: false # But found: Error, Variable: 'BlissCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:582 # Input is: BlissCanonicalDigraph(gr3, [1, 1, 1, 1, 1]); # Expected output: # But found: Error, Variable: 'BlissCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:584 # Input is: BlissCanonicalDigraph(Digraph([[1], [2], [3], [3], [2], [1]])) = BlissCanonicalDigraph(Digraph([[1], [2], [3], [1], [2], [3]])); # Expected output: true # But found: Error, Variable: 'BlissCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:589 # Input is: gr1 := Digraph([[1, 2], [1, 2], [2, 3], [1, 2, 3], [5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:590 # Input is: gr2 := Digraph([[1, 3], [2, 3], [2, 3], [1, 2, 3], [5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:591 # Input is: NautyCanonicalDigraph(gr1) = NautyCanonicalDigraph(gr2); # Expected output: true # But found: Error, Variable: 'NautyCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:593 # Input is: gr3 := Digraph([[2, 3], [2, 3], [1, 3], [1, 2, 3], [5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:594 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalDigraph(gr1) <> NautyCanonicalDigraph(gr3); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:597 # Input is: gr7 := NautyCanonicalDigraph(gr3, [1, 1, 1, 1, 1]);; # Expected output: # But found: Error, Variable: 'NautyCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:598 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalDigraph(gr3, [1, 2, 1, 2, 1]) = NautyCanonicalDigraph(gr3, [[1, 3, 5], [2, 4]]); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:602 # Input is: gr7 = fail or gr7 = NautyCanonicalDigraph(gr7); # Expected output: true # But found: Error, Variable: 'gr7' must have a value ######## ########> Diff in standard/isomorph.tst:604 # Input is: not DIGRAPHS_NautyAvailable or NautyCanonicalDigraph(Digraph([[1], [2], [3], [3], [2], [1]])) = NautyCanonicalDigraph(Digraph([[1], [2], [3], [1], [2], [3]])); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:608 # Input is: gr4 := Digraph([[3, 4], [2, 2, 3], [2, 2, 4], [2, 2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:609 # Input is: gr5 := NautyCanonicalDigraph(gr4); # Expected output: fail # But found: Error, Variable: 'NautyCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:611 # Input is: gr5 := NautyCanonicalDigraph(gr4, [1, 2, 3, 4]); # Expected output: fail # But found: Error, Variable: 'NautyCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:615 # Input is: not DIGRAPHS_NautyAvailable or NautyAutomorphismGroup(NullDigraph(0)) = Group(()); # Expected output: true # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:620 # Input is: nauty := not DIGRAPHS_UsingBliss;; # Expected output: # But found: Error, Variable: 'DIGRAPHS_UsingBliss' must have a value ######## ########> Diff in standard/isomorph.tst:621 # Input is: DigraphsUseNauty(); # Expected output: # But found: Error, Variable: 'DigraphsUseNauty' must have a value ######## ########> Diff in standard/isomorph.tst:622 # Input is: DigraphsUseBliss(); # Expected output: # But found: Error, Variable: 'DigraphsUseBliss' must have a value ######## ########> Diff in standard/isomorph.tst:623 # Input is: p := DIGRAPHS_NautyAvailable;; # Expected output: # But found: Error, Variable: 'DIGRAPHS_NautyAvailable' must have a value ######## ########> Diff in standard/isomorph.tst:624 # Input is: MakeReadWriteGlobal("DIGRAPHS_NautyAvailable"); # Expected output: # But found: #I MakeReadWriteGlobal: DIGRAPHS_NautyAvailable already read-write ######## ########> Diff in standard/isomorph.tst:626 # Input is: DigraphsUseNauty(); # Expected output: # But found: Error, Variable: 'DigraphsUseNauty' must have a value ######## ########> Diff in standard/isomorph.tst:629 # Input is: if not nauty then DigraphsUseBliss(); fi; # Expected output: # But found: Error, Variable: 'nauty' must have a value ######## ########> Diff in standard/isomorph.tst:634 # Input is: gr1 := Digraph([[1, 2, 3, 4], [1, 2, 3, 4], [1, 2, 3, 4], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:636 # Input is: IsDigraphAutomorphism(gr1, (1, 2, 3)); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:638 # Input is: IsDigraphAutomorphism(gr1, (2, 3)); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:640 # Input is: IsDigraphAutomorphism(gr1, ()); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:642 # Input is: gr2 := Digraph([[1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 2, 3, 4, 5, 6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:644 # Input is: IsDigraphAutomorphism(gr2, (2, 3, 4, 5)); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:646 # Input is: IsDigraphAutomorphism(gr2, (1, 6)); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:648 # Input is: IsDigraphAutomorphism(gr2, (2, 3, 6)); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:650 # Input is: IsDigraphAutomorphism(Digraph([[1, 1], [1, 1, 2], [1, 2, 2, 3]]), ()); # Expected output: Error, the 1st and 2nd arguments and must not have multiple edges, # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:654 # Input is: gr1 := Digraph([[1, 2, 3, 4], [1, 2, 3, 4], [1, 2, 3, 4], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:656 # Input is: IsDigraphAutomorphism(gr1, AsTransformation((1, 2, 3))); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:658 # Input is: IsDigraphAutomorphism(gr1, AsTransformation((2, 3))); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:660 # Input is: IsDigraphAutomorphism(gr1, AsTransformation(())); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:662 # Input is: gr2 := Digraph([[1], [1, 2], [1, 3], [1, 4], [1, 5], [1, 2, 3, 4, 5, 6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:664 # Input is: IsDigraphAutomorphism(gr2, AsTransformation((2, 3, 4, 5))); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:666 # Input is: IsDigraphAutomorphism(gr2, AsTransformation((1, 6))); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:668 # Input is: IsDigraphAutomorphism(gr2, AsTransformation((2, 3, 6))); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:670 # Input is: IsDigraphAutomorphism(gr2, Transformation([1, 1, 2, 3])); # Expected output: false # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:672 # Input is: IsDigraphAutomorphism(Digraph([[1, 1], [1, 1, 2], [1, 2, 2, 3]]), AsTransformation(())); # Expected output: Error, the 1st and 2nd arguments and must not have multiple edges, # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:677 # Input is: AutomorphismGroup(Digraph([]), [], []); # Expected output: Group(()) # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:679 # Input is: AutomorphismGroup(Digraph([[]]), [1], [[]]); # Expected output: Group(()) # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:681 # Input is: AutomorphismGroup(Digraph([[], []]), [1, 1], [[], []]); # Expected output: Group([ (1,2) ]) # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:683 # Input is: AutomorphismGroup(Digraph([[], []]), [1, 2], [[], []]); # Expected output: Group(()) # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:685 # Input is: AutomorphismGroup(Digraph([[2], [1]]), [1, 1], [[1], [1]]); # Expected output: Group([ (1,2) ]) # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:687 # Input is: AutomorphismGroup(Digraph([[2], [1]]), [1, 2], [[1], [1]]); # Expected output: Group(()) # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:689 # Input is: AutomorphismGroup(Digraph([[2], [1]]), [1, 1], [[2], [1]]); # Expected output: Group(()) # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:691 # Input is: AutomorphismGroup(Digraph([[2, 2], [1, 1]]), [1, 1], [[2, 1], [1, 2]]); # Expected output: Group([ (1,2), () ]) # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:693 # Input is: D := Digraph([[2, 3, 3, 4], [3, 4, 4, 1], [4, 1, 1, 2], [1, 2, 2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:696 # Input is: AutomorphismGroup(D, vc, ec); # Expected output: Group([ (1,2)(3,4), (1,3)(2,4), () ]) # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/isomorph.tst:699 # Input is: AutomorphismGroup(D, vc, ec); # Expected output: Group([ (1,2)(3,4), () ]) # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/isomorph.tst:705 # Input is: gr := DigraphEdgeUnion(CompleteDigraph(4), CompleteDigraph(4)); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/isomorph.tst:707 # Input is: G := AutomorphismGroup(gr);; # Expected output: # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:708 # Input is: Image(Projection(G, 1)) = SymmetricGroup(4); # Expected output: true # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:710 # Input is: StructureDescription(Image(Projection(G, 2))); # Expected output: "C2 x C2 x C2 x C2 x C2 x C2 x C2 x C2 x C2 x C2 x C2 x C2" # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:714 # Input is: D := Digraph([[2, 2, 4], [3], [2], [1, 2, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:718 # Input is: G := AutomorphismGroup(D, v_cols, e_cols); # Expected output: Group([ (1,2), (3,4), (5,6) ]) # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/isomorph.tst:720 # Input is: Range(Projection(G, 1)); # Expected output: Group([ (1,4) ]) # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:722 # Input is: Range(Projection(G, 2)); # Expected output: Group([ (1,2), (7,8) ]) # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:726 # Input is: gr := Digraph([[2], [1, 3], [], [3, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:728 # Input is: G := AutomorphismGroup(gr); # Expected output: Group([ (), (1,2) ]) # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:730 # Input is: IsTrivial(Image(Projection(G, 1))); # Expected output: true # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:732 # Input is: Image(Projection(G, 2)); # Expected output: Group([ (4,5) ]) # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:736 # Input is: gr := Digraph([ [5, 7, 8, 4, 6, 1], [3, 1, 7, 2, 7, 9], [1, 5, 2, 3, 9], [1, 3, 3, 9, 9], [6, 3, 5, 7, 9], [3, 9], [8, 3, 6, 8, 8, 7, 7, 8, 9], [6, 1, 6, 7, 8, 4, 2, 5, 4], [1, 5, 2, 3, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:742 # Input is: G := AutomorphismGroup(gr);; # Expected output: # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:743 # Input is: Size(G); # Expected output: 3072 # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:745 # Input is: Image(Projection(G, 1)) = Group((3, 9)); # Expected output: true # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:747 # Input is: Image(Projection(G, 2)) = Group([(21, 22), (34, 37), (35, 36), (39, 41), (44, 47), (9, 11)(33, 37, 34), (19, 20)(30, 34)(33, 37)]); # Expected output: true # But found: Error, Variable: 'G' must have a value ######## ########> Diff in standard/isomorph.tst:750 # Input is: BlissCanonicalLabelling(gr) = BlissCanonicalLabelling(DigraphCopy(gr)); # Expected output: true # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:755 # Input is: gr := Digraph([ [5, 7, 8, 4, 6, 1], [3, 1, 7, 2, 7, 9], [1, 5, 2, 3, 9], [1, 3, 3, 9, 9], [6, 3, 5, 7, 9], [3, 9], [8, 3, 6, 8, 8, 7, 7, 8, 9], [6, 1, 6, 7, 8, 4, 2, 5, 4], [1, 5, 2, 3, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:761 # Input is: IsIsomorphicDigraph(gr, gr); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:763 # Input is: gr1 := OnDigraphs(gr, (3, 9)(1, 2, 7, 5));; # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:764 # Input is: IsIsomorphicDigraph(gr, gr1); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:766 # Input is: gr2 := OnDigraphs(gr, (3, 9));; # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:767 # Input is: IsIsomorphicDigraph(gr, gr2); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:771 # Input is: gr1 := Digraph([[2, 1, 2], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:772 # Input is: gr2 := Digraph([[], [2, 1, 1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:773 # Input is: IsIsomorphicDigraph(gr1, gr1, [1, 1], [1, 1]); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:775 # Input is: IsIsomorphicDigraph(gr1, gr1, [1, 1], [1, 2]); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:777 # Input is: IsIsomorphicDigraph(gr1, gr2, [1, 2], [2, 1]); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:779 # Input is: IsIsomorphicDigraph(gr1, gr2, [1, 2], [1, 2]); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:785 # Input is: gr := Digraph([ [5, 7, 8, 4, 6, 1], [3, 1, 7, 2, 7, 9], [1, 5, 2, 3, 9], [1, 3, 3, 9, 9], [6, 3, 5, 7, 9], [3, 9], [8, 3, 6, 8, 8, 7, 7, 8, 9], [6, 1, 6, 7, 8, 4, 2, 5, 4], [1, 5, 2, 3, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:791 # Input is: IsomorphismDigraphs(gr, gr); # Expected output: [ (), () ] # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:793 # Input is: BlissCanonicalLabelling(gr); # Expected output: [ (1,9,5,7,4)(2,3,6), () ] # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:795 # Input is: NautyCanonicalLabelling(gr); # Expected output: fail # But found: Error, Variable: 'NautyCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:797 # Input is: AutomorphismGroup(gr); # Expected output: # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:800 # Input is: gr1 := OnDigraphs(gr, p); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:802 # Input is: iso := IsomorphismDigraphs(gr, gr1); # Expected output: [ (1,8,2)(3,5,4,9,7), () ] # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:804 # Input is: OnMultiDigraphs(gr, iso) = gr1; # Expected output: true # But found: Error, Variable: 'OnMultiDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:806 # Input is: iso[1] = p; # Expected output: true # But found: Error, Variable: 'iso' must have a value ######## ########> Diff in standard/isomorph.tst:809 # Input is: gr1 := OnDigraphs(gr, p); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:811 # Input is: iso := IsomorphismDigraphs(gr, gr1); # Expected output: [ (1,7,8,4)(2,6,5), () ] # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:813 # Input is: OnMultiDigraphs(gr, iso) = gr1; # Expected output: true # But found: Error, Variable: 'OnMultiDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:815 # Input is: iso[1] = p; # Expected output: true # But found: Error, Variable: 'iso' must have a value ######## ########> Diff in standard/isomorph.tst:819 # Input is: gr1 := Digraph([[2, 1, 2], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:820 # Input is: gr2 := Digraph([[], [2, 1, 1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:821 # Input is: IsomorphismDigraphs(gr1, gr1, [1, 1], [1, 1]); # Expected output: [ (), () ] # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:823 # Input is: IsomorphismDigraphs(gr1, gr1, [1, 1], [1, 2]); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:825 # Input is: IsomorphismDigraphs(gr1, gr2, [1, 2], [2, 1]); # Expected output: [ (1,2), () ] # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:827 # Input is: IsomorphismDigraphs(gr1, gr2, [1, 2], [1, 2]); # Expected output: fail # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:829 # Input is: IsomorphismDigraphs(gr1, gr2, [1, 1], [1, 1]); # Expected output: [ (1,2), () ] # But found: Error, Variable: 'IsomorphismDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:835 # Input is: gr := Digraph([[2, 2], [1, 1], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:837 # Input is: BlissCanonicalLabelling(gr); # Expected output: [ (), () ] # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:839 # Input is: canon := OutNeighbours(OnMultiDigraphs(gr, last)); # Expected output: [ [ 2, 2 ], [ 1, 1 ], [ 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/isomorph.tst:841 # Input is: for i in SymmetricGroup(DigraphNrVertices(gr)) do for j in SymmetricGroup(DigraphNrEdges(gr)) do new := OnMultiDigraphs(gr, [i, j]); if not OutNeighbours(OnMultiDigraphs(new, BlissCanonicalLabelling(new))) = canon then Print("fail"); fi; od; od; # Expected output: # But found: Error, Variable: 'DigraphNrVertices' must have an assigned value ######## ########> Diff in standard/isomorph.tst:849 # Input is: gr1 := Digraph([[2, 2], [1, 3], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:851 # Input is: gr = gr1; # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:853 # Input is: IsIsomorphicDigraph(gr, gr1); # Expected output: false # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:855 # Input is: canon = OnMultiDigraphs(gr1, BlissCanonicalLabelling(gr1)); # Expected output: false # But found: Error, Variable: 'canon' must have a value ######## ########> Diff in standard/isomorph.tst:857 # Input is: NautyCanonicalLabelling(gr); # Expected output: fail # But found: Error, Variable: 'NautyCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:861 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:863 # Input is: AutomorphismGroup(gr, [1, 2]); # Expected output: Group([ (), (1,2) ]) # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:865 # Input is: NautyAutomorphismGroup(gr); # Expected output: fail # But found: Error, Variable: 'NautyAutomorphismGroup' must have a value ######## ########> Diff in standard/isomorph.tst:867 # Input is: NautyAutomorphismGroup(gr, [1, 2]); # Expected output: fail # But found: Error, Variable: 'NautyAutomorphismGroup' must have a value ######## ########> Diff in standard/isomorph.tst:871 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:873 # Input is: BlissCanonicalLabelling(gr, [1, 2]); # Expected output: [ (), () ] # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:875 # Input is: NautyCanonicalLabelling(gr, [1, 2]); # Expected output: fail # But found: Error, Variable: 'NautyCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:879 # Input is: gr4 := Digraph([[3, 4], [2, 2, 3], [2, 2, 4], [2, 2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:880 # Input is: gr5 := BlissCanonicalDigraph(gr4);; # Expected output: # But found: Error, Variable: 'BlissCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:881 # Input is: gr5 = gr4; # Expected output: false # But found: Error, Variable: 'gr5' must have a value ######## ########> Diff in standard/isomorph.tst:883 # Input is: IsIsomorphicDigraph(gr4, gr5); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:885 # Input is: gr5 = BlissCanonicalDigraph(gr4, [1, 1, 1, 1]); # Expected output: true # But found: Error, Variable: 'gr5' must have a value ######## ########> Diff in standard/isomorph.tst:887 # Input is: BlissCanonicalDigraph(gr4, [1, 2, 1, 2]) = BlissCanonicalDigraph(gr4, [[1, 3], [2, 4]]); # Expected output: true # But found: Error, Variable: 'BlissCanonicalDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:890 # Input is: gr5 = BlissCanonicalDigraph(gr5); # Expected output: true # But found: Error, Variable: 'gr5' must have a value ######## ########> Diff in standard/isomorph.tst:892 # Input is: gr6 := OnMultiDigraphs(gr4, [(1, 2), (5, 6)]);; # Expected output: # But found: Error, Variable: 'OnMultiDigraphs' must have a value ######## ########> Diff in standard/isomorph.tst:893 # Input is: IsIsomorphicDigraph(gr4, gr6); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:895 # Input is: gr5 = BlissCanonicalDigraph(gr6); # Expected output: true # But found: Error, Variable: 'gr5' must have a value ######## ########> Diff in standard/isomorph.tst:901 # Input is: gr := Digraph([ [5, 7, 8, 4, 6, 1], [3, 1, 7, 2, 7, 9], [1, 5, 2, 3, 9], [1, 3, 3, 9, 9], [6, 3, 5, 7, 9], [3, 9], [8, 3, 6, 8, 8, 7, 7, 8, 9], [6, 1, 6, 7, 8, 4, 2, 5, 4], [1, 5, 2, 3, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:907 # Input is: G := AutomorphismGroup(gr);; # Expected output: # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/isomorph.tst:908 # Input is: HasBlissCanonicalLabelling(gr); # Expected output: true # But found: Error, Variable: 'HasBlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:910 # Input is: BlissCanonicalLabelling(gr); # Expected output: [ (1,9,5,7,4)(2,3,6), () ] # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:912 # Input is: BlissCanonicalLabelling(gr) = BlissCanonicalLabelling(DigraphCopy(gr)); # Expected output: true # But found: Error, Variable: 'BlissCanonicalLabelling' must have a value ######## ########> Diff in standard/isomorph.tst:916 # Input is: gr := Digraph([[2, 2, 4, 4], [1, 1, 3], [2], [1, 1, 5], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:918 # Input is: DigraphGroup(gr); # Expected output: Group([ (2,4)(3,5) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/isomorph.tst:920 # Input is: DigraphDiameter(gr); # Expected output: 4 # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/isomorph.tst:922 # Input is: DigraphUndirectedGirth(gr); # Expected output: 2 # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/isomorph.tst:924 # Input is: gr := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:925 # Input is: DigraphUndirectedGirth(gr); # Expected output: infinity # But found: Error, Variable: 'DigraphUndirectedGirth' must have a value ######## ########> Diff in standard/isomorph.tst:927 # Input is: DigraphDiameter(gr); # Expected output: fail # But found: Error, Variable: 'DigraphDiameter' must have a value ######## ########> Diff in standard/isomorph.tst:931 # Input is: gr := Digraph([[1, 2, 2], [], [2, 2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:932 # Input is: DigraphGroup(gr) = Group((1, 3)); # Expected output: true # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/isomorph.tst:934 # Input is: OutNeighbours(DistanceDigraph(gr, 0)); # Expected output: [ [ 1 ], [ 2 ], [ 3 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/isomorph.tst:936 # Input is: OutNeighbours(DistanceDigraph(gr, 1)); # Expected output: [ [ 2 ], [ ], [ 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/isomorph.tst:938 # Input is: OutNeighbours(DistanceDigraph(gr, 2)); # Expected output: [ [ ], [ ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/isomorph.tst:942 # Input is: gr := Digraph([[2], [1, 3], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:944 # Input is: BlissAutomorphismGroup(gr, false, []); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 2nd choice method found for `BlissAutomorphismGroup' on 3 arguments # But found: Error, Variable: 'BlissAutomorphismGroup' must have a value ######## ########> Diff in standard/isomorph.tst:947 # Input is: BlissAutomorphismGroup(gr, fail, []); # Expected output: Error, the 2nd argument must be a list of the same shape as OutNeighbours(grap\ \ h), where graph is the 1st argument, # But found: Error, Variable: 'BlissAutomorphismGroup' must have a value ######## ########> Diff in standard/isomorph.tst:950 # Input is: BlissAutomorphismGroup(gr, fail, [[1], [1, 1], [1]]) = Group([(1, 3)]); # Expected output: true # But found: Error, Variable: 'BlissAutomorphismGroup' must have a value ######## ########> Diff in standard/isomorph.tst:954 # Input is: gr1 := Digraph([[2, 3, 4], [1, 3, 4], [1, 2], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:956 # Input is: IsDigraphIsomorphism(gr1, gr1, (1, 2)); # Expected output: true # But found: Error, Variable: 'IsDigraphIsomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:958 # Input is: IsDigraphIsomorphism(gr1, gr1, (1, 2)(3, 4)); # Expected output: true # But found: Error, Variable: 'IsDigraphIsomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:960 # Input is: gr2 := Digraph([[2, 3, 4, 4], [1, 3, 4], [1, 2], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/isomorph.tst:962 # Input is: IsDigraphIsomorphism(gr1, gr2, (1, 2)); # Expected output: Error, the 1st and 2nd arguments and must not have multiple edges, # But found: Error, Variable: 'IsDigraphIsomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:964 # Input is: IsDigraphIsomorphism(gr2, gr1, (1, 2)); # Expected output: Error, the 1st and 2nd arguments and must not have multiple edges, # But found: Error, Variable: 'IsDigraphIsomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:966 # Input is: IsDigraphIsomorphism(gr1, gr1, Transformation([2, 1, 4, 3, 6, 5])); # Expected output: true # But found: Error, Variable: 'IsDigraphIsomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:968 # Input is: IsDigraphIsomorphism(gr1, gr1, Transformation([2, 1, 3, 5, 4, 6])); # Expected output: false # But found: Error, Variable: 'IsDigraphIsomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:970 # Input is: gr := NullDigraph(5);; # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:971 # Input is: ForAll(AutomorphismGroup(gr), x -> IsDigraphAutomorphism(gr, x, [1, 1, 1, 1, 1])); # Expected output: true # But found: Error, Variable: 'gr' must have a value Syntax warning: Unbound global variable in stream:2 x -> IsDigraphAutomorphism(gr, x, [1, 1, 1, 1, 1])); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> IsDigraphAutomorphism(gr, x, [1, 1, 1, 1, 1])); ^^ ######## ########> Diff in standard/isomorph.tst:974 # Input is: Number(AutomorphismGroup(gr), x -> IsDigraphAutomorphism(gr, x, [1, 2, 3, 4, 5])); # Expected output: 1 # But found: Error, Variable: 'gr' must have a value Syntax warning: Unbound global variable in stream:2 x -> IsDigraphAutomorphism(gr, x, [1, 2, 3, 4, 5])); ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 x -> IsDigraphAutomorphism(gr, x, [1, 2, 3, 4, 5])); ^^ ######## ########> Diff in standard/isomorph.tst:977 # Input is: gr2 := CycleDigraph(6); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:981 # Input is: ForAll([1 .. 6], i -> IsDigraphAutomorphism(gr2, t ^ i, [1, 1, 1, 1, 1, 1])); # Expected output: true # But found: Syntax warning: Unbound global variable in stream:2 i -> IsDigraphAutomorphism(gr2, ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 i -> IsDigraphAutomorphism(gr2, ^^^ Error, Variable: 'IsDigraphAutomorphism' must have an assigned value ######## ########> Diff in standard/isomorph.tst:986 # Input is: ForAll([2, 4, 6], i -> IsDigraphAutomorphism(gr2, t ^ i, [1, 2, 1, 2, 1, 2])); # Expected output: true # But found: Syntax warning: Unbound global variable in stream:2 i -> IsDigraphAutomorphism(gr2, ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 i -> IsDigraphAutomorphism(gr2, ^^^ Error, Variable: 'IsDigraphAutomorphism' must have an assigned value ######## ########> Diff in standard/isomorph.tst:991 # Input is: IsDigraphAutomorphism(gr2, t ^ 3, [1, 2, 3, 1, 2, 3]); # Expected output: true # But found: Error, Variable: 'IsDigraphAutomorphism' must have a value ######## ########> Diff in standard/isomorph.tst:993 # Input is: gr3 := CycleDigraph(5);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/isomorph.tst:994 # Input is: Number(FullTransformationMonoid(5), t -> IsDigraphAutomorphism(gr3, t, [1, 1, 1, 1, 1])); # Expected output: 5 # But found: Syntax warning: Unbound global variable in stream:2 t -> IsDigraphAutomorphism(gr3, ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:2 t -> IsDigraphAutomorphism(gr3, ^^^ Error, Variable: 'IsDigraphAutomorphism' must have an assigned value ######## ########> Diff in standard/isomorph.tst:1020 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/isomorph.tst msecs: 437 false gap> ########> Diff in standard/labels.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/labels.tst:17 # Input is: gr := RandomDigraph(10);; # Expected output: # But found: Error, Variable: 'RandomDigraph' must have a value ######## ########> Diff in standard/labels.tst:18 # Input is: DigraphVertexLabels(gr); # Expected output: [ 1 .. 10 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:20 # Input is: SetDigraphVertexLabels(gr, ["a", "b", 10]); # Expected output: Error, the 2nd arument must be a list with length equal to the number \ \ of vertices of the digraph that is the 1st argument, # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:23 # Input is: gr := RandomDigraph(3);; # Expected output: # But found: Error, Variable: 'RandomDigraph' must have a value ######## ########> Diff in standard/labels.tst:24 # Input is: SetDigraphVertexLabels(gr, ["a", "b", 10]); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:25 # Input is: DigraphVertexLabels(gr); # Expected output: [ "a", "b", 10 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:27 # Input is: DigraphVertexLabel(gr, 1); # Expected output: "a" # But found: Error, Variable: 'DigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:29 # Input is: DigraphVertexLabel(gr, 2); # Expected output: "b" # But found: Error, Variable: 'DigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:31 # Input is: DigraphVertexLabel(gr, 10); # Expected output: Error, the 2nd argument has no label or is not a vertex of the digraph \ \ that is the 1st argument # But found: Error, Variable: 'DigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:34 # Input is: DigraphVertexLabel(gr, 3); # Expected output: 10 # But found: Error, Variable: 'DigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:36 # Input is: SetDigraphVertexLabel(gr, 3, 3); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:37 # Input is: DigraphVertexLabel(gr, 3); # Expected output: 3 # But found: Error, Variable: 'DigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:39 # Input is: ClearDigraphVertexLabels(gr); # Expected output: # But found: Error, Variable: 'ClearDigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:40 # Input is: DigraphVertexLabels(gr); # Expected output: [ 1 .. 3 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:42 # Input is: gr := RandomDigraph(5);; # Expected output: # But found: Error, Variable: 'RandomDigraph' must have a value ######## ########> Diff in standard/labels.tst:43 # Input is: SetDigraphVertexLabel(gr, 6, (1, 3, 2, 5, 4)); # Expected output: Error, the 2nd argument is not a vertex of the digraph that is the 1st\ \ argument, # But found: Error, Variable: 'SetDigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:46 # Input is: SetDigraphVertexLabel(gr, 2, (1, 3, 2, 5, 4)); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:47 # Input is: DigraphVertexLabel(gr, 2); # Expected output: (1,3,2,5,4) # But found: Error, Variable: 'DigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:49 # Input is: gr := RandomDigraph(3);; # Expected output: # But found: Error, Variable: 'RandomDigraph' must have a value ######## ########> Diff in standard/labels.tst:50 # Input is: DigraphVertexLabel(gr, 2); # Expected output: 2 # But found: Error, Variable: 'DigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:52 # Input is: gr := RandomDigraph(10);; # Expected output: # But found: Error, Variable: 'RandomDigraph' must have a value ######## ########> Diff in standard/labels.tst:53 # Input is: gr := InducedSubdigraph(gr, [1, 2, 3, 5, 7]);; # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/labels.tst:54 # Input is: DigraphVertexLabels(gr); # Expected output: [ 1, 2, 3, 5, 7 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:56 # Input is: DigraphVertices(gr); # Expected output: [ 1 .. 5 ] # But found: Error, Variable: 'DigraphVertices' must have a value ######## ########> Diff in standard/labels.tst:58 # Input is: gr := Digraph([[4, 8], [4, 9], [5], [9], [6], [3, 5], [], [6], [1, 3], [10]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:61 # Input is: x := DigraphVertexLabels(gr); # Expected output: [ 1 .. 10 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:63 # Input is: x[1] := "a"; # Expected output: "a" # But found: Error, Variable: 'x' must have a value ######## ########> Diff in standard/labels.tst:65 # Input is: x; # Expected output: [ "a", 2, 3, 4, 5, 6, 7, 8, 9, 10 ] # But found: Error, Variable: 'x' must have a value ######## ########> Diff in standard/labels.tst:67 # Input is: DigraphVertexLabels(gr); # Expected output: [ 1 .. 10 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:69 # Input is: SetDigraphVertexLabel(gr, 2, []); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:70 # Input is: x := DigraphVertexLabel(gr, 2); # Expected output: [ ] # But found: Error, Variable: 'DigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:72 # Input is: Add(x, 1); # Expected output: # But found: Error, Variable: 'x' must have a value ######## ########> Diff in standard/labels.tst:73 # Input is: x; # Expected output: [ 1 ] # But found: Error, Variable: 'x' must have a value ######## ########> Diff in standard/labels.tst:75 # Input is: DigraphVertexLabels(gr); # Expected output: [ 1, [ ], 3, 4, 5, 6, 7, 8, 9, 10 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:77 # Input is: RemoveDigraphVertexLabel(gr, 2); # Expected output: # But found: Error, Variable: 'RemoveDigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:78 # Input is: DigraphVertexLabels(gr); # Expected output: [ 1, 3, 4, 5, 6, 7, 8, 9, 10 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/labels.tst:80 # Input is: D := NullDigraph(5);; # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/labels.tst:81 # Input is: RemoveDigraphVertexLabel(D, 6); # Expected output: # But found: Error, Variable: 'RemoveDigraphVertexLabel' must have a value ######## ########> Diff in standard/labels.tst:84 # Input is: gr := Digraph([[2, 3], [3], [1, 5], [], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:86 # Input is: DigraphEdgeLabels(gr); # Expected output: [ [ 1, 1 ], [ 1 ], [ 1, 1 ], [ ], [ 1 ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:88 # Input is: SetDigraphEdgeLabels(gr, [1, 2]); # Expected output: Error, the 2nd argument must be a list with the same shape as the out\ \ -neighbours of the digraph that is the 1st argument, # But found: Error, Variable: 'SetDigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:91 # Input is: SetDigraphEdgeLabel(gr, 2, 4, "banana"); # Expected output: Error, there is no edge from 2 to 4 in the digraph that is the 1st argument, # But found: Error, Variable: 'SetDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:94 # Input is: SetDigraphEdgeLabels(gr, function(x, y) return x + y; end); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:95 # Input is: DigraphEdgeLabels(gr); # Expected output: [ [ 3, 4 ], [ 5 ], [ 4, 8 ], [ ], [ 9 ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:97 # Input is: SetDigraphEdgeLabels(gr, [["a", "b"], ["c"], [42, []], [], [1]]); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:99 # Input is: DigraphEdgeLabels(gr); # Expected output: [ [ "a", "b" ], [ "c" ], [ 42, [ ] ], [ ], [ 1 ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:101 # Input is: DigraphEdgeLabel(gr, 1, 2); # Expected output: "a" # But found: Error, Variable: 'DigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:103 # Input is: SetDigraphEdgeLabel(gr, 1, 2, "23"); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:104 # Input is: DigraphEdgeLabel(gr, 1, 2); # Expected output: "23" # But found: Error, Variable: 'DigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:106 # Input is: DigraphEdgeLabels(gr); # Expected output: [ [ "23", "b" ], [ "c" ], [ 42, [ ] ], [ ], [ 1 ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:108 # Input is: x := DigraphEdgeLabel(gr, 3, 5); # Expected output: [ ] # But found: Error, Variable: 'DigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:110 # Input is: Add(x, "hello, world"); # Expected output: # But found: Error, Variable: 'x' must have a value ######## ########> Diff in standard/labels.tst:111 # Input is: x; # Expected output: [ "hello, world" ] # But found: Error, Variable: 'x' must have a value ######## ########> Diff in standard/labels.tst:113 # Input is: DigraphEdgeLabels(gr); # Expected output: [ [ "23", "b" ], [ "c" ], [ 42, [ ] ], [ ], [ 1 ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:115 # Input is: gr := Digraph([[3], [1, 3, 5], [1], [1, 2, 4], [2, 3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:117 # Input is: l := DigraphEdgeLabels(gr); # Expected output: [ [ 1 ], [ 1, 1, 1 ], [ 1 ], [ 1, 1, 1 ], [ 1, 1, 1 ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:119 # Input is: MakeImmutable(l); # Expected output: [ [ 1 ], [ 1, 1, 1 ], [ 1 ], [ 1, 1, 1 ], [ 1, 1, 1 ] ] # But found: Error, Variable: 'l' must have a value ######## ########> Diff in standard/labels.tst:121 # Input is: SetDigraphEdgeLabels(gr, l); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:122 # Input is: SetDigraphEdgeLabel(gr, 2, 1, "Hello, banana"); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:123 # Input is: DigraphEdgeLabels(gr); # Expected output: [ [ 1 ], [ "Hello, banana", 1, 1 ], [ 1 ], [ 1, 1, 1 ], [ 1, 1, 1 ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:125 # Input is: gr := Digraph([[2, 2], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:126 # Input is: SetDigraphEdgeLabels(gr, [[5, infinity], []]); # Expected output: Error, the argument must be a digraph with no multiple edges, edge labels \ \ are not supported on digraphs with multiple edges, # But found: Error, Variable: 'SetDigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:129 # Input is: DigraphEdgeLabels(gr); # Expected output: Error, the argument must be a digraph with no multiple edges, edge labels \ \ are not supported on digraphs with multiple edges, # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:132 # Input is: SetDigraphEdgeLabel(gr, 1, 2, infinity); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, edge lab\ \ els are not supported on digraphs with multiple edges, # But found: Error, Variable: 'SetDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:135 # Input is: gr := Digraph([[2, 3], [3], [1, 5], [], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:137 # Input is: SetDigraphEdgeLabel(gr, 2, 3, "banana"); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:138 # Input is: D := Digraph(IsMutableDigraph, [[2, 3], [3], [1, 5], [], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:140 # Input is: DigraphEdgeLabels(D); # Expected output: [ [ 1, 1 ], [ 1 ], [ 1, 1 ], [ ], [ 1 ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:142 # Input is: DigraphAddVertex(D); # Expected output: # But found: Error, Variable: 'DigraphAddVertex' must have a value ######## ########> Diff in standard/labels.tst:144 # Input is: DigraphAddEdge(D, 6, 1); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/labels.tst:146 # Input is: SetDigraphEdgeLabel(D, 6, 1, "banana"); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:147 # Input is: DigraphEdgeLabels(D); # Expected output: [ [ 1, 1 ], [ 1 ], [ 1, 1 ], [ ], [ 1 ], [ "banana" ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:149 # Input is: DigraphAddEdge(D, 6, 1); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/labels.tst:151 # Input is: DigraphEdgeLabel(D, 6, 1); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, edge lab\ \ els are not supported on digraphs with multiple edges, # But found: Error, Variable: 'DigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:154 # Input is: SetDigraphEdgeLabels(D, ReturnFail); # Expected output: Error, the argument must be a digraph with no multiple edges, edge labels \ \ are not supported on digraphs with multiple edges, # But found: Error, Variable: 'SetDigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:157 # Input is: D := Digraph(IsMutableDigraph, [[2, 3], [3], [1, 5], [], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:159 # Input is: DigraphEdgeLabel(D, 1, 5); # Expected output: Error, there is no edge from 1 to 5 in the digraph that is the 1st argument, # But found: Error, Variable: 'DigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:162 # Input is: gr := Digraph(IsMutableDigraph, [[2, 3], [3], [1, 5], [], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:164 # Input is: SetDigraphEdgeLabel(gr, 1, 2, "bab"); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:165 # Input is: DigraphAddVertex(gr); # Expected output: # But found: Error, Variable: 'DigraphAddVertex' must have a value ######## ########> Diff in standard/labels.tst:167 # Input is: DigraphAddEdge(gr, 6, 1); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/labels.tst:169 # Input is: SetDigraphEdgeLabel(gr, 6, 1, "bab"); # Expected output: # But found: Error, Variable: 'SetDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:170 # Input is: RemoveDigraphEdgeLabel(gr, 6, 1); # Expected output: # But found: Error, Variable: 'RemoveDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:171 # Input is: ClearDigraphEdgeLabels(gr); # Expected output: # But found: Error, Variable: 'ClearDigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:172 # Input is: DigraphEdgeLabel(gr, 6, 1); # Expected output: 1 # But found: Error, Variable: 'DigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:176 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:178 # Input is: DigraphEdgeLabel(gr, 1, 2); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, edge lab\ \ els are not supported on digraphs with multiple edges, # But found: Error, Variable: 'DigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:181 # Input is: SetDigraphEdgeLabels(gr, ReturnFalse); # Expected output: Error, the argument must be a digraph with no multiple edges, edge labels \ \ are not supported on digraphs with multiple edges, # But found: Error, Variable: 'SetDigraphEdgeLabels' must have a value ######## ########> Diff in standard/labels.tst:184 # Input is: gr := Digraph([[2, 1], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/labels.tst:186 # Input is: DigraphEdgeLabel(gr, 2, 2); # Expected output: Error, there is no edge from 2 to 2 in the digraph that is the 1st argument, # But found: Error, Variable: 'DigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:189 # Input is: SetDigraphEdgeLabel(gr, 2, 2, "a"); # Expected output: Error, there is no edge from 2 to 2 in the digraph that is the 1st argument, # But found: Error, Variable: 'SetDigraphEdgeLabel' must have a value ######## ########> Diff in standard/labels.tst:194 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/labels.tst msecs: 125 false gap> ########> Diff in standard/oper.tst:15 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/oper.tst:18 # Input is: gr := DigraphFromDigraph6String("&EhxPC?@"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:20 # Input is: DigraphRemoveLoops(gr); # Expected output: # But found: Error, Variable: 'DigraphRemoveLoops' must have a value ######## ########> Diff in standard/oper.tst:22 # Input is: gr := DigraphFromDigraph6String("&EhxPC?@"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:24 # Input is: HasDigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'HasDigraphHasLoops' must have a value ######## ########> Diff in standard/oper.tst:26 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/oper.tst:28 # Input is: gr1 := DigraphRemoveLoops(gr); # Expected output: # But found: Error, Variable: 'DigraphRemoveLoops' must have a value ######## ########> Diff in standard/oper.tst:30 # Input is: HasDigraphHasLoops(gr1); # Expected output: true # But found: Error, Variable: 'HasDigraphHasLoops' must have a value ######## ########> Diff in standard/oper.tst:32 # Input is: DigraphHasLoops(gr1); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/oper.tst:36 # Input is: gr := Digraph([[2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:38 # Input is: DigraphRemoveEdges(gr, [[2, 1]]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/oper.tst:40 # Input is: last = gr; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:42 # Input is: DigraphRemoveEdges(gr, [[1, 2]]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/oper.tst:44 # Input is: gr := DigraphFromDigraph6String("&DtGsw_"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:46 # Input is: Set(DigraphEdges(gr)) = Set( [[1, 2], [1, 1], [1, 4], [2, 1], [2, 4], [3, 4], [3, 3], [4, 1], [4, 5], [4, 4], [5, 1], [5, 5]]); # Expected output: true # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:50 # Input is: gr1 := DigraphRemoveEdges(gr, [[1, 4], [4, 5], [5, 5]]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/oper.tst:52 # Input is: DigraphEdges(gr1); # Expected output: [ [ 1, 2 ], [ 1, 1 ], [ 2, 1 ], [ 2, 4 ], [ 3, 4 ], [ 3, 3 ], [ 4, 1 ], [ 4, 4 ], [ 5, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:55 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:57 # Input is: DigraphRemoveEdges(gr, [[1, 2]]); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/oper.tst:61 # Input is: gr := Digraph([[1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:63 # Input is: DigraphRemoveEdge(gr, [1, 1]); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:65 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:67 # Input is: DigraphRemoveEdge(gr, [1, 1, 1]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:69 # Input is: DigraphRemoveEdge(gr, [Group(()), Group(())]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphRemoveEdge' on 3 arguments # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:72 # Input is: DigraphRemoveEdge(gr, [1, Group(())]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphRemoveEdge' on 3 arguments # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:75 # Input is: DigraphRemoveEdge(gr, [3, 1]); # Expected output: Error, the 2nd argument must be a vertex of the digraph that is the \ \ 1st argument, # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:78 # Input is: DigraphRemoveEdge(gr, [1, 3]); # Expected output: Error, the 3rd argument must be a vertex of the digraph that is the \ \ 1st argument, # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:81 # Input is: gr := DigraphRemoveEdge(gr, [2, 1]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:83 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:87 # Input is: gr := Digraph([[2], [1], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:89 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 2 ], [ 2, 1 ], [ 3, 3 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:93 # Input is: OnDigraphs(gr, g); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/oper.tst:95 # Input is: DigraphEdges(last); # Expected output: [ [ 1, 1 ], [ 2, 3 ], [ 3, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:99 # Input is: OnDigraphs(gr, h); # Expected output: Error, the 2nd argument
must be a permutation that permutes of the digraph\ \ that is the 1st argument, # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/oper.tst:102 # Input is: gr := Digraph([[1, 1, 1, 3, 5], [], [3, 2, 4, 5], [2, 5], [1, 2, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:104 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 1 ], [ 1, 1 ], [ 1, 1 ], [ 1, 3 ], [ 1, 5 ], [ 3, 3 ], [ 3, 2 ], [ 3, 4 ], [ 3, 5 ], [ 4, 2 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 5, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:109 # Input is: OnDigraphs(gr, p1); # Expected output: Error, the 2nd argument
must be a permutation that permutes of the digraph\ \ that is the 1st argument, # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/oper.tst:114 # Input is: OnDigraphs(gr, p2); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/oper.tst:116 # Input is: DigraphEdges(last); # Expected output: [ [ 2, 1 ], [ 2, 5 ], [ 3, 3 ], [ 3, 3 ], [ 3, 3 ], [ 3, 4 ], [ 3, 5 ], [ 4, 4 ], [ 4, 1 ], [ 4, 2 ], [ 4, 5 ], [ 5, 3 ], [ 5, 1 ], [ 5, 3 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:119 # Input is: gr := DigraphFromDiSparse6String(".CaoJG_hF"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/oper.tst:121 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 2 ], [ 1, 3 ], [ 2, 1 ], [ 2, 4 ], [ 2, 4 ], [ 3, 3 ], [ 4, 1 ], [ 4, 3 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:126 # Input is: OnDigraphs(gr, p1); # Expected output: Error, the 2nd argument
must be a permutation that permutes of the digraph\ \ that is the 1st argument, # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/oper.tst:131 # Input is: OnDigraphs(gr, p2); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/oper.tst:133 # Input is: DigraphEdges(last); # Expected output: [ [ 1, 4 ], [ 1, 2 ], [ 2, 2 ], [ 3, 4 ], [ 3, 1 ], [ 3, 1 ], [ 4, 3 ], [ 4, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:138 # Input is: gr := Digraph([[2], [1, 3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:140 # Input is: OutNeighbours(gr); # Expected output: [ [ 2 ], [ 1, 3 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:143 # Input is: OnDigraphs(gr, t); # Expected output: Error, the 2nd argument must be a transformation that maps every vertex of\ \ the digraph that is the 1st argument, to another vertex. # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/oper.tst:147 # Input is: gr := OnDigraphs(gr, t); # Expected output: # But found: Error, Variable: 'OnDigraphs' must have a value ######## ########> Diff in standard/oper.tst:149 # Input is: OutNeighbours(gr); # Expected output: [ [ 2 ], [ 1, 1 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:153 # Input is: gr1 := CompleteDigraph(3); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:155 # Input is: DigraphEdges(gr1); # Expected output: [ [ 1, 2 ], [ 1, 3 ], [ 2, 1 ], [ 2, 3 ], [ 3, 1 ], [ 3, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:157 # Input is: gr2 := OnMultiDigraphs(gr1, (1, 3), (3, 6));; # Expected output: # But found: Error, Variable: 'OnMultiDigraphs' must have a value ######## ########> Diff in standard/oper.tst:158 # Input is: DigraphEdges(gr1);; # Expected output: # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:159 # Input is: OnMultiDigraphs(gr1, [(1, 3)]); # Expected output: Error, the 2nd argument must be a pair of permutations, # But found: Error, Variable: 'OnMultiDigraphs' must have a value ######## ########> Diff in standard/oper.tst:161 # Input is: OnMultiDigraphs(gr1, [(1, 3), (1, 7)]); # Expected output: Error, the 2nd entry of the 2nd argument must permute the edges of the\ \ digraph that is the 1st argument, # But found: Error, Variable: 'OnMultiDigraphs' must have a value ######## ########> Diff in standard/oper.tst:166 # Input is: gr := DigraphFromDiSparse6String(".IgBGLQ?Apkc"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/oper.tst:168 # Input is: InNeighborsOfVertex(gr, 7); # Expected output: [ 7 ] # But found: Error, Variable: 'InNeighborsOfVertex' must have a value ######## ########> Diff in standard/oper.tst:170 # Input is: InNeighboursOfVertex(gr, 7); # Expected output: [ 7 ] # But found: Error, Variable: 'InNeighboursOfVertex' must have a value ######## ########> Diff in standard/oper.tst:172 # Input is: InDegreeOfVertex(gr, 7); # Expected output: 1 # But found: Error, Variable: 'InDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:174 # Input is: InNeighboursOfVertex(gr, 11); # Expected output: Error, the 2nd argument is not a vertex of the 1st argument , # But found: Error, Variable: 'InNeighboursOfVertex' must have a value ######## ########> Diff in standard/oper.tst:176 # Input is: InDegreeOfVertex(gr, 11); # Expected output: Error, the 2nd argument is not a vertex of the 1st argument , # But found: Error, Variable: 'InDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:178 # Input is: gr := DigraphFromDiSparse6String(".CgXo?eWCaJ"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/oper.tst:180 # Input is: InNeighboursOfVertex(gr, 3); # Expected output: [ 2 ] # But found: Error, Variable: 'InNeighboursOfVertex' must have a value ######## ########> Diff in standard/oper.tst:182 # Input is: InDegreeOfVertex(gr, 3); # Expected output: 1 # But found: Error, Variable: 'InDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:184 # Input is: InNeighbours(gr); # Expected output: [ [ 1, 1 ], [ 2, 3, 4 ], [ 2 ], [ 1, 2, 3, 3, 3 ] ] # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in standard/oper.tst:186 # Input is: InNeighboursOfVertex(gr, 4); # Expected output: [ 1, 2, 3, 3, 3 ] # But found: Error, Variable: 'InNeighboursOfVertex' must have a value ######## ########> Diff in standard/oper.tst:188 # Input is: InDegreeOfVertex(gr, 4); # Expected output: 5 # But found: Error, Variable: 'InDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:190 # Input is: InDegrees(gr); # Expected output: [ 2, 3, 1, 5 ] # But found: Error, Variable: 'InDegrees' must have a value ######## ########> Diff in standard/oper.tst:192 # Input is: InDegreeOfVertex(gr, 2); # Expected output: 3 # But found: Error, Variable: 'InDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:196 # Input is: gr := DigraphFromDiSparse6String(".Ig??OaDgDQ~"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/oper.tst:198 # Input is: OutNeighborsOfVertex(gr, 2); # Expected output: [ ] # But found: Error, Variable: 'OutNeighborsOfVertex' must have a value ######## ########> Diff in standard/oper.tst:200 # Input is: OutNeighboursOfVertex(gr, 2); # Expected output: [ ] # But found: Error, Variable: 'OutNeighboursOfVertex' must have a value ######## ########> Diff in standard/oper.tst:202 # Input is: OutDegreeOfVertex(gr, 2); # Expected output: 0 # But found: Error, Variable: 'OutDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:204 # Input is: OutNeighboursOfVertex(gr, 5); # Expected output: [ 1, 1, 2, 2, 3, 3 ] # But found: Error, Variable: 'OutNeighboursOfVertex' must have a value ######## ########> Diff in standard/oper.tst:206 # Input is: OutDegreeOfVertex(gr, 5); # Expected output: 6 # But found: Error, Variable: 'OutDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:208 # Input is: OutNeighboursOfVertex(gr, 12); # Expected output: Error, the 2nd argument is not a vertex of the 1st argument , # But found: Error, Variable: 'OutNeighboursOfVertex' must have a value ######## ########> Diff in standard/oper.tst:210 # Input is: OutDegreeOfVertex(gr, 12); # Expected output: Error, the 2nd argument is not a vertex of the 1st argument , # But found: Error, Variable: 'OutDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:212 # Input is: gr := Digraph([[2, 2, 2, 2], [2, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:214 # Input is: OutNeighboursOfVertex(gr, 2); # Expected output: [ 2, 2 ] # But found: Error, Variable: 'OutNeighboursOfVertex' must have a value ######## ########> Diff in standard/oper.tst:216 # Input is: OutDegreeOfVertex(gr, 2); # Expected output: 2 # But found: Error, Variable: 'OutDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:218 # Input is: OutDegrees(gr); # Expected output: [ 4, 2 ] # But found: Error, Variable: 'OutDegrees' must have a value ######## ########> Diff in standard/oper.tst:220 # Input is: OutDegreeOfVertex(gr, 1); # Expected output: 4 # But found: Error, Variable: 'OutDegreeOfVertex' must have a value ######## ########> Diff in standard/oper.tst:227 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:229 # Input is: InducedSubdigraph(gr, [-1]); # Expected output: Error, the 2nd argument must be a duplicate-free subset of the vertices\ \ of the digraph that is the 1st argument, # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:232 # Input is: InducedSubdigraph(gr, [1 .. 9]); # Expected output: Error, the 2nd argument must be a duplicate-free subset of the vertices\ \ of the digraph that is the 1st argument, # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:235 # Input is: InducedSubdigraph(gr, []); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:237 # Input is: InducedSubdigraph(gr, [2 .. 6]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:239 # Input is: InducedSubdigraph(gr, [8]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:241 # Input is: i1 := InducedSubdigraph(gr, [1, 4, 3]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:243 # Input is: OutNeighbours(i1); # Expected output: [ [ 1, 1, 3, 3, 2 ], [ ], [ 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:245 # Input is: i2 := InducedSubdigraph(gr, [3, 4, 3, 1]); # Expected output: Error, the 2nd argument must be a duplicate-free subset of the vertices\ \ of the digraph that is the 1st argument, # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:250 # Input is: gr := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:252 # Input is: InducedSubdigraph(gr, ["a"]); # Expected output: Error, the 2nd argument must be a duplicate-free subset of the vertices\ \ of the digraph that is the 1st argument, # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:255 # Input is: InducedSubdigraph(gr, [0]); # Expected output: Error, the 2nd argument must be a duplicate-free subset of the vertices\ \ of the digraph that is the 1st argument, # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:258 # Input is: InducedSubdigraph(gr, [2 .. 9]); # Expected output: Error, the 2nd argument must be a duplicate-free subset of the vertices\ \ of the digraph that is the 1st argument, # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:261 # Input is: InducedSubdigraph(gr, []); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:263 # Input is: i1 := InducedSubdigraph(gr, [1, 3, 5, 7]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:265 # Input is: OutNeighbours(i1); # Expected output: [ [ 2, 3, 4 ], [ ], [ 1, 2, 3, 4 ], [ 1 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:267 # Input is: i2 := InducedSubdigraph(gr, [7, 5, 3, 1]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:269 # Input is: i1 = i2; # Expected output: false # But found: Error, Variable: 'i1' must have a value ######## ########> Diff in standard/oper.tst:271 # Input is: IsIsomorphicDigraph(i1, i2); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/oper.tst:273 # Input is: InducedSubdigraph(gr, [2 .. 8]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:275 # Input is: InducedSubdigraph(gr, [8]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:277 # Input is: InducedSubdigraph(gr, [7, 8]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:279 # Input is: gr := Digraph([[2, 4], [4, 5], [2, 5, 5], [5, 5], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:281 # Input is: gri := InducedSubdigraph(gr, [4, 2, 5]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:283 # Input is: DigraphVertexLabels(gri); # Expected output: [ 4, 2, 5 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:285 # Input is: OutNeighbours(gri); # Expected output: [ [ 3, 3 ], [ 1, 3 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:289 # Input is: gr := CompleteDigraph(2); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:291 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 2 ], [ 2, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:293 # Input is: qr := QuotientDigraph(gr, [[1, 2]]); # Expected output: # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:295 # Input is: DigraphEdges(qr); # Expected output: [ [ 1, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:297 # Input is: QuotientDigraph(EmptyDigraph(0), []); # Expected output: # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:299 # Input is: QuotientDigraph(EmptyDigraph(0), [[1]]); # Expected output: Error, the 2nd argument should be an empty list, which is the only\ \ valid partition of the vertices of 1st argument because it has no vertice\ \ s, # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:303 # Input is: gr := Digraph([[1, 2, 3, 2], [1, 3, 2], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:305 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 1 ], [ 1, 2 ], [ 1, 3 ], [ 1, 2 ], [ 2, 1 ], [ 2, 3 ], [ 2, 2 ], [ 3, 1 ], [ 3, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:308 # Input is: qr := QuotientDigraph(gr, [[1, 3], [2]]); # Expected output: # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:310 # Input is: DigraphEdges(qr); # Expected output: [ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:312 # Input is: QuotientDigraph(gr, [3]); # Expected output: Error, the 2nd argument is not a valid partition of the vertices [\ \ 1 .. 3] of the 1st argument , # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:315 # Input is: QuotientDigraph(gr, []); # Expected output: Error, the 2nd argument is not a valid partition of the vertices [\ \ 1 .. 3] of the 1st argument , # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:318 # Input is: QuotientDigraph(gr, [[], []]); # Expected output: Error, the 2nd argument is not a valid partition of the vertices [\ \ 1 .. 3] of the 1st argument , # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:321 # Input is: QuotientDigraph(gr, [[0], [1]]); # Expected output: Error, the 2nd argument is not a valid partition of the vertices [\ \ 1 .. 3] of the 1st argument , # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:324 # Input is: QuotientDigraph(gr, [[1], [2], [0]]); # Expected output: Error, the 2nd argument is not a valid partition of the vertices [\ \ 1 .. 3] of the 1st argument , # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:327 # Input is: QuotientDigraph(gr, [[1], [2, 4]]); # Expected output: Error, the 2nd argument is not a valid partition of the vertices [\ \ 1 .. 3] of the 1st argument , # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:330 # Input is: QuotientDigraph(gr, [[1, 2], [2]]); # Expected output: Error, the 2nd argument is not a valid partition of the vertices [\ \ 1 .. 3] of the 1st argument , # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:333 # Input is: QuotientDigraph(gr, [[1], [2]]); # Expected output: Error, the 2nd argument is not a valid partition of the vertices [\ \ 1 .. 3] of the 1st argument , # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:336 # Input is: gr := Digraph(rec( DigraphNrVertices := 8, DigraphSource := [1, 1, 2, 2, 3, 4, 4, 4, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 8, \ 8], DigraphRange := [6, 7, 1, 6, 5, 1, 4, 8, 1, 3, 4, 6, 7, 7, 1, 4, 5, 6, 7, 5, 6\ ])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:341 # Input is: qr := QuotientDigraph(gr, [[1], [2, 3, 5, 7], [4, 6, 8]]); # Expected output: # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:343 # Input is: OutNeighbours(qr); # Expected output: [ [ 2, 3 ], [ 1, 2, 3 ], [ 1, 2, 3 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:347 # Input is: gr := Digraph([[2, 2, 2, 2, 2], [1, 1, 1, 1], [1], [3, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:349 # Input is: DigraphInEdges(gr, 1); # Expected output: [ [ 2, 1 ], [ 2, 1 ], [ 2, 1 ], [ 2, 1 ], [ 3, 1 ] ] # But found: Error, Variable: 'DigraphInEdges' must have a value ######## ########> Diff in standard/oper.tst:351 # Input is: DigraphOutEdges(gr, 3); # Expected output: [ [ 3, 1 ] ] # But found: Error, Variable: 'DigraphOutEdges' must have a value ######## ########> Diff in standard/oper.tst:353 # Input is: DigraphOutEdges(gr, 5); # Expected output: Error, the 2nd argument is not a vertex of the 1st argument , # But found: Error, Variable: 'DigraphOutEdges' must have a value ######## ########> Diff in standard/oper.tst:355 # Input is: DigraphInEdges(gr, 1000); # Expected output: Error, the 2nd argument is not a vertex of the 1st argument , # But found: Error, Variable: 'DigraphInEdges' must have a value ######## ########> Diff in standard/oper.tst:357 # Input is: gr := Digraph(rec(DigraphVertices := ["a", "b", "c"], DigraphSource := ["a", "\ a", "b"], DigraphRange := ["b", "b", "c"])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:360 # Input is: DigraphInEdges(gr, 1); # Expected output: [ ] # But found: Error, Variable: 'DigraphInEdges' must have a value ######## ########> Diff in standard/oper.tst:362 # Input is: DigraphInEdges(gr, 2); # Expected output: [ [ 1, 2 ], [ 1, 2 ] ] # But found: Error, Variable: 'DigraphInEdges' must have a value ######## ########> Diff in standard/oper.tst:364 # Input is: DigraphOutEdges(gr, 1); # Expected output: [ [ 1, 2 ], [ 1, 2 ] ] # But found: Error, Variable: 'DigraphOutEdges' must have a value ######## ########> Diff in standard/oper.tst:368 # Input is: gr := Digraph([[2, 4], [], [2, 6], [1, 3], [2, 3], [5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:370 # Input is: DigraphStronglyConnectedComponent(gr, 1); # Expected output: [ 1, 4 ] # But found: Error, Variable: 'DigraphStronglyConnectedComponent' must have a value ######## ########> Diff in standard/oper.tst:372 # Input is: DigraphStronglyConnectedComponent(gr, 2); # Expected output: [ 2 ] # But found: Error, Variable: 'DigraphStronglyConnectedComponent' must have a value ######## ########> Diff in standard/oper.tst:374 # Input is: DigraphStronglyConnectedComponent(gr, 3); # Expected output: [ 3, 6, 5 ] # But found: Error, Variable: 'DigraphStronglyConnectedComponent' must have a value ######## ########> Diff in standard/oper.tst:376 # Input is: DigraphStronglyConnectedComponent(gr, 7); # Expected output: Error, the 2nd argument is not a vertex of the 1st argument , # But found: Error, Variable: 'DigraphStronglyConnectedComponent' must have a value ######## ########> Diff in standard/oper.tst:380 # Input is: gr := Digraph([[2, 4], [], [2, 6], [1, 3], [2, 3], [5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:382 # Input is: DigraphConnectedComponent(gr, 3); # Expected output: [ 1, 2, 3, 4, 5, 6 ] # But found: Error, Variable: 'DigraphConnectedComponent' must have a value ######## ########> Diff in standard/oper.tst:384 # Input is: DigraphConnectedComponent(gr, 7); # Expected output: Error, the 2nd argument is not a vertex of the 1st argument , # But found: Error, Variable: 'DigraphConnectedComponent' must have a value ######## ########> Diff in standard/oper.tst:390 # Input is: gr := CycleDigraph(1000); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:392 # Input is: IsDigraphEdge(gr, [1]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:394 # Input is: IsDigraphEdge(gr, ["a", 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:396 # Input is: IsDigraphEdge(gr, [1, "a"]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:398 # Input is: IsDigraphEdge(gr, [1001, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:400 # Input is: IsDigraphEdge(gr, [1, 1001]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:402 # Input is: IsDigraphEdge(gr, [100, 101]); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:404 # Input is: IsDigraphEdge(gr, [1000, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:406 # Input is: IsDigraphEdge(gr, [1000, 600]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:412 # Input is: gr := Digraph(out); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:414 # Input is: IsDigraphEdge(gr, [1]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:416 # Input is: IsDigraphEdge(gr, ["a", 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:418 # Input is: IsDigraphEdge(gr, [1, "a"]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:420 # Input is: IsDigraphEdge(gr, [1001, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:422 # Input is: IsDigraphEdge(gr, [1, 1001]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:424 # Input is: IsDigraphEdge(gr, [100, 101]); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:426 # Input is: IsDigraphEdge(gr, [1000, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:428 # Input is: IsDigraphEdge(gr, [1000, 600]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:430 # Input is: gr := Digraph(rec(DigraphNrVertices := 2, DigraphSource := [1], DigraphRange :\ = [2])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:432 # Input is: IsDigraphEdge(gr, [2, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:434 # Input is: IsDigraphEdge(gr, [1, 1]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:438 # Input is: gr := CompleteDigraph(500); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:440 # Input is: IsDigraphEdge(gr, [200, 199]); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:442 # Input is: IsDigraphEdge(gr, [499, 499]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:444 # Input is: IsDigraphEdge(gr, [249, 251]); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:446 # Input is: gr := EmptyDigraph(1000000); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/oper.tst:448 # Input is: IsDigraphEdge(gr, [9999, 9999]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:450 # Input is: gr := CompleteDigraph(10); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:452 # Input is: mat := AdjacencyMatrix(gr);; # Expected output: # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:453 # Input is: IsDigraphEdge(gr, [5, 5]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:455 # Input is: IsDigraphEdge(gr, [5, 6]); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:457 # Input is: gr := Digraph([[1, 1], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:459 # Input is: mat := AdjacencyMatrix(gr);; # Expected output: # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:460 # Input is: IsDigraphEdge(gr, [1, 1]); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:462 # Input is: IsDigraphEdge(gr, [1, 2]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:468 # Input is: gr := Digraph([1 .. 20], adj);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:469 # Input is: IsDigraphEdge(gr, [1, 4]); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:471 # Input is: IsDigraphEdge(gr, 3, 6); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:473 # Input is: IsDigraphEdge(gr, 12, 6); # Expected output: true # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:475 # Input is: IsDigraphEdge(gr, 26, 13); # Expected output: false # But found: Error, Variable: 'IsDigraphEdge' must have a value ######## ########> Diff in standard/oper.tst:479 # Input is: gr := RandomDigraph(100);; # Expected output: # But found: Error, Variable: 'RandomDigraph' must have a value ######## ########> Diff in standard/oper.tst:480 # Input is: DigraphAddEdges(gr, []);; # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:481 # Input is: gr = last; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:483 # Input is: DigraphAddEdges(gr, [12]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphAddEdge' on 2 arguments # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:486 # Input is: DigraphAddEdges(gr, [[12]]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:488 # Input is: DigraphAddEdges(gr, [[12, 13, 14], [11, 10]]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:490 # Input is: DigraphAddEdges(gr, [[-2, 3], ["a"]]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphAddEdge' on 3 arguments # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:493 # Input is: DigraphAddEdges(gr, [[11, 10], [12, 13, 14]]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:495 # Input is: DigraphAddEdges(gr, [[4, 5], [1, 120], [1, 1]]); # Expected output: Error, the 2nd argument must be a vertex of the digraph that is the \ \ 1st argument, # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:498 # Input is: DigraphAddEdges(gr, [[4, 5], [120, 1], [1, 1]]); # Expected output: Error, the 2nd argument must be a vertex of the digraph that is the \ \ 1st argument, # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:501 # Input is: gr := Digraph([[2, 2], [1, 3, 2], [2, 1], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:503 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 2 ], [ 1, 2 ], [ 2, 1 ], [ 2, 3 ], [ 2, 2 ], [ 3, 2 ], [ 3, 1 ], [ 4, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:506 # Input is: gr2 := DigraphAddEdges(gr, [[2, 1], [3, 3], [2, 4], [3, 3]]); # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:508 # Input is: DigraphEdges(gr2); # Expected output: [ [ 1, 2 ], [ 1, 2 ], [ 2, 1 ], [ 2, 3 ], [ 2, 2 ], [ 2, 1 ], [ 2, 4 ], [ 3, 2 ], [ 3, 1 ], [ 3, 3 ], [ 3, 3 ], [ 4, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:511 # Input is: gr3 := Digraph(rec(DigraphNrVertices := DigraphNrVertices(gr), DigraphSource := ShallowCopy(DigraphSource(gr)), DigraphRange := ShallowCopy(DigraphRange(gr)))); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:515 # Input is: gr4 := DigraphAddEdges(gr3, [[2, 1], [3, 3], [2, 4], [3, 3]]); # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:517 # Input is: gr2 = gr4; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/oper.tst:519 # Input is: gr := Digraph([[1, 2], [], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:521 # Input is: gr1 := DigraphAddEdges(gr, []); # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:523 # Input is: gr = gr1; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:525 # Input is: DigraphAddEdges(gr, [3]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphAddEdge' on 2 arguments # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:528 # Input is: DigraphAddEdges(gr, [[3]]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:530 # Input is: DigraphAddEdges(gr, ["ab"]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphAddEdge' on 3 arguments # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:533 # Input is: DigraphAddEdges(gr, [[-1, -2]]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphAddEdge' on 3 arguments # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:536 # Input is: DigraphAddEdges(gr, [[1, 2], [1, 2, 3]]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:538 # Input is: DigraphAddEdges(gr, [[4, 2]]); # Expected output: Error, the 2nd argument must be a vertex of the digraph that is the \ \ 1st argument, # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:541 # Input is: DigraphAddEdges(gr, [[2, 4]]); # Expected output: Error, the 2nd argument must be a vertex of the digraph that is the \ \ 1st argument, # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:544 # Input is: DigraphAddEdges(gr, [[2, 3], [2, 3]]); # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:546 # Input is: DigraphEdges(last); # Expected output: [ [ 1, 1 ], [ 1, 2 ], [ 2, 3 ], [ 2, 3 ], [ 3, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:548 # Input is: DigraphEdges(gr); # Expected output: [ [ 1, 1 ], [ 1, 2 ], [ 3, 1 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:552 # Input is: gr := RandomDigraph(10);; # Expected output: # But found: Error, Variable: 'RandomDigraph' must have a value ######## ########> Diff in standard/oper.tst:553 # Input is: DigraphAddEdge(gr, [1, 2, 3]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:555 # Input is: DigraphAddEdge(gr, ["a", "a"]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphAddEdge' on 3 arguments # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:558 # Input is: DigraphAddEdge(gr, [1, "a"]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphAddEdge' on 3 arguments # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:561 # Input is: DigraphAddEdge(gr, [11, 1]); # Expected output: Error, the 2nd argument must be a vertex of the digraph that is the \ \ 1st argument, # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:564 # Input is: DigraphAddEdge(gr, [1, 11]); # Expected output: Error, the 2nd argument must be a vertex of the digraph that is the \ \ 1st argument, # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:567 # Input is: gr := EmptyDigraph(2); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/oper.tst:569 # Input is: DigraphAddEdge(gr, [1, 2]); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:571 # Input is: DigraphEdges(last); # Expected output: [ [ 1, 2 ] ] # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:575 # Input is: gr := Digraph([[1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:576 # Input is: gr2 := DigraphAddVertices(gr, 3); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:578 # Input is: DigraphVertices(gr2); # Expected output: [ 1 .. 4 ] # But found: Error, Variable: 'DigraphVertices' must have a value ######## ########> Diff in standard/oper.tst:580 # Input is: DigraphEdges(gr) = DigraphEdges(gr2); # Expected output: true # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:582 # Input is: gr2 := DigraphAddVertices(gr, [SymmetricGroup(2), Group(())]); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:584 # Input is: DigraphVertices(gr2); # Expected output: [ 1 .. 3 ] # But found: Error, Variable: 'DigraphVertices' must have a value ######## ########> Diff in standard/oper.tst:586 # Input is: DigraphEdges(gr) = DigraphEdges(gr2); # Expected output: true # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:588 # Input is: DigraphVertexLabels(gr2); # Expected output: [ 1, Sym( [ 1 .. 2 ] ), Group(()) ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:590 # Input is: gr := Digraph([[1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:591 # Input is: SetDigraphVertexLabels(gr, [AlternatingGroup(5)]); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:592 # Input is: gr2 := DigraphAddVertices(gr, [SymmetricGroup(2), Group(())]); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:594 # Input is: DigraphVertexLabels(gr2); # Expected output: [ Alt( [ 1 .. 5 ] ), Sym( [ 1 .. 2 ] ), Group(()) ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:596 # Input is: gr := Digraph(rec(DigraphNrVertices := 1, DigraphSource := [1], DigraphRange :\ = [1])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:598 # Input is: gr2 := DigraphAddVertices(gr, 2); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:600 # Input is: DigraphVertexLabels(gr2); # Expected output: [ 1, 2, 3 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:602 # Input is: SetDigraphVertexLabels(gr, [true]); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:603 # Input is: gr2 := DigraphAddVertices(gr, 2); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:605 # Input is: DigraphVertexLabels(gr2); # Expected output: [ true, 2, 3 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:607 # Input is: gr := Digraph(rec(DigraphNrVertices := 1, DigraphSource := [1], DigraphRange :\ = [1]));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:608 # Input is: gr2 := DigraphAddVertices(gr, [SymmetricGroup(2), Group(())]); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:610 # Input is: DigraphVertexLabels(gr2); # Expected output: [ 1, Sym( [ 1 .. 2 ] ), Group(()) ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:612 # Input is: gr := Digraph(rec(DigraphNrVertices := 1, DigraphSource := [1], DigraphRange :\ = [1]));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:613 # Input is: SetDigraphVertexLabels(gr, [AlternatingGroup(5)]); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:614 # Input is: gr2 := DigraphAddVertices(gr, [SymmetricGroup(2), Group(())]); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:616 # Input is: DigraphVertexLabels(gr2); # Expected output: [ Alt( [ 1 .. 5 ] ), Sym( [ 1 .. 2 ] ), Group(()) ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:618 # Input is: DigraphAddVertices(gr2, -1); # Expected output: Error, the 2nd argument must be a non-negative integer, # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:620 # Input is: gr3 := DigraphAddVertices(gr2, 0); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:622 # Input is: IsIdenticalObj(gr2, gr3); # Expected output: false # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/oper.tst:624 # Input is: gr2 = gr3; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/oper.tst:626 # Input is: gr3 := DigraphAddVertices(gr2, []); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:628 # Input is: IsIdenticalObj(gr2, gr3); # Expected output: false # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/oper.tst:630 # Input is: gr2 = gr3; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/oper.tst:634 # Input is: D := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:636 # Input is: DigraphVertexLabels(D); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:638 # Input is: DigraphAddVertices(D, 2, [fail]); # Expected output: Error, the list (3rd argument) must have length (2nd argument), # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:640 # Input is: D := DigraphAddVertices(D, 2, [fail, true]); # Expected output: # But found: Error, Variable: 'DigraphAddVertices' must have a value ######## ########> Diff in standard/oper.tst:642 # Input is: DigraphVertexLabels(D); # Expected output: [ 1, fail, true ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:646 # Input is: gr := CompleteDigraph(1); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:648 # Input is: DigraphVertices(gr); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphVertices' must have a value ######## ########> Diff in standard/oper.tst:650 # Input is: gr2 := DigraphAddVertex(gr); # Expected output: # But found: Error, Variable: 'DigraphAddVertex' must have a value ######## ########> Diff in standard/oper.tst:652 # Input is: DigraphVertices(gr2); # Expected output: [ 1, 2 ] # But found: Error, Variable: 'DigraphVertices' must have a value ######## ########> Diff in standard/oper.tst:654 # Input is: DigraphEdges(gr) = DigraphEdges(gr2); # Expected output: true # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:656 # Input is: gr := DigraphAddEdge(gr, [1, 1]); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:658 # Input is: DigraphVertices(gr); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphVertices' must have a value ######## ########> Diff in standard/oper.tst:660 # Input is: gr2 := DigraphAddVertex(gr); # Expected output: # But found: Error, Variable: 'DigraphAddVertex' must have a value ######## ########> Diff in standard/oper.tst:662 # Input is: DigraphVertices(gr2); # Expected output: [ 1, 2 ] # But found: Error, Variable: 'DigraphVertices' must have a value ######## ########> Diff in standard/oper.tst:664 # Input is: DigraphEdges(gr) = DigraphEdges(gr2); # Expected output: true # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:666 # Input is: gr2 := DigraphAddVertex(gr, SymmetricGroup(2)); # Expected output: # But found: Error, Variable: 'DigraphAddVertex' must have a value ######## ########> Diff in standard/oper.tst:668 # Input is: DigraphVertices(gr2); # Expected output: [ 1, 2 ] # But found: Error, Variable: 'DigraphVertices' must have a value ######## ########> Diff in standard/oper.tst:670 # Input is: DigraphEdges(gr) = DigraphEdges(gr2); # Expected output: true # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:672 # Input is: DigraphVertexLabels(gr); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:674 # Input is: DigraphVertexLabels(gr2); # Expected output: [ 1, Sym( [ 1 .. 2 ] ) ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:678 # Input is: gr := DigraphFromDigraph6String("&MU?GAa?SDCFStK`???d?@LWOq[{DECO?U?"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:680 # Input is: DigraphRemoveVertex(gr, "a"); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphRemoveVertex' on 2 arguments # But found: Error, Variable: 'DigraphRemoveVertex' must have a value ######## ########> Diff in standard/oper.tst:683 # Input is: DigraphRemoveVertex(gr, 0); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphRemoveVertex' on 2 arguments # But found: Error, Variable: 'DigraphRemoveVertex' must have a value ######## ########> Diff in standard/oper.tst:686 # Input is: DigraphRemoveVertex(gr, 15); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertex' must have a value ######## ########> Diff in standard/oper.tst:688 # Input is: gr2 := DigraphRemoveVertex(gr, 10);; # Expected output: # But found: Error, Variable: 'DigraphRemoveVertex' must have a value ######## ########> Diff in standard/oper.tst:689 # Input is: DigraphNrVertices(gr2); # Expected output: 13 # But found: Error, Variable: 'DigraphNrVertices' must have a value ######## ########> Diff in standard/oper.tst:691 # Input is: DigraphNrEdges(gr2) = DigraphNrEdges(gr) - OutDegreeOfVertex(gr, 10) - InDegreeOfVertex(gr, 10); # Expected output: true # But found: Error, Variable: 'DigraphNrEdges' must have a value ######## ########> Diff in standard/oper.tst:694 # Input is: D := CycleDigraph(IsMutableDigraph, 5); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:696 # Input is: DigraphRemoveVertex(D, 1); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertex' must have a value ######## ########> Diff in standard/oper.tst:698 # Input is: DigraphVertexLabels(D); # Expected output: [ 2, 3, 4, 5 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:702 # Input is: gr := CompleteDigraph(4); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:704 # Input is: gr2 := DigraphRemoveVertices(gr, []); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:706 # Input is: gr = gr2; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:708 # Input is: gr2 := DigraphRemoveVertices(gr, [0]); # Expected output: Error, the 2nd argument must be a duplicate-free list of positive integ\ \ ers, # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:711 # Input is: gr2 := DigraphRemoveVertices(gr, [1, "a"]); # Expected output: Error, the 2nd argument must be a duplicate-free list of positive integ\ \ ers, # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:714 # Input is: gr2 := DigraphRemoveVertices(gr, [1, 1]); # Expected output: Error, the 2nd argument must be a duplicate-free list of positive integ\ \ ers, # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:717 # Input is: gr2 := DigraphRemoveVertices(gr, [1, 0]); # Expected output: Error, the 2nd argument must be a duplicate-free list of positive integ\ \ ers, # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:720 # Input is: gr2 := DigraphRemoveVertices(gr, [1, 5]); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:722 # Input is: gr2 := DigraphRemoveVertices(gr, [1, 3]); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:724 # Input is: IsCompleteDigraph(gr2); # Expected output: true # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:726 # Input is: DigraphVertexLabels(gr2); # Expected output: [ 2, 4 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:728 # Input is: gr3 := DigraphRemoveVertices(gr, [1 .. 4]); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:730 # Input is: gr := Digraph(rec(DigraphNrVertices := 4, DigraphSource := [1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4], DigraphRange := [1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:734 # Input is: IsCompleteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:736 # Input is: SetDigraphVertexLabels(gr, [(), (1, 2), (1, 2, 3), (1, 2, 3, 4)]); # Expected output: # But found: Error, Variable: 'SetDigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:737 # Input is: gr2 := DigraphRemoveVertices(gr, [1 .. 4]); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:739 # Input is: gr3 := DigraphRemoveVertices(gr, [2, 3]); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:741 # Input is: DigraphVertexLabels(gr3); # Expected output: [ (), (1,2,3,4) ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:743 # Input is: gr4 := DigraphRemoveVertices(gr, []); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:745 # Input is: gr = gr4; # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:747 # Input is: gr := Digraph([[1, 10], [], [], [3], [3, 4, 10], [1, 3, 8], [9], [9], [3], [3, 5, 10]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:750 # Input is: DigraphSinks(gr); # Expected output: [ 2, 3 ] # But found: Error, Variable: 'DigraphSinks' must have a value ######## ########> Diff in standard/oper.tst:752 # Input is: DigraphRemoveVertices(gr, DigraphSinks(gr)); # Expected output: # But found: Error, Variable: 'DigraphRemoveVertices' must have a value ######## ########> Diff in standard/oper.tst:756 # Input is: gr := Digraph([[1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:758 # Input is: DigraphReverseEdges(gr, [[2, 2]]); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphReverseEdges' must have a value ######## ########> Diff in standard/oper.tst:760 # Input is: DigraphReverseEdges(gr, [2]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphReverseEdge' on 2 arguments # But found: Error, Variable: 'DigraphReverseEdges' must have a value ######## ########> Diff in standard/oper.tst:763 # Input is: gr := CompleteDigraph(100); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:765 # Input is: DigraphReverseEdges(gr, "a"); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphReverseEdge' on 2 arguments # But found: Error, Variable: 'DigraphReverseEdges' must have a value ######## ########> Diff in standard/oper.tst:768 # Input is: DigraphReverseEdges(gr, Group(())); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphReverseEdges' on 2 arguments # But found: Error, Variable: 'DigraphReverseEdges' must have a value ######## ########> Diff in standard/oper.tst:771 # Input is: DigraphReverseEdges(gr, [0, 0]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphReverseEdge' on 2 arguments # But found: Error, Variable: 'DigraphReverseEdges' must have a value ######## ########> Diff in standard/oper.tst:774 # Input is: DigraphReverseEdges(gr, [[0]]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphReverseEdges' must have a value ######## ########> Diff in standard/oper.tst:776 # Input is: DigraphReverseEdges(gr, [[1], [1]]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphReverseEdges' must have a value ######## ########> Diff in standard/oper.tst:778 # Input is: edges := ShallowCopy(DigraphEdges(gr));; # Expected output: # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:779 # Input is: gr = DigraphReverseEdges(gr, edges); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:781 # Input is: gr = DigraphReverseEdges(gr, [1 .. DigraphNrEdges(gr)]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphReverseEdge' on 2 arguments # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:784 # Input is: DigraphReverseEdge(gr, 2) = DigraphReverseEdge(gr, [1, 3]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphReverseEdge' on 2 arguments # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/oper.tst:787 # Input is: gr = DigraphReverseEdges(gr, []); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:789 # Input is: gr := CycleDigraph(100); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:791 # Input is: edges := ShallowCopy(DigraphEdges(gr));; # Expected output: # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:792 # Input is: gr = DigraphReverseEdges(gr, edges); # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:794 # Input is: gr2 := DigraphReverseEdges(gr, edges); # Expected output: # But found: Error, Variable: 'DigraphReverseEdges' must have a value ######## ########> Diff in standard/oper.tst:796 # Input is: gr = gr2; # Expected output: false # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:798 # Input is: edges2 := ShallowCopy(DigraphEdges(gr2));; # Expected output: # But found: Error, Variable: 'DigraphEdges' must have a value ######## ########> Diff in standard/oper.tst:799 # Input is: gr = DigraphReverseEdges(gr2, edges2); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:801 # Input is: gr = DigraphReverseEdges(gr, [1 .. DigraphNrEdges(gr)]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphReverseEdge' on 2 arguments # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:804 # Input is: DigraphReverseEdge(gr, 1) = DigraphReverseEdge(gr, [1, 2]); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `DigraphReverseEdge' on 2 arguments # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/oper.tst:807 # Input is: gr = DigraphReverseEdges(gr, []); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:817 # Input is: gr := Digraph( [[1, 2, 4, 5, 7], [1, 2], [3, 7], [2, 10], [2, 6], [2, 7], [], [3, 4], [1, 10], [1, 3, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:821 # Input is: rtclosure := DigraphFloydWarshall(gr, func, 0, 1);; # Expected output: # But found: Error, Variable: 'DigraphFloydWarshall' must have a value ######## ########> Diff in standard/oper.tst:822 # Input is: grrt := DigraphByAdjacencyMatrix(rtclosure); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:824 # Input is: grrt = DigraphReflexiveTransitiveClosure(gr); # Expected output: true # But found: Error, Variable: 'grrt' must have a value ######## ########> Diff in standard/oper.tst:832 # Input is: gr := Digraph(rec( DigraphNrVertices := 10, DigraphSource := [1, 2, 2, 3, 4, 5, 6, 7, 10, 10, 10], DigraphRange := [6, 9, 5, 7, 3, 4, 8, 4, 7, 9, 8])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:837 # Input is: tclosure := DigraphFloydWarshall(gr, func, 0, 1);; # Expected output: # But found: Error, Variable: 'DigraphFloydWarshall' must have a value ######## ########> Diff in standard/oper.tst:838 # Input is: grt := DigraphByAdjacencyMatrix(tclosure); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:840 # Input is: grt = DigraphTransitiveClosure(gr); # Expected output: true # But found: Error, Variable: 'grt' must have a value ######## ########> Diff in standard/oper.tst:848 # Input is: gr := Digraph( [[1, 2, 4, 5, 7], [1, 2], [3, 7], [2, 10], [2, 6], [2, 7], [], [3, 4], [1, 10], [1, 3, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:852 # Input is: rtclosure := DigraphFloydWarshall(gr, func, 0, 1);; # Expected output: # But found: Error, Variable: 'DigraphFloydWarshall' must have a value ######## ########> Diff in standard/oper.tst:853 # Input is: grrt := DigraphByAdjacencyMatrix(rtclosure); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:855 # Input is: grrt = DigraphReflexiveTransitiveClosure(gr); # Expected output: true # But found: Error, Variable: 'grrt' must have a value ######## ########> Diff in standard/oper.tst:863 # Input is: gr := DigraphFromDigraph6String("&I???@?A`?G?GCCS@??"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:865 # Input is: tclosure := DigraphFloydWarshall(gr, func, 0, 1);; # Expected output: # But found: Error, Variable: 'DigraphFloydWarshall' must have a value ######## ########> Diff in standard/oper.tst:866 # Input is: grt := DigraphByAdjacencyMatrix(tclosure); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:868 # Input is: grt = DigraphTransitiveClosure(gr); # Expected output: true # But found: Error, Variable: 'grt' must have a value ######## ########> Diff in standard/oper.tst:872 # Input is: gr := CycleDigraph(1000); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:874 # Input is: gr2 := CompleteDigraph(100); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:876 # Input is: DigraphDisjointUnion(gr) = gr; # Expected output: true # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:878 # Input is: DigraphDisjointUnion([[]]); # Expected output: Error, the arguments must be digraphs by out-neighbours, or a single non-empty\ \ list of digraphs by out-neighbours, # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:881 # Input is: DigraphDisjointUnion([gr], [gr]); # Expected output: Error, the arguments must be digraphs by out-neighbours, or a single non-empty\ \ list of digraphs by out-neighbours, # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:884 # Input is: DigraphDisjointUnion(gr, Group(())); # Expected output: Error, the arguments must be digraphs by out-neighbours, or a single non-empty\ \ list of digraphs by out-neighbours, # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:887 # Input is: DigraphDisjointUnion(gr, gr); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:889 # Input is: DigraphDisjointUnion([gr2, gr2]); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:891 # Input is: DigraphDisjointUnion(gr, gr2); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:893 # Input is: gr := CycleDigraph(1000);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:894 # Input is: DigraphDisjointUnion(gr2, gr); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:896 # Input is: gr1 := Digraph([[2, 2, 3], [3], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:898 # Input is: gr2 := Digraph([[1, 2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:900 # Input is: gr3 := Digraph(rec(DigraphNrVertices := 2, DigraphSource := [1, 1, 2], DigraphRange := [2, 1, 1]));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:902 # Input is: gr2 = gr3; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/oper.tst:904 # Input is: u1 := DigraphDisjointUnion(gr1, gr2); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:906 # Input is: u2 := DigraphDisjointUnion(gr1, gr3); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:908 # Input is: u1 = u2; # Expected output: true # But found: Error, Variable: 'u1' must have a value ######## ########> Diff in standard/oper.tst:911 # Input is: DigraphDisjointUnion(List([1 .. n], x -> EmptyDigraph(x))) = EmptyDigraph(Int(n * (n + 1) / 2)); # Expected output: true # But found: Error, Variable: 'DigraphDisjointUnion' must have a value Syntax warning: Unbound global variable in stream:1 DigraphDisjointUnion(List([1 .. n], x -> EmptyDigraph(x))) = ^^^^^^^^^^^^ ######## ########> Diff in standard/oper.tst:914 # Input is: gr := DigraphDisjointUnion(List([2 .. 5], x -> ChainDigraph(x))); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value Syntax warning: Unbound global variable in stream:1 gr := DigraphDisjointUnion(List([2 .. 5], x -> ChainDigraph(x))); ^^^^^^^^^^^^ ######## ########> Diff in standard/oper.tst:916 # Input is: gr := DigraphAddEdges(gr, [[2, 3], [5, 6], [9, 10]]); # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/oper.tst:918 # Input is: gr = ChainDigraph(14); # Expected output: true # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/oper.tst:920 # Input is: D := CycleDigraph(IsMutableDigraph, 2); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:922 # Input is: DigraphVertexLabels(D); # Expected output: [ 1, 2 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:924 # Input is: DigraphDisjointUnion(D, D); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:926 # Input is: DigraphVertexLabels(D); # Expected output: [ 1 .. 4 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:930 # Input is: gr1 := DigraphFromDigraph6String("&I????@A_?AA???@d??"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:932 # Input is: gr2 := DigraphFromDiSparse6String(".H`OS?aEMC?bneOY`l_?QCJ"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/oper.tst:934 # Input is: DigraphEdgeUnion(gr1) = gr1; # Expected output: true # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:936 # Input is: DigraphEdgeUnion([[]]); # Expected output: Error, the arguments must be digraphs by out-neighbours, or a single list of d\ \ igraphs by out-neighbours, # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:939 # Input is: DigraphEdgeUnion([gr1], [gr1]); # Expected output: Error, the arguments must be digraphs by out-neighbours, or a single list of d\ \ igraphs by out-neighbours, # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:942 # Input is: DigraphEdgeUnion(gr1, Group(())); # Expected output: Error, the arguments must be digraphs by out-neighbours, or a single list of d\ \ igraphs by out-neighbours, # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:945 # Input is: m1 := DigraphEdgeUnion(gr1, gr2); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:947 # Input is: m2 := DigraphEdgeUnion(gr2, gr1); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:949 # Input is: gr1 := Digraph([[2], [], [4], [], [6], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:951 # Input is: gr2 := Digraph([[], [3], [], [5], [], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:953 # Input is: m := DigraphEdgeUnion(gr1, gr2); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:955 # Input is: m = CycleDigraph(6); # Expected output: true # But found: Error, Variable: 'm' must have a value ######## ########> Diff in standard/oper.tst:957 # Input is: m = DigraphEdgeUnion(gr2, gr1); # Expected output: true # But found: Error, Variable: 'm' must have a value ######## ########> Diff in standard/oper.tst:959 # Input is: DigraphEdgeUnion(EmptyDigraph(0), EmptyDigraph(0)) = EmptyDigraph(0); # Expected output: true # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:961 # Input is: DigraphEdgeUnion(EmptyDigraph(5), EmptyDigraph(3)) = EmptyDigraph(5); # Expected output: true # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:963 # Input is: gr := DigraphNC([[6, 3, 3, 10, 6], [4], [5, 1], [5, 4, 6], [9], [8], [7, 6], [8, 10, 8, 1], [], [2]]);; # Expected output: # But found: Error, Variable: 'DigraphNC' must have a value ######## ########> Diff in standard/oper.tst:965 # Input is: gr := DigraphEdgeUnion(gr, gr); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:967 # Input is: OutNeighbours(gr); # Expected output: [ [ 6, 3, 3, 10, 6, 6, 3, 3, 10, 6 ], [ 4, 4 ], [ 5, 1, 5, 1 ], [ 5, 4, 6, 5, 4, 6 ], [ 9, 9 ], [ 8, 8 ], [ 7, 6, 7, 6 ], [ 8, 10, 8, 1, 8, 10, 8, 1 ], [ ], [ 2, 2 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:971 # Input is: gr := DigraphEdgeUnion(ChainDigraph(2), ChainDigraph(3), ChainDigraph(4)); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:973 # Input is: OutNeighbours(gr); # Expected output: [ [ 2, 2, 2 ], [ 3, 3 ], [ 4 ], [ ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:977 # Input is: gr := CompleteDigraph(20); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:979 # Input is: gr2 := EmptyDigraph(10); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/oper.tst:981 # Input is: DigraphJoin(gr) = gr; # Expected output: true # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:983 # Input is: DigraphJoin([[]]); # Expected output: Error, the arguments must be digraphs by out-neighbours, or a single list of d\ \ igraphs by out-neighbours, # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:986 # Input is: DigraphJoin([gr], [gr]); # Expected output: Error, the arguments must be digraphs by out-neighbours, or a single list of d\ \ igraphs by out-neighbours, # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:989 # Input is: DigraphJoin([gr, Group(())]); # Expected output: Error, the arguments must be digraphs by out-neighbours, or a single list of d\ \ igraphs by out-neighbours, # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:992 # Input is: DigraphJoin(gr, gr2); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:994 # Input is: DigraphJoin(gr, EmptyDigraph(0)); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:996 # Input is: DigraphJoin(EmptyDigraph(0), CycleDigraph(1000)); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:998 # Input is: DigraphJoin(EmptyDigraph(0), EmptyDigraph(0)); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1000 # Input is: DigraphJoin(EmptyDigraph(5), EmptyDigraph(5)); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1002 # Input is: gr1 := Digraph([[2, 2, 3], [3], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1004 # Input is: gr2 := Digraph([[1, 2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1006 # Input is: gr3 := Digraph(rec(DigraphNrVertices := 2, DigraphSource := [1, 1, 2], DigraphRange := [2, 1, 1]));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1008 # Input is: gr2 = gr3; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/oper.tst:1010 # Input is: j1 := DigraphJoin(gr1, gr2); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1012 # Input is: j2 := DigraphJoin(gr1, gr3); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1014 # Input is: u1 = u2; # Expected output: true # But found: Error, Variable: 'u1' must have a value ######## ########> Diff in standard/oper.tst:1016 # Input is: gr := DigraphJoin(ChainDigraph(2), CycleDigraph(4), EmptyDigraph(0)); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1025 # Input is: AdjacencyMatrix(gr) = mat; # Expected output: true # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:1027 # Input is: DigraphJoin(List([1 .. 5], x -> EmptyDigraph(1))) = CompleteDigraph(5); # Expected output: true # But found: Error, Variable: 'DigraphJoin' must have a value Syntax warning: Unbound global variable in stream:1 DigraphJoin(List([1 .. 5], x -> EmptyDigraph(1))) = CompleteDigraph(5); ^^^^^^^^^^^^ ######## ########> Diff in standard/oper.tst:1029 # Input is: DigraphJoin(EmptyDigraph(3), EmptyDigraph(2)) = CompleteBipartiteDigraph(3, 2); # Expected output: true # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1034 # Input is: gr := Digraph([[3], [10], [6], [3], [10], [], [6], [3], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1036 # Input is: out1 := OutNeighbours(gr); # Expected output: [ [ 3 ], [ 10 ], [ 6 ], [ 3 ], [ 10 ], [ ], [ 6 ], [ 3 ], [ ], [ 3 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:1038 # Input is: IsMutable(out1); # Expected output: false # But found: Error, Variable: 'out1' must have a value ######## ########> Diff in standard/oper.tst:1040 # Input is: IsMutable(out1[1]); # Expected output: false # But found: Error, Variable: 'out1' must have a value ######## ########> Diff in standard/oper.tst:1042 # Input is: out2 := OutNeighboursMutableCopy(gr); # Expected output: [ [ 3 ], [ 10 ], [ 6 ], [ 3 ], [ 10 ], [ ], [ 6 ], [ 3 ], [ ], [ 3 ] ] # But found: Error, Variable: 'OutNeighboursMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1044 # Input is: IsMutable(out2); # Expected output: true # But found: Error, Variable: 'out2' must have a value ######## ########> Diff in standard/oper.tst:1046 # Input is: IsMutable(out2[1]); # Expected output: true # But found: Error, Variable: 'out2' must have a value ######## ########> Diff in standard/oper.tst:1048 # Input is: out3 := OutNeighborsMutableCopy(gr); # Expected output: [ [ 3 ], [ 10 ], [ 6 ], [ 3 ], [ 10 ], [ ], [ 6 ], [ 3 ], [ ], [ 3 ] ] # But found: Error, Variable: 'OutNeighborsMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1050 # Input is: IsMutable(out3); # Expected output: true # But found: Error, Variable: 'out3' must have a value ######## ########> Diff in standard/oper.tst:1052 # Input is: IsMutable(out3[1]); # Expected output: true # But found: Error, Variable: 'out3' must have a value ######## ########> Diff in standard/oper.tst:1056 # Input is: gr := Digraph([[3], [10], [6], [3], [10], [], [6], [3], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1058 # Input is: in1 := InNeighbours(gr); # Expected output: [ [ ], [ ], [ 1, 4, 8, 10 ], [ ], [ ], [ 3, 7 ], [ ], [ ], [ ], [ 2, 5 ] ] # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in standard/oper.tst:1061 # Input is: IsMutable(in1); # Expected output: false # But found: Error, Variable: 'in1' must have a value ######## ########> Diff in standard/oper.tst:1063 # Input is: IsMutable(in1[1]); # Expected output: false # But found: Error, Variable: 'in1' must have a value ######## ########> Diff in standard/oper.tst:1065 # Input is: in2 := InNeighboursMutableCopy(gr); # Expected output: [ [ ], [ ], [ 1, 4, 8, 10 ], [ ], [ ], [ 3, 7 ], [ ], [ ], [ ], [ 2, 5 ] ] # But found: Error, Variable: 'InNeighboursMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1068 # Input is: IsMutable(in2); # Expected output: true # But found: Error, Variable: 'in2' must have a value ######## ########> Diff in standard/oper.tst:1070 # Input is: IsMutable(in2[1]); # Expected output: true # But found: Error, Variable: 'in2' must have a value ######## ########> Diff in standard/oper.tst:1072 # Input is: in3 := InNeighborsMutableCopy(gr); # Expected output: [ [ ], [ ], [ 1, 4, 8, 10 ], [ ], [ ], [ 3, 7 ], [ ], [ ], [ ], [ 2, 5 ] ] # But found: Error, Variable: 'InNeighborsMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1075 # Input is: IsMutable(in3); # Expected output: true # But found: Error, Variable: 'in3' must have a value ######## ########> Diff in standard/oper.tst:1077 # Input is: IsMutable(in3[1]); # Expected output: true # But found: Error, Variable: 'in3' must have a value ######## ########> Diff in standard/oper.tst:1081 # Input is: gr := CycleDigraph(3);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:1082 # Input is: adj := AdjacencyMatrixMutableCopy(gr);; # Expected output: # But found: Error, Variable: 'AdjacencyMatrixMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1083 # Input is: PrintArray(adj); # Expected output: [ [ 0, 1, 0 ], [ 0, 0, 1 ], [ 1, 0, 0 ] ] # But found: Error, must be a dense list ######## ########> Diff in standard/oper.tst:1087 # Input is: adj[3][2] := 1;; # Expected output: # But found: Error, List Element: must be a list (not a function) ######## ########> Diff in standard/oper.tst:1088 # Input is: PrintArray(adj); # Expected output: [ [ 0, 1, 0 ], [ 0, 0, 1 ], [ 1, 1, 0 ] ] # But found: Error, must be a dense list ######## ########> Diff in standard/oper.tst:1094 # Input is: gr := Digraph([[3], [2, 3], [3], [2, 4]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1095 # Input is: adj := BooleanAdjacencyMatrixMutableCopy(gr);; # Expected output: # But found: Error, Variable: 'BooleanAdjacencyMatrixMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1096 # Input is: PrintArray(adj); # Expected output: [ [ false, false, true, false ], [ false, true, true, false ], [ false, false, true, false ], [ false, true, false, true ] ] # But found: Error, must be a dense list ######## ########> Diff in standard/oper.tst:1101 # Input is: adj[3][1] := true;; # Expected output: # But found: Error, List Element: must be a list (not a function) ######## ########> Diff in standard/oper.tst:1102 # Input is: PrintArray(adj); # Expected output: [ [ false, false, true, false ], [ false, true, true, false ], [ true, false, true, false ], [ false, true, false, true ] ] # But found: Error, must be a dense list ######## ########> Diff in standard/oper.tst:1109 # Input is: gr1 := Digraph([[1, 1, 2, 1], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1111 # Input is: gr2 := DigraphRemoveAllMultipleEdges(gr1); # Expected output: # But found: Error, Variable: 'DigraphRemoveAllMultipleEdges' must have a value ######## ########> Diff in standard/oper.tst:1113 # Input is: OutNeighbours(gr2); # Expected output: [ [ 1, 2 ], [ 1 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:1115 # Input is: gr3 := DigraphEdgeUnion(gr1, gr1); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:1117 # Input is: gr4 := DigraphRemoveAllMultipleEdges(gr3); # Expected output: # But found: Error, Variable: 'DigraphRemoveAllMultipleEdges' must have a value ######## ########> Diff in standard/oper.tst:1119 # Input is: gr2 = gr4; # Expected output: true # But found: Error, Variable: 'gr2' must have a value ######## ########> Diff in standard/oper.tst:1123 # Input is: gr1 := DigraphRemoveEdges(CycleDigraph(100), [[100, 1], [99, 100]]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/oper.tst:1125 # Input is: IsReachable(gr1, 0, 1); # Expected output: Error, no method found! For debugging hints type ?Recovery from NoMethodFound Error, no 1st choice method found for `IsReachable' on 3 arguments # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1128 # Input is: IsReachable(gr1, 101, 1); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1131 # Input is: IsReachable(gr1, 1, 101); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1134 # Input is: IsReachable(gr1, 1, 2); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1136 # Input is: gr1 := DigraphRemoveEdges(CycleDigraph(100), [[100, 1], [99, 100]]);; # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/oper.tst:1137 # Input is: AdjacencyMatrix(gr1);; # Expected output: # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:1138 # Input is: IsReachable(gr1, 1, 2); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1140 # Input is: gr1 := DigraphRemoveEdges(CycleDigraph(100), [[100, 1], [99, 100]]);; # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/oper.tst:1141 # Input is: IsReachable(gr1, 100, 1); # Expected output: false # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1143 # Input is: gr1 := DigraphRemoveEdges(CycleDigraph(100), [[100, 1], [99, 100]]);; # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/oper.tst:1144 # Input is: DigraphConnectedComponents(gr1);; # Expected output: # But found: Error, Variable: 'DigraphConnectedComponents' must have a value ######## ########> Diff in standard/oper.tst:1145 # Input is: IsReachable(gr1, 100, 1); # Expected output: false # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1147 # Input is: gr1 := CycleDigraph(100); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:1149 # Input is: IsReachable(gr1, 1, 50); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1151 # Input is: IsReachable(gr1, 1, 1); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1153 # Input is: gr1 := CycleDigraph(100);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:1154 # Input is: DigraphStronglyConnectedComponents(gr1);; # Expected output: # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/oper.tst:1155 # Input is: IsReachable(gr1, 1, 50); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1157 # Input is: IsReachable(gr1, 1, 1); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1159 # Input is: gr1 := Digraph([[2], [1], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1161 # Input is: IsReachable(gr1, 1, 2); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1163 # Input is: IsReachable(gr1, 1, 1); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1165 # Input is: IsReachable(gr1, 3, 3); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1167 # Input is: IsReachable(gr1, 1, 3); # Expected output: false # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1169 # Input is: IsReachable(gr1, 4, 4); # Expected output: false # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1171 # Input is: gr1 := Digraph([[2], [1], [3], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1172 # Input is: DigraphStronglyConnectedComponents(gr1); # Expected output: rec( comps := [ [ 1, 2 ], [ 3 ], [ 4 ] ], id := [ 1, 1, 2, 3 ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/oper.tst:1174 # Input is: IsReachable(gr1, 1, 2); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1176 # Input is: IsReachable(gr1, 1, 1); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1178 # Input is: IsReachable(gr1, 3, 3); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1180 # Input is: IsReachable(gr1, 1, 3); # Expected output: false # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1182 # Input is: IsReachable(gr1, 4, 4); # Expected output: false # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1184 # Input is: gr := DigraphFromSparse6String(":DA_IAMALN"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/oper.tst:1186 # Input is: IsReachable(gr, 1, 2); # Expected output: false # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1188 # Input is: IsReachable(gr, 1, 4); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1190 # Input is: gr := Digraph( [[1, 3, 4, 5], [], [1, 3, 4, 5], [1, 3, 4, 5], [1, 3, 4, 5]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1192 # Input is: IsTransitiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/oper.tst:1194 # Input is: IsReachable(gr, 1, 2); # Expected output: false # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1196 # Input is: IsReachable(gr, 1, 4); # Expected output: true # But found: Error, Variable: 'IsReachable' must have a value ######## ########> Diff in standard/oper.tst:1200 # Input is: gr := ChainDigraph(10); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/oper.tst:1202 # Input is: DigraphPath(gr, 1, 2); # Expected output: [ [ 1, 2 ], [ 1 ] ] # But found: Error, Variable: 'DigraphPath' must have a value ######## ########> Diff in standard/oper.tst:1204 # Input is: DigraphPath(gr, 1, 1); # Expected output: fail # But found: Error, Variable: 'DigraphPath' must have a value ######## ########> Diff in standard/oper.tst:1206 # Input is: DigraphPath(gr, 2, 1); # Expected output: fail # But found: Error, Variable: 'DigraphPath' must have a value ######## ########> Diff in standard/oper.tst:1208 # Input is: DigraphPath(gr, 3, 8); # Expected output: [ [ 3, 4, 5, 6, 7, 8 ], [ 1, 1, 1, 1, 1 ] ] # But found: Error, Variable: 'DigraphPath' must have a value ######## ########> Diff in standard/oper.tst:1210 # Input is: DigraphPath(gr, 11, 1); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'DigraphPath' must have a value ######## ########> Diff in standard/oper.tst:1213 # Input is: DigraphPath(gr, 1, 11); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'DigraphPath' must have a value ######## ########> Diff in standard/oper.tst:1216 # Input is: DigraphPath(gr, 11, 11); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'DigraphPath' must have a value ######## ########> Diff in standard/oper.tst:1221 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1222 # Input is: iter := IteratorOfPaths(gr, 2, 6); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1225 # Input is: iter := IteratorOfPaths(gr, 6, 6); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1228 # Input is: iter := IteratorOfPaths(gr, 6, 2); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1231 # Input is: iter := IteratorOfPaths(gr, 2, 5); # Expected output: # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1233 # Input is: for a in iter do Print(a, "\n"); od; # Expected output: [ [ 2, 1, 3, 4, 5 ], [ 1, 2, 3, 4 ] ] [ [ 2, 1, 3, 5 ], [ 1, 2, 4 ] ] [ [ 2, 1, 4, 3, 5 ], [ 1, 3, 3, 4 ] ] [ [ 2, 1, 4, 5 ], [ 1, 3, 4 ] ] [ [ 2, 1, 5 ], [ 1, 4 ] ] [ [ 2, 3, 1, 4, 5 ], [ 2, 1, 3, 4 ] ] [ [ 2, 3, 1, 5 ], [ 2, 1, 4 ] ] [ [ 2, 3, 4, 1, 5 ], [ 2, 3, 1, 4 ] ] [ [ 2, 3, 4, 5 ], [ 2, 3, 4 ] ] [ [ 2, 3, 5 ], [ 2, 4 ] ] [ [ 2, 4, 1, 3, 5 ], [ 3, 1, 2, 4 ] ] [ [ 2, 4, 1, 5 ], [ 3, 1, 4 ] ] [ [ 2, 4, 3, 1, 5 ], [ 3, 3, 1, 4 ] ] [ [ 2, 4, 3, 5 ], [ 3, 3, 4 ] ] [ [ 2, 4, 5 ], [ 3, 4 ] ] [ [ 2, 5 ], [ 4 ] ] # But found: Error, Variable: 'iter' must have an assigned value ######## ########> Diff in standard/oper.tst:1252 # Input is: iter := IteratorOfPaths(gr, 2, 5);; # Expected output: # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1253 # Input is: for a in iter do if not ForAll([1 .. Length(a[1]) - 1], x -> OutNeighboursOfVertex(gr, a[1][x])[a[2][x]] = a[1][x + 1]) then Print("fail\n"); fi; od; # Expected output: # But found: Syntax warning: Unbound global variable in stream:3 OutNeighboursOfVertex(gr, a[1][x])[a[2][x]] = a[1][x + 1]) then ^^^^^^^^^^^^^^^^^^^^^ Syntax warning: Unbound global variable in stream:3 OutNeighboursOfVertex(gr, a[1][x])[a[2][x]] = a[1][x + 1]) then ^^ Error, Variable: 'iter' must have an assigned value ######## ########> Diff in standard/oper.tst:1259 # Input is: iter := IteratorOfPaths(gr, 4, 3); # Expected output: # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1261 # Input is: NextIterator(iter); # Expected output: [ [ 4, 1, 2, 3 ], [ 1, 1, 2 ] ] # But found: Error, Variable: 'iter' must have a value ######## ########> Diff in standard/oper.tst:1263 # Input is: NextIterator(iter); # Expected output: [ [ 4, 1, 2, 5, 3 ], [ 1, 1, 4, 3 ] ] # But found: Error, Variable: 'iter' must have a value ######## ########> Diff in standard/oper.tst:1265 # Input is: copy := ShallowCopy(iter); # Expected output: # But found: Error, Variable: 'iter' must have a value ######## ########> Diff in standard/oper.tst:1267 # Input is: NextIterator(copy); # Expected output: [ [ 4, 1, 3 ], [ 1, 2 ] ] # But found: Error, Variable: 'copy' must have a value ######## ########> Diff in standard/oper.tst:1269 # Input is: NextIterator(iter); # Expected output: [ [ 4, 1, 3 ], [ 1, 2 ] ] # But found: Error, Variable: 'iter' must have a value ######## ########> Diff in standard/oper.tst:1272 # Input is: IteratorOfPaths(gr, 1, 1);; # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the digraph d\ \ efined by the 1st argument , # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1276 # Input is: IteratorOfPaths(gr, 1, 1);; # Expected output: Error, the 1st argument must be a list of out-neighbours of a digraph, # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1279 # Input is: IteratorOfPaths(gr, 1, 1);; # Expected output: Error, the 1st argument must be a list of out-neighbours of a digraph, # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1282 # Input is: IteratorOfPaths(gr, 1, 1);; # Expected output: Error, the 1st argument must be a list of out-neighbours of a digraph, # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1285 # Input is: iter := IteratorOfPaths(gr, 1, 1); # Expected output: # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1287 # Input is: for a in iter do Print(a, "\n"); od; # Expected output: [ [ 1, 1 ], [ 1 ] ] # But found: Error, Variable: 'iter' must have an assigned value ######## ########> Diff in standard/oper.tst:1291 # Input is: gr := DigraphFromDigraph6String("+E?_OHCO"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:1293 # Input is: iter := IteratorOfPaths(gr, 1, 5); # Expected output: # But found: Error, Variable: 'IteratorOfPaths' must have a value ######## ########> Diff in standard/oper.tst:1295 # Input is: NextIterator(iter); # Expected output: [ [ 1, 2, 3, 4, 5 ], [ 1, 1, 1, 1 ] ] # But found: Error, Variable: 'iter' must have a value ######## ########> Diff in standard/oper.tst:1297 # Input is: NextIterator(iter); # Expected output: [ [ 1, 2, 6, 4, 5 ], [ 1, 2, 1, 1 ] ] # But found: Error, Variable: 'iter' must have a value ######## ########> Diff in standard/oper.tst:1299 # Input is: IsDoneIterator(iter); # Expected output: true # But found: Error, Variable: 'iter' must have a value ######## ########> Diff in standard/oper.tst:1305 # Input is: gr := Digraph(nbs); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1307 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/oper.tst:1309 # Input is: a := DigraphLongestDistanceFromVertex(gr, 1); # Expected output: 6 # But found: Error, Variable: 'DigraphLongestDistanceFromVertex' must have a value ######## ########> Diff in standard/oper.tst:1313 # Input is: b := DigraphLongestDistanceFromVertex(gr, 2); # Expected output: 3 # But found: Error, Variable: 'DigraphLongestDistanceFromVertex' must have a value ######## ########> Diff in standard/oper.tst:1315 # Input is: a >= b + 1; # Expected output: true # But found: Error, Variable: 'a' must have a value ######## ########> Diff in standard/oper.tst:1317 # Input is: DigraphLongestDistanceFromVertex(gr, 4); # Expected output: 0 # But found: Error, Variable: 'DigraphLongestDistanceFromVertex' must have a value ######## ########> Diff in standard/oper.tst:1319 # Input is: DigraphLongestDistanceFromVertex(gr, 15); # Expected output: infinity # But found: Error, Variable: 'DigraphLongestDistanceFromVertex' must have a value ######## ########> Diff in standard/oper.tst:1321 # Input is: DigraphLongestDistanceFromVertex(gr, 16); # Expected output: Error, the 2nd argument must be a vertex of the 1st argument , # But found: Error, Variable: 'DigraphLongestDistanceFromVertex' must have a value ######## ########> Diff in standard/oper.tst:1325 # Input is: gr := CompleteDigraph(4); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1327 # Input is: DigraphLayers(gr, 1); # Expected output: [ [ 1 ], [ 2, 3, 4 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1329 # Input is: DigraphLayers(gr, 2); # Expected output: [ [ 2 ], [ 3, 4, 1 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1331 # Input is: DigraphLayers(gr, 3); # Expected output: [ [ 3 ], [ 4, 1, 2 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1333 # Input is: DigraphLayers(gr, 4); # Expected output: [ [ 4 ], [ 1, 2, 3 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1335 # Input is: gr := ChainDigraph(5);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/oper.tst:1336 # Input is: DigraphLayers(gr, 2); # Expected output: [ [ 2 ], [ 3 ], [ 4 ], [ 5 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1338 # Input is: DigraphLayers(gr, 4); # Expected output: [ [ 4 ], [ 5 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1340 # Input is: gr := Digraph([[2, 5], [3], [4], [5], [6], [7], [8], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1341 # Input is: DigraphLayers(gr, 1); # Expected output: [ [ 1 ], [ 2, 5 ], [ 3, 6 ], [ 4, 7 ], [ 8 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1343 # Input is: DigraphLayers(gr, 3); # Expected output: [ [ 3 ], [ 4 ], [ 5 ], [ 6 ], [ 7 ], [ 8 ], [ 1 ], [ 2 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1345 # Input is: DigraphLayers(gr, 6); # Expected output: [ [ 6 ], [ 7 ], [ 8 ], [ 1 ], [ 2, 5 ], [ 3 ], [ 4 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1347 # Input is: DigraphLayers(gr, 7); # Expected output: [ [ 7 ], [ 8 ], [ 1 ], [ 2, 5 ], [ 3, 6 ], [ 4 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1349 # Input is: gr := Digraph([[2, 5], [3], [4], [5], [6], [7], [8], [1], [9, 10, 11], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1351 # Input is: DigraphLayers(gr, 1); # Expected output: [ [ 1 ], [ 2, 5 ], [ 3, 6 ], [ 4, 7 ], [ 8 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1353 # Input is: DigraphLayers(gr, 9); # Expected output: [ [ 9 ], [ 10, 11 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1355 # Input is: DigraphLayers(gr, 10); # Expected output: [ [ 10 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1357 # Input is: gr := DigraphFromDigraph6String("&GYHPQgWTIIPW");; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:1358 # Input is: DigraphGroup(gr); # Expected output: Group([ (1,2)(3,4)(5,6)(7,8), (1,3,2,4)(5,7,6,8), (1,5)(2,6)(3,8)(4,7) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/oper.tst:1360 # Input is: DigraphOrbitReps(gr); # Expected output: [ 1 ] # But found: Error, Variable: 'DigraphOrbitReps' must have a value ######## ########> Diff in standard/oper.tst:1362 # Input is: DigraphLayers(gr, 1); # Expected output: [ [ 1 ], [ 2, 3, 5 ], [ 4, 6, 7, 8 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1364 # Input is: DigraphLayers(gr, 2); # Expected output: [ [ 2 ], [ 1, 4, 6 ], [ 3, 5, 8, 7 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1366 # Input is: DigraphLayers(gr, 3); # Expected output: [ [ 3 ], [ 4, 2, 7 ], [ 1, 8, 6, 5 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1368 # Input is: DigraphLayers(gr, 4); # Expected output: [ [ 4 ], [ 3, 1, 8 ], [ 2, 7, 5, 6 ] ] # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1370 # Input is: DigraphLayers(gr, 10); # Expected output: Error, the 2nd argument must be a vertex of the 1st argument , # But found: Error, Variable: 'DigraphLayers' must have a value ######## ########> Diff in standard/oper.tst:1372 # Input is: DigraphShortestDistance(gr, [2, 5, 6], [3, 7]); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1374 # Input is: DigraphShortestDistance(gr, [2], DigraphLayers(gr, 2)[3]); # Expected output: 2 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1376 # Input is: DigraphShortestDistance(gr, [2, 3], [3, 4]); # Expected output: 0 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1378 # Input is: gr := CompleteDigraph(64); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1380 # Input is: DigraphShortestDistance(gr, [1 .. 10], [20 .. 23]); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1382 # Input is: DigraphShortestDistance(gr, [1, 13], [20 .. 23]); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1384 # Input is: DigraphShortestDistance(gr, [1, 13], [38, 41]); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1386 # Input is: gr := ChainDigraph(72); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/oper.tst:1388 # Input is: DigraphShortestDistance(gr, [1 .. 10], [20 .. 23]); # Expected output: 10 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1390 # Input is: DigraphShortestDistance(gr, [1, 13], [20 .. 23]); # Expected output: 7 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1392 # Input is: DigraphShortestDistance(gr, [1, 13], [38, 41]); # Expected output: 25 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1394 # Input is: gr := DigraphFromDigraph6String("+H^_HRR\P_FWEsio"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:1396 # Input is: DigraphShortestDistance(last, [1, 2], [7]); # Expected output: 2 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1398 # Input is: DigraphShortestDistance(gr, [1], DigraphLayers(gr, 1)[3]); # Expected output: 2 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1400 # Input is: DigraphShortestDistance(gr, [1, 2], DigraphLayers(gr, 1)[3]); # Expected output: 0 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1402 # Input is: DigraphShortestDistance(gr, [1, 3], DigraphLayers(gr, 1)[3]); # Expected output: 0 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1404 # Input is: DigraphShortestDistance(gr, [1, 6], DigraphLayers(gr, 1)[3]); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1408 # Input is: gr := DigraphFromSparse6String( ":]n?AL`CB_EDbFE`IGaGHdJIeKGcLK_@MhDCiFLaBJmHFmKJ"); # Expected output: # But found: Error, Variable: 'DigraphFromSparse6String' must have a value ######## ########> Diff in standard/oper.tst:1411 # Input is: G1 := DigraphGroup(gr);; # Expected output: # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/oper.tst:1412 # Input is: IsPermGroup(G1) and Length(GeneratorsOfGroup(G1)) = 5; # Expected output: true # But found: Error, Variable: 'G1' must have a value ######## ########> Diff in standard/oper.tst:1414 # Input is: Size(G1); # Expected output: 1440 # But found: Error, Variable: 'G1' must have a value ######## ########> Diff in standard/oper.tst:1416 # Input is: DigraphShortestDistance(gr, 1, 16); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1420 # Input is: gr := Digraph([[2], [3], [1, 4], [1, 3], [5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1422 # Input is: DigraphShortestDistance(gr, 1, 3); # Expected output: 2 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1424 # Input is: DigraphShortestDistance(gr, [3, 3]); # Expected output: 0 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1426 # Input is: DigraphShortestDistance(gr, 5, 2); # Expected output: fail # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1428 # Input is: DigraphShortestDistances(gr);; # Expected output: # But found: Error, Variable: 'DigraphShortestDistances' must have a value ######## ########> Diff in standard/oper.tst:1429 # Input is: DigraphShortestDistance(gr, [3, 4]); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1433 # Input is: DigraphShortestDistance(gr, 1, 74); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1436 # Input is: DigraphShortestDistance(gr, [1, 74]); # Expected output: Error, the 2nd argument must consist of vertices of the 1st argument , # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1439 # Input is: DigraphShortestDistance(gr, [1, 71, 3]); # Expected output: Error, the 2nd argument must be a list of length 2, # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:1443 # Input is: gr := ChainDigraph(10); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/oper.tst:1445 # Input is: DigraphDistanceSet(gr, 5, 2); # Expected output: [ 7 ] # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1447 # Input is: gr := DigraphSymmetricClosure(ChainDigraph(10)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/oper.tst:1449 # Input is: DigraphDistanceSet(gr, 5, 2); # Expected output: [ 3, 7 ] # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1451 # Input is: gr := ChainDigraph(10);; # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/oper.tst:1452 # Input is: DigraphDistanceSet(gr, 20, 1); # Expected output: Error, the 2nd argument must be a vertex of the digraph, # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1454 # Input is: DigraphDistanceSet(gr, 20, [1]); # Expected output: Error, the 2nd argument must be a vertex of the digraph, # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1456 # Input is: DigraphDistanceSet(gr, 10, ["string", 1]); # Expected output: Error, the 3rd argument must be a list of non-negative integers, # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1458 # Input is: gr := DigraphFromDigraph6String("&GYHPQgWTIIPW");; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:1459 # Input is: DigraphDistanceSet(gr, 1, [3, 7]); # Expected output: [ ] # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1461 # Input is: DigraphDistanceSet(gr, 1, [1]); # Expected output: [ 2, 3, 5 ] # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1463 # Input is: DigraphDistanceSet(gr, 1, [1, 2]); # Expected output: [ 2, 3, 5, 4, 6, 7, 8 ] # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1465 # Input is: DigraphDistanceSet(gr, 2, 2); # Expected output: [ 3, 5, 7, 8 ] # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1467 # Input is: DigraphDistanceSet(gr, 2, -1); # Expected output: Error, the 3rd argument must be a non-negative integer, # But found: Error, Variable: 'DigraphDistanceSet' must have a value ######## ########> Diff in standard/oper.tst:1471 # Input is: gr1 := Digraph([[2], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1472 # Input is: gr2 := Digraph([[2, 2], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1473 # Input is: IsSubdigraph(gr1, gr2); # Expected output: false # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1475 # Input is: IsSubdigraph(gr2, gr1); # Expected output: true # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1477 # Input is: gr1 = gr2; # Expected output: false # But found: Error, Variable: 'gr1' must have a value ######## ########> Diff in standard/oper.tst:1481 # Input is: gr1 := CompleteDigraph(3);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1482 # Input is: gr2 := CompleteDigraph(4);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1483 # Input is: IsSubdigraph(gr1, gr2) or IsSubdigraph(gr1, gr2); # Expected output: false # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1485 # Input is: gr3 := CycleDigraph(3);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:1486 # Input is: IsSubdigraph(gr3, gr1); # Expected output: false # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1488 # Input is: IsSubdigraph(gr1, gr3); # Expected output: true # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1490 # Input is: gr4 := Digraph([[1, 1], [2, 2], [3, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1491 # Input is: IsSubdigraph(gr1, gr4) or IsSubdigraph(gr4, gr1); # Expected output: false # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1493 # Input is: gr1 := DigraphEdgeUnion(CompleteDigraph(3), CompleteDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:1495 # Input is: gr2 := DigraphEdgeUnion(CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:1497 # Input is: IsSubdigraph(gr1, gr2); # Expected output: true # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1499 # Input is: IsSubdigraph(gr2, gr1); # Expected output: false # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1501 # Input is: gr3 := Digraph([[2, 2, 3], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1503 # Input is: gr4 := Digraph([[2, 3, 3], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1505 # Input is: IsSubdigraph(gr3, gr4) or IsSubdigraph(gr4, gr3); # Expected output: false # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1507 # Input is: gr1 := Digraph([[1, 1], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1509 # Input is: gr2 := Digraph([[], [2, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1511 # Input is: IsSubdigraph(gr1, gr2) or IsSubdigraph(gr2, gr1); # Expected output: false # But found: Error, Variable: 'IsSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1515 # Input is: gr1 := CompleteDigraph(10); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1517 # Input is: gr2 := EmptyDigraph(9); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/oper.tst:1519 # Input is: IsUndirectedSpanningForest(gr1, gr2); # Expected output: false # But found: Error, Variable: 'IsUndirectedSpanningForest' must have a value ######## ########> Diff in standard/oper.tst:1521 # Input is: gr2 := DigraphAddEdge(EmptyDigraph(10), [1, 2]); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:1523 # Input is: IsUndirectedSpanningForest(gr1, gr2); # Expected output: false # But found: Error, Variable: 'IsUndirectedSpanningForest' must have a value ######## ########> Diff in standard/oper.tst:1525 # Input is: gr2 := DigraphAddEdge(gr2, [2, 1]); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:1527 # Input is: IsUndirectedSpanningForest(gr1, gr2); # Expected output: false # But found: Error, Variable: 'IsUndirectedSpanningForest' must have a value ######## ########> Diff in standard/oper.tst:1529 # Input is: IsUndirectedSpanningForest(gr1, DigraphFromSparse6String(":I`ESyTl^F")); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningForest' must have a value ######## ########> Diff in standard/oper.tst:1531 # Input is: gr := DigraphFromDigraph6String("&I?PIMAQc@A?W?ADPP?"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:1533 # Input is: IsUndirectedSpanningForest(gr, DigraphByEdges([[2, 7], [7, 2]], 10)); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningForest' must have a value ######## ########> Diff in standard/oper.tst:1537 # Input is: IsUndirectedSpanningTree(EmptyDigraph(1), EmptyDigraph(1)); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/oper.tst:1539 # Input is: IsUndirectedSpanningTree(EmptyDigraph(2), EmptyDigraph(2)); # Expected output: false # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/oper.tst:1541 # Input is: gr := DigraphFromDigraph6String("&I?PIMAQc@A?W?ADPP?"); # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:1543 # Input is: IsUndirectedSpanningTree(gr, EmptyDigraph(10)); # Expected output: false # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/oper.tst:1545 # Input is: gr := DigraphFromGraph6String("INB`cZoQ_"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/oper.tst:1547 # Input is: IsUndirectedSpanningTree(gr, gr); # Expected output: false # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/oper.tst:1549 # Input is: gr1 := DigraphEdgeUnion(CycleDigraph(5), DigraphReverse(CycleDigraph(5))); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:1551 # Input is: gr2 := DigraphEdgeUnion(ChainDigraph(5), DigraphReverse(ChainDigraph(5))); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:1553 # Input is: IsUndirectedSpanningTree(gr1, gr2); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/oper.tst:1555 # Input is: IsUndirectedSpanningTree(gr2, gr2); # Expected output: true # But found: Error, Variable: 'IsUndirectedSpanningTree' must have a value ######## ########> Diff in standard/oper.tst:1559 # Input is: gr := CycleDigraph(5); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:1561 # Input is: PartialOrderDigraphJoinOfVertices(gr, 1, 4); # Expected output: Error, the 1st argument must satisfy IsPartialOrderDigraph, # But found: Error, Variable: 'PartialOrderDigraphJoinOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1565 # Input is: gr := DigraphFromDiSparse6String(".HiR@AeNcC?oD?G`oAGXIoAGXAe_COqDK^F"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/oper.tst:1567 # Input is: PartialOrderDigraphMeetOfVertices(gr, 2, 3); # Expected output: 1 # But found: Error, Variable: 'PartialOrderDigraphMeetOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1569 # Input is: PartialOrderDigraphJoinOfVertices(gr, 2, 3); # Expected output: 4 # But found: Error, Variable: 'PartialOrderDigraphJoinOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1571 # Input is: PartialOrderDigraphJoinOfVertices(gr, 3, 9); # Expected output: 5 # But found: Error, Variable: 'PartialOrderDigraphJoinOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1573 # Input is: PartialOrderDigraphMeetOfVertices(gr, 3, 9); # Expected output: fail # But found: Error, Variable: 'PartialOrderDigraphMeetOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1575 # Input is: gr := DigraphReverse(gr); # Expected output: # But found: Error, Variable: 'DigraphReverse' must have a value ######## ########> Diff in standard/oper.tst:1577 # Input is: PartialOrderDigraphMeetOfVertices(gr, 2, 3); # Expected output: 4 # But found: Error, Variable: 'PartialOrderDigraphMeetOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1579 # Input is: PartialOrderDigraphJoinOfVertices(gr, 2, 3); # Expected output: 1 # But found: Error, Variable: 'PartialOrderDigraphJoinOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1581 # Input is: PartialOrderDigraphMeetOfVertices(gr, 3, 9); # Expected output: 5 # But found: Error, Variable: 'PartialOrderDigraphMeetOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1585 # Input is: gr := Digraph([[1, 2, 3], [1, 2, 3], [1, 2, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1587 # Input is: PartialOrderDigraphMeetOfVertices(gr, 2, 3); # Expected output: Error, the 1st argument must satisfy IsPartialOrderDigraph, # But found: Error, Variable: 'PartialOrderDigraphMeetOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1589 # Input is: PartialOrderDigraphJoinOfVertices(gr, 2, 3); # Expected output: Error, the 1st argument must satisfy IsPartialOrderDigraph, # But found: Error, Variable: 'PartialOrderDigraphJoinOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1591 # Input is: gr1 := Digraph([[1], [2], [1, 2, 3], [1, 2, 4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1593 # Input is: gr2 := DigraphReverse(gr1); # Expected output: # But found: Error, Variable: 'DigraphReverse' must have a value ######## ########> Diff in standard/oper.tst:1597 # Input is: PartialOrderDigraphMeetOfVertices(gr1, 3, 4); # Expected output: fail # But found: Error, Variable: 'PartialOrderDigraphMeetOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1599 # Input is: PartialOrderDigraphMeetOfVertices(gr2, 3, 4); # Expected output: fail # But found: Error, Variable: 'PartialOrderDigraphMeetOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1603 # Input is: PartialOrderDigraphJoinOfVertices(gr2, 3, 4); # Expected output: fail # But found: Error, Variable: 'PartialOrderDigraphJoinOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1605 # Input is: PartialOrderDigraphJoinOfVertices(gr1, 3, 4); # Expected output: fail # But found: Error, Variable: 'PartialOrderDigraphJoinOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1609 # Input is: gr := Digraph([[4, 5, 6, 7, 9], [7, 3], [2, 6, 7, 9, 10], [5, 6, 7, 1, 9], [1, 4, 6, 7], [7, 1, 3, 4, 5], [1, 4, 9, 2, 3, 5, 6, 8], [7], [1, 4, 7, 3, 10], [9, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1612 # Input is: DigraphNrEdges(gr); # Expected output: 42 # But found: Error, Variable: 'DigraphNrEdges' must have a value ######## ########> Diff in standard/oper.tst:1614 # Input is: DigraphNrEdges(DigraphClosure(gr, 10)); # Expected output: 54 # But found: Error, Variable: 'DigraphNrEdges' must have a value ######## ########> Diff in standard/oper.tst:1616 # Input is: DigraphNrEdges(DigraphClosure(gr, 9)); # Expected output: 90 # But found: Error, Variable: 'DigraphNrEdges' must have a value ######## ########> Diff in standard/oper.tst:1618 # Input is: DigraphNrEdges(DigraphClosure(gr, 11)); # Expected output: 42 # But found: Error, Variable: 'DigraphNrEdges' must have a value ######## ########> Diff in standard/oper.tst:1620 # Input is: gr := Digraph([[1], [2], [3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1621 # Input is: DigraphClosure(gr, 2); # Expected output: Error, the 1st argument must be a symmetric digraph with no loops, and no \ \ multiple edges, # But found: Error, Variable: 'DigraphClosure' must have a value ######## ########> Diff in standard/oper.tst:1624 # Input is: gr := Digraph([[2], [3], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1625 # Input is: DigraphClosure(gr, 2); # Expected output: Error, the 1st argument must be a symmetric digraph with no loops, and no \ \ multiple edges, # But found: Error, Variable: 'DigraphClosure' must have a value ######## ########> Diff in standard/oper.tst:1630 # Input is: gr := Digraph([[2], [3], [4], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1632 # Input is: IsMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1634 # Input is: gr := Digraph([[2], [3], [4], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1636 # Input is: IsMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1639 # Input is: IsMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1641 # Input is: gr := Digraph([[2], [3], [4], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1643 # Input is: IsMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1645 # Input is: gr := Digraph([[2], [3], [4], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1647 # Input is: IsMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1649 # Input is: gr := Digraph([[1, 2], [3], [4], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1651 # Input is: IsMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1653 # Input is: gr := Digraph([[2], [3], [4], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1655 # Input is: IsMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1657 # Input is: gr := Digraph([[2], [3], [4], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1659 # Input is: IsMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1661 # Input is: gr := CompleteDigraph(999);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1663 # Input is: IsMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1665 # Input is: gr := CompleteDigraph(999);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1668 # Input is: IsMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1670 # Input is: gr := CompleteDigraph(999);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1672 # Input is: IsMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1676 # Input is: gr := Digraph([[2], [3], [4], [5], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1678 # Input is: IsPerfectMatching(gr, [[1, 3]]); # Expected output: false # But found: Error, Variable: 'IsPerfectMatching' must have a value ######## ########> Diff in standard/oper.tst:1681 # Input is: IsMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1683 # Input is: IsPerfectMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsPerfectMatching' must have a value ######## ########> Diff in standard/oper.tst:1685 # Input is: gr := CompleteDigraph(500); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1691 # Input is: IsPerfectMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsPerfectMatching' must have a value ######## ########> Diff in standard/oper.tst:1693 # Input is: gr := Digraph([[2], [3, 4], [], [5], [1, 6], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1696 # Input is: IsMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1699 # Input is: IsPerfectMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsPerfectMatching' must have a value ######## ########> Diff in standard/oper.tst:1701 # Input is: gr := Digraph([[2], [3], [4, 3], [5], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1704 # Input is: IsPerfectMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsPerfectMatching' must have a value ######## ########> Diff in standard/oper.tst:1708 # Input is: gr := Digraph([[2], [3], [4], [5], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1711 # Input is: IsMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1714 # Input is: IsMaximalMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/oper.tst:1716 # Input is: gr := Digraph([[2], [3], [4], [5], [1, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1719 # Input is: IsMaximalMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/oper.tst:1721 # Input is: gr := CompleteDigraph(5);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/oper.tst:1723 # Input is: IsMaximalMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/oper.tst:1725 # Input is: gr := Digraph([[2], [3], [4], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1727 # Input is: IsMatching(gr, edges); # Expected output: false # But found: Error, Variable: 'IsMatching' must have a value ######## ########> Diff in standard/oper.tst:1730 # Input is: IsMaximalMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/oper.tst:1732 # Input is: gr := Digraph([[2], [3], [1], [5], [6], [4]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1734 # Input is: IsMaximalMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/oper.tst:1736 # Input is: gr := Digraph([[1, 2], [3], [4], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1739 # Input is: IsMaximalMatching(gr, edges); # Expected output: true # But found: Error, Variable: 'IsMaximalMatching' must have a value ######## ########> Diff in standard/oper.tst:1743 # Input is: D := Digraph([[1, 2], [1, 2], [2, 3, 4], [3, 5], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1745 # Input is: IsMaximumMatching(D, [[1, 2], [3, 3], [4, 5]]); # Expected output: false # But found: Error, Variable: 'IsMaximumMatching' must have a value ######## ########> Diff in standard/oper.tst:1747 # Input is: IsMaximumMatching(D, [[1, 1], [2, 2], [3, 3], [4, 5]]); # Expected output: true # But found: Error, Variable: 'IsMaximumMatching' must have a value ######## ########> Diff in standard/oper.tst:1749 # Input is: IsMaximumMatching(D, [[1, 1], [1, 2], [2, 2], [3, 3], [4, 5]]); # Expected output: false # But found: Error, Variable: 'IsMaximumMatching' must have a value ######## ########> Diff in standard/oper.tst:1753 # Input is: gr := Digraph([[1], [3, 4], [5, 6], [4, 2, 3], [4, 5], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1754 # Input is: DigraphShortestPath(gr, 1, 6); # Expected output: fail # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1756 # Input is: DigraphShortestPath(gr, 2, 5); # Expected output: [ [ 2, 3, 5 ], [ 1, 1 ] ] # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1758 # Input is: DigraphShortestPath(gr, 3, 3); # Expected output: [ [ 3, 5, 4, 3 ], [ 1, 1, 3 ] ] # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1760 # Input is: DigraphShortestPath(gr, 6, 6); # Expected output: fail # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1762 # Input is: DigraphShortestPath(gr, 5, 5); # Expected output: [ [ 5, 5 ], [ 2 ] ] # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1764 # Input is: gr := Digraph([[]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1765 # Input is: DigraphShortestPath(gr, 1, 1); # Expected output: fail # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1767 # Input is: gr := Digraph([[], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1768 # Input is: DigraphShortestPath(gr, 2, 1); # Expected output: fail # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1770 # Input is: gr := Digraph([[2], [1], [3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1771 # Input is: DigraphShortestPath(gr, 1, 2); # Expected output: [ [ 1, 2 ], [ 1 ] ] # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1773 # Input is: gr := CayleyDigraph(SymmetricGroup(7));; # Expected output: # But found: Error, Variable: 'CayleyDigraph' must have a value ######## ########> Diff in standard/oper.tst:1774 # Input is: DigraphShortestPath(gr, 12, 5014); # Expected output: [ [ 12, 912, 1919, 3595, 4915, 3433, 4153, 3242, 2522, 2886, 23, 743, 238, 1558, 713, 5014 ], [ 2, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2 ] ] # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1779 # Input is: D := Digraph(IsMutableDigraph, [[1], [3, 4], [5, 6], [4, 2, 3], [4, 5], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1781 # Input is: DigraphAddAllLoops(D); # Expected output: # But found: Error, Variable: 'DigraphAddAllLoops' must have a value ######## ########> Diff in standard/oper.tst:1783 # Input is: IsIdenticalObj(last, D); # Expected output: true # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/oper.tst:1785 # Input is: D := Digraph([[1], [3, 4], [5, 6], [4, 2, 3], [4, 5], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1787 # Input is: DigraphAddAllLoops(D); # Expected output: # But found: Error, Variable: 'DigraphAddAllLoops' must have a value ######## ########> Diff in standard/oper.tst:1789 # Input is: IsIdenticalObj(last, D); # Expected output: false # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/oper.tst:1791 # Input is: D := Digraph([[1], [3, 4], [5, 6], [4, 2, 3], [4, 5], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1793 # Input is: D := DigraphAddEdge(D, 1, 3); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:1795 # Input is: D := DigraphAddEdge(D, 1, 3); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:1797 # Input is: D := DigraphRemoveEdge(D, 1, 3); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:1799 # Input is: D := Digraph([[1], [3, 4], [5, 6], [4, 2, 3], [4, 5], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1801 # Input is: D := DigraphAddEdge(D, 1, 3); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:1803 # Input is: D := DigraphRemoveEdge(D, 1, 3); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:1805 # Input is: D := DigraphRemoveEdge(D, 1, 3); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/oper.tst:1809 # Input is: D := DigraphMutableCopy(CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1811 # Input is: DigraphDisjointUnion(D, D, D, D, D, D, D, D, D, D); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:1813 # Input is: D := DigraphMutableCopy(CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1815 # Input is: DigraphDisjointUnion(D, CycleDigraph(3), CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:1818 # Input is: D := DigraphMutableCopy(CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1820 # Input is: DigraphJoin(D, D, D); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1822 # Input is: D := CycleDigraph(IsMutableDigraph, 3); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:1824 # Input is: DigraphEdgeUnion(D, D, D); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:1826 # Input is: D := DigraphMutableCopy(CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1828 # Input is: DigraphJoin(D, CycleDigraph(3), CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1831 # Input is: D := CycleDigraph(3); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:1833 # Input is: DigraphJoin(D, D, D); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1835 # Input is: DigraphJoin(D, CycleDigraph(3), CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphJoin' must have a value ######## ########> Diff in standard/oper.tst:1838 # Input is: D := DigraphMutableCopy(CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1840 # Input is: DigraphEdgeUnion(D, CycleDigraph(3), CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:1843 # Input is: DD := CycleDigraph(3); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:1845 # Input is: DD := DigraphEdgeUnion(D, CycleDigraph(3), CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/oper.tst:1848 # Input is: D = DD; # Expected output: true # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/oper.tst:1850 # Input is: D := Digraph(IsMutableDigraph, [[2, 3], [1, 3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1852 # Input is: DigraphReverse(D) = Digraph(IsMutableDigraph, [[2, 3], [1, 3], [1, 2]]); # Expected output: true # But found: Error, Variable: 'DigraphReverse' must have a value ######## ########> Diff in standard/oper.tst:1854 # Input is: DigraphReverseEdge(D, 1, 2); # Expected output: # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/oper.tst:1856 # Input is: DigraphReverseEdge(D, 1, 1); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/oper.tst:1858 # Input is: DigraphAddEdge(D, 1, 1); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:1860 # Input is: DigraphReverseEdge(D, 1, 1); # Expected output: Error, the 1st argument must be a digraph with no multiple edges, # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/oper.tst:1862 # Input is: D := Digraph(IsMutableDigraph, [[2, 3], [1, 3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1864 # Input is: DigraphAddEdge(D, 1, 1); # Expected output: # But found: Error, Variable: 'DigraphAddEdge' must have a value ######## ########> Diff in standard/oper.tst:1866 # Input is: DigraphReverseEdge(D, 1, 1); # Expected output: # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/oper.tst:1868 # Input is: DigraphReverseEdge(D, 1, 4); # Expected output: Error, there is no edge from 1 to 4 in the digraph that is the 1st argument, # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/oper.tst:1871 # Input is: D := MakeImmutable(D); # Expected output: # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/oper.tst:1873 # Input is: D := DigraphReverseEdge(D, 1, 2); # Expected output: # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/oper.tst:1875 # Input is: D := CycleDigraph(3); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/oper.tst:1877 # Input is: DigraphReverseEdge(D, [1, 2]); # Expected output: # But found: Error, Variable: 'DigraphReverseEdge' must have a value ######## ########> Diff in standard/oper.tst:1879 # Input is: D := DigraphMutableCopy(CompleteDigraph(10)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1881 # Input is: DD := InducedSubdigraph(D, [1, 2, 4, 6]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1883 # Input is: D; # Expected output: # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/oper.tst:1885 # Input is: D := DigraphMutableCopy(CompleteDigraph(10)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1887 # Input is: DD := QuotientDigraph(D, [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10]]); # Expected output: # But found: Error, Variable: 'QuotientDigraph' must have a value ######## ########> Diff in standard/oper.tst:1889 # Input is: InNeighboursOfVertexNC(DD, 1); # Expected output: [ 1, 2, 3, 4 ] # But found: Error, Variable: 'InNeighboursOfVertexNC' must have a value ######## ########> Diff in standard/oper.tst:1891 # Input is: MakeImmutable(DD); # Expected output: # But found: Error, Variable: 'DD' must have a value ######## ########> Diff in standard/oper.tst:1893 # Input is: InNeighbours(DD);; # Expected output: # But found: Error, Variable: 'InNeighbours' must have a value ######## ########> Diff in standard/oper.tst:1894 # Input is: InNeighboursOfVertexNC(DD, 1); # Expected output: [ 1, 2, 3, 4 ] # But found: Error, Variable: 'InNeighboursOfVertexNC' must have a value ######## ########> Diff in standard/oper.tst:1896 # Input is: InDegreeOfVertexNC(DD, 1); # Expected output: 4 # But found: Error, Variable: 'InDegreeOfVertexNC' must have a value ######## ########> Diff in standard/oper.tst:1898 # Input is: DigraphShortestPath(DD, 1, 5); # Expected output: Error, the 2nd and 3rd arguments and must be vertices of the 1st argum\ \ ent , # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1901 # Input is: IsTransitiveDigraph(DD); # Expected output: false # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/oper.tst:1903 # Input is: DD := DigraphTransitiveClosure(DigraphRemoveAllMultipleEdges(DD)); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/oper.tst:1905 # Input is: IsTransitiveDigraph(DD); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/oper.tst:1907 # Input is: DigraphShortestPath(DD, 1, 2); # Expected output: [ [ 1, 2 ], [ 2 ] ] # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1909 # Input is: D := ChainDigraph(4); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/oper.tst:1911 # Input is: D := DigraphTransitiveClosure(D); # Expected output: # But found: Error, Variable: 'DigraphTransitiveClosure' must have a value ######## ########> Diff in standard/oper.tst:1913 # Input is: DigraphShortestPath(D, 2, 1); # Expected output: fail # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1915 # Input is: D := DigraphDisjointUnion(CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/oper.tst:1917 # Input is: DigraphConnectedComponents(D); # Expected output: rec( comps := [ [ 1, 2, 3 ], [ 4, 5, 6 ] ], id := [ 1, 1, 1, 2, 2, 2 ] ) # But found: Error, Variable: 'DigraphConnectedComponents' must have a value ######## ########> Diff in standard/oper.tst:1919 # Input is: DigraphShortestPath(D, 1, 4); # Expected output: fail # But found: Error, Variable: 'DigraphShortestPath' must have a value ######## ########> Diff in standard/oper.tst:1921 # Input is: D := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1923 # Input is: PartialOrderDigraphMeetOfVertices(D, 1, 2); # Expected output: Error, the 3rd argument must be a vertex of the 1st argument , # But found: Error, Variable: 'PartialOrderDigraphMeetOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1925 # Input is: PartialOrderDigraphMeetOfVertices(D, 2, 1); # Expected output: Error, the 2nd argument must be a vertex of the 1st argument , # But found: Error, Variable: 'PartialOrderDigraphMeetOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1927 # Input is: PartialOrderDigraphJoinOfVertices(D, 1, 2); # Expected output: Error, the 3rd argument must be a vertex of the 1st argument , # But found: Error, Variable: 'PartialOrderDigraphJoinOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1929 # Input is: PartialOrderDigraphJoinOfVertices(D, 2, 1); # Expected output: Error, the 2nd argument must be a vertex of the 1st argument , # But found: Error, Variable: 'PartialOrderDigraphJoinOfVertices' must have a value ######## ########> Diff in standard/oper.tst:1933 # Input is: D := DigraphMutableCopy(CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1935 # Input is: DigraphCartesianProduct(D, D, D); # Expected output: # But found: Error, Variable: 'DigraphCartesianProduct' must have a value ######## ########> Diff in standard/oper.tst:1937 # Input is: D := DigraphMutableCopy(CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1939 # Input is: DigraphCartesianProduct(D, CycleDigraph(3), CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphCartesianProduct' must have a value ######## ########> Diff in standard/oper.tst:1941 # Input is: D := DigraphCartesianProduct(ChainDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphCartesianProduct' must have a value ######## ########> Diff in standard/oper.tst:1943 # Input is: IsIsomorphicDigraph(D, Digraph([[2, 4], [3, 5], [6], [5, 7], [6, 8], [9], [8, 1], [9, 2], [3]])); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/oper.tst:1946 # Input is: D := DigraphCartesianProduct(ChainDigraph(3), CycleDigraph(3), Digraph([[2], [2]])); # Expected output: # But found: Error, Variable: 'DigraphCartesianProduct' must have a value ######## ########> Diff in standard/oper.tst:1949 # Input is: HasDigraphCartesianProductProjections(D); # Expected output: true # But found: Error, Variable: 'HasDigraphCartesianProductProjections' must have a value ######## ########> Diff in standard/oper.tst:1951 # Input is: Length(DigraphCartesianProductProjections(D)); # Expected output: 3 # But found: Error, Variable: 'DigraphCartesianProductProjections' must have a value ######## ########> Diff in standard/oper.tst:1953 # Input is: G := DigraphFromDigraph6String( "&QSC?IA?@@?A__@OO?GG_OCOGAG?@?E_?BO?@G??s??Y??H?CE?AB?@@");; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:1955 # Input is: IsIsomorphicDigraph(D, G); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/oper.tst:1957 # Input is: D := RandomDigraph(100);; IsIsomorphicDigraph(D, DigraphCartesianProduct(D, Digraph([[]]))); # Expected output: true # But found: Error, Variable: 'RandomDigraph' must have a value Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/oper.tst:1960 # Input is: DigraphCartesianProduct(Digraph([[1]]), Digraph([[1]])); # Expected output: # But found: Error, Variable: 'DigraphCartesianProduct' must have a value ######## ########> Diff in standard/oper.tst:1964 # Input is: D := DigraphMutableCopy(CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1966 # Input is: DigraphDirectProduct(D, D, D); # Expected output: # But found: Error, Variable: 'DigraphDirectProduct' must have a value ######## ########> Diff in standard/oper.tst:1968 # Input is: D := DigraphMutableCopy(CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphMutableCopy' must have a value ######## ########> Diff in standard/oper.tst:1970 # Input is: DigraphDirectProduct(D, CycleDigraph(3), CycleDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphDirectProduct' must have a value ######## ########> Diff in standard/oper.tst:1972 # Input is: D := DigraphDirectProduct(ChainDigraph(3), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphDirectProduct' must have a value ######## ########> Diff in standard/oper.tst:1974 # Input is: IsIsomorphicDigraph(D, Digraph([[5], [6], [], [8], [9], [], [2], [3], []])); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/oper.tst:1977 # Input is: D := DigraphDirectProduct(ChainDigraph(3), CycleDigraph(3), Digraph([[2], [2]])); # Expected output: # But found: Error, Variable: 'DigraphDirectProduct' must have a value ######## ########> Diff in standard/oper.tst:1980 # Input is: HasDigraphDirectProductProjections(D); # Expected output: true # But found: Error, Variable: 'HasDigraphDirectProductProjections' must have a value ######## ########> Diff in standard/oper.tst:1982 # Input is: Length(DigraphDirectProductProjections(D)); # Expected output: 3 # But found: Error, Variable: 'DigraphDirectProductProjections' must have a value ######## ########> Diff in standard/oper.tst:1984 # Input is: G := DigraphFromDigraph6String( "&Q??O??G?????A??@????A??@??????O??G?????A??@????A??@????");; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/oper.tst:1986 # Input is: IsIsomorphicDigraph(D, G); # Expected output: true # But found: Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/oper.tst:1988 # Input is: D := RandomDigraph(100);; IsIsomorphicDigraph(D, DigraphDirectProduct(D, Digraph([[1]]))); # Expected output: true # But found: Error, Variable: 'RandomDigraph' must have a value Error, Variable: 'IsIsomorphicDigraph' must have a value ######## ########> Diff in standard/oper.tst:1993 # Input is: D := Digraph(IsMutableDigraph, [[3, 4, 6, 8], [1, 3, 4, 6, 7, 8, 10], [1, 2, 6, 7, 8, 9], [3, 5, 7], [1, 2, 3, 6, 8, 9], [2, 6, 8, 10], [2, 7, 10], [1, 5, 8, 10], [1, 2, 6, 7, 8, 10], [1, 2, 6, 8, 9, 10]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:1997 # Input is: InducedSubdigraph(D, [4, 5]); # Expected output: # But found: Error, Variable: 'InducedSubdigraph' must have a value ######## ########> Diff in standard/oper.tst:1999 # Input is: DigraphVertexLabels(D); # Expected output: [ 4, 5 ] # But found: Error, Variable: 'DigraphVertexLabels' must have a value ######## ########> Diff in standard/oper.tst:2003 # Input is: D := Digraph([[6, 7, 8], [8], [8], [8], [8], [1, 7, 8], [1, 6, 8], [3, 2, 1, 7, 6, 5, 4]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/oper.tst:2005 # Input is: C := DigraphRemoveVertex(DigraphMutableCopy(D), 5);; # Expected output: # But found: Error, Variable: 'DigraphRemoveVertex' must have a value ######## ########> Diff in standard/oper.tst:2006 # Input is: DigraphEdgeLabels(C); # Expected output: [ [ 1, 1, 1 ], [ 1 ], [ 1 ], [ 1 ], [ 1, 1, 1 ], [ 1, 1, 1 ], [ 1, 1, 1, 1, 1, 1 ] ] # But found: Error, Variable: 'DigraphEdgeLabels' must have a value ######## ########> Diff in standard/oper.tst:2009 # Input is: OutNeighbours(C); # Expected output: [ [ 5, 6, 7 ], [ 7 ], [ 7 ], [ 7 ], [ 1, 6, 7 ], [ 1, 5, 7 ], [ 3, 2, 1, 6, 5, 4 ] ] # But found: Error, Variable: 'OutNeighbours' must have a value ######## ########> Diff in standard/oper.tst:2017 # Input is: gr := DigraphByAdjacencyMatrix(mat); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:2019 # Input is: DigraphShortestDistance(gr, 2, 3); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:2021 # Input is: DigraphDijkstra(gr, 2, 3); # Expected output: [ [ infinity, 0, 1 ], [ -1, -1, 2 ] ] # But found: Error, Variable: 'DigraphDijkstra' must have a value ######## ########> Diff in standard/oper.tst:2023 # Input is: DigraphDijkstra(gr, 1, 3); # Expected output: [ [ 0, 1, 1 ], [ -1, 1, 1 ] ] # But found: Error, Variable: 'DigraphDijkstra' must have a value ######## ########> Diff in standard/oper.tst:2025 # Input is: DigraphDijkstra(gr, 1, 2); # Expected output: [ [ 0, 1, 1 ], [ -1, 1, 1 ] ] # But found: Error, Variable: 'DigraphDijkstra' must have a value ######## ########> Diff in standard/oper.tst:2027 # Input is: DigraphShortestDistance(gr, 1, 3); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:2029 # Input is: DigraphShortestDistance(gr, 1, 2); # Expected output: 1 # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:2033 # Input is: gr := DigraphByAdjacencyMatrix(mat); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:2035 # Input is: DigraphShortestDistance(gr, 2, 3); # Expected output: fail # But found: Error, Variable: 'DigraphShortestDistance' must have a value ######## ########> Diff in standard/oper.tst:2037 # Input is: DigraphDijkstra(gr, 2, 3); # Expected output: [ [ infinity, 0, infinity ], [ -1, -1, -1 ] ] # But found: Error, Variable: 'DigraphDijkstra' must have a value ######## ########> Diff in standard/oper.tst:2041 # Input is: gr := DigraphByAdjacencyMatrix(mat); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:2043 # Input is: DigraphDijkstra(gr, 1, 4); # Expected output: [ [ 0, 1, 1, 1 ], [ -1, 1, 1, 1 ] ] # But found: Error, Variable: 'DigraphDijkstra' must have a value ######## ########> Diff in standard/oper.tst:2047 # Input is: gr := DigraphByAdjacencyMatrix(mat); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/oper.tst:2049 # Input is: DigraphDijkstra(gr, 1, 2); # Expected output: [ [ 0, 1, 1, 1 ], [ -1, 1, 1, 1 ] ] # But found: Error, Variable: 'DigraphDijkstra' must have a value ######## ########> Diff in standard/oper.tst:2051 # Input is: DigraphDijkstra(gr, 1, 3); # Expected output: [ [ 0, 1, 1, 1 ], [ -1, 1, 1, 1 ] ] # But found: Error, Variable: 'DigraphDijkstra' must have a value ######## ########> Diff in standard/oper.tst:2116 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/oper.tst msecs: 1077 false gap> ########> Diff in standard/orbits.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/orbits.tst:17 # Input is: gr := NullDigraph(0); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/orbits.tst:19 # Input is: DigraphStabilizer(gr, 1); # Expected output: Error, the 2nd argument must not exceed 0, the number of vertices of the digraph in the 1st argument , # But found: Error, Variable: 'DigraphStabilizer' must have a value ######## ########> Diff in standard/orbits.tst:24 # Input is: gr := CompleteDigraph(3); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/orbits.tst:26 # Input is: DigraphStabilizer(gr, 1); # Expected output: Group([ (2,3) ]) # But found: Error, Variable: 'DigraphStabilizer' must have a value ######## ########> Diff in standard/orbits.tst:28 # Input is: DigraphStabilizer(gr, 2); # Expected output: Group([ (1,3) ]) # But found: Error, Variable: 'DigraphStabilizer' must have a value ######## ########> Diff in standard/orbits.tst:30 # Input is: DigraphStabilizer(gr, 3); # Expected output: Group([ (1,2) ]) # But found: Error, Variable: 'DigraphStabilizer' must have a value ######## ########> Diff in standard/orbits.tst:34 # Input is: gr := Digraph([[2, 3], [1], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/orbits.tst:36 # Input is: DigraphGroup(gr); # Expected output: Group(()) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/orbits.tst:38 # Input is: gr := Digraph([[3], [3], [1, 2, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/orbits.tst:40 # Input is: Size(AutomorphismGroup(gr)); # Expected output: 2 # But found: Error, Variable: 'gr' must have a value ######## ########> Diff in standard/orbits.tst:42 # Input is: gr := Digraph([[3, 2], [1], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/orbits.tst:44 # Input is: DigraphGroup(gr); # Expected output: Group([ (2,3) ]) # But found: Error, Variable: 'DigraphGroup' must have a value ######## ########> Diff in standard/orbits.tst:48 # Input is: gr := CycleDigraph(10); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/orbits.tst:50 # Input is: DigraphOrbits(gr); # Expected output: [ [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ] ] # But found: Error, Variable: 'DigraphOrbits' must have a value ######## ########> Diff in standard/orbits.tst:54 # Input is: gr := ChainDigraph(3); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/orbits.tst:56 # Input is: RepresentativeOutNeighbours(gr); # Expected output: [ [ 2 ], [ 3 ], [ ] ] # But found: Error, Variable: 'RepresentativeOutNeighbours' must have a value ######## ########> Diff in standard/orbits.tst:58 # Input is: gr := CycleDigraph(12); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/orbits.tst:60 # Input is: RepresentativeOutNeighbours(gr); # Expected output: [ [ 2 ] ] # But found: Error, Variable: 'RepresentativeOutNeighbours' must have a value ######## ########> Diff in standard/orbits.tst:64 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/orbits.tst msecs: 26 false gap> ########> Diff in standard/planar.tst:14 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/planar.tst:17 # Input is: D := NullDigraph(0); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/planar.tst:19 # Input is: IsPlanarDigraph(D); # Expected output: true # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:21 # Input is: D := CompleteDigraph(4); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/planar.tst:23 # Input is: IsPlanarDigraph(D); # Expected output: true # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:25 # Input is: D := CompleteDigraph(5); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/planar.tst:27 # Input is: IsPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:29 # Input is: D := Digraph([[2, 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10], [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:33 # Input is: ChromaticNumber(D); # Expected output: 5 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/planar.tst:35 # Input is: IsPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:37 # Input is: D := CompleteBipartiteDigraph(3, 3); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/planar.tst:39 # Input is: D := DigraphDisjointUnion(D, D); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/planar.tst:41 # Input is: IsPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:45 # Input is: D := Digraph([[2, 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10], [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:49 # Input is: ChromaticNumber(D); # Expected output: 5 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/planar.tst:51 # Input is: IsPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:53 # Input is: IsOuterPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsOuterPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:55 # Input is: D := NullDigraph(0); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/planar.tst:57 # Input is: IsOuterPlanarDigraph(D); # Expected output: true # But found: Error, Variable: 'IsOuterPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:59 # Input is: D := CompleteDigraph(4); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/planar.tst:61 # Input is: IsOuterPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsOuterPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:63 # Input is: D := CompleteDigraph(4); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/planar.tst:65 # Input is: ChromaticNumber(D); # Expected output: 4 # But found: Error, Variable: 'ChromaticNumber' must have a value ######## ########> Diff in standard/planar.tst:67 # Input is: IsOuterPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsOuterPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:69 # Input is: D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:72 # Input is: IsOuterPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsOuterPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:74 # Input is: IsPlanarDigraph(D); # Expected output: true # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:78 # Input is: D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:81 # Input is: PlanarEmbedding(D); # Expected output: [ [ 3, 10, 5 ], [ 10, 8, 9 ], [ 4 ], [ 6 ], [ 11, 7 ], [ 7 ], [ 8 ], [ ], [ 11 ], [ ], [ ] ] # But found: Error, Variable: 'PlanarEmbedding' must have a value ######## ########> Diff in standard/planar.tst:84 # Input is: D := Digraph([[2, 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10], [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:88 # Input is: IsPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:90 # Input is: PlanarEmbedding(D); # Expected output: fail # But found: Error, Variable: 'PlanarEmbedding' must have a value ######## ########> Diff in standard/planar.tst:92 # Input is: D := NullDigraph(0); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/planar.tst:94 # Input is: PlanarEmbedding(D); # Expected output: [ ] # But found: Error, Variable: 'PlanarEmbedding' must have a value ######## ########> Diff in standard/planar.tst:96 # Input is: D := List(["D??", "D?_", "D?o", "D?w", "D?{", "DCO", "DCW", "DCc", "DCo", "DCs", "DCw", "DC{", "DEk", "DEo", "DEs", "DEw", "DE{", "DFw", "DF{", "DQg", "DQo", "DQw", "DQ{", "DTk", "DTw", "DT{", "DUW", "DUw", "DU{", "DV{", "D]w", "D]{", "D^{", "D~{"], DigraphFromGraph6String);; # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/planar.tst:100 # Input is: List(D, PlanarEmbedding); # Expected output: [ [ ], [ [ 5 ], [ ], [ ], [ ], [ ] ], [ [ 5 ], [ 5 ], [ ], [ ], [ ] ], [ [ 5 ], [ 5 ], [ 5 ], [ ], [ ] ], [ [ 5 ], [ 5 ], [ 5 ], [ 5 ], [ ] ], [ [ 4 ], [ 5 ], [ ], [ ], [ ] ], [ [ 4 ], [ 5 ], [ 5 ], [ ], [ ] ], [ [ 4, 5 ], [ ], [ ], [ 5 ], [ ] ], [ [ 4, 5 ], [ 5 ], [ ], [ ], [ ] ] , [ [ 4, 5 ], [ 5 ], [ ], [ 5 ], [ ] ], [ [ 4, 5 ], [ 5 ], [ 5 ], [ ], [ ] ], [ [ 4, 5 ], [ 5 ], [ 5 ], [ 5 ], [ ] ], [ [ 4, 5 ], [ 4 ], [ 5 ], [ 5 ], [ ] ], [ [ 4, 5 ], [ 5, 4 ], [ ], [ ], [ ] ], [ [ 4, 5 ], [ 5, 4 ], [ ], [ 5 ], [ ] ], [ [ 4, 5 ], [ 5, 4 ], [ 5 ], [ ], [ ] ], [ [ 4, 5 ], [ 5, 4 ], [ 5 ], [ 5 ], [ ] ], [ [ 4, 5 ], [ 5, 4 ], [ 4, 5 ], [ ], [ ] ], [ [ 4, 5 ], [ 5, 4 ], [ 4, 5 ], [ 5 ], [ ] ], [ [ 3, 5 ], [ 4 ], [ 5 ], [ ], [ ] ], [ [ 3, 5 ], [ 5, 4 ], [ ], [ ], [ ] ], [ [ 3, 5 ], [ 5, 4 ], [ 5 ], [ ], [ ] ], [ [ 3, 5 ], [ 4, 5 ], [ 5 ], [ 5 ], [ ] ], [ [ 3, 5, 4 ], [ ], [ 4, 5 ], [ 5 ], [ ] ], [ [ 3, 5, 4 ], [ 5 ], [ 4, 5 ], [ ], [ ] ], [ [ 3, 5, 4 ], [ 5 ], [ 4, 5 ], [ 5 ], [ ] ], [ [ 3, 4 ], [ 4, 5 ], [ 5 ], [ ], [ ] ], [ [ 3, 5, 4 ], [ 4, 5 ], [ 5 ], [ ], [ ] ], [ [ 3, 5, 4 ], [ 4, 5 ], [ 5 ], [ 5 ], [ ] ], [ [ 3, 5, 4 ], [ 5, 4 ], [ 4, 5 ], [ 5 ], [ ] ], [ [ 3, 5, 4 ], [ 4, 5, 3 ], [ 5 ], [ ], [ ] ], [ [ 3, 5, 4 ], [ 4, 5, 3 ], [ 5 ], [ 5 ], [ ] ], [ [ 3, 5, 4 ], [ 4, 5, 3 ], [ 4, 5 ], [ 5 ], [ ] ], fail ] # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/planar.tst:131 # Input is: D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:134 # Input is: OuterPlanarEmbedding(D); # Expected output: fail # But found: Error, Variable: 'OuterPlanarEmbedding' must have a value ######## ########> Diff in standard/planar.tst:136 # Input is: D := Digraph([[2, 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10], [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:140 # Input is: IsOuterPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsOuterPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:142 # Input is: OuterPlanarEmbedding(D); # Expected output: fail # But found: Error, Variable: 'OuterPlanarEmbedding' must have a value ######## ########> Diff in standard/planar.tst:144 # Input is: D := NullDigraph(0); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/planar.tst:146 # Input is: OuterPlanarEmbedding(D); # Expected output: [ ] # But found: Error, Variable: 'OuterPlanarEmbedding' must have a value ######## ########> Diff in standard/planar.tst:148 # Input is: D := CompleteDigraph(3); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/planar.tst:150 # Input is: OuterPlanarEmbedding(D); # Expected output: [ [ 2, 3 ], [ 3 ], [ ] ] # But found: Error, Variable: 'OuterPlanarEmbedding' must have a value ######## ########> Diff in standard/planar.tst:154 # Input is: D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:157 # Input is: SubdigraphHomeomorphicToK4(D); # Expected output: [ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [ 6 ], [ 7, 11 ], [ 7 ], [ 8 ], [ ], [ 11 ], [ ], [ ] ] # But found: Error, Variable: 'SubdigraphHomeomorphicToK4' must have a value ######## ########> Diff in standard/planar.tst:160 # Input is: SubdigraphHomeomorphicToK23(D); # Expected output: [ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ], [ ], [ 11 ], [ ], [ ] ] # But found: Error, Variable: 'SubdigraphHomeomorphicToK23' must have a value ######## ########> Diff in standard/planar.tst:163 # Input is: D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:166 # Input is: SubdigraphHomeomorphicToK4(D); # Expected output: fail # But found: Error, Variable: 'SubdigraphHomeomorphicToK4' must have a value ######## ########> Diff in standard/planar.tst:168 # Input is: SubdigraphHomeomorphicToK23(D); # Expected output: [ [ 3, 10, 5 ], [ 10, 8, 9 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ], [ ], [ 11 ], [ ], [ ] ] # But found: Error, Variable: 'SubdigraphHomeomorphicToK23' must have a value ######## ########> Diff in standard/planar.tst:171 # Input is: SubdigraphHomeomorphicToK33(D); # Expected output: fail # But found: Error, Variable: 'SubdigraphHomeomorphicToK33' must have a value ######## ########> Diff in standard/planar.tst:173 # Input is: SubdigraphHomeomorphicToK23(NullDigraph(0)); # Expected output: fail # But found: Error, Variable: 'SubdigraphHomeomorphicToK23' must have a value ######## ########> Diff in standard/planar.tst:175 # Input is: SubdigraphHomeomorphicToK33(CompleteDigraph(5)); # Expected output: fail # But found: Error, Variable: 'SubdigraphHomeomorphicToK33' must have a value ######## ########> Diff in standard/planar.tst:177 # Input is: SubdigraphHomeomorphicToK33(CompleteBipartiteDigraph(3, 3)); # Expected output: [ [ 4, 6, 5 ], [ 4, 5, 6 ], [ 6, 5, 4 ], [ ], [ ], [ ] ] # But found: Error, Variable: 'SubdigraphHomeomorphicToK33' must have a value ######## ########> Diff in standard/planar.tst:179 # Input is: SubdigraphHomeomorphicToK4(CompleteDigraph(3)); # Expected output: fail # But found: Error, Variable: 'SubdigraphHomeomorphicToK4' must have a value ######## ########> Diff in standard/planar.tst:183 # Input is: D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:186 # Input is: KuratowskiPlanarSubdigraph(D); # Expected output: fail # But found: Error, Variable: 'KuratowskiPlanarSubdigraph' must have a value ######## ########> Diff in standard/planar.tst:188 # Input is: D := Digraph([[2, 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10], [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:192 # Input is: IsPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:194 # Input is: KuratowskiPlanarSubdigraph(D); # Expected output: [ [ 2, 9, 7 ], [ 3 ], [ 6 ], [ 5, 9 ], [ 6 ], [ ], [ 4 ], [ 7, 9, 3 ], [ ], [ ] ] # But found: Error, Variable: 'KuratowskiPlanarSubdigraph' must have a value ######## ########> Diff in standard/planar.tst:197 # Input is: D := NullDigraph(0); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/planar.tst:199 # Input is: KuratowskiPlanarSubdigraph(D); # Expected output: fail # But found: Error, Variable: 'KuratowskiPlanarSubdigraph' must have a value ######## ########> Diff in standard/planar.tst:203 # Input is: D := Digraph([[3, 5, 10], [8, 9, 10], [1, 4], [3, 6], [1, 7, 11], [4, 7], [6, 8], [2, 7], [2, 11], [1, 2], [5, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:206 # Input is: KuratowskiOuterPlanarSubdigraph(D); # Expected output: [ [ 3, 5, 10 ], [ 9, 8, 10 ], [ 4 ], [ 6 ], [ 11 ], [ 7 ], [ 8 ], [ ], [ 11 ], [ ], [ ] ] # But found: Error, Variable: 'KuratowskiOuterPlanarSubdigraph' must have a value ######## ########> Diff in standard/planar.tst:209 # Input is: D := Digraph([[2, 4, 7, 9, 10], [1, 3, 4, 6, 9, 10], [6, 10], [2, 5, 8, 9], [1, 2, 3, 4, 6, 7, 9, 10], [3, 4, 5, 7, 9, 10], [3, 4, 5, 6, 9, 10], [3, 4, 5, 7, 9], [2, 3, 5, 6, 7, 8], [3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/planar.tst:213 # Input is: IsOuterPlanarDigraph(D); # Expected output: false # But found: Error, Variable: 'IsOuterPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:215 # Input is: KuratowskiOuterPlanarSubdigraph(D); # Expected output: [ [ ], [ ], [ ], [ 8, 9 ], [ ], [ ], [ 9, 4 ], [ 7, 9 ], [ ], [ ] ] # But found: Error, Variable: 'KuratowskiOuterPlanarSubdigraph' must have a value ######## ########> Diff in standard/planar.tst:217 # Input is: D := NullDigraph(0); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/planar.tst:219 # Input is: KuratowskiOuterPlanarSubdigraph(D); # Expected output: fail # But found: Error, Variable: 'KuratowskiOuterPlanarSubdigraph' must have a value ######## ########> Diff in standard/planar.tst:221 # Input is: D := CompleteDigraph(3); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/planar.tst:223 # Input is: KuratowskiOuterPlanarSubdigraph(D); # Expected output: fail # But found: Error, Variable: 'KuratowskiOuterPlanarSubdigraph' must have a value ######## ########> Diff in standard/planar.tst:227 # Input is: IS_PLANAR(2); # Expected output: Error, Digraphs: boyers_planarity_check (C): the 1st argument must be a digrap\ \ h, not integer # But found: Error, Variable: 'IS_PLANAR' must have a value ######## ########> Diff in standard/planar.tst:230 # Input is: IS_PLANAR(NullDigraph(0)); # Expected output: Error, Digraphs: boyers_planarity_check (C): invalid number of nodes! # But found: Error, Variable: 'IS_PLANAR' must have a value ######## ########> Diff in standard/planar.tst:232 # Input is: IS_PLANAR(NullDigraph(70000)); # Expected output: Error, Digraphs: boyers_planarity_check (C): invalid number of edges! # But found: Error, Variable: 'IS_PLANAR' must have a value ######## ########> Diff in standard/planar.tst:234 # Input is: IsPlanarDigraph(NullDigraph(70000)); # Expected output: true # But found: Error, Variable: 'IsPlanarDigraph' must have a value ######## ########> Diff in standard/planar.tst:236 # Input is: IS_PLANAR(CompleteDigraph(2)); # Expected output: Error, Digraphs: boyers_planarity_check (C): the 1st argument must be an antis\ \ ymmetric digraph # But found: Error, Variable: 'IS_PLANAR' must have a value ######## ########> Diff in standard/planar.tst:241 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/planar.tst msecs: 113 false gap> ########> Diff in standard/prop.tst:15 # Input is: DIGRAPHS_StartTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StartTest' must have a value ######## ########> Diff in standard/prop.tst:18 # Input is: IsChainDigraph(ChainDigraph(1)); # Expected output: true # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:20 # Input is: IsChainDigraph(ChainDigraph(7)); # Expected output: true # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:22 # Input is: IsChainDigraph(CycleDigraph(1)); # Expected output: false # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:24 # Input is: IsChainDigraph(CycleDigraph(7)); # Expected output: false # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:26 # Input is: IsChainDigraph(Digraph([[2], [3], [4], [5], [5]])); # Expected output: false # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:28 # Input is: IsChainDigraph(Digraph([[2, 3], [4], [5], [], []])); # Expected output: false # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:30 # Input is: IsChainDigraph(Digraph([[2], [3, 4], [], []])); # Expected output: false # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:34 # Input is: IsChainDigraph(CayleyDigraph(G)); # Expected output: false # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:36 # Input is: IsChainDigraph(DigraphReverse(ChainDigraph(21))); # Expected output: true # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:38 # Input is: IsChainDigraph(Digraph([[], [3], [4], []])); # Expected output: false # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:40 # Input is: IsChainDigraph(Digraph([[2], [3], [4], []])); # Expected output: true # But found: Error, Variable: 'IsChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:44 # Input is: gr1 := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:46 # Input is: IsMultiDigraph(gr1); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:48 # Input is: gr2 := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:50 # Input is: IsMultiDigraph(gr2); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:55 # Input is: gr3 := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:57 # Input is: IsMultiDigraph(gr3); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:62 # Input is: gr4 := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:64 # Input is: IsMultiDigraph(gr4); # Expected output: true # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:68 # Input is: D := Digraph([[2], [1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:69 # Input is: IsStronglyConnectedDigraph(D);; # Expected output: # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:70 # Input is: IsAcyclicDigraph(D); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:72 # Input is: loop := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:74 # Input is: IsMultiDigraph(loop); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:76 # Input is: IsAcyclicDigraph(loop); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:79 # Input is: multiple := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:81 # Input is: IsMultiDigraph(multiple); # Expected output: true # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:83 # Input is: IsAcyclicDigraph(multiple); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:92 # Input is: complete100 := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:94 # Input is: IsMultiDigraph(complete100); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:96 # Input is: IsAcyclicDigraph(complete100); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:113 # Input is: circuit := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:115 # Input is: IsMultiDigraph(circuit); # Expected output: false # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:117 # Input is: IsAcyclicDigraph(circuit); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:122 # Input is: grid := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:124 # Input is: IsMultiDigraph(grid); # Expected output: true # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:126 # Input is: IsAcyclicDigraph(grid); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:128 # Input is: gr := Digraph([[1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:129 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:131 # Input is: HasIsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:133 # Input is: IsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:135 # Input is: gr := Digraph([[2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:137 # Input is: IsTournament(gr); # Expected output: true # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:139 # Input is: IsTransitiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:141 # Input is: HasIsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:143 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:145 # Input is: gr := Digraph([[2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:147 # Input is: DigraphStronglyConnectedComponents(gr); # Expected output: rec( comps := [ [ 2 ], [ 1 ] ], id := [ 2, 1 ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/prop.tst:149 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:151 # Input is: gr := Digraph([[1, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:153 # Input is: DigraphStronglyConnectedComponents(gr); # Expected output: rec( comps := [ [ 2 ], [ 1 ] ], id := [ 2, 1 ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/prop.tst:155 # Input is: IsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:157 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:159 # Input is: DigraphStronglyConnectedComponents(gr); # Expected output: rec( comps := [ [ 1, 2 ] ], id := [ 1, 1 ] ) # But found: Error, Variable: 'DigraphStronglyConnectedComponents' must have a value ######## ########> Diff in standard/prop.tst:161 # Input is: IsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:163 # Input is: gr := Digraph([ [9, 10], [8], [4], [1, 7, 8], [], [5], [], [6], [], [4, 8]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:166 # Input is: DigraphTopologicalSort(gr); # Expected output: fail # But found: Error, Variable: 'DigraphTopologicalSort' must have a value ######## ########> Diff in standard/prop.tst:168 # Input is: HasIsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:170 # Input is: IsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:174 # Input is: IsFunctionalDigraph(multiple); # Expected output: false # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:176 # Input is: IsFunctionalDigraph(grid); # Expected output: false # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:178 # Input is: IsFunctionalDigraph(circuit); # Expected output: false # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:180 # Input is: IsFunctionalDigraph(loop); # Expected output: true # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:182 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:184 # Input is: IsFunctionalDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:195 # Input is: g1 := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:197 # Input is: IsFunctionalDigraph(g1); # Expected output: false # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:199 # Input is: g2 := Digraph(OutNeighbours(g1)); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:201 # Input is: IsFunctionalDigraph(g2); # Expected output: false # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:203 # Input is: g3 := Digraph([[1], [3], [2], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:205 # Input is: IsFunctionalDigraph(g3); # Expected output: true # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:207 # Input is: g4 := Digraph(rec(DigraphVertices := [1 .. 3], DigraphSource := [3, 2, 1], DigraphRange := [2, 1, 3])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:210 # Input is: IsFunctionalDigraph(g4); # Expected output: true # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:212 # Input is: g5 := Digraph(rec(DigraphVertices := [1 .. 3], DigraphSource := [3, 2, 2], DigraphRange := [2, 1, 3])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:215 # Input is: IsFunctionalDigraph(g5); # Expected output: false # But found: Error, Variable: 'IsFunctionalDigraph' must have a value ######## ########> Diff in standard/prop.tst:219 # Input is: IsSymmetricDigraph(g1); # Expected output: false # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:221 # Input is: IsSymmetricDigraph(g2); # Expected output: false # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:223 # Input is: IsSymmetricDigraph(g3); # Expected output: false # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:225 # Input is: IsSymmetricDigraph(g4); # Expected output: false # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:227 # Input is: IsSymmetricDigraph(g5); # Expected output: false # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:229 # Input is: IsSymmetricDigraph(loop); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:231 # Input is: IsSymmetricDigraph(multiple); # Expected output: false # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:233 # Input is: g6 := Digraph([[1, 2, 4], [1, 3], [2, 3, 4], [3, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:235 # Input is: IsSymmetricDigraph(g6); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:237 # Input is: gr := Digraph(rec(DigraphNrVertices := 3, DigraphSource := [1, 1, 2, 2, 2, 2, \ 3, 3], DigraphRange := [2, 2, 1, 1, 3, 3, 2, 2]));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:239 # Input is: IsSymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsSymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:243 # Input is: gr := Digraph(rec(DigraphNrVertices := 10, DigraphSource := [1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 5, \ 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10], DigraphRange := [2, 4, 6, 10, 3, 5, 7, 4, 7, 1, 9, 10, 4, 6, 9, 8, 4, 3, 7, 1,\ 6, 8, 2, 3, 9, 7, 10, 9, 4, 1, 8, 9, 3, 1, 4, 2, 5, 2, 1, 10, 5, 6, 2, 4, 8])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:249 # Input is: IsAntisymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:251 # Input is: gr := Digraph([[1, 1, 1, 2, 2], [2, 3], [3, 3, 4], [4, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:253 # Input is: IsAntisymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:255 # Input is: gr := Digraph([[1, 1, 1, 2, 2], [2, 3], [3, 3, 4], [4, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:257 # Input is: IsAntisymmetricDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:259 # Input is: gr := Digraph([[2, 3], [3], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:261 # Input is: IsAntisymmetricDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:263 # Input is: gr := Digraph([[2], [3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:265 # Input is: IsAntisymmetricDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:267 # Input is: gr := Digraph([[1, 1, 1, 1, 2], [2, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:269 # Input is: IsAntisymmetricDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:271 # Input is: gr := Digraph([[1, 1, 1, 1, 2], [2, 2, 2, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:273 # Input is: IsAntisymmetricDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAntisymmetricDigraph' must have a value ######## ########> Diff in standard/prop.tst:277 # Input is: gr1 := Digraph(rec(DigraphNrVertices := 5, DigraphSource := [], DigraphRange :\ = []));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:278 # Input is: IsEmptyDigraph(gr1); # Expected output: true # But found: Error, Variable: 'IsEmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:280 # Input is: gr2 := Digraph(rec(DigraphVertices := [1 .. 6], DigraphSource := [6], DigraphRange :=\ [1]));; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:282 # Input is: IsEmptyDigraph(gr2); # Expected output: false # But found: Error, Variable: 'IsEmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:284 # Input is: gr3 := DigraphNC([[], [], [], []]);; # Expected output: # But found: Error, Variable: 'DigraphNC' must have a value ######## ########> Diff in standard/prop.tst:285 # Input is: IsEmptyDigraph(gr3); # Expected output: true # But found: Error, Variable: 'IsEmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:287 # Input is: gr4 := DigraphNC([[], [3], [1]]);; # Expected output: # But found: Error, Variable: 'DigraphNC' must have a value ######## ########> Diff in standard/prop.tst:288 # Input is: IsEmptyDigraph(gr4); # Expected output: false # But found: Error, Variable: 'IsEmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:290 # Input is: gr5 := DigraphByAdjacencyMatrix([[0, 0], [0, 0]]); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/prop.tst:292 # Input is: IsEmptyDigraph(gr5); # Expected output: true # But found: Error, Variable: 'IsEmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:294 # Input is: gr6 := DigraphByEdges([[3, 5], [1, 1], [2, 3], [5, 4]]); # Expected output: # But found: Error, Variable: 'DigraphByEdges' must have a value ######## ########> Diff in standard/prop.tst:296 # Input is: IsEmptyDigraph(gr6); # Expected output: false # But found: Error, Variable: 'IsEmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:300 # Input is: gr := Digraph(rec( DigraphNrVertices := 2, DigraphSource := [1, 1], DigraphRange := [2, 2])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:303 # Input is: IsTournament(gr); # Expected output: false # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:305 # Input is: gr := Digraph([[2], [1], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:307 # Input is: IsTournament(gr); # Expected output: false # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:309 # Input is: gr := Digraph([[2, 3], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:311 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:313 # Input is: IsTournament(gr); # Expected output: true # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:315 # Input is: gr := EmptyDigraph(0);; # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:316 # Input is: IsTournament(gr); # Expected output: true # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:318 # Input is: gr := Digraph([[1], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:320 # Input is: IsTournament(gr); # Expected output: false # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:322 # Input is: gr := EmptyDigraph(1); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:324 # Input is: HasIsTournament(gr); # Expected output: false # But found: Error, Variable: 'HasIsTournament' must have a value ######## ########> Diff in standard/prop.tst:326 # Input is: IsTournament(gr); # Expected output: true # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:328 # Input is: gr := Digraph([[2], [3], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:330 # Input is: IsTournament(gr); # Expected output: true # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:332 # Input is: gr := Digraph([[2], [1], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:334 # Input is: IsTournament(gr); # Expected output: false # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:338 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:340 # Input is: IsStronglyConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:345 # Input is: gr := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:347 # Input is: IsStronglyConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:349 # Input is: IsStronglyConnectedDigraph(multiple); # Expected output: false # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:351 # Input is: IsStronglyConnectedDigraph(grid); # Expected output: false # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:353 # Input is: IsStronglyConnectedDigraph(circuit); # Expected output: false # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:355 # Input is: IsStronglyConnectedDigraph(loop); # Expected output: true # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:360 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:362 # Input is: IsStronglyConnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:364 # Input is: gr := CycleDigraph(10000);; # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:365 # Input is: gr2 := DigraphRemoveEdge(gr, 10000, 1); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/prop.tst:367 # Input is: IsStronglyConnectedDigraph(gr2); # Expected output: false # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:369 # Input is: gr2 := DigraphRemoveEdge(gr, 10000, 1); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/prop.tst:371 # Input is: IsAcyclicDigraph(gr2); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:373 # Input is: IsStronglyConnectedDigraph(gr2); # Expected output: false # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:375 # Input is: gr := Digraph([[2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:377 # Input is: HasIsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:379 # Input is: IsTournament(gr); # Expected output: true # But found: Error, Variable: 'IsTournament' must have a value ######## ########> Diff in standard/prop.tst:381 # Input is: HasIsAcyclicDigraph(gr); # Expected output: false # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:383 # Input is: IsTransitiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:385 # Input is: HasIsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:387 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:389 # Input is: HasIsStronglyConnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'HasIsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:391 # Input is: IsStronglyConnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:398 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:400 # Input is: IsReflexiveDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:405 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:407 # Input is: IsReflexiveDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:412 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:414 # Input is: IsReflexiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:416 # Input is: gr := EmptyDigraph(0); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:418 # Input is: IsReflexiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:420 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:422 # Input is: HasIsAcyclicDigraph(gr) and IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:424 # Input is: IsReflexiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:426 # Input is: HasIsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'HasIsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:428 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:430 # Input is: gr := Digraph([]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:431 # Input is: IsAcyclicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAcyclicDigraph' must have a value ######## ########> Diff in standard/prop.tst:434 # Input is: gr := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:436 # Input is: IsReflexiveDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:439 # Input is: gr := Digraph(adj); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:441 # Input is: IsReflexiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:444 # Input is: gr := DigraphByAdjacencyMatrix(mat); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/prop.tst:446 # Input is: IsReflexiveDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:449 # Input is: gr := DigraphByAdjacencyMatrix(mat); # Expected output: # But found: Error, Variable: 'DigraphByAdjacencyMatrix' must have a value ######## ########> Diff in standard/prop.tst:451 # Input is: IsReflexiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsReflexiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:455 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:457 # Input is: IsCompleteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:459 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:461 # Input is: IsCompleteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:463 # Input is: gr := Digraph([[1, 2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:465 # Input is: IsCompleteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:467 # Input is: gr := Digraph([[1, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:469 # Input is: IsCompleteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:471 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:473 # Input is: IsCompleteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:477 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:479 # Input is: IsConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:481 # Input is: gr := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:483 # Input is: IsConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:485 # Input is: gr := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:487 # Input is: IsConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:489 # Input is: gr := Digraph([[1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:491 # Input is: IsConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:493 # Input is: gr := Digraph([[1], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:495 # Input is: IsStronglyConnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:497 # Input is: IsConnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:499 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:501 # Input is: IsStronglyConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsStronglyConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:503 # Input is: IsConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:505 # Input is: gr := Digraph([[2], [3], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:507 # Input is: IsConnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:509 # Input is: gr := Digraph([[2], [3], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:511 # Input is: IsConnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:515 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:517 # Input is: DigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:519 # Input is: gr := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:521 # Input is: DigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:523 # Input is: gr := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:525 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:527 # Input is: gr := Digraph([[6, 7], [6, 9], [1, 2, 4, 5, 8, 9], [1, 2, 3, 4, 5, 6, 7, 10], [1, 5, 6, 7, 10], [2, 4, 5, 9, 10], [3, 4, 5, 6, 7, 8, 9, 10], [1, 3, 5, 7, 8, 9], [1, 2, 5], [1, 2, 4, 6, 7, 8]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:532 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:534 # Input is: gr := Digraph([[6, 7], [6, 9], [1, 2, 4, 5, 8, 9], [1, 2, 3, 7, 5, 6, 7, 10], [1, 2, 2, 6, 7, 10], [2, 4, 5, 9, 10], [3, 4, 5, 6, 8, 8, 9, 10], [1, 1, 3, 5, 7, 6, 9], [1, 1, 1, 2, 5], [1, 2, 4, 6, 7, 8]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:539 # Input is: DigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:541 # Input is: gr := Digraph(rec(DigraphNrVertices := 0, DigraphSource := [], DigraphRange :=\ [])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:543 # Input is: DigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:545 # Input is: gr := Digraph(rec(DigraphNrVertices := 1, DigraphSource := [], DigraphRange :=\ [])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:547 # Input is: DigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:549 # Input is: gr := Digraph(rec(DigraphNrVertices := 1, DigraphSource := [1], DigraphRange :\ = [1])); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:551 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:561 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:563 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:565 # Input is: gr := Digraph(r);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:566 # Input is: AdjacencyMatrix(gr);; # Expected output: # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/prop.tst:567 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:578 # Input is: gr := Digraph(r); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:580 # Input is: DigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:582 # Input is: gr := Digraph(r);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:583 # Input is: AdjacencyMatrix(gr);; # Expected output: # But found: Error, Variable: 'AdjacencyMatrix' must have a value ######## ########> Diff in standard/prop.tst:584 # Input is: DigraphHasLoops(gr); # Expected output: false # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:588 # Input is: gr := Digraph([[2], [3], [4], [5], [6], [1], [8], [7]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:590 # Input is: IsAperiodicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAperiodicDigraph' must have a value ######## ########> Diff in standard/prop.tst:592 # Input is: gr := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:594 # Input is: IsAperiodicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAperiodicDigraph' must have a value ######## ########> Diff in standard/prop.tst:596 # Input is: gr := Digraph([[2, 2], [3, 3], [1], [5], [4, 4, 4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:598 # Input is: IsAperiodicDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsAperiodicDigraph' must have a value ######## ########> Diff in standard/prop.tst:600 # Input is: gr := Digraph([[2, 2], [3, 3], [4], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:602 # Input is: IsAperiodicDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsAperiodicDigraph' must have a value ######## ########> Diff in standard/prop.tst:606 # Input is: gr := Digraph([[2, 3, 4], [3, 4], [4], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:608 # Input is: IsTransitiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:610 # Input is: gr := Digraph([[2, 3, 4], [3, 4, 1], [4], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:612 # Input is: IsTransitiveDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:614 # Input is: gr := Digraph([[1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:616 # Input is: IsTransitiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:618 # Input is: gr := Digraph([[2, 2], [1, 1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:619 # Input is: IsTransitiveDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:621 # Input is: gr := Digraph([[1, 2, 2], [1, 2]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:622 # Input is: IsTransitiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:624 # Input is: gr := Digraph( [[2, 4, 5, 7], [4, 6, 9, 10, 12, 14], [2, 5, 6, 7, 8], [9], [2, 7, 10, 11, 12], [4, 9, 13, 16, 18, 19, 22, 23, 26, 28, 30], [2, 4, 6, 10], [2, 4, 11], [], [4, 9, 13, 15, 19, 21, 22, 24], [2, 4, 14], [4, 9, 15, 17, 20, 21, 24, 25, 27, 29, 31], [4, 9], [4, 9, 16, 17, 18, 20, 23, 25, 26, 27, 28, 29, 30, 31], [4, 9], [4], [4], [4], [4, 9], [4], [4, 9], [4, 9], [4], [4, 9], [4], [4], [4], [4], [4, 29], [4], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:633 # Input is: IsTransitiveDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:635 # Input is: trans := Digraph([ [2, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [4, 6, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [9], [2, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [4, 9, 13, 16, 18, 19, 22, 23, 26, 28, 30], [2, 4, 6, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [2, 4, 6, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [], [4, 9, 13, 15, 19, 21, 22, 24], [2, 4, 6, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [4, 9, 15, 17, 20, 21, 24, 25, 27, 29, 31], [4, 9], [4, 9, 16, 17, 18, 20, 23, 25, 26, 27, 28, 29, 30, 31], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:661 # Input is: IsTransitiveDigraph(trans); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:663 # Input is: nottrans := Digraph([ [2, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [4, 6, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [9], [2, 4, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [4, 9, 13, 16, 18, 19, 22, 23, 26, 28, 30], [2, 4, 6, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [2, 4, 6, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [], [4, 9, 13, 15, 19, 21, 22, 24], [2, 4, 6, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], [4, 9, 15, 17, 20, 21, 24, 25, 27, 29, 31], [4, 9], [4, 9, 16, 17, 18, 20, 23, 20, 25, 26, 27, 28, 29, 30, 31], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9], [4, 9]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:689 # Input is: IsTransitiveDigraph(nottrans); # Expected output: false # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:691 # Input is: gr := Digraph([[2, 3, 3], [3, 3], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:692 # Input is: IsTransitiveDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsTransitiveDigraph' must have a value ######## ########> Diff in standard/prop.tst:694 # Input is: IS_TRANSITIVE_DIGRAPH(gr); # Expected output: true # But found: Error, Variable: 'IS_TRANSITIVE_DIGRAPH' must have a value ######## ########> Diff in standard/prop.tst:698 # Input is: gr := Digraph([[2, 4], [], [1], [1], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:700 # Input is: IsBipartiteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:702 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:704 # Input is: IsBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:706 # Input is: gr := CycleDigraph(89); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:708 # Input is: IsBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:710 # Input is: gr := CycleDigraph(314); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:712 # Input is: IsBipartiteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:714 # Input is: gr := CompleteDigraph(4); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:716 # Input is: IsBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:718 # Input is: gr := Digraph([[2, 4], [], [1], [1], [4], [7], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:720 # Input is: IsBipartiteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:722 # Input is: gr := Digraph([[2], [3], [1], [6], [6], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:724 # Input is: IsBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:726 # Input is: gr := Digraph([[1], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:728 # Input is: IsBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:730 # Input is: gr := Digraph([[3], [2], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:732 # Input is: IsBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:734 # Input is: gr := Digraph([[3], [3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:736 # Input is: IsBipartiteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:738 # Input is: gr := Digraph([[2, 3, 4], [5, 6], [], [7], [], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:740 # Input is: IsBipartiteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:742 # Input is: gr := Digraph([[2, 3, 4], [5, 6], [], [7], [], [], [], [9], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:744 # Input is: IsBipartiteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:746 # Input is: gr := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:748 # Input is: DigraphHasLoops(gr); # Expected output: true # But found: Error, Variable: 'DigraphHasLoops' must have a value ######## ########> Diff in standard/prop.tst:750 # Input is: IsBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:752 # Input is: D := Digraph([[4, 6, 8], [], [], [], [7], [2], [], [], [8], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:754 # Input is: IsBipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:758 # Input is: gr := Digraph([[1, 2, 3, 4], [], [], []]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:759 # Input is: IsInRegularDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsInRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:761 # Input is: IsOutRegularDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsOutRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:763 # Input is: gr := CompleteDigraph(4);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:764 # Input is: IsInRegularDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsInRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:766 # Input is: IsOutRegularDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsOutRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:768 # Input is: gr := CompleteDigraph(4);; # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:769 # Input is: IsRegularDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:773 # Input is: gr := DigraphSymmetricClosure(ChainDigraph(5));; # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/prop.tst:774 # Input is: IsDistanceRegularDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:776 # Input is: gr := Digraph([[2, 3, 4], [1, 3, 4], [1, 2, 4], [1, 2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:777 # Input is: IsDistanceRegularDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:779 # Input is: gr := CompleteBipartiteDigraph(3, 3);; # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:780 # Input is: IsDistanceRegularDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:782 # Input is: gr := DigraphFromGraph6String("MhEGHC@AI?_PC@_G_"); # Expected output: # But found: Error, Variable: 'DigraphFromGraph6String' must have a value ######## ########> Diff in standard/prop.tst:784 # Input is: IsDistanceRegularDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:786 # Input is: IsDistanceRegularDigraph(ChainDigraph(5)); # Expected output: false # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:788 # Input is: IsDistanceRegularDigraph(EmptyDigraph(2)); # Expected output: true # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:790 # Input is: gr := Digraph([[2], [1], [4], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:792 # Input is: IsDistanceRegularDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:794 # Input is: gr := Digraph([[2], [1, 3], [2, 4], [3, 5, 6], [4, 6], [4, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:796 # Input is: IsDistanceRegularDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:798 # Input is: gr := CompleteBipartiteDigraph(3, 4); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:800 # Input is: IsDistanceRegularDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:802 # Input is: gr := Digraph([[], [3], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:804 # Input is: IsDistanceRegularDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsDistanceRegularDigraph' must have a value ######## ########> Diff in standard/prop.tst:808 # Input is: gr := CompleteBipartiteDigraph(4, 5); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:810 # Input is: IsCompleteBipartiteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsCompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:812 # Input is: gr := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:814 # Input is: IsCompleteBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsCompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:816 # Input is: gr := CycleDigraph(3); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:818 # Input is: IsCompleteBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsCompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:820 # Input is: gr := CycleDigraph(4); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:822 # Input is: IsCompleteBipartiteDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsCompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:824 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:826 # Input is: IsCompleteBipartiteDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsCompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:830 # Input is: D := CompleteMultipartiteDigraph([5, 3, 3, 2, 7]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:832 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:834 # Input is: D := Digraph(OutNeighbours(D)); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:836 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:838 # Input is: IsCompleteMultipartiteDigraph(EmptyDigraph(5)); # empty # Expected output: false # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:840 # Input is: D := Digraph([[2, 2], [1]]); # multidigraph # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:842 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: false # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:844 # Input is: D := Digraph([[1, 2], [1]]); # has loops # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:846 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: false # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:848 # Input is: D := Digraph([[2], []]); # not symmetric # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:850 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: false # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:852 # Input is: D := Digraph(IsImmutableDigraph, [[2], [1]]); # complete bipartite digraph # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:854 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:856 # Input is: HasIsCompleteBipartiteDigraph(D) and IsCompleteBipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'HasIsCompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:858 # Input is: D := CompleteDigraph(5); # complete digraph # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:860 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:862 # Input is: D := Digraph(OutNeighbours(D));; # complete digraph created differently # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:863 # Input is: IsCompleteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsCompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:865 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:867 # Input is: D := DigraphEdgeUnion(CycleDigraph(IsMutableDigraph, 4), DigraphReverse(CycleDigraph(IsMutableDigraph, 4))); # Expected output: # But found: Error, Variable: 'DigraphEdgeUnion' must have a value ######## ########> Diff in standard/prop.tst:870 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:872 # Input is: IsCompleteBipartiteDigraph(D); # Expected output: true # But found: Error, Variable: 'IsCompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:874 # Input is: DigraphRemoveEdges(D, [[1, 2], [2, 1]]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdges' must have a value ######## ########> Diff in standard/prop.tst:876 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: false # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:878 # Input is: D := Digraph(IsImmutableDigraph, [[2], [1, 3], [2, 4], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:880 # Input is: IsCompleteMultipartiteDigraph(D); # Expected output: false # But found: Error, Variable: 'IsCompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:884 # Input is: g := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:886 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:888 # Input is: g := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:890 # Input is: IsDirectedTree(g); # Expected output: true # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:892 # Input is: g := Digraph([[], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:894 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:896 # Input is: g := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:898 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:900 # Input is: g := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:902 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:904 # Input is: g := Digraph([[], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:906 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:908 # Input is: g := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:910 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:912 # Input is: g := Digraph([[3], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:914 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:916 # Input is: g := Digraph([[2], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:918 # Input is: IsDirectedTree(g); # Expected output: true # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:920 # Input is: g := Digraph([[2], [3], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:922 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:924 # Input is: g := Digraph([[2, 3], [6], [4, 5], [], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:926 # Input is: IsDirectedTree(g); # Expected output: true # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:928 # Input is: g := Digraph([[2, 3], [6], [4, 5], [], [], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:930 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:932 # Input is: g := Digraph([[2, 3], [6], [4, 5], [7], [], [7], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:934 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:936 # Input is: g := Digraph([[2, 3], [1, 3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:938 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:940 # Input is: g := Digraph([[2, 3, 4], [1, 3, 4], [1, 2, 4], [1, 2, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:942 # Input is: IsDirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsDirectedTree' must have a value ######## ########> Diff in standard/prop.tst:946 # Input is: g := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:948 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:950 # Input is: g := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:952 # Input is: IsUndirectedTree(g); # Expected output: true # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:954 # Input is: g := Digraph([[], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:956 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:958 # Input is: g := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:960 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:962 # Input is: g := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:964 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:966 # Input is: g := Digraph([[], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:968 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:970 # Input is: g := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:972 # Input is: IsUndirectedTree(g); # Expected output: true # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:974 # Input is: g := Digraph([[3], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:976 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:978 # Input is: g := Digraph([[3], [3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:980 # Input is: IsUndirectedTree(g); # Expected output: true # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:982 # Input is: g := Digraph([[3], [3], [1, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:984 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:986 # Input is: g := Digraph([[2, 3], [6], [4, 5], [], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:988 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:990 # Input is: g := Digraph([[2, 3], [6, 1], [4, 5, 1], [3], [3], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:992 # Input is: IsUndirectedTree(g); # Expected output: true # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:994 # Input is: g := Digraph([[2, 3], [1, 3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:996 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:998 # Input is: g := Digraph([[2, 3, 4], [1, 3, 4], [1, 2, 4], [1, 2, 3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1000 # Input is: IsUndirectedTree(g); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:1002 # Input is: g := Digraph([[1], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1004 # Input is: IsConnectedDigraph(g); # Expected output: false # But found: Error, Variable: 'IsConnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1008 # Input is: gr := ChainDigraph(10); # Expected output: # But found: Error, Variable: 'ChainDigraph' must have a value ######## ########> Diff in standard/prop.tst:1010 # Input is: IsUndirectedForest(gr); # Expected output: false # But found: Error, Variable: 'IsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1012 # Input is: gr := EmptyDigraph(0); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:1014 # Input is: IsUndirectedForest(gr); # Expected output: false # But found: Error, Variable: 'IsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1016 # Input is: gr := EmptyDigraph(1); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:1018 # Input is: IsUndirectedForest(gr); # Expected output: true # But found: Error, Variable: 'IsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1020 # Input is: gr := Digraph([[1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1022 # Input is: IsUndirectedForest(gr); # Expected output: false # But found: Error, Variable: 'IsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1024 # Input is: gr := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1026 # Input is: IsUndirectedForest(gr); # Expected output: false # But found: Error, Variable: 'IsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1028 # Input is: gr := DigraphSymmetricClosure(ChainDigraph(4)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/prop.tst:1030 # Input is: HasIsUndirectedTree(gr) or HasIsUndirectedForest(gr); # Expected output: false # But found: Error, Variable: 'HasIsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:1032 # Input is: IsUndirectedTree(gr); # Expected output: true # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:1034 # Input is: HasIsUndirectedForest(gr); # Expected output: true # But found: Error, Variable: 'HasIsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1036 # Input is: IsUndirectedForest(gr); # Expected output: true # But found: Error, Variable: 'IsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1038 # Input is: gr := DigraphDisjointUnion(gr, gr, gr); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/prop.tst:1040 # Input is: IsUndirectedTree(gr); # Expected output: false # But found: Error, Variable: 'IsUndirectedTree' must have a value ######## ########> Diff in standard/prop.tst:1042 # Input is: IsUndirectedForest(gr); # Expected output: true # But found: Error, Variable: 'IsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1044 # Input is: gr := DigraphDisjointUnion(CompleteDigraph(2), CycleDigraph(3)); # Expected output: # But found: Error, Variable: 'DigraphDisjointUnion' must have a value ######## ########> Diff in standard/prop.tst:1046 # Input is: IsUndirectedForest(gr); # Expected output: false # But found: Error, Variable: 'IsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1048 # Input is: gr := Digraph(IsMutableDigraph, [[2], [1, 3], [2], [5], [4, 6], [5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1050 # Input is: IsUndirectedForest(gr); # Expected output: true # But found: Error, Variable: 'IsUndirectedForest' must have a value ######## ########> Diff in standard/prop.tst:1054 # Input is: g := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1056 # Input is: IsEulerianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1058 # Input is: g := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1060 # Input is: IsEulerianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1062 # Input is: g := Digraph([[], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1064 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1066 # Input is: g := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1068 # Input is: IsEulerianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1070 # Input is: g := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1072 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1074 # Input is: g := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1076 # Input is: IsEulerianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1078 # Input is: g := Digraph([[3], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1080 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1082 # Input is: g := Digraph([[3], [3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1084 # Input is: IsEulerianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1086 # Input is: g := Digraph([[3], [], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1088 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1090 # Input is: g := Digraph([[2], [3], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1092 # Input is: IsEulerianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1094 # Input is: g := Digraph([[2], [3], [1], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1096 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1098 # Input is: g := Digraph([[2], [3], [1, 4], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1100 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1102 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1104 # Input is: IsEulerianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1106 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1108 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1110 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4, 7], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1112 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1114 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4, 7], [6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1116 # Input is: IsEulerianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1118 # Input is: g := Digraph([[2, 3], [3], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1120 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1122 # Input is: g := EmptyDigraph(IsMutableDigraph, 10); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:1124 # Input is: IsEulerianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsEulerianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1126 # Input is: g; # Expected output: # But found: Error, Variable: 'g' must have a value ######## ########> Diff in standard/prop.tst:1130 # Input is: gr := Digraph([[1, 2], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1132 # Input is: IsMeetSemilatticeDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsMeetSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1134 # Input is: IsJoinSemilatticeDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsJoinSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1136 # Input is: IsLatticeDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsLatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1138 # Input is: gr := CycleDigraph(5); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:1140 # Input is: IsMeetSemilatticeDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsMeetSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1142 # Input is: IsJoinSemilatticeDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsJoinSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1146 # Input is: gr := DigraphFromDiSparse6String(".HiR@AeNcC?oD?G`oAGXIoAGXAe_COqDK^F"); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/prop.tst:1148 # Input is: IsMeetSemilatticeDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsMeetSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1150 # Input is: IsJoinSemilatticeDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsJoinSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1152 # Input is: IsLatticeDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsLatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1154 # Input is: gr := DigraphReverse(gr); # Expected output: # But found: Error, Variable: 'DigraphReverse' must have a value ######## ########> Diff in standard/prop.tst:1156 # Input is: IsMeetSemilatticeDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsMeetSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1158 # Input is: IsJoinSemilatticeDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsJoinSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1160 # Input is: IsLatticeDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsLatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1164 # Input is: gr := NullDigraph(5); # Expected output: # But found: Error, Variable: 'NullDigraph' must have a value ######## ########> Diff in standard/prop.tst:1166 # Input is: IsPartialOrderDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsPartialOrderDigraph' must have a value ######## ########> Diff in standard/prop.tst:1168 # Input is: gr := Digraph([[1], [2], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1170 # Input is: IsPartialOrderDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsPartialOrderDigraph' must have a value ######## ########> Diff in standard/prop.tst:1174 # Input is: gr := DigraphFromDiSparse6String(Concatenation( ".~?CI_A?WA_M@G@_G@gB?]@?G_SAWA?Y@oJ__BGH?uA_M_IAoO_oCWL@IB_R_{DGB?mB?U_sDwM@"\ , "aBoX_KCGP@WEwQ@[FGR@_FWS@cFgT@gFwB@A?oO_KCGZACGwZAGGw[AUFOcAYF_f`{IG_Ae@?U`["\ , "IwWAqEOl`gJgC@mF?jBAFOkBEF_lBIFomBMG?nBQ@?ZAE@?ZAI@?ZAMH?oBWMGdB?LowaWKOya[K"\ , "_xBmI?rBqIOsBuI_tBy@?`AMH?uCA@?aaOHOuB[OgCAIHOvCQ@?baOM@?CYMP@C]HOwCYMOyCKPp"\ , "HbgPPHbkQw{CgRG|C_RW}CyNpN_SIwkDEJPQawSwnDQ@OobCSPUbGS`VbKSpWbOT@XbSTPY_SK?u"\ , "_SK?v_SK?wbcT`[DyM`UDsVgzD[WG{D_Vp`bsUPabwU`bb{Upc_SL`?bcOP[EY@OvCIMOyCKV@\\"\ , "Ea@OvCQM`DDsYgDB_PgxC[V`kc_VpfEuM`HDwZHID{W@hEsZxJE?YpncoWPpcsW`oFIR`bEw[xNE"\ , "O\\HOES\\WDC?Ph@C[X`vc_Xpw_SOhBEWY@yc_Q`fEc]wDCQH@DE_Y`|cgQphEk^gDCQPPiGAQpj"\ , "GE@PEc[Z@vGMQ@lF_`HmFc`XHEo_xIEsZqCG]Z`oFo`QGckZqFf?[P~G_ahpGGahqGq[qJGu\\AH"\ , "Gy\\QEG}\\aO_G@gF@?cgGAKcwHCWdGIGKdWA_KCAV`CeGQACeWRAOegSC[ewTGOfG`AGeGBH]Ga"\ , "WH}@?bHaH?dC?Oa]IEHQ_IEHaba[gaca_OQdacQAeag`QfcCOqa_OeA^aCO`CI?ihBCSgabIm@A^"\ , "cOgAlcSgqm_SPa`c[QPvFggaoc_Q`wFkiQpccgqocgQqkJCkxJI{kxKJURQsJYRaqJ]RpxJaSAEJ"\ , "e?qQaGcqzaSdA{ccdQ|g[da}hcigQCGoHBHkoXIHooiGHsoy^i?ialKU@Q`IiH@yFsgqjK]grEK]"\ , "hBHa[oRGKiI@zISobJfohrKgciBL_OmxCJorxDJssHJJwsYIJ{sgDIgjZ?LQC`|LU^aZKCth~KKt"\ , "yJKOuGDK}_BOLi_RPLm_bQLqbBRLu@gPHKvweJswHKLGwYLLwwgDIuCaVMAHqZH{wRdcsjRBMGxi"\ , "MLcwrcM]GP|G?jbELQ_AmMQjRDkWtBcMmxBja_fa_KSxhMI[iqmKWxrjMybrMM_yRiMozRncC]p}"\ , "IoqH}GCganMeOamKYOqnK_qRhNMjbEMmO`|MgzBtmgzRti{qRkNUyzkMs|Rxms}XNIcjAnM{{rtN"\ , "e_QnMg|YOJg{BpNG|BuN[}ByNk~B|fc^Aqfo^qqJO{XzNG|H~GGlAtNG|H}K_|bwNu^RvNi_atN_"\ , "~ZvN_}b|n[}bznmcR}N|?C@OH?sCOT@cFObAiQ@ECgR`QDWaaSOgea]IGhaiOxCcUQPycg]xJcqR"\ , "XMc}SH{fsgx}f}_I@gI`yGgeaiJgqbYMg}cIPheeiZhqfYciUhifiajinjMlItjYlywjemj?kEoj"\ , "BkQqZIkmrJLkytZUl]uJXmkyjrNI}Rv")); # Expected output: # But found: Error, Variable: 'DigraphFromDiSparse6String' must have a value ######## ########> Diff in standard/prop.tst:1197 # Input is: gr := DigraphReflexiveTransitiveClosure(gr); # Expected output: # But found: Error, Variable: 'DigraphReflexiveTransitiveClosure' must have a value ######## ########> Diff in standard/prop.tst:1199 # Input is: IsPartialOrderDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsPartialOrderDigraph' must have a value ######## ########> Diff in standard/prop.tst:1201 # Input is: IsMeetSemilatticeDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsMeetSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1203 # Input is: IsJoinSemilatticeDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsJoinSemilatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1205 # Input is: IsLatticeDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsLatticeDigraph' must have a value ######## ########> Diff in standard/prop.tst:1209 # Input is: IsCycleDigraph(NullDigraph(10)); # Expected output: false # But found: Error, Variable: 'IsCycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:1211 # Input is: IsCycleDigraph(CycleDigraph(10)); # Expected output: true # But found: Error, Variable: 'IsCycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:1213 # Input is: IsCycleDigraph(NullDigraph(0)); # Expected output: false # But found: Error, Variable: 'IsCycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:1215 # Input is: IsCycleDigraph(NullDigraph(1)); # Expected output: false # But found: Error, Variable: 'IsCycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:1217 # Input is: IsCycleDigraph(CycleDigraph(1)); # Expected output: true # But found: Error, Variable: 'IsCycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:1221 # Input is: gr := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1223 # Input is: IsBiconnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1225 # Input is: gr := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1227 # Input is: IsBiconnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1229 # Input is: gr := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1231 # Input is: IsBiconnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1233 # Input is: gr := Digraph([[1, 1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1235 # Input is: IsBiconnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1237 # Input is: gr := Digraph([[1], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1239 # Input is: IsBiconnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1241 # Input is: gr := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1243 # Input is: IsBiconnectedDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1245 # Input is: gr := Digraph([[2], [3], [], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1247 # Input is: IsBiconnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1249 # Input is: gr := Digraph([[2], [3], [], [3]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1251 # Input is: IsBiconnectedDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1253 # Input is: IsBiconnectedDigraph(DigraphFromGraph6String("FlCX?")); # Expected output: false # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1255 # Input is: IsBiconnectedDigraph(Digraph([[2, 4, 5], [1, 4], [4, 7], [1, 2, 3, 5, 6, 7], [1, 4], [4, 7], [3, 4, 6]])); # Expected output: false # But found: Error, Variable: 'IsBiconnectedDigraph' must have a value ######## ########> Diff in standard/prop.tst:1260 # Input is: g := Digraph([]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1262 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1264 # Input is: g := Digraph([[]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1266 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1268 # Input is: g := Digraph([[], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1270 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1272 # Input is: g := Digraph([[1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1274 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1276 # Input is: g := Digraph([[2, 2], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1278 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1280 # Input is: g := Digraph([[2], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1282 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1284 # Input is: g := Digraph([[3], [3], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1286 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1288 # Input is: g := Digraph([[3], [3], [1, 2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1290 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1292 # Input is: g := Digraph([[3], [], [2]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1294 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1296 # Input is: g := Digraph([[2], [3], [1]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1298 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1300 # Input is: g := Digraph([[2], [3], [1], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1302 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1304 # Input is: g := Digraph([[2], [3], [1, 4], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1306 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1308 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1310 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1312 # Input is: g := Digraph([[3, 6], [4, 1], [2, 1], [5, 1], [3], [4]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1314 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1316 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4, 7], []]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1318 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1320 # Input is: g := Digraph([[3, 6, 7], [4, 1], [2, 1], [5, 1], [3], [4, 7], [6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1322 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1324 # Input is: g := Digraph([[3, 6], [4], [2, 1], [5, 1], [3], [4, 7], [6]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1326 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1328 # Input is: g := Digraph([[5, 6, 10], [2, 9], [3, 7], [2, 3], [9, 10], [2, 9], [1], [2, 3, 4, 7, 9], [3, 10], [4, 5, 6, 8]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1331 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1333 # Input is: g := Digraph([[2, 4, 6, 10], [1, 3, 4, 5, 6, 7, 9, 10], [1, 5, 7, 8], [6, 10], [1, 7], [3, 4, 6, 7, 9], [2, 3, 4, 7], [2, 4, 5, 6], [2, 3, 5, 6, 7, 9, 10], [2, 3, 5]]); # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1337 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1339 # Input is: g := CompleteMultipartiteDigraph([1, 30]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1341 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1343 # Input is: g := CompleteMultipartiteDigraph([16, 15]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1345 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1347 # Input is: g := CompleteMultipartiteDigraph([1, 1, 2, 3, 5, 8, 13, 21]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1349 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1351 # Input is: g := CompleteMultipartiteDigraph([1, 1, 2, 3, 5, 8, 13, 21, 34]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1353 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1355 # Input is: g := CompleteBipartiteDigraph(50, 50); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1357 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1359 # Input is: g := CompleteMultipartiteDigraph([1, 15, 1, 1, 1, 1, 1, 1]); # Expected output: # But found: Error, Variable: 'CompleteMultipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1361 # Input is: IsHamiltonianDigraph(g); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1363 # Input is: g := CompleteDigraph(50); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1365 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1367 # Input is: g := CycleDigraph(1000000); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:1369 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1371 # Input is: g := CompleteDigraph(100); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1373 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1375 # Input is: g := CycleDigraph(513); # Expected output: # But found: Error, Variable: 'CycleDigraph' must have a value ######## ########> Diff in standard/prop.tst:1377 # Input is: g := DigraphAddEdges(g, [[6, 8], [8, 7], [7, 9]]); # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/prop.tst:1379 # Input is: g := DigraphRemoveEdge(g, [6, 7]); # Expected output: # But found: Error, Variable: 'DigraphRemoveEdge' must have a value ######## ########> Diff in standard/prop.tst:1381 # Input is: IsHamiltonianDigraph(g); # Expected output: true # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1383 # Input is: gr := DigraphAddEdges(DigraphAddVertex(CycleDigraph(600)), [[600, 601], [601, 600]]); # Expected output: # But found: Error, Variable: 'DigraphAddEdges' must have a value ######## ########> Diff in standard/prop.tst:1386 # Input is: HamiltonianPath(gr); # Expected output: fail # But found: Error, Variable: 'HamiltonianPath' must have a value ######## ########> Diff in standard/prop.tst:1388 # Input is: IsHamiltonianDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsHamiltonianDigraph' must have a value ######## ########> Diff in standard/prop.tst:1390 # Input is: gr := Digraph([[2, 2], [1, 1]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1391 # Input is: IsMultiDigraph(gr) and IsHamiltonianDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsMultiDigraph' must have a value ######## ########> Diff in standard/prop.tst:1395 # Input is: D := CompleteDigraph(10); # Expected output: # But found: Error, Variable: 'CompleteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1397 # Input is: IsDigraphCore(D); # Expected output: true # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/prop.tst:1399 # Input is: D := JohnsonDigraph(8, 3); # Expected output: # But found: Error, Variable: 'JohnsonDigraph' must have a value ######## ########> Diff in standard/prop.tst:1401 # Input is: IsDigraphCore(D); # Expected output: true # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/prop.tst:1403 # Input is: D := CompleteBipartiteDigraph(500, 500); # Expected output: # But found: Error, Variable: 'CompleteBipartiteDigraph' must have a value ######## ########> Diff in standard/prop.tst:1405 # Input is: IsDigraphCore(D); # Expected output: false # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/prop.tst:1407 # Input is: D := PetersenGraph(); # Expected output: # But found: Error, Variable: 'PetersenGraph' must have a value ######## ########> Diff in standard/prop.tst:1409 # Input is: IsDigraphCore(D); # Expected output: true # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/prop.tst:1411 # Input is: D := DigraphSymmetricClosure(CycleDigraph(IsMutableDigraph, 40)); # Expected output: # But found: Error, Variable: 'DigraphSymmetricClosure' must have a value ######## ########> Diff in standard/prop.tst:1413 # Input is: IsDigraphCore(D); # Expected output: false # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/prop.tst:1415 # Input is: D; # Expected output: # But found: Error, Variable: 'D' must have a value ######## ########> Diff in standard/prop.tst:1417 # Input is: D := EmptyDigraph(100000); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:1419 # Input is: IsDigraphCore(D); # Expected output: false # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/prop.tst:1421 # Input is: D := EmptyDigraph(0); # Expected output: # But found: Error, Variable: 'EmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:1423 # Input is: IsDigraphCore(D); # Expected output: true # But found: Error, Variable: 'IsDigraphCore' must have a value ######## ########> Diff in standard/prop.tst:1427 # Input is: gr := Digraph([[1], [1, 2], [1, 3], [1, 4], [1 .. 5], [1 .. 6], [1, 2, 3, 4, 5, 7], [1, 8]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1429 # Input is: IsPreorderDigraph(gr) and IsQuasiorderDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsPreorderDigraph' must have a value ######## ########> Diff in standard/prop.tst:1433 # Input is: gr := DigraphFromDigraph6String(gr);; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/prop.tst:1434 # Input is: IsPreorderDigraph(gr) and IsQuasiorderDigraph(gr); # Expected output: true # But found: Error, Variable: 'IsPreorderDigraph' must have a value ######## ########> Diff in standard/prop.tst:1439 # Input is: gr := DigraphFromDigraph6String(gr);; # Expected output: # But found: Error, Variable: 'DigraphFromDigraph6String' must have a value ######## ########> Diff in standard/prop.tst:1440 # Input is: IsPreorderDigraph(gr) or IsQuasiorderDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsPreorderDigraph' must have a value ######## ########> Diff in standard/prop.tst:1442 # Input is: gr := Digraph([[], [2], [1, 2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1443 # Input is: IsPreorderDigraph(gr) or IsQuasiorderDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsPreorderDigraph' must have a value ######## ########> Diff in standard/prop.tst:1445 # Input is: gr := Digraph([[1], [1, 2], [2, 3]]);; # Expected output: # But found: Error, Variable: 'Digraph' must have a value ######## ########> Diff in standard/prop.tst:1446 # Input is: IsPreorderDigraph(gr) or IsQuasiorderDigraph(gr); # Expected output: false # But found: Error, Variable: 'IsPreorderDigraph' must have a value ######## ########> Diff in standard/prop.tst:1450 # Input is: D := DigraphCopy(NullDigraph(4)); # Expected output: # But found: Error, Variable: 'DigraphCopy' must have a value ######## ########> Diff in standard/prop.tst:1452 # Input is: HasIsNullDigraph(D) and IsNullDigraph(D); # Expected output: true # But found: Error, Variable: 'HasIsNullDigraph' must have a value ######## ########> Diff in standard/prop.tst:1454 # Input is: HasIsEmptyDigraph(D) and IsEmptyDigraph(D); # Expected output: true # But found: Error, Variable: 'HasIsEmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:1456 # Input is: HasDigraphNrEdges(D); # Expected output: true # But found: Error, Variable: 'HasDigraphNrEdges' must have a value ######## ########> Diff in standard/prop.tst:1458 # Input is: IsEmptyDigraph(D); # Expected output: true # But found: Error, Variable: 'IsEmptyDigraph' must have a value ######## ########> Diff in standard/prop.tst:1462 # Input is: IsVertexTransitive(Digraph([])); # Expected output: true # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/prop.tst:1464 # Input is: IsVertexTransitive(Digraph([[1], [2]])); # Expected output: true # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/prop.tst:1466 # Input is: IsVertexTransitive(Digraph([[2], [3], []])); # Expected output: false # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/prop.tst:1468 # Input is: IsVertexTransitive(CompleteDigraph(20)); # Expected output: true # But found: Error, Variable: 'IsVertexTransitive' must have a value ######## ########> Diff in standard/prop.tst:1472 # Input is: IsEdgeTransitive(Digraph([])); # Expected output: true # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/prop.tst:1474 # Input is: IsEdgeTransitive(Digraph([[1], [2]])); # Expected output: true # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/prop.tst:1476 # Input is: IsEdgeTransitive(Digraph([[2], [3], []])); # Expected output: false # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/prop.tst:1478 # Input is: IsEdgeTransitive(CompleteDigraph(20)); # Expected output: true # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/prop.tst:1480 # Input is: IsEdgeTransitive(Digraph([[2], [3, 3, 3], []])); # Expected output: Error, the argument must be a digraph with no multiple edges, # But found: Error, Variable: 'IsEdgeTransitive' must have a value ######## ########> Diff in standard/prop.tst:1514 # Input is: DIGRAPHS_StopTest(); # Expected output: # But found: Error, Variable: 'DIGRAPHS_StopTest' must have a value ######## Digraphs package: standard/prop.tst msecs: 1067 false gap> gap> RPM build errors: error: Bad exit status from /var/tmp/rpm-tmp.saif8L (%check) Bad exit status from /var/tmp/rpm-tmp.saif8L (%check) Child return code was: 1 EXCEPTION: [Error()] Traceback (most recent call last): File "/usr/lib/python3.8/site-packages/mockbuild/trace_decorator.py", line 95, in trace result = func(*args, **kw) File "/usr/lib/python3.8/site-packages/mockbuild/util.py", line 746, in do_with_status raise exception.Error("Command failed: \n # %s\n%s" % (command, output), child.returncode) mockbuild.exception.Error: Command failed: # bash --login -c /usr/bin/rpmbuild -bb --target riscv64 --nodeps /builddir/build/SPECS/gap-pkg-digraphs.spec