Thuật toán Algorithms (Phần 43)

... directed edges for each edge in the undirected graph. Thus, some of algorithms in this chapter can be considered generalizations of algorithms in previous chapters. Depth-First Search The depth-first ... characteristic, then the geometric algorithms of the previous section may be appropriate, but if interconnections between objects are of fundamental importance, then the graph algorith...

Ngày tải lên: 07/11/2013, 18:15

... could reasonably occur in many applications, but sophisticated algorithms are not necessary if all queries are of this type. The algorithms that we consider are designed to be efficient for queries

Ngày tải lên: 17/10/2013, 22:15

... determining whether any two out of a set of N objects intersect in time proportional to N log N, based on algorithms presented by M. Shamos and D. Hoey in a seminal paper in 1976. First, we’ll consider ... line endpoints (the reader should now be accustomed to encountering such difficulties in geometric algorithms) . To trace through the operation of our algorithm on our set of sample poin...

Ngày tải lên: 20/10/2013, 16:15

... of recursive procedures operat- ing on the x and y coordinates is quite important in geometric algorithms. Another example of this is the 2D tree algorithm of the previous chapter, and we’ll

Ngày tải lên: 20/10/2013, 16:15

... diagram and its dual have many properties that lead to efficient algorithms for closest-point problems. The property that makes these algorithms efficient is the number of lines in both the diagram ... or mathematical algorithms. Many of the problems and solutions that we’ve discussed were presented by M. Shamos in 1975. Shamos’ manuscript treats a large number of geometric algorithms,...

Ngày tải lên: 24/10/2013, 14:15

... trivial graph algorithms lead to interesting computer programs, and the nontrivial algorithms that we’ll examine are among the most elegant and interesting (though difficult to understand) algorithms ... the algorithms easy to follow, our examples will use one-letter vertex names, with the ith letter of the alphabet corresponding to the integer i. Thus, though name and index ELEMENTAR...

Ngày tải lên: 24/10/2013, 14:15

... family of algorithms for this problem. The problem is sometimes called the “union-find” problem, a nomenclature which comes from the application of the algorithms 389 ELEMENTARY GRAPH ALGORITHMS ... of graph algorithms. Many interesting and useful algorithms have been developed which are beyond the scope of this book, and many interesting problems have been studied for which good al...

Ngày tải lên: 28/10/2013, 21:15

... processed. As usual, we are assuming CONNECTMTY Graph Traversal Algorithms Depth-first search is a member of a family of graph traversal algorithms that are quite natural when viewed nonrecursively. ... structure for graph algorithms is a priority queue, and this admits a wealth of interesting properties to consider. Again, we’ll see more examples in the next chapter. Union-Find Algori...

Ngày tải lên: 28/10/2013, 21:15

... analysis of union-find algorithms is extremely complex and intricate. This can be seen even from the nature of the results, which do give us clear indications of how the algorithms will perform ... weights change the nature of the problem in an essential way, and require far more sophisticated algorithms than those considered here. For an example of the type of difficulty that can arise...

Ngày tải lên: 07/11/2013, 18:15

... the vertices might represent terms to be defined in a programming language manual (or a book on algorithms! ) with an edge from x to y if the definition of x uses y. In this case, it would be useful ... example dag given in this chapter. 2. What would be the result of running the transitive closure algorithms on an undirected graph which is represented with an adjacency matrix? 3. Write a...

Ngày tải lên: 07/11/2013, 18:15