This is an Open Source Project that aims at making it convenient for friends to match their schedule and discover new places to hang out near SKKU.
We noticed that it was visually difficult for a bunch of friends to conveniently compare their schedules and meet at a specific time and location. Moreover, friends tend to go to the same places and have trouble in discovering new places to hang out. Our web page solves both of these issues as we use the timetable function of Everytime, wide-used college mobile, to display and compare the time available with the friend you want and we use the Naver Map API to help you discover new places around SKKU.
- Instructions and Navigation
- Dependencies
- Example
- Release
- Works
- License
- Our code is written in Javascript, and developed in Node.js environment.
- Our code use Selenium Web Driber, If you run the sever, install Selenium (Download the Selenium Driber
chromedriver_linux64(or window or Mac).zip
from here and put it in - Our program also uses the Naver Map API, so if you want to use it on local you must create a Naver Cloud Account and register your localhost url to the Naver Map API.
expressjs / cors: "~> 2.8.5",
mde / ejs: "~> 3.1.8",
xpressjs / express: "~> 4.18.2",
node: "~> 5.5.0", file: "package.json",
tttro/node-html-parser: "~> 5.5.0",
SeleniumHQ/Selenium: "~> 4.6.1",
- Main page
Login to Everytime by Let's Meet. - Time table When logged in, choose friends to overlap timetables.
- Map Choose categories and select where to go.
- Demo video
youtube
Version | Key features | OS required |
---|---|---|
v.1.0.0 | Crawling Everytime timetable data / Using Naver Map ap | Chrome browser |
- Kim Dong Hyun: Frontend developer / Web designer
- Construct out design of Web pages
- Collect Naver map api data
- Design the thumbnail
- Park Jin suk: Product manager
- Plan web service
- Apply Naver map api
- Manage/Control Git repository
- Park Jongeun: Back-End
- Construct timetable and do Crawling
- Maintain sever
- Mangage Dependencies
Hangout follow MIT lICESNSE and is freely available for free and may be redistributed under unlimited conditions