Home | History | Annotate | Download | only in tests 
      1 #!/usr/bin/env python
      2 """
      3 Pajek tests
      4 """
      5 from nose.tools import assert_equal
      6 from networkx import *
      7 import os,tempfile
      8 from io import open
      9 from networkx.testing import *
     10 
     11 class TestPajek(object):
     12     def setUp(self):
     13         self.data="""*network Tralala\n*vertices 4\n   1 "A1"         0.0938 0.0896   ellipse x_fact 1 y_fact 1\n   2 "Bb"         0.8188 0.2458   ellipse x_fact 1 y_fact 1\n   3 "C"          0.3688 0.7792   ellipse x_fact 1\n   4 "D2"         0.9583 0.8563   ellipse x_fact 1\n*arcs\n1 1 1  h2 0 w 3 c Blue s 3 a1 -130 k1 0.6 a2 -130 k2 0.6 ap 0.5 l "Bezier loop" lc BlueViolet fos 20 lr 58 lp 0.3 la 360\n2 1 1  h2 0 a1 120 k1 1.3 a2 -120 k2 0.3 ap 25 l "Bezier arc" lphi 270 la 180 lr 19 lp 0.5\n1 2 1  h2 0 a1 40 k1 2.8 a2 30 k2 0.8 ap 25 l "Bezier arc" lphi 90 la 0 lp 0.65\n4 2 -1  h2 0 w 1 k1 -2 k2 250 ap 25 l "Circular arc" c Red lc OrangeRed\n3 4 1  p Dashed h2 0 w 2 c OliveGreen ap 25 l "Straight arc" lc PineGreen\n1 3 1  p Dashed h2 0 w 5 k1 -1 k2 -20 ap 25 l "Oval arc" c Brown lc Black\n3 3 -1  h1 6 w 1 h2 12 k1 -2 k2 -15 ap 0.5 l "Circular loop" c Red lc OrangeRed lphi 270 la 180"""
     14         self.G=nx.MultiDiGraph()
     15         self.G.add_nodes_from(['A1', 'Bb', 'C', 'D2'])
     16         self.G.add_edges_from([('A1', 'A1'), ('A1', 'Bb'), ('A1', 'C'), 
     17                                ('Bb', 'A1'),('C', 'C'), ('C', 'D2'), 
     18                                ('D2', 'Bb')])
     19 
     20         self.G.graph['name']='Tralala'
     21         (self.fd,self.fname)=tempfile.mkstemp()
     22         fh=open(self.fname,'wb')
     23         fh.write(self.data.encode('UTF-8'))
     24         fh.close()
     25 
     26     def tearDown(self):
     27         os.close(self.fd)
     28         os.unlink(self.fname)
     29 
     30     def test_parse_pajek_simple(self):
     31         # Example without node positions or shape
     32         data="""*Vertices 2\n1 "1"\n2 "2"\n*Edges\n1 2\n2 1"""
     33         G=parse_pajek(data)
     34         assert_equal(sorted(G.nodes()), ['1', '2'])
     35         assert_edges_equal(G.edges(), [('1', '2'), ('1', '2')])
     36 
     37     def test_parse_pajek(self):
     38         G=parse_pajek(self.data)
     39         assert_equal(sorted(G.nodes()), ['A1', 'Bb', 'C', 'D2'])
     40         assert_edges_equal(G.edges(), [('A1', 'A1'), ('A1', 'Bb'), 
     41                                        ('A1', 'C'), ('Bb', 'A1'),
     42                                        ('C', 'C'), ('C', 'D2'), ('D2', 'Bb')])
     43 
     44     def test_read_pajek(self):
     45         G=parse_pajek(self.data)
     46         Gin=read_pajek(self.fname)
     47         assert_equal(sorted(G.nodes()), sorted(Gin.nodes()))
     48         assert_edges_equal(G.edges(), Gin.edges())
     49         assert_equal(self.G.graph,Gin.graph)
     50         for n in G.node:
     51             assert_equal(G.node[n],Gin.node[n])
     52