Test Tree¶

$digraph genealogy { rankdir=LR; node [shape=box, style=filled, fillcolor="#f0f0f0", fontname="Helvetica"]; edge [fontname="Helvetica", fontsize=10]; splines=ortho; /* Nodes */ Hardware [label="Hardware\n(Root)", fillcolor="#FFD700"]; Binary [label="Binary\n(Trunk)", fillcolor="#DAA520"]; Imperative [label="Imperative\n(Branch)", fillcolor="#ADD8E6"]; Declarative [label="Declarative\n(Branch)", fillcolor="#90EE90"]; Procedural [label="Procedural\n(Paradigm)", fillcolor="#E0FFFF"]; OO [label="Object-Oriented\n(Paradigm)", fillcolor="#E0FFFF"]; Concurrent [label="Concurrent\n(Paradigm)", fillcolor="#E0FFFF"]; Scripting [label="Scripting\n(Paradigm)", fillcolor="#E0FFFF"]; Functional [label="Functional\n(Paradigm)", fillcolor="#F0FFF0"]; Logic [label="Logic\n(Paradigm)", fillcolor="#F0FFF0"]; /* Relationships */ Hardware -> Binary; Binary -> Imperative; Binary -> Declarative; Imperative -> Procedural; Imperative -> OO; Imperative -> Concurrent; Imperative -> Scripting; Declarative -> Functional; Declarative -> Logic; }$