Differences

This shows you the differences between two versions of the page.

--- 01_user_documentation:06_graph:01_edge [2025/08/25 08:59] – gaetan
+++ 01_user_documentation:06_graph:01_edge [2025/09/05 15:25] (current) – gaetan
@@ Line 1: / Line 1: @@
 ====== Edge ======
-Edges are the base element of the graphs. Indeed, the GroIMP implementation of graph define [[:01_user_documentation:06_graph:02_node|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.
+Edges link [[:01_user_documentation:06_graph:02_node|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 in the edge.