Questions

1. Write a program in python to create a graph of 7 nodes and 15 edges using adjacency matrix representation. Recreate the graph though edge-list and adjacency-list representations of the graph and visualize the same.

2. What is a Krchardt kite graph? Write a program to create a simple graph with 12 nodes and 20 edges using Krackhardt kite graph() function.

3. Write a Python function to do DFS and BFS tree traversal on your solution graph of Qn 1, to list the traversed edges and visualize the tree traversed.

4. Write Python program and use Djkstra's algorithm to find shortest path between a source and destination and visualize the shortest path.

5. Write a Python program to find Graph diameter on your solution graph of Qn. 1.

Academic reuirements:

•  Edit the submissions in Latex and submit the print outs for evaluation
•  Install Anaconda 2 and program the solutions in Python, Networkx
•  Refer the book ”Social Networks Analysis for Startups” .