I am looking a good way to fill up the elements of a lower triangular matrix from a list, in Mathematica. Currently I have the very ugly ...
Do you know If and how can I rewrite the code below in a better form for different values of m,k,l? It is a nested if contitional construct that I want to to check b for all m,k,l, but the code below ...
I'm looking for the fastest way to find all neighbours of a vertex in an undirected Graph. Please improve on the code if possible. ...
I am looking to optimize the following computation. First, some explanations: Explanation I have a directed graph whose adjacency matrix may only contain 1s and 0s. The similarity of nodes i and j ...
I want the fastest way in Mathematica 7 to generate a list of the factors (not prime factors) of an integer into a specified number of terms, with each factor greater than one. For example, 240 into ...
I could use function Intersection, but it returns sorted list. That's why I have to do my own, but it looks too big. I hope it could be done shorter. ...