# User Portlet

Szabolcs Horvát
Discussions
Nice to see a very cool use of MateX!
Can you explain in more details those hoops you feel you need jump through? Surely you do not mean the simple matter of having to use . instead of *?
It seems that wolfram-engine only lists Oracle Java 8 as a valid dependency. This is no longer present in Raspbian Buster. To save users trouble, maybe it would be a good idea to allow opendjk-8 as well? Or does this have known compatibility...
Thanks for the response. Yes, you are correct. I finally noticed too. I kept staring at Germany mostly, which did have a small increase, which is part of the reason why I was confused.
Mathematica 12.0 brought major positive changes to the handling of vertex and edge properties in Graphs. 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.