simplified initialisation for the different specialisations of adjace…

…ncy graphs
MaineKuehn · Jul 29, 2018 · 0b00524 · 0b00524
1 parent e38d44e
commit 0b00524
Showing 1 changed file with 1 addition and 6 deletions.
diff --git a/graphi/graph_io/csv.py b/graphi/graph_io/csv.py
@@ -201,12 +201,7 @@ def graph_reader(
     else:
         raise TypeError("parameter 'nodes_header' must be True, False, an iterable or a callable")
     # fill graph with nodes
-    if value_bound:
-        graph = bounded_graph.Bounded(nodes, value_bound=value_bound, undirected=undirected)
-    elif undirected:
-        graph = undirected_graph.Undirected(nodes)
-    else:
-        graph = adjacency_graph.AdjacencyGraph(nodes, undirected=undirected, value_bound=value_bound)
+    graph = adjacency_graph.AdjacencyGraph(nodes, undirected=undirected, value_bound=value_bound)
     # still need to consume the first line as content if not unset
     iter_rows = reader if first_line is None else itertools.chain([first_line], reader)
     for row_idx, row in enumerate(iter_rows):