Skip to content

adding immediate ancestors and descendants #12

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
davidroman0O wants to merge 1 commit into
base: main
Choose a base branch
from
Open

adding immediate ancestors and descendants #12

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions dag.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,28 @@ func (g *AcyclicGraph) DirectedGraph() Grapher {
return g
}

// Predecessors returns the immediate predecessors of a given vertex.
func (g *AcyclicGraph) ImmediateAncestors(me Vertex) ([]Vertex, error) {
var predecessors []Vertex
for _, edge := range g.Edges() {
if edge.Target() == me {
predecessors = append(predecessors, edge.Source())
}
}
return predecessors, nil
}

// Descendants returns the immediate descendants of a given vertex.
func (g *AcyclicGraph) ImmediateDescendants(me Vertex) ([]Vertex, error) {
var descendants []Vertex
for _, edge := range g.Edges() {
if edge.Source() == me {
descendants = append(descendants, edge.Target())
}
}
return descendants, nil
}

// Returns a Set that includes every Vertex yielded by walking down from the
// provided starting Vertex v.
func (g *AcyclicGraph) Ancestors(v Vertex) (Set, error) {
Expand Down