I think I can do it with a reweighted graph and kamada_kawai_spring_layout. However, my edge weights vector is failing the following test in the MEX file:
if (!mxIsDouble(arg_ewopt) < nz) {
mexErrMsgIdAndTxt("matlab_bgl:invalidParameter",
"The reweight array must be of type double");
even though in Matlab the array is a double. I'm on 64 bit Matlab, and I'm guessing that the mex file 'thinks' I'm on 32.
Any ideas ?
Comment only
21 May 2013
MatlabBGL
MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures.
Thanks for the great toolbox.
I'm trying to solve a shortest path problem with A* using an implicit graph.
If I understood correctly, I should add a new vertex and its edges during the call of examine_vertex visitor. I just cant figure it out how to manipulate the graph inside the visitor.
I would be very happy if you could point me an example of using implicit graph with A*. I tried to google it with little success.
Comment only