Let we have a directed multigraph such that or every its vertex the set of edges from this vertex is finite and ordered (in other words, numbered $1,\dots,n$).
I need this construct to describe (depth-first or breath-first) traversing this directed multigraph (where edges are iterated in the above defined order).
What is the term to denote such directed multigraphs with numbered edges?