Introduction to graph theory in computer science – free online course

0
Certificate

Paid

Language

Level

Intermediate

Access

Free

Last updated on May 9, 2026 10:54 pm

Learn how to solve many everyday problems efficiently with this free course on graph theory. It covers key algorithms and different types of trees using video.

Add your review

This free online certificate course will introduce you to graph theory. The world is full of diverse problems, some of which are mathematical, scientific, business or even domestic in nature. The best way out of these problems is to get optimal solutions. This course has been designed to take you on a step-by-step journey into the world of graphs (using computer science) and to help you solve some everyday problems using graph theory.

What You Will Learn In This Free Course

  • List and explain the types of graphs…
  • Outline some common problems in grap…
  • Discuss the features of the Breadth-…
  • Describe the different types of tree…
  • List and explain the types of graphs and identify the key differences between them
  • Outline some common problems in graph theory, citing the solution algorithms for each
  • Discuss the features of the Breadth-First Search (BFS) algorithm
  • Describe the different types of trees
  • Outline the steps involved in the Bellman-Ford (BF) algorithm
  • Explain the process of rebuilding the level graph and finding the blocking flow when using Dinic’s algorithm
  • Introduction to Graph Theory

    This module will introduce you to graph theory. A simple answer to the question: What is a graph? will be provided. The module goes further to explain the four types of graphs and their differences.

    Understanding Trees

    In this module, you will learn about the meaning of trees from the computer science perspective. You will also learn about isomorphism in trees as well as how to find the Lowest Common Ancestor (LCA) of trees.; Module

    Algorithms in Graph Theory

    In this module, we will be taking a look at some of the algorithms that can be used to solve the common problems in graph theory. We will examine Topological Sort, Bellman Ford and Floyd Warshall, Tarjan’s Strongly Connected Component amongst others.

    Travelling Salesman Problem

    In this module, you will learn what the Travelling Salesman Problem (TSP) is and the several algorithms that can be used to tackle this problem. The module discusses the Brute Force solution and the Dynamic Programming solution’s approach to solving the (TSP).

    Network Flow

    In this module, we will be looking at Network Flows. This module will cover important algorithms under network flow such as Max Flow Ford Fulkerson, Bipartite Matching, Edmonds Karp Algorithm, Capacity Scaling and Dinic’s Algorithm.

    Course assessment

    User Reviews

    0.0 out of 5
    0
    0
    0
    0
    0
    Write a review

    There are no reviews yet.

    Be the first to review “Introduction to graph theory in computer science – free online course”

    ×

      Your Email (required)

      Report this page
      Introduction to graph theory in computer science – free online course
      Introduction to graph theory in computer science – free online course
      LiveTalent.org
      Logo
      LiveTalent.org
      Privacy Overview

      This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.