Minor Cleaup: Removed unnecessary code.

Author: aalhour

Algorithms/Numeric/GreatestCommonDivisor.cs

@@ -19,8 +19,6 @@ public static uint FindGCD(uint a, uint b)
                 return a;
 
             uint _a = a, _b = b;
-
-            uint q = _a / _b;
             uint r = _a % _b;
 
             while(r != 0)

MainProgram/AlgorithmsTests/GraphsBellmanFordShortestPaths.cs

@@ -79,7 +79,7 @@ public static void DoTest()
             {
                 BellmanFord = new BellmanFordShortestPaths<DirectedWeightedSparseGraph<string>, string>(graph, "s");
             }
-            catch(Exception ex)
+            catch(Exception)
             {
                 status = graph.RemoveEdge("y", "t");
                 //Debug.Assert(status == true, "Error! Edge was not deleted.");
@@ -147,7 +147,7 @@ public static void DoTest()
             {
                 BellmanFord = new BellmanFordShortestPaths<DirectedWeightedSparseGraph<string>, string>(graph, "b");
             }
-            catch (Exception ex)
+            catch (Exception)
             {
                 status = graph.RemoveEdge("c", "a");
                 //Debug.Assert(status == true, "Error! Edge was not deleted.");

MainProgram/DataStructuresTests/CliqueGraphTest.cs

@@ -57,9 +57,8 @@ public static void DoTest()
             MakeGraph(compareGraph);
 
             testGraph = new CliqueGraph<ComparableTuple>(compareGraph);
-            ICollection<ComparableTuple> component = testGraph.GetConnectedComponent(new ComparableTuple(0, 0));
-
-            DataStructures.Lists.DLinkedList<ComparableTuple> neighbor = testGraph.Neighbours(new ComparableTuple(0, 0));
+            // ICollection<ComparableTuple> component = testGraph.GetConnectedComponent(new ComparableTuple(0, 0));
+            // DataStructures.Lists.DLinkedList<ComparableTuple> neighbor = testGraph.Neighbours(new ComparableTuple(0, 0));
 
             testGraph.RemoveEdge(new ComparableTuple(0, 0), new ComparableTuple(1, 0));