Question

explain graph with its types directed graph undirected graph simple graph weighted graph connected graph and nonconnected graph​

Answer 1

Answer:

Connected vertices and graphs

In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v. Otherwise, they are called disconnected. ... A directed graph is called weakly connected if replacing all of its directed edges with undirected edges produces a connected (undirected) graph.

Answer 2

Connected vertices and graphs

In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v. Otherwise, they are called disconnected. ... A directed graph is called weakly connected if replacing all of its directed edges with undirected edges produces a connected (undirected) graph.