User Portlet User Portlet

Szabolcs Horvát
Discussions
Mathematica 12.0 brought major positive changes to the handling of vertex and edge properties in `Graph`s. Before, almost all `Graph` processing functions discarded all properties (such as edge weights). If we took a `Subgraph` of a `Graph`, no...
> My colleague reported this issue to Wolfram support back in February. This was actually already reported back in 2012 when RLink came out, and many more times since then. The only conclusion I can draw is that WRI simply has no interest in...
Thanks for the response! The method you used in Sage can be implemented like this with IGraph/M: ``` IGTryUntil[ConnectedGraphQ]@RandomGraph[{20, 20}] ``` This keeps re-trying until `RandomGraph[{20, 20}]` produces a connected result. Of...
That is exactly what I said 6 months ago ... Also, what you installed is *not* MinGW. The tool called MinGW, "Minimalist GNU for *Windows*" is used to compile programs for Windows only.
I am not sure that I understand your last comment ... In my previous post, I showed how to generate all non-isomorphic 8-vertex cacti with the help of `geng` and a custom cactus-testing function. Since then, [the IGraph/M...
If you want to find any clique, not only maximal ones, check out `IGCliques` from the IGraph/M package.
I assume you meant to post something else, but got bitten by that classic Wolfram Community bug where one of the previous posts gets duplicated instead?
It works even if it introduces new vertices. What fails is not the change to the graph but displaying the graph. This is because the number of vertices is part of the GraphLayout specification. Thus any operation that changes the number of vertices...
> What's the best way of distributing a set of closely related functions all of them drawing on a core of helper functions (and each other)? I think that the only good answer to this is that the functions should go into a package. I would not use...
Thank you, this is very valuable!