decomposition

I have a graph g in python-igraph. I can get a VertexCluster community structure with the following: community = g.community_multilevel() community.membership gives me a list of the group membership of all the vertices in the graph. My question is really simple but I haven't found a python-specific answer on SO. How can I plot the graph with visualization of its community structure? Preferably to PDF, so something like layout = g.layout("kk") plot(g, "graph.pdf", layout=layout) # Community detection? Thanks a lot. You can pass your VertexClustering object directly to the plot function; it will

I am trying to write a C code to generate all possible partitions (into 2 or more parts) with distinct elements of a given number. The sum of all the numbers of a given partition should be equal to the given number. For example, for input n = 6 , all possible partitions having 2 or more elements with distinct elements are: 1, 5 1, 2, 3 2, 4 I think a recursive approach should work, but I am unable to take care of the added constraint of distinct elements. A pseudo code or a sample code in C/C++/Java would be greatly appreciated. Thanks! Edit: If it makes things easier, I can ignore the

I was solving a programming exercise and came across a problem over which I am not able to satisfactorily find a solution. The problem goes as follows: Print all unique integer partitions given an integer as input. Integer partition is a way of writing n as a sum of positive integers. for ex: Input=4 then output should be Output= 1 1 1 1 1 1 2 2 2 1 3 4 How should I think about solving this problem? I was wondering about using recursion. Can anyone provide me an algorithm for this question? Or a hint towards solution. any explanation for such kind of problems is welcome. (I am a beginner in

I am trying to implement my own LU decomposition with partial pivoting. My code is below and apparently is working fine, but for some matrices it gives different results when comparing with the built-in [L, U, P] = lu(A) function in matlab Can anyone spot where is it wrong? function [L, U, P] = lu_decomposition_pivot(A) n = size(A,1); Ak = A; L = zeros(n); U = zeros(n); P = eye(n); for k = 1:n-1 for i = k+1:n [~,r] = max(abs(Ak(:,k))); Ak([k r],:) = Ak([r k],:); P([k r],:) = P([r k],:); L(i,k) = Ak(i,k) / Ak(k,k); for j = k+1:n U(k,j-1) = Ak(k,j-1); Ak(i,j) = Ak(i,j) - L(i,k)*Ak(k,j); end end