CS225-Final-Project
所属分类：图形图像处理
开发工具：C++
文件大小：776KB
下载次数：0
上传日期：2020-12-29 01:16:04
上 传 者：
sh-1993
说明： CS 225的最终项目-实现DFS、dijkstra和介数中心性图算法
(Final Project for CS 225 - implements DFS, dijkstra, and betweenness centrality graph algorithms)
文件列表:
DEVELOPMENT (0, 2020-12-11)
DEVELOPMENT\DEVELOPMENT.pdf (38918, 2020-12-11)
GOALS (0, 2020-12-11)
GOALS\GOALS.pdf (31726, 2020-12-11)
Makefile (959, 2020-12-11)
RESULTS (0, 2020-12-11)
RESULTS\RESULTS.pdf (71004, 2020-12-11)
Team Contracts (0, 2020-12-11)
Team Contracts\CONTRACT_bowenx2.pdf (33142, 2020-12-11)
Team Contracts\CONTRACT_ncsmith2.pdf (33142, 2020-12-11)
Team Contracts\CONTRACT_przybek2.pdf (33142, 2020-12-11)
Team Contracts\CONTRACT_vijayg2.pdf (33142, 2020-12-11)
cs225 (0, 2020-12-11)
cs225\HSLAPixel.cpp (1991, 2020-12-11)
cs225\HSLAPixel.d (77, 2020-12-11)
cs225\HSLAPixel.h (2141, 2020-12-11)
cs225\HSLAPixel.o (84704, 2020-12-11)
cs225\PNG.cpp (6376, 2020-12-11)
cs225\PNG.d (179, 2020-12-11)
cs225\PNG.h (4403, 2020-12-11)
cs225\PNG.o (137328, 2020-12-11)
cs225\RGB_HSL.h (2581, 2020-12-11)
cs225\catch (0, 2020-12-11)
cs225\catch\catch.hpp (473528, 2020-12-11)
cs225\catch\catchmain.cpp (46, 2020-12-11)
cs225\lodepng (0, 2020-12-11)
cs225\lodepng\lodepng.cpp (240229, 2020-12-11)
cs225\lodepng\lodepng.d (105, 2020-12-11)
cs225\lodepng\lodepng.h (90285, 2020-12-11)
cs225\lodepng\lodepng.o (456480, 2020-12-11)
cs225\make (0, 2020-12-11)
cs225\make\cs225.mk (3746, 2020-12-11)
edge.h (2516, 2020-12-11)
graph.cpp (18654, 2020-12-11)
graph.h (9636, 2020-12-11)
main.cpp (2258, 2020-12-11)
readFromFile.cpp (611, 2020-12-11)
... ...
# CS 225 Final Project
## Team Members: Bowen Xiao, Richard Przybek, Nathen Smith, Vijay Gopalakrishnan
Video Link: https://youtu.be/nLu06McBBhw
Traversal: DFS
Covered Algorithms: Dijkstras Algorithm
Complex/Uncovered Algorithms: Betweenness Centrality
Dataset: http://snap.stanford.edu/data/ego-Twitter.html
## Instructions
Download _twitter.tar.gz_ from http://snap.stanford.edu/data/ego-Twitter.html
Extract contents and place all files into a folder called _sample_dataset_ in the project directory
* Folder _sample_dataset_ should have various .circles, .edges, .egofeat, .feat, & .featnames files
Build the project and test cases using _make_ and _make test_
Run the project using the following command: _./finalproj [egoNode] [dfs, dijkstra, centrality] [source] [destination (ONLY for dijkstra)]_
* [egoNode]: The number in the file name (Ex. 12831.edges -> 12831)
* [dfs, dijkstra, centrality]: Choose which algorithm to run
* [source node]: Choose the source node to run algorithms with (any number in the .edges file)
* [destination node]: Choose the destination node. _Used only when performing Dijkstra's algorithm_
* DFS Example: ./finalproj 12831 dfs 8479062
* Dijkstra Example: ./finalproj 12831 dijkstra 20904050 1301***62
* Centrality Example: ./finalproj 12831 centrality 528
Run the test cases using the following command: ./test
近期下载者：
相关文件：
收藏者：