Carlos Linares López

# 289 Bookmarks

3
1
52
views

2
1
31
views

2
0
36
views

### How to find more than 1 successive shortest paths between two vertices in unweighted and undirected graph using BFS?

Apr 14 at 14:01 6005 3,024
2
1
239
views

3
1
60
views

2
1
95
views

1
vote
2
313
views

6
1
80
views

5
1
75
views

2
1
40
views

3
2
188
views

2
0
45
views

### Proving that the Bellman-Ford algorithm contains negative circuit

Jan 5 at 0:09 user114040 21
1
vote
1
29
views

2
1
40
views

3
0
97
views

### Finding all feasible solutions to a multiple-knapsack program

Dec 24 at 19:14 D.W. 123k
2
1
119
views

4
1
448
views

2
0
20
views

### A data structure for efficiently finding nodes relative to other (ex: if a node is earlier in a list than another node)

Dec 14 at 23:07 Water 163
0
0
32
views

### Strongly connected components of a graph just a disjoint union of cycles

Dec 13 at 21:37 Nascimento de Cos 213
2
1
224
views

5
1
1k
views

1
vote
0
52
views

### Find all Eulerian cycles in a directed graph

Dec 9 at 19:51 Hielke Walinga 119
1
vote
1
34
views

15
1
4k
views

2
1
129
views

0
2
150
views

2
0
218
views

### Given undirected and connected graph G=(V,E). Prove for any DFS run: for any u,v∈V if u.d>v.d then u.d−v.d≥δ(u,v)

Dec 4 at 7:51 sasha 21
8
4
580
views

1
vote
3