Metraipolis › archive › dc_64fa8d958edc

Directed acyclic graph — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Directed_acyclic_graph
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T12:51:38.588Z
SHA-256 of the archived text
cb7da47d47f287aa1abe11306218aab538ca4a467a0eb9d4312a3533e1544244
Stable URL of this page
https://metraipolis.com/documento/dc_64fa8d958edc

How to cite

Directed acyclic graph — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Directed_acyclic_graph (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_64fa8d958edc (Metraipolis archive dc_64fa8d958edc, sha256 cb7da47d47f287aa1abe11306218aab538ca4a467a0eb9d4312a3533e1544244)
BibTeX
@misc{dc64fa8d958edc,
  title = {Directed acyclic graph — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Directed_acyclic_graph},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_64fa8d958edc; sha256 cb7da47d47f287aa1abe11306218aab538ca4a467a0eb9d4312a3533e1544244},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Directed_acyclic_graph. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 never form a closed loop. A directed graph is a DAG if and only if it can be topologically ordered, by arranging the vertices as a linear ordering that is consistent with all edge directions. DAGs have numerous scientific and computational applications, ranging from biology (evolution, family trees, epidemiology) to information science (citation networks) to computation (scheduling). Directed acyclic graphs are also called acyclic directed graphs or acyclic digraphs.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Directed acyclic graph» — https://en.wikipedia.org/wiki/Directed_acyclic_graph
Wikidata Q1195339: «digrafo non avente cicli al suo interno» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1195339
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Directed_acyclic_graph?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378707204, consultata il 2026-10-06T11:07:58.645Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 1ae487bee0e645cc998c5e1216df4d355f45bec2be0318ac07cfd6437d324b9e