public static class RoutingModel.NodeNeighborsByCostClass
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
protected boolean |
swigCMemOwn |
Constructor and Description |
---|
NodeNeighborsByCostClass(long cPtr,
boolean cMemoryOwn) |
NodeNeighborsByCostClass(RoutingModel routing_model) |
Modifier and Type | Method and Description |
---|---|
void |
ComputeNeighbors(RoutingModel.NodeNeighborsParameters params)
Computes num_neighbors neighbors of all nodes for every cost class in
routing_model. |
void |
delete() |
protected void |
finalize() |
static long |
getCPtr(RoutingModel.NodeNeighborsByCostClass obj) |
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'. |
int[] |
GetOutgoingNeighborsOfNodeForCostClass(int cost_class,
int node_index)
Returns the neighbors that are outgoing from 'node_index', i.e.
|
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'. |
static long |
swigRelease(RoutingModel.NodeNeighborsByCostClass obj) |
public NodeNeighborsByCostClass(long cPtr, boolean cMemoryOwn)
public NodeNeighborsByCostClass(RoutingModel routing_model)
public static long getCPtr(RoutingModel.NodeNeighborsByCostClass obj)
public static long swigRelease(RoutingModel.NodeNeighborsByCostClass obj)
protected void finalize()
finalize
in class java.lang.Object
public void delete()
public void ComputeNeighbors(RoutingModel.NodeNeighborsParameters params)
public int[] GetIncomingNeighborsOfNodeForCostClass(int cost_class, int node_index)
public int[] GetOutgoingNeighborsOfNodeForCostClass(int cost_class, int node_index)
public boolean IsNeighborhoodArcForCostClass(int cost_class, long from, long to)
Copyright © 2025. All rights reserved.