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

feat: Added method to get a single clique given a starting node

Browse Source
This commit is contained in:
Austin Noska
2019-06-26 11:39:50 -04:00
parent 3a2fc0eef7
commit 65c50e8e90
2 changed files with 32 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
ICD.Common.Utils.Tests/RecursionUtilsTest.cs
View File

@@ -127,6 +127,24 @@ namespace ICD.Common.Utils.Tests
Assert.IsTrue(clique.Contains(6));
}
[Test]
public void GetCliqueSingleNodeTest()
{
int[] clique = RecursionUtils.GetClique(s_CliqueGraph.Keys, 1, n => s_CliqueGraph[n]).ToArray();
Assert.AreEqual(4, clique.Length);
Assert.IsTrue(clique.Contains(1));
Assert.IsTrue(clique.Contains(2));
Assert.IsTrue(clique.Contains(3));
Assert.IsTrue(clique.Contains(4));
clique = RecursionUtils.GetClique(s_CliqueGraph.Keys, 5, n => s_CliqueGraph[n]).ToArray();
Assert.AreEqual(2, clique.Length);
Assert.IsTrue(clique.Contains(5));
Assert.IsTrue(clique.Contains(6));
}
[Test]
public void BreadthFirstSearchTest()
{

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

@@ -32,6 +32,20 @@ namespace ICD.Common.Utils
.Select(node => GetClique(map, visited, node));
}
/// <summary>
/// Gets the clique containing the given node.
/// </summary>
/// <typeparam name="T"></typeparam>
/// <param name="nodes"></param>
/// <param name="node"></param>
/// <param name="getAdjacent"></param>
/// <returns></returns>
public static IEnumerable<T> GetClique<T>(IEnumerable<T> nodes, T node, Func<T, IEnumerable<T>> getAdjacent)
{
Dictionary<T, IEnumerable<T>> map = nodes.ToDictionary(n => n, getAdjacent);
return GetClique(map, node);
}
/// <summary>
/// Gets the clique containing the given node.
/// </summary>