Triangles

CUDA implementation of parallel algorithm for counting triangles (i.e. 3-cycles) in large graphs. Comes with benchmarks and sequential CPU implementations to compare with.

Name		Name	Last commit message	Last commit date
Latest commit History 40 Commits
.gitignore		.gitignore
Makefile		Makefile
README.md		README.md
convert-from-dimacs-main.cpp		convert-from-dimacs-main.cpp
convert-from-snap-main.cpp		convert-from-snap-main.cpp
convert-to-latapy-main.cpp		convert-to-latapy-main.cpp
cpu.cpp		cpu.cpp
cpu.h		cpu.h
create-barabasi-albert-main.cpp		create-barabasi-albert-main.cpp
create-watts-strogatz-main.cpp		create-watts-strogatz-main.cpp
gpu-thrust.cu		gpu-thrust.cu
gpu-thrust.h		gpu-thrust.h
gpu.cu		gpu.cu
gpu.h		gpu.h
graph.cpp		graph.cpp
graph.h		graph.h
latapy.c		latapy.c
main.cpp		main.cpp
testdata.sh		testdata.sh
timer.cpp		timer.cpp
timer.h		timer.h

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Triangles

About

Releases

Packages

Contributors

Languages

Folders and files

Latest commit

History

Repository files navigation

Triangles

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages