directed graphs - определение. Что такое directed graphs
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое directed graphs - определение

DIRECTED GRAPH WITH NO DIRECTED CYCLES
DAG structure; Acyclic directed graph; Acyclic digraph; Acyclic Digraph; Weisstein's conjecture; Weisstein's Conjecture; Directed Acyclic Graph; Weisstein Conjecture; Weisstein conjecture; Oriented acyclic graph; Acyclic Directed Graph; Directed acyclic graphs; Applications of directed acyclic graphs
  • close relatives]] causing [[pedigree collapse]].
  • contracting]] each [[strongly connected component]] of the blue graph into a single yellow vertex.
  • A [[Hasse diagram]] representing the partial order of set inclusion (⊆) among the subsets of a three-element set
  • PERT chart for a project with five milestones (labeled 10–50) and six tasks (labeled A–F). There are two critical paths, ADF and BC.
  • Example of a directed acyclic graph

directed acyclic graph         
(DAG) A directed graph containing no cycles. This means that if there is a route from node A to node B then there is no way back. (1994-12-07)
Directed acyclic graph         
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.
directed graph         
  • A tournament on 4 vertices
  • A directed graph with vertices labeled (indegree, outdegree)
  • A simple directed acyclic graph
  • Oriented graph with corresponding incidence matrix
GRAPH WITH ORIENTED EDGES
Arc (graph theory); Indegree; Directed edge (graph theory); Directed edge; Out-degree; In-degree; Weighted digraph; Simple directed graph; Source (graph theory); Sink (graph theory); Outdegree; Graph arc; Oriented Graph; Digraph (mathematics); Balanced digraph; Strongly-connected digraph; Directed cyclic graph; Underlying graph; Information sink; Directed Graph
(digraph) A graph with one-way edges. See also directed acyclic graph. (1994-11-11)

Википедия

Directed acyclic graph

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 sometimes instead called acyclic directed graphs or acyclic digraphs.