I'm always confusing these concepts. They're very very confusing me.
1. DFS is one of ways of search in graph and it can be implemented by recursive function. Moreover I always believe (recursive function = Backtracking).
So I think Backtracking is high concept than DFS and Backtracking is not a ...
Search found 2 matches
- Fri Apr 21, 2006 3:58 pm
- Forum: Algorithms
- Topic: Backtracking , DFS, Divide & Conquer
- Replies: 2
- Views: 2388
- Sun Jan 08, 2006 7:55 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10746 - Crime Wave - The Sequel
- Replies: 27
- Views: 22101
10746 Crime Wave - TLE
I tried to solve this problem by using min-cost max flow.
And I used Bellman-Ford algorithm to check negative cycle and Ford-Fulkerson algorithm to flow.
I think this is right.
This is my first try to solve min-cost max flow problem.
So it's very hard for me to code appropriate algorithm.
I have ...
And I used Bellman-Ford algorithm to check negative cycle and Ford-Fulkerson algorithm to flow.
I think this is right.
This is my first try to solve min-cost max flow problem.
So it's very hard for me to code appropriate algorithm.
I have ...