(vertex VertexId)
| 34 | } |
| 35 | |
| 36 | func (g *graph) GetSuccessors(vertex VertexId) VerticesIterable { |
| 37 | iterator := func() <-chan VertexId { |
| 38 | ch := make(chan VertexId) |
| 39 | go func() { |
| 40 | if connected, ok := g.edges[vertex]; ok { |
| 41 | for VertexId, _ := range connected { |
| 42 | if g.IsEdge(vertex, VertexId) { |
| 43 | ch <- VertexId |
| 44 | } |
| 45 | } |
| 46 | } |
| 47 | close(ch) |
| 48 | }() |
| 49 | return ch |
| 50 | } |
| 51 | |
| 52 | return VerticesIterable(&vertexIterableHelper{iterFunc: iterator}) |
| 53 | } |
| 54 | |
| 55 | func (g *DirGraph) Reverse() *DirGraph { |
| 56 | r := NewDirected() |