def N(self, ids=None): paths = [] if ids is None: paths = [['N', k] for k in self.g.nodes.keys()] else: if not islisttype(ids): ids = [ids] for i in ids: if i in self.g.nodes: paths.append(['N', i]) #out.append(self.g.nodes[i]) return self.t(list(paths), 'nodes')
def N(self, ids=None): paths = [] if ids is None: paths = [["N", k] for k in self.g.nodes.keys()] else: if not islisttype(ids): ids = [ids] for i in ids: if i in self.g.nodes: paths.append(["N", i]) # out.append(self.g.nodes[i]) return self.t(list(paths), "nodes")
def __init__(self, graph, paths=None, store="nodes", output=None): self.g = graph if paths: if not islisttype(paths): paths = list(paths) else: paths = [] self.paths = paths self.current = 0 self.store = store self.output = output self.before = None self.after = None self.nameddata = [] self.names = []
def __init__( self, graph, paths=None, store='nodes', output=None, ): self.g = graph if paths: if not islisttype(paths): paths = list(paths) else: paths = [] self.paths = paths self.current = 0 self.store = store self.output = output self.before = None self.after = None self.nameddata = [] self.names = []