the previous implementation first creates lists using list
comprehension and then converts them to numpy array. It could be
replaced by creating numpy arrays directly using numpy.full().
node_predecessor, node_label_cost, link_predecessor, queue_next
FirstLinkFrom, LastLinkFrom, sorted_link_no_vector can be created
in this way.
for from_node_no_array, to_node_no_array, and link_cost_array, they
are gone three steps: 1. creatition using list comprehension;
conversion into numpy arrays; 3. initialization for each link using
for loop (which is at the speed of python and usually considered as the
slow way).
the three steps can be combined into two steps. 1. creatition and
initialization using generator (which is at the speed of C); 2 conversion
into numpy arrays.
other changes include
make INVALID, SEList_WAS_IN_QUEUE_Flag, FirstThruNode as static const as
they are only needed to be constructed and initialized on the first call.
add a copy of libstalite_base.dll to test folder and change its path info
in /test/dtalite_s_base.py to make running test easier for users per
Dr. Zhou's request.
the previous implementation first creates lists using list comprehension and then converts them to numpy array. It could be replaced by creating numpy arrays directly using numpy.full().
node_predecessor, node_label_cost, link_predecessor, queue_next FirstLinkFrom, LastLinkFrom, sorted_link_no_vector can be created in this way.
for from_node_no_array, to_node_no_array, and link_cost_array, they are gone three steps: 1. creatition using list comprehension;
the three steps can be combined into two steps. 1. creatition and initialization using generator (which is at the speed of C); 2 conversion into numpy arrays.
other changes include
make INVALID, SEList_WAS_IN_QUEUE_Flag, FirstThruNode as static const as they are only needed to be constructed and initialized on the first call.
add a copy of libstalite_base.dll to test folder and change its path info in /test/dtalite_s_base.py to make running test easier for users per Dr. Zhou's request.