From 088222db47217c215247029bfe14c9883cf019b3 Mon Sep 17 00:00:00 2001
From: Chris Cameron <chris.cameron@wedoresi.com>
Date: Fri, 25 May 2018 12:18:02 -0400
Subject: [PATCH] fix: Potential fix - use breadth first node comparer in
 parents map

---
 ICD.Common.Utils/RecursionUtils.cs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/ICD.Common.Utils/RecursionUtils.cs b/ICD.Common.Utils/RecursionUtils.cs
index 554053d..22721ae 100644
--- a/ICD.Common.Utils/RecursionUtils.cs
+++ b/ICD.Common.Utils/RecursionUtils.cs
@@ -191,7 +191,7 @@ namespace ICD.Common.Utils
 			Queue<T> queue = new Queue<T>();
 			queue.Enqueue(root);
 
-			Dictionary<T, T> nodeParents = new Dictionary<T, T>();
+			Dictionary<T, T> nodeParents = new Dictionary<T, T>(comparer);
 
 			while (queue.Count > 0)
 			{
@@ -265,7 +265,7 @@ namespace ICD.Common.Utils
 			Queue<T> queue = new Queue<T>();
 			queue.Enqueue(root);
 
-			Dictionary<T, T> nodeParents = new Dictionary<T, T>();
+			Dictionary<T, T> nodeParents = new Dictionary<T, T>(comparer);
 
 			while (queue.Count > 0)
 			{