ShortestPath extension to getting custom info chain implemented

src/Dijkstra.NET.Tests/EdgeTest.cs

@@ -1,4 +1,6 @@
 using Dijkstra.NET.Graph;
+using Dijkstra.NET.ShortestPath;
+using System.Linq;
 using Xunit;
 
 namespace Dijkstra.NET.Tests
@@ -119,5 +121,32 @@ public void Edges_Get_TEdgeCustom_Should_Work()
 
             Assert.True(act);
         }
+        [Fact]
+        public void Edges_Get_Full_Path_Custom()
+        {
+            var g = new Graph<int, string>();
+            g.AddNode(1);
+            g.AddNode(2);
+            g.AddNode(3);
+
+            g.Connect(1, 2, 1, "First");
+            g.Connect(2, 3, 1, "Second");
+
+            var path = g.Dijkstra(1, 3);
+            var pathCustom = path.GetPathEdgesCustom(g);
+            var pathCustomReversed = path.GetReversedPathEdgesCustom(g);
+
+            bool act = pathCustom.Count() == 2;
+            bool act2 = pathCustomReversed.Count() == 2;
+            bool act3 = pathCustom.First() == "First";
+            bool act4 = pathCustomReversed.First() == "Second";
+
+            Assert.True(act);
+            Assert.True(act2);
+            Assert.True(act3);
+            Assert.True(act3);
+
+        }
+
     }
 }

src/Dijkstra.NET/Graph/Node.cs

@@ -59,8 +59,7 @@ public void EachEdge(Edge edge)
         public TEdgeCustom GetFirstEdgeCustom(int nodeEdgeKey)
         {
             return Edges.First(c => c.Node.Key == nodeEdgeKey).Item;
-        }
-
+        }      
 
         internal void AddEdge(in Edge<T, TEdgeCustom> edge)
         {

src/Dijkstra.NET/ShortestPath/ShortestPathExtensions.cs

@@ -0,0 +1,45 @@
+using Dijkstra.NET.Graph;
+using System;
+using System.Collections.Generic;
+using System.Linq;
+
+namespace Dijkstra.NET.ShortestPath
+{
+    public static class ShortestPathExtensions
+    {
+        public static IEnumerable<TEdgeCustom> GetReversedPathEdgesCustom<T, TEdgeCustom>(this ShortestPathResult result, Graph<T, TEdgeCustom> graph) where TEdgeCustom : IEquatable<TEdgeCustom>
+        {
+            return result.GetPathEdgesCustom(graph).Reverse();
+        }
+
+        public static IEnumerable<TEdgeCustom> GetPathEdgesCustom<T, TEdgeCustom>(this ShortestPathResult result, Graph<T, TEdgeCustom> graph) where TEdgeCustom : IEquatable<TEdgeCustom>
+        {
+            if (result.IsFounded)
+            {              
+                using (var iterator = result.GetPath().GetEnumerator())
+                {
+                    if (!iterator.MoveNext())
+                    {
+                        yield break;
+                    }
+                    var currentNode = iterator.Current;
+                    while (iterator.MoveNext())
+                    {
+                        yield return GetFirstEdgeCustom(graph, currentNode, iterator.Current);
+                        currentNode = iterator.Current;
+                    }
+                }
+            }
+            else
+                throw new System.Exception("path not founded");
+        }
+
+        static TEdgeCustom GetFirstEdgeCustom<T, TEdgeCustom>(Graph<T, TEdgeCustom> graph, uint currentNodeKey, uint edgeNodeKey) where TEdgeCustom : IEquatable<TEdgeCustom>
+        {
+            var currentNode = graph >> (int)currentNodeKey;
+            if (currentNode == null)
+                throw new ArgumentException("node not founded at graph");
+            return currentNode.GetFirstEdgeCustom((int)edgeNodeKey);
+        }
+    }
+}

src/Samples/Dijkstra.Net40/Program.cs

@@ -9,9 +9,10 @@ static void Main(string[] args)
         {
             var graph = new Graph<int, string>() + 1 + 2;
 
-            bool connected = graph >> 1 >> 2 >> 5 ^ "edge information"; 
+            bool connected = graph >> 1 >> 2 >> 5 ^ "edge information";
 
             var immutablePath = graph.Dijkstra(1, 2);
+            var immutablePathDescriptions = immutablePath.GetPathEdgesCustom(graph);
         }
     }
 }