网络上n层相邻节点 广度优先

adjacent.py

import sys

def putin(name,other,peers):
    if name in peers.keys():
        peers[name].append(other)
    else:
        peers[name]=[other]

def take_peers(filename,split_sign="\t"):
    inters=open(filename,'r').read().splitlines()
    peers={}
    for inter in inters:
        [fir,sec]=inter.split(split_sign)
        putin(fir,sec,peers)
        putin(sec,fir,peers)
    return peers

def adjacent(peers,seed,need_level):
    if need_level==0:
        return []
    if peers[seed]==None:
        return []
    adjas=[]
    for leaf in peers[seed]:
        if peers[leaf]==None:
            continue
        adjas=adjas+[leaf]
    peers[seed]=None
    for leaf in adjas:
        adjas=adjas+adjacent(peers,leaf,need_level-1)
    return adjas

if __name__=="__main__":
    for adja in adjacent(take_peers(sys.argv[1]),sys.argv[2],int(sys.argv[3])):
        print adja