Skip to main content

New answers tagged

5 votes
Accepted

How to Implement Progressive Cell Coloring in a General Mesh or Tiling?

As suggested by @flinty, use MeshConnectivityGraph and GraphDistance. ...
Domen's user avatar
  • 27.6k
3 votes

Tree edge label visibility and legibility

Since Tree[ ] is still in EXPERIMENTAL in MMA Ver 14.0.0, there seems to be no canonical solution. If you are happy with rotating the edge labels of Graph[ ] instead, the following code might be ...
A. Kato's user avatar
  • 1,460
3 votes

How to Pick Out Strings of a Specified Length

...
ubpdqn's user avatar
  • 62.8k
4 votes

How to Pick Out Strings of a Specified Length

edges = { N500122 -> N5003, N50012 -> N1099, N5003 -> N48059, N5003 -> N22007, N234544 -> N5001, N3010 -> N2111}; A variant of E. Chan-...
eldo's user avatar
  • 81.4k
6 votes

How to Pick Out Strings of a Specified Length

edges = {N500122 -> N5003, N50012 -> N1099, N5003 -> N48059, N5003 -> N22007, N234544 -> N5001, N3010 -> N2111}; Using ...
E. Chan-López's user avatar
2 votes

How to Control StringContainsQ

Select[edges3, LessEqualThan[5]@*StringLength@*SymbolName@*First]
lericr's user avatar
  • 30.4k
3 votes

How to Control StringContainsQ

Assuming that you want Rules where the first argument has a string length of 5 characters. This can be achieved by ...
Daniel Huber's user avatar
  • 53.6k
3 votes

How to Control StringContainsQ

...
Roman's user avatar
  • 48.7k
0 votes

Enumerating labeled graphs on n vertices

The idea suggested by @Szabolics in the comment is easily realized by Subsets[ ]: ...
A. Kato's user avatar
  • 1,460

Top 50 recent answers are included