Skip to content

Commit

Permalink
small fixes
Browse files Browse the repository at this point in the history
  • Loading branch information
Hromz committed Sep 14, 2023
1 parent 19ea438 commit 68c2c2b
Showing 1 changed file with 3 additions and 2 deletions.
5 changes: 3 additions & 2 deletions docs/docs/algorithms/cycle-detection/dfs-based.md
Original file line number Diff line number Diff line change
Expand Up @@ -22,13 +22,14 @@ The algorithm uses DFS traversal and therefore suffers the same limitations (see
- Resource dependencies:
- Redundant connections.
- Deadlocks in concurrent systems.
- Deadlocks in concurrent systems.
- Logical dependencies:
- Data base relation.
- Dependency management.
- Circuit design.
- Infinity loops.

[wikipedia]('https://en.wikipedia.org/wiki/Cycle_(graph_theory)#Cycle_detection')
[wikipedia](https://en.wikipedia.org/wiki/Cycle_(graph_theory)#Cycle_detection)

## Syntax
Cycle detection for directed graph.
Expand All @@ -52,4 +53,4 @@ template <typename V, typename E>

## Similar algorithms
There are many algorithms for cycle detection or algorithms with specific cycle conditions.
See [wikipedia]('https://en.wikipedia.org/wiki/Cycle_(graph_theory)#Graph_classes_defined_by_cycle')
See [wikipedia](https://en.wikipedia.org/wiki/Cycle_(graph_theory)#Graph_classes_defined_by_cycle)

0 comments on commit 68c2c2b

Please sign in to comment.