[[["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,[]]
