directed graph - definition. What is directed graph
Diclib.com
قاموس ChatGPT
أدخل كلمة أو عبارة بأي لغة 👆
اللغة:

ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT

في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:

  • كيف يتم استخدام الكلمة في اللغة
  • تردد الكلمة
  • ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
  • خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
  • أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
  • أصل الكلمة

%ما هو (من)٪ 1 - تعريف


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 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
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.
directed acyclic graph         
  • 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.
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
(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 graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.