Don't like ads? PRO users don't see any ads ;-)
Guest

Untitled

By: a guest on Apr 30th, 2012  |  syntax: None  |  size: 0.84 KB  |  hits: 19  |  expires: Never
download  |  raw  |  embed  |  report abuse  |  print
Text below is selected. Please press Ctrl+C to copy to your clipboard. (⌘+C on Mac)
  1. Textrank: complementing pagerank for sentence extraction using networkx
  2. import networkx as nx
  3. D=nx.DiGraph()
  4. D.add_weighted_edges_from([('A','B',0.5),('A','C',1)])
  5. print nx.pagerank(D)
  6.        
  7. import networkx as nx
  8.  
  9. # Undirected Network
  10. D = nx.Graph()
  11. D.add_weighted_edges_from([('A', 'B', 0.5),('A', 'C', 1)])
  12.  
  13. # Default max number of iterations failed to converge for me
  14. print nx.pagerank(D, max_iter=200)
  15.  
  16. # Outputs:
  17. {'A': 0.48648648872844047, 'C': 0.32567567418103965, 'B': 0.18783783709051982}
  18.        
  19. import networkx as nx
  20.  
  21. # Directed Network
  22. D = nx.DiGraph()
  23. D.add_weighted_edges_from([('A', 'B', 0.5), ('A', 'C', 1)])
  24.  
  25. # Convert to undirected
  26. G = D.to_undirected()
  27.  
  28. # Default max number of iterations failed to converge for me
  29. print nx.pagerank(G, max_iter=200)
  30.  
  31. # Outputs:
  32. {'A': 0.48648648872844047, 'C': 0.32567567418103965, 'B': 0.18783783709051982}