Skip to content

EmpiricalAnalysis/Strongly-Connected-Components-in-A-Directed-Graph

master
Switch branches/tags

Name already in use

A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
1 branch 0 tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
src
 
 
test
 
 
.gitignore
 
 
LICENSE
 
 
README.md
 
 

README.md

Strongly Connected Components (SCC) in A Directed Graph

In this project I coded up the algorithm to compute strongly connected components (SCC) and used it to compute the size of the SCCs of a directed graph that had close to one million vertices.

The java codes I wrote are in the src folder.

About

No description, website, or topics provided.

Resources

Readme

License

MIT license

Stars

0 stars

Watchers

1 watching

Forks

0 forks

Releases

No releases published

Packages

No packages published

Languages