< (for digraphs)  4.1= (for digraphs)  4.1AdjacencyMatrix  5.2-1AdjacencyMatrixMutableCopy  5.2-1AdjacencyMatrixUpperTriangleLineDecoder  9.2-9ArticulationPoints  5.3-13AsBinaryRelation  3.2-1AsDigraph  3.2-2AsGraph  3.2-4AsTransformation  3.2-5AutomorphismGroup, for a digraph  7.2-1AutomorphismGroup, for a digraph and a homogeneous list  7.2-2BipartiteDoubleDigraph  3.3-31BooleanAdjacencyMatrix  5.2-2BooleanAdjacencyMatrixMutableCopy  5.2-2CayleyDigraph  3.1-10ChainDigraph  3.5-1ChromaticNumber  7.3-11CliqueNumber  8.1-5CliquesFinder  8.1-2CompleteBipartiteDigraph  3.5-3CompleteDigraph  3.5-2CompleteMultipartiteDigraph  3.5-4CycleDigraph  3.5-5Digraph  3.1-5Digraph, for a group, list, function, and function  3.1-5Digraph, for a list and function  3.1-5Digraph6String  9.2-2DigraphAddAllLoops  3.3-32DigraphAddEdge  3.3-14DigraphAddEdgeOrbit  3.3-15DigraphAddEdges  3.3-16DigraphAddVertex  3.3-12DigraphAddVertices  3.3-13DigraphAdjacencyFunction  5.2-3DigraphAllSimpleCircuits  5.3-19DigraphBicomponents  5.3-12DigraphByAdjacencyMatrix  3.1-6DigraphByEdges  3.1-7DigraphByInNeighbors  3.1-9DigraphByInNeighbours  3.1-9DigraphCanonicalLabelling, for a digraph  7.2-3DigraphCanonicalLabelling, for a digraph and a list  7.2-4DigraphClique  8.1-3DigraphCliques  8.1-4DigraphCliquesReps  8.1-4DigraphClosure, for a digraph and positive integer  3.3-34DigraphColoring, for a digraph  7.3-9DigraphColoring, for a digraph and a number of colours  7.3-9DigraphColouring, for a digraph  7.3-9DigraphColouring, for a digraph and a number of colours  7.3-9DigraphConnectedComponent  5.3-9DigraphConnectedComponents  5.3-8DigraphCopy  3.3-1DigraphDegeneracy  5.3-22DigraphDegeneracyOrdering  5.3-23DigraphDiameter  5.3-1DigraphDisjointUnion, for a list of digraphs  3.3-25DigraphDisjointUnion, for an
    arbitrary number of digraphs  3.3-25DigraphDistanceSet, for a digraph, a pos int, and a list  5.3-5DigraphDistanceSet, for a digraph, a pos int, and an int  5.3-5DigraphDual  3.3-8DigraphEdgeLabel  5.1-10DigraphEdgeLabels  5.1-11DigraphEdges  5.1-3DigraphEdgeUnion, for a list of digraphs  3.3-26DigraphEdgeUnion, for an arbitrary
    number of digraphs  3.3-26DigraphEmbedding  7.3-10DigraphEpimorphism  7.3-6DigraphFamily  3.1-4DigraphFile  9.2-3DigraphFloydWarshall  5.3-15DigraphFromDigraph6String  9.2-1DigraphFromDiSparse6String  9.2-1DigraphFromGraph6String  9.2-1DigraphFromPlainTextString  9.2-11DigraphFromSparse6String  9.2-1DigraphGirth  5.3-6DigraphGroup  7.2-5DigraphHasLoops  6.1-1DigraphHomomorphism  7.3-2DigraphIndependentSet  8.2-2DigraphIndependentSets  8.2-3DigraphIndependentSetsReps  8.2-3DigraphInEdges  5.1-12DigraphJoin, for a list of digraphs  3.3-27DigraphJoin, for an arbitrary number
    of digraphs  3.3-27DigraphLayers  5.3-21DigraphLongestDistanceFromVertex  5.3-4DigraphLongestSimpleCircuit  5.3-20DigraphLoops  5.2-13DigraphMaximalClique  8.1-3DigraphMaximalCliques  8.1-4DigraphMaximalCliquesAttr  8.1-4DigraphMaximalCliquesReps  8.1-4DigraphMaximalCliquesRepsAttr  8.1-4DigraphMaximalIndependentSet  8.2-2DigraphMaximalIndependentSets  8.2-3DigraphMaximalIndependentSetsAttr  8.2-3DigraphMaximalIndependentSetsReps  8.2-3DigraphMaximalIndependentSetsRepsAttr  8.2-3DigraphMonomorphism  7.3-4DigraphNrEdges  5.1-4DigraphNrVertices  5.1-2DigraphOrbitReps  7.2-7DigraphOrbits  7.2-6DigraphOutEdges  5.1-13DigraphPath  5.3-17DigraphPeriod  5.3-14DigraphPlainTextLineDecoder  9.2-7DigraphPlainTextLineEncoder  9.2-7DigraphRange  5.2-4DigraphReflexiveTransitiveClosure  3.3-10DigraphReflexiveTransitiveReduction  3.3-11DigraphRemoveAllMultipleEdges  3.3-23DigraphRemoveEdge  3.3-19DigraphRemoveEdgeOrbit  3.3-20DigraphRemoveEdges  3.3-21DigraphRemoveLoops  3.3-22DigraphRemoveVertex  3.3-17DigraphRemoveVertices   3.3-18DigraphReverse  3.3-7DigraphReverseEdge  3.3-24DigraphReverseEdges  3.3-24DigraphSchreierVector  7.2-8DigraphShortestDistance, for a digraph and a list  5.3-2DigraphShortestDistance, for a digraph and two vertices  5.3-2DigraphShortestDistance, for a digraph, a list, and a list  5.3-2DigraphShortestDistances  5.3-3DigraphSinks  5.1-5DigraphsMakeDoc  2.4-1DigraphSource  5.2-4DigraphSources  5.1-6DigraphStabilizer  7.2-9DigraphsTestInstall  2.5-1DigraphsTestStandard  2.5-2DigraphStronglyConnectedComponent  5.3-11DigraphStronglyConnectedComponents  5.3-10DigraphSymmetricClosure  3.3-9DigraphTopologicalSort  5.1-7DigraphTransitiveClosure  3.3-10DigraphTransitiveReduction  3.3-11DigraphType  3.1-4DigraphUndirectedGirth  5.3-7DigraphVertexLabel  5.1-8DigraphVertexLabels  5.1-9DigraphVertices  5.1-1DiSparse6String  9.2-2DistanceDigraph, for digraph and int  3.3-33DistanceDigraph, for digraph and list  3.3-33DotDigraph  9.1-2DotSymmetricDigraph  9.1-3DotVertexLabelledDigraph  9.1-2DoubleDigraph  3.3-30EdgeDigraph  3.3-28EdgeOrbitsDigraph  3.1-8EdgeUndirectedDigraph  3.3-29EmptyDigraph  3.5-6EpimorphismsDigraphs  7.3-7EpimorphismsDigraphsRepresentatives  7.3-7GeneratorsOfCayleyDigraph  5.4-2GeneratorsOfEndomorphismMonoid  7.3-8GeneratorsOfEndomorphismMonoidAttr  7.3-8Graph  3.2-3Graph6String  9.2-2GroupOfCayleyDigraph  5.4-1HomomorphismDigraphsFinder  7.3-1HomomorphismsDigraphs  7.3-3HomomorphismsDigraphsRepresentatives  7.3-3InDegreeOfVertex  5.2-11InDegrees  5.2-8InDegreeSequence  5.2-8InDegreeSet  5.2-8InducedSubdigraph  3.3-2InNeighbors  5.2-6InNeighborsMutableCopy  5.2-6InNeighborsOfVertex  5.2-12InNeighbours  5.2-6InNeighboursMutableCopy  5.2-6InNeighboursOfVertex  5.2-12IsAcyclicDigraph  6.3-1IsAntisymmetricDigraph  6.1-2IsAperiodicDigraph  6.3-5IsBiconnectedDigraph  6.3-3IsBipartiteDigraph  6.1-3IsCayleyDigraph  3.1-2IsClique  8.1-1IsCompleteBipartiteDigraph  6.1-4IsCompleteDigraph  6.1-5IsConnectedDigraph  6.3-2IsCycleDigraph  6.3-9IsDigraph  3.1-1IsDigraphEdge, for digraph and list  5.1-14IsDigraphEdge, for digraph and two pos ints  5.1-14IsDigraphWithAdjacencyFunction  3.1-3IsDirectedTree  6.3-6IsDistanceRegularDigraph  6.2-4IsEmptyDigraph  6.1-6IsEulerianDigraph  6.3-8IsFunctionalDigraph  6.1-7IsIndependentSet  8.2-1IsInRegularDigraph  6.2-1IsIsomorphicDigraph, for digraphs  7.2-10IsIsomorphicDigraph, for digraphs and homogeneous lists  7.2-11IsJoinSemilatticeDigraph  6.1-14IsLatticeDigraph  6.1-14IsMatching  5.1-15IsMaximalClique  8.1-1IsMaximalIndependentSet  8.2-1IsMaximalMatching  5.1-15IsMeetSemilatticeDigraph  6.1-14IsMultiDigraph  6.1-8IsNullDigraph  6.1-6IsomorphismDigraphs, for digraphs  7.2-12IsomorphismDigraphs, for digraphs and homogeneous lists  7.2-13IsOutRegularDigraph  6.2-2IsPartialOrderDigraph  6.1-13IsPerfectMatching  5.1-15IsReachable  5.3-16IsReflexiveDigraph  6.1-9IsRegularDigraph  6.2-3IsStronglyConnectedDigraph  6.3-4IsSubdigraph  4.1-1IsSymmetricDigraph  6.1-10IsTournament  6.1-11IsTransitiveDigraph  6.1-12IsUndirectedForest  6.3-7IsUndirectedSpanningForest  4.1-2IsUndirectedSpanningTree  4.1-2IsUndirectedTree  6.3-7IteratorFromDigraphFile  9.2-6IteratorOfPaths  5.3-18JohnsonDigraph  3.5-7LineDigraph  3.3-28LineUndirectedDigraph  3.3-29MaximalSymmetricSubdigraph  3.3-4MaximalSymmetricSubdigraphWithoutLoops  3.3-4MonomorphismsDigraphs  7.3-5MonomorphismsDigraphsRepresentatives  7.3-5NullDigraph  3.5-6OnDigraphs, for a digraph and a perm  7.1-1OnDigraphs, for a digraph and a transformation  7.1-1OnMultiDigraphs  7.1-2OnMultiDigraphs, for a digraph, perm, and perm  7.1-2OutDegreeOfVertex  5.2-9OutDegrees  5.2-7OutDegreeSequence  5.2-7OutDegreeSet  5.2-7OutNeighbors  5.2-5OutNeighborsMutableCopy  5.2-5OutNeighborsOfVertex  5.2-10OutNeighbours  5.2-5OutNeighboursMutableCopy  5.2-5OutNeighboursOfVertex  5.2-10PartialOrderDigraphJoinOfVertices, for a digraph and two vertices  5.2-14PartialOrderDigraphMeetOfVertices, for a digraph and two vertices  5.2-14PlainTextString  9.2-11QuotientDigraph  3.3-6RandomDigraph  3.4-1RandomMultiDigraph  3.4-2RandomTournament  3.4-3ReadDigraphs  9.2-4ReadDIMACSDigraph  9.2-13ReadPlainTextDigraph  9.2-12ReducedDigraph  3.3-3RepresentativeOutNeighbours  7.2-14SemigroupOfCayleyDigraph  5.4-1SetDigraphEdgeLabel  5.1-10SetDigraphEdgeLabels, for a digraph and a function  5.1-11SetDigraphEdgeLabels, for a digraph and a list of lists  5.1-11SetDigraphVertexLabel  5.1-8SetDigraphVertexLabels  5.1-9Sparse6String  9.2-2Splash  9.1-1TCodeDecoder  9.2-10TournamentLineDecoder  9.2-8UndirectedSpanningForest  3.3-5UndirectedSpanningTree  3.3-5WriteDigraphs  9.2-5WriteDIMACSDigraph  9.2-13WritePlainTextDigraph  9.2-12
generated by GAPDoc2HTML