Reputation
70,980
Next tag badge:
570/400 score
73/80 answers
Badges
5 172 393
Newest
 Nice Answer
Impact
~822k people reached

8h
comment Efficiently find all connected subgraphs
To find connected subgraphs of size $k$, you could start from an arbitrary vertex, then traverse the graph along edges in all possible ways until you have reached $k-1$ other vertices. These are all good solutions. Then remove the starting vertex (as we have already found all connected subgraphs containing it) and repeat the procedure with another vertex.
8h
comment Efficiently find all connected subgraphs
@DanielLichtblau I think he means that for the connected graph 1 - 2 - 3, the subgraphs induced by (1, 2) and (2, 3) are good solutions, but (1, 3) is not. I'd expect a huge number of solutions, which makes efficiency dubious ... but it's not an uninteresting problem.
1d
comment VertexDelete not working on graph with VertexWeight
Please report this to Wolfram.
1d
comment VertexDelete not working on graph with VertexWeight
I can confirm the problem on OS X 10.10.3, Mma 10.1.0. There was a similar problem with EdgeWeight in 10.0, which got fixed.
2d
awarded  Nice Answer
2d
awarded  Nice Question
2d
comment Making Mathematica function files like in MATLAB
Why do you want to separate each function out into its own file? This is really just an idiosyncrasy (and limitation) of MATLAB. You don't need to do it when you use other languages.
May
26
comment How to send an “end-of-file” marker to a process object's standard input?
@MikeLimaOscar Sounds like an answer!
May
26
asked How to send an “end-of-file” marker to a process object's standard input?
May
26
revised Does RunProcess work on Chinese Windows?
edited tags
May
26
revised How to call rsync from Mathematica?
edited tags
May
25
answered How to force evaluation on the right of an @ operator?
May
25
comment How to force evaluation on the right of an @ operator?
Instead of f @ (g @@ x) you might want to use f @ Apply[g] @ x, which is more verbose, but does save parentheses. Unfortunately when you use pure functions (...& notation), very often it's still necessary to use parens because & has a low precedence and tends to "eat" everything preceding it.
May
25
comment How to force evaluation on the right of an @ operator?
No, there isn't, because @ has a very high precedence. The issue is with precedences. Should x OP1 y OP2 z be interpreted as (x OP1 y) OP2 z or x OP1 (y OP2 z)? In Mathematica it's the latter only if OP2 has a higher precedence than OP1.
May
25
comment RandomGraph with specific constraints
What I was trying to ask if whether you need all graphs that satisfy the constraints to be sampled with equal probability. I'm assuming yes.
May
25
comment RandomGraph with specific constraints
When you say "random graph" do you mean "just give me some graph with these properties" or do you mean true uniform sampling from the set of all graphs satisfying your constraints? The latter is a much harder problem. Also, can you list your constraints concisely and clearly?
May
25
comment How can I make Plot show the plot while it's computing it?
What do you need this for? I think it would be easier to re-implement adaptive plotting (not hard for 1D) than to try to coerce Plot to do this for you.
May
25
comment How does Mathematica calculate its AdjacencyMatrix[ ] and VertexDegree[ ]
Vertex ordering is completely unrelated to the names of the vertices. Vertices can be any expression, not just numbers. Never assume that numerical vertices are ordered from smallest to greatest. Use VertexIndex and VertexList to relate the index of a vertex to the vertex itself. In practice, Mathematica puts the vertices in the order you first specify them (as they appear in the edge list in your example), but never count on this as there's no guarantee and I won't be surprised if future versions change this.
May
25
awarded  Good Answer
May
24
awarded  Favorite Question