| # Ozan Irsoy, 2013 | |
| # Graph factorization. | |
| # W: adjacency matrix | |
| # m: # clusters (# vertices in U) | |
| gfact = function(W, m) { | |
| n = dim(W)[1] | |
| H = matrix(runif(n*m,1,2),n,m) | |
| L = diag(runif(m,1,2)) | |
| #include <iostream> | |
| #include <vector> | |
| #include <map> | |
| #include <cmath> | |
| using namespace std; | |
| // Hashed array | |
| template <class T> | |
| class HashedArray |
| # Given a binary tree, this routine computes new coordinates for visualization purposes | |
| # (reduces overlap between nodes). | |
| # ix (paix) should be np.arrays that have integer indices for nodes (parent nodes). | |
| # paix of root should be -1. | |
| # depth is a np.array with integer value of the depth, and | |
| # coords is 2d initial coordinates of each node. | |
| # It works as follows, as a physics simulation: | |
| # - y coordinates are fixed by looking at the depth (not free). |
The latest beta (3.5) includes separate color settings for light & dark mode. Toggling dark mode automatically switches colors.
Vist iTerm2 homepage or use brew install iterm2-beta to download the beta. Thanks @stefanwascoding.
switch_automatic.py to ~/Library/ApplicationSupport/iTerm2/Scripts/AutoLaunch with: