Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: graph
Note: This documentation is automatically generated.
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 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["This C++ reference for graph libraries details various algorithms and functionalities. It includes graph manipulation tools such as `assignment`, `graph`, and `graphs`, alongside algorithms for `cliques`, `connected_components`, `eulerian_path`, and `hamiltonian_path`. Further, it encompasses network flow computations like `max_flow`, and `min_cost_flow`. The library provides tools for `shortestpaths`, `minimum_spanning_tree`, `perfect_matching`, and others like `topologicalsorter`. I/O and iterator functionalities are included.\n"],null,[]]