icdsystems/ICD.Common.Utils
1
0
Fork 0
mirror of https://github.com/ICDSystems/ICD.Common.Utils.git synced 2026-02-17 13:45:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat: optimized get clique by using a bredth-first-search so it would not have to search the whole graph

Browse Source
This commit is contained in:
Austin Noska
2019-06-27 10:57:55 -04:00
parent 7cc5a47d6a
commit 2d401959b6
1 changed files with 8 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -36,14 +36,18 @@ namespace ICD.Common.Utils
/// Gets the clique containing the given node. /// Gets the clique containing the given node.
/// </summary> /// </summary>
/// <typeparam name="T"></typeparam> /// <typeparam name="T"></typeparam>
/// <param name="nodes"></param>
/// <param name="node"></param> /// <param name="node"></param>
/// <param name="getAdjacent"></param> /// <param name="getAdjacent"></param>
/// <returns></returns> /// <returns></returns>
public static IEnumerable<T> GetClique<T>(IEnumerable<T> nodes, T node, Func<T, IEnumerable<T>> getAdjacent) public static IEnumerable<T> GetClique<T>(T node, Func<T, IEnumerable<T>> getAdjacent)
{ {
Dictionary<T, IEnumerable<T>> map = nodes.ToDictionary(n => n, getAdjacent); if (node == null)
return GetClique(map, node); throw new ArgumentNullException("node");
if (getAdjacent == null)
throw new ArgumentNullException("getAdjacent");
return BreadthFirstSearch(node, getAdjacent);
} }
/// <summary> /// <summary>