/usr/lib/python2.7/dist-packages/networkx/algorithms/approximation/tests/test_approx_clust_coeff.py is in python-networkx 1.9+dfsg1-1.
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 | from nose.tools import assert_equal
import networkx as nx
from networkx.algorithms.approximation import average_clustering
# This approximation has to be be exact in regular graphs
# with no triangles or with all possible triangles.
def test_petersen():
# Actual coefficient is 0
G = nx.petersen_graph()
assert_equal(average_clustering(G, trials=int(len(G)/2)),
nx.average_clustering(G))
def test_tetrahedral():
# Actual coefficient is 1
G = nx.tetrahedral_graph()
assert_equal(average_clustering(G, trials=int(len(G)/2)),
nx.average_clustering(G))
def test_dodecahedral():
# Actual coefficient is 0
G = nx.dodecahedral_graph()
assert_equal(average_clustering(G, trials=int(len(G)/2)),
nx.average_clustering(G))
def test_empty():
G = nx.empty_graph(5)
assert_equal(average_clustering(G, trials=int(len(G)/2)), 0)
def test_complete():
G = nx.complete_graph(5)
assert_equal(average_clustering(G, trials=int(len(G)/2)), 1)
G = nx.complete_graph(7)
assert_equal(average_clustering(G, trials=int(len(G)/2)), 1)
|