Da Vinci System

The daVinci system uses terms to represent graphs, which distinguishes it from all other graph formats. Terms make the format not easy to read and hard to write. A term consists of a unique string for identification, a type name, a list of attributes, and a list of child nodes. Because each term is uniquely identified, other terms can reference them by name. This way it is possible to construct cyclic graphs. The type name is used to define default values for attributes. An attribute is a string pair, the first entry being the key and the second entry being the value. Unknown keys and attribute values are simply ignored.

The following gives a code example that contains two nodes (called 'one' and 'two') that are connected with an edge. The edge is colored red.

  [ l("one", n("", [],
   [ l("one->two", e("", [a("COLOR", "red")],
      l("two", n("", [], [] )))) ] )) ]

(Quoted from ExchangeFormatBibliography)

The original daVinci home page is located at:

• http://www.informatik.uni-bremen.de/daVinci/

New development of daVinci is commerical:

• http://www.daVinci-Presenter.de/
• http://www.b-novative.com/news/news.html

-- HolgerKienle