GAP (digraphs) - Chapter 4: Operators

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

[MathJax on]

4 Operators
4.1 Operators for digraphs

### 4 Operators

#### 4.1 Operators for digraphs

`digraph1 = digraph2`

  returns `true` if digraph1 and digraph2 have the same vertices, and `DigraphEdges(digraph1) = DigraphEdges(digraph2)`, up to some re-ordering of the edge lists.

  Note that this operator does not compare the vertex labels of digraph1 and digraph2.

`digraph1 < digraph2`

  This operator returns `true` if one of the following holds:

  - The number n_1 of vertices in digraph1 is less than the number n_2 of vertices in digraph2;

  - n_1 = n_2, and the number m_1 of edges in digraph1 is less than the number m_2 of edges in digraph2;

  - n_1 = n_2, m_1 = m_2, and `DigraphEdges(digraph1)` is less than `DigraphEdges(digraph2)` after having both of these sets have been sorted with respect to the lexicographical order.

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

generated by GAPDoc2HTML