Graph Drawer (Java Applet)
Graph drawer could add vertices and edges to the graph, besides could delete them. It could express bidirectional and costed graphs. Zooming, sorting, transforming and seeing adjacency matrix could also be possible.

Performance & Outcome Comparison of TSP Algorithms
Solves Travelling Salesman Problem with the given algorithms and compares their results.
- Brute Force Approach,
- A Simple Modification Approach,
- Nearest Neighbor Method,
- Twice Around The MST Algorithm

4 renkle Graf Boyama
Hazırlanan çalışmanın içeriği
- Depth First Search ile düğümleri tarama
- Breadth First Search ile düğümleri tarama
- Breadth First - Go Back Search ile 4 renkle boyama

- Homework I
- Homework II
- Homework III

Beycan Kahraman [05.12.2008]