118 lines
4.1 KiB
Python
118 lines
4.1 KiB
Python
|
"""Generators - Directed Graphs
|
||
|
|
----------------------------
|
||
|
|
"""
|
||
|
|
import pytest
|
||
|
|
|
||
|
|
import networkx as nx
|
||
|
|
from networkx.classes import Graph
|
||
|
|
from networkx.classes import MultiDiGraph
|
||
|
|
from networkx.generators.directed import gn_graph
|
||
|
|
from networkx.generators.directed import gnr_graph
|
||
|
|
from networkx.generators.directed import gnc_graph
|
||
|
|
from networkx.generators.directed import random_k_out_graph
|
||
|
|
from networkx.generators.directed import random_uniform_k_out_graph
|
||
|
|
from networkx.generators.directed import scale_free_graph
|
||
|
|
|
||
|
|
|
||
|
|
class TestGeneratorsDirected(object):
|
||
|
|
def test_smoke_test_random_graphs(self):
|
||
|
|
gn_graph(100)
|
||
|
|
gnr_graph(100, 0.5)
|
||
|
|
gnc_graph(100)
|
||
|
|
scale_free_graph(100)
|
||
|
|
|
||
|
|
gn_graph(100, seed=42)
|
||
|
|
gnr_graph(100, 0.5, seed=42)
|
||
|
|
gnc_graph(100, seed=42)
|
||
|
|
scale_free_graph(100, seed=42)
|
||
|
|
|
||
|
|
def test_create_using_keyword_arguments(self):
|
||
|
|
pytest.raises(nx.NetworkXError,
|
||
|
|
gn_graph, 100, create_using=Graph())
|
||
|
|
pytest.raises(nx.NetworkXError,
|
||
|
|
gnr_graph, 100, 0.5, create_using=Graph())
|
||
|
|
pytest.raises(nx.NetworkXError,
|
||
|
|
gnc_graph, 100, create_using=Graph())
|
||
|
|
pytest.raises(nx.NetworkXError,
|
||
|
|
scale_free_graph, 100, create_using=Graph())
|
||
|
|
G = gn_graph(100, seed=1)
|
||
|
|
MG = gn_graph(100, create_using=MultiDiGraph(), seed=1)
|
||
|
|
assert sorted(G.edges()) == sorted(MG.edges())
|
||
|
|
G = gnr_graph(100, 0.5, seed=1)
|
||
|
|
MG = gnr_graph(100, 0.5, create_using=MultiDiGraph(), seed=1)
|
||
|
|
assert sorted(G.edges()) == sorted(MG.edges())
|
||
|
|
G = gnc_graph(100, seed=1)
|
||
|
|
MG = gnc_graph(100, create_using=MultiDiGraph(), seed=1)
|
||
|
|
assert sorted(G.edges()) == sorted(MG.edges())
|
||
|
|
|
||
|
|
G = scale_free_graph(100, alpha=0.3, beta=0.4, gamma=0.3,
|
||
|
|
delta_in=0.3, delta_out=0.1,
|
||
|
|
create_using=MultiDiGraph, seed=1)
|
||
|
|
pytest.raises(ValueError, scale_free_graph, 100, 0.5, 0.4, 0.3)
|
||
|
|
pytest.raises(ValueError, scale_free_graph, 100, alpha=-0.3)
|
||
|
|
pytest.raises(ValueError, scale_free_graph, 100, beta=-0.3)
|
||
|
|
pytest.raises(ValueError, scale_free_graph, 100, gamma=-0.3)
|
||
|
|
|
||
|
|
|
||
|
|
class TestRandomKOutGraph(object):
|
||
|
|
"""Unit tests for the
|
||
|
|
:func:`~networkx.generators.directed.random_k_out_graph` function.
|
||
|
|
|
||
|
|
"""
|
||
|
|
|
||
|
|
def test_regularity(self):
|
||
|
|
"""Tests that the generated graph is `k`-out-regular."""
|
||
|
|
n = 10
|
||
|
|
k = 3
|
||
|
|
alpha = 1
|
||
|
|
G = random_k_out_graph(n, k, alpha)
|
||
|
|
assert all(d == k for v, d in G.out_degree())
|
||
|
|
G = random_k_out_graph(n, k, alpha, seed=42)
|
||
|
|
assert all(d == k for v, d in G.out_degree())
|
||
|
|
|
||
|
|
def test_no_self_loops(self):
|
||
|
|
"""Tests for forbidding self-loops."""
|
||
|
|
n = 10
|
||
|
|
k = 3
|
||
|
|
alpha = 1
|
||
|
|
G = random_k_out_graph(n, k, alpha, self_loops=False)
|
||
|
|
assert nx.number_of_selfloops(G) == 0
|
||
|
|
|
||
|
|
|
||
|
|
class TestUniformRandomKOutGraph(object):
|
||
|
|
"""Unit tests for the
|
||
|
|
:func:`~networkx.generators.directed.random_uniform_k_out_graph`
|
||
|
|
function.
|
||
|
|
|
||
|
|
"""
|
||
|
|
def test_regularity(self):
|
||
|
|
"""Tests that the generated graph is `k`-out-regular."""
|
||
|
|
n = 10
|
||
|
|
k = 3
|
||
|
|
G = random_uniform_k_out_graph(n, k)
|
||
|
|
assert all(d == k for v, d in G.out_degree())
|
||
|
|
G = random_uniform_k_out_graph(n, k, seed=42)
|
||
|
|
assert all(d == k for v, d in G.out_degree())
|
||
|
|
|
||
|
|
def test_no_self_loops(self):
|
||
|
|
"""Tests for forbidding self-loops."""
|
||
|
|
n = 10
|
||
|
|
k = 3
|
||
|
|
G = random_uniform_k_out_graph(n, k, self_loops=False)
|
||
|
|
assert nx.number_of_selfloops(G) == 0
|
||
|
|
assert all(d == k for v, d in G.out_degree())
|
||
|
|
|
||
|
|
def test_with_replacement(self):
|
||
|
|
n = 10
|
||
|
|
k = 3
|
||
|
|
G = random_uniform_k_out_graph(n, k, with_replacement=True)
|
||
|
|
assert G.is_multigraph()
|
||
|
|
assert all(d == k for v, d in G.out_degree())
|
||
|
|
|
||
|
|
def test_without_replacement(self):
|
||
|
|
n = 10
|
||
|
|
k = 3
|
||
|
|
G = random_uniform_k_out_graph(n, k, with_replacement=False)
|
||
|
|
assert not G.is_multigraph()
|
||
|
|
assert all(d == k for v, d in G.out_degree())
|