abc.ABCrlgt.agents.graph_agent.GraphAgent - This abstract class encapsulates the concept of a reinforcement learning agent for graph theory applications. Such an agent is intended to solve extremal problems in which a given graph invariant is to be maximized over a finite family of fully colored ...rlgt.agents.deep_cross_entropy_agent.DeepCrossEntropyAgent - This class encapsulates a reinforcement learning agent for graph theory applications using the PyTorch-based Deep Cross-Entropy method. The agent operates on a configurable environment given as a GraphEnvironment...rlgt.agents.ppo_agent.PPOAgent - This class encapsulates a reinforcement learning agent for graph theory applications using the PyTorch-based Proximal Policy Optimization (PPO) method. The agent operates on a configurable environment given as a ...rlgt.agents.reinforce_agent.ReinforceAgent - This class encapsulates a reinforcement learning agent for graph theory applications using the PyTorch-based REINFORCE method. The agent operates on a configurable environment given as a GraphEnvironment...rlgt.agents.random_action_mechanisms.RandomActionMechanism - This abstract class encapsulates the concept of a random action mechanism in the context of an RL agent for graph theory applications. A random action mechanism controls the probability with which the agent selects a random action instead of an action prescribed by its policy...rlgt.agents.random_action_mechanisms.ConstantRandomActionMechanism - This class inherits from the RandomActionMechanism class and represents a random action mechanism in which the probability of executing a random action is constant and specified at construction time.rlgt.agents.random_action_mechanisms.ExponentialRandomActionMechanism - This class inherits from the RandomActionMechanism class and represents a random action mechanism with an exponential-style adaptation rule. An initial random action probability is specified at construction time...rlgt.agents.random_action_mechanisms.NoRandomActionMechanism - This class inherits from the RandomActionMechanism class and represents a random action mechanism in which random actions are never executed. The random action probability is identically equal to 0 throughout the entire learning process.rlgt.environments.graph_environment.GraphEnvironment - This abstract class encapsulates the concept of a reinforcement learning (RL) environment for graph theory applications. Such an environment is designed to address extremal problems in which a specified graph invariant is to be maximized over a finite family of fully colored ...rlgt.environments.global_environments.GlobalFlipEnvironment - This class inherits from GraphEnvironment and models a graph building game for constructing 2-edge-colored looped complete graphs. In this environment, all edges (resp. arcs) are initially fully colored in some manner, and at each step, any edge (resp...rlgt.environments.global_environments.GlobalSetEnvironment - This class inherits from the GraphEnvironment class and models a graph building game in which the edges (resp. arcs) are initially fully colored in some manner, and at each step, any edge (resp. arc) can be potentially recolored with any color...rlgt.environments.linear_environments.LinearBuildEnvironment - This class inherits from the GraphEnvironment class and models a graph building game in which the edges (resp. arcs) are initially uncolored and are then properly colored one by one, either in row-major order or clockwise order...rlgt.environments.linear_environments.LinearFlipEnvironment - This class inherits from the GraphEnvironment class and models a graph building game for constructing 2-edge-colored looped complete graphs. The edges (resp. arcs) are initially fully colored in some manner and can then be potentially flipped one by one in either row-major or clockwise order...rlgt.environments.linear_environments.LinearSetEnvironment - This class inherits from the GraphEnvironment class and models a graph building game in which the edges (resp. arcs) are initially fully colored and are then properly recolored one by one, either in row-major order or clockwise order...rlgt.environments.local_environments.LocalFlipEnvironment - This class inherits from the GraphEnvironment class and models a graph building game used for constructing 2-edge-colored looped complete graphs in which the edges (resp. arcs) are initially fully colored in some manner, and the agent moves from one vertex to another, thereby traversing existing edges (resp...rlgt.environments.local_environments.LocalSetEnvironment - This class inherits from the GraphEnvironment class and models a graph building game in which the edges (resp. arcs) are initially fully colored in some manner, and an agent moves between vertices, thereby traversing existing edges (resp...enum.Enumrlgt.environments.graph_environment.EpisodeStatus - This enumeration represents the possible statuses of an episode in a reinforcement learning environment for graph theory applications.rlgt.graphs.graph_formats.BitmaskType - This enumeration encapsulates the concept of a bitmask type in the context of the two bitmask formats from the GraphFormat enumeration.rlgt.graphs.graph_formats.ColorRepresentation - This enumeration encapsulates the concept of an edge color representation style in the context of the two adjacency matrix formats and the four flattened formats from the GraphFormat enumeration.rlgt.graphs.graph_formats.FlattenedOrdering - This enumeration encapsulates the concept of an edge (resp. arc) ordering in the context of the four flattened formats from the GraphFormat enumeration.rlgt.graphs.graph_formats.GraphFormat - This enumeration encapsulates the concept of a format used to represent a k-edge-colored looped complete graph. Each graph is represented as a quintuple (edge_colors, is_directed,
allow_loops, graph_format, format_representation)...rlgt.graphs.graph.Graph - This class encapsulates the concept of a k-edge-colored looped complete graph or a batch of k-edge-colored looped complete graphs of the same order, with k being at least 2. If a single graph is modeled, then it is represented as a quintuple ...rlgt.graphs.special_graphs.AlmostCompleteGraph - This class inherits from the Graph class and is used to instantiate almost-complete graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph of order n in which all edges are colored with color 1, except for the edge between vertices ...rlgt.graphs.special_graphs.BookGraph - This class inherits from the Graph class and is used to instantiate book graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph such that its edges colored with the color 1 form a book graph, while all other edges are colored with the color 0...rlgt.graphs.special_graphs.CompleteBipartiteGraph - This class inherits from the Graph class and is used to instantiate complete bipartite graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph in which the edges colored with color 1 form a complete bipartite graph, while all remaining edges are colored with color 0...rlgt.graphs.special_graphs.CompleteGraph - This class inherits from the Graph class and is used to instantiate complete graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph of a given order in which all edges are colored with color 1...rlgt.graphs.special_graphs.CompleteKPartiteGraph - This class inherits from the Graph class and is used to instantiate complete k-partite graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph in which the edges colored with color 1 form a complete ...rlgt.graphs.special_graphs.CycleGraph - This class inherits from the Graph class and is used to instantiate cycle graphs. It produces a 2-edge-colored loopless complete undirected graph in which the edges colored with the color 1 form a cycle graph, while all other edges are colored with the color 0...rlgt.graphs.special_graphs.EmptyGraph - This class inherits from the Graph class and is used to instantiate empty graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph of a given order in which all edges are colored with color 0...rlgt.graphs.special_graphs.FriendshipGraph - This class inherits from the Graph class and is used to instantiate friendship graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph such that its edges colored with the color 1 form a friendship graph, while all other edges are colored with the color 0...rlgt.graphs.special_graphs.MonochromaticGraph - This class inherits from the Graph class and is used to create monochromatic graphs, i.e., k-edge-colored looped complete graphs where all edges (resp. arcs) share the same color or are all uncolored. ...rlgt.graphs.special_graphs.PathGraph - This class inherits from the Graph class and is used to instantiate path graphs. It produces a 2-edge-colored loopless complete undirected graph in which the edges colored with the color 1 form a path graph, while all other edges are colored with the color 0...rlgt.graphs.special_graphs.StarGraph - This class inherits from the Graph class and is used to instantiate star graphs. Specifically, it produces a 2-edge-colored loopless complete undirected graph in which the edges colored with color 1 form a star graph, while all remaining edges are colored with color 0...rlgt.graphs.special_graphs.WheelGraph - This class inherits from the Graph class and is used to instantiate wheel graphs. It produces a 2-edge-colored loopless complete undirected graph in which the edges colored with the color 1 form a wheel graph, while all other edges are colored with the color 0...