A quick and practical guide to determining if a graph is a tree.
Also find me here:
Baeldung Author
Said Sryheni
I have a master's degree in software engineering. Currently, I'm working as a full-stack developer with +6 years of experience. I like algorithms and data structures, in addition to solving complex problems by writing clean and reliable code.
Here's what I've written (so far):
Baeldung on Computer Science
- All
- Algorithms (30)
- Math and Logic (11)
- Searching (9)
- Path Finding (9)
- Graphs (8)
- Trees (7)
- Graph Traversal (7)
- Data Structures (7)
- Sorting (6)
- Programming (2)
- Networking (1)
- Core Concepts (1)
Linear Search vs Binary Search
Filed under Searching
A quick and practical overview of differences between linear and binary search.
Finding the Maximum-Minimum Capacity for a Node in a Graph
Filed under Algorithms, Graphs
A quick and practical guide to finding the Maximum-Minimum capacity for a node in a graph.
Longest Palindromic Subsequence With Dynamic Programming
Filed under Algorithms, Programming
A quick and practical explanation of the longest palindromic subsequence problem.
Knuth-Morris-Pratt Algorithm
Filed under Graph Traversal
Learn about the Knuth-Morris-Pratt algorithm that searches for occurrences of a word inside a large text
Difference Between BFS and Dijkstra’s Algorithms
Filed under Graph Traversal, Path Finding
Learn how BFS and Dijkstra’s algorithms work to find the shortest path from one node to all other nodes in a graph.