This repository contains the code developed for the purposes of the course Parallel and Distributed Systems of the school of ECE of AUTh.
The main assigment was to calculate the triangles adjacent to every node in an unweighted and undirected graph in 2 ways. V3 contains the code to calculate the triangles by following the edges of the graphs and V4 contains the code that uses linear algebra.