‣ DigraphHasLoops ( digraph ) | ( property ) |
Returns: true
or false
.
Returns true
if the digraph digraph is has loops, and false
if it does not. A loop is an edge with equal source and range.
gap> gr := Digraph( [ [ 1, 2 ], [ 2 ] ] ); <digraph with 2 vertices, 3 edges> gap> DigraphEdges(gr); [ [ 1, 1 ], [ 1, 2 ], [ 2, 2 ] ] gap> DigraphHasLoops(gr); true gap> gr := Digraph( [ [ 2, 3 ], [ 1 ], [ 2 ] ] ); <digraph with 3 vertices, 4 edges> gap> DigraphEdges(gr); [ [ 1, 2 ], [ 1, 3 ], [ 2, 1 ], [ 3, 2 ] ] gap> DigraphHasLoops(gr); false
‣ IsAntisymmetricDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is antisymmetric, and false
if it is not.
A digraph is antisymmetric if whenever there is an edge with source u
and range v
, and an edge with source v
and range u
, then the vertices u
and v
are equal.
gap> gr1 := Digraph( [ [ 2 ], [ 1, 3 ], [ 2, 3 ] ] ); <digraph with 3 vertices, 5 edges> gap> IsAntisymmetricDigraph(gr1); false gap> DigraphEdges(gr1){[ 1, 2 ]}; [ [ 1, 2 ], [ 2, 1 ] ] gap> gr2 := Digraph( [ [ 1, 2 ], [ 3, 3 ], [ 1 ] ] ); <multidigraph with 3 vertices, 5 edges> gap> IsAntisymmetricDigraph(gr2); true gap> DigraphEdges(gr2); [ [ 1, 1 ], [ 1, 2 ], [ 2, 3 ], [ 2, 3 ], [ 3, 1 ] ]
‣ IsBipartiteDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is bipartite, and false
if it is not. A digraph is bipartite if and only if the vertices of digraph can be partitioned into two non-empty sets such that the source and range of any edge of digraph lie in distinct sets. Equivalently, a digraph is bipartite if and only if it is 2-colorable; see DigraphColoring
(7.3-9).
See also DigraphBicomponents
(5.1-8).
gap> gr := ChainDigraph(4); <digraph with 4 vertices, 3 edges> gap> IsBipartiteDigraph(gr); true gap> gr := CycleDigraph(3); <digraph with 3 vertices, 3 edges> gap> IsBipartiteDigraph(gr); false
‣ IsCompleteBipartiteDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
Returns true
if the digraph digraph is a complete bipartite digraph, and false
if it is not.
A digraph is a complete bipartite digraph if it is bipartite, see IsBipartiteDigraph
(6.1-3), and there exists a unique edge with source i
and range j
if and only if i
and j
lie in different bicomponents of digraph, see DigraphBicomponents
(5.1-8).
Equivalently, a bipartite digraph with bicomponents of size m and n is complete precisely when it has 2mn edges, none of which are multiple edges.
See also CompleteBipartiteDigraph
(3.5-3).
gap> gr := CycleDigraph(2); <digraph with 2 vertices, 2 edges> gap> IsCompleteBipartiteDigraph(gr); true gap> gr := CycleDigraph(4); <digraph with 4 vertices, 4 edges> gap> IsBipartiteDigraph(gr); true gap> IsCompleteBipartiteDigraph(gr); false
‣ IsCompleteDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
Returns true
if the digraph digraph is complete, and false
if it is not.
A digraph is complete if it has no loops, and for all distinct vertices i
and j
, there is exactly one edge with source i
and range j
. Equivalently, a digraph with n vertices is complete precisely when it has n(n - 1) edges, no loops, and no multiple edges.
gap> gr := Digraph( [ [ 2, 3 ], [ 1, 3 ], [ 1, 2 ] ] ); <digraph with 3 vertices, 6 edges> gap> IsCompleteDigraph(gr); true gap> gr := Digraph( [ [ 2, 2 ], [ 1 ] ] ); <multidigraph with 2 vertices, 3 edges> gap> IsCompleteDigraph(gr); false
‣ IsEmptyDigraph ( digraph ) | ( property ) |
‣ IsNullDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
Returns true
if the digraph digraph is empty, and false
if it is not. A digraph is empty if it has no edges.
IsNullDigraph
is a synonym for IsEmptyDigraph
.
gap> gr := Digraph( [ [ ], [ ] ] ); <digraph with 2 vertices, 0 edges> gap> IsEmptyDigraph(gr); true gap> IsNullDigraph(gr); true gap> gr := Digraph( [ [ ], [ 1 ] ] ); <digraph with 2 vertices, 1 edge> gap> IsEmptyDigraph(gr); false gap> IsNullDigraph(gr); false
‣ IsFunctionalDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is functional.
A digraph is functional if every vertex is the source of a unique edge.
gap> gr1 := Digraph( [ [ 3 ], [ 2 ], [ 2 ], [ 1 ], [ 6 ], [ 5 ] ] ); <digraph with 6 vertices, 6 edges> gap> IsFunctionalDigraph(gr1); true gap> gr2 := Digraph( [ [ 1, 2 ], [ 1 ] ] ); <digraph with 2 vertices, 3 edges> gap> IsFunctionalDigraph(gr2); false gap> gr3 := Digraph( 3, [ 1, 2, 3 ], [ 2, 3, 1 ] ); <digraph with 3 vertices, 3 edges> gap> IsFunctionalDigraph(gr3); true
‣ IsMultiDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
A multidigraph is one that has at least two edges with equal source and range.
gap> gr := Digraph(["a", "b", "c"], ["a", "b", "b"], ["b", "c", "a"]); <digraph with 3 vertices, 3 edges> gap> IsMultiDigraph(gr); false gap> gr := Digraph(3, [1, 2, 3, 1, 1, 2], [1, 2, 3, 2, 3, 1]); <digraph with 3 vertices, 6 edges> gap> IsMultiDigraph(gr); false gap> gr := Digraph(3, [1, 2, 3, 1, 1, 2, 1], [1, 2, 3, 2, 3, 1, 2]); <multidigraph with 3 vertices, 7 edges> gap> IsMultiDigraph(gr); true
‣ IsReflexiveDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is reflexive, and false
if it is not. A digraph is reflexive if it has a loop at every vertex.
gap> gr := Digraph( [ [ 1, 2 ], [ 2 ] ] ); <digraph with 2 vertices, 3 edges> gap> IsReflexiveDigraph(gr); true gap> gr := Digraph( rec ( nrvertices := 4, > source := [ 1, 1, 2, 2, 3, 4, 4 ], > range := [ 3, 1, 4, 2, 3, 2, 1 ] ) ); <digraph with 4 vertices, 7 edges> gap> IsReflexiveDigraph(gr); false
‣ IsSymmetricDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is symmetric, and false
if it is not.
A symmetric digraph is one where for each non-loop edge, having source u and range v, there is a corresponding edge with source v and range u. If there are n edges with source u and range v, then there must be precisely n edges with source v and range u. In other words, an undirected digraph has a symmetric adjacency matrix AdjacencyMatrix
(5.2-1).
gap> gr1 := Digraph( [ [ 2 ], [ 1, 3 ], [ 2, 3 ] ] ); <digraph with 3 vertices, 5 edges> gap> IsSymmetricDigraph(gr1); true gap> adj1 := AdjacencyMatrix(gr1);; gap> Display(adj1); [ [ 0, 1, 0 ], [ 1, 0, 1 ], [ 0, 1, 1 ] ] gap> adj1 = TransposedMat(adj1); true gap> gr1 = DigraphReverse(gr1); true gap> gr2 := Digraph( [ [ 2, 3 ], [ 1, 3 ], [ 2, 3 ] ] ); <digraph with 3 vertices, 6 edges> gap> IsSymmetricDigraph(gr2); false gap> adj2 := AdjacencyMatrix(gr2);; gap> Display(adj2); [ [ 0, 1, 1 ], [ 1, 0, 1 ], [ 0, 1, 1 ] ] gap> adj2 = TransposedMat(adj2); false
‣ IsTournament ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is a tournament, and false
if it is not.
A tournament is an orientation of a complete (undirected) graph. Specifically, a tournament is a digraph which has a unique directed edge (of some orientation) between any pair of distinct vertices, and no loops.
gap> gr := Digraph( [ [ 2, 3, 4 ], [ 3, 4 ], [ 4 ], [ ] ] ); <digraph with 4 vertices, 6 edges> gap> IsTournament(gr); true gap> gr := Digraph( [ [ 2 ], [ 1 ], [ 3 ] ] ); <digraph with 3 vertices, 3 edges> gap> IsTournament(gr); false
‣ IsTransitiveDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is transitive, and false
if it is not. A digraph is transitive if whenever [ i, j ]
and [ j, k ]
are edges of the digraph, then [ i, k ]
is also an edge of the digraph.
Let n be the number of vertices of an arbitrary digraph, and let m be the number of edges. For general digraphs, the methods used for this property use a version of the Floyd-Warshall algorithm, and have complexity O(n^3). However for digraphs which are topologically sortable [DigraphTopologicalSort
(5.1-7)], then methods with complexity O(m + n + m ⋅ n) will be used when appropriate.
gap> gr := Digraph( [ [ 1, 2 ], [ 3 ], [ 3 ] ] ); <digraph with 3 vertices, 4 edges> gap> IsTransitiveDigraph(gr); false gap> gr2 := Digraph( [ [ 1, 2, 3 ], [ 3 ], [ 3 ] ] ); <digraph with 3 vertices, 5 edges> gap> IsTransitiveDigraph(gr2); true gap> gr2 = DigraphTransitiveClosure(gr); true gap> gr3 := Digraph( [ [ 1, 2, 2, 3 ], [ 3, 3 ], [ 3 ] ] ); <multidigraph with 3 vertices, 7 edges> gap> IsTransitiveDigraph(gr3); true
‣ IsInRegularDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if there is an integer n
such that for every vertex v
of digraph digraph there are exactly n
edges terminating in v
. See also IsOutRegularDigraph
(6.2-2) and IsRegularDigraph
(6.2-3).
gap> IsInRegularDigraph(CompleteDigraph(4)); true gap> IsInRegularDigraph(ChainDigraph(4)); false
‣ IsOutRegularDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if there is an integer n
such that for every vertex v
of digraph digraph there are exactly n
edges starting at v
. See also IsInRegularDigraph
(6.2-1) and IsRegularDigraph
(6.2-3).
gap> IsOutRegularDigraph(CompleteDigraph(4)); true gap> IsOutRegularDigraph(ChainDigraph(4)); false
‣ IsRegularDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if there is an integer n
such that for every vertex v
of digraph digraph there are exactly n
edges starting and terminating at v
. In other words, the property is true
if digraph is both in-regular and and out-regular. See also IsInRegularDigraph
(6.2-1) and IsOutRegularDigraph
(6.2-2).
gap> IsRegularDigraph(CompleteDigraph(4)); true gap> IsRegularDigraph(ChainDigraph(4)); false
‣ IsDistanceRegularDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
If digraph is a connected symmetric graph, this property returns true
if for any two vertices u
and v
of digraph and any two integers i
and j
between 0
and the diameter of digraph, the number of vertices at distance i
from u
and distance j
from v
depends only on i
, j
, and the distance between vertices u
and v
.
Alternatively, a distance regular graph is a graph for which there exist integers b_i
, c_i
, and i
such that for any two vertices u
, v
in digraph which are distance i
apart, there are exactly b_i
neighbors of v
which are at distance i - 1
away from u
, and c_i
neighbors of v
which are at distance i + 1
away from u
. This definition is used to check whether digraph is distance regular.
In the case where digraph is not symmetric or not connected, the property is false
.
gap> gr := DigraphSymmetricClosure(ChainDigraph(5));; gap> IsDistanceRegularDigraph(gr); false gap> gr := Digraph([[2, 3, 4], [1, 3, 4], [1, 2, 4], [1, 2, 3]]); <digraph with 4 vertices, 12 edges> gap> IsDistanceRegularDigraph(gr); true
‣ IsAcyclicDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
Returns true
if the digraph digraph is acyclic and false
if it is not. A digraph is acyclic if there are no cycles, i.e. if there are no directed walks which start and end at the same vertex.
The method used in this operation has complexity O(m+n) where m is the number of edges (counting multiple edges as one) and n is the number of vertices in the digraph.
gap> Petersen := Graph( SymmetricGroup(5), [ [ 1, 2 ] ], OnSets, > function(x, y) return IsEmpty(Intersection(x, y)); end );; gap> gr:=Digraph(Petersen); <digraph with 10 vertices, 30 edges> gap> IsAcyclicDigraph(gr); false gap> gr:=Digraph( [ [ ], [ 1 ], [ 1 ], [ 1 ], [ 3 ], [ 3 ], > [ 4 ], [ 4 ], [ 5 ], [ 5 ], [ 5 ], [ 6 ], [ 6 ], [ 7 ], [ 7 ], > [ 7 ], [ 8 ], [ 9 ], [ 9 ], [ 11 ], [ 11 ], [ 12 ], [ 12 ], [ 13 ], > [ 14 ], [ 15 ], [ 15 ], [ 16 ], [ 16 ], [ 17 ], [ 17 ], [ 18 ], > [ 18 ], [ 19 ], [ 20 ], [ 20 ], [ 21 ], [ 22 ], [ 22 ], [ 23 ], > [ 23 ], [ 24 ], [ 28 ], [ 29 ], [ 30 ], [ 30 ], [ 31 ], [ 32 ], > [ 32 ], [ 33 ], [ 34 ], [ 41 ], [ 46 ], [ 47 ], [ 51 ] ] );; gap> IsAcyclicDigraph(gr); true
‣ IsConnectedDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is weakly connected and false
if it is not. A digraph digraph is weakly connected if it is possible to travel from any vertex to any other vertex by traversing edges in either direction (possibly against the orientation of some of them).
The method used in this function has complexity O(m) if the digraph's DigraphSource
(5.2-4) attribute is set, otherwise it has complexity O(m+n) (where m is the number of edges and n is the number of vertices of the digraph).
gap> gr := Digraph( [ [ 2 ], [ 3 ], [ ] ] );; gap> IsConnectedDigraph(gr); true gap> gr := Digraph( [ [ 1, 3 ], [ 4 ], [ 3 ], [ ] ] );; gap> IsConnectedDigraph(gr); false
‣ IsStronglyConnectedDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is strongly connected and false
if it is not. A digraph digraph is strongly connected if there is a directed path from every vertex to every other vertex.
The method used in this operation is based on Gabow's Algorithm [Gab00] and has complexity O(m+n), where m is the number of edges (counting multiple edges as one) and n is the number of vertices in the digraph.
gap> gr := CycleDigraph(250000); <digraph with 250000 vertices, 250000 edges> gap> IsStronglyConnectedDigraph(gr); true gap> gr:=DigraphRemoveEdges(gr, [ [ 250000, 1 ] ]); <digraph with 250000 vertices, 249999 edges> gap> IsStronglyConnectedDigraph(gr); false
‣ IsAperiodicDigraph ( digraph ) | ( property ) |
Returns: true
or false
.
This property is true
if the digraph digraph is aperiodic, i.e. if its DigraphPeriod
(5.3-12) is equal to 1. Otherwise, the property is false
.
gap> gr := Digraph( [ [ 6 ], [ 1 ], [ 2 ], [ 3 ], [ 4, 4 ], [ 5 ] ] ); <multidigraph with 6 vertices, 7 edges> gap> IsAperiodicDigraph(gr); false gap> gr := Digraph( [ [ 2 ], [ 3, 5 ], [ 4 ], [ 5 ], [ 1, 2 ] ] ); <digraph with 5 vertices, 7 edges> gap> IsAperiodicDigraph(gr); true
generated by GAPDoc2HTML