/usr/lib/python2.7/dist-packages/networkx/algorithms/components/tests/test_weakly_connected.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 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 | #!/usr/bin/env python
from nose.tools import *
import networkx as nx
from networkx import NetworkXError
class TestWeaklyConnected:
def setUp(self):
self.gc=[]
G=nx.DiGraph()
G.add_edges_from([(1,2),(2,3),(2,8),(3,4),(3,7),
(4,5),(5,3),(5,6),(7,4),(7,6),(8,1),(8,7)])
C=[[3, 4, 5, 7], [1, 2, 8], [6]]
self.gc.append((G,C))
G= nx.DiGraph()
G.add_edges_from([(1,2),(1,3),(1,4),(4,2),(3,4),(2,3)])
C = [[2, 3, 4],[1]]
self.gc.append((G,C))
G = nx.DiGraph()
G.add_edges_from([(1,2),(2,3),(3,2),(2,1)])
C = [[1, 2, 3]]
self.gc.append((G,C))
# Eppstein's tests
G = nx.DiGraph({ 0:[1],1:[2,3],2:[4,5],3:[4,5],4:[6],5:[],6:[]})
C = [[0],[1],[2],[3],[4],[5],[6]]
self.gc.append((G,C))
G = nx.DiGraph({0:[1],1:[2,3,4],2:[0,3],3:[4],4:[3]})
C = [[0,1,2],[3,4]]
self.gc.append((G,C))
def test_weakly_connected_components(self):
wcc=nx.weakly_connected_components
cc=nx.connected_components
for G,C in self.gc:
U=G.to_undirected()
w=sorted([sorted(g) for g in wcc(G)])
c=sorted([sorted(g) for g in cc(U)])
assert_equal(w,c)
def test_number_weakly_connected_components(self):
wcc=nx.number_weakly_connected_components
cc=nx.number_connected_components
for G,C in self.gc:
U=G.to_undirected()
w=wcc(G)
c=cc(U)
assert_equal(w,c)
def test_weakly_connected_component_subgraphs(self):
wcc=nx.weakly_connected_component_subgraphs
cc=nx.connected_component_subgraphs
for G,C in self.gc:
U=G.to_undirected()
w=sorted([sorted(g.nodes()) for g in wcc(G)])
c=sorted([sorted(g.nodes()) for g in cc(U)])
assert_equal(w,c)
G,C=self.gc[0]
G.add_edge(1,2,eattr='red')
G.node[1]['nattr']='blue'
G.graph['gattr']='green'
sgs=wcc(G)[0]
assert_equal(sgs[1][2]['eattr'],'red')
assert_equal(sgs.node[1]['nattr'],'blue')
assert_equal(sgs.graph['gattr'],'green')
sgs[1][2]['eattr']='blue'
assert_equal(G[1][2]['eattr'],'red')
assert_equal(sgs[1][2]['eattr'],'blue')
def test_is_weakly_connected(self):
wcc=nx.is_weakly_connected
cc=nx.is_connected
for G,C in self.gc:
U=G.to_undirected()
assert_equal(wcc(G),cc(U))
def test_connected_raise(self):
G=nx.Graph()
assert_raises(NetworkXError,nx.weakly_connected_components,G)
assert_raises(NetworkXError,nx.number_weakly_connected_components,G)
assert_raises(NetworkXError,nx.weakly_connected_component_subgraphs,G)
assert_raises(NetworkXError,nx.is_weakly_connected,G)
|