Nasdanika Models
Composite Connection Source Composite Connection Target Composite Node Connection Connection Source Connection Target Documented Named Composite Connection Source Documented Named Composite Connection Target Documented Named Composite Node Documented Named Connection Documented Named Connection Source Documented Named Connection Target Documented Named Graph Documented Named Graph Element Documented Named Node Documented Named Sub-Graph Documented Named Tunnel Graph Graph Element Node Sub-graph Tunnel

elements

Graph elements uniquely identified by a string. This allows to implement graph inheritance - deriving a graph from another graph by removing, adding and replacing graph elements similar to how inheritance works in object-oriented languages.