icdsystems/ICD.Common.Utils
1
0
Fork 0
mirror of https://github.com/ICDSystems/ICD.Common.Utils.git synced 2026-02-16 21:24:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
Chris Cameron
2018-05-25 12:18:02 -04:00
parent 9dcda7271d
commit 088222db47
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
ICD.Common.Utils/RecursionUtils.cs
View File

@@ -191,7 +191,7 @@ namespace ICD.Common.Utils
Queue<T> queue = new Queue<T>(); Queue<T> queue = new Queue<T>();
queue.Enqueue(root); queue.Enqueue(root);
Dictionary<T, T> nodeParents = new Dictionary<T, T>(); Dictionary<T, T> nodeParents = new Dictionary<T, T>(comparer);
while (queue.Count > 0) while (queue.Count > 0)
{ {
@@ -265,7 +265,7 @@ namespace ICD.Common.Utils
Queue<T> queue = new Queue<T>(); Queue<T> queue = new Queue<T>();
queue.Enqueue(root); queue.Enqueue(root);
Dictionary<T, T> nodeParents = new Dictionary<T, T>(); Dictionary<T, T> nodeParents = new Dictionary<T, T>(comparer);
while (queue.Count > 0) while (queue.Count > 0)
{ {