Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Connectivity of an oriented graph #13

Open
sdrgabriel opened this issue Apr 28, 2019 · 0 comments
Open

Connectivity of an oriented graph #13

sdrgabriel opened this issue Apr 28, 2019 · 0 comments

Comments

@sdrgabriel
Copy link

I'm trying to show the connectedness of an oriented graph, whether it's simply connected, semi-strongly connected, or strongly connected, through the algorithm of ConnectedComponents, I'm only able to see if it's disconnected if getConnectedComponentsCount == 0 or simply connected if getConnectedComponentsCount == 1 has any method to see if it is semi-strongly connected or strongly connected?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant