other Programming and Technical Category

All algorithms discussed in this chapter for determining the minimum spanning tree

have one thing in common:
they start building the tree from the beginning and they add new edges to the structure, which eventually becomes such a tree. However, we can go in the opposite direction and build this tree by successively removing edges to break cycles in the graph until no circuit is left. In this way, the graph turns into the tree. The edges chosen for removal should be the edges of maximum weight among those that can break any cycle in the tree (for example, Dijkstra’s method). This algorithm somewhat resembles the Kruskal method, but because it works in the opposite direction, it can be called a Kruskal method à rebours. Use this approach to find the minimum spanning tree for the graph of distances between at least a dozen cities

Read Solution (Total 1)

other Other Question
Consider three classes A, B and C with 20, 30 and 50 students respectively. The averages score in maths of students in class B is 16 more than that of those in class C and the average score of those in class A is 2 more than the overall average of scores in A, B and C. What is the difference between average of class C and class A? From horizontal ground a projectile is shot at an initial speed of v=150 m/s and at an angle of 60 degrees after time t=10 s. The projectile explodes and breaks up into two pieces of masses m and 2 m at the moment delta t=10 s. After the explosion the piece of mass m hits the ground at a distance of d=500 m behind the place of shooting in the plane of the trajectory of the unexploded projectile . At this instant how far is the other piece of mass 2 m from the cannon.