Tree (graph theory)
id:
tree-graph-theory-177-16653289
title:
Tree (graph theory)
text:
In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph. A forest is an undirected graph in which any two vertices are connected by at most one path, or equivalently an acyclic undirected graph, or equivalently a disjoint union of trees. A directed tree, oriented tree, polytree, or singly connected network is a directed acyclic graph (DAG) whose underlying undirected graph is a tree. A polyfo
brand slug:
wiki
category slug:
encyclopedia
description:
Undirected, connected and acyclic graph
original url:
https://en.wikipedia.org/wiki/Tree_(graph_theory)
date created:
2002-04-10T09:09:33Z
date modified:
2024-09-04T03:57:53Z
main entity:
{"identifier":"Q272735","url":"https://www.wikidata.org/entity/Q272735"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/24/Tree_graph.svg","width":162,"height":189}
fields total:
13
integrity:
16