C++ Reference: connectivity

This documentation is automatically generated.

Graph connectivity algorithm for undirected graphs. Memory consumption: O(n) where m is the number of arcs and n the number of nodes. TODO(user): add depth-first-search based connectivity for directed graphs. TODO(user): add depth-first-search based biconnectivity for directed graphs.

Classes
ConnectedComponents

Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.

Last updated 2018-05-27 UTC.

Discussion forum
Visit our forum
Discord
Join Google OR-Tools Discord server
GitHub
Download our code
Stack Overflow
Ask questions using the or-tools or cp-sat tags

C++ Reference: connectivity

Classes