1 files changed, 0 insertions, 89 deletions
diff --git a/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/tests/test_mis.py b/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/tests/test_mis.py
deleted file mode 100644
index 01092ef..0000000
--- a/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/tests/test_mis.py
+++ /dev/null
@@ -1,89 +0,0 @@
-#!/usr/bin/env python
-# -*- coding: utf-8 -*-
-# $Id: test_maximal_independent_set.py 577 2011-03-01 06:07:53Z lleeoo $
-"""
-Tests for maximal (not maximum) independent sets.
-
-"""
-#    Copyright (C) 2004-2010 by 
-#    Leo Lopes <leo.lopes@monash.edu>
-#    Aric Hagberg <hagberg@lanl.gov>
-#    Dan Schult <dschult@colgate.edu>
-#    Pieter Swart <swart@lanl.gov>
-#    All rights reserved.
-#    BSD license.
-
-__author__ = """Leo Lopes (leo.lopes@monash.edu)"""
-
-from nose.tools import *
-import networkx as nx
-import random
-
-class TestMaximalIndependantSet(object):
-    def setup(self):
-        self.florentine = nx.Graph()
-        self.florentine.add_edge('Acciaiuoli','Medici')
-        self.florentine.add_edge('Castellani','Peruzzi')
-        self.florentine.add_edge('Castellani','Strozzi')
-        self.florentine.add_edge('Castellani','Barbadori')
-        self.florentine.add_edge('Medici','Barbadori')
-        self.florentine.add_edge('Medici','Ridolfi')
-        self.florentine.add_edge('Medici','Tornabuoni')
-        self.florentine.add_edge('Medici','Albizzi')
-        self.florentine.add_edge('Medici','Salviati')
-        self.florentine.add_edge('Salviati','Pazzi')
-        self.florentine.add_edge('Peruzzi','Strozzi')
-        self.florentine.add_edge('Peruzzi','Bischeri')
-        self.florentine.add_edge('Strozzi','Ridolfi')
-        self.florentine.add_edge('Strozzi','Bischeri')
-        self.florentine.add_edge('Ridolfi','Tornabuoni')
-        self.florentine.add_edge('Tornabuoni','Guadagni')
-        self.florentine.add_edge('Albizzi','Ginori')
-        self.florentine.add_edge('Albizzi','Guadagni')
-        self.florentine.add_edge('Bischeri','Guadagni')
-        self.florentine.add_edge('Guadagni','Lamberteschi')
-        
-    def test_K5(self):
-        """Maximal independent set: K5"""
-        G = nx.complete_graph(5)
-        for node in G:
-            assert_equal(nx.maximal_independent_set(G, [node]), [node])
-
-    def test_K55(self):
-        """Maximal independent set: K55"""
-        G = nx.complete_graph(55)
-        for node in G:
-            assert_equal(nx.maximal_independent_set(G, [node]), [node])
-
-    def test_exception(self):
-        """Bad input should raise exception."""
-        G = self.florentine
-        assert_raises(nx.NetworkXUnfeasible,
-                      nx.maximal_independent_set, G, ["Smith"])
-        assert_raises(nx.NetworkXUnfeasible,
-                      nx.maximal_independent_set, G, ["Salviati", "Pazzi"])
-
-    def test_florentine_family(self):
-        G = self.florentine
-        indep = nx.maximal_independent_set(G, ["Medici", "Bischeri"])
-        assert_equal(sorted(indep),
-                     sorted(["Medici", "Bischeri", "Castellani", "Pazzi",
-                      "Ginori", "Lamberteschi"]))
-
-    def test_bipartite(self):
-        G = nx.complete_bipartite_graph(12, 34)
-        indep = nx.maximal_independent_set(G, [4, 5, 9, 10])
-        assert_equal(sorted(indep), list(range(12)))
-
-
-    def test_random_graphs(self):
-        """Generate 50 random graphs of different types and sizes and
-        make sure that all sets are independent and maximal."""
-        for i in range(0, 50, 10):
-            G = nx.random_graphs.erdos_renyi_graph(i*10+1, random.random())
-            IS = nx.maximal_independent_set(G)
-            assert_false(G.subgraph(IS).edges())
-            neighbors_of_MIS = set.union(*(set(G.neighbors(v)) for v in IS))
-            for v in set(G.nodes()).difference(IS):
-                assert_true(v in neighbors_of_MIS)
-