1
<?xml version="1.0" encoding="ISO-8859-1" standalone="no"?>
2
<!DOCTYPE MAN SYSTEM "../../manrev.dtd">
4
<LANGUAGE>eng</LANGUAGE>
5
<TITLE>salesman</TITLE>
6
<TYPE>Scilab function</TYPE>
7
<DATE>September 1996</DATE>
8
<SHORT_DESCRIPTION name="salesman"> solves the travelling salesman problem</SHORT_DESCRIPTION>
10
<CALLING_SEQUENCE_ITEM>cir = salesman(g,[nstac]) </CALLING_SEQUENCE_ITEM>
15
<PARAM_NAME>g</PARAM_NAME>
21
<PARAM_NAME>nstac</PARAM_NAME>
27
<PARAM_NAME>cir</PARAM_NAME>
29
<SP>: integer row vector</SP>
35
<P><VERB>salesman</VERB> solves the travelling salesman problem. <VERB>g</VERB> is a directed
36
graph; <VERB>nstac</VERB> is an optional integer which is a given bound for
37
the allowed memory size for solving this problem. Its value is 100*n*n by
38
default where n is the number of nodes.</P>
42
ta=[2 1 3 2 2 4 4 5 6 7 8 8 9 10 10 10 10 11 12 13 13 14 15 16 16 17 17];
43
he=[1 10 2 5 7 3 2 4 5 8 6 9 7 7 11 13 15 12 13 9 14 11 16 1 17 14 15];
44
g=make_graph('foo',0,17,ta,he);
45
g('node_x')=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642];
46
g('node_y')=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301];
47
g('node_diam')=[1:(g('node_number'))]+20;
49
g1=make_graph('foo1',1,17,[ta he],[he ta]);
51
g1('edge_length')=5+round(30*rand(1,m));
53
ii=find(cir > edge_number(g));
54
if(ii <> []) then cir(ii)=cir(ii)-edge_number(g);end;