# Searching Algorithms in C++

###

String Searching Applet

This is a very good applet which allows you to enter a string and a pattern to find in that string
and then use either the KNP or the Boyer-Moore method to look in the string for the pattern. Uses
nice graphics to further get the methods used across

BFS Applet
One

This is an ok applet which uses nice graphics to show how the BFS algorithm goes through a tree.
Uses predefined data.

DFS Applet
One

This is an ok applet which uses nice graphics to show how the DFS algorithm goes through a tree.
Uses predefined data.

Multiple Applet (with Tree Searching)

This applet is good and allows you to choose several tree searching applets, along with a written
explination / help for each one. Also includes Height Balancing, Heap Sort, Priority Queues and
tree tranversals

DFS Applet Two

This is an auto-running applet which simply shows how to go from a start node to an ending
node using the DFS Algorithm

BFS Applet Two

This is an auto-running applet which simply shows how to go from a start node to an ending
node using the BFS Algorithm

Go back to main
page