StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POSupplement code for the "Algorithms in Java, part 5" book (Sedgewick)
primarykey
Id
8548914
data
AcceptedAnswerId
0
AnswerCount
1
ClosedDate
CommentCount
11
CommunityOwnedDate
CreationDate
2011-12-18T00:10:30.523
FavoriteCount
0
LastActivityDate
2012-01-13T22:16:53.453
LastEditDate
2011-12-18T00:26:23.867
LastEditorUserId
562388
OwnerUserId
1009025
ParentId
0
PostTypeId
1
Score
0
ViewCount
368
LastEditorDisplayName
text
Body
We are having an "Advanced Algorithms" curriculum at my college and each of us got an assignment to describe a specific algorithm from the "Algorithms in Java" book. We also have to implement the code from the book (in Java of course) to show how the algorithm works on a concrete example. The classes which we have to use for graphs, nodes, edges etc. are already available in the book, but it seems to me (and to some other students) that the code has a few errors that prevent it to compile. The only implementation I managed to find was this: <a href="http://www.cs.princeton.edu/~rs/Algs3.java5/code.txt" rel="nofollow">http://www.cs.princeton.edu/~rs/Algs3.java5/code.txt</a> But that is the same code from the book, and it doesn't work. The code I'm having problem with is here: <pre><code> GraphSPT(Graph G, int s) { int V = G.V(), N = 0; wt = new double[V]; spt = new Edge[V]; for (int v = 0; v < V; v++) wt[v] = maxWT; intQueue Q = new intQueue(G.E()); wt[s] = 0.0; Q.put(s); Q.put(V); while (!Q.empty()) { int v; while ((v = Q.get()) == V) { if (N++ > V) return; Q.put(V); } AdjList A = G.getAdjList(v); for (Edge e = A.beg(); !A.end(); e = A.nxt()) /* this line is the one with the problem */ { int w = e.other(v); double P = wt[v] + e.wt(); if (P < wt[w]) { wt[w] = P; Q.put(w); spt[w] = e; } } } } </code></pre> I marked the problematic line. AdjList in the line before is an interface, but the getAdjList() method returns an instance of the AdjLinkedList class, which contains implementations of the beg(), end() and nxt() methods. The problem occurs because they return integers, and not instances of the Edge class. If I change the initializer in the for loop to "int e...", then the code inside the loop doesn't work because it calls the other() and wt() methods on the "e" object. Did someone have the same problem maybe, or does anyone know if there are any working code implementations from the book available for download? P.S. Using classes from the book is allowed, I just have to represent graphs with my own code which would not be a problem at all if the classes actually worked :)
Tags
<java><algorithm>
Title
Supplement code for the "Algorithms in Java, part 5" book (Sedgewick)
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USalf
UserOwnerUserId
1. USMatko Smoljan
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.