Tagged Questions
10
votes
2answers
196 views
Why is NeighborhoodGraph so slow?
To get neighboring vertices I first tried:
gg = GridGraph[{10, 10, 10, 10}];
VertexList[NeighborhoodGraph[gg, 1, 1]] // AbsoluteTiming
{5.539308, {1, 2, 11, ...
2
votes
1answer
195 views
Speed up iterated manipulations of a graph / table
I am trying to generate a version of Watts' model of cascading shocks to a network following the discussion on p. 20-25 of this article.
The basic premise is to use the ...
7
votes
1answer
409 views
How to speed up Minimum Spanning Tree algorithm?
How to speed up MST algorithm? I work with graphs and I have adopted Prim's algorithm for my needs, from here.
The graphs which I use are very dense (number of vertexes: $V=500$ and every vertex is ...
32
votes
2answers
9k views
How can I use Mathematica's graph functions to cheat at Boggle?
This question is inspired by a Stack Overflow question that I decided to solve using Mathematica. In addition to Mathematica, I thought I'd use some of the new version's graph-related functionality, ...
