如何使Networkx生成带有排序节点的GML文件

时间:2015-03-13 07:59:01

标签: python graph igraph networkx

我有以下代码:

#!/usr/bin/env python
import networkx as nx
def main():
    """docstring for main"""
    outerdict = {"A":["a1","a2","a3"], "B":["b1","b2","b3","b5","b6", "b7"], "C":["c2","c3"], "D":["d1","d2","d3"]}
    keynode = "Z"

    colorlist = [ "#beaed4", "#fdc086", "#ffff99", "#386cb0","#f0027f"]
    G = nx.Graph()
    G.add_node(keynode,graphics={"fill":"#7fc97f","w":27,"h":27, "d":27})
    for i,ky in enumerate(outerdict):
        nodes = outerdict[ky]
        nodecol = colorlist[i]
        print ky, nodecol
        for node in nodes:
            G.add_node(node,graphics={"fill":nodecol,"w":27,"h":27,"d":27})
            G.add_edge(keynode, node, value = 10)

    outfile = "test.gml"
    nx.write_gml(G,outfile)


if __name__ == '__main__':
    main()

它生成以下GML文件:

graph [
  node [
    id 0
    label "b6"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#ffff99"
    ]
  ]
  node [
    id 1
    label "a1"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#beaed4"
    ]
  ]
  node [
    id 2
    label "b5"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#ffff99"
    ]
  ]
  node [
    id 3
    label "a3"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#beaed4"
    ]
  ]
  node [
    id 4
    label "a2"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#beaed4"
    ]
  ]
  node [
    id 5
    label "b7"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#ffff99"
    ]
  ]
  node [
    id 6
    label "b1"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#ffff99"
    ]
  ]
  node [
    id 7
    label "b2"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#ffff99"
    ]
  ]
  node [
    id 8
    label "b3"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#ffff99"
    ]
  ]
  node [
    id 9
    label "c3"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#fdc086"
    ]
  ]
  node [
    id 10
    label "c2"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#fdc086"
    ]
  ]
  node [
    id 11
    label "Z"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#7fc97f"
    ]
  ]
  node [
    id 12
    label "d2"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#386cb0"
    ]
  ]
  node [
    id 13
    label "d3"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#386cb0"
    ]
  ]
  node [
    id 14
    label "d1"
    graphics [ 
      h 27
      d 27
      w 27
      fill "#386cb0"
    ]
  ]
  edge [
    source 0
    target 11
    value 10
  ]
  edge [
    source 1
    target 11
    value 10
  ]
  edge [
    source 2
    target 11
    value 10
  ]
  edge [
    source 3
    target 11
    value 10
  ]
  edge [
    source 4
    target 11
    value 10
  ]
  edge [
    source 5
    target 11
    value 10
  ]
  edge [
    source 6
    target 11
    value 10
  ]
  edge [
    source 7
    target 11
    value 10
  ]
  edge [
    source 8
    target 11
    value 10
  ]
  edge [
    source 9
    target 11
    value 10
  ]
  edge [
    source 10
    target 11
    value 10
  ]
  edge [
    source 11
    target 12
    value 10
  ]
  edge [
    source 11
    target 13
    value 10
  ]
  edge [
    source 11
    target 14
    value 10
  ]
]

请注意,节点不是有序的。例如,a1介于b1b5之间。这使得情节看起来像这样:

enter image description here

我希望图表根据循环和初始数据结构outderdict按顺序排序。因此,黄色节点将与其他黄色等顺序组合在一起。

如何使用Networkx对GML文件进行排序?其他解决方案(例如Igraph)只要在Python框架内受到欢迎。

1 个答案:

答案 0 :(得分:3)

自2015年1月1日开始,NetworkX中提供了有序图形数据结构.OrderGraph类将按照添加顺序从NetworkX数据结构输出节点和边。
您需要在https://github.com/networkx/networkx/获取最新的开发版本,以便以下工作。

import networkx as nx
outerdict = {"A":["a1","a2","a3"], "B":["b1","b2","b3","b5","b6", "b7"], "C":["c2","c3"], "D":["d1","d2","d3"]}
keynode = "Z"
colorlist = [ "#beaed4", "#fdc086", "#ffff99", "#386cb0","#f0027f"]
G = nx.OrderedGraph()
G.add_node(keynode,graphics={"fill":"#7fc97f","w":27,"h":27, "d":27})
for i,ky in enumerate(outerdict):
    nodes = outerdict[ky]
    nodecol = colorlist[i]
    print ky, nodecol
    for node in nodes:
        G.add_node(node,graphics={"fill":nodecol,"w":27,"h":27,"d":27})
        G.add_edge(keynode, node, value = 10)
outfile = "test.gml"
nx.write_gml(G,outfile)

请注意,当你遍历'enumerate(outerdict)'时,你的'outerdict'数据结构可能会以不同于你初始化它的顺序出现。如果节点“A”,“B”,“C”和“D”的顺序对您很重要,那么您需要更改它们添加到图表的方式,以确保它们按顺序插入。