in python please

Design data structures: present five data structures including B-tree for a very large social network , to show the shortest path and Minimum Spanning Trees between two people (e.g., Me Ameerah Fatimah Amal You). You can also make an application like Google Maps. In this project, you will implement and analyze the following. - The Dijkstra's shortest path algorithm, Bellman-Ford Algorithm, Floyd-Warshall Algorithm, and Johnson's Algorithm, or BFS, DFS, Best FS, A* Search, and bidirectional breadth-first search, or Prim's minimum spanning tree algorithm, Kruskal's Algorithm and Boruvka's Algorithm. Assume your data structure (i.e., adjacency list) represents the input graphs. Implement the data structures and compare them in terms of time complexity