Persistent Data Structure - Confluently Persistent

Confluently Persistent

In confluently persistent model, we use combinatiors to combine input of more than one previous versions to output a new single version. Rather than a branching tree, combinations of versions induce a DAG (directed acyclic graph) structure on the version graph.

Read more about this topic:  Persistent Data Structure

Famous quotes containing the word persistent:

    The smallest flower is a thought, a life answering to some feature of the Great Whole, of whom they have a persistent intuition.
    HonorĂ© De Balzac (1799–1850)