| 15 | } |
| 16 | |
| 17 | func (g *graph) GetPredecessors(vertex VertexId) VerticesIterable { |
| 18 | iterator := func() <-chan VertexId { |
| 19 | ch := make(chan VertexId) |
| 20 | go func() { |
| 21 | if connected, ok := g.edges[vertex]; ok { |
| 22 | for VertexId, _ := range connected { |
| 23 | if g.IsEdge(VertexId, vertex) { |
| 24 | ch <- VertexId |
| 25 | } |
| 26 | } |
| 27 | } |
| 28 | close(ch) |
| 29 | }() |
| 30 | return ch |
| 31 | } |
| 32 | |
| 33 | return VerticesIterable(&vertexIterableHelper{iterFunc: iterator}) |
| 34 | } |
| 35 | |
| 36 | func (g *graph) GetSuccessors(vertex VertexId) VerticesIterable { |
| 37 | iterator := func() <-chan VertexId { |