Return iterator over the vertices that point to self. >>> g = Graph() >>> g.add(1, [2, 3, 4]) >>> g.add(2, [3, 2]) >>> list(g[2].in_vertices()) #XXX arbitrary order [1, 2]
(self)
| 77 | if not self: break #good place to check if self is empty yet... |
| 78 | |
| 79 | def in_vertices(self): #O(n) |
| 80 | """Return iterator over the vertices that point to self. |
| 81 | |
| 82 | >>> g = Graph() |
| 83 | >>> g.add(1, [2, 3, 4]) |
| 84 | >>> g.add(2, [3, 2]) |
| 85 | >>> list(g[2].in_vertices()) #XXX arbitrary order |
| 86 | [1, 2] |
| 87 | """ |
| 88 | for head in self._graph.itervalues(): |
| 89 | if self._id in head: |
| 90 | yield head._id |
| 91 | |
| 92 | def in_degree(self): #O(n) |
| 93 | """Return number of edges pointing into vertex. |
no test coverage detected