/usr/lib/python2.7/dist-packages/networkx/algorithms/traversal/tests/test_dfs.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 | #!/usr/bin/env python
from nose.tools import *
import networkx as nx
class TestDFS:
def setUp(self):
# simple graph
G=nx.Graph()
G.add_edges_from([(0,1),(1,2),(1,3),(2,4),(3,4)])
self.G=G
# simple graph, disconnected
D=nx.Graph()
D.add_edges_from([(0,1),(2,3)])
self.D=D
def test_preorder_nodes(self):
assert_equal(list(nx.dfs_preorder_nodes(self.G,source=0)),
[0, 1, 2, 4, 3])
assert_equal(list(nx.dfs_preorder_nodes(self.D)),[0, 1, 2, 3])
def test_postorder_nodes(self):
assert_equal(list(nx.dfs_postorder_nodes(self.G,source=0)),
[3, 4, 2, 1, 0])
assert_equal(list(nx.dfs_postorder_nodes(self.D)),[1, 0, 3, 2])
def test_successor(self):
assert_equal(nx.dfs_successors(self.G,source=0),
{0: [1], 1: [2], 2: [4], 4: [3]})
assert_equal(nx.dfs_successors(self.D), {0: [1], 2: [3]})
def test_predecessor(self):
assert_equal(nx.dfs_predecessors(self.G,source=0),
{1: 0, 2: 1, 3: 4, 4: 2})
assert_equal(nx.dfs_predecessors(self.D), {1: 0, 3: 2})
def test_dfs_tree(self):
T=nx.dfs_tree(self.G,source=0)
assert_equal(sorted(T.nodes()),sorted(self.G.nodes()))
assert_equal(sorted(T.edges()),[(0, 1), (1, 2), (2, 4), (4, 3)])
def test_dfs_edges(self):
edges=nx.dfs_edges(self.G,source=0)
assert_equal(list(edges),[(0, 1), (1, 2), (2, 4), (4, 3)])
edges=nx.dfs_edges(self.D)
assert_equal(list(edges),[(0, 1), (2, 3)])
def test_dfs_labeled_edges(self):
edges=list(nx.dfs_labeled_edges(self.G,source=0))
forward=[(u,v) for (u,v,d) in edges if d['dir']=='forward']
assert_equal(forward,[(0,0), (0, 1), (1, 2), (2, 4), (4, 3)])
def test_dfs_labeled_disconnected_edges(self):
edges=list(nx.dfs_labeled_edges(self.D))
forward=[(u,v) for (u,v,d) in edges if d['dir']=='forward']
assert_equal(forward,[(0, 0), (0, 1), (2, 2), (2, 3)])
def test_dfs_tree_isolates(self):
G = nx.Graph()
G.add_node(1)
G.add_node(2)
T=nx.dfs_tree(G,source=1)
assert_equal(sorted(T.nodes()),[1])
assert_equal(sorted(T.edges()),[])
T=nx.dfs_tree(G,source=None)
assert_equal(sorted(T.nodes()),[1, 2])
assert_equal(sorted(T.edges()),[])
|