Rare card
Directed acyclic graph
- Value
- 50 W
- Attack
- 270
- Defence
- 216
- Players
- 0
In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will…
Get Directed acyclic graph in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack