数据结构图和树的区别_树和图数据结构之间的区别

数据结构图和树的区别

In this tutorial you will learn about the difference between tree and graph.

在本教程中，您将了解树和图之间的区别。

Both trees and graphs are two well known mostly used data structures in algorithms.

树和图都是算法中两个众所周知的最常用的数据结构。

Tree Data Structure

树数据结构

In Computer science, a tree is a widely used Abstract Data Structure (ADT). It can be defined recursively as a collection of nodes, where each node contains a value, starting with root node and list of references to other nodes (children), with the constraint, that no reference from it, is called leaf node.

在计算机科学中，树是被广泛使用的抽象数据结构(ADT)。 可以将其递归定义为节点的集合，其中每个节点都包含一个值，该值从根节点开始，到对其他节点(子级)的引用列表，但有一个约束，即没有来自该节点的引用称为叶节点。

Graph Data Structure

图形数据结构

In Computer science, graph also an abstract data structure (ADT), that is mean to implement undirected graph and directed graph concepts of mathematics especially the field of graph theory. Graph is a mathematical representation of a set of objects and relationships or links between objects. We represent objects as nodes or vertices in graph and relations between vertices as edges or arcs. So, we can define that graph is set of vertices V and set of edges E. These edges may be directed or undirected.

在计算机科学中，图形也是一种抽象数据结构(ADT)，它旨在实现数学的无向图和有向图概念，尤其是图论领域。 图是一组对象以及对象之间的关系或链接的数学表示。 我们将对象表示为图中的节点或顶点，并将顶点之间的关系表示为边或弧。 因此，我们可以定义图是由顶点V和边E组成的。这些边可以是有向的也可以是无向的。

Now let’s see what are the differences between graph and tree in tabular form.

现在，让我们看看表格形式的图和树之间的区别是什么。

树和图之间的区别 (Difference between Tree and Graph)

例 (Example)

Tree:

树：

Graph:

图形：

Comment below if you have queries or found any information incorrect in above tutorial for difference between tree and graph data structure.

如果您有疑问或在以上教程中发现任何信息不正确，请在下面评论，以区别树和图数据结构。

翻译自: https://www.thecrazyprogrammer.com/2017/08/difference-between-tree-and-graph.html

数据结构图和树的区别