Noun
inedge (plural inedges) (graph theory) An incoming edge in a digraph, i.e. one that enters a particular node.