Skip to content

Commit

Permalink
tests
Browse files Browse the repository at this point in the history
  • Loading branch information
martinfleis committed Feb 3, 2024
1 parent e8df8ec commit 1fd0f0c
Showing 1 changed file with 20 additions and 3 deletions.
23 changes: 20 additions & 3 deletions momepy/tests/test_utils.py
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,7 @@ def test_dataset_missing(self):
with pytest.raises(ValueError, match="The dataset 'sffgkt' is not available."):
mm.datasets.get_path("sffgkt")

def test_gdf_to_nx(self):
def test_gdf_to_nx_warnings(self):
with pytest.warns(
RuntimeWarning, match="The given network does not contain any LineString."
):
Expand All @@ -39,9 +39,16 @@ def test_gdf_to_nx(self):
):
mm.gdf_to_nx(self.df_points_and_linestring)

def test_gdf_to_nx(self):
nx = mm.gdf_to_nx(self.df_streets)
assert nx.number_of_nodes() == 29
assert nx.number_of_edges() == 35
assert nx.nodes[(1603585.6402153103, 6464428.773867372)] == {
"x": 1603585.6402153103,
"y": 6464428.773867372,
}

def test_gdf_to_nx_dual(self):
dual = mm.gdf_to_nx(self.df_streets, approach="dual")
assert dual.number_of_nodes() == 35
assert dual.number_of_edges() == 74
Expand All @@ -60,6 +67,7 @@ def test_gdf_to_nx(self):
assert nx.number_of_nodes() == 29
assert nx.number_of_edges() == 35

def test_gdf_to_nx_directed(self):
nx = mm.gdf_to_nx(self.df_streets, multigraph=False, directed=True)
assert isinstance(nx, networkx.DiGraph)
assert nx.number_of_nodes() == 29
Expand All @@ -78,6 +86,7 @@ def test_gdf_to_nx(self):
with pytest.raises(ValueError, match="Bidirectional lines"):
mm.gdf_to_nx(self.df_streets, directed=False, oneway_column="oneway")

def test_gdf_to_nx_angles(self):
dual = mm.gdf_to_nx(self.df_streets, approach="dual", angles=False)
assert (
dual.edges[
Expand All @@ -98,7 +107,7 @@ def test_gdf_to_nx(self):
dual = mm.gdf_to_nx(
self.df_streets, approach="dual", angles=False, multigraph=False
)
assert isinstance(nx, networkx.Graph)
assert isinstance(dual, networkx.Graph)
assert (
dual.edges[
(1603499.42326969, 6464328.7520580515),
Expand All @@ -108,7 +117,7 @@ def test_gdf_to_nx(self):
)

dual = mm.gdf_to_nx(self.df_streets, approach="dual", multigraph=False)
assert isinstance(nx, networkx.Graph)
assert isinstance(dual, networkx.Graph)
assert dual.edges[
(1603499.42326969, 6464328.7520580515),
(1603510.1061735682, 6464204.555117119),
Expand All @@ -117,6 +126,14 @@ def test_gdf_to_nx(self):
with pytest.raises(ValueError, match="Directed graphs are not supported"):
mm.gdf_to_nx(self.df_streets, approach="dual", directed=True)

def test_gdf_to_nx_labels(self):
nx = mm.gdf_to_nx(self.df_streets, integer_labels=True)
assert nx.number_of_nodes() == 29
assert nx.number_of_edges() == 35
assert nx.nodes[0] == {
"x": 1603585.6402153103,
"y": 6464428.773867372,
}
def test_nx_to_gdf(self):
nx = mm.gdf_to_nx(self.df_streets)
nodes, edges, W = mm.nx_to_gdf(nx, spatial_weights=True)
Expand Down

0 comments on commit 1fd0f0c

Please sign in to comment.