nx.write_pajek(g, path)
def sorted_map(map):
ms = sorted(map.iteritems(), key=lambda (k,v): (-v,k))
return ms
def trim_degrees(g,degree=1):
d = nx.degree(g)
for n in g.nodes():
if d[n] <= degree:
g.remove_node(n)
return g
def podar_red_hasta(g, n_nodos):
for i in range(1,10):
g = trim_degrees(g, i)
if len(g) <= n_nodos:
break
return g
if __name__ == '__main__':
g = ns.krackhardt_kite_graph()
print g.number_of_edges()
print g.number_of_nodes()
print g.adjacency_list()
print g.edges()
print dict((x, g.neighbors(x)) for x in g.nodes())
print list(tr.bfs_edges(g,0))
print list(tr.dfs_edges(g,0))
nx.draw_circular(g)
#nx.draw_graphviz(g)
DFS_nodes(graph, neighbor, visited)
return visited
def trim_degrees(G, degree=1):
G2 = G.copy()
deg = nx.degree(G2)
for n in G2.nodes():
if deg[n] <= degree:
G2.remove_node(n)
return G2
if __name__ == '__main__':
G = krackhardt_kite_graph()
plt.figure()
nx.draw(G, with_labels=True)
edges = nx.traversal.dfs_edges(G)
print "DFS edges: ", list(edges)
edges = nx.traversal.bfs_edges(G)
print "BFS edges: ", list(edges)
path = nx.algorithms.shortest_path(G, 0, 9)
print "Shortest Path: ", path
path = nx.algorithms.dijkstra_path(G, 0, 9)
print "Dijkstra Path: ", path
import networkx.generators.small as smallgen
g = smallgen.krackhardt_kite_graph()
"""
Some Basic Graph Functions
"""
print g.number_of_edges()
print g.number_of_nodes()
print g.adjaceny_list()
print g.edges()
print { x : g.neighbors(x) for x in g.nodes()}
"""
Traversal Algorithms
"""
"""
Centrality
"""
