Skip to content

Commit

Permalink
Browse files Browse the repository at this point in the history
This the latest progress we made on this branch. Need to apply A star…
… to find optimal path. Some errors in path generation.
  • Loading branch information
rjm11010 committed May 3, 2018
1 parent 18ea654 commit 4617d1c
Show file tree
Hide file tree
Showing 18 changed files with 395 additions and 2,774 deletions.
349 changes: 0 additions & 349 deletions AbstractNode.java

This file was deleted.

21 changes: 21 additions & 0 deletions Newpath.pde
@@ -0,0 +1,21 @@
class NewPath {

// A Path is an arraylist of points (PVector objects)
ArrayList<ArrayList<PVector>> Points;
ArrayList<PVector>Layer;
ArrayList<PVector>points;
// A path has a radius, i.e how far is it ok for the boid to wander off
//float radius;

NewPath()
{
// Arbitrary radius of 30
//radius = 30;
Points = new ArrayList<ArrayList<PVector>>();
//Layer=new ArrayList<PVector>();
points=new ArrayList<PVector>();
}

//Leave for meshinh the track for A* algorithm to be apllied.

}

0 comments on commit 4617d1c

Please sign in to comment.