path finder algorithm

[Shinji7800]

Hello, I need help for path finder algorithm on cytoscape JS. 

I succeed to perform the A* search but not with Dijkstra I don't understand why (I don't implement weigh on my edges yet), form what I understand if there is not heuristic function A* algorithm works like Dijkstra, I'm a very confused.

ma second question is about K-Shortest Path algorithm. I don't known how to proceed to implement this functionality :/ have you any advice ?

 my need is : 

- restriction on edges : "not allowed to use this edge" --> I believe infinity weight is the key for this functionality.

- additionally find two path with no (or the less) common edges 

- find k-alternatives to my first paths couple 

I hope I explain my issue clearly, If don't don't hesitate to explain to me why is not clear.

forgive my approximate English I'm a French.     

best regards

[Shinji7800]

Hello everyone!

I am succeeded to move forward and use Dijkstra

I tough that Dijkstra use by default 1 as weight if no is defined but since I add weight as data in node and edges, Dijkstra works

I continue to work on k-shortest paths and heuristic interest

Best regards