From b4e2d5483a98b1f5f3562a9f5462b478d4aa5d74 Mon Sep 17 00:00:00 2001
From: smbadiwe <somasystemsng@gmail.com>
Date: Fri, 10 Nov 2017 08:47:57 -0800
Subject: [PATCH] Renamed a method for more clarity

---
 MODA.Impl/Utils.cs                | 4 ++--
 QuickGraph/Alt/UndirectedGraph.cs | 2 +-
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/MODA.Impl/Utils.cs b/MODA.Impl/Utils.cs
index 84f04b0..7697b9f 100644
--- a/MODA.Impl/Utils.cs
+++ b/MODA.Impl/Utils.cs
@@ -47,10 +47,10 @@ internal static MappingTestResult IsMappingCorrect2(SortedList<int, int> functio
             }
 
             // if mapping is possible (=> if compareEdgeCount >= 0)
-            var subgraphDegrees = subgraph.GetDegreeSequence();
+            var subgraphDegrees = subgraph.GetReverseDegreeSequence();
             var testG = new UndirectedGraph<int>();
             testG.AddVerticesAndEdgeRange(edgeImages);
-            var testGdeg = testG.GetDegreeSequence();
+            var testGdeg = testG.GetReverseDegreeSequence();
             if (compareEdgeCount == 0)
             {
                 // Same node count, same edge count
diff --git a/QuickGraph/Alt/UndirectedGraph.cs b/QuickGraph/Alt/UndirectedGraph.cs
index 6659d07..f4bbba1 100644
--- a/QuickGraph/Alt/UndirectedGraph.cs
+++ b/QuickGraph/Alt/UndirectedGraph.cs
@@ -101,7 +101,7 @@ public IList<TVertex> GetNodesSortedByDegree(int count)
         /// the order direction
         /// </summary>
         /// <returns></returns>
-        public List<int> GetDegreeSequence()
+        public List<int> GetReverseDegreeSequence()
         {
             var tempList = new List<int>(VertexCount);
             foreach (var node in Vertices)