Nh (digraph)

Nh is a digraph of the Latin alphabet, a combination of N and H. Together with lh and the interpunct, it is a typical feature of Occitan, a language illustrated by medieval troubadours.

African languages

In some African languages, nh, such as Gogo, it's a voiceless /n̥/.

In the pre-1985 orthography of Guinea for its languages, nh represented a velar [ŋ], which is currently written ŋ.

Asian languages

In the Gwoyeu Romatzyh romanization of Mandarin Chinese, initial nh- indicates an even tone on a syllable beginning in [n], which is otherwise spelled n-.

Japanese

Early romanizations of Japanese, influenced by Portuguese orthography, sometimes used nh to represent a prepalatal. Today, this is usually written ny.

Vietnamese

In Vietnamese, nh represents a palatal [ɲ] word-initially. It was formerly considered a distinct letter, but is no longer. When this digraph occurs word-finally, its phonetic value varies between dialects:

Digraph

Digraph may refer to:

Digraphs and trigraphs

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 }.

History

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.

Directed graph

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.