A Clojure project that solves the fraud problem.
The solutions is hosted on Heroku. You can see it live by clicking on this link.
-
GET "/"
: Shows the current networks listcurl -X GET "https://powerful-fjord-35264.herokuapp.com/"
-
PUT "/" [collision "node1 node2"]
: Add a new collision to the network listcurl -X PUT -F "collision=100 20" "https://powerful-fjord-35264.herokuapp.com/"
-
GET "/same_network?node1={node_1}&node2={node_2}"
: Shows if the{node_1}
belongs to the same networks that{node_2}
belongscurl -X GET "https://powerful-fjord-35264.herokuapp.com/same_network?node1=13&node2=89"
You can check the actual algorithms complexity on the below list:
- Add new collision: O(n^2)
- Check if two nodes belongs to the same collision: O(n^2)
brew install leiningen
lein run
: Run the web server (Default port: 3000)lein test
: Run unit tests