graphs Archives - PrepForTech

How to detect negative edge weight cycle in a graph ?

Pratik Singhal | July 6, 2020

Given a directed weighted graph with possibly negative edge weights, how to detect the presence of a negative edge weight cycle in the graph ? What is a negative edge weight cycle ? The weight of a cycle in a graph is the sum of all the edge weights in the cycle for the graph. … How to detect negative edge weight cycle in a graph ?

Topological Sorting

Pratik Singhal | June 27, 2020

In graph theory, a topological sorting of a directed graph is a linear ordering of vertices of graph such that if there is a directed edge uv from vertex u to vertex v, u comes before v in the ordering. Note: Graph must be directed and acyclic. Example Input Expected Output 0 2 1 3 Pseudocode Implementation in Python

graphs

How to detect negative edge weight cycle in a graph ?

Topological Sorting

Data Structures

Resources

Interview Topics

Company Wise Interview Questions

Follow Us