[[["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\u003e\u003ccode\u003eStaticGraph\u003c/code\u003e is a C++ class within the Google OR-Tools library used to represent a directed graph with a fixed structure.\u003c/p\u003e\n"],["\u003cp\u003eIt provides methods to add nodes and arcs, and to access graph properties like the head and tail of an arc, or the out-degree of a node.\u003c/p\u003e\n"],["\u003cp\u003eThe graph structure is built and finalized using the \u003ccode\u003eBuild\u003c/code\u003e method, enabling efficient traversal and operations on the graph.\u003c/p\u003e\n"],["\u003cp\u003eMemory for the graph can be pre-allocated with \u003ccode\u003eReserveNodes\u003c/code\u003e and \u003ccode\u003eReserveArcs\u003c/code\u003e for performance optimization.\u003c/p\u003e\n"],["\u003cp\u003eIteration over outgoing arcs from a node is facilitated by \u003ccode\u003eOutgoingArcs\u003c/code\u003e and \u003ccode\u003eOutgoingArcsStartingFrom\u003c/code\u003e methods, providing flexibility in graph traversal.\u003c/p\u003e\n"]]],["The `StaticGraph` class in C++ provides methods for managing a graph structure. Key actions include adding nodes (`AddNode`) and arcs (`AddArc`), reserving memory for nodes (`ReserveNodes`) and arcs (`ReserveArcs`). Methods to retrieve information about the graph are available, such as getting the head (`Head`) and tail (`Tail`) of arcs, the out-degree of a node (`OutDegree`), and outgoing arcs (`OutgoingArcs`, `OutgoingArcsStartingFrom`). `Build` methods can finalize the graph. Constructor methods `StaticGraph` are also provided.\n"],null,[]]
