Skip to content
This repository has been archived by the owner on Jul 2, 2023. It is now read-only.

As part of my application as an JetBrains intern, I was asked to implement Tarjan's algorithm for finding strongly connected components.

Notifications You must be signed in to change notification settings

LadnerJonas/JetBrains-Intern-Project-Tarjan-SCC

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

JetBrains-Intern-Project-Tarjan-SCC

Code-Quality: Codefactor.io Badge

As part of my application as an intern, I was asked to implement Tarjan's algorithm for finding strongly connected components.

Documentation

Just a brief overview to explain the basic structure of the project

You can find the Tarjan implementation inside the Tarjan.kt file.

The Node.kt interface and the sample implementation TarjanNode.kt can be found inside the node subdirectory.

Helper classes, like the TarjanNodeData.kt, can be found inside the helper subdirectory. This class packs all the data needed per node inside a single class, which greatly helps the readability and cache-efficiency of the Tarjan implementation.

All the tests are divided into two groups: TarjanFunctionalTests.kt and TarjanEdgeCaseTests.kt.

To further ease the testing of huge graphs, a dynamic testing framework was created, which can found inside the helper subdirectory. For example, the TarjanTestHelper.kt file verifies the output of the Tarjan implementation, by checking the count and content of the strongly connected components (SCC) compared to the Kosaraju.kt algorithm.

About

As part of my application as an JetBrains intern, I was asked to implement Tarjan's algorithm for finding strongly connected components.

Resources

Stars

Watchers

Forks

Languages