remove orphan edges

front/js/svelte/edges/sortEdges.js

@@ -2,7 +2,7 @@ export function sortByField(from, to, edges, fieldName) {
     if (from === to) {
         return edges;
     }
-    let edgesTosort = edges?.filter((ed) => ed.field === fieldName && ed.depth === 1) ?? [];
+    let edgesTosort = edges?.filter((ed) => ed.field === fieldName && ed.depth === 1 ) ?? [];
     let remainingEdge = edges?.filter((ed) => !(ed.field === fieldName && ed.depth === 1)) ?? [];
 
     edgesTosort = array_move(edgesTosort,from, to);

front/js/svelte/libs/Sortable.svelte

@@ -18,6 +18,7 @@
             easing: "cubic-bezier(1, 0, 0, 1)",
             onUpdate: function (/**Event*/ evt) {
                 // reorder(evt.oldIndex,evt.newIndex);
+                console.log(evt)
                 dispatch("update", {
                     source: evt.oldIndex,
                     target: evt.newIndex,

front/js/svelte/records/elements/Reference.svelte

@@ -17,7 +17,7 @@
     $: references = graph.edges
         .filter((edge) => edge.field === field.name)
         .map((edge) => {
-            return graph.records.find((increc) => increc.id == edge.target && record.id == edge.source);
+            return graph.records.find((increc) => increc.id === edge.target && record.id === edge.source);
         }).filter((rec) => (rec?.id ? true : false)) ?? [];
 
     let collections = channel.schemas.filter((aschema) =>

front/js/svelte/records/elements/ReferenceTable.svelte

@@ -21,6 +21,7 @@
         .map((edge) => {
             return graph.records.find((increc) => increc.id === edge.target && record.id === edge.source);
         }).filter((rec) => (rec?.id ? true : false)) ?? [];
+
     let collections = channel.schemas.filter((aschema) =>
         field.collections.includes(aschema.name)
     );