- describe the meaning of the graphical conventions used in figure illustrating dfs traversal what do the line thicknesses signifywhat do the arrows signifyhow about dashed linesr- repeat exercise - for figure that illustrates directed dfs traversal - repeat exercise - for figure that illustrates bfs traversal - repeat exercise - for figure illustrating the floyd-warshall algorithm - repeat exercise - for figure that illustrates the topological sorting algorithm - repeat exercise - for figures and illustrating dijkstra' algorithm - repeat exercise - for figures and that illustrate the prim-jarnik algorithm - repeat exercise - for figures through that illustrate kruskal' algorithm - george claims he has fast way to do path compression in partition structurestarting at position he puts into list land starts following parent pointers each time he encounters new positionqhe adds to and updates the parent pointer of each node in to point to ' parent show that george' algorithm runs in ( time on path of length creativity - give python implementation of the remove vertex(vmethod for our adjacency map implementation of section making sure your implementation works for both directed and undirected graphs your method should run in (deg( )time - give python implementation of the remove edge(emethod for our adjacency map implementation of section making sure your implementation works for both directed and undirected graphs your method should run in ( time - suppose we wish to represent an -vertex graph using the edge list structureassuming that we identify the vertices with the integers in the set { describe how to implement the collection to support (log )-time performance for the get edge(uvmethod how are you implementing the method in this casec- let be the spanning tree rooted at the start vertex produced by the depthfirst search of connectedundirected graph argue why every edge of not in goes from vertex in to one of its ancestorsthat isit is back edge