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

... 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

... 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

... generalize directly to more than two dimen- sions: simple, straightforward extensions to the above algorithms immediately yield range-searching methods which work for more than two dimensions. However, ... space dictates that some caution is called for and that the performance characteristics of the algorithms might be difficult to predict for a particular application. To implement the gr...

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 ... fundamental algorithms. As with so many of the problem domains that we’ve studied, graphs have only recently begun to be examined from an algorithmic point of view. Although some of t...

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

... 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 algorithms ... follow we’ll consider a variety of graph algorithms largely aimed at determining connectivity properties of both undirected and directed graphs. These algorithms are fundamental ones for...

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

... 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 Algorithms In some ... to point to the roo...

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

... that might appear in practice. For this reason, algorithms which do well in the worst case are normally preferred for union-find (and other graph algorithms) , though this may be an overly approach. CONNECTMTY 405 Even ... 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...

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

... 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

... 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

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