Graph Theory
Simply Easy Learning
-
-
Graph Theory
1 Lectures-
Graph Theory And It's Application - Getting Started
01:48Preview
-
Graph Theory And It's Application - Getting Started
-
Graph Theory Introduction
3 Lectures -
Graph Theory Fundamentals
7 Lectures-
Graph - Degree of a Vertex
03:25Preview
-
Graph - In-Degree and Out-Degree
03:35
-
Graph - Theorem on Degree of Vertices
03:08
-
Graph - Articulation Point Definition
03:02
-
Graph - Exercise on Articulation Point
02:19
-
Graph - Adjacency and Adjacent Vertices
02:05
-
Graph - Multigraph
01:31
-
Graph - Degree of a Vertex
-
Graph Basic Properties
2 Lectures-
Graph - Eccentricity of a Vertex
01:41
-
Graph - Radius and Diameter
02:26
-
Graph - Eccentricity of a Vertex
-
Types of Graph
12 Lectures-
Graph Types - Introduction
02:54Preview
-
Graph Types - Connected and Disconnected
02:13
-
Graph Types - Directed and Undirected Graph
03:43
-
Graph Types - Regular and Complete
03:56
-
Graph Types - Regular Graph
01:39
-
Graph Types - Complete Graph
03:26
-
Graph Types - Sub-Graph
02:21
-
Graph Types - Bipartite Graph
05:21
-
Graph Types - Complement of a Graph
01:50
-
Undirected Graph - GATE Exercise 1
01:49
-
Undirected Graph - GATE Exercise 2
02:35
-
Undirected Graph - GATE Exercise 3
01:29
-
Graph Types - Introduction
-
Trees
6 Lectures-
Spanning Trees
02:34Preview
-
Kirchhoff’s Matrix Tree Theorem
04:43
-
Minimum Cost Spanning Trees
03:27
-
Circuit Rank
01:57
-
Minimum Spanning Tree - GATE Exercise 1
03:26
-
Minimum Spanning Tree - GATE Exercise 2
03:50
-
Spanning Trees
-
Graph Coloring
3 Lectures-
Vertex Coloring and Chromatic Number
02:34
-
Graph Coloring Problem
11:02
-
Graph Coloring Algorithm
09:24
-
Vertex Coloring and Chromatic Number
-
Graph Isomorphic
2 Lectures-
Isomorphic Graphs
06:58
-
Homomorphism
02:19
-
Isomorphic Graphs
-
Graph Traversibility
7 Lectures-
Graph Traversals Introduction
02:29Preview
-
Graph Traversability Euler’s Path And Euler’s Circuit
02:58
-
Graph Traversability Hamiltonian Graph and Hamiltonian Cycle
03:46
-
Travelling Salesman Problem
07:38
-
Travelling Salesman Problem Example
09:13
-
Problem on Hamiltonian Cycles
03:46
-
Algorithm For Hamiltonian Cycles
11:10
-
Graph Traversals Introduction
-
Graph Representation Techniques
7 Lectures-
Graph Representation Techniques Introduction
02:06
-
Graph Representation Techniques Adjacency Matrix
03:26
-
Graph Representation Techniques Incidence Matrix
05:27
-
Graph Representation Techniques Sequential Representation
04:43
-
Graph Representation Techniques Adjacency List
05:24
-
Graph Representation Techniques Orthogonal List
03:07
-
Graph Representation Techniques Adjacency Multi List
05:12
-
Graph Representation Techniques Introduction
-
Algorithm and Complexity Analysis
8 Lectures-
What Is an Algorithm?
03:22
-
Space and Time Complexity of an Algorithm
06:39
-
Time Complexity Big-Oh Notation
04:04
-
Time Complexity Big-Omega Notation
03:59Preview
-
Time Complexity Big-Theta Notation
04:42
-
Asymptotic Notations - GATE Exercise 1
01:54
-
Asymptotic Notations - GATE Exercise 2
02:34
-
Exercise on Time Complexity
03:00
-
What Is an Algorithm?
-
Algorithm and Classification
13 Lectures-
Algorithm Classification Introduction
03:08
-
Algorithm Classification Simple Recursive Algorithm
03:12
-
Definition of Recursion
09:01
-
Recursion - GATE Exercise 1
03:01
-
Recursion - GATE Exercise 2
04:10
-
Algorithm Classification Back Tracking Algorithm
04:17
-
Algorithm Classification Divide and Conquer
02:17
-
Algorithm Classification Dynamic Programming
03:14
-
Algorithm Classification Greedy Algorithm
06:25
-
A Sample Greedy Algorithm
05:43Preview
-
Algorithm Classification Branch and Bound
05:09
-
Algorithm Classification Brute Force
03:41
-
Algorithm Classification Randomized Algorithm
01:48
-
Algorithm Classification Introduction
-
Graph Theory Algorithm
26 Lectures-
Depth First Search Algorithm on Undirected Graph
04:36
-
Depth First Search Algorithm on Undirected Graph Example
08:43
-
Breadth First Search Algorithm
05:15
-
Breadth First Search Algorithm Example
06:44
-
Algorithm To Calculate Number of Components of a Graph
06:12
-
Comparison and Complexity of DFS and BFS Algorithms
06:20
-
Exercise on BFS Algorithm
07:28
-
Prim’s Algorithm to Find Minimum Spanning Tree
05:21
-
Prim’s Algorithm to Find Minimum Spanning Tree Example
05:14
-
Kruskal’s Algorithm to Find Minimum Spanning Tree
05:38
-
Kruskal’s Algorithm to Find Minimum Spanning Tree Example
06:54
-
Comparison and Complexity of Prim’s and Kruskal’s Algorithms
09:08
-
Exercise on Prim’s Algorithm
07:06
-
Kruskal’s Algorithm - GATE Exercise 1
03:59
-
Kruskal’s Algorithm - GATE Exercise 2
03:38
-
Floyd’s Algorithm to Find Cost Matrix
04:49
-
Floyd’s Algorithm To Find Cost Matrix Example
05:33
-
Warshall’s Algorithm to Find Path Matrix
06:06
-
Warshall’s Algorithm to Find Path Matrix Example
04:38
-
Dijkstra’s Algorithm For All Pair Shortest Path
06:52Preview
-
Dijkstra’s Algorithm For All Pair Shortest Path Example
10:23
-
Ford-Fulkerson Algorithm For Maximum Flow Problem
09:04
-
Ford-Fulkerson Algorithm For Maximum Flow Problem Example
13:12
-
Ford-Fulkerson Algorithm For Maximum Flow Problem Complexity
02:25
-
Bellman Ford Algorithm to Calculate Shortest Paths
06:12
-
Bellman Ford Algorithm to Calculate Shortest Paths Example
10:57
-
Depth First Search Algorithm on Undirected Graph
-
Graph Theory
-
Description
This tutorial offers an introduction to the fundamentals of graph theory. It is in a very reader-friendly tutorial style. It covers the types of graphs, their properties, different terminologies, trees, graph traversability, the concepts of graph colouring, different graph representation techniques, concept of algorithms and different graph theory based algorithms.
Audience
This tutorial has been designed for students who want to learn the basics and algorithms of Graph Theory. Graph Theory has a wide range of applications in engineering and hence, this tutorial will be quite useful for readers who are into Language Processing or Computer Networks, physical sciences and numerous other fields.
-
Preview
Preview Videos
- Graph Theory And It's Application - Getting Started
- Definition of Data Structure
- Classification of Data Structure
- Graph - Degree of a Vertex
- Graph Types - Introduction
- Spanning Trees
- Graph Traversals Introduction
- Time Complexity Big-Omega Notation
- A Sample Greedy Algorithm
- Dijkstra’s Algorithm For All Pair Shortest Path
7 hours
97 Lectures
Lifetime Access
30-Days Money Back Guarantee
You Save
Sample Certificate
