Uses Dijkstra's shortest path algorithm to compute the shortest time taking path from any node to node node in a network. Also takes care of the node ups, node downs, edge ups and edge downs
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
This application calculates the best possible location for a business establishment from a list of preferred locations using various factors like customers, competitors, distance to other locations, etc. It computes that location by using a heuristic function on a set of data collected from various data sources that are in the decision making process.
Picking image from Image gallery in Android
Sharing screen in LAN
Public repository.