Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up

A Clojure project that solves the fraud problem

NotificationsYou must be signed in to change notification settings

vrcmarcos/collision

Repository files navigation

Build StatusCoverage Status

AClojure project that solves thefraud problem.

WebServer

The solutions is hosted on Heroku. You can see it live by clickingon this link.

Endpoints

  • GET "/": Shows the current networks list

     curl -X GET"https://powerful-fjord-35264.herokuapp.com/"
  • PUT "/" [collision "node1 node2"]: Add a new collision to the network list

     curl -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} belongs

     curl -X GET"https://powerful-fjord-35264.herokuapp.com/same_network?node1=13&node2=89"

Algorithm Complexity

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)

Environment setup

MacOS

brew install leiningen

Running

  • lein run: Run the web server (Default port: 3000)
  • lein test: Run unit tests

Frameworks/Libraries used:

About

A Clojure project that solves the fraud problem

Topics

Resources

Stars

Watchers

Forks

Packages

No packages published

[8]ページ先頭

©2009-2025 Movatter.jp