File: salesman.sci

package info (click to toggle)
scilab 2.6-4
  • links: PTS
  • area: non-free
  • in suites: woody
  • size: 54,632 kB
  • ctags: 40,267
  • sloc: ansic: 267,851; fortran: 166,549; sh: 10,005; makefile: 4,119; tcl: 1,070; cpp: 233; csh: 143; asm: 135; perl: 130; java: 39
file content (26 lines) | stat: -rw-r--r-- 651 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
 
function [cir]=salesman(g,nstac)
// Copyright INRIA
[lhs,rhs]=argn(0)
n=g('node_number');
if rhs>2|rhs<1 then 
  error(39)
elseif rhs==1 then
  nstac=100*n*n
end
// check graph
if(g('directed')<>1) then 
  error('The graph must be directed')
end
check_graph(g);
// check nstac
if nstac<1 then
  error('The second argument must be positive')
end
m=arc_number(g);
u=g('edge_length');ta=g('tail');he=g('head');
uu=sparse([ta' he'],g('edge_length')',[n,n]);
lsup=1000*n*max(g('edge_length'));
uu1=sparse([ta' he'],lsup*ones(1,m)',[n,n]);
a=full(uu);a=a+100000-uu1;
s=m6visitor(n,a,nstac);s=[s s(1)]
if(s <> []) then cir=nodes_2_path(s,g);else cir=[];end;