Disconnect nodes

Author: mitchellri

src/Dijkstra.NET/Graph/Graph.cs

@@ -69,6 +69,23 @@ public bool Connect(uint from, uint to, int cost, TEdgeCustom custom)
             return true;
         }
 
+        /// <summary>
+        /// Disconnect node to from node from
+        /// </summary>
+        /// <param name="from">First node</param>
+        /// <param name="to">Second node</param>
+        /// <returns>Returns true if nodes disconnected</returns>
+        public bool Disconnect(uint from, uint to)
+        {
+            if (!_nodes.ContainsKey(from) || !_nodes.ContainsKey(to))
+                return false;
+
+            Node<T,TEdgeCustom> nodeFrom = _nodes[from];
+            Node<T, TEdgeCustom> nodeTo = _nodes[to];
+
+            return nodeTo.RemoveParent(nodeFrom) & nodeFrom.RemoveEdge(to);
+        }
+
         public IEnumerator<INode<T, TEdgeCustom>> GetEnumerator() => _nodes.Select(x => x.Value).GetEnumerator();
 
         IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();

src/Dijkstra.NET/Graph/Node.cs

@@ -94,11 +94,30 @@ internal void AddEdge(in Edge<T, TEdgeCustom> edge)
             EdgesCount++;
         }
 
+        internal bool RemoveEdge(in uint to)
+        {
+            for (int i = 0; i < EdgesCount; i++)
+            {
+                if (_edges[i].Node.Key == to)
+                {
+                    EdgesCount--;
+                    _edges[i] = _edges[EdgesCount];
+                    return true;
+                }
+            }
+            return true;
+        }
+
         internal void AddParent(Node<T, TEdgeCustom> parent)
         {
             _parents.Add(parent);
         }
 
+        internal bool RemoveParent(Node<T, TEdgeCustom> parent)
+        {
+            return _parents.Remove(parent);
+        }
+
         public override int GetHashCode()
         {
             return Key.GetHashCode();