Parallel-Traversals-PC

This directory contains OpenMP parallel implementations of Euler tour, postorder traversal and vertex level calculation.

Instructions to Run

For postorder traversal,

$ make postorder

For preorder traversal,

$ make preorder

For vertex level,

$ make vertex_level

The time complexity of taking inputs and printing results is not considered for the total time complexity. The algorithms each take O(logn) time.
The input is currently hard-coded.
Hashing has been used in a few places for ease of implementation without loss of program correctness.
Euler tour is generated and printed in each of the traversals. There is no separate command to invoke Euler tour.

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
Makefile		Makefile
README.md		README.md
euler_tour.cpp		euler_tour.cpp
euler_tour.h		euler_tour.h
post_order.cpp		post_order.cpp
pre_order.cpp		pre_order.cpp
vertex_level.cpp		vertex_level.cpp