[java] Java Tutorials

Take a look at www.informit.com they offer on-line books for free (some java game programming). Also, try http://www.bruceeckel.com/ for Thinking in Java online (a very good reference).

/* Simple examples of advanced topics */
http://adams.patriot.net/~tvalesky/java.html

/* Dick Baldwin''s Tutorials */ <-- very good
http://www.geocities.com/Athens/7077/scoop/onjava.html

/* Java data structures */
http://www.geocities.com/SiliconValley/Way/7650/javadata2.html

I''ve also done a small datastructures doc that can be downloaded from:
http://www.gamedev.net/hosted/javanerd/downloads.asp
click on the Few Basic Datastructures in Java

It has some nice and informative pictures to explain the operations and their effect on objects. It''s actually a translation of a course paper I ran into on one of my college courses (done with permission from the original authors).

Hey javanerd, I downloaded that page and it was informative in the aspect of data structures. Where it left off, and where I thought it could use a little bit more, was in the area of implementation. It would have been a truly excellent work if you would have added common uses for each of the data structures. Telling me where you personally have used a FIFO stack, would have made me want to go and try the same thing or something similar with one. I understand how one works now, but still not quite sure where to use one. And I know that is heavily dependant on personal preferences and the type of program but... I still feel that I am as far away from implementing a good data structure in an actual program as before i read the article.

quote:

---

Original post by Jim_Ross
Hey javanerd, I downloaded that page and it was informative in the aspect of data structures. Where it left off, and where I thought it could use a little bit more, was in the area of implementation. It would have been a truly excellent work if you would have added common uses for each of the data structures. Telling me where you personally have used a FIFO stack, would have made me want to go and try the same thing or something similar with one. I understand how one works now, but still not quite sure where to use one. And I know that is heavily dependant on personal preferences and the type of program but... I still feel that I am as far away from implementing a good data structure in an actual program as before i read the article.

---

Does anyone have a good answer to this guys question?

BeS
It''s Da BOMB Baby!!!
. o O ~
A little nonsense now and then,
is relished by the wisest men
~ O o .
-- Willy Wonka

A FIFO queue (calling it a stack implies LIFO semantics) is used whenever you want to queue items. That is a bit of a stupid answer, so I''ll give you some more examples.

A classic example is the breadth-first search. Sometimes you want to take graph structure, and search outward from a given node, until a target node is found. Using a breadth-first search guarantees finding a path with the shortest number of steps. I don''t feel like going into implementation details at the moment, but the basic idea is to queue nodes that haven''t been visited yet.

quote:

---

Original post by c_wraith
A FIFO queue (calling it a stack implies LIFO semantics) is used whenever you want to queue items. That is a bit of a stupid answer, so I''ll give you some more examples.

A classic example is the breadth-first search. Sometimes you want to take graph structure, and search outward from a given node, until a target node is found. Using a breadth-first search guarantees finding a path with the shortest number of steps. I don''t feel like going into implementation details at the moment, but the basic idea is to queue nodes that haven''t been visited yet.

---

SO, this might be a good implementation to use in maze solving? If I''m right I guess I AM starting to understand this stuff a bit better.

BeS
It''s Da BOMB Baby!!!
. o O ~
A little nonsense now and then,
is relished by the wisest men
~ O o .
-- Willy Wonka