Class RoutingModel.NodeNeighborsByCostClass

java.lang.Object
com.google.ortools.constraintsolver.RoutingModel.NodeNeighborsByCostClass
Enclosing class:
RoutingModel

public static class RoutingModel.NodeNeighborsByCostClass extends Object
  • Field Details

    • swigCMemOwn

      protected transient boolean swigCMemOwn
  • Constructor Details

    • NodeNeighborsByCostClass

      public NodeNeighborsByCostClass(long cPtr, boolean cMemoryOwn)
    • NodeNeighborsByCostClass

      public NodeNeighborsByCostClass(RoutingModel routing_model)
  • Method Details

    • getCPtr

      public static long getCPtr(RoutingModel.NodeNeighborsByCostClass obj)
    • swigRelease

      public static long swigRelease(RoutingModel.NodeNeighborsByCostClass obj)
    • finalize

      protected void finalize()
      Overrides:
      finalize in class Object
    • delete

      public void delete()
    • ComputeNeighbors

      public void ComputeNeighbors(RoutingModel.NodeNeighborsParameters params)
      Computes num_neighbors neighbors of all nodes for every cost class in
      routing_model.
    • GetIncomingNeighborsOfNodeForCostClass

      public int[] GetIncomingNeighborsOfNodeForCostClass(int cost_class, int node_index)
      Returns the incoming neighbors of the given node for the given
      cost_class, i.e. all 'neighbor' indices such that neighbor -> node_index
      is a neighborhood arc for 'cost_class'.
    • GetOutgoingNeighborsOfNodeForCostClass

      public int[] GetOutgoingNeighborsOfNodeForCostClass(int cost_class, int node_index)
      Returns the neighbors that are outgoing from 'node_index', i.e.
      'neighbor' indices such that node_index -> neighbor is a neighborhood
      arc for 'cost_class'.
    • IsNeighborhoodArcForCostClass

      public boolean IsNeighborhoodArcForCostClass(int cost_class, long from, long to)
      Returns true iff arc from_node -> to_node is a neighborhood arc for the
      given cost_class, i.e. iff arc.to_node is an outgoing neighbor of
      arc.from_node for 'cost_class'.