Merging

Author: HadenSmith

Numerics/Mathematics/Optimization/Dynamic/Dijkstra.cs

@@ -66,79 +66,6 @@ public struct Edge(int fromNodeIndex, int toNodeIndex, float edgeWeight, int edg
         public int Index = edgeIndex;
     }
 
-    //public class Networks
-    //{
-    //    private readonly List<Edge>[] _outgoingEdges;
-    //    private readonly List<Edge>[] _incomingEdges;
-    //    private readonly int _nodeCount;
-    //    private readonly int[] _destinationIndices;
-    //    //private readonly RoadSegment[] _segments;
-    //    private readonly Edge[] _edges;
-
-    //    //public RoadSegment[] Segments { get => _segments; }
-    //    public int[] DestinationIndices { get => _destinationIndices; }
-    //    public List<Edge>[] IncomingEdges { get => _incomingEdges; }
-    //    public List<Edge>[] OutgoingEdges { get => _outgoingEdges; }
-
-    //    public static void ResultsToCSV(float[,] result, string outputFilePath)
-    //    {
-    //        System.IO.StreamWriter sw = new System.IO.StreamWriter(outputFilePath);
-    //        //Headers
-    //        sw.WriteLine($"From_Node, To_Node, Edge, Weight_To_Destination");
-    //        //Data
-    //        for (int i = 0; i < result.GetLength(0); i++) { sw.WriteLine($"{i}, {result[i, 0]}, {result[i, 1]}, {result[i, 2]}"); }
-    //        sw.Close(); sw.Dispose();
-    //    }
-
-    //    public static int[] PathEdges(float[,] result, int startNodeIndex)
-    //    {
-    //        List<int> edgeList = new List<int>();
-    //        int nodeIndex = startNodeIndex;
-    //        // generate the shortest path list from the results table
-    //        while (result[nodeIndex, 2] != 0)
-    //        {
-    //            edgeList.Add((int)result[nodeIndex, 1]);
-    //            nodeIndex = (int)result[nodeIndex, 0];
-    //        }
-    //        return edgeList.ToArray();
-    //    }
-
-    //    //public int[] PathRecords(float[,] result, int startNodeIndex)
-    //    //{
-    //    //    List<int> featureList = new List<int>();
-    //    //    int nodeIndex = startNodeIndex;
-    //    //    // generate the shortest path list from the results table
-    //    //    while (result[nodeIndex, 2] != 0)
-    //    //    {
-    //    //        featureList.Add(_segments[(int)result[nodeIndex, 1]].RecordIndex);
-    //    //        nodeIndex = (int)result[nodeIndex, 0];
-    //    //    }
-    //    //    return featureList.ToArray();
-    //    //}
-
-    //    //public int[] PathRecords(float[,] result, int startRecordIndex)
-    //    //{
-    //    //    List<int> featureList = new List<int>();
-    //    //    for (int i = 0; i < result.GetLength(0); i++)
-    //    //    {
-    //    //        if (_segments[(int)result[i, 1]].RecordIndex == startRecordIndex)
-    //    //        {
-    //    //            int nodeIndex = i;
-    //    //            // generate the shortest path list from the results table
-    //    //            while (result[nodeIndex, 2] != 0)
-    //    //            {
-    //    //                featureList.Add(_segments[(int)result[nodeIndex, 1]].RecordIndex);
-    //    //                nodeIndex = (int)result[nodeIndex, 0];
-    //    //            }
-    //    //            break;
-    //    //        }
-    //    //    }
-
-    //    //    return featureList.ToArray();
-    //    //}
-    //}
-
-
     /// <summary>
     /// Dijkstra dynamic programming implementation for shortest path optimization.
     /// </summary>