Unanswered Questions
293 questions with no upvoted or accepted answers
18
votes
0
answers
386
views
GridGraph[{6,6,6}] crashes—can you reproduce this?
Bug introduced in 11.3 and fixed in 12.0
Occasionally, I see a kernel crash with GridGraph[{6,6,6}]. It is not easy to trigger. Sometimes it may require as many as ...
11
votes
0
answers
460
views
FindMaximumFlow generates a weird result
Bug introduced in 10.0 and persisting through 12.1
Try the following program:
...
11
votes
0
answers
1k
views
How to generate a random flow graph?
A flow graph is a rooted directed graph that the root reaches all other vertices.
I need to generate a random flow graph in Mathematica. My idea is to use ...
10
votes
0
answers
257
views
FindVertexCut & FindEdgeCut
Bug introduced in 9.0 and persisting through 12.1
FindVertexCut is new in 9.0.
Note: Before 10.3, the bug can be reproduced by wrapping the first argument in <...
10
votes
0
answers
342
views
More efficient way to generate lattice graph with edges between visible vertices?
Given a nXn lattice, I need to generate the graph such that there is an edge between two vertices iff they are directly "visible" to each other, i.e., there is no vertex between them.
I'm ...
10
votes
0
answers
189
views
Graph: PropertyValue changes and Dynamic
I almost never work with Graph in Mathematica but lately I helped someone with it. For this, I tried to make an animation using ...
9
votes
0
answers
307
views
Improving label collisions for Tree/Graph?
Historically, MMA has never handled label collisions well, but recently they added some improvements here via things like Callout. I want to fix ImageSize but still ...
8
votes
0
answers
112
views
Probable bug in EdgeAdd when adding edges to multigraphs
Bug introduced in 10.0 or earlier and fixed in 12.1
M10.0.2 and M10.3 return a wrong result without errors. M11.0 and M12.0 issue a flood of messages and sometimes crash.
I am using Mathematica 12.0, ...
8
votes
0
answers
712
views
How to do a Sankey Diagram with multiple notes in Mathematica
I want to create a Sankey Diagram that looks like this:
I read the post on How to Make a Sankey Diagram, but I can't seem to make the right adjustments to get the diagram I want. Is there a way to do ...
7
votes
0
answers
795
views
Hopcroft's Algorithm for Minimization of Deterministic Finite State Automaton
Background
Given a deterministic finite state automaton, Hopcroft's algorithm is a $O(n \log(n))$ algorithm for finding an automaton that generates the same language with a minimal number of vertices....
7
votes
0
answers
133
views
What method does FindGraphCommunities use with Method -> "Centrality"?
Cross-posted to W Community
I would like to know what method FindGraphCommunities uses with the option Method -> "Centrality" ...
7
votes
0
answers
85
views
Is it possible to extend the graph layout framework with our own methods?
The GraphLayout specification can take complex forms, where we can specify separate vertex layouts, edge layout and packing layouts. Often each of these takes more ...
7
votes
0
answers
166
views
Functionality of FindMaximumFlow
I know that the superseeded function NetworkFlow (needs Combinatorica) uses Goldberg-Tarjan's Push-Relabel-Algorithm but i cant find any information on Mathematica's built-in-function (...
7
votes
0
answers
135
views
VertexDelete not working on graph with VertexWeight
Bug introduced in 10.0 and fixed in 10.3
Good afternoon,
I have observed an "unexpected behaviour" with VertexDelete and a graph with vertex weights. This is a minimal working example:
OK
...
7
votes
0
answers
281
views
Using Graph to cull correlated lists
I have a set of lists that represent molecular descriptors. I need to identify which descriptors are highly correlated and eliminate the correlated pairs. I can represent the connectivity by ...