File: FNgcd.html

package info (click to toggle)
libtsp 3r0-1
  • links: PTS
  • area: non-free
  • in suites: potato, woody
  • size: 5,096 kB
  • ctags: 1,798
  • sloc: ansic: 14,464; sh: 1,217; makefile: 182
file content (44 lines) | stat: -rw-r--r-- 836 bytes parent folder | download
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
<HTML>
<HEAD>
<TITLE>TSP (libtsp/FN) - FNgcd</TITLE>
</HEAD>
<BODY BGCOLOR="#FFFACD">
<H2>FNgcd</H2>
<HR>
<H4>Routine</H4>
<DL>
<DT>
long int FNgcd (long int u, long int v)
</DL>
<H4>Purpose</H4>
<DL>
<DT>
Find the greatest common divisor of two integer values
</DL>
<H4>Description</H4>
This function finds the (positive) greatest common divisor of two integer
values.  If both elements are zero, the greatest common divisor is set to
zero.
<H4>Parameters</H4>
<DL>
<DT>
&lt;-  long int FNgcd
<DD>
Greatest common divisor of u and v
<DT>
 -&gt; long int u
<DD>
First integer value
<DT>
 -&gt; long int v
<DD>
Second integer value
</DL>
<H4>Author / revision</H4>
P. Kabal  Copyright (C) 1996
/ Revision 1.1  1996/07/05
<P>
<HR>
Main Index <A HREF="../libtsp.html">libtsp</A>
</BODY>
</HTML>