fix: Potential fix - use breadth first node comparer in parents map

This commit is contained in:
Chris Cameron
2018-05-25 12:18:02 -04:00
parent 9dcda7271d
commit 088222db47

View File

@@ -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)
{