digraph


Also found in: Dictionary, Thesaurus, Wikipedia.

digraph

[′dī‚graf]
(mathematics)

Digraph

 

a combination of two or more letters that indicate a single sound, for example, Polish sz and cz. In Russian known as ligatura, see LIGATURE.

digraph

In some programming languages, a digraph is two common keyboard characters used together that represent one symbol. For example, (* and *) have represented the curly braces { and }. A trigraph uses three characters such as ??- for a tilde ~. Digraphs and trigraphs are methods for ensuring symbols can be entered into source code from an abbreviated keyboard that has fewer keys than a full-size unit.
References in periodicals archive ?
The Phonological Component in the CoST is designed to measure knowledge of the phono-graphic (speech sound to alphabetic letter) representation of initial and final consonants, regular short medial vowels, common digraphs, and medial blends within polysyllabic words (Richards, Aylward, Berninger, et al.
n])) of integer pairs we say that a is digraphical if there is a digraph G = (V, E) with V = {[v.
The digraph G = (V, E) associated with A has n vertices, [v.
Let G be a sub digraph of C- n_1 such that the arcs of G are those of Sk,i in D which are oriented to the centers.
Therefore, in their opinion, any <CC> digraph consisting of two identical elements could be applied not only to show the contrast between single (short) and geminate (long) consonants, but also to indicate vowel shortness.
The information interaction topology among n followers are described by the digraph G as defined above; and the whole system including n + l agents is conveniently modeled by a weighted digraph [bar.
The digraph drawn thus is examined to eliminate transitivity of relationships.
The running of process phases is subject to precedence restrictions whose there is associated the acyclic digraph G = (F,U), where if x, y [member of] F, then (x, y) [member of] U if and only if the beginning of the phase y need finishing of phase x.
The running of process phases is subject to precedence restrictions whose there is associated the acyclic digraph G = (F, U), where if x, y [member of] F, then (x, y) [member of] U if and only if the beginning of the phase y need finishing of phase x.
Digraph analysis has a wide set of applications as a deductive tool, especially in the social sciences, where points often stand for individuals and arcs for relationships between them.
To find the shortest path between two vertices s and t containing maximum number of target vertices on G', the graph G' is converted to a digraph [[vector].
In seventies Leinhardt first proposed the idea of representing a social community by a digraph [8].