Directed Acyclic Graph - Paths With Shared Structure

Paths With Shared Structure

A third type of application of directed acyclic graphs arises in representing a set of sequences as paths in a graph. For example, the directed acyclic word graph is a data structure in computer science formed by a directed acyclic graph with a single source and with edges labeled by letters or symbols; the paths from the source to the sinks in this graph represent a set of strings, such as English words. Any set of sequences can be represented as paths in a tree, by forming a tree node for every prefix of a sequence and making the parent of one of these nodes represent the sequence with one fewer element; the tree formed in this way for a set of strings is called a trie. A directed acyclic word graph saves space over a trie by allowing paths to diverge and rejoin, so that a set of words with the same possible suffixes can be represented by a single tree node.

The same idea of using a DAG to represent a family of paths occurs in the binary decision diagram, a DAG-based data structure for representing binary functions. In a binary decision diagram, each non-sink vertex is labeled by the name of a binary variable, and each sink and each edge is labeled by a 0 or 1. The function value for any truth assignment to the variables is the value at the sink found by following a path, starting from the single source vertex, that at each non-sink vertex follows the outgoing edge labeled with the value of that vertex's variable. Just as directed acyclic word graphs can be viewed as a compressed form of tries, binary decision diagrams can be viewed as compressed forms of decision trees that save space by allowing paths to rejoin when they agree on the results of all remaining decisions.

In many randomized algorithms in computational geometry, the algorithm maintains a history DAG representing features of some geometric construction that have been replaced by later finer-scale features; point location queries may be answered, as for the above two data structures, by following paths in this DAG.

Read more about this topic:  Directed Acyclic Graph

Famous quotes containing the words paths, shared and/or structure:

    Fair is my Love, and cruel as she’s fair
    Her brow shades frowns, although her eyes are sunny;
    Her smiles are lightning, though her pride despair;
    And her disdains are gall, her favours honey.
    A modest maid, decked with a blush of honour,
    Whose feet do tread green paths of youth and love,
    Samuel Daniel (1562–1619)

    The danger lies in forgetting what we had. The flow between generations becomes a trickle, grandchildren tape-recording grandparents’ memories on special occasions perhaps—no casual storytelling jogged by daily life, there being no shared daily life what with migrations, exiles, diasporas, rendings, the search for work. Or there is a shared daily life riddled with holes of silence.
    Adrienne Rich (b. 1929)

    Agnosticism is a perfectly respectable and tenable philosophical position; it is not dogmatic and makes no pronouncements about the ultimate truths of the universe. It remains open to evidence and persuasion; lacking faith, it nevertheless does not deride faith. Atheism, on the other hand, is as unyielding and dogmatic about religious belief as true believers are about heathens. It tries to use reason to demolish a structure that is not built upon reason.
    Sydney J. Harris (1917–1986)