Directed acyclic graph

Описание: If you find our videos helpful you can support us by buying something from amazon.
https://www.amazon.com/?tag=wiki-audi...

Directed acyclic graph

In mathematics and computer science, a directed acyclic graph (DAG i/ˈdæɡ/), is a directed graph with no directed cycles.That is, it is formed by a collection of vertices and directed edges, each edge connecting one vertex to another, such that there is no way to start at some vertex v and follow a sequence of edges that eventually loops back to v again.

=======Image-Copyright-Info========
License: Creative Commons Attribution-Share Alike 3.0 (CC-BY-SA-3.0)
LicenseLink: http://creativecommons.org/licenses/b...
Author-Info: KSmrq

Image Source: https://en.wikipedia.org/wiki/File:Ha...
=======Image-Copyright-Info========

-Video is targeted to blind users

Attribution:
Article text available under CC-BY-SA
image source in video


   • Directed acyclic graph