8000 Add all tags · cp-algorithms/cp-algorithms@1f660df · GitHub
[go: up one dir, main page]
Skip to content

Commit 1f660df

Browse files
author
Oleksandr Kulkov
committed
Add all tags
1 parent dff436d commit 1f660df

File tree

73 files changed

+414
-5
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

73 files changed

+414
-5
lines changed

‎src/graph/01_bfs.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,8 @@
1+
---
2+
tags:
3+
- Original
4+
---
5+
16
# 0-1 BFS
27

38
It is well-known, that you can find the shortest paths between a single source and all other vertices in $O(|E|)$ using [Breadth First Search](breadth-first-search.md) in an **unweighted graph**, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex.

‎src/graph/2SAT.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,9 @@
1+
---
2+
tags:
3+
- Translated
4+
e_maxx_link: 2_sat
5+
---
6+
17
# 2-SAT
28

39
SAT (Boolean satisfiability problem) is the problem of assigning Boolean values to variables to satisfy a given Boolean formula.

‎src/graph/Assignment-problem-min-flow.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,9 @@
1+
---
2+
tags:
3+
- Translated
4+
e_maxx_link: assignment_mincostflow
5+
---
6+
17
# Solving assignment problem using min-cost-flow
28

39
The **assignment problem** has two equivalent statements:

‎src/graph/all-pair-shortest-path-floyd-warshall.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,9 @@
1+
---
< 10000 /td>
2+
tags:
3+
- Translated
4+
e_maxx_link: floyd_warshall_algorithm
5+
---
6+
17
# Floyd-Warshall Algorithm
28

39
Given a directed or an undirected weighted graph $G$ with $n$ vertices.

‎src/graph/bellman_ford.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,9 @@
1+
---
2+
tags:
3+
- Translated
4+
e_maxx_link: ford_bellman
5+
---
6+
17
# Bellman-Ford Algorithm
28

39
**Single source shortest path with negative weight edges**

‎src/graph/bipartite-check.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,9 @@
1+
---
2+
tags:
3+
- Translated
4+
e_maxx_link: bipartite_checking
5+
---
6+
17
# Check whether a graph is bipartite
28

39
A bipartite graph is a graph whose vertices can be divided into two disjoint sets so that every edge connects two vertices from different sets (i.e. there are no edges which connect vertices from the same set). These sets are usually called sides.

‎src/graph/breadth-first-search.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,9 @@
1+
---
2+
tags:
3+
- Translated
4+
e_maxx_link: bfs
5+
---
6+
17
# Breadth-first search
28

39
Breadth first search is one of the basic and essential searching algorithms on graphs.

‎src/graph/bridge-searching-online.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,9 @@
1+
---
2+
tags:
3+
- Translated
4+
e_maxx_link: bridge_searching_online
5+
---
6+
17
# Finding Bridges Online
28

39
We are given an undirected graph.

‎src/graph/bridge-searching.md

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,8 @@
11
---
2-
title: Finding bridges in a graph in O(N+M)
2+
title: Finding bridges in a graph in O(N+M)
3+
tags:
4+
- Translated
5+
e_maxx_link: bridge_searching
36
---
47
# Finding bridges in a graph in $O(N+M)$
58

‎src/graph/cutpoints.md

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,8 @@
11
---
2-
title: Finding articulation points in a graph in O(N+M)
2+
title: Finding articulation points in a graph in O(N+M)
3+
tags:
4+
- Translated
5+
e_maxx_link: cutpoints
36
---
47
# Finding articulation points in a graph in $O(N+M)$
58

0 commit comments

Comments
 (0)
0