|
|||||||||
| home | hometown | racing |recent |resume |schedule |photos |
|
||||||||
|
|
|
|
|||||||
|
|
|
p r o j e c t w e b s i t e
|
|
|
Programming Project in Java: Our goal was to make a autonomous maze mapping robot. My job was to take data and construct, store, and send data from the robot and then out to a client. The client would then graphically display the maze (graph). DrawLandmark.java will take
a graphics g, int landmark symbol, and two int coordinates, then
draw the corresponding symbol at the given point. Edge.java constructs
and maintains an edge in a graph (Graph G) for the graph applet.
This Class idea was obtained from the website at http://www.cs.strath.ac.uk/teaching Vertex
1 and 2 are the nodes that the edge will connect. Graph.java This
class is the core class for the graph applet. This class contains
the bfs search as well as the add vertices and edges methods. GraphTab.java TESTER
FOR GRAPH TAB: The real one dosent use string, thread, or any
listeners. Graph Tab is a client side panel tab that displays
a graph. The graph is onstructed from landmark data from the
server. LinePoint.java Is a point
on a plane. Handy to make an address object on a graph. RobotGraph.java This method
creates a graph that has corners of 90 degrees. The input will
be a scenero (landmark) and the address of the particular event
(x, y). RobotGraphTester.java is to
test RobotGraph. Will construct it and report it. Vertex.java class constructs and maintains
a vertex in a [ b a c k to t o p ]
|
|
|
||
|
|
|
|
|||||||
|
|
|
||||||||
|
|
|
© Copyright 2001 William L. Martin All rights reserved. |
|
||||||