Exemplo n.º 1
0
 def test_edgelist_multigraph(self):
     G=self.MG
     (fd,fname)=tempfile.mkstemp()
     bipartite.write_edgelist(G,fname) 
     H=bipartite.read_edgelist(fname,nodetype=int,create_using=nx.MultiGraph())
     H2=bipartite.read_edgelist(fname,nodetype=int,create_using=nx.MultiGraph())
     assert_not_equal(H,H2) # they should be different graphs
     assert_nodes_equal(H.nodes(),G.nodes())
     assert_edges_equal(H.edges(),G.edges())
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 2
0
 def test_edgelist_multigraph(self):
     G = self.MG
     (fd, fname) = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname)
     H = bipartite.read_edgelist(fname, nodetype=int, create_using=nx.MultiGraph())
     H2 = bipartite.read_edgelist(fname, nodetype=int, create_using=nx.MultiGraph())
     assert H != H2  # they should be different graphs
     assert_nodes_equal(list(H), list(G))
     assert_edges_equal(list(H.edges()), list(G.edges()))
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 3
0
 def test_edgelist_graph(self):
     G=self.G
     (fd,fname)=tempfile.mkstemp()
     bipartite.write_edgelist(G,fname)  
     H=bipartite.read_edgelist(fname)
     H2=bipartite.read_edgelist(fname)
     assert_not_equal(H,H2) # they should be different graphs
     G.remove_node('g') # isolated nodes are not written in edgelist
     assert_nodes_equal(H.nodes(),G.nodes())
     assert_edges_equal(H.edges(),G.edges())
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 4
0
 def test_edgelist_graph(self):
     G = self.G
     (fd, fname) = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname)
     H = bipartite.read_edgelist(fname)
     H2 = bipartite.read_edgelist(fname)
     assert H != H2  # they should be different graphs
     G.remove_node('g')  # isolated nodes are not written in edgelist
     assert_nodes_equal(list(H), list(G))
     assert_edges_equal(list(H.edges()), list(G.edges()))
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 5
0
    def test_read_edgelist_3(self):
        s = b"""\
# comment line
1 2 {'weight':2.0}
# comment line
2 3 {'weight':3.0}
"""
        bytesIO = io.BytesIO(s)
        G = bipartite.read_edgelist(bytesIO,nodetype=int,data=False)
        assert_edges_equal(G.edges(),[(1,2),(2,3)])

        bytesIO = io.BytesIO(s)
        G = bipartite.read_edgelist(bytesIO,nodetype=int,data=True)
        assert_edges_equal(G.edges(data=True),
                            [(1,2,{'weight':2.0}),(2,3,{'weight':3.0})])
Exemplo n.º 6
0
    def test_read_edgelist_3(self):
        s = b"""\
# comment line
1 2 {'weight':2.0}
# comment line
2 3 {'weight':3.0}
"""
        bytesIO = io.BytesIO(s)
        G = bipartite.read_edgelist(bytesIO,nodetype=int,data=False)
        assert_edges_equal(G.edges(),[(1,2),(2,3)])

        bytesIO = io.BytesIO(s)
        G = bipartite.read_edgelist(bytesIO,nodetype=int,data=True)
        assert_edges_equal(G.edges(data=True),
                            [(1,2,{'weight':2.0}),(2,3,{'weight':3.0})])
Exemplo n.º 7
0
    def test_read_edgelist_1(self):
        s = b"""\
# comment line
1 2
# comment line
2 3
"""
        bytesIO = io.BytesIO(s)
        G = bipartite.read_edgelist(bytesIO,nodetype=int)
        assert_edges_equal(G.edges(),[(1,2),(2,3)])
Exemplo n.º 8
0
    def test_read_edgelist_1(self):
        s = b"""\
# comment line
1 2
# comment line
2 3
"""
        bytesIO = io.BytesIO(s)
        G = bipartite.read_edgelist(bytesIO, nodetype=int)
        assert_edges_equal(G.edges(), [(1, 2), (2, 3)])
Exemplo n.º 9
0
 def test_edgelist_integers(self):
     G = nx.convert_node_labels_to_integers(self.G)
     (fd, fname) = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname)
     H = bipartite.read_edgelist(fname, nodetype=int)
     # isolated nodes are not written in edgelist
     G.remove_nodes_from(list(nx.isolates(G)))
     assert_nodes_equal(list(H), list(G))
     assert_edges_equal(list(H.edges()), list(G.edges()))
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 10
0
 def test_edgelist_integers(self):
     G=nx.convert_node_labels_to_integers(self.G)
     (fd,fname)=tempfile.mkstemp()
     bipartite.write_edgelist(G,fname)  
     H=bipartite.read_edgelist(fname,nodetype=int)
     # isolated nodes are not written in edgelist
     G.remove_nodes_from(nx.isolates(G))
     assert_nodes_equal(H.nodes(),G.nodes())
     assert_edges_equal(H.edges(),G.edges())
     os.close(fd)
     os.unlink(fname)
 def test_latin1(self):
     G = nx.Graph()
     name1 = 'Bj' + chr(246) + 'rk'
     name2 = chr(220) + 'ber'
     G.add_edge(name1, 'Radiohead', **{name2: 3})
     G.add_node(name1, bipartite=0)
     G.add_node('Radiohead', bipartite=1)
     fd, fname = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname, encoding='latin-1')
     H = bipartite.read_edgelist(fname, encoding='latin-1')
     assert_graphs_equal(G, H)
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 12
0
 def test_latin1(self):
     G = nx.Graph()
     name1 = "Bj" + chr(246) + "rk"
     name2 = chr(220) + "ber"
     G.add_edge(name1, "Radiohead", **{name2: 3})
     G.add_node(name1, bipartite=0)
     G.add_node("Radiohead", bipartite=1)
     fd, fname = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname, encoding="latin-1")
     H = bipartite.read_edgelist(fname, encoding="latin-1")
     assert_graphs_equal(G, H)
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 13
0
 def test_unicode(self):
     G = nx.Graph()
     name1 = chr(2344) + chr(123) + chr(6543)
     name2 = chr(5543) + chr(1543) + chr(324)
     G.add_edge(name1, "Radiohead", **{name2: 3})
     G.add_node(name1, bipartite=0)
     G.add_node("Radiohead", bipartite=1)
     fd, fname = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname)
     H = bipartite.read_edgelist(fname)
     assert_graphs_equal(G, H)
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 14
0
 def test_unicode(self):
     G = nx.Graph()
     try:  # Python 3.x
         name1 = chr(2344) + chr(123) + chr(6543)
         name2 = chr(5543) + chr(1543) + chr(324)
     except ValueError:  # Python 2.6+
         name1 = unichr(2344) + unichr(123) + unichr(6543)
         name2 = unichr(5543) + unichr(1543) + unichr(324)
     G.add_edge(name1, 'Radiohead', **{name2: 3})
     G.add_node(name1, bipartite=0)
     G.add_node('Radiohead', bipartite=1)
     fd, fname = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname)
     H = bipartite.read_edgelist(fname)
     assert_graphs_equal(G, H)
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 15
0
 def test_unicode(self):
     G = nx.Graph()
     try: # Python 3.x
         name1 = chr(2344) + chr(123) + chr(6543)
         name2 = chr(5543) + chr(1543) + chr(324)
     except ValueError: # Python 2.6+
         name1 = unichr(2344) + unichr(123) + unichr(6543)
         name2 = unichr(5543) + unichr(1543) + unichr(324)
     G.add_edge(name1, 'Radiohead', attr_dict={name2: 3})
     G.add_node(name1,bipartite=0)
     G.add_node('Radiohead',bipartite=1)
     fd, fname = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname)
     H = bipartite.read_edgelist(fname)
     assert_graphs_equal(G, H)
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 16
0
 def test_latin1(self):
     G = nx.Graph()
     try: # Python 3.x
         blurb = chr(1245) # just to trigger the exception
         name1 = 'Bj' + chr(246) + 'rk'
         name2 = chr(220) + 'ber'
     except ValueError: # Python 2.6+
         name1 = 'Bj' + unichr(246) + 'rk'
         name2 = unichr(220) + 'ber'
     G.add_edge(name1, 'Radiohead', attr_dict={name2: 3})
     G.add_node(name1,bipartite=0)
     G.add_node('Radiohead',bipartite=1)
     fd, fname = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname, encoding = 'latin-1')
     H = bipartite.read_edgelist(fname, encoding = 'latin-1')
     assert_graphs_equal(G, H)
     os.close(fd)
     os.unlink(fname)
Exemplo n.º 17
0
 def test_latin1(self):
     G = nx.Graph()
     try:  # Python 3.x
         blurb = chr(1245)  # just to trigger the exception
         name1 = 'Bj' + chr(246) + 'rk'
         name2 = chr(220) + 'ber'
     except ValueError:  # Python 2.6+
         name1 = 'Bj' + unichr(246) + 'rk'
         name2 = unichr(220) + 'ber'
     G.add_edge(name1, 'Radiohead', **{name2: 3})
     G.add_node(name1, bipartite=0)
     G.add_node('Radiohead', bipartite=1)
     fd, fname = tempfile.mkstemp()
     bipartite.write_edgelist(G, fname, encoding='latin-1')
     H = bipartite.read_edgelist(fname, encoding='latin-1')
     assert_graphs_equal(G, H)
     os.close(fd)
     os.unlink(fname)