< (for digraphs)  4.1= (for digraphs)  4.1AdjacencyMatrix  5.2-1AdjacencyMatrixUpperTriangleLineDecoder  9.2-9AsBinaryRelation  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-1AutomorphismGroup, for a multidigraph  7.2-2BipartiteDoubleDigraph  3.3-30BooleanAdjacencyMatrix  5.2-2CayleyDigraph  3.5-6ChainDigraph  3.5-1CliquesFinder  8.1-2CompleteBipartiteDigraph  3.5-3CompleteDigraph  3.5-2CycleDigraph  3.5-4Digraph  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-31DigraphAddEdge  3.3-13DigraphAddEdgeOrbit  3.3-14DigraphAddEdges  3.3-15DigraphAddVertex  3.3-11DigraphAddVertices  3.3-12DigraphAdjacencyFunction  5.2-3DigraphAllSimpleCircuits  5.3-17DigraphBicomponents  5.1-8DigraphByAdjacencyMatrix  3.1-6DigraphByEdges  3.1-7DigraphByInNeighbors  3.1-9DigraphByInNeighbours  3.1-9DigraphCanonicalLabelling, for a digraph  7.2-9DigraphCanonicalLabelling, for a digraph and a list  7.2-9DigraphClique  8.1-3DigraphCliques  8.1-4DigraphCliquesReps  8.1-4DigraphColoring, for a digraph  7.3-9DigraphColoring, for a digraph and number of colors  7.3-9DigraphColouring  7.3-9DigraphConnectedComponent  5.3-9DigraphConnectedComponents  5.3-8DigraphCopy  3.3-1DigraphDegeneracy  5.3-20DigraphDegeneracyOrdering  5.3-21DigraphDiameter  5.3-1DigraphDisjointUnion, for a list of digraphs  3.3-24DigraphDisjointUnion, for an
    arbitrary number of digraphs  3.3-24DigraphDistanceSet, 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-7DigraphEdges  5.1-3DigraphEdgeUnion, for a list of digraphs  3.3-25DigraphEdgeUnion, for an arbitrary
    number of digraphs  3.3-25DigraphEmbedding  7.3-10DigraphEpimorphism  7.3-6DigraphFamily  3.1-4DigraphFile  9.2-3DigraphFloydWarshall  5.3-13DigraphFromDigraph6String  9.2-1DigraphFromDiSparse6String  9.2-1DigraphFromGraph6String  9.2-1DigraphFromPlainTextString  9.2-11DigraphFromSparse6String  9.2-1DigraphGirth  5.3-6DigraphGroup  7.2-3DigraphHasLoops  6.1-1DigraphHomomorphism  7.3-2DigraphIndependentSet  8.2-2DigraphIndependentSets  8.2-3DigraphIndependentSetsReps  8.2-3DigraphInEdges  5.1-11DigraphJoin, for a list of digraphs  3.3-26DigraphJoin, for an arbitrary number
    of digraphs  3.3-26DigraphLayers  5.3-19DigraphLongestDistanceFromVertex  5.3-4DigraphLongestSimpleCircuit  5.3-18DigraphLoops  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-5DigraphOrbits  7.2-7DigraphOutEdges  5.1-12DigraphPath  5.3-15DigraphPeriod  5.3-12DigraphPlainTextLineDecoder  9.2-7DigraphPlainTextLineEncoder  9.2-7DigraphRange  5.2-4DigraphReflexiveTransitiveClosure  3.3-9DigraphReflexiveTransitiveReduction  3.3-10DigraphRemoveAllMultipleEdges  3.3-22DigraphRemoveEdge  3.3-18DigraphRemoveEdgeOrbit  3.3-19DigraphRemoveEdges  3.3-20DigraphRemoveLoops  3.3-21DigraphRemoveVertex  3.3-16DigraphRemoveVertices   3.3-17DigraphReverse  3.3-6DigraphReverseEdge  3.3-23DigraphReverseEdges  3.3-23DigraphSchreierVector  7.2-4DigraphShortestDistance, 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-6DigraphsTestInstall  2.5-1DigraphsTestStandard  2.5-2DigraphStronglyConnectedComponent  5.3-11DigraphStronglyConnectedComponents  5.3-10DigraphSymmetricClosure  3.3-8DigraphTopologicalSort  5.1-7DigraphTransitiveClosure  3.3-9DigraphTransitiveReduction  3.3-10DigraphType  3.1-4DigraphUndirectedGirth  5.3-7DigraphVertexLabel  5.1-9DigraphVertexLabels  5.1-10DigraphVertices  5.1-1DiSparse6String  9.2-2DistanceDigraph, for digraph and int  3.3-32DistanceDigraph, for digraph and list  3.3-32DotDigraph  9.1-2DotSymmetricDigraph  9.1-3DoubleDigraph  3.3-29EdgeDigraph  3.3-27EdgeOrbitsDigraph  3.1-8EdgeUndirectedDigraph  3.3-28EmptyDigraph  3.5-5EpimorphismsDigraphs  7.3-7EpimorphismsDigraphsRepresentatives  7.3-7GeneratorsOfEndomorphismMonoid  7.3-8GeneratorsOfEndomorphismMonoidAttr  7.3-8Graph  3.2-3Graph6String  9.2-2HomomorphismDigraphsFinder  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-6InNeighborsOfVertex  5.2-12InNeighbours  5.2-6InNeighboursOfVertex  5.2-12IsAcyclicDigraph  6.3-1IsAntisymmetricDigraph  6.1-2IsAperiodicDigraph  6.3-4IsBipartiteDigraph  6.1-3IsCayleyDigraph  3.1-2IsClique  8.1-1IsCompleteBipartiteDigraph  6.1-4IsCompleteDigraph  6.1-5IsConnectedDigraph  6.3-2IsDigraph  3.1-1IsDigraphEdge, for digraph and list  5.1-13IsDigraphEdge, for digraph and two pos ints  5.1-13IsDigraphWithAdjacencyFunction  3.1-3IsDistanceRegularDigraph  6.2-4IsEmptyDigraph  6.1-6IsFunctionalDigraph  6.1-7IsIndependentSet  8.2-1IsInRegularDigraph  6.2-1IsIsomorphicDigraph, for digraphs  7.2-10IsMaximalClique  8.1-1IsMaximalIndependentSet  8.2-1IsMultiDigraph  6.1-8IsNullDigraph  6.1-6IsomorphismDigraphs, for digraphs  7.2-11IsOutRegularDigraph  6.2-2IsReachable  5.3-14IsReflexiveDigraph  6.1-9IsRegularDigraph  6.2-3IsStronglyConnectedDigraph  6.3-3IsSymmetricDigraph  6.1-10IsTournament  6.1-11IsTransitiveDigraph  6.1-12IteratorFromDigraphFile  9.2-6IteratorOfPaths  5.3-16JohnsonDigraph  3.5-7LineDigraph  3.3-27LineUndirectedDigraph  3.3-28MaximalSymmetricSubdigraph  3.3-4MaximalSymmetricSubdigraphWithoutLoops  3.3-4MonomorphismsDigraphs  7.3-5MonomorphismsDigraphsRepresentatives  7.3-5NullDigraph  3.5-5OnDigraphs, 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-5OutNeighborsCopy  5.2-5OutNeighborsOfVertex  5.2-10OutNeighbours  5.2-5OutNeighboursCopy  5.2-5OutNeighboursOfVertex  5.2-10PlainTextString  9.2-11QuotientDigraph  3.3-5RandomDigraph  3.4-1RandomMultiDigraph  3.4-2RandomTournament  3.4-3ReadDigraphs  9.2-4ReadPlainTextDigraph  9.2-12ReducedDigraph  3.3-3RepresentativeOutNeighbours  7.2-8SetDigraphVertexLabel  5.1-9SetDigraphVertexLabels  5.1-10Sparse6String  9.2-2Splash  9.1-1TCodeDecoder  9.2-10TournamentLineDecoder  9.2-8WriteDigraphs  9.2-5WritePlainTextDigraph  9.2-12
generated by GAPDoc2HTML