def run(self): nnodes = len(self.nodes) if self.node_set is not None: # add edges until u and v are connected while not self.node_set_connected(): self.add_random_edge() nedges = min(self.nedges, nnodes*(nnodes-1)) while(len(self.rates) < nedges): self.add_random_edge() print "made random graph with", len(self.nodes), "nodes and", len(self.rates) / 2, "edges" return kmcgraph_from_rates(self.rates)
def _three_state_graph(): return kmcgraph_from_rates(_three_state_rates())
def run(self): self.make_rates() return kmcgraph_from_rates(self.rates)