Build random graphs to collect statistics about search in adjacency lists

adjlist_search.py

#!/usr/bin/python3

from random import randint
from collections import defaultdict

for i in range(10, 10100, 100):
    nEdges = 50
    # Build i random pair of nodes 
    edges = set() # ensure uniqueness of each edge in the graph
    while len(edges) < nEdges:
        edge = (randint(1,i), randint(1,i))
        edges.add(edge)

    # Build adjacency list
    adjlist = defaultdict(list)
    for start, end in edges:
        adjlist[start].append(end)

    # find all nodes to "1" -- counting iterations
    # print(adjlist)
    count = 0
    for k, l in adjlist.items():
        for n in l:
            count += 1
            if n == 1:
                break

    print(i, count, sep="\t")