A directed walk is a sequence of vertices in which each consecutive pair is joined by a directed edge in the direction traversed.
A directed walk is closed when its first and last vertices agree.

Ancestors (6)

  1. Directed graph
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (4)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version