[[["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\u003eArcFunctorOrderingByTailAndHead\u003c/code\u003e class provides a way to order arcs (edges) in a graph based on their tail and head nodes.\u003c/p\u003e\n"],["\u003cp\u003eIt's used within the context of the Ebert Graph structure, a specific graph representation in OR-Tools.\u003c/p\u003e\n"],["\u003cp\u003eThe primary method is a constructor that takes a \u003ccode\u003eGraphType\u003c/code\u003e object as input, establishing the graph for ordering comparisons.\u003c/p\u003e\n"]]],["The `ArcFunctorOrderingByTailAndHead` class in C++ is defined with an explicit constructor that takes a constant reference to a `GraphType` object named `graph`. This class's core functionality is accessed via the method `ArcFunctorOrderingByTailAndHead`, which takes a `const GraphType& graph` as its sole argument. It is found in the ebert_graph.h header file.\n"],null,["# ArcFunctorOrderingByTailAndHead\n\nC++ Reference: class ArcFunctorOrderingByTailAndHead\n====================================================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|---------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------|\n| [`ArcFunctorOrderingByTailAndHead`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/ebert_graph.h#L1942) | Return type: `explicit ` Arguments: `const GraphType& graph` \u003cbr /\u003e |"]]
