please answer both of the questions.   7. The Bellman-Ford algorithm for single-source shortest paths on a graph G(V,E) as discussed in class has a running time of O|V |3
, where |V | is the number of vertices in the given graph. However, when the graph is sparse (i.e., |E| << |V |2), then this running time can be improved to O(|V ||E|). Describe how how this can be done..   8. Let G(V,E) be an undirected graph such that each vertex has an even degree. Design an O(|V |+ |E|) time algorithm to direct the edges of G such that, for each vertex, the outdegree is equal to the indegree.    Please give proper explanation and typed answer only.

Q: Recall from lecture that an m × n grid graph has m rows of n vertices, where vertices next to each…

A: In an m × n grid graph, there are m rows of n vertices each. Vertices that are adjacent to each…

Q: Consider the following Digraph to answer the 1, 2 4 s W 3 1 S w 5 G 3 1. Find all possible paths…

A: We need to find all possible paths from the node s to T. Draw the adjacency matrix of the graph.

Q: Given an undirected graph G, and a path P, we want to verify that P is a cycle that contains all…

A: For this problem we need a certificate verifier algorithm to prove polynomial time verification…

Q: Part 2: Random Graphs A tournament T is a complete graph whose edges are all oriented. Given a…

A: Answer is given below-

Q: The reverse of a directed graph G = (V, E) is another directed graph G = (V, E) on the same vertex…

A: The solution is given below in step 2:

Q: = Let G (V, E) be a directed graph. Suppose we have performed a DFS traversal of G, and for each…

A: Proofs for a, b is given below :

Q: Given an undirected graph G=(V,E) with positive edge weights, solve the following problem. Let…

A:

Q: Let G be a simple, undirected unweighted connected graph with n vertices and m edges, where m=…

A: Answer: (A) ------------ You can use Floyd - Warshall algorithm here. The Floyd - Warshall algorithm…

Q: Question 9. Present an algorithm for the following problem. The input is a weighted graph G, two…

A: Check Next step for solution

Q: induced subgraph

A: Given :- In the above question, a statement is mention in the above given question   Need to choose…

Q: In this problem you will design an algorithm that takes as input a directed acyclic graph G two…

A: In this question we have to design algorithm that can determine the number of simple paths from a…

Q: 2. Let G = (V, E) be a directed weighted graph with the vertices         V = {A, B, C, D, E, F) and…

A: Computer graphics is the field of computer science and technology that involves creating,…

Q: algorithm, proof of correctness and runtime analysis for the problem. No code necessary ONLY…

A: Algo: Initialize an empty queue and add s to it. Initialize a set of visited nodes and mark s as…

Q: 4. Run the Bellman-Ford algorithm on the directed graph given blow, using vertex z as the source. In…

A: please see the next steps for solutions.

Q: Suppose are you given an undirected graph G = (V, E) along with three distinct designated vertices…

A: For a path from u to w passing through v, we just need to find paths from u to v and v to w. u -&gt;…

Q: Give an O(V + E)-time algorithm to compute the component graph of a directed graph G = (V, E). Make…

A: Consider a directed graph G=(V,E) and let e be the strongly connected relation. Then we can define a…

Q: Suppose that G is an unconnected graph that consists of 4 connected components. The first component…

A: Euler Graph: A linked graph created by Euler. If there is a closed trail that contains every edge of…

Q: Given an undirected graph G = , a vertex cover is a subset of vertices S  V such that for each edge…

A: A vertex Cover of a graph G is a set of vertices such that each edge in G is incident to at least on…

Q: Let G = (V, E) be an undirected and connected graph, where each edge (u, v) E E has a weight wt(u,…

A: The solution for the above given question is given below:

Q: Let n be an even positive integer. (a) Show that if the degree of every vertex in a simple graph G…

A: Given that, n is an even positive integer. (a) Consider an example of the graph with, n=4 then the…

Q: Problem 1. A walk in a directed graph G = (V, E) from a vertex s to a vertex t, is a sequence of…

A: An algorithm is a set of precise and well-defined instructions that are used to solve a problem or…

Q: (1) T F Given a directed graph G and a vertex v in the graph, breath first search (BFS) can be used…

A: According to bartleby guidelines we are supposed to answer only 1 question, please post rest of…

Q: Show the graph below is non-Hamiltonian. What is the minimum num- ber of edges that one needs to add…

A: In this figure number of vertices is 13(That is ODD).   Hence it is not a Hamiltonian graph.