https://dokuwiki.grogra.de/ 2026-05-16T07:25:12+00:00 https://dokuwiki.grogra.de/ https://dokuwiki.grogra.de/lib/exe/fetch.php?media=wiki:dokuwiki.svg text/html 2025-09-05T13:25:36+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:01_edge&rev=1757078736&do=diff Edge Edges link nodes together. Each edge have exactly one source and one target. The source and target can be the same node. In that case the node has an edge toward itself. By default, edges cannot hold data other than one integer (the edgebits). The edgebits define which type of edge it is. The type of edge is tested with bit operations. Thus, an edge can be of several type. Additionally there is a specific way of using a Node as an edge (called EdgeNode) in order to hold more information i… text/html 2025-09-05T13:28:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:02_node&rev=1757078890&do=diff Node Nodes are the base element of the graphs. The GroIMP implementation of graph define nodes as extending edges. This design enables to save memory as, if two nodes are connected by only one edge, no edge object is required. The information of the edge is hosted in the nodes. text/html 2025-11-21T15:09:34+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:03_graphs&rev=1763737774&do=diff Graphs This section present the different type of graphs. Graphs are set of nodes connected by edges. A graph can have several roots, which represents subgraphs that can be either interconnected, or independants. Project graph The project graph contains all primary graphs of the project. Note that despite being called text/html 2025-01-30T09:50:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:04_visitor&rev=1738230657&do=diff Visitor This section present how the graph is visited. Edge pattern This includes/ excludes patterns during the visitation. Instantiation Instantiations are additional transient “sub-graphs” that can be resolved by a visitor. The most common example of instantiation is the additional 3D shapes added to a Node when it is represented in the 3D scene. The objects created in the instantiation are linked to the Node who have declare that instantiation. (For instance, the text/html 2025-11-03T04:36:08+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:05_derivation&rev=1762144568&do=diff Derivation According to the XL language specification, the XL queries are applied in parallel. In order to make sure the queries and rules are applied in parallel without concurrency access, GroIMP implementation use transactions and queues. Transaction Not sure if this should be a section or a text/html 2025-09-05T13:49:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:06_extent&rev=1757080182&do=diff Extent A special feature of the graph management is the manipulation of extents. For each used node class in the graph, there exists an Extent which collects all nodes of this class and also has a link to the extent of its superclass and to the extents of its subclasses. This feature is currently used within the RGG plug-in for a fast processing of queries which specify node type patterns like in the rule text/html 2025-01-30T09:53:18+00:00 Anonymous (anonymous@undisclosed.example.com) https://dokuwiki.grogra.de/doku.php?id=01_user_documentation:06_graph:07_persistence&rev=1738230798&do=diff Persistence This section present what persistence means in the graph. Code enhancement The code required for the persistence can be automatically added in a java project with //enh: commands. Then, the maven build will automatically process the file into adding the required code.