googmeister's articles:

Items(2) /1

Why no Polygon2D.Double class? 2 27 (1/5/2006 6:47:35 PM) comp.lang.java.programmer There are java.awt classes for Line2D.Double, Ellipse2D.Double, CubicCurve2D.Double, etc., but I didn't find an analogous one for polygons. Is there a good substitute? Thanks. ... Googmeister

Whay aren't Strings Iterable? 13 37 (10/9/2005 12:55:33 PM) comp.lang.java.programmer Anyone know why String in Java 1.5 does not implement the Iterable interface? It seems reasonable to write String text = "Hello, World"; for (char c : text) { // do something with c } and ... Googmeister

googmeister's replies:

Items(148) /15 Next >> Last >|

Big-O notation, multiple variables 13 58 (6/19/2007 4:04:56 PM) comp.theory I'm looking for pointers to any discussion in the literature regarding the pitfalls involved in extending Big-O notation to multiple variables. It's been hard enough just to find a formal definition, as most ... rhowell (9)

Finding longest path between two vertices 17 24 (6/13/2007 9:51:42 PM) comp.theory Hi, I have a directed graph with weighted edges (weights are all positive). Now, I'm looking for an efficient algorithm to find the longest path between two given vertices. My idea was to negate all edge we... plfriko (499)

A question about Mergesort 4 20 (6/2/2007 9:42:13 AM) comp.theory We know Mergesort can be solved in O(nlogn), but we need 2*N space to change the subjects. So can we limits the space to 1*N+C?Or eqivalently can we merge sort without an extra array? ... contact.qdeng (3)

Fibonacci heap and Dijkstra's algorithm 13 21 (4/27/2007 2:26:14 AM) comp.theory I have a question regarding the performance of the Dijkstra's algorithm using different heap implementations. Suppose that the size of the graphs is around 50 nodes to 250 nodes, number of edges is around 50 t... peter.vanna (3)

Kruskal and Prim with negative and positive weigths (proof) 2 23 (4/2/2007 9:12:02 AM) comp.theory I need help because I don't manage to demostrate if Prim and Kruskal algorithms work also in case of positive and NEGATIVE weigths. Tanks ... simone.dicola (2)

A cycle with minimum length 2 20 (3/30/2007 6:22:10 PM) comp.theory Hello everyone! We have n points in a chart that none of them have the same length(I mean their 'x' parameter). We want to find a cycle with MINIMUM length with these assumptions : We start from the point with ... mahdi.dabestani (9)

Efficient algorithm? 2 27 (3/19/2007 2:12:51 AM) comp.theory Given an unlimited supply of coins of denominations x1; x2; : : : ; xn, we wish to make change for a value v using at most k coins; that is, we wish to find a set of k coins whose total value is v. This might n... virtualrealtor (6)

time cost to solve TSP is much less than N! 3 28 (3/7/2007 2:37:57 PM) comp.theory In general, we say the time cost to search TSP solution is N! But actually it can be far smaller. Suppose we are going to search all possible permutations of N points. we will search on 1234..... (with all p... lingwanjae (6)

Colored Trees 8 27 (2/10/2007 1:33:33 PM) comp.programming Hi, Just eager to know... Is there any specific reason behind the names 'Red' , 'Black' Trees ? Thx in advans, Karthik Balaguru ... karthik.balaguru (228)

hey help in solving the following recurrence... 6 51 (1/29/2007 2:13:32 AM) comp.programming hi can yu hep me solve the following recurrence, T(n)=T(n-1)+lgn T(2) and T(1) are constants... thnks all, ... sarahsmith11 (3)