def testJ1():
n = random.randint(10, 50)
seq = nx.random_powerlaw_tree_sequence(n, 3, None, 500)
tree = nx.degree_sequence_tree(seq)
a = random.randint(0, n)
b = random.randint(0, n)
while (b == a or tree.has_edge(a, b)):
b = random.randint(0, n)
tree.add_edge(a, b)
print "running on a", n, "node tree with (", a, ",", b, ") added\n"
blackstart = random.randint(0, n - 1)
sig1 = greedy.normal_greedy(tree, blackstart)
cos1 = cost.cost_function(tree, sig1)
sig2 = greedy.percentage_greedy(tree, blackstart)
cos2 = cost.cost_function(tree, sig2)
print "Greedy cost for distinct cycle is", cos1
def testK1():
print "running on K4 to K10 with two edges sharing a vertex removed:"
for n in range(4, 11):
print n
Gn = nx.complete_graph(n)
ran = random.randint(0, n - 1)
Gn.remove_edge(ran, (ran + 1) % n)
Gn.remove_edge((ran + 1) % n, (ran + 2) % n)
blackstart = random.randint(0, n - 1)
while (blackstart == ran or blackstart == (ran + 1) % n
or blackstart == (ran + 2) % n):
blackstart = random.randint(0, n - 1)
print "blackstart is", blackstart
sig1 = greedy.normal_greedy(Gn, blackstart)
cos1 = cost.cost_function(Gn, sig1)
sig2 = greedy.percentage_greedy(Gn, blackstart)
cos2 = cost.cost_function(Gn, sig2)
print "Greedy cost for almost complete K", n, "is", cos1
def test():
n = random.randint(10, 200)
seq = nx.random_powerlaw_tree_sequence(n, 3, None, 500)
g = nx.degree_sequence_tree(seq)
sig = greedy.normal_greedy(g, random.randint(0, n))
cos = cost.cost_function(g, sig)
print n
print "Installation order is %s \n" % sig
print "The cost of this order is %s \n" % cos
import networkx as nx
import greedy
import cost
G = nx.Graph()
G.add_node(0)
for i in [1,2,3,4,5,6]:
G.add_node(i)
G.add_edge(0,1)
G.add_edge(0,2)
G.add_edge(1,3)
G.add_edge(1,4)
G.add_edge(2,5)
G.add_edge(2,6)
G.add_edge(1,2)
G.add_edge(3,4)
order = greedy.greedy(G,0)
cost = cost.cost_function(G,[0,1,3,2,4,5,6])
print cost
def parse(file, blackstart):
G = nx.Graph()
""" read in a file and create the corresponding graph """
print("\nReading input file...\n")
f = open(file, 'r')
# skip lines starting with %, those are comments
param = f.readline()
while (param[0] == '%'):
param = f.readline()
params = param.split()
# print "params are %s \n" %params
if len(params) != 3 or params[0] != params[1]:
print "\nInterrupted: \nFile not clean, please double check.\n"
return
numNode = int(params[0])
numEdge = int(params[2])
for index in range(0, numEdge):
newEdge = f.readline().split()
# we don't accept edges from v to v itself
if int(newEdge[0]) != int(newEdge[1]):
G.add_edge(int(newEdge[0]), int(newEdge[1]))
# if G.number_of_nodes()!= numNode or G.number_of_edges()!=numEdge-numNode:
# print("Parsing error")
# return
# nx.draw(G)
# plt.savefig("path.png")
print "Done making graph \n"
blah = nx.degree(G).values()
idk = plt.hist(blah, bins=range(min(blah), max(blah) + 1, 1))
plt.ylabel("Number of Nodes")
plt.xlabel("Degree")
plt.title("Degree Histogram for Western US Power Network")
plt.savefig("power.png")
number_of_nodes = nx.number_of_nodes(G)
blackstart_rand = randint(2, number_of_nodes)
print sorted(G.degree_iter(), key=itemgetter(1), reverse=True)[0]
blackstart_highest_rank = sorted(G.degree_iter(),
key=itemgetter(1),
reverse=True)[0][0]
print "random blackstart " + str(blackstart_rand)
print "highest rank blackstart" + str(blackstart_highest_rank)
# sigma = greedy.normal_greedy(G,blackstart)
# sigma_rand = greedy.normal_greedy(G, blackstart_rand)
# sigma_highest_rank = greedy.normal_greedy(G, blackstart_highest_rank)
# print "Sigma calculated \n"
# c = cost.cost_function(G, sigma)
# c_rand = cost.cost_function(G, sigma_rand)
# c_highest_rank = cost.cost_function(G, sigma_highest_rank)
#
# print "Normal greedy done \n"
# print "Installation order is %s \n" %sigma
# print "The cost of this order is %s \n" %cost.print_cost(c)
# sigma2 = greedy.percentage_greedy(G,blackstart)
# sigma2_rand = greedy.percentage_greedy(G, blackstart_rand)
# sigma2_highest_rank = greedy.percentage_greedy(G, blackstart_highest_rank)
# print "Sigma calculated \n"
# c2 = cost.cost_function(G, sigma2)
# c2_rand = cost.cost_function(G, sigma2_rand)
# c2_highest_rank = cost.cost_function(G, sigma2_highest_rank)
#
# print "Percentage greedy done \n"
# print "Installation order is %s \n" %sigma2
# print "The cost of this order is %s \n" %cost.print_cost(c2)
#diff = cost.cost_diff(c,c2)
#print "cost1 - cost2 is %s"%cost.print_cost(diff)
sigma = greedy.normal_greedy_random(G, blackstart)
sigma_rand = greedy.normal_greedy_random(G, blackstart_rand)
sigma_highest_rank = greedy.normal_greedy_random(G,
blackstart_highest_rank)
print "Sigma calculated \n"
c = cost.cost_function(G, sigma)
c_rand = cost.cost_function(G, sigma_rand)
c_highest_rank = cost.cost_function(G, sigma_highest_rank)
print "Normal greedy done \n"
# new_dict = {}
# new_dict['blackstart_1'] = {'normal_greedy': cost.print_cost(c), 'percentage_greedy': cost.print_cost(c2)}
# blackstart_rand_label = 'blackstart_random_' + str(blackstart_rand)
# new_dict[blackstart_rand_label] = {'normal_greedy': cost.print_cost(c_rand), 'percentage_greedy': cost.print_cost(c2_rand)}
# blackstart_highest_rank_label = 'blackstart_highest_rank_' + str(blackstart_highest_rank)
# new_dict[blackstart_highest_rank_label] = {'normal_greedy': cost.print_cost(c_highest_rank), 'percentage_greedy': cost.print_cost(c2_highest_rank)}
# return new_dict
return [
cost.print_cost(c),
cost.print_cost(c_rand),
cost.print_cost(c_highest_rank)
]