This Project is to implement some procedures doing the following:
- Represent any graph using these input parameters:
• A parameter to represent the graph by Adjacency Matrix, or Adjacency List.
• A parameter to indicate whether the graph is directed, or undirected.
• A parameter to indicate whether the graph is wieghted, or unweighted
Traverse the graph nodes and list them using both BFS, and DFS algorithms.
Determine the MST of any input graph, using Prim’s or Kruskal’s algorithm.
Implement Dijkstra’s algorithm to find the shortest path from a given vertex to all
other vertices.
- Implement only one of the following:
• Floyd’s algorithm to find the shortest paths between all pairs of vertices.
• Topological sort algorithm.
Note:
• The Project should show the steps of the implemented algorithms, with respect
to any input data.
• Triangular Representation is a must
• Only allowed includes are:stdlib.h, malloc.h, stdio.h, conio.h, stdio.h & iostream.h
• No use of :: or class (or any Object Oriented implementation)