rostam/gtea

Online version of GraphTea

GTea

Welcome to the GTea repository! GTea is the online version of GraphTea, an open-source software designed for high-quality standards and released under the GPL license. It serves as a perfect tool for students, teachers, researchers, game developers, and many more.

GraphTea is available at www.graphtheorysoftware.com. For more details about the source code and issue tracker, please visit our GitHub page.

Architecture

GTea operates on a Java server, which receives requests from the server and passes them to the GraphTea model. The results, which can be a graph, number, or string, are packed into a JSON and sent back to the JavaScript (JS) client. The JS client, which has been completely rewritten, handles the received JSON based on the selected actions.

Publications

Several publications have utilized GTea, which can be found on my website.

Hosting

GTea is temporarily hosted at http://csc.inf-ra.uni-jena.de/server/index.html.

Contributing

Contributions are always welcome! If you have any suggestions or want to contribute to the code, feel free to open an issue or submit a pull request.

License

GTea is open-source and released under the GPL License.

gtea's Issues

Add algorithm for face coloring

Add functionality for creating custom graphs

Allow the user to create/delete vertices/edges

Add algorithm for planarity testing

Chromatic number is never 1

Given a disconnected graph, or just a single vertex graph, it reports the chromatic number as 2, should be 1.

Bipartite algorithm does not work for undirected

Given an undirected algorithm with nodes 0 and 1, with an edge from 0 to 1, it works fine.
But when the edge is from 1 to 0 it says the graph is not bipartite, we tested this in GraphTea as well
and it is also occurs there.

Add algorithm for graph duality