Below is a table of Grape commands with the Digraphs counterparts. The sections in this chapter correspond to the chapters in the Grape manual.
| Grape command | Digraphs command | Comments | 
| Graph | Digraph(3.1-5) | Used with the arguments of Graphin Grape,Digraph(3.1-5) will return an equivalent digraph. | 
| EdgeOrbitsGraph | EdgeOrbitsDigraph(3.1-8) | The operation EdgeOrbitsDigraph(3.1-8) behaves the same asEdgeOrbitsDigraphin Grape. | 
| NullGraph | NullDigraph(3.5-6) orEmptyDigraph(3.5-6) | Note that, unlike in Grape, the arguments of NullDigraph(3.5-6) andEmptyDigraph(3.5-6) are just non-negative integers. Since digraphs in Digraphs are immutable, there is no reason (although it is possible) to create a null digraph and then add edges, as you might be used to doing in Grape. | 
| CompleteGraph | CompleteDigraph(3.5-2) | Note that, unlike in Grape, the argument to CompleteDigraph(3.5-2) is simply a non-negative integer indicating the number of vertices. By default a complete digraph in Digraphs does not have any loops. If you want a complete digraph with loops at every vertex, then useDigraphAddAllLoops(3.3-32). | 
| JohnsonGraph | JohnsonDigraph(3.5-7) | The Grape function JohnsonGraphis equivalent toJohnsonDigraph(3.5-7). | 
| CayleyGraph | CayleyDigraph(3.1-10) | The operation CayleyDigraph(3.1-10) behaves the same asCayleyGraphin Grape. | 
| AddEdgeOrbit | DigraphAddEdgeOrbit(3.3-15) | Note that, unlike in Grape, digraphs in Digraphs are immutable, and this operation returns a new digraph, i.e. it does not modify the digraph given as an argument. | 
| RemoveEdgeOrbit | DigraphRemoveEdgeOrbit(3.3-20) | Note that, unlike in Grape, digraphs in Digraphs are immutable, and this operation returns a new digraph, i.e. it does not modify the digraph given as an argument. | 
| AssignVertexNames | SetDigraphVertexLabels(5.1-9) andSetDigraphVertexLabel(5.1-8) | Use SetDigraphVertexLabel(5.1-8) to set an individual vertex label andSetDigraphVertexLabels(5.1-9) to set all of the vertex labels. | 
| Grape command | Digraphs command | Comments | 
| IsGraph | IsDigraph(3.1-1) | IsDigraph(3.1-1) is a category and not a function likeIsGraph. | 
| OrderGraph | DigraphNrVertices(5.1-2) | The operation DigraphNrVertices(5.1-2) behaves the same asOrderGraphin Grape. | 
| IsVertex(graph, v) | v in DigraphVertices(digraph) | The attribute DigraphVertices(5.1-1) can be used to return the list of vertices of a digraph, or if v is known to be a positive integer, then you can simply dov <= DigraphNrVertices(digraph) | 
| VertexName | DigraphVertexLabel(5.1-8) | Unlike VertexNamein Grape, the return value ofDigraphVertexLabel(5.1-8) is mutable. | 
| VertexNames | DigraphVertexLabels(5.1-9) | Unlike VertexNamesin Grape, the return value ofDigraphVertexLabels(5.1-9) is mutable. | 
| Vertices | DigraphVertices(5.1-1) | The vertices of a digraph in Digraphs is always the range [1 .. n]wherenis the number of vertices of the digraph. The operationDigraphVertices(5.1-1) behaves the same asVerticesin Grape. | 
| VertexDegree | OutDegreeOfVertex(5.2-9) (see also:InDegreeOfVertex(5.2-11)) | The operation OutDegreeOfVertex(5.2-9) behaves the same asVertexDegreein Grape. | 
| VertexDegrees | OutDegreeSet(5.2-7) (see also:OutDegreeSequence(5.2-7),OutDegrees(5.2-7),InDegrees(5.2-8),InDegreeSequence(5.2-8),InDegreeSet(5.2-8)) | The operation OutDegreeSet(5.2-7) behaves the same asVertexDegreesin Grape. | 
| IsLoopy | DigraphHasLoops(6.1-1) | The operation DigraphHasLoops(6.1-1) behaves the same asIsLoopyin Grape. | 
| IsSimpleGraph | IsSymmetricDigraph(6.1-10) and notDigraphHasLoops(6.1-1) | The Grape function IsSimpleGraphis equivalent toIsSymmetricDigraph(6.1-10) and notDigraphHasLoops(6.1-1). | 
| Adjacency | OutNeighboursOfVertex(5.2-10) (see alsoInNeighboursOfVertex(5.2-12)) | The operation OutNeighboursOfVertex(5.2-10) behaves the same asAdjacencyin Grape. | 
| IsEdge | IsDigraphEdge(5.1-14) | The arguments of IsDigraphEdge(5.1-14) can be a digraph and an edge, or a digraph and two vertices. In the first form the operationIsDigraphEdge(5.1-14) behaves the same asIsEdgein Grape. | 
| DirectedEdges | DigraphEdges(5.1-3) | The attribute DigraphEdges(5.1-3) behaves the same asDirectedEdgesin Grape. | 
| UndirectedEdges | None | There is no analogous function in Digraphs, and no plans to include one. | 
| Distance | DigraphShortestDistance(5.3-2) | The operation DigraphShortestDistance(5.3-2) behaves the same asDistancein Grape. | 
| Diameter | DigraphDiameter(5.3-1) | The attribute DigraphDiameter(5.3-1) behaves the same asDiameterin Grape. | 
| Girth | DigraphUndirectedGirth(5.3-7) | The attribute DigraphUndirectedGirth(5.3-7) behaves the same asGirthin Grape except that in the case that the argument is a forest,infinityis returned by Digraphs whereas-1is returned by Grape. | 
| IsConnectedGraph | IsStronglyConnectedDigraph(6.3-4) | The attribute IsStronglyConnectedDigraph(6.3-4) behaves the same asIsConnectedGraphin Grape. | 
| IsBipartite | IsBipartiteDigraph(6.1-3) andIsSymmetricDigraph(6.1-10) | The Grape function IsBipartiteis equivalent toIsBipartiteDigraph(6.1-3) andIsSymmetricDigraph(6.1-10). | 
| IsNullGraph | IsNullDigraph(6.1-6) orIsEmptyDigraph(6.1-6) | The Grape function IsNullGraphis equivalent toIsEmptyDigraph(6.1-6) and its synonymIsNullDigraph(6.1-6). | 
| IsCompleteGraph | IsCompleteDigraph(6.1-5) | The Grape function IsCompleteGraphis roughly equivalent toIsCompleteDigraph(6.1-5) except that in Digraphs a complete digraph has no loops. | 
| Grape command | Digraphs command | Comments | 
| IsRegularGraph | IsOutRegularDigraph(6.2-2) (see alsoIsInRegularDigraph(6.2-1) andIsRegularDigraph(6.2-3)) | The Grape function IsRegularGraphis equivalent toIsOutRegularDigraph(6.2-2). | 
| LocalParameters | None | The Grape function LocalParametershas no equivalent function in Digraphs, although this might change in the future. | 
| GlobalParameters | None | The Grape function GlobalParametershas no equivalent function in Digraphs, although this might change in the future. | 
| IsDistanceRegular | IsDistanceRegularDigraph(6.2-4) | The Grape function IsDistanceRegularis equivalent toIsDistanceRegularDigraph(6.2-4). | 
| CollapsedAdjacencyMat | None | The Grape function CollapsedAdjacencyMathas no equivalent function in Digraphs, although this might change in the future. | 
| OrbitalGraphColadjMats | None | The Grape function OrbitalGraphColadjMatshas no equivalent function in Digraphs, although this might change in the future. | 
| VertexTransitiveDRGs | None | The Grape function VertexTransitiveDRGshas no equivalent function in Digraphs, although this might change in the future. | 
| Grape command | Digraphs command | Comments | 
| ConnectedComponent | DigraphConnectedComponent(5.3-9) | When applied to a simple di/graph and a vertex, ConnectedComponentin Grape is equivalent toDigraphConnectedComponent(5.3-9).DigraphConnectedComponent(5.3-9) can also be applied to non-simple graphs (in the language of Grape). | 
| ConnectedComponents | DigraphConnectedComponents(5.3-8) | When applied to a simple di/graph, ConnectedComponentsin Grape is equivalent toDigraphConnectedComponents(5.3-8).DigraphConnectedComponents(5.3-8) can also be applied to non-simple graphs (in the language of Grape). | 
| Bicomponents | DigraphBicomponents(5.3-12) | When applied to a simple bipartite di/graph, Bicomponentsin Grape is equivalent toDigraphBicomponents(5.3-12). The definition ofIsBipartiteDigraph(6.1-3) does not require its argument to be simple (in the language of Grape), i.e. the bipartite graphs in Grape are a proper subset of the bipartite digraphs in Digraphs. | 
| DistanceSet | DigraphDistanceSet(5.3-5) | DistanceSetin Grape is equivalent toDigraphDistanceSet(5.3-5) in Digraphs. | 
| Layers | DigraphLayers(5.3-21) | Layersin Grape is equivalent toDigraphLayers(5.3-21) in Digraphs. | 
| IndependentSet | DigraphIndependentSet(8.2-2) | IndependentSetin Grape is equivalent toDigraphIndependentSet(8.2-2) in Digraphs. | 
| Grape command | Digraphs command | Comments | 
| InducedSubgraph | InducedSubdigraph(3.3-2) | InducedSubdigraph(3.3-2) in Digraphs does not allow a third argumentGspecifying a group of automorphisms on the resultant graph. This may be included in a future release. | 
| DistanceSetInduced | None | There is no analogous function in Digraphs, and no plans to include one. | 
| DistanceGraph | DistanceDigraph(3.3-33) | DistanceGraphin Grape is equivalent toDistanceDigraph(3.3-33) in Digraphs. | 
| ComplementGraph | DigraphDual(3.3-8) | DigraphDual(3.3-8) in Digraphs is equivalent toComplementGraphin Grape with the optional argument comploops set totrue(loops/nonloops are complemented). | 
| PointGraph | None | There is no analogous function in Digraphs, and no plans to include one. | 
| EdgeGraph | EdgeUndirectedDigraph(3.3-29) | EdgeGraphin Grape is equivalent toEdgeUndirectedDigraph(3.3-29) in Digraphs. | 
| SwitchedGraph | None | There is no analogous function in Digraphs, and no plans to include one. | 
| UnderlyingGraph | DigraphSymmetricClosure(3.3-9) | UnderlyingGraphin Grape is equivalent toDigraphSymmetricClosure(3.3-9) in Digraphs. | 
| QuotientGraph | QuotientDigraph(3.3-6) | QuotientDigraph(3.3-6) in Digraphs takes a partitionpof the vertices of the digraph, rather than a set of generating pairs. Hence, the equivalence might not be group-invariant. Also note that in Digraphs multiple edges may be created, whereas in Grape they are effectively combined into a single edge. | 
| BipartiteDouble | BipartiteDoubleDigraph(3.3-31) | BipartiteDoublein Grape is equivalent toBipartiteDoubleDigraph(3.3-31) in Digraphs. | 
| GeodesicsGraph | None | There is no analogous function in Digraphs, and no plans to include one. | 
| CollapsedIndependentOrbitsGraph | None | There is no analogous function in Digraphs, although this feature might be implemented in the future. | 
| CollapsedCompleteOrbitsGraph | None | There is no analogous function in Digraphs, although this feature might be implemented in the future. | 
| NewGroupGraph | None | There is no analogous function in Digraphs. However, the same results would be possible by calling DigraphCopy(3.3-1) on the digraph to produce a copygr, and then applyingSetDigraphGroup(gr, G). | 
| Grape command | Digraphs command | Comments | 
| VertexColouring | DigraphColouring(7.3-9) | VertexColouringin Grape is equivalent toDigraphColouring(7.3-9) in Digraphs, except it return a transformation rather than a list of vertex colors. | 
| CompleteSubgraphs | DigraphCliques(8.1-4) | The functionality of CompleteSubgraphsin Grape is provided byDigraphCliques(8.1-4) andDigraphMaximalCliques(8.1-4) in Digraphs. | 
| CompleteSubgraphsOfGivenSize | DigraphCliques(8.1-4) | Much of the functionality of CompleteSubgraphsOfGivenSizein Grape is provided byDigraphCliques(8.1-4) andDigraphMaximalCliques(8.1-4) in Digraphs, except that the functionality relating to vertex weights and partial colourings is not implemented. | 
| Grape command | Digraphs command | Comments | 
| AutGroupGraph | AutomorphismGroup(7.2-1) | AutGroupGraphin Grape is equivalent toAutomorphismGroup(7.2-1) in Digraphs. | 
| GraphIsomorphism | IsomorphismDigraphs(7.2-12) | GraphIsomorphismin Grape is equivalent toIsomorphismDigraphs(7.2-12) in Digraphs. Note however thatGraphIsomorphism's optional argument firstunbindcanon is not applicable, since the canonical labellings of a digraph are not portable between sessions. | 
| IsIsomorphicGraph | IsIsomorphicDigraph(7.2-10) | IsIsomorphicGraphin Grape is equivalent toIsIsomorphicDigraph(7.2-10) in Digraphs. Note however thatIsIsomorphicGraph's optional argument firstunbindcanon is not applicable, since the canonical labellings of a digraph are not portable between sessions. | 
| GraphIsomorphismClassRepresentatives | None | There is no analogous function in Digraphs, although this feature might be implemented in the future. | 
generated by GAPDoc2HTML