Graph

•Create an array, size equal to No. of vertices
•Add edge
•Remove edge
•Print the graph

•Create an dynamic array, size equal to No. of vertices
•Add edge
•Remove edge
•Print the graph

•Collections module is used
•Keep record of visited node
•proceeds level by level
•Check is it following BFT

•Follows first a path form the starting to the ending node, keep doing this
•Keep record of visited node
•Check is it following DFT

•A greedy algorithm
•Start from one vertex and keep adding edges
•Until we get minimum spanning tree

•A greedy algorithm
•Start from the edges with the lowest weight and keep adding edges
•Edge create cycle, reject it
•Until we get the goal

•To find the shortest path between any two vertices of a graph
•Uses a greedy approach