Added small fix to stop edges returning self loops twice

python/tests/test_graphdb.py

@@ -167,7 +167,7 @@ def test_windowed_graph_edges():
         for e in e_iter:
             edges.append([e.src.id, e.dst.id])
 
-    assert edges == [[1, 1], [1, 1], [1, 2], [1, 3], [1, 2], [3, 2], [1, 3], [3, 2]]
+    assert edges == [[1, 1], [1, 2], [1, 3], [1, 2], [3, 2], [1, 3], [3, 2]]
 
     tedges = [v.in_edges for v in view.nodes]
     in_edges = []

raphtory/src/db/graph/graph.rs

@@ -19,7 +19,7 @@
 use crate::{
     core::{entities::graph::tgraph::InnerTemporalGraph, utils::errors::GraphError},
     db::api::{
         mutation::internal::{InheritAdditionOps, InheritMutationOps, InheritPropertyAdditionOps},
         view::internal::{Base, InheritViewOps, MaterializedGraph, Static},
     },
     prelude::*,
@@ -560,7 +560,7 @@
             g.add_edge(*t, *src, *dst, NO_PROPS, None).unwrap();
         }
 
-        let expected = vec![(2, 3, 2), (1, 0, 0), (1, 0, 0)];
+        let expected = vec![(2, 3, 1), (1, 0, 0), (1, 0, 0)];
         let actual = (1..=3)
             .map(|i| {
                 let v = g.node(i).unwrap();

raphtory/src/db/internal/graph_ops.rs

@@ -173,6 +173,7 @@ impl<'graph, const N: usize> GraphOps<'graph> for InnerTemporalGraph<N> {
             }
             Direction::BOTH => Box::new(
                 self.node_edges(v, Direction::IN, layers.clone(), filter)
+                    .filter(|e| e.src() != e.dst())
                     .merge(self.node_edges(v, Direction::OUT, layers, filter)),
             ),
         }