# -*- coding: utf-8 -*- #!/usr/bin/env python """ Create an G{n,m} random graph with n nodes and m edges and report some properties. This graph is sometimes called the ErdÅs-Rényi graph but is different from G{n,p} or binomial_graph which is also sometimes called the ErdÅs-Rényi graph. """ __author__ = """Aric Hagberg (hagberg@lanl.gov)""" __credits__ = """""" # Copyright (C) 2004-2006 by # Aric Hagberg <hagberg@lanl.gov> # Dan Schult <dschult@colgate.edu> # Pieter Swart <swart@lanl.gov> # All rights reserved. # BSD license. from networkx import * import sys n=10 # 10 nodes m=20 # 20 edges G=gnm_random_graph(n,m) # some properties print("node degree clustering") for v in nodes(G): print('%s %d %f' % (v,degree(G,v),clustering(G,v))) # print the adjacency list to terminal try: write_adjlist(G,sys.stdout) except TypeError: # Python 3.x write_adjlist(G,sys.stdout.buffer)