Doxygen is a documentation system for C++, C, Java, Objective-C, Python, IDL (Corba and Microsoft flavors) and to some extent PHP, C#, and D.
Doxygen is developed under Linux and Mac OS X, but is
... [More] set-up to be highly portable. As a result, it runs on most other Unix flavors as well. Furthermore, executables for Windows are available. [Less]
Eclox is a simple doxygen frontend plug-in for eclipse. It aims to provide a slim and sleek integration of the code documentation process into eclipse by providing a high-level graphical user interface over doxygen.
SMC - the State Machine Compiler
SMC takes a state machine stored in a .sm file and generates a State pattern in fourteen programming languages (C, C++, C#, [incr Tcl], Groovy, Java, Lua
... [More], Objective-C, Perl, PHP, Python, Ruby, Scala, VB.net). Includes: default transitions, transition args, transition guards, push/pop transitions and Entry/Exit actions.
See all details on http://smc.sourceforge.net/. [Less]
A Java binding for Grahphviz built on top of the existing SWIG-generated api. This provides a more flexible object-oriented interface to the graph model, and support for rendering the generated graphs using GEF/draw2d.
Welcome to OpenBiomind-GUI: GUI for OpenBiomind!
OpenBiomind-GUI provides a graphical interface to execute the tasks provided by OpenBiomind. It provides wizards for all the tasks provided by
... [More] OpenBiomind. In addition, it also provides wizards that chain multiple tasks together so that they can be executed together. For more details please look at the feature list.
The first version of OpenBiomind-GUI was developed as a Google Summer of Code 2008 project by Bhavesh Sanghvi with Murilo Saraiva de Queiroz (official) and Lúcio de Souza Coelho as mentors. The application has been developed using Java SE 6 and Eclipse 3.4 RCP. [Less]
This is a working tool which can be used to analyze Ant scripts (yes, more than one) to show how targets, taskdefs, macrodefs, and antcalls work together within and across Ant scripts to perform your
... [More] build.
The documentation for the current version and Java WebStart download are found at http://ant-script-visualizer.googlecode.com/svn/trunk/webstart/index.html
ATT's GraphViz is currently needed to generate the final graph (I'm not that smart yet): http://www.graphviz.org/
One of the interesting things about this code is I'm not using the Ant libraries to do this - I get much more flexibility and power parsing the XML myself via JDOM, and it lets me do a lot more of playing around with run-time properties and such.
Although this project works as-is, I've got a long list of features and improvements that need to be made (which I could use help with), and folks have asked to download the source, so open sourcing it is a good option. [Less]
It's a program that tries to explain graph theory algorithms, you design your favorite graph and then you execute some of the(so far) four algorithms, I'm using java, and graphviz for rendering the
... [More] graph, the're somethings I would like someone to help me or suggest me to do. [Less]
VEGAVEGA is both a program for visualizing algorithms, as well as a library of Graph classes that can aid the programmer in the development of their own algorithms.
LibraryThe VEGA library is
... [More] currently under development, but so far has a large set of base classes to work with. The code utilizes the Java Generics framework which allows for compile-time type checking, so as to prevent class cast errors. This is not a requirement for the developer, but is highly recommended.
The code consists of a series of base classes that can be used to construct more complicated structures. All forms of Graphs, whether they be Trees or Networks, extend the base Abstract Graph class, which utilizes the Graph interface also included in the code.
It should be noted that almost every class included in VEGA has a corresponding interface that allows for custom development of classes to meet specific requirements and expectations.
VEGA ApplicationThe VEGA Application is a tool that is meant to help users see how an algorithm or data-structure works by visually representing it using Graphviz. The reasoning behind the development of the application is that it is far easier to understand how something works when one moves beyond abstract mathematical notation and is able to see working demos.
VEGA has been developed such that it is not able to just represent a handful of algorithms and data-structures, but rather any algorithm or data-structure that adheres to some basic conventions. By implementing some basic methods, a user is able to take existing code of an algorithm or data-structure and output the necessary information to VEGA for representation.
Current Algorithms and Data StructuresWe currently have implemented a handful of algorithms and data structures, and more are on the way. As of July 10, 2008, we have the following:
Fibonacci Heaps Red Black Trees Dijkstra's Algorithm 2-OPT (TSP Algorithm) Nearest Neighbor Algorithm Heap sort Binary Search Tree Prim's Algorithm
We anticipate having Thin and Thick heaps implemented by the end of summer 2008. [Less]