directed acyclic graph

directed acyclic graph definitions

noun
  • A finite directed graph that contains no directed cycles.