Final Challenge #2

Lesson 9 of 9 in Coddy's Topological Sort - Graph Algorithms course.

Challenge

Medium

One more challenge, using the topological order.

Write a function named longestPath that takes n and the flat edges array of a DAG (directed, acyclic), and returns the number of edges on the longest path in the graph.

For example, on a chain 0->1->2->3 the longest path has 3 edges.

Try it yourself

#include <stdlib.h>

int longestPath(int n, int* edges, int edges_size) {
    // Write code here
    return 0;
}

All lessons in Topological Sort - Graph Algorithms

1Introduction

Introduction Motivation

2The Algorithm

How it works?Pseudo Code Implementation (Part 1)Implementation (Part 2)

Time and Space Complexity

3Final Challenges

Final Challenge #1Final Challenge #2