A variant of Dijkstra's Algorithm, Directing-Crowd method, creates a directed graph, which shows the path from any node to the exit point. Thus this method works for multi-source or single-source-unique-destination problems. Its called the "Directing-Crowd" method as every node in the graph, after parsing, points to its next node which takes us one step closer to the exit point, no matter where we start from (here, we start from 'E' point). This method is exactly like you are searching for a person in the crowd and every guy in the crowd points you towards that guy who is one step closer to the person you are looking for.

fcm-push

A Node.JS simple interface to Firebase Cloud Messaging (FCM) for Android & iOS

flexible.snake

google-plus-hangout-samples

Automatically exported from code.google.com/p/google-plus-hangout-samples

gpsinterface

A generic plug and play TCP server which can translate data coming from GPS devices and send them to your application server.

gsm-shield-arduino

Automatically exported from code.google.com/p/gsm-shield-arduino

hackathon-starter

A boilerplate for Node.js web applications

indian-currency-detection

java-plugin-project

fancies a plugin loader

list.sort

List Sort is a new kind of algorithm which uses multiple dynamic linked lists to sort the given data in a sequence.

nodebootstrap

A simple, all equipped and ready to takeoff Nodejs code repo. Based on Expressjs and offers an out of box code for using mongo, sql and redis with your code. Just clone this