Trees | Indices | Help |
|
---|
|
|
|||
CrystalPlane Manage a crystal plane object. |
|
|||
int, int, int |
|
|
|||
__doc__ =
|
|||
_version = '$Revision 0.0 $'
|
|
Solve ax + by = gcd(a, b) using the Extended Euclidean Algorithm. Return (1) the greatest common divisor (gcd) of integers a and b and (2) the integer Bezout coefficients x and y.
|
|
__doc__
|
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Thu Aug 6 04:50:17 2015 | http://epydoc.sourceforge.net |