/usr/lib/python2.7/dist-packages/networkx/readwrite/tests/test_pajek.py is in python-networkx 1.8.1-0ubuntu3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 | #!/usr/bin/env python
"""
Pajek tests
"""
from nose.tools import assert_equal
from networkx import *
import os,tempfile
from io import open
from networkx.testing import *
class TestPajek(object):
def setUp(self):
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"""
self.G=nx.MultiDiGraph()
self.G.add_nodes_from(['A1', 'Bb', 'C', 'D2'])
self.G.add_edges_from([('A1', 'A1'), ('A1', 'Bb'), ('A1', 'C'),
('Bb', 'A1'),('C', 'C'), ('C', 'D2'),
('D2', 'Bb')])
self.G.graph['name']='Tralala'
(self.fd,self.fname)=tempfile.mkstemp()
fh=open(self.fname,'wb')
fh.write(self.data.encode('UTF-8'))
fh.close()
def tearDown(self):
os.close(self.fd)
os.unlink(self.fname)
def test_parse_pajek_simple(self):
# Example without node positions or shape
data="""*Vertices 2\n1 "1"\n2 "2"\n*Edges\n1 2\n2 1"""
G=parse_pajek(data)
assert_equal(sorted(G.nodes()), ['1', '2'])
assert_edges_equal(G.edges(), [('1', '2'), ('1', '2')])
def test_parse_pajek(self):
G=parse_pajek(self.data)
assert_equal(sorted(G.nodes()), ['A1', 'Bb', 'C', 'D2'])
assert_edges_equal(G.edges(), [('A1', 'A1'), ('A1', 'Bb'),
('A1', 'C'), ('Bb', 'A1'),
('C', 'C'), ('C', 'D2'), ('D2', 'Bb')])
def test_read_pajek(self):
G=parse_pajek(self.data)
Gin=read_pajek(self.fname)
assert_equal(sorted(G.nodes()), sorted(Gin.nodes()))
assert_edges_equal(G.edges(), Gin.edges())
assert_equal(self.G.graph,Gin.graph)
for n in G.node:
assert_equal(G.node[n],Gin.node[n])
|