Mathematics, 08.04.2020 00:51 genyjoannerubiera

Your job is to prepare a lineup of n awardees at an award ceremony. You are given a list of m constraints of the form "i wants to receive an award before j." If you violate a constraint, it might upset the affected award recipient (i) and then i may leave the ceremony. Give an algorithm that prepares such a lineup, (or says that it is not possible) in O ( m + n ) time.

Answers: 1

Show answers

Answers

Answer from: milkshakegrande101

The idea is to use the concept of topological sorting.

Complexity of this algorithm is equal to complexity of DFS algorithm, that is, O(m+n).

Step-by-step explanation:

The idea is to use the concept of topological sorting.

A topological sort also called a topological ordering of a directed graph is a linear ordering of its vertices in a way that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. For instance, the vertices of the graph may represent tasks to be performed, and the edges may represent constraints that one task must be performed before another; in this application, a topological ordering is just a valid sequence for the tasks.

A topological sorting is possible if and only if the graph has no directed cycles, that is, if it is a directed acyclic graph (DAG).

For every edge (U - - >V), create a directed edge from U to V.

While creating an edge, if an edge creates a cycle, then it is not possible.

n= number of awardees

m= the number of constraint

Let n represent the vertices of a graph and constraints m is representing edges of a graph.

and graph is represented in adjacent of O(m+n)

Constraint i wants to receive award before j

Graphical representation - - - - - > (i) - - - - - - > (j) j depends on i

1. Presently run topological olding on graph G(n, m) where n is vertices and m is edges.

2. Run DFs on Graph, a temporary stack

3. Firstly call topological sorting for all its adjacent vertices and then push it to a stack. Finally, print content of stack.

4. Vertex is push to stack only when all adjacent vertices are already in stack.

Complexity of this algorithm is equal to complexity of DFS algorithm, that is, O(m+n).

Answer from: Quest

answer: .75 km

step-by-step explanation:

Answer from: Quest

0=6x+2y+10 is equivalent to the simplified form: y= -3x - 5• parallel lines always have the same slope, different y intercept knowing this, we can say the slope, or m of the line parallel to y= -3x - 5 is -3.m= -3 hope this could !
Find the slope of the line parallel to each given line

Find the slope of the line parallel to each given line

Another question on Mathematics

Mathematics, 21.06.2019 20:30

choose the correct definition for extremo. a. end b. extra c. extract d. eventual

Answers: 2

Answer

Mathematics, 21.06.2019 22:00

Let event a = you roll an even number on the first cube.let event b = you roll a 6 on the second cube.are the events independent or dependent? why?

Answers: 1

Answer

Mathematics, 22.06.2019 04:00

What is being done to the variable in the equation 3 + g = -9? the number 3 is being added to it. the number 3 is being subtracted from it. the number -9 is being added to it. the number -9 is being subtracted from it.

Answers: 2

Answer

Mathematics, 22.06.2019 04:50

The random variable x has probability density function f (x) = k(−x²+5x−4) 1 ≤ x ≤ 4 or =0 1 show that k = 2/9 find 2 e(x), 3 the mode of x, 4 the cumulative distribution function f(x) for all x. 5 evaluate p(x ≤ 2.5). 6 deduce the value of the median and comment on the shape of the distribution.

Answers: 3

Answer

You know the right answer?

Your job is to prepare a lineup of n awardees at an award ceremony. You are given a list of m constr...

Questions