  
  
  [1XIndex[101X
  
  [10X<[110X (for digraphs)  4.1
  [10X=[110X (for digraphs)  4.1
  [2XAdjacencyMatrix[102X  5.2-1
  [2XAdjacencyMatrixUpperTriangleLineDecoder[102X  9.2-9
  [2XAsBinaryRelation[102X  3.2-1
  [2XAsDigraph[102X  3.2-2
  [2XAsGraph[102X  3.2-4
  [2XAsTransformation[102X  3.2-5
  [2XAutomorphismGroup[102X (for a digraph and a homogeneous list)  7.2-1
  [2XAutomorphismGroup[102X (for a digraph)  7.2-1
  [2XAutomorphismGroup[102X (for a multidigraph)  7.2-2
  [2XBipartiteDoubleDigraph[102X  3.3-30
  [2XBooleanAdjacencyMatrix[102X  5.2-2
  [2XCayleyDigraph[102X  3.5-6
  [2XChainDigraph[102X  3.5-1
  [2XCliquesFinder[102X  8.1-2
  [2XCompleteBipartiteDigraph[102X  3.5-3
  [2XCompleteDigraph[102X  3.5-2
  [2XCycleDigraph[102X  3.5-4
  [2XDigraph[102X  3.1-5
  [2XDigraph[102X (for a group, list, function, and function)  3.1-5
  [2XDigraph[102X (for a list and function)  3.1-5
  [2XDigraph6String[102X  9.2-2
  [2XDigraphAddAllLoops[102X  3.3-31
  [2XDigraphAddEdge[102X  3.3-13
  [2XDigraphAddEdgeOrbit[102X  3.3-14
  [2XDigraphAddEdges[102X  3.3-15
  [2XDigraphAddVertex[102X  3.3-11
  [2XDigraphAddVertices[102X  3.3-12
  [2XDigraphAdjacencyFunction[102X  5.2-3
  [2XDigraphAllSimpleCircuits[102X  5.3-17
  [2XDigraphBicomponents[102X  5.1-8
  [2XDigraphByAdjacencyMatrix[102X  3.1-6
  [2XDigraphByEdges[102X  3.1-7
  [2XDigraphByInNeighbors[102X  3.1-9
  [2XDigraphByInNeighbours[102X  3.1-9
  [2XDigraphCanonicalLabelling[102X (for a digraph and a list)  7.2-9
  [2XDigraphCanonicalLabelling[102X (for a digraph)  7.2-9
  [2XDigraphClique[102X  8.1-3
  [2XDigraphCliques[102X  8.1-4
  [2XDigraphCliquesReps[102X  8.1-4
  [2XDigraphColoring[102X (for a digraph and number of colors)  7.3-9
  [2XDigraphColoring[102X (for a digraph)  7.3-9
  [2XDigraphColouring[102X  7.3-9
  [2XDigraphConnectedComponent[102X  5.3-9
  [2XDigraphConnectedComponents[102X  5.3-8
  [2XDigraphCopy[102X  3.3-1
  [2XDigraphDegeneracy[102X  5.3-20
  [2XDigraphDegeneracyOrdering[102X  5.3-21
  [2XDigraphDiameter[102X  5.3-1
  [2XDigraphDisjointUnion[102X (for a list of digraphs)  3.3-24
  [2XDigraphDisjointUnion[102X (for an
      arbitrary number of digraphs)  3.3-24
  [2XDigraphDistanceSet[102X (for a digraph, a pos int, and a list)  5.3-5
  [2XDigraphDistanceSet[102X (for a digraph, a pos int, and an int)  5.3-5
  [2XDigraphDual[102X  3.3-7
  [2XDigraphEdges[102X  5.1-3
  [2XDigraphEdgeUnion[102X (for a list of digraphs)  3.3-25
  [2XDigraphEdgeUnion[102X (for an arbitrary
      number of digraphs)  3.3-25
  [2XDigraphEmbedding[102X  7.3-10
  [2XDigraphEpimorphism[102X  7.3-6
  [2XDigraphFamily[102X  3.1-4
  [2XDigraphFile[102X  9.2-3
  [2XDigraphFloydWarshall[102X  5.3-13
  [2XDigraphFromDigraph6String[102X  9.2-1
  [2XDigraphFromDiSparse6String[102X  9.2-1
  [2XDigraphFromGraph6String[102X  9.2-1
  [2XDigraphFromPlainTextString[102X  9.2-11
  [2XDigraphFromSparse6String[102X  9.2-1
  [2XDigraphGirth[102X  5.3-6
  [2XDigraphGroup[102X  7.2-3
  [2XDigraphHasLoops[102X  6.1-1
  [2XDigraphHomomorphism[102X  7.3-2
  [2XDigraphIndependentSet[102X  8.2-2
  [2XDigraphIndependentSets[102X  8.2-3
  [2XDigraphIndependentSetsReps[102X  8.2-3
  [2XDigraphInEdges[102X  5.1-11
  [2XDigraphJoin[102X (for a list of digraphs)  3.3-26
  [2XDigraphJoin[102X (for an arbitrary number
      of digraphs)  3.3-26
  [2XDigraphLayers[102X  5.3-19
  [2XDigraphLongestDistanceFromVertex[102X  5.3-4
  [2XDigraphLongestSimpleCircuit[102X  5.3-18
  [2XDigraphLoops[102X  5.2-13
  [2XDigraphMaximalClique[102X  8.1-3
  [2XDigraphMaximalCliques[102X  8.1-4
  [2XDigraphMaximalCliquesAttr[102X  8.1-4
  [2XDigraphMaximalCliquesReps[102X  8.1-4
  [2XDigraphMaximalCliquesRepsAttr[102X  8.1-4
  [2XDigraphMaximalIndependentSet[102X  8.2-2
  [2XDigraphMaximalIndependentSets[102X  8.2-3
  [2XDigraphMaximalIndependentSetsAttr[102X  8.2-3
  [2XDigraphMaximalIndependentSetsReps[102X  8.2-3
  [2XDigraphMaximalIndependentSetsRepsAttr[102X  8.2-3
  [2XDigraphMonomorphism[102X  7.3-4
  [2XDigraphNrEdges[102X  5.1-4
  [2XDigraphNrVertices[102X  5.1-2
  [2XDigraphOrbitReps[102X  7.2-5
  [2XDigraphOrbits[102X  7.2-7
  [2XDigraphOutEdges[102X  5.1-12
  [2XDigraphPath[102X  5.3-15
  [2XDigraphPeriod[102X  5.3-12
  [2XDigraphPlainTextLineDecoder[102X  9.2-7
  [2XDigraphPlainTextLineEncoder[102X  9.2-7
  [2XDigraphRange[102X  5.2-4
  [2XDigraphReflexiveTransitiveClosure[102X  3.3-9
  [2XDigraphReflexiveTransitiveReduction[102X  3.3-10
  [2XDigraphRemoveAllMultipleEdges[102X  3.3-22
  [2XDigraphRemoveEdge[102X  3.3-18
  [2XDigraphRemoveEdgeOrbit[102X  3.3-19
  [2XDigraphRemoveEdges[102X  3.3-20
  [2XDigraphRemoveLoops[102X  3.3-21
  [2XDigraphRemoveVertex[102X  3.3-16
  [2XDigraphRemoveVertices [102X  3.3-17
  [2XDigraphReverse[102X  3.3-6
  [2XDigraphReverseEdge[102X  3.3-23
  [2XDigraphReverseEdges[102X  3.3-23
  [5XDigraphs[105X package overview  1.
  [2XDigraphSchreierVector[102X  7.2-4
  [2XDigraphShortestDistance[102X (for a digraph and a list)  5.3-2
  [2XDigraphShortestDistance[102X (for a digraph and two vertices)  5.3-2
  [2XDigraphShortestDistance[102X (for a digraph, a list, and a list)  5.3-2
  [2XDigraphShortestDistances[102X  5.3-3
  [2XDigraphSinks[102X  5.1-5
  [2XDigraphsMakeDoc[102X  2.4-1
  [2XDigraphSource[102X  5.2-4
  [2XDigraphSources[102X  5.1-6
  [2XDigraphStabilizer[102X  7.2-6
  [2XDigraphsTestInstall[102X  2.5-1
  [2XDigraphsTestStandard[102X  2.5-2
  [2XDigraphStronglyConnectedComponent[102X  5.3-11
  [2XDigraphStronglyConnectedComponents[102X  5.3-10
  [2XDigraphSymmetricClosure[102X  3.3-8
  [2XDigraphTopologicalSort[102X  5.1-7
  [2XDigraphTransitiveClosure[102X  3.3-9
  [2XDigraphTransitiveReduction[102X  3.3-10
  [2XDigraphType[102X  3.1-4
  [2XDigraphUndirectedGirth[102X  5.3-7
  [2XDigraphVertexLabel[102X  5.1-9
  [2XDigraphVertexLabels[102X  5.1-10
  [2XDigraphVertices[102X  5.1-1
  [2XDiSparse6String[102X  9.2-2
  [2XDistanceDigraph[102X (for digraph and int)  3.3-32
  [2XDistanceDigraph[102X (for digraph and list)  3.3-32
  [2XDotDigraph[102X  9.1-2
  [2XDotSymmetricDigraph[102X  9.1-3
  [2XDoubleDigraph[102X  3.3-29
  [2XEdgeDigraph[102X  3.3-27
  [2XEdgeOrbitsDigraph[102X  3.1-8
  [2XEdgeUndirectedDigraph[102X  3.3-28
  [2XEmptyDigraph[102X  3.5-5
  [2XEpimorphismsDigraphs[102X  7.3-7
  [2XEpimorphismsDigraphsRepresentatives[102X  7.3-7
  [2XGeneratorsOfEndomorphismMonoid[102X  7.3-8
  [2XGeneratorsOfEndomorphismMonoidAttr[102X  7.3-8
  [2XGraph[102X  3.2-3
  [2XGraph6String[102X  9.2-2
  [2XHomomorphismDigraphsFinder[102X  7.3-1
  [2XHomomorphismsDigraphs[102X  7.3-3
  [2XHomomorphismsDigraphsRepresentatives[102X  7.3-3
  [2XInDegreeOfVertex[102X  5.2-11
  [2XInDegrees[102X  5.2-8
  [2XInDegreeSequence[102X  5.2-8
  [2XInDegreeSet[102X  5.2-8
  [2XInducedSubdigraph[102X  3.3-2
  [2XInNeighbors[102X  5.2-6
  [2XInNeighborsOfVertex[102X  5.2-12
  [2XInNeighbours[102X  5.2-6
  [2XInNeighboursOfVertex[102X  5.2-12
  [2XIsAcyclicDigraph[102X  6.3-1
  [2XIsAntisymmetricDigraph[102X  6.1-2
  [2XIsAperiodicDigraph[102X  6.3-4
  [2XIsBipartiteDigraph[102X  6.1-3
  [2XIsCayleyDigraph[102X  3.1-2
  [2XIsClique[102X  8.1-1
  [2XIsCompleteBipartiteDigraph[102X  6.1-4
  [2XIsCompleteDigraph[102X  6.1-5
  [2XIsConnectedDigraph[102X  6.3-2
  [2XIsDigraph[102X  3.1-1
  [2XIsDigraphEdge[102X (for digraph and list)  5.1-13
  [2XIsDigraphEdge[102X (for digraph and two pos ints)  5.1-13
  [2XIsDigraphWithAdjacencyFunction[102X  3.1-3
  [2XIsDistanceRegularDigraph[102X  6.2-4
  [2XIsEmptyDigraph[102X  6.1-6
  [2XIsFunctionalDigraph[102X  6.1-7
  [2XIsIndependentSet[102X  8.2-1
  [2XIsInRegularDigraph[102X  6.2-1
  [2XIsIsomorphicDigraph[102X (for digraphs)  7.2-10
  [2XIsMaximalClique[102X  8.1-1
  [2XIsMaximalIndependentSet[102X  8.2-1
  [2XIsMultiDigraph[102X  6.1-8
  [2XIsNullDigraph[102X  6.1-6
  [2XIsomorphismDigraphs[102X (for digraphs)  7.2-11
  [2XIsOutRegularDigraph[102X  6.2-2
  [2XIsReachable[102X  5.3-14
  [2XIsReflexiveDigraph[102X  6.1-9
  [2XIsRegularDigraph[102X  6.2-3
  [2XIsStronglyConnectedDigraph[102X  6.3-3
  [2XIsSymmetricDigraph[102X  6.1-10
  [2XIsTournament[102X  6.1-11
  [2XIsTransitiveDigraph[102X  6.1-12
  [2XIteratorFromDigraphFile[102X  9.2-6
  [2XIteratorOfPaths[102X  5.3-16
  [2XJohnsonDigraph[102X  3.5-7
  [2XLineDigraph[102X  3.3-27
  [2XLineUndirectedDigraph[102X  3.3-28
  [2XMaximalSymmetricSubdigraph[102X  3.3-4
  [2XMaximalSymmetricSubdigraphWithoutLoops[102X  3.3-4
  [2XMonomorphismsDigraphs[102X  7.3-5
  [2XMonomorphismsDigraphsRepresentatives[102X  7.3-5
  [2XNullDigraph[102X  3.5-5
  [2XOnDigraphs[102X (for a digraph and a perm)  7.1-1
  [2XOnDigraphs[102X (for a digraph and a transformation)  7.1-1
  [2XOnMultiDigraphs[102X  7.1-2
  [2XOnMultiDigraphs[102X (for a digraph, perm, and perm)  7.1-2
  [2XOutDegreeOfVertex[102X  5.2-9
  [2XOutDegrees[102X  5.2-7
  [2XOutDegreeSequence[102X  5.2-7
  [2XOutDegreeSet[102X  5.2-7
  [2XOutNeighbors[102X  5.2-5
  [2XOutNeighborsCopy[102X  5.2-5
  [2XOutNeighborsOfVertex[102X  5.2-10
  [2XOutNeighbours[102X  5.2-5
  [2XOutNeighboursCopy[102X  5.2-5
  [2XOutNeighboursOfVertex[102X  5.2-10
  [2XPlainTextString[102X  9.2-11
  [2XQuotientDigraph[102X  3.3-5
  [2XRandomDigraph[102X  3.4-1
  [2XRandomMultiDigraph[102X  3.4-2
  [2XRandomTournament[102X  3.4-3
  [2XReadDigraphs[102X  9.2-4
  [2XReadPlainTextDigraph[102X  9.2-12
  [2XReducedDigraph[102X  3.3-3
  [2XRepresentativeOutNeighbours[102X  7.2-8
  [2XSetDigraphVertexLabel[102X  5.1-9
  [2XSetDigraphVertexLabels[102X  5.1-10
  [2XSparse6String[102X  9.2-2
  [2XSplash[102X  9.1-1
  [2XTCodeDecoder[102X  9.2-10
  [2XTournamentLineDecoder[102X  9.2-8
  [2XWriteDigraphs[102X  9.2-5
  [2XWritePlainTextDigraph[102X  9.2-12
  
  
  -------------------------------------------------------
