Timeline for Select connected subsets of integer pairs?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 6, 2018 at 21:50 | history | edited | Henrik Schumacher | CC BY-SA 4.0 |
deleted 54 characters in body
|
| Nov 6, 2018 at 21:05 | history | edited | Henrik Schumacher | CC BY-SA 4.0 |
added 1310 characters in body
|
| Nov 6, 2018 at 20:42 | comment | added | Henrik Schumacher |
@Rabbit Well, one could fix that by using the selector function Length[#] > 1 &. But I doubt that OP had that in mind...
|
|
| Nov 6, 2018 at 20:37 | comment | added | Rabbit | But G = Graph[{{1, 2}, {1, 3}, {2, 5}, {1, 5}, {6, 7}}]; Select[List @@@ EdgeList[Subgraph[G, #]] & /@ ConnectedComponents[G], Length[#] > 0 &] where {6, 7} shares no elts with others returns the {6, 7} {{{1, 2}, {1, 3}, {2, 5}, {1, 5}}, {{6, 7}}} | |
| Nov 6, 2018 at 16:51 | vote | accept | Kagaratsch | ||
| Nov 6, 2018 at 15:53 | history | edited | Henrik Schumacher | CC BY-SA 4.0 |
added 13 characters in body
|
| Nov 6, 2018 at 15:43 | history | edited | Henrik Schumacher | CC BY-SA 4.0 |
added 477 characters in body
|
| Nov 6, 2018 at 15:37 | history | answered | Henrik Schumacher | CC BY-SA 4.0 |