86. Rekursiv: barcha erishish mumkin bo'lgan juftliklar
QiyinYo'nalishlar edges jadvalida. Bevosita yoki bilvosita bog'langan barcha
juftliklarni toping.
Ustunlar: from_node, to_node. Takroriy juftliklar bo'lmasin.
Saralash: from_node, keyin to_node — ikkalasi alifbo.
💡 Maslahat: grafda sikl bor. UNION ALL o'rniga UNION ishlatsangiz,
takroriy qatorlar yo'qoladi va rekursiya to'xtaydi.
Jadval: edges
| Ustun | Turi |
|---|---|
| from_node | VARCHAR |
| to_node | VARCHAR |
Namuna ma'lumotlar
sample
edges
| from_nodeVARCHAR(20) | to_nodeVARCHAR(20) |
|---|---|
| A | B |
| B | C |
Kutilgan natija
| to_node | from_node |
|---|---|
| B | A |
| C | A |
| C | B |
sample-full
edges
| from_nodeVARCHAR(20) | to_nodeVARCHAR(20) |
|---|---|
| A | B |
| B | C |
| C | D |
| D | B |
| E | F |
| F | G |
| H | A |
Kutilgan natija
| to_node | from_node |
|---|---|
| B | A |
| C | A |
| D | A |
| B | B |
| C | B |
| D | B |
| B | C |
| C | C |
| D | C |
| B | D |
| C | D |
| D | D |
| F | E |
| G | E |
| G | F |
| A | H |
| B | H |
| C | H |
| D | H |
sample-extra
edges
| from_nodeVARCHAR(20) | to_nodeVARCHAR(20) |
|---|---|
| B | C |
| C | B |
| F | F |
| F | B |
Kutilgan natija
| to_node | from_node |
|---|---|
| B | B |
| C | B |
| B | C |
| C | C |
| B | F |
| C | F |
| F | F |
O'xshash masalalar
Konsol
Natijani ko'rish uchun so'rovni ishga tushiring.