← Back to branch summary

~ubuntu-branches/ubuntu/hoary/scilab/hoary

« back to all changes in this revision

Viewing changes to man/eng/metanet/find_path.xml

  • Committer: Bazaar Package Importer
  • Author(s): Torsten Werner
  • Date: 2005-01-09 22:58:21 UTC
  • mfrom: (1.1.1 upstream)
  • Revision ID: james.westby@ubuntu.com-20050109225821-473xr8vhgugxxx5j
Tags: 3.0-12
http://bugs.debian.org/255869
changed configure.in to build scilab's own malloc.o, closes: #255869

Show diffs side-by-side

added added

removed removed

Lines of Context:
man/eng/metanet/find_path.xml
 
1
<?xml version="1.0" encoding="ISO-8859-1" standalone="no"?>
 
2
<!DOCTYPE MAN SYSTEM "../../manrev.dtd">
 
3
<MAN>
 
4
  <LANGUAGE>eng</LANGUAGE>
 
5
  <TITLE>find_path</TITLE>
 
6
  <TYPE>Scilab function</TYPE>
 
7
  <DATE>September 1995</DATE>
 
8
  <SHORT_DESCRIPTION name="find_path"> finds a path between two nodes</SHORT_DESCRIPTION>
 
9
  <CALLING_SEQUENCE>
 
10
    <CALLING_SEQUENCE_ITEM>p = find_path(i,j,g)  </CALLING_SEQUENCE_ITEM>
 
11
  </CALLING_SEQUENCE>
 
12
  <PARAM>
 
13
    <PARAM_INDENT>
 
14
      <PARAM_ITEM>
 
15
        <PARAM_NAME>i</PARAM_NAME>
 
16
        <PARAM_DESCRIPTION>
 
17
          <SP>: integer, number of start node</SP>
 
18
        </PARAM_DESCRIPTION>
 
19
      </PARAM_ITEM>
 
20
      <PARAM_ITEM>
 
21
        <PARAM_NAME>j</PARAM_NAME>
 
22
        <PARAM_DESCRIPTION>
 
23
          <SP>: integer, number of end node</SP>
 
24
        </PARAM_DESCRIPTION>
 
25
      </PARAM_ITEM>
 
26
      <PARAM_ITEM>
 
27
        <PARAM_NAME>g</PARAM_NAME>
 
28
        <PARAM_DESCRIPTION>
 
29
          <SP>: graph list</SP>
 
30
        </PARAM_DESCRIPTION>
 
31
      </PARAM_ITEM>
 
32
      <PARAM_ITEM>
 
33
        <PARAM_NAME>p</PARAM_NAME>
 
34
        <PARAM_DESCRIPTION>
 
35
          <SP>: row vector of integer numbers of the arcs of the path if it exists</SP>
 
36
        </PARAM_DESCRIPTION>
 
37
      </PARAM_ITEM>
 
38
    </PARAM_INDENT>
 
39
  </PARAM>
 
40
  <DESCRIPTION>
 
41
    <P><VERB>find_path</VERB> returns a path <VERB>p</VERB> from node number <VERB>i</VERB> to
 
42
    node number <VERB>j</VERB> if one exists, and the empty vector <VERB>[]</VERB> otherwise.</P>
 
43
  </DESCRIPTION>
 
44
  <EXAMPLE>
 
45
<![CDATA[
 
46
ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
 
47
he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
 
48
g=make_graph('foo',1,17,ta,he);
 
49
g('node_x')=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642];
 
50
g('node_y')=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301];
 
51
show_graph(g);
 
52
p=find_path(1,14,g);
 
53
edgecolor=1*ones(ta); edgecolor(p)=11*ones(p); g('edge_color')=edgecolor;
 
54
show_graph(g); show_arcs(p);
 
55
 ]]>
 
56
  </EXAMPLE>
 
57
  <SEE_ALSO>
 
58
    <SEE_ALSO_ITEM>
 
59
      <LINK>nodes_2_path</LINK>
 
60
    </SEE_ALSO_ITEM>
 
61
    <SEE_ALSO_ITEM>
 
62
      <LINK>shortest_path</LINK>
 
63
    </SEE_ALSO_ITEM>
 
64
  </SEE_ALSO>
 
65
</MAN>