• 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

SAP Off Campus Hiring_ March 2015 Computer Skills

Printing Longest Common Subsequence

Naurki.com Security Breach

Coin Collection Dynamic Programming

1014 Practice Question of New GRE – Princeton

CodeChef’ RRCOPY

Closed Parentheses checker

Implement LRU Cache

Apriori algorithm C Code Data Mining

Introduction To Number Theory ( Part 1 )

Longest Increasing Subsequence

SAP Off Campus Hiring_ March 2015 Verbal Skills

Reverse a Linked List in groups of given size

Knight Tour Problem (Graph – Breadth First Search)

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

Hackerearth : Counting Subarrays

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

LeetCode: Container With Most Water

25 horses 5 tracks Find 3 fastest puzzle

Difference between a LinkedList and a Binary Search Tree BST

Binary Tree in Java

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Singly linked list

simple sql injection

Sort an array according to the order defined by another array

BFS (Breath First Search)

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

K’th Largest Element in BST when modification to BST is not allowed

Printing intermediate Integers between one element & next element of array

Print Power Set of a Set

Copyright © 2026 · Genesis Framework · WordPress · Log in