Skip to content
Snippets Groups Projects
Commit a9687151 authored by Lionel GUEZ's avatar Lionel GUEZ
Browse files

Define function `read_eddy_graph`

parent e1ac7f4e
No related branches found
No related tags found
No related merge requests found
......@@ -4,20 +4,24 @@ import networkx as nx
import csv
import shapefile
G = nx.DiGraph()
def read_eddy_graph():
G = nx.DiGraph()
with open("edgelist.csv") as f:
reader = csv.reader(f, delimiter = " ", skipinitialspace = True)
with open("edgelist.csv") as f:
reader = csv.reader(f, delimiter = " ", skipinitialspace = True)
# Skip title lines:
next(reader)
next(reader)
for row in reader:
k1, i1, k2, i2, weight = int(row[0]), int(row[1]), int(row[2]), \
int(row[3]), float(row[4])
G.add_edge((k1, i1), (k2, i2), weight = weight)
# Skip title lines:
next(reader)
next(reader)
for row in reader:
k1, i1, k2, i2, weight = int(row[0]), int(row[1]), int(row[2]), \
int(row[3]), float(row[4])
G.add_edge((k1, i1), (k2, i2), weight = weight)
return G
G = read_eddy_graph()
print("Number of nodes:", len(G))
print("Number of edges:", G.number_of_edges())
n1 = 0
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment