A quick and practical introduction to detecting cycles in a directed graph.
Also find me here:
Baeldung Author
baeldung
This is the standard author on the site. Most articles are published by individual authors, with their own profiles, but when multiple people have a strong contribution, we publish collectively here.
Here's what I've written (so far):
Baeldung on Computer Science
- All
- Machine Learning (45)
- Algorithms (41)
- Networking (40)
- Programming (36)
- Math and Logic (30)
- OS (19)
- Computer Vision (19)
- Artificial Intelligence (18)
- Deep Learning (16)
- Trees (15)
- Data Structures (15)
- Security (14)
- Latex (13)
- Sorting (12)
- Software Architecture (11)
- Core Concepts (10)
- Graphs (8)
- Searching (6)
- Web (4)
- Graph Traversal (4)
- Data Science (4)
- Series (3)
- Path Finding (3)
- Graph Theory (3)
- Concurrency (1)
The Difference Between Asynchronous and Multi-Threading
Filed under Concurrency
Explore the definitions of asynchronous programming and multithreaded programming
Function Parameters: Call by Reference vs Call by Value
Filed under Programming
Explore the concepts of pass by value and pass by reference.
Computing the Diameter of a Network
Filed under Algorithms, Networking
Explore the problem of finding the diameter of a graph.
Cache Write Policy
Filed under OS
Explore various write policies used in caches.
Data Normalization Before or After Splitting a Data Set?
Filed under Machine Learning
A quick and practical guide on when to apply data normalization.
Computer Science Definition of Entropy
Filed under Core Concepts
A comprehensive introduction to Entropy.
Maximum Value of an Integer: Java vs C vs Python
Filed under Programming
Explore the differences between these three top languages in relation to the maximum possible integer value.
Go-Back-N Protocol
Filed under Networking
Learn how the Go-Back-N protocol works for both the sender and the receiver side to ensure reliable data transfer.