graph theory commands for Giac
Modérateur : xcasadmin
Re: graph theory commands for Giac
Should be in 1.5.0-43.
Re: graph theory commands for Giac
Hi,
I have improved is_hamiltonian command, now it uses a backtracking algorithm and works with digraphs as well as with undirected graphs. It does not call traveling_salesman anymore. The backtracking technique is simple but it works well on smaller graphs. I changed the corresponding entry in the manual accordingly.
[Edit] I also improved is_eulerian command, now it accepts digraphs too.
I have improved is_hamiltonian command, now it uses a backtracking algorithm and works with digraphs as well as with undirected graphs. It does not call traveling_salesman anymore. The backtracking technique is simple but it works well on smaller graphs. I changed the corresponding entry in the manual accordingly.
[Edit] I also improved is_eulerian command, now it accepts digraphs too.
Re: graph theory commands for Giac
Thanks, I have synchronized my source.
Re: graph theory commands for Giac
New updates:
* traveling_salesman now works with digraphs too, I also improved the code for undirected graphs,
* hamiltonicity testing for digraphs is improved,
* imported graphs are now checked for duplicate vertex labels,
* graph theory manual is updated and I corrected/added some examples in aide_cas.
* traveling_salesman now works with digraphs too, I also improved the code for undirected graphs,
* hamiltonicity testing for digraphs is improved,
* imported graphs are now checked for duplicate vertex labels,
* graph theory manual is updated and I corrected/added some examples in aide_cas.