<!ENTITY VERSION '1.9.0'>
<!ENTITY ARCHIVENAME 'digraphs-1.9.0.tar.gz'>
<!ENTITY GAPVERS '4.10.0'>
<!ENTITY IOVERS '4.5.1'>
<!ENTITY ORBVERS '4.8.2'>
<!ENTITY DATASTRUCTURESVERS '0.2.5'>
<!ENTITY GAPDOCVERS '1.6.3'>
<!ENTITY GRAPEVERS '4.8.1'>
<!ENTITY NAUTYTRACESINTERFACEVERS '0.2'>
<!ENTITY AUTODOCVERS '2020.08.11'>
<!ENTITY DIGRAPHS '<Package>Digraphs</Package>'>
<!ENTITY IO '<Alt Not="Text"><URL Text="IO">https://gap-packages.github.io/io</URL></Alt>
    <Alt Only="Text"><Package>IO</Package></Alt>'>
<!ENTITY ORB '<Alt Not="Text"><URL Text="orb">https://gap-packages.github.io/orb</URL></Alt>
    <Alt Only="Text"><Package>orb</Package></Alt>'>
<!ENTITY DATASTRUCTURES '<Alt Not="Text"><URL Text="datastructures">https://gap-packages.github.io/datastructures</URL></Alt>
    <Alt Only="Text"><Package>datastructures</Package></Alt>'>
<!ENTITY GAPDOC '<Alt Not="Text"><URL Text="GAPDoc">http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc</URL></Alt>
    <Alt Only="Text"><Package>GAPDoc</Package></Alt>'>
<!ENTITY GRAPE '<Alt Not="Text"><URL Text="GRAPE">https://gap-packages.github.io/grape</URL></Alt>
    <Alt Only="Text"><Package>GRAPE</Package></Alt>'>
<!ENTITY NAUTYTRACESINTERFACE '<Package>nautytracesinterface</Package>'>
<!ENTITY AUTODOC '<Alt Not="Text"><URL Text="AutoDoc">https://gap-packages.github.io/AutoDoc</URL></Alt>
    <Alt Only="Text"><Package>AutoDoc</Package></Alt>'>
<!ENTITY BLISS '<Alt Not="Text"><URL Text="bliss">http://www.tcs.tkk.fi/Software/bliss/</URL></Alt>
    <Alt Only="Text"><Package>bliss</Package></Alt>'>
<!ENTITY NAUTY '<Alt Not="Text"><URL Text="nauty">https://pallini.di.uniroma1.it</URL></Alt>
    <Alt Only="Text"><Package>nauty</Package></Alt>'>
<!ENTITY NautyTracesInterface '<Alt Not="Text"><URL Text="NautyTracesInterface">https://github.com/gap-packages/NautyTracesInterface</URL></Alt>
    <Alt Only="Text"><Package>NautyTracesInterface</Package></Alt>'>
<!ENTITY EDGE_PLANARITY_SUITE '<Alt Not="Text"><URL Text="edge-addition-planarity-suite">https://github.com/graph-algorithms/edge-addition-planarity-suite</URL></Alt>
    <Alt Only="Text"><Package>edge-addition-planarity-suite</Package></Alt>'>
<!ENTITY MUTABLE_RECOMPUTED_ATTR 'If the argument <A>digraph</A> is
mutable, then the return value of this attribute is recomputed every time it is
called.<P/>'>
<!ENTITY MUTABLE_RECOMPUTED_PROP 'If the argument <A>digraph</A> is
mutable, then the return value of this property is recomputed every time it is
called.<P/>'>
<!ENTITY STANDARD_FILT_TEXT 'If the optional first argument <A>filt</A>
is present, then this should specify the category or representation the digraph
being created will belong to. For example, if <A>filt</A> is <Ref
Filt="IsMutableDigraph"/>, then the digraph being created will be mutable, if
<A>filt</A> is <Ref Filt="IsImmutableDigraph"/>, then the digraph will be
immutable.  If the optional first argument <A>filt</A> is not present, then
<Ref Filt="IsImmutableDigraph"/> is used by default.<P/>'>
<!ENTITY CHESSBOARD_LABELS 'The chosen correspondence between vertices
and chess squares is given by <Ref Oper="DigraphVertexLabels"/>.  In more
detail, the vertices of the digraph are labelled by elements of the Cartesian
product <C>[1..<A>m</A>] x [1..<A>n</A>]</C>, where the first entry indexes the
column (file) of the square in the chessboard, and the second entry indexes the
row (rank) of the square.  (Note that the files are traditionally indexed by
the lowercase letters of the alphabet).  The vertices are sorted in ascending
order, first by row (second component) and then column (first component).'>
<!ENTITY CHESSBOARD_DEFN 'An <A>m</A> by <A>n</A> chessboard is a grid
of <A>m</A> columns ("files") and <A>n</A> rows ("ranks") that intersect in
squares. Orthogonally adjacent squares are alternately colored light and dark,
with the square in the first rank and file being dark.<P/>'>
<!ENTITY Digraphs '<Package>Digraphs</Package>'>
