September 14, 2023 in Data Structure
BFS can be used to find the shortest distance between some starting node and the remaining nodes of the graph. The shortest distance is the minimum number of edges traversed in order to travel from the start node the specific node being examined.
September 14, 2023 in Data Structure
The depth of a list is the maximum level attributed to any element with in the list or with in any sub list in the list.
September 14, 2023 in Data Structure
When every edge in an acyclic graph is undirected, it is called an undirected acyclic graph. It is also called as undirected forest.
September 14, 2023 in Data Structure
a. Adjacency matrix
b. Adjacency list
September 14, 2023 in Data Structure
aij = 1 if (vi, vj) Exists =0 otherwise
When a directed graph is not strongly connected but the underlying graph is connected, then the graph is said to be weakly connected.
September 14, 2023 in Data Structure
An undirected graph is connected, if there is a path from every vertex to every other vertex. A directed graph with this property is called strongly connected.
September 14, 2023 in Data Structure
A simple diagram, which does not have any cycles, is called an acyclic graph.
September 14, 2023 in Data Structure
A path which originates and ends in the same node is called a cycle or circuit.
September 14, 2023 in Data Structure
i. A path in a diagram in which the edges are distinct is called a simple path.
ii. It is also called as edge simple.
September 14, 2023 in Data Structure
The path in a graph is the route taken to reach terminal node from a starting node.
