[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003eThis C++ reference provides a comprehensive collection of libraries for working with graphs and networks.\u003c/p\u003e\n"],["\u003cp\u003eThe libraries include algorithms for various graph-related problems, such as assignment, shortest paths, connected components, and more.\u003c/p\u003e\n"],["\u003cp\u003eThe reference covers fundamental graph data structures and utilities for representing and manipulating graphs.\u003c/p\u003e\n"],["\u003cp\u003eDevelopers can leverage these libraries for optimization, analysis, and solving complex problems involving networks and relationships.\u003c/p\u003e\n"]]],["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,[]]
