Visualization of Algorithms


Supervisor : Prof. Yefim Dinitz

Foundations

The Principle of Inclusion & Exclusion (Windows)

Regular Expression to Automata Visual Simulator (Java)

DFA & Turing Machines (Java)

Euler Cycle Algorithm (Java)

Graph GUI Tool in Java (Java)

Course Design of Algorithms

Binomial Heap (Java)

Minimum Spanning Tree Algorithm (Unix)

Dijkstra's Algorithm (Unix)

BFS DFS & SCC (Unix)

Ford-Fulkerson Algorithm (Unix)

Max-Flow Algorithms: Ford-Fulkerson and Dinitz (Unix)

More Advanced Algorithms

Push-Relabel Max-Flow Algorithm (Windows)

Gomory - HU (Unix)

Multi-Terminal Max-Flow Algorithm (Unix)

Others

Assignment Problem (Java)

Subtree Isomorphism (Unix)

Visualisation of Distributed Algorithm (Windows)

Instruction for use at BGU:

(Unix or PC) You enter the directory /home/studies/projects/visproj/bin, choose the subdirectory mentioned and run the exe file mentioned.
For this, your login must be on lead, silver, amber or another Solaris machine.
For some Unix programs, the path /home/studies/projects/cgproj/local/lib must be included into the definition setenv LD_LIBRARY_PATH in the file .tcshrc of your account.

(Java) One way is just to press on the name of the project in this page.
Another way is as follows: You enter the directory /home/studies/projects/visproj/bin and choose the subdirectory mentioned. Then, you run the file mentioned by appletviewer. The recommended computer is a PC.

Instruction for use from outside of BGU:

Enter some project site, from the list above. Download the file and extract it.

 

Using LEDA

In all the projects there is a possibility to add, delete or change nodes and edges in the current graph (in particular, from the examples) or to build a new graph.

More on LEDA

Manual at B.G.U

install at pc

A book by Thimoty Budd

 

NEW (MINI-)PROJECTS

Site Algorithm Vizualization of Supervisor

Lab requirements for project submission