diff options
author | aric <none@none> | 2010-08-09 14:11:26 +0000 |
---|---|---|
committer | aric <none@none> | 2010-08-09 14:11:26 +0000 |
commit | 1e857820cd87519e19c461762c3e2ea36ca362eb (patch) | |
tree | 57298509f0000f74320ed24e5c95155b287749e4 /networkx/generators/tests/test_atlas.py | |
parent | 8c102e0f35fb3a40ca63face69095de05e7578c5 (diff) | |
download | networkx-1e857820cd87519e19c461762c3e2ea36ca362eb.tar.gz |
Use unittest style tests
--HG--
extra : convert_revision : svn%3A3ed01bd8-26fb-0310-9e4c-ca1a4053419f/networkx/trunk%401882
Diffstat (limited to 'networkx/generators/tests/test_atlas.py')
-rw-r--r-- | networkx/generators/tests/test_atlas.py | 55 |
1 files changed, 55 insertions, 0 deletions
diff --git a/networkx/generators/tests/test_atlas.py b/networkx/generators/tests/test_atlas.py new file mode 100644 index 00000000..2428385e --- /dev/null +++ b/networkx/generators/tests/test_atlas.py @@ -0,0 +1,55 @@ +from nose.tools import * +import networkx as nx + + +class TestAtlas(object): + def setUp(self): + self.GAG=nx.graph_atlas_g() + + def test_sizes(self): + G=self.GAG[0] + assert_equal(G.number_of_nodes(),0) + assert_equal(G.number_of_edges(),0) + + G=self.GAG[7] + assert_equal(G.number_of_nodes(),3) + assert_equal(G.number_of_edges(),3) + + def test_names(self): + i=0 + for g in self.GAG: + name=g.name + assert_equal(int(name[1:]),i) + i+=1 + + def test_monotone_nodes(self): + # check for monotone increasing number of nodes + previous=self.GAG[0] + for g in self.GAG: + assert_false(len(g)-len(previous) > 1) + previous=g.copy() + + def test_monotone_nodes(self): + # check for monotone increasing number of edges + # (for fixed number of nodes) + previous=self.GAG[0] + for g in self.GAG: + if len(g)==len(previous): + assert_false(g.size()-previous.size() > 1) + previous=g.copy() + + def test_monotone_degree_sequence(self): + # check for monotone increasing degree sequence + # (for fixed number f nodes and edges) + # note that 111223 < 112222 + previous=self.GAG[0] + for g in self.GAG: + if len(g)==0: + continue + if len(g)==len(previous) & g.size()==previous.size(): + deg_seq=sorted(g.degree().values()) + previous_deg_seq=sorted(previous.degree().values()) + assert_true(previous_deg_seq < deg_seq) + previous=g.copy() + + |