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

Wishlist: Condensation of directed graph #2542

Open
szhorvat opened this issue Mar 23, 2024 · 0 comments
Open

Wishlist: Condensation of directed graph #2542

szhorvat opened this issue Mar 23, 2024 · 0 comments
Labels
wishlist Feature request that has not been chosen for implementation yet; vote or comment to prioritize it!

Comments

@szhorvat
Copy link
Member

What is the feature or improvement you would like to see?

A function that returns the condensation of the directed graph.

The condensation of a directed graph is obtained by contracting each strongly connected component to a single vertex.

It would be particularly useful to index the vertices of the condensation in topological order.

Use cases for the feature

  • The condensation is a compact representation of the reachability structure of the graph
  • Feature parity with other libraries

Alternatives

This is currently doable by using igraph_connected_compoments(), igraph_contract_vertices(), then igraph_simplify(). A more efficient version that produces vertices in topological order would be nice.

References

@szhorvat szhorvat added the wishlist Feature request that has not been chosen for implementation yet; vote or comment to prioritize it! label Mar 23, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
wishlist Feature request that has not been chosen for implementation yet; vote or comment to prioritize it!
Projects
None yet
Development

No branches or pull requests

1 participant