[[["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."],[[["`CompleteGraph` is a C++ class within the OR-Tools library that provides a structure for representing complete graphs, where every node is connected to every other node."],["It offers methods for building the graph based on the desired number of nodes and for navigating the graph structure, such as retrieving the head and tail nodes of an arc."],["Users can access information about node degrees and iterate through outgoing arcs using methods like `OutDegree` and `OutgoingArcs`."],["The class is particularly useful for scenarios where modeling complete graph structures is necessary, like in certain network optimization problems or graph algorithms."]]],["The `CompleteGraph` class in C++ provides methods for managing a complete graph. Key actions include building a complete graph with a specified number of nodes using `CompleteGraph(num_nodes)`. Other methods allow users to get the head node of an arc (`Head(arc)`), the out-degree of a node (`OutDegree(node)`), the range of outgoing arcs from a node (`OutgoingArcs(node)`), the range of outgoing arcs from a node starting from a given arc (`OutgoingArcsStartingFrom(node, from)`), and the tail node of an arc (`Tail(arc)`).\n"]]
