Algorithm that can detect the routers with the highest number of connections

identify_router.py

# 1 -> 2 -> 3 -> 5 -> 2 -> 1 
sample_input_graph_dict_1={
    "1":["2"],
    "2":["3","1"],
    "3":["5"],
    "4":[],
    "5":["2"],
    "6":[],
}
# 1 -> 3 -> 5 -> 6 -> 4 -> 5 -> 2 -> 6 
sample_input_graph_dict_2={
    "1":["3"],
    "2":["6"],
    "3":["5"],
    "4":["5"],
    "5":["6","2"],
    "6":["4"],
}
# 2 -> 4 -> 6 -> 2 -> 5 -> 6 
sample_input_graph_dict_3={
    "2":["4","5"], 
    "4":["6"],
    "6":["2"],
    "5":["6"]
}

def identify_router(input_graph):
    temp={}
    for k in input_graph.keys():
        
        if not temp.get(k,None):   
            temp[k]=0            
        temp[k]= temp[k] + len(input_graph[k]) #count output connections
        
        for i in input_graph[k]:
            if not temp.get(i,None):                
                temp[i]=0               
            temp[i]= temp[i] + 1  #count input connections
             
    maxValue = max(temp.values())    
    return [k for k, v in temp.items() if v == maxValue]

print("max connection for dict_1: ",identify_router(sample_input_graph_dict_1))         
print("max connection for dict_2: ",identify_router(sample_input_graph_dict_2))  
print("max connection for dict_3: ",identify_router(sample_input_graph_dict_3))  

max connection for dict_1: ['2']
max connection for dict_2: ['5']
max connection for dict_3: ['2', '6']