Question

1. What is graph? Explain about Elementary Graph Operations?in data structures
​

Answer 1

Answer:

$\huge \underline\star \purple{A}\pink{N}\red{S} \blue{W} \green{E} \purple{R} \star$

A graph is said to be simple if there are no parallel and self-loop edges. When there is an edge from one node to another then these nodes are called adjacent nodes. In an undirected graph the edge between v1 and v2 is incident on node v1 and v2.

In many applications the edges of a graph have weights assigned to them. ... A graph with weighted edges is called a network. ELEMENTARY GRAPH OPERATIONS. Given a graph G = (V E) and a vertex v in V(G) we wish to visit all vertices in G that are reachable from v (i.e., all vertices that are connected to v)

$\huge \red{Thank \: my \: answers}$

$\huge \bf \pink{Follow \: me}$