Refactored the code so that all the data structures are in one place. I also implemented the Euler characteristic to find articulation points in planar graphs quickly and switched to BFS to avoid the recursion in Tarjan's algorithm (Tajan can also avoid recurrsion but its more complicated). In theory BFS can also be parallelized.
Refactored the code so that all the data structures are in one place. I also implemented the Euler characteristic to find articulation points in planar graphs quickly and switched to BFS to avoid the recursion in Tarjan's algorithm (Tajan can also avoid recurrsion but its more complicated). In theory BFS can also be parallelized.