Creates an empty logical network with the default naming convension:
node table name = network_name + "_NODE$",
link table name = network_name + "_LINK$,
path table name = network_name + "_PATH$",
path-link table name = network_name + "PLINK$",
subPath table name = network_name + "SPATH$",
all cost column name = "COST".
Creates an empty spatial SDO_GEOMETRY network with the default naming convension:
node table name = network_name + "_NODE$",
link table name = network_name + "_LINK$,
path table name = network_name + "_PATH$",
path-link table name = network_name + "PLINK$",
subpath table name = network_name + "_SPATH$",
all geometry column name = "GEOMETRY" and all cost column name = "COST"
Extends the path by adding a new start link and a new end link
The given links must be topologically connected to the path or an exception will be thrown
No extension in the specific direction (start or end) if a null link is given
Returns the cost stored in Link object
This function can be used to return the cost stored in the Link object
if the getCost() method is overridden by a LinkCostFunction provided by users.
Gets the network from the network cache
if the specified network is not in the cache, null will be returned
To add a network in the cache, use Networkmanager.putNetworkToCache(networkname, network)
Returns the TSP path node duration in an array of double
The order of the duration is the same as the one in getTSPNodeNodeOrder()
the duration is returned as an array of two doubles
duration[i][0] represents the arrival duration for the i-th TSP node and
This information is only used for TSP related analys
Returns the TSP path node duration in an array of double
The order of the duration is the same as the one in getTSPNodeNodeOrder()
the duration is returned as an array of two doubles
duration[i][0] represents the arrival duration for the i-th TSP node and
This information is only used for TSP related analys
Returns the tree link array that leads to the child nodes
i-th tree link leads to i-th child tree node
public TreeLink getTreeLink() ;
/**
Is the node a leaf node?
Creates a new path starting from the new start node
to the node on the reference path closest to the start node and
to the end node of the reference path
This interface defines a sub path with the follwoing properties:
A reference path,
a start percentage and a start link index in the reference path link list,
an end percentage and an end link index in the reference path link list,
The partial link cost is assumed to be linearly propotional to the given percentage.