← Back to branch summary

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

« back to all changes in this revision

Viewing changes to man/eng/metanet/neighbors.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/neighbors.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>neighbors</TITLE>
 
6
  <TYPE>Scilab function</TYPE>
 
7
  <DATE>September 1996</DATE>
 
8
  <SHORT_DESCRIPTION name="neighbors"> nodes connected to a node</SHORT_DESCRIPTION>
 
9
  <CALLING_SEQUENCE>
 
10
    <CALLING_SEQUENCE_ITEM>a = neighbors(i,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</SP>
 
18
        </PARAM_DESCRIPTION>
 
19
      </PARAM_ITEM>
 
20
      <PARAM_ITEM>
 
21
        <PARAM_NAME>g</PARAM_NAME>
 
22
        <PARAM_DESCRIPTION>
 
23
          <SP>: graph list</SP>
 
24
        </PARAM_DESCRIPTION>
 
25
      </PARAM_ITEM>
 
26
      <PARAM_ITEM>
 
27
        <PARAM_NAME>a</PARAM_NAME>
 
28
        <PARAM_DESCRIPTION>
 
29
          <SP>: vector of integers</SP>
 
30
        </PARAM_DESCRIPTION>
 
31
      </PARAM_ITEM>
 
32
    </PARAM_INDENT>
 
33
  </PARAM>
 
34
  <DESCRIPTION>
 
35
    <P><VERB>neighbors</VERB> returns the numbers of the nodes connected with node i for 
 
36
    graph <VERB>g</VERB> (directed or not).</P>
 
37
  </DESCRIPTION>
 
38
  <EXAMPLE>
 
39
<![CDATA[
 
40
ta=[1  6  2  4  7  5  6  8  4  3  5  1];
 
41
he=[2  1  3  6  4  8  8  7  2  7  3  5];
 
42
g=make_graph('foo',1,8,ta,he);
 
43
g('node_x')=[285  284  335  160  405  189  118  45];
 
44
g('node_y')=[266  179   83  176  368  252  64  309];
 
45
show_graph(g);
 
46
a=neighbors(6,g)
 
47
show_nodes(a);
 
48
 ]]>
 
49
  </EXAMPLE>
 
50
  <SEE_ALSO>
 
51
    <SEE_ALSO_ITEM>
 
52
      <LINK>predecessors</LINK>
 
53
    </SEE_ALSO_ITEM>
 
54
    <SEE_ALSO_ITEM>
 
55
      <LINK>successors</LINK>
 
56
    </SEE_ALSO_ITEM>
 
57
  </SEE_ALSO>
 
58
</MAN>