At the core of execution is the graph, made up of vertices and their links. A\nvertex is described by a class, detailing its attributes. The vertex also has a\nstore of links, themselves described by an appropriate class. Each Vertex has\na unique numerical id, and a list of its links. Each Link has a target\nvertex, referenced by its id.
One of the key constraints imposed that ensure distributability, is the\nisolation of each vertex from every other vertex. This means no direct access\nto the attributes of another vertex, whether read or write.
\nGiven that vertices cannot interact directly, they must act indirectly, through\nMessages.
","headings":[{"value":"Isolation","depth":2}],"frontmatter":{"title":"The Graph","toc":null,"experimental":null}},"site":{"siteMetadata":{"title":"Simudyne Docs","latestVersion":"2.6"}}},"pageContext":{"absolutePath":"/home/vsts/work/1/s/content/2.2/reference/graph_computation/graph.md","versioned":true,"version":"2.2","kind":"reference","pagePath":"/reference/graph_computation/graph","chronology":{"prev":{"name":"Graph Computation","path":"/reference/graph_computation"},"next":{"name":"Messaging","path":"/reference/graph_computation/messaging"}},"lastUpdated":"2026-04-21T13:56:54.837Z"}}