This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2015-11-14 22:02:14 -0800 | |
python | |
-c | |
import setuptools, tokenize | |
__file__ = 'setup.py' | |
exec(compile(getattr(tokenize, 'open', open)(__file__).read() | |
.replace('\r\n', '\n'), __file__, 'exec')) | |
--no-user-cfg | |
install |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python | |
from __future__ import division,print_function | |
from numpy import * | |
import scipy.sparse | |
import scipy.sparse.csgraph | |
""" | |
Consider approximate disjoint diagonal cycles concentric around the origin. | |
We can arrange that cycle C_n has radius O(n) and length O(n). |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python | |
from __future__ import division | |
from numpy import * | |
def iter(n,boundary): | |
p = ones(n) | |
b = boundary.copy() | |
j = 3*arange(1,n) | |
for i in xrange(1000): |
NewerOlder