This is a list of digraphs used in various Latin alphabets. Capitalization involves only the first letter (ch – Ch) unless otherwise stated (ij – IJ).
Letters with diacritics are arranged in alphabetic order according to their base. That is, ⟨å⟩ is alphabetized with ⟨a⟩, not at the end of the alphabet as it would be in Norwegian, Swedish and Danish. Substantially modified letters such as ⟨ſ ⟩ (a variant of ⟨s⟩) and ⟨ɔ⟩ (based on ⟨o⟩) are placed at the end.
⟨’b⟩ (capital ⟨’B⟩) is used in the Bari alphabet for /ɓ/.
⟨’d⟩ (capital ⟨’D⟩) is used in the Bari alphabet for /ɗ/.
⟨’y⟩ (capital ⟨’Y⟩) is used in the Bari alphabet for /ʔʲ/. It is also used for this sound in the Hausa language in Nigeria, but in Niger, Hausa ⟨’y⟩ is replaced with ⟨ƴ ⟩.
⟨a’⟩ is used in Taa orthography, where it represents the glottalized or creaky-voiced vowel /a̰/.
⟨aa⟩ is used in the orthographies of Dutch, Finnish and other languages with phonemic long vowels for /aː/. It was formerly used in Danish and Norwegian (and still is in some proper names) for the sound /ɔ/, now spelled ⟨å⟩.
Digraph may refer to:
In computer programming, digraphs and trigraphs are sequences of two and three characters, respectively, that appear in source code and, according to a programming language specification, should be treated as if they were single characters.
Various reasons exist for using digraphs and trigraphs: keyboards may not have keys to cover the entire character set of the language, input of special characters may be difficult, text editors may reserve some characters for special use and so on. Trigraphs might also be used for some EBCDIC code pages that lack characters such as {
and }
.
The basic character set of the C programming language is a subset of the ASCII character set that includes nine characters which lie outside the ISO 646 invariant character set. This can pose a problem for writing source code when the encoding (and possibly keyboard) being used does not support any of these nine characters. The ANSI C committee invented trigraphs as a way of entering source code using keyboards that support any version of the ISO 646 character set.
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph, or set of vertices connected by edges, where the edges have a direction associated with them. In formal terms, a directed graph is an ordered pair G = (V, A) (sometimes G = (V, E)) where
It differs from an ordinary or undirected graph, in that the latter is defined in terms of unordered pairs of vertices, which are usually called edges, arcs, or lines.
A directed graph is called a simple digraph if it has no multiple arrows (two or more edges that connect the same two vertices in the same direction) and no loops (edges that connect vertices to themselves). A directed graph is called a directed multigraph or multidigraph if it may have multiple arrows (and sometimes loops). In the latter case the arrow set forms a multiset, rather than a set, of ordered pairs of vertices.