Merge pull request #158 from borovikovnik/GraphTasks

Graph tasks

Author: gsvgit

QuickGraph.sln

@@ -1,7 +1,7 @@
 
 Microsoft Visual Studio Solution File, Format Version 12.00
 # Visual Studio 14
-VisualStudioVersion = 14.0.25123.0
+VisualStudioVersion = 14.0.24720.0
 MinimumVisualStudioVersion = 10.0.40219.1
 Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = ".paket", ".paket", "{FAAD5B1C-1217-48D6-B1EF-7CAC0440D6A4}"
 	ProjectSection(SolutionItems) = preProject
@@ -18,6 +18,7 @@ Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "ci", "ci", "{6EC5788D-DB36-
 EndProject
 Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Solution Items", "Solution Items", "{6D81E7BA-91B1-473B-B9BB-4DECB1825F66}"
 	ProjectSection(SolutionItems) = preProject
+		Local.testsettings = Local.testsettings
 		LocalTestRun.testrunconfig = LocalTestRun.testrunconfig
 		nuspec.xsd = nuspec.xsd
 		quickgraph.nuspec = quickgraph.nuspec

src/QuickGraph/Algorithms/Cliques/FindingMaximalCliques.cs

@@ -0,0 +1,78 @@
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+using System.Threading.Tasks;
+
+namespace QuickGraph.Algorithms.Cliques
+{
+    public static class FindingMaximalCliques<TEdge>
+    {
+        private static Dictionary<TEdge, List<TEdge>> _neighbors;
+        private static List<List<TEdge>> _сliques;
+
+        public static List<List<TEdge>> FindCliques(UndirectedGraph<TEdge, EquatableEdge<TEdge>> g)
+        {
+            _neighbors = new Dictionary<TEdge, List<TEdge>>();
+            _сliques = new List<List<TEdge>>();
+            var P = new List<TEdge>(g.Vertices);
+
+            foreach (var v in g.Vertices)
+            {
+                    _neighbors.Add(v, new List<TEdge>());
+            }
+
+            foreach (var edge in g.Edges)
+            {
+                if (!object.Equals(edge.Source, edge.Target))
+                {
+                    _neighbors[edge.Source].Add(edge.Target);
+                    _neighbors[edge.Target].Add(edge.Source);
+                }
+            }
+
+            Compute(P);
+            return _сliques;
+        }
+
+        private static void Compute(List<TEdge> P)
+        {
+            Tuple<List<TEdge>, List<TEdge>, List<TEdge>> cur;
+            var R = new List<TEdge>();
+            var X = new List<TEdge>();
+
+            var S = new Stack<Tuple<List<TEdge>, List<TEdge>, List<TEdge>>>();
+            S.Push(Tuple.Create(new List<TEdge>(), P, new List<TEdge>()));
+
+            while (S.Count > 0)
+            {
+                cur = S.Pop();
+                R = cur.Item1;
+                P = cur.Item2;
+                X = cur.Item3;
+                if (P.Count == 0 && X.Count == 0 && R.Count > 0)
+                {
+                    _сliques.Add(new List<TEdge>(R));
+                }
+
+                if (P.Count > 0)
+                {
+                    var v = P.First();
+
+                    var pushR = new List<TEdge>(R);
+                    var pushP = new List<TEdge>(P);
+                    pushP.Remove(v);
+                    var pushX = new List<TEdge>(X);
+                    pushX.Add(v);
+                    S.Push(Tuple.Create(pushR, pushP, pushX));
+
+                    pushR = new List<TEdge>(R);
+                    pushR.Add(v);
+                    pushP = P.Intersect(_neighbors[v]).ToList();
+                    pushX = X.Intersect(_neighbors[v]).ToList();
+                    S.Push(Tuple.Create(pushR, pushP, pushX));
+                }
+            }
+        }   
+    }
+}

src/QuickGraph/QuickGraph.csproj

@@ -199,6 +199,7 @@
     <Compile Include="Algorithms\AssigmentProblem\HungarianIteration.cs" />
     <Compile Include="Algorithms\CentralityApproximationAlgorithm.cs" />
     <Compile Include="Algorithms\Cliques\BronKerboshMaximumCliqueAlgorithm.cs" />
+    <Compile Include="Algorithms\Cliques\FindingMaximalCliques.cs" />
     <Compile Include="Algorithms\Cliques\MaximumCliqueAlgorithmBase.cs" />
     <Compile Include="Algorithms\ComputationState.cs" />
     <Compile Include="Algorithms\Condensation\CondensationGraphAlgorithm.cs" />

tests/QuickGraph.Tests/Algorithms/Cliques/FindingMaximalCliquesTest.cs

@@ -0,0 +1,74 @@
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+using QuickGraph.Algorithms.Cliques;
+
+namespace QuickGraph.Tests.Algorithms.Cliques
+{
+    [TestClass]
+    public class FindingMaximalCliquesTest
+    {
+        [TestMethod]
+        public void TestFindCliques()
+        {
+            var graph = new UndirectedGraph<char, EquatableEdge<char>>();
+            graph.AddVertexRange(new[] { 'a', 'b', 'c', 'd', 'e' });
+            graph.AddEdge(new EquatableEdge<char>('a', 'b'));
+            graph.AddEdge(new EquatableEdge<char>('a', 'c'));
+            graph.AddEdge(new EquatableEdge<char>('b', 'c'));
+            graph.AddEdge(new EquatableEdge<char>('b', 'd'));
+            graph.AddEdge(new EquatableEdge<char>('c', 'd'));
+            graph.AddEdge(new EquatableEdge<char>('d', 'e'));
+            var cliques = FindingMaximalCliques<char>.FindCliques(graph);
+            Assert.AreEqual(cliques.ElementAt(0).ToArray().SequenceEqual(new[] { 'a', 'b', 'c' }), true);
+            Assert.AreEqual(cliques.ElementAt(1).ToArray().SequenceEqual(new[] { 'b', 'c', 'd' }), true);
+            Assert.AreEqual(cliques.ElementAt(2).ToArray().SequenceEqual(new[] { 'd', 'e' }), true);
+        }
+
+        [TestMethod]
+        public void TestMultigraph()
+        {
+            var graph = new UndirectedGraph<char, EquatableEdge<char>>(true);
+            graph.AddVertexRange(new[] { 'a', 'b' });
+            graph.AddEdge(new EquatableEdge<char>('a', 'b'));
+            graph.AddEdge(new EquatableEdge<char>('a', 'b'));
+            var cliques = FindingMaximalCliques<char>.FindCliques(graph);
+            Assert.AreEqual(cliques.Count == 1, true);
+        }
+
+        [TestMethod]
+        public void TestPseudograph()
+        {
+            var graph = new UndirectedGraph<char, EquatableEdge<char>>(true);
+            graph.AddVertexRange(new[] { 'a', 'b' });
+            graph.AddEdge(new EquatableEdge<char>('a', 'a'));
+            graph.AddEdge(new EquatableEdge<char>('a', 'b'));
+            var cliques = FindingMaximalCliques<char>.FindCliques(graph);
+            Assert.AreEqual(cliques.ElementAt(0).ToArray().SequenceEqual(new[] { 'a', 'b'}), true);
+        }
+
+        [TestMethod]
+        public void TestEmptyGraph()
+        {
+            var graph = new UndirectedGraph<char, EquatableEdge<char>>(true);
+            var cliques = FindingMaximalCliques<char>.FindCliques(graph);
+            Assert.AreEqual(cliques.Count > 0, false);
+        }
+
+        [TestMethod]
+        public void TestFullGraph()
+        {
+            var graph = new UndirectedGraph<char, EquatableEdge<char>>(true);
+            graph.AddVertexRange(new[] { 'a', 'b', 'c', 'd' });
+            graph.AddEdge(new EquatableEdge<char>('a', 'b'));
+            graph.AddEdge(new EquatableEdge<char>('a', 'c'));
+            graph.AddEdge(new EquatableEdge<char>('a', 'd'));
+            graph.AddEdge(new EquatableEdge<char>('b', 'c'));
+            graph.AddEdge(new EquatableEdge<char>('b', 'd'));
+            graph.AddEdge(new EquatableEdge<char>('c', 'd'));
+            var cliques = FindingMaximalCliques<char>.FindCliques(graph);
+            Assert.AreEqual(cliques.Count == 1, true);
+        }
+    }
+}

tests/QuickGraph.Tests/QuickGraph.Tests.csproj

@@ -297,6 +297,7 @@
     <Compile Include="Algorithms\AssigmentProblem\HungarianAlgorithmTest.cs" />
     <Compile Include="Algorithms\BipartiteDimensionAlgorithmTest.cs" />
     <Compile Include="Algorithms\ChromaticPolinomialAlgorithmTest.cs" />
+    <Compile Include="Algorithms\Cliques\FindingMaximalCliquesTest.cs" />
     <Compile Include="Algorithms\Condensation\StronglyConnectedCondensationGraphAlgorithmTest.cs" />
     <Compile Include="Algorithms\Condensation\WeaklyConnectedCondensationGraphTest.cs" />
     <Compile Include="Algorithms\ConnectedComponents\ConnectedComponentsAlgorithmTest.cs" />