1. Represent graphs, multigraphs, trees, forests, weighted graphs, directed graphs, and weighted directed graphs. This means accepting input and output.

2. Search for shortest path from any vertex a to another vertex b in any of the above.

3. Find a minimal spanning tree in a weighted graph.

4. Find a spanning tree in a graph.

I'll be adding to this later on. Please enumerate everything you say, continuing off of mine. In other words, the next person should start with 5.

]]>Does anyone have an objections to this project?

]]>HOWEVER, while flash is great at animations and user presentation, it is painfully slow as a programming language (orders of magnitude slower than C++).

]]>Besides, C++ can be cross platform aswell if we use GLUT.

]]>Any thing I can do I will, I'm basically on the same boat as mikau on this one.

]]>