Definition at line 52 of file FlowProblem.pb.cs.
|
| static pb::MessageParser< FlowArcProto > | Parser [get] |
| static pbr::MessageDescriptor | Descriptor [get] |
| long | Tail [get, set] |
| | A directed arc goes from a tail node to a head node. Node ids must be non-negative (>= 0).
|
| bool | HasTail [get] |
| | Gets whether the "tail" field is set.
|
| long | Head [get, set] |
| bool | HasHead [get] |
| | Gets whether the "head" field is set.
|
| long | Capacity [get, set] |
| | Capacity of the arc. Must be non-negative (>= 0). If the capacity is zero, it is equivalent to not including the arc in the FlowModelProto.
|
| bool | HasCapacity [get] |
| | Gets whether the "capacity" field is set.
|
| long | UnitCost [get, set] |
| | Cost of this arc per unit of flow.
|
| bool | HasUnitCost [get] |
| | Gets whether the "unit_cost" field is set.
|
◆ FlowArcProto() [1/2]
| Google.OrTools.Graph.FlowArcProto.FlowArcProto |
( |
| ) |
|
|
inline |
◆ FlowArcProto() [2/2]
| Google.OrTools.Graph.FlowArcProto.FlowArcProto |
( |
FlowArcProto | other | ) |
|
|
inline |
◆ CalculateSize()
| int Google.OrTools.Graph.FlowArcProto.CalculateSize |
( |
| ) |
|
|
inline |
◆ ClearCapacity()
| void Google.OrTools.Graph.FlowArcProto.ClearCapacity |
( |
| ) |
|
|
inline |
◆ ClearHead()
| void Google.OrTools.Graph.FlowArcProto.ClearHead |
( |
| ) |
|
|
inline |
◆ ClearTail()
| void Google.OrTools.Graph.FlowArcProto.ClearTail |
( |
| ) |
|
|
inline |
◆ ClearUnitCost()
| void Google.OrTools.Graph.FlowArcProto.ClearUnitCost |
( |
| ) |
|
|
inline |
◆ Clone()
◆ Equals() [1/2]
| bool Google.OrTools.Graph.FlowArcProto.Equals |
( |
FlowArcProto | other | ) |
|
|
inline |
◆ Equals() [2/2]
| override bool Google.OrTools.Graph.FlowArcProto.Equals |
( |
object | other | ) |
|
|
inline |
◆ GetHashCode()
| override int Google.OrTools.Graph.FlowArcProto.GetHashCode |
( |
| ) |
|
|
inline |
◆ MergeFrom() [1/2]
| void Google.OrTools.Graph.FlowArcProto.MergeFrom |
( |
FlowArcProto | other | ) |
|
|
inline |
◆ MergeFrom() [2/2]
| void Google.OrTools.Graph.FlowArcProto.MergeFrom |
( |
pb.CodedInputStream | input | ) |
|
|
inline |
◆ ToString()
| override string Google.OrTools.Graph.FlowArcProto.ToString |
( |
| ) |
|
|
inline |
◆ WriteTo()
| void Google.OrTools.Graph.FlowArcProto.WriteTo |
( |
pb.CodedOutputStream | output | ) |
|
|
inline |
◆ CapacityFieldNumber
| const int Google.OrTools.Graph.FlowArcProto.CapacityFieldNumber = 3 |
|
static |
◆ HeadFieldNumber
| const int Google.OrTools.Graph.FlowArcProto.HeadFieldNumber = 2 |
|
static |
◆ TailFieldNumber
| const int Google.OrTools.Graph.FlowArcProto.TailFieldNumber = 1 |
|
static |
◆ UnitCostFieldNumber
| const int Google.OrTools.Graph.FlowArcProto.UnitCostFieldNumber = 4 |
|
static |
◆ Capacity
| long Google.OrTools.Graph.FlowArcProto.Capacity |
|
getset |
Capacity of the arc. Must be non-negative (>= 0). If the capacity is zero, it is equivalent to not including the arc in the FlowModelProto.
Definition at line 170 of file FlowProblem.pb.cs.
◆ Descriptor
| pbr.MessageDescriptor Google.OrTools.Graph.FlowArcProto.Descriptor |
|
staticget |
◆ HasCapacity
| bool Google.OrTools.Graph.FlowArcProto.HasCapacity |
|
get |
◆ HasHead
| bool Google.OrTools.Graph.FlowArcProto.HasHead |
|
get |
◆ HasTail
| bool Google.OrTools.Graph.FlowArcProto.HasTail |
|
get |
◆ HasUnitCost
| bool Google.OrTools.Graph.FlowArcProto.HasUnitCost |
|
get |
◆ Head
| long Google.OrTools.Graph.FlowArcProto.Head |
|
getset |
◆ Parser
| pb.MessageParser<FlowArcProto> Google.OrTools.Graph.FlowArcProto.Parser |
|
staticget |
◆ Tail
| long Google.OrTools.Graph.FlowArcProto.Tail |
|
getset |
A directed arc goes from a tail node to a head node. Node ids must be non-negative (>= 0).
Definition at line 112 of file FlowProblem.pb.cs.
◆ UnitCost
| long Google.OrTools.Graph.FlowArcProto.UnitCost |
|
getset |
Cost of this arc per unit of flow.
- Note
- it can take any positive, negative or null value.
Definition at line 201 of file FlowProblem.pb.cs.
The documentation for this class was generated from the following file: