Closed bergolho closed 3 years ago
I am closing this pull request because there was a multiple include bug in the "sort_vector_by_distance" function in the "grid.c" file.
/home/berg/Github/MonoAlg3D_C/build_release/libalg/libalg.a(grid.c.o): In function partition': grid.c:(.text+0x20): multiple definition of
partition'
/home/berg/Github/MonoAlg3D_C/build_release/libutils/libutils.a(sort.c.o):sort.c:(.text+0x0): first defined here
/home/berg/Github/MonoAlg3D_C/build_release/libalg/libalg.a(grid.c.o): In function quicksort': grid.c:(.text+0xd0): multiple definition of
quicksort'
/home/berg/Github/MonoAlg3D_C/build_release/libutils/libutils.a(sort.c.o):sort.c:(.text+0xb0): first defined here
/home/berg/Github/MonoAlg3D_C/build_release/libalg/libalg.a(grid.c.o): In function sort_vector': grid.c:(.text+0x130): multiple definition of
sort_vector'
/home/berg/Github/MonoAlg3D_C/build_release/libutils/libutils.a(sort.c.o):sort.c:(.text+0x110): first defined here
/home/berg/Github/MonoAlg3D_C/build_release/libalg/libalg.a(grid.c.o): In function partition_by_distance': grid.c:(.text+0x240): multiple definition of
partition_by_distance'
/home/berg/Github/MonoAlg3D_C/build_release/libutils/libutils.a(sort.c.o):sort.c:(.text+0x220): first defined here
/home/berg/Github/MonoAlg3D_C/build_release/libalg/libalg.a(grid.c.o): In function quicksort_by_distance': grid.c:(.text+0x330): multiple definition of
quicksort_by_distance'
/home/berg/Github/MonoAlg3D_C/build_release/libutils/libutils.a(sort.c.o):sort.c:(.text+0x310): first defined here
/home/berg/Github/MonoAlg3D_C/build_release/libalg/libalg.a(grid.c.o): In function sort_vector_by_distance': grid.c:(.text+0x390): multiple definition of
sort_vector_by_distance'
/home/berg/Github/MonoAlg3D_C/build_release/libutils/libutils.a(sort.c.o):sort.c:(.text+0x370): first defined here
Hello Sachetto,
In this pull request, I added some simulations in order to get the steady-state vector of any given cellular model and a script that can plot all the state variables. Using these new features I was able to update the initial conditions with the steady-state vector for the ToRORd and Trovato models. There is also a new function that can calculate the propagation velocity across a cable Purkinje fiber. I still need to improve this function to work on any given Purkinje network, but for that, I will need to implement a queue data structure, so it can be used on the Dijkstra algorithm.
The next steps are to allow the Purkinje-coupling examples to be executed using batch simulations and implement the Dijkstra algorithm to calculate the propagation velocity.