GAP (digraphs) - Index

Goto Chapter: Top 1 2 3 4 5 6 7 8 9 A Bib Ind
[Top of Book] [Contents] [Previous Chapter]

[MathJax on]

### Index

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

[Top of Book] [Contents] [Previous Chapter]
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 A Bib Ind

generated by GAPDoc2HTML