Merge pull request #37 from ridicoulous/master

get edge TEdgeCustom from node edges implementation

Author: matiii

src/Dijkstra.NET.Tests/EdgeTest.cs

@@ -98,5 +98,26 @@ public void Two_Edges_Should_Be_Diffrent_With_Diffrent_Nodes()
             Assert.False(act);
             Assert.False(act2);
         }
+
+        [Fact]
+        public void Edges_Get_TEdgeCustom_Should_Work()
+        {
+            var g = new Graph<int, string>();
+            g.AddNode(1);
+            g.AddNode(2);
+            g.AddNode(3);
+
+            g.Connect(1, 2, 1, "First");
+            g.Connect(1, 3, 1, "Second");
+
+            var node = g >> 1;
+            var first = node.GetFirstEdgeCustom(2);
+            var second = node.GetFirstEdgeCustom(3);
+
+
+            bool act = first == "First" && second == "Second";
+
+            Assert.True(act);
+        }
     }
 }

src/Dijkstra.NET/Graph/INode.cs

@@ -10,5 +10,6 @@ public interface INode
     public interface INode<T, TEdgeCustom> : INode where TEdgeCustom : IEquatable<TEdgeCustom>
     {
         T Item { get; }
+        TEdgeCustom GetFirstEdgeCustom(int nodeEdgeKey);
     }
 }

src/Dijkstra.NET/Graph/Node.cs

@@ -2,20 +2,20 @@
 using System.Collections.Generic;
 using Dijkstra.NET.PageRank;
 using Dijkstra.NET.ShortestPath;
-
+using System.Linq;
 namespace Dijkstra.NET.Graph
 {
     public class Node<T, TEdgeCustom>: IPageRank, IDijkstra, INode<T, TEdgeCustom> where TEdgeCustom: IEquatable<TEdgeCustom>
     {
+        public Edge<T, TEdgeCustom>[] Edges;
         private readonly HashSet<Node<T,TEdgeCustom>> _parents = new HashSet<Node<T, TEdgeCustom>>();
         private readonly HashSet<uint> _children = new HashSet<uint>();
-        private Edge<T, TEdgeCustom>[] _edges;
 
         internal Node(uint key, T item, Graph<T, TEdgeCustom> graph)
         {
             Key = key;
             Item = item;
-            _edges = new Edge<T, TEdgeCustom>[5];
+            Edges = new Edge<T, TEdgeCustom>[5];
             Graph = graph;
         }
 
@@ -46,17 +46,27 @@ public void EachEdge(Edge edge)
         {
             for (int i = 0; i < EdgesCount; i++)
             {
-                ref Edge<T, TEdgeCustom> e = ref _edges[i];
+                ref Edge<T, TEdgeCustom> e = ref Edges[i];
 
                 edge(e.Node.Key, e.Cost);
             }
         }
-        
+        /// <summary>
+        /// Get custom info from node edges by edge key
+        /// </summary>
+        /// <param name="nodeEdgeKey">edge key</param>
+        /// <returns>TEdgeCustom</returns>
+        public TEdgeCustom GetFirstEdgeCustom(int nodeEdgeKey)
+        {
+            return Edges.First(c => c.Node.Key == nodeEdgeKey).Item;
+        }
+      
+
         internal void AddEdge(in Edge<T, TEdgeCustom> edge)
         {
-            if (_edges.Length == EdgesCount)
+            if (Edges.Length == EdgesCount)
             {
-                int newSize = _edges.Length;
+                int newSize = Edges.Length;
 
                 if (EdgesCount < NodeConstants.MaxSize)
                 {
@@ -69,10 +79,10 @@ internal void AddEdge(in Edge<T, TEdgeCustom> edge)
                     newSize = bigSize < Int32.MaxValue ? (int)bigSize : Int32.MaxValue;
                 }
 
-                Array.Resize(ref _edges, newSize);
+                Array.Resize(ref Edges, newSize);
             }
 
-            _edges[EdgesCount] = edge;
+            Edges[EdgesCount] = edge;
             EdgesCount++;
             _children.Add(edge.Node.Key);
         }