'KeysView' object is returned instead of a list about seirsplus HOT 5 CLOSED

@tomermilo actually the following version does not give any problem (essentially it is what you also mentioned I think) and I was able to run the example provided:

==============================================
def custom_exponential_graph(base_graph=None, scale=100, min_num_edges=0, m=9, n=None):
# Generate a random preferential attachment power law graph as a starting point.
# By the way this graph is constructed, it is expected to have 1 connected component.
# Every node is added along with m=8 edges, so the min degree is m=8.
if(base_graph):
graph = base_graph.copy()
else:
assert(n is not None), "Argument n (number of nodes) must be provided when no base graph is given."
graph = networkx.barabasi_albert_graph(n=n, m=m)

# To get a graph with power-law-esque properties but without the fixed minimum degree,
# We modify the graph by probabilistically dropping some edges from each node. 
for node in graph:
    neighbors = list(graph[node].keys())
    quarantineEdgeNum = int( max(min(numpy.random.exponential(scale=scale, size=1), len(neighbors)), min_num_edges) )
    quarantineKeepNeighbors = numpy.random.choice(neighbors, size=quarantineEdgeNum, replace=False)
    for neighbor in neighbors:
        if(neighbor not in quarantineKeepNeighbors):
            graph.remove_edge(node, neighbor)

return graph

from seirsplus.

I did the same and it solved this problem, but then I had a runtime error

RuntimeError: dictionary changed size during iteration

at the line 1177:

for neighbor in neighbors:

Any thoughts?

from seirsplus.

@kpelechrinis can you send your new custom_exponential_graph function?

from seirsplus.

This is how I fixed it as well. Good luck

from seirsplus.

The change to list(dict.keys()) has been made throughout the package to make this keys lookup work in both Python 2 and 3. Thank you for flagging this issue.

from seirsplus.