exploration.tests.test_UniqueExitsGraph

  1"""
  2Authors: Peter Mawhorter
  3Consulted:
  4Date: 2022-3-11
  5Purpose: Tests for the UniqueExitsGraph class.
  6"""
  7
  8import pytest
  9
 10import networkx as nx # type: ignore
 11
 12from .. import graphs
 13
 14
 15def test_create():
 16    "Tests graph creation."
 17    _ = graphs.UniqueExitsGraph()
 18    assert (True)
 19
 20
 21def test_notImplemented():
 22    "Tests that not implemented things aren't."
 23    g = graphs.UniqueExitsGraph()
 24    with pytest.raises(NotImplementedError):
 25        assert (g.new_edge_key(1, 2) is not None)
 26
 27    with pytest.raises(NotImplementedError):
 28        assert (g.reverse() is not None)
 29
 30
 31def test_addNode():
 32    "Tests adding a node."
 33    g = graphs.UniqueExitsGraph()
 34    g.add_node('A')
 35    assert (list(g) == ['A'])
 36    with pytest.raises(KeyError):
 37        assert (g['B'])
 38
 39
 40def test_edges():
 41    "Tests adding multiple edges between nodes."
 42    g = graphs.UniqueExitsGraph()
 43    g.add_node('A')
 44    g.add_node('B')
 45    g.add_node('C')
 46    g.add_edge('A', 'B', 0)
 47    g.add_edge('A', 'B', 1)
 48    g.add_edge('B', 'A', 'hi')
 49    assert (g['A']['B'] == {0: {}, 1: {}})
 50    assert (g['B']['A'] == {'hi': {}})
 51    with pytest.raises(KeyError):
 52        assert (g['A']['C'])
 53
 54
 55def test_destinations():
 56    "Tests getting destinations by edge name."
 57    g = graphs.UniqueExitsGraph()
 58    g.add_node('A')
 59    g.add_node('B')
 60    g.add_edge('A', 'B', 0)
 61    g.add_edge('A', 'B', 1)
 62    g.add_edge('B', 'A', 'hi')
 63    assert (g.destination('A', 0) == 'B')
 64    assert (g.destination('A', 1) == 'B')
 65    assert (g.destination('B', 'hi') == 'A')
 66    with pytest.raises(KeyError):
 67        assert (g.destination('A', 2))
 68    with pytest.raises(KeyError):
 69        assert (g.destination('B', 0))
 70    assert (g.getDestination('A', 0) == 'B')
 71    assert (g.getDestination('A', 1) == 'B')
 72    assert (g.getDestination('B', 'hi') == 'A')
 73    assert (g.getDestination('A', 2) is None)
 74    assert (g.getDestination('B', 0) is None)
 75    assert (g.destinationsFrom('A') == {0: 'B', 1: 'B'})
 76    assert (g.destinationsFrom('B') == {'hi': 'A'})
 77
 78
 79def test_clear():
 80    "Tests clearing a graph."
 81    g = graphs.UniqueExitsGraph()
 82    g.add_node('A')
 83    g.add_node('B')
 84    g.add_edge('A', 'B', 0)
 85    g.add_edge('A', 'B', 1)
 86    g.add_edge('B', 'A', 'hi')
 87
 88    assert (len(g) == 2)
 89    g.clear_edges()
 90    assert (len(g) == 2)
 91    assert (g['A'] == {})
 92    assert (g['B'] == {})
 93    assert (g.getDestination('A', 0) is None)
 94    assert (g.getDestination('B', 'hi') is None)
 95    assert (g.destinationsFrom('A') == {})
 96    assert (g.destinationsFrom('B') == {})
 97
 98    g.clear()
 99    assert (len(g) == 0)
100    with pytest.raises(KeyError):
101        assert (g['A'])
102    with pytest.raises(KeyError):
103        assert (g['B'])
104
105
106def test_remove():
107    "Tests removing edges by destination + name and by just name."
108    g = graphs.UniqueExitsGraph()
109    g.add_node('A')
110    g.add_node('B')
111    g.add_edge('A', 'B', 0)
112    g.add_edge('A', 'B', 1)
113    g.add_edge('A', 'B', 2)
114    g.add_edge('A', 'B', 3)
115    g.add_edge('B', 'A', 0)
116    g.add_edge('B', 'A', 1)
117    g.add_edge('B', 'A', 'hi')
118
119    with pytest.raises(TypeError):
120        g.remove_edge('A', 'B')
121
122    with pytest.raises(nx.NetworkXError):
123        g.remove_edge('A', 'B', 'hi')
124
125    with pytest.raises(nx.NetworkXError):
126        g.remove_edge('B', 'A', 2)
127
128    assert (g.getDestination('A', 3) == 'B')
129    g.remove_edge('A', 'B', 3)
130    assert (g.getDestination('A', 3) is None)
131
132    with pytest.raises(ValueError):
133        assert (g.remove_edges_from([('A', 'B')]) is None)
134
135    assert (g.getDestination('A', 2) == 'B')
136    assert (g.getDestination('B', 1) == 'A')
137    assert (g._byEdge['A'][2] == 'B')
138    g.remove_edges_from([('A', 'B', 2), ('B', 'A', 1, {})])
139    assert (g.getDestination('A', 2) is None)
140    assert (g.getDestination('B', 1) is None)
141
142    assert (g.getDestination('A', 0) == 'B')
143    g.removeEdgeByKey('A', 0)
144    assert (g.getDestination('A', 0) is None)
145
146    assert (g.getDestination('B', 0) == 'A')
147    g.removeEdgeByKey('B', 0)
148    assert (g.getDestination('B', 0) is None)
149
150    assert (g.getDestination('B', 'hi') == 'A')
151    g.removeEdgesByKey([('B', 'hi'), ('A', 1)]) # spurious target ignored
152    assert (g.getDestination('B', 'hi') is None)