Surya Teja Achanta

This course deals with Implementation of Graphs using Adjacency matrice and Adjacency list,graph traversals and some important graph algorithms.

Programming

English

Data Structures - Graphs

Programming Languages

Data Types & Variables

Basics

C Language

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

Course overview

This lesson is about introduction to Graphs,Graph terminology and applications of Graphs.

Introduction to Graphs

This lesson is about implementation of an Undirected Graph using Adjacent Matrix.

Implementation of a Undirected Graph using Adjacency Matrix

This lesson is about implementation of a Directed graph using an Adjacency Matrix.

Implementation of a Directed Graph using Adjacency Matrix

This lesson is about printing adjacency matrix of Directed,Undirected graphs and implementation of weighted graphs(Directed and Undirected) using Adjacency Matrix.

Printing Adjacency Matrix of Directed and Undirected Graphs

This lesson is about finding degree of each vertex in an undirected graph and finding indegree and outdegree of each vertex in a directed graph using adjacency matrix.

Finding Degree of Each Vertex of a Graph using Adjacency Matrix

This lesson is about Deapth First Traversal of a graph.

Depth First Traversal of a Graph using Adjacency Matrix

This lesson is about Implementation of an undirected graph using Adjacent List and printing the Adjacency list of each vertex.

Implementation of a Undirected graph using Adjacency List

This lesson is about Implementation of a Directed Graph using Adjacency List and printing the adjacency list corresponding to each vertex.

Implementation of a Directed Graph using Adjacency List

This lesson is about Depth First Traversal of a graph using Adjacency List.

Depth First Traversal of a Graph using Adjacency List

This lesson is about finding Degree of each vertex of a graph(both directed and undirected graphs) using Adjacency List.

Finding Degree of Each Vertex of a Graph using Adjacency List

Depth First Traversal of a graph using Adjacency List.

Breadth First Traversal of Graph using Adjacency List

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Storage Classes in C with Important Programs and GATE Questions.

(Hindi) Storage Classes in C: Important Programs and GATE Questions

6+ year working experience in embedded domain.
1 year experience in teaching Embedded C.
passionate about teaching and automotive industry

Debadarshana Parida

In this course, the educator discusses the different data types in C. The course will be beneficial for all Computer Science students.

Data Types in C

I have done MCA from RGPV University bhopal & BCA from DAVV Univ Indore.
I have 7 years of Teaching Experience in Computer Science Subjects.

Hussain Bagwala

This course is about basic fundamentals elements of C language. The course will help you learn the basics of programming.

(Hindi) Fundamentals of C Programming

Sonal 

This course will discuss C Programming and its fundamentals.

Introduction to C Programming

Mechanical Engineer | CODING Skills (C, C++, JAVA, PYTHON,AI,RDBMS)|

Luv Bansal

In this course, Luv Bansal discusses the different operators used in C language. This course will be benefiical for all those who want to learn programming.

(Hindi) Operators in C: Part 2

Anjali Luthra

In this course we will be solving many output questions and MCQs related to Data Structures and C programming. These are very important for competitive exams and interviews during placements.

Lessons

12 lessons • 2h 21m

Invalid Date

NaN

Course overview

Invalid Date

NaN

Introduction to Graphs

Invalid Date

NaN

Implementation of a Undirected Graph using Adjacency Matrix

Invalid Date

NaN

Implementation of a Directed Graph using Adjacency Matrix

Invalid Date

NaN

Printing Adjacency Matrix of Directed and Undirected Graphs

Invalid Date

NaN

Finding Degree of Each Vertex of a Graph using Adjacency Matrix

Invalid Date

NaN

Depth First Traversal of a Graph using Adjacency Matrix

Invalid Date

NaN

Implementation of a Undirected graph using Adjacency List

Invalid Date

NaN

Implementation of a Directed Graph using Adjacency List

Invalid Date

NaN

Depth First Traversal of a Graph using Adjacency List

+ See all lessons