# Hash table example in c

The following C project contains the C source code and C examples used for hash table example. This code is a class structure and main driver program
that's an example of using a hash table.

The following C project contains the C source code and C examples used for graph (dfs,bfs). Representation of Graph using Linked List and Traversal of Graph using DFS and BFS :)
** Happy Hacking**
Editor : VIM
Compiled using: GCC 4.5.1

The following C project contains the C source code and C examples used for graph (data structure - bfs , prims , topological). ~ graph - bfs , prims , topological sorting ~

The following C project contains the C source code and C examples used for bst - binary search tree. Binary Search Tree - with additional recursion functions (smallest, parent & successor) etc.

The following C project contains the C source code and C examples used for binary search tree with mouse. this code not only show you Binary Search Tree, but also asm code for move your mouse!, try it ^^

The following C project contains the C source code and C examples used for binary search tree. implements a binary search tree

The following C project contains the C source code and C examples used for a hashtable template class. This is the template hashtable class used in my Scripting language. It includes a stack to handle scope issues. Please look it over and vote

The following C project contains the C source code and C examples used for a binary search tree in c. This is a BST with recursion functions.

The following C project contains the C source code and C examples used for binary search programs. it will help you in searching a file, using binary algorithm.

The following C project contains the C source code and C examples used for binary search tree. used for sorting,tree traversals

The following C project contains the C source code and C examples used for Linear Hashing Example. Demonstrate how linear hashing works by allowing users to insert elements into an empty hash table and see how it grows (hash table is re-displayed after every insert).

The following C project contains the C source code and C examples used for searching by binary search technique. searching number by binary search technique

The following C project contains the C source code and C examples used for address book (dictionary adt) with hashing. This code is an example implementation of the standard Dictionary ADT. It is implemented as an Address book that uses hashing(instead of a basic sequential search) so that add, search, and delete should run with a Big-O value of O(1) or at least close to it!

The following java project contains the java source code and java examples used for dijkstra algorithm. This program implements Dijkstra's algorithm, a well known algorithm to solve the single-source shortest paths problem

The following java project contains the java source code and java examples used for java general purpose hash function algorithms. The General Hash Function Algorithm library contains implementations for a series of commonly used additive and rotative string hashing algorithm in the Java programming language.
For more information please visit: http://www.partow.net/programming/hashfunctions/index.html

The following java project contains the java source code and java examples used for tic tac toe using min max alpha beta pruning. Unbeatable Tic Tac Toe without GUI
Clean code Using Game Tree Min Max Alpha Beta Pruning!
It was my AI assignment. Had a hard time finding good help or code on the net. So this is form me. Injoy!

The following Matlab project contains the source code and Matlab examples used for dijkstra algorithm consistent with cyclic paths.
Given adjacent matrix (transmat) and starting/ending node (pathS, pathE), this function finds the shortest-path (path) that connecting pathS and pathE, and returns the cost (cost):
[path, cost]=dijkstra(pathS, pathE, transmat);
NOTE: Except for the simple interface, the pathS and pathE can be the same node, i.

The following Matlab project contains the source code and Matlab examples used for hill climbing optimization.
It is a hill climbing optimization algorithm for finding the minimum of a fitness function
in the real space.

The following Matlab project contains the source code and Matlab examples used for dijkstra's shortest path algorithm.
This function can
1.

The following Matlab project contains the source code and Matlab examples used for use a hash table.
Class Hashtable offers Matlab users access to the hash table data structure.

The following Matlab project contains the source code and Matlab examples used for a* (a star) search for path planning tutorial.
The A* search algorithm is a simple and effective technique that can be used to compute the shortest path to a target location. This tutorial presents a detailed description of the algorithm and an interactive demo.

The following Matlab project contains the source code and Matlab examples used for hash table declaration.
H = hash;
H('key') = value; %assign value to key
v = H('key'); % retrieve value for a key
H.

The following Matlab project contains the source code and Matlab examples used for find all the possible paths between a start and an end node of a graph.
In Graph Theory it is often required to find out all the possible paths, which can exist between a source node and a sink node.

The following Matlab project contains the source code and Matlab examples used for string2hash.
This function generates a hash value from a text string
hash=string2hash(str,type);
inputs,
str : The text string, or array with text strings.

The following Matlab project contains the source code and Matlab examples used for dijkstra algorithm .
it finds the shortest path from the given network having given no of links between given no of nodes and plots the given network as well as the modified network having shortest path in terms of cost

The following Matlab project contains the source code and Matlab examples used for pathfinder v2.
A shortest path algorithm (based on Dijkstra's algorithm) with obstacle avoidance; the agent (robot) is represented as a single point, but the dimensions of the obstacles are inflated to account for the external dimensions of the agent.

The following Matlab project contains the source code and Matlab examples used for breath first search .
This implementation of BFS algorithm follows the description in the book "Network: an Introduction - Newman"
Inputs:
- A: the adjacency matrix of the network
- s: starting node
- t: destination node
Outputs:
- shortest_paths: all shortest paths from s to t
- distance: vector containing distances from s to all other nodes.

The following Matlab project contains the source code and Matlab examples used for fast binary search.
** Description :
mex function that performs the binary search algorithm to find "item(s)"
(the values to be searched for) in some pre-sorted "data" vector.

The following Matlab project contains the source code and Matlab examples used for multiple rapidly exploring random tree (rrt).
% See Usage section in RrtPlanner.

The following Matlab project contains the source code and Matlab examples used for an implementation of a star search algorithm for grid search.
A Star search algorithm is used for finding optimized path from a start to goal state.