This is how the tool currently looks like (if you don't see it, click here):
We still haven't had time to continue this, but it would be nice to do so. If you are interested in continuing this or you have made improvements to the code, contact us to get permissions to commit changes to TopFat repository in Google code.
Sunday, December 11, 2011
Wednesday, January 12, 2011
Developers wanted! Project adrift.
Hi!
As you can notice, we haven't had any time to continue this project. If you are interested in taking control of the project or continuing it in any way, send us email.
Cheers!
As you can notice, we haven't had any time to continue this project. If you are interested in taking control of the project or continuing it in any way, send us email.
Cheers!
Tuesday, December 15, 2009
About the schedule
As many other amateur projects, this doesn't have a strict schedule. We do things when we have time and will (probably never). Valve time is a good guideline for the work progress. Anyway this is quite nice project to work on, since the results can be seen fast and it's easy add small features to the software. This could also be branched into different directions. The applet base could be used to create a rpg game or a tile map editor. It would be nice to have more time.
I'm working on a new graph implementation. Could have used some open source graph but somehow decided to create a new. Graph will have Graph, Edge and Node classes. Node will have a location(Point) and a list of all neighbors(Node). Edge has two Nodes and a weight value. Graph has a list of all Nodes and Edges.
Quite simple but I have some problems I need to solve. Algorithms will probably extend the Node class to add new attributes. For example if NewNode extends Node, neighbors should be also NewNodes and not just Nodes. This is a small problem I've had lately. I want to make this clean and don't just know yet how it should be done. I implemented it already with generics but it's a bit messy.
Anyway, it will be ready "Shortly".
Update: Or then we just end the development here. :)
Arttu
I'm working on a new graph implementation. Could have used some open source graph but somehow decided to create a new. Graph will have Graph, Edge and Node classes. Node will have a location(Point) and a list of all neighbors(Node). Edge has two Nodes and a weight value. Graph has a list of all Nodes and Edges.
Quite simple but I have some problems I need to solve. Algorithms will probably extend the Node class to add new attributes. For example if NewNode extends Node, neighbors should be also NewNodes and not just Nodes. This is a small problem I've had lately. I want to make this clean and don't just know yet how it should be done. I implemented it already with generics but it's a bit messy.
Anyway, it will be ready "Shortly".
Update: Or then we just end the development here. :)
Arttu
Thursday, December 3, 2009
First post
Hi,
This blog is all about development of Tool for Path Finding Algorithm Tester (or ToPFAT). We'll (hopefully) post here some images of the software and descripe new features. Depending if there will be any new features in the future.
ToPFAT is open source and published under GNU Genral Public License V3.
Here you can find the project source code, and the applet can be tested here or here.
Here is a screenshot of the current software:
That's all, we'll see if the project has any future. :)
Arttu Viljakainen,
Teemu Turunen
This blog is all about development of Tool for Path Finding Algorithm Tester (or ToPFAT). We'll (hopefully) post here some images of the software and descripe new features. Depending if there will be any new features in the future.
ToPFAT is open source and published under GNU Genral Public License V3.
Here you can find the project source code, and the applet can be tested here or here.
Here is a screenshot of the current software:
That's all, we'll see if the project has any future. :)
Arttu Viljakainen,
Teemu Turunen
Subscribe to:
Posts (Atom)