j-Algo

j-Algo welcome screen

create a graph


arrange and valuate nodes


perform algorithm as animation or step by step


end of Dijkstras algorithm

welcome screen: choice between loading a file, create a tree manually and create a random tree


create a random tree


overview of a tree in the navigator


algorithm to test if the tree is an AVL tree


rotation step in algorithm to create an AVL tree


algorithm to insert a new node


a balanced tree following Adelson-Velsky and Landis

welcome screen of the module EBNF and syntax diagrams


input of a EBNF definition


executing the 'trans' algorithm


editing syntax diagrams


word generation

welcome screen of module KMP (Knuth Morris Pratt)


executing the algorithm (1)


executing the algorithm (2)