Answer #1

Tree and graph are normally used to describe data structures. Most people however are unable to differentiate between Tree and Graph. In simple terms, a graph simply refers to a group of items connected at the edges. A graph is also described as a set of items or vertices that share binary relation. A tree, on the other hand is popularly used in Information Technology, computer science to be precise. It resembles a tree and has a group of nodes connected to each other.

A graph is a group of edges and nodes, as with trees. However, there are no regulations when making connections between the nodes. On the other hand, nodes are not used in graph structures. In other words, graphs resemble a collection of interrelated nodes. In a graph, nodes are viewed as structures or items, but edges are symbolized using dissimilar forms.

There are different types of graphs, namely the edges, vertexes and a connection of edges and vertexes. Vertexes are repeated regularly at the starting and concluding vertexes but the edges are not repeated. In contrast, a tree does not have a loop but is still connected. Additionally, it is a modestly connected graph with a single path connecting the vertexes.

All trees are therefore classified as graphs. The only difference is that the latter is used to demonstrate a graph. All nodes are accessible from the starting nodes, unlike trees where the nodes are disjointed. In simple terms, a graph is a group of edges and nodes but have no rules that dictate the interrelation among the different nodes.

Summary:

1. A graph simple refers to a set of vertexes that share a binary connection. It is also described as a set of nodes interconnected to each other.

2. Its structure has a set of nodes interconnected to each other.

Answered By: daniel [554 ]