[[["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\u003eThe \u003ccode\u003eGraphBuilderFromArcs\u003c/code\u003e class facilitates the construction of a graph data structure from a collection of arcs (directed edges).\u003c/p\u003e\n"],["\u003cp\u003eUsers can add arcs individually using the \u003ccode\u003eAddArc\u003c/code\u003e method, specifying the tail and head nodes.\u003c/p\u003e\n"],["\u003cp\u003eThe \u003ccode\u003eGraph\u003c/code\u003e method finalizes the graph creation process, optionally incorporating a cycle handler, resulting in a \u003ccode\u003eGraphType\u003c/code\u003e object.\u003c/p\u003e\n"],["\u003cp\u003eInitialization of \u003ccode\u003eGraphBuilderFromArcs\u003c/code\u003e requires specifying the maximum number of nodes and arcs and whether to sort the arcs during construction.\u003c/p\u003e\n"]]],["The `GraphBuilderFromArcs` class in C++ constructs graphs. It uses the `AddArc` method to add arcs between nodes, specified by `tail` and `head` node indices. The `Graph` method finalizes the graph construction, potentially handling permutation cycles via a provided handler. The class constructor, `GraphBuilderFromArcs`, initializes the builder with maximum node and arc counts, and optionally enables arc sorting.\n"],null,["# GraphBuilderFromArcs\n\nC++ Reference: class GraphBuilderFromArcs\n=========================================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|----------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------|\n| [`AddArc`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/ebert_graph.h#L1973) | Return type: `typename GraphType::ArcIndex ` Arguments: `typename GraphType::NodeIndex tail, typename GraphType::NodeIndex head` \u003cbr /\u003e |\n| [`Graph`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/ebert_graph.h#L1992) | Return type: `GraphType* ` Arguments: `PermutationCycleHandler\u003ctypename GraphType::ArcIndex\u003e* client_cycle_handler` Builds the graph from the given arcs. |\n| [`GraphBuilderFromArcs`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/ebert_graph.h#L1966) | \u003cbr /\u003e Arguments: `typename GraphType::NodeIndex max_num_nodes, typename GraphType::ArcIndex max_num_arcs, bool sort_arcs` \u003cbr /\u003e |"]]
