计算有向图的出入度邻居

# -*- coding: UTF-8 -*-
import matplotlib.pyplot as plt
import networkx as nx
import copy
import random
def Getinneighbors(G,v):  #计算节点入度及出度邻居
    # a=[x[0] for x in G.in_edges(v)]   #有向图入度邻居
    a=list(G.neighbors(v))   #有向图出度邻居
    return a
if __name__ == "__main__":
    G=nx.DiGraph()
    G.add_edges_from([('A','B'),('A','C'),('A','D'),('A','H'),('A','I'),('A','K'),('B','D'),('B','C'),('C','D'),('C','E'),('D','E'),('E','F'),('F','G'),('I','J'),('I','K'),('K','L'),('L','M'),('L','N'),('L','O'),('O','P'),('O','Q')])
    print(Getinneighbors(G,'C'))  #测试
    nx.draw(G,with_labels=True,node_size=900,node_color='red')
    plt.show()