{"componentChunkName":"component---src-templates-blog-post-js","path":"/minimum-spanning-tree/","result":{"data":{"site":{"siteMetadata":{"title":"Undefined"}},"mdx":{"id":"617304a6-e19c-5401-bdf9-b0bb41e604c4","excerpt":"What's Minimum Spanning Tree (MST)? The Minimum Spanning Tree (MST) is a subset of edges. The edges has following characteristics: Connect all the vertices…","body":"function _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\n/* @jsxRuntime classic */\n\n/* @jsx mdx */\nvar _frontmatter = {\n  \"title\": \"Find the Minimum Spanning Tree (MST)\",\n  \"date\": \"2021-04-12T22:12:03.284Z\",\n  \"description\": \"\",\n  \"tags\": [\"Algorithm\"],\n  \"visible\": false\n};\nvar layoutProps = {\n  _frontmatter: _frontmatter\n};\nvar MDXLayout = \"wrapper\";\nreturn function MDXContent(_ref) {\n  var components = _ref.components,\n      props = _objectWithoutProperties(_ref, [\"components\"]);\n\n  return mdx(MDXLayout, _extends({}, layoutProps, props, {\n    components: components,\n    mdxType: \"MDXLayout\"\n  }), mdx(\"h2\", null, \"What\\u2019s Minimum Spanning Tree (MST)?\"), mdx(\"p\", null, mdx(\"img\", _extends({\n    parentName: \"p\"\n  }, {\n    \"src\": \"https://upload.wikimedia.org/wikipedia/commons/thumb/d/d2/Minimum_spanning_tree.svg/600px-Minimum_spanning_tree.svg.png\",\n    \"alt\": \"mst\"\n  }))), mdx(\"p\", null, \"The Minimum Spanning Tree (MST) is a subset of edges. The edges has following characteristics:\"), mdx(\"ul\", null, mdx(\"li\", {\n    parentName: \"ul\"\n  }, \"Connect all the vertices together.\"), mdx(\"li\", {\n    parentName: \"ul\"\n  }, \"Have minimum total edge weight.\")), mdx(\"h2\", null, \"Algorithms\"), mdx(\"h2\", null, \"Example\"), mdx(\"p\", null, \"Leetcode 1584\"), mdx(\"p\", null, \"Reference:\"), mdx(\"ul\", null, mdx(\"li\", {\n    parentName: \"ul\"\n  }, mdx(\"a\", _extends({\n    parentName: \"li\"\n  }, {\n    \"href\": \"https://en.wikipedia.org/wiki/Minimum_spanning_tree\"\n  }), \"https://en.wikipedia.org/wiki/Minimum_spanning_tree\"))));\n}\n;\nMDXContent.isMDXComponent = true;","frontmatter":{"title":"Find the Minimum Spanning Tree (MST)","date":"April 12, 2021","description":"","tags":["Algorithm"]},"fields":{"langKey":"en","directoryName":"minimum-spanning-tree","slug":"minimum-spanning-tree"}}},"pageContext":{"slug":"minimum-spanning-tree","langKey":"en","previous":{"fields":{"langKey":"en","directoryName":"designing-a-url-shortening-service-like-tiny-url","slug":"designing-a-url-shortening-service-like-tiny-url"},"frontmatter":{"title":"Designing a url shortening service like tiny url"}},"next":{"fields":{"langKey":"en","directoryName":"the-k-largest-smallest-elements","slug":"the-k-largest-smallest-elements"},"frontmatter":{"title":"The top k elements in array"}},"translations":["en"]}},"staticQueryHashes":["2841359383"]}