E 10 3 9 4 9. 1 F J 7 G H 3 7 1 6. K L 1) What is the lowest cost path to go from vertex A to vertex L? (Your answer should be a comma separated list of vertices starting with A and ending with L which represents the lowest cost path between the vertices. Example: A, Z, S, Q, L) 2) What is the total cost of the lowest cost path to go from vertex A to vertex L? (Your answer should just be a number) 4.

please help me quickly solve it all I need your help nessery please help me

9:17 Today Edit 9:17 AM Given a directed graph G=(V, E), design an algorithm to find out whether there is a route between two nodes, say, u and v. Your design should be based on depth first search and should be given in pseudo code.

max edge distance Simplification key Figure 4-1: A sample process for the Douglas-Peucker algorithm The Douglas-Peucker algorithm is for the selection of representative points to simplify a curve composed of line segments. It uses a point-to-edge distance tolerance. The algorithm starts with a crude simplification that is the single edge joining the first and last vertices of the original polyline. It then computes the perpendicular distance of all intermediate vertices to that edge. The vertex that is furthest away from that edge, and that has a computed distance that is larger than a specified tolerance, will be marked as a key and added to the simplification. This process will recurse for each edge in the current simplification until all vertices of the original polyline are within tolerance of the simplification results. This process is illustrated in Figure 4-1. (1) Given three points (xp, Yp), (Xa, Ya), (Xp,Yb), show a detailed process to compute the perpendicular distance from p…

4. please help me with this Data structure and algorithm

From the textbook NETWORK FLOWS: THEORY, ALGORITHMS, AND APPLICATIONS - Exercise 4.2: Formulate and solve with Python code using a topo-shortest-path algorithm and data below: Beverly owns a vacation home in Cape Cod that she wishes to rent for the period May 1 to August 31. She has solicited a number of bids, each having the following form: the day the rental starts (a rental day starts at 3 P.M.), the day the rental ends (checkout time is noon), and the total amount of the bid (in dollars). Beverly wants to identify a selection of bids that would maximize her total revenue. Find the best bids to accept using python. Data Below: Bid Start End Nights Price 1 1 3 2 581 2 2 6 4 1149 3 2 5 3 844 4 3 8 5 1406 5 4 8 4 1129 6 6 12 6 1701 7 8 12 4 1136 8 8 16 8 2245 9 8 18 10 2829 10 12 16 4 1140 11 12 17 5 1429 12 13 16 3 865 13 15 20 5 1419 14 17 21 4 1120 15 18 20 2 574 16 19 24 5 1401 17 23 30 7 1973 18 25 28 3 866 19 25 29 4 1129 20 27 31 4 1122

Please how do i solve this?

Part 3: Factorial function In computer science, and other fields, we frequently need to know how many possible combinations are possible given a specific number of numbers or characters. For example, consider three color cards: red (R), green (G), and blue (B). How many different orders are possible of these three cards? RGB, RBG, GRB, GBR, BRG, BGR = six (6) possible combinations The mathematical term for this calculation is factorial (see Factorial Function !Links to an external site. web page) and is expressed using the exclamation point (!). Surprisingly, the JavaScript Math object does not have a function for factorial, so we will write our own. So how do we calculate factorial? The steps to accomplish a task are known as an algorithm. An algorithm is a series of steps that given the same input will always produce the same output. Often, many possible algorithms exist to accomplish the same task. To calculate the factorial of a specific number, we need to multiply every number…

The sphere below has a surface Area formula as SA and volume as V. Answer the following question. eter SA = 4a i. Plot a graph of SA vrs r for r=6 to 40 with a change in r as 0.2 ii. Plot a graph of SA vrs r for r=6 to 40 with a change in r as 0.2 iii. Write a c++ code to solve for i. iv. Write a c++ code to solve for ii.

p.658, icon at Example 20 #1. Referring to this Hasse diagram of a partially ordered set, find the following: (a) all upper bounds of {d, e}. (b) the least upper bound of {d, e}. (c) all lower bounds of {a, e, g}. (d) the greatest lower bound of {a, e, g}. (e) greatest lower bound of {b, c, f}. (f) least upper bound of {h, i, j}. (g) greatest lower bound of {g, h}. (h) least upper bound of {f,i}. b h a f d 6.0 g j