Did I find the right examples for you? yes no      Crawl my project      Python Jobs

All Samples(2)  |  Call(2)  |  Derive(0)  |  Import(0)
Return an iterator over the neighbors of node v.

src/a/i/AIGO-0.1.0/AIGO/go/GOGraph.py   AIGO(Download)
            anc.add(t)
            processed.add(t)
            for tp in self.neighbors_iter(t):
                if tp not in processed:
                    queue.append(tp)
            anc[t] = depth
            processed.add(t)
            for tp in self.neighbors_iter(t):
                if tp not in processed:
                    queue.append( (tp,depth+1) )