{"component":{"type":17,"accent_color":7315445,"components":[{"type":10,"content":"-# WikiRNG · Roll of 11/20/2026 · by [Felaxo](https://wikirng.com/u/Felaxo)"},{"type":10,"content":"## [Borůvka's algorithm](https://wikirng.com/roll/4XW1RH)\n*Method for finding minimum spanning trees*"},{"type":10,"content":">>> Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected."},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟦 Obscure · 110,280 SP\n-# Top 17%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 ⌨️ **Source Code** · Obscure · +61,703 SP\n-# Has a code block.\n🟦 🧮 **Equation** · Obscure · +17,541 SP\n-# Has a math formula.\n🟩 🗣️ **All Talk** · Notable · +5,382 SP\n-# Its talk page is bigger than the article.\n🟩 🐚 **Early Days** · Notable · +3,988 SP\n-# Created in 2001 to 2003.\n🟩 🕶️ **Anonymous** · Notable · +3,128 SP\n-# Created by someone who wasn't logged in.\n🟩 ✍️ **Apostrophe** · Notable · +3,115 SP\n-# Title has an apostrophe.\n-# +21 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/4XW1RH"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Bor%C5%AFvka's_algorithm"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}