< (for digraphs) 4.1 = (for digraphs) 4.1 AdjacencyMatrix 5.2-1 AdjacencyMatrixMutableCopy 5.2-1 AdjacencyMatrixUpperTriangleLineDecoder 9.2-10 ArticulationPoints 5.3-14 AsBinaryRelation 3.2-1 AsDigraph 3.2-2 AsGraph 3.2-4 AsMonoid 5.5-1 AsSemigroup, for a filter and a digraph 5.5-1 AsTransformation 3.2-5 AutomorphismGroup, for a digraph 7.2-2 BipartiteDoubleDigraph 3.3-37 BlissAutomorphismGroup, for a digraph 7.2-3 BlissCanonicalDigraph 7.2-9 BlissCanonicalLabelling, for a digraph 7.2-7 BooleanAdjacencyMatrix 5.2-3 BooleanAdjacencyMatrixMutableCopy 5.2-3 Bridges 5.3-15 CayleyDigraph 3.1-12 ChainDigraph 3.5-1 CharacteristicPolynomial 5.2-2 ChromaticNumber 7.3-17 CliqueNumber 8.1-5 CliquesFinder 8.1-2 CompleteBipartiteDigraph 3.5-3 CompleteDigraph 3.5-2 CompleteMultipartiteDigraph 3.5-4 CycleDigraph 3.5-5 DegreeMatrix 5.2-16 Digraph 3.1-7 Digraph6String 9.2-3 DigraphAddAllLoops 3.3-38 DigraphAddAllLoopsAttr 3.3-38 DigraphAddEdge, for a digraph and an edge 3.3-16 DigraphAddEdgeOrbit 3.3-17 DigraphAddEdges 3.3-18 DigraphAddVertex 3.3-14 DigraphAddVertices, for a digraph and a list of labels 3.3-15 DigraphAdjacencyFunction 5.2-4 DigraphAllSimpleCircuits 5.3-23 DigraphBicomponents 5.3-13 DigraphByAdjacencyMatrix 3.1-8 DigraphByEdges 3.1-9 DigraphByInNeighbors 3.1-11 DigraphByInNeighbours 3.1-11 DigraphByOutNeighboursType 3.1-6 DigraphCartesianProduct, for a list of digraphs 3.3-30 DigraphCartesianProductProjections 3.3-32 DigraphClique 8.1-3 DigraphCliques 8.1-4 DigraphCliquesReps 8.1-4 DigraphClosure 3.3-40 DigraphColouring, for a digraph and a number of colours 7.3-14 DigraphConnectedComponent 5.3-10 DigraphConnectedComponents 5.3-9 DigraphCopy 3.3-1 DigraphCopySameMutability 3.3-1 DigraphCore 7.3-18 DigraphDegeneracy 5.3-26 DigraphDegeneracyOrdering 5.3-27 DigraphDiameter 5.3-1 DigraphDijkstra, for a source 5.3-30 DigraphDirectProduct, for a list of digraphs 3.3-31 DigraphDirectProductProjections 3.3-33 DigraphDisjointUnion, for a list of digraphs 3.3-27 DigraphDistanceSet, for a digraph, a pos int, and a list 5.3-5 DigraphDual 3.3-10 DigraphDualAttr 3.3-10 DigraphEdgeLabel 5.1-10 DigraphEdgeLabels 5.1-11 DigraphEdges 5.1-3 DigraphEdgeUnion, for a list of digraphs 3.3-28 DigraphEmbedding 7.3-8 DigraphEpimorphism 7.3-6 DigraphFamily 3.1-6 DigraphFile 9.2-4 DigraphFloydWarshall 5.3-18 DigraphFromDigraph6String 9.2-2 DigraphFromDiSparse6String 9.2-2 DigraphFromGraph6String 9.2-2 DigraphFromPlainTextString 9.2-12 DigraphFromSparse6String 9.2-2 DigraphGirth 5.3-6 DigraphGreedyColouring, for a digraph 7.3-15 DigraphGroup 7.2-10 DigraphHasLoops 6.1-1 DigraphHomomorphism 7.3-2 DigraphImmutableCopy 3.3-1 DigraphImmutableCopyIfImmutable 3.3-2 DigraphImmutableCopyIfMutable 3.3-2 DigraphIndependentSet 8.2-2 DigraphIndependentSets 8.2-3 DigraphIndependentSetsReps 8.2-3 DigraphInEdges 5.1-12 DigraphJoin, for a list of digraphs 3.3-29 DigraphLayers 5.3-25 DigraphLongestDistanceFromVertex 5.3-4 DigraphLongestSimpleCircuit 5.3-24 DigraphLoops 5.2-14 DigraphMaximalClique 8.1-3 DigraphMaximalCliques 8.1-4 DigraphMaximalCliquesAttr 8.1-4 DigraphMaximalCliquesReps 8.1-4 DigraphMaximalCliquesRepsAttr 8.1-4 DigraphMaximalIndependentSet 8.2-2 DigraphMaximalIndependentSets 8.2-3 DigraphMaximalIndependentSetsAttr 8.2-3 DigraphMaximalIndependentSetsReps 8.2-3 DigraphMaximalIndependentSetsRepsAttr 8.2-3 DigraphMaximalMatching 5.1-16 DigraphMaximumMatching 5.1-17 DigraphMonomorphism 7.3-4 DigraphMutableCopy 3.3-1 DigraphMutableCopyIfImmutable 3.3-2 DigraphMutableCopyIfMutable 3.3-2 DigraphMycielskian 3.3-41 DigraphMycielskianAttr 3.3-41 DigraphNrConnectedComponents 5.3-9 DigraphNrEdges 5.1-4 DigraphNrStronglyConnectedComponents 5.3-11 DigraphNrVertices 5.1-2 DigraphOddGirth 5.3-7 DigraphOrbitReps 7.2-12 DigraphOrbits 7.2-11 DigraphOutEdges 5.1-13 DigraphPath 5.3-20 DigraphPeriod 5.3-17 DigraphPlainTextLineDecoder 9.2-8 DigraphPlainTextLineEncoder 9.2-8 DigraphRange 5.2-5 DigraphReflexiveTransitiveClosure 3.3-12 DigraphReflexiveTransitiveClosureAttr 3.3-12 DigraphReflexiveTransitiveReduction 3.3-13 DigraphReflexiveTransitiveReductionAttr 3.3-13 DigraphRemoveAllMultipleEdges 3.3-25 DigraphRemoveAllMultipleEdgesAttr 3.3-25 DigraphRemoveEdge, for a digraph and an edge 3.3-21 DigraphRemoveEdgeOrbit 3.3-22 DigraphRemoveEdges 3.3-23 DigraphRemoveLoops 3.3-24 DigraphRemoveLoopsAttr 3.3-24 DigraphRemoveVertex 3.3-19 DigraphRemoveVertices 3.3-20 DigraphReverse 3.3-9 DigraphReverseAttr 3.3-9 DigraphReverseEdge, for a digraph and an edge 3.3-26 DigraphReverseEdges, for a digraph and a list of edges 3.3-26 DigraphSchreierVector 7.2-13 DigraphShortestDistance, for a digraph and a list 5.3-2 DigraphShortestDistances 5.3-3 DigraphShortestPath 5.3-21 DigraphSinks 5.1-5 DigraphsMakeDoc 2.4-1 DigraphSource 5.2-5 DigraphSources 5.1-6 DigraphsRespectsColouring 7.3-12 DigraphStabilizer 7.2-14 DigraphsTestExtreme 2.5-3 DigraphsTestInstall 2.5-1 DigraphsTestStandard 2.5-2 DigraphStronglyConnectedComponent 5.3-12 DigraphStronglyConnectedComponents 5.3-11 DigraphsUseBliss 7.2-1 DigraphsUseNauty 7.2-1 DigraphSymmetricClosure 3.3-11 DigraphSymmetricClosureAttr 3.3-11 DigraphTopologicalSort 5.1-7 DigraphTransitiveClosure 3.3-12 DigraphTransitiveClosureAttr 3.3-12 DigraphTransitiveReduction 3.3-13 DigraphTransitiveReductionAttr 3.3-13 DigraphUndirectedGirth 5.3-8 DigraphVertexLabel 5.1-8 DigraphVertexLabels 5.1-9 DigraphVertices 5.1-1 DigraphWelshPowellOrder 7.3-16 DiSparse6String 9.2-3 DistanceDigraph, for digraph and int 3.3-39 DotDigraph 9.1-2 DotHighlightedDigraph 9.1-6 DotPartialOrderDigraph 9.1-4 DotPreorderDigraph 9.1-5 DotQuasiorderDigraph 9.1-5 DotSymmetricDigraph 9.1-3 DotVertexLabelledDigraph 9.1-2 DoubleDigraph 3.3-36 EdgeDigraph 3.3-34 EdgeOrbitsDigraph 3.1-10 EdgeUndirectedDigraph 3.3-35 EmbeddingsDigraphs 7.3-9 EmbeddingsDigraphsRepresentatives 7.3-9 EmptyDigraph 3.5-6 EpimorphismsDigraphs 7.3-7 EpimorphismsDigraphsRepresentatives 7.3-7 GeneralisedPetersenGraph 3.5-9 GeneratorsOfCayleyDigraph 5.4-2 GeneratorsOfEndomorphismMonoid 7.3-13 GeneratorsOfEndomorphismMonoidAttr 7.3-13 Graph 3.2-3 Graph6String 9.2-3 GroupOfCayleyDigraph 5.4-1 HamiltonianPath 5.3-28 HomomorphismDigraphsFinder 7.3-1 HomomorphismsDigraphs 7.3-3 HomomorphismsDigraphsRepresentatives 7.3-3 InDegreeOfVertex 5.2-12 InDegrees 5.2-9 InDegreeSequence 5.2-9 InDegreeSet 5.2-9 InducedSubdigraph 3.3-3 InNeighbors 5.2-7 InNeighborsMutableCopy 5.2-7 InNeighborsOfVertex 5.2-13 InNeighbours 5.2-7 InNeighboursMutableCopy 5.2-7 InNeighboursOfVertex 5.2-13 IsAcyclicDigraph 6.3-1 IsAntiSymmetricDigraph 6.1-2 IsAntisymmetricDigraph 6.1-2 IsAperiodicDigraph 6.3-7 IsBiconnectedDigraph 6.3-4 IsBipartiteDigraph 6.1-3 IsBridgelessDigraph 6.3-5 IsCayleyDigraph 3.1-4 IsChainDigraph 6.3-2 IsClique 8.1-1 IsCompleteBipartiteDigraph 6.1-4 IsCompleteDigraph 6.1-5 IsCompleteMultipartiteDigraph 6.1-6 IsConnectedDigraph 6.3-3 IsCycleDigraph 6.3-12 IsDigraph 3.1-1 IsDigraphAutomorphism 7.2-20 IsDigraphColouring 7.2-21 IsDigraphCore 6.5-1 IsDigraphEdge, for digraph and list 5.1-14 IsDigraphEmbedding 7.3-11 IsDigraphEndomorphism 7.3-10 IsDigraphEpimorphism 7.3-10 IsDigraphHomomorphism 7.3-10 IsDigraphIsomorphism 7.2-20 IsDigraphMonomorphism 7.3-10 IsDigraphWithAdjacencyFunction 3.1-5 IsDirectedTree 6.3-8 IsDistanceRegularDigraph 6.2-4 IsEdgeTransitive 6.5-2 IsEmptyDigraph 6.1-7 IsEquivalenceDigraph 6.1-8 IsEulerianDigraph 6.3-10 IsFunctionalDigraph 6.1-9 IsHamiltonianDigraph 6.3-11 IsImmutableDigraph 3.1-3 IsIndependentSet 8.2-1 IsInRegularDigraph 6.2-1 IsIsomorphicDigraph, for digraphs 7.2-15 IsJoinSemilatticeDigraph 6.1-17 IsLatticeDigraph 6.1-17 IsMatching 5.1-15 IsMaximalClique 8.1-1 IsMaximalIndependentSet 8.2-1 IsMaximalMatching 5.1-15 IsMaximumMatching 5.1-15 IsMeetSemilatticeDigraph 6.1-17 IsMultiDigraph 6.1-10 IsMutableDigraph 3.1-2 IsNullDigraph 6.1-7 IsomorphismDigraphs, for digraphs 7.2-17 IsOuterPlanarDigraph 6.4-2 IsOutRegularDigraph 6.2-2 IsPartialOrderDigraph 6.1-16 IsPerfectMatching 5.1-15 IsPlanarDigraph 6.4-1 IsPreorderDigraph 6.1-15 IsQuasiorderDigraph 6.1-15 IsReachable 5.3-19 IsReflexiveDigraph 6.1-11 IsRegularDigraph 6.2-3 IsStronglyConnectedDigraph 6.3-6 IsSubdigraph 4.1-1 IsSymmetricDigraph 6.1-12 IsTournament 6.1-13 IsTransitiveDigraph 6.1-14 IsUndirectedForest 6.3-9 IsUndirectedSpanningForest 4.1-2 IsUndirectedSpanningTree 4.1-2 IsUndirectedTree 6.3-9 IsVertexTransitive 6.5-3 IteratorFromDigraphFile 9.2-7 IteratorOfPaths 5.3-22 JohnsonDigraph 3.5-7 KuratowskiOuterPlanarSubdigraph 5.6-2 KuratowskiPlanarSubdigraph 5.6-1 LaplacianMatrix 5.2-17 LineDigraph 3.3-34 LineUndirectedDigraph 3.3-35 MaximalAntiSymmetricSubdigraph 3.3-6 MaximalAntiSymmetricSubdigraphAttr 3.3-6 MaximalSymmetricSubdigraph 3.3-5 MaximalSymmetricSubdigraphAttr 3.3-5 MaximalSymmetricSubdigraphWithoutLoops 3.3-5 MaximalSymmetricSubdigraphWithoutLoopsAttr 3.3-5 MonomorphismsDigraphs 7.3-5 MonomorphismsDigraphsRepresentatives 7.3-5 NautyAutomorphismGroup 7.2-4 NautyCanonicalDigraph 7.2-9 NautyCanonicalLabelling, for a digraph 7.2-7 NrSpanningTrees 5.3-29 NullDigraph 3.5-6 OnDigraphs, for a digraph and a perm 7.1-1 OnMultiDigraphs 7.1-2 OutDegreeOfVertex 5.2-10 OutDegrees 5.2-8 OutDegreeSequence 5.2-8 OutDegreeSet 5.2-8 OuterPlanarEmbedding 5.6-4 OutNeighbors 5.2-6 OutNeighborsMutableCopy 5.2-6 OutNeighborsOfVertex 5.2-11 OutNeighbours 5.2-6 OutNeighboursMutableCopy 5.2-6 OutNeighboursOfVertex 5.2-11 PartialOrderDigraphJoinOfVertices 5.2-15 PartialOrderDigraphMeetOfVertices 5.2-15 PetersenGraph 3.5-8 PlainTextString 9.2-12 PlanarEmbedding 5.6-3 PrintString 9.2-1 QuotientDigraph 3.3-8 RandomDigraph 3.4-1 RandomLattice 3.4-4 RandomMultiDigraph 3.4-2 RandomTournament 3.4-3 ReadDigraphs 9.2-5 ReadDIMACSDigraph 9.2-14 ReadPlainTextDigraph 9.2-13 ReducedDigraph 3.3-4 ReducedDigraphAttr 3.3-4 RepresentativeOutNeighbours 7.2-19 SemigroupOfCayleyDigraph 5.4-1 SetDigraphEdgeLabel 5.1-10 SetDigraphEdgeLabels, for a digraph and a function 5.1-11 SetDigraphVertexLabel 5.1-8 SetDigraphVertexLabels 5.1-9 Sparse6String 9.2-3 Splash 9.1-1 String 9.2-1 StrongOrientation 5.3-16 StrongOrientationAttr 5.3-16 SubdigraphHomeomorphicToK23 5.6-5 SubdigraphHomeomorphicToK33 5.6-5 SubdigraphHomeomorphicToK4 5.6-5 TCodeDecoder 9.2-11 TournamentLineDecoder 9.2-9 UndirectedSpanningForest 3.3-7 UndirectedSpanningForestAttr 3.3-7 UndirectedSpanningTree 3.3-7 UndirectedSpanningTreeAttr 3.3-7 WriteDigraphs 9.2-6 WriteDIMACSDigraph 9.2-14 WritePlainTextDigraph 9.2-13
generated by GAPDoc2HTML