• 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

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Circular Linked List

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Connect n ropes with minimum cost

Find next greater number with same set of digits

Find min element in Sorted Rotated Array (Without Duplicates)

Reliance Jio Software Developer Interview Experience

Printing Longest Common Subsequence

Given a string, find the first character which is non-repetitive

Python Dictionaries

Maximum path sum between two leaves

CodeChef Code SGARDEN

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Facebook Interview Question : Interleave List

25 horses 5 tracks Find 3 fastest puzzle

Leetcode: Merge Intervals

Stock Buy Sell to Maximize Profit

Mirror of Tree

flattens 2 D linked list to a single sorted link list

Flipkart SDET Interview Experience

Maximum size of square sub matrix with all 1’s in a binary matrix

SAP Off Campus Hiring_ March 2015 Verbal Skills

Max Sum in circularly situated Values

Skiing on Mountains Matrix

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Adobe Interview Questions 8 month Exp

SAP Off Campus Hiring_ March 2015 Computer Skills

C++ OOPs Part1

Find the smallest window in a string containing all characters of another string

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Copyright © 2026 · Genesis Framework · WordPress · Log in