def __init__(self, Graph): self.num_of_nodes = Graph.number_of_nodes() self.G = Graph self.DependencyMatrix = [] self.AllProbes = [] self.probeno = 0 self.Node = collections.namedtuple('Node', 'NodeNum, parents') distToEndnode = {} for n in range(0, self.num_of_nodes): distToEndnode[n] = nx.shortest_path_length(self.G, 0, n) self.Maxdepth = max(distToEndnode.itervalues()) #print self.Maxdepth self.initialization()
def __init__(self, Graph, StartNode): self.num_of_nodes = Graph.number_of_nodes() self.G = Graph self.DependencyMatrix = [] self.AllProbes = [] self.probeno = 0 self.MaxdepthSubGraph = -1 self.Node = collections.namedtuple('Node', 'NodeNum, parents') self.ProbeToClus = [] self.SourceNode = StartNode distToNode = {} for n in range(0,self.num_of_nodes): distToNode[n] = nx.shortest_path_length(self.G,0,n) self.Maxdepth = max(distToNode.itervalues()) self.initialization()
def __init__(self, Graph): self.num_of_nodes = Graph.number_of_nodes() self.G = Graph self.DependencyMatrix = [] self.AllProbes = [] self.probeno = 0 self.Node = collections.namedtuple('Node', 'NodeNum, parents') self.SourceNode = -1 mindist = 999999 for node in G.nodes(): dist = sum(nx.shortest_path_length(G,node,n) for n in G.nodes()) if mindist > dist: mindist = dist self.SourceNode = node #print "startnode=%d"%startnode distToEndnode = {} for n in range(0,self.num_of_nodes): distToEndnode[n] = nx.shortest_path_length(self.G,self.SourceNode,n) self.Maxdepth = max(distToEndnode.itervalues()) #print self.Maxdepth self.initialization()