Initial commit
first commit
Dijkstra code

Working code to output the nodes to be traversed by the Boebot, from given source node to destination node in an indoor environment using shortest path [Dijkstra shortest path algorithm]
types.h

Header file for node plan containing node costs and direction, map for storing routes to be given to the boebot.
heap.h

Header file for implementation of MinHeap for priority queue.
Create main_april11.cpp

New Dijkstra : consists of predecessors only in the route map. The route map is converted to a map <size_t,size_t>. Algorithm for binary heap is changed to a working version.
node.cpp

Code that runs on each of the stationary zigbee nodes. It listens to the boebot and responds with its ID as acknowledgment only when the Boebot sends a 'P' (Ping signal) along with the nodeID it is searching for. It stops sending acknowledgment when the Boebot receives the acknowledgment and sense out 'S' (Stop signal).
The code for boebot that detects the nodes using peak detection of the signal and that traces a path through a set of fixed nodes
Merge http://github.com/sairahussain/CIS542-Project
Update types.h
Dijkstra with changed decreaseCost and Extract Min
Create Dijkstra_14April

Dijkstra with modified DecreaseCost and ExtractMin
nivedita's commit- april 15
test
Merge pull request #1 from sairahussain/nvel

test
renamed files
Various comments on the code. Please try to address these. Feel free to come ask questions.
Working version of Indoor Navigator
Addition of class Steer in main.cpp
Merge branch 'master' of https://github.com/sairahussain/CIS542-Project