edgelist = [
        (0, 1),
        (1, 3),
        (2, 4),
        (1, 5),
        (1, 3),
        (5, 5),
        (1, 3)
    ]
"""由于nx.MultiGraph()可累計(jì)多條重復(fù)邊作為權(quán)重，所以(1,3)出現(xiàn)3次權(quán)重是3"""
g = nx.MultiGraph()  # 無向多邊圖
g.add_edges_from(edgelist)
adj = sp.lil_matrix(nx.adjacency_matrix(g))
print(adj.todense())

def adjacency_matrix(G, nodelist=None, weight='weight'):
    """Return adjacency matrix of G.

    Parameters
    ----------
    G : graph
       A NetworkX graph

    nodelist : list, optional
       The rows and columns are ordered according to the nodes in nodelist.
       If nodelist is None, then the ordering is produced by G.nodes().

    weight : string or None, optional (default='weight')
       The edge data key used to provide each value in the matrix.
       If None, then each edge has weight 1.
    				...
    				...
    """
    return nx.to_scipy_sparse_matrix(G, nodelist=nodelist, weight=weight)

edgelist = [
        (0, 1),
        (1, 3),
        (2, 4),
        (1, 5),
        (1, 3),
        (5, 5),
        (1, 3)
    ]
"""由于nx.MultiGraph()可累計(jì)多條重復(fù)邊作為權(quán)重，所以(1,3)出現(xiàn)3次權(quán)重是3"""
g = nx.MultiGraph()  # 無向多邊圖
g.add_edges_from(edgelist)
print(g.nodes())
adj = sp.lil_matrix(nx.adjacency_matrix(g))
print(adj.todense())

edgelist = [
        (0, 1),
        (1, 3),
        (2, 4),
        (1, 5),
        (1, 3),
        (5, 5),
        (1, 3)
    ]
"""由于nx.MultiGraph()可累計(jì)多條重復(fù)邊作為權(quán)重，所以(1,3)出現(xiàn)3次權(quán)重是3"""
g = nx.MultiGraph()  # 無向多邊圖

""" 節(jié)點(diǎn)id按照順序排！！否則生成的鄰接矩陣不一樣 """
nodeset = sorted(set(itertools.chain(*edgelist)))
g.add_nodes_from(nodeset)

g.add_edges_from(edgelist)
print(g.nodes())
adj = sp.lil_matrix(nx.adjacency_matrix(g))
print(adj.todense())

edgelist = [
        (0, 1),
        (1, 3),
        (2, 4),
        (1, 5),
        (1, 3),
        (5, 5),
        (1, 3)
    ]
""" 把edgelist中的每個(gè)(a,b)元素打平成a,b """
nodes = list(itertools.chain(*edgelist))
print(nodes)
# 輸出：
# [0, 1, 1, 3, 2, 4, 1, 5, 1, 3, 5, 5, 1, 3]

""" 利用set元素唯一的性質(zhì)，將重復(fù)元素去重 a,a => a """
nodeset = set(nodes)
print(nodeset)
# 輸出：
# {0, 1, 2, 3, 4, 5}

""" set中的元素是無序、非空、唯一的，所以對(duì)set再sorted一下，確保順序是對(duì)的 """
nodeset = sorted(nodeset)
print(nodeset)
# 輸出：
# [0, 1, 2, 3, 4, 5]