Closed oerich closed 11 years ago
This is kind of a big one. The definition of connectivity is non trivial for directed graphs. Also, I need directed graphs. I should do two things:
There is also an issue with changing the cutoff weight for networks. When the edges are cutoff, more subgraphs appear. The metric does not change, though.
Turns out that the asymmetry problem has been dealt with: for each pair of nodes a,b we look we test whether weight(a,b)+weight(b,a) > 0. Thus, we interpret this as an undirected graph.
... but some of the graphs are directed