CODEWITHSUNDEEP
graphterminologygraph-theory
Jose
Jose

Reputation: 75

In the directed graph, What's the name of the node which does not have an incoming edge

It's a terminology question:

In the directed graph, What's the name of the node which does not have any incoming edge (root)?

In my following example (B):

enter image description here

Upvotes: 2

Views: 1521

Answers (1)

Corey Larson
Corey Larson

Reputation: 1607

From my CS education, I remember calling nodes like B with only outgoing edges "sources", and nodes like A and D with only incoming edges "sinks".

Upvotes: 8

Related Questions