• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Spanning Tree

March 1, 2014 by Dhaval Dave

In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree that includes all of the vertices and some or all of the edges of G.

Defination

A tree is a connected undirected graph with no cycles. It is a spanning tree of a graph G if it spans G (that is, it includes every vertex of G) and is a subgraph of G (every edge in the tree belongs to G). A spanning tree of a connected graph G can also be defined as a maximal set of edges of G that contains no cycle, or as a minimal set of edges that connect all vertices.

Similar Articles

Filed Under: problem Tagged With: Graph, tree

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Binary Tree in Java

Count number of ways to reach a given score in a game

strtok()

Password Predictor

Find Percentage of Words matching in Two Strings

Cisco Hiring Event 21st – 22nd Feb 2015

Introduction To Number Theory ( Part 1 )

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Wrong Directions given find minimum moves so that he can reach to the destination

Flipkart Set 1 On Campus with Answers

Practo Hiring Experience

Sequence Finder Dynamic Programming

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Best Java Book | Top Java Programming Book for Beginners

Memory Efficient LinkedList

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Maximum of all subarrays of size k

TicTacToe Game As Asked in Flipkart

Generic Object Oriented Stack with Template

SAP Interview Questions

1014 Practice Question of New GRE – Princeton

Find Pythagorean Triplets in an array in O(N)

Find two non repeating elements in an array of repeating elements

Handle duplicates in Binary Search Tree

Trie Dictionary

Knight Tour Problem (Graph – Breadth First Search)

Word Break Problem

Mirror of Tree

The greedy coins game Dynamic Programming

Maximum sum contiguous subarray of an Array

Copyright © 2026 · Genesis Framework · WordPress · Log in