com.google.ortools.sat.RoutesConstraintProtoOrBuilder Maven / Gradle / Ivy
The newest version!
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: ortools/sat/cp_model.proto
package com.google.ortools.sat;
public interface RoutesConstraintProtoOrBuilder extends
// @@protoc_insertion_point(interface_extends:operations_research.sat.RoutesConstraintProto)
com.google.protobuf.MessageOrBuilder {
/**
* repeated int32 tails = 1;
* @return A list containing the tails.
*/
java.util.List getTailsList();
/**
* repeated int32 tails = 1;
* @return The count of tails.
*/
int getTailsCount();
/**
* repeated int32 tails = 1;
* @param index The index of the element to return.
* @return The tails at the given index.
*/
int getTails(int index);
/**
* repeated int32 heads = 2;
* @return A list containing the heads.
*/
java.util.List getHeadsList();
/**
* repeated int32 heads = 2;
* @return The count of heads.
*/
int getHeadsCount();
/**
* repeated int32 heads = 2;
* @param index The index of the element to return.
* @return The heads at the given index.
*/
int getHeads(int index);
/**
* repeated int32 literals = 3;
* @return A list containing the literals.
*/
java.util.List getLiteralsList();
/**
* repeated int32 literals = 3;
* @return The count of literals.
*/
int getLiteralsCount();
/**
* repeated int32 literals = 3;
* @param index The index of the element to return.
* @return The literals at the given index.
*/
int getLiterals(int index);
/**
*
* Experimental. The demands for each node, and the maximum capacity for each
* route. Note that this is currently only used for the LP relaxation and one
* need to add the corresponding constraint to enforce this outside of the LP.
*
*
* repeated int32 demands = 4;
* @return A list containing the demands.
*/
java.util.List getDemandsList();
/**
*
* Experimental. The demands for each node, and the maximum capacity for each
* route. Note that this is currently only used for the LP relaxation and one
* need to add the corresponding constraint to enforce this outside of the LP.
*
*
* repeated int32 demands = 4;
* @return The count of demands.
*/
int getDemandsCount();
/**
*
* Experimental. The demands for each node, and the maximum capacity for each
* route. Note that this is currently only used for the LP relaxation and one
* need to add the corresponding constraint to enforce this outside of the LP.
*
*
* repeated int32 demands = 4;
* @param index The index of the element to return.
* @return The demands at the given index.
*/
int getDemands(int index);
/**
* int64 capacity = 5;
* @return The capacity.
*/
long getCapacity();
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy