| Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/GAP/pkg/digraphs/doc/ (Algebra von RWTH Aachen Version 4.15.1©) Datei vom 27.8.2025 mit Größe 3 kB |
|
Quelle _entities.xml Sprache: XML |
|||||||||
|
<!ENTITY VERSION '1.13.1'>
<!ENTITY ARCHIVENAME 'digraphs-1.13.1.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 ' <!ENTITY IO ' <Alt Only="Text"><Package>IO</Package></Alt>'> <!ENTITY ORB ' <!ENTITY DATASTRUCTURES ' <!ENTITY GAPDOC ' <Alt Only="Text"><Package>GAPDoc</Package></Alt>'> <!ENTITY GRAPE ' <Alt Only="Text"><Package>GRAPE</Package></Alt>'> <!ENTITY NAUTYTRACESINTERFACE ' <!ENTITY AUTODOC ' <Alt Only="Text"><Package>AutoDoc</Package></Alt>'> <!ENTITY BLISS ' <Alt Only="Text"><Package>bliss</Package></Alt>'> <!ENTITY NAUTY ' <Alt Only="Text"><Package>nauty</Package></Alt>'> <!ENTITY NautyTracesInterface ' <Alt Only="Text"><Package>NautyTracesInterface</Package></Alt>'> <!ENTITY EDGE_PLANARITY_SUITE ' <Alt Only="Text"><Package>edge-addition-planarity-suite</Package></Alt>'> <!ENTITY MUTABLE_RECOMPUTED_ATTR 'If the argument digraph is mutable, then the return value of this attribute is recomputed every time it is called.<P/>'> <!ENTITY MUTABLE_RECOMPUTED_PROP 'If the argument digraph 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 filt 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 m by n 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 ' ¤ Dauer der Verarbeitung: 0.26 Sekunden (vorverarbeitet) ¤*© Formatika GbR, Deutschland |
|
2026-03-28