## Search found 9 matches

Thu Jan 10, 2008 1:33 pm
Forum: Algorithms
Topic: is this still Traveling salesman problem?
Replies: 1
Views: 1636

### is this still Traveling salesman problem?

In wikipedia TSP is defined as: "Given a number of cities and the costs of travelling from any city to any other city, what is the least-cost round-trip route that visits each city exactly once and then returns to the starting city?" But what if every city might be visited more than once? Is that st...
Sat Jun 09, 2007 9:11 pm
Forum: Algorithms
Topic: Minimum cut
Replies: 1
Views: 1876

### Minimum cut

I know some algorithms how to find minimum cut in a graph, but is there an algorithm that gives the set of edges that form the min cut?
Mon Oct 02, 2006 9:54 pm
Forum: Algorithms
Topic: Tree traversal (really hard)
Replies: 0
Views: 1290

### Tree traversal (really hard)

Given graph (a tree) with n (n <= 100) vertices: 1)Each leaf contains number from 0 to 30000. e(u) //energy 2)Each edge has weight function from 1 to 30000. w(u, v) //energy which we must use to walk over this edge A mice is located at root of tree. If the mice wants to go from vertice A to B, then ...
Sat May 13, 2006 2:46 pm
Forum: Algorithms
Topic: Shortest path algoritms with constraints!
Replies: 0
Views: 964

### Shortest path algoritms with constraints!

Ok, we all know "standart" shortest path algorithms! If v[1], v[2], v[3] ... v[n - 1], v[n] is shortest path in a weighted graph, then v[1], v[2], ... v[k] is shortest path too(1 <= k <= n). The algorithm, I am asking for, is much harder! Now imagine that you have a graph, where each edge has TWO we...
Mon May 08, 2006 9:49 pm
Forum: C++
Topic: C++ switches -O2; -static; -lm ...
Replies: 11
Views: 4213
Sat Apr 29, 2006 3:05 pm
Forum: C++
Topic: C++ switches -O2; -static; -lm ...
Replies: 11
Views: 4213
The best way to use predefined option for all source code, (I don't recommand this) is use some system variable/ or writing a generic Make file. While your answer is technically correct, I assume that the intended question here was "Can I do something to force the UVa compiler to optimize my code?"...
Wed Apr 26, 2006 4:58 pm
Forum: C++
Topic: C++ switches -O2; -static; -lm ...
Replies: 11
Views: 4213
http://www.google.com/search?q=man+gcc And how to add switches in c++ source code, not in compiler command line! Well, you can't. A (very limited) substitution is #pragma directives. because in google it is really hard to find any useful info abot because google is not able to find minus. rotfl, mi...
Tue Apr 25, 2006 8:50 pm
Forum: C++
Topic: C++ switches -O2; -static; -lm ...
Replies: 11
Views: 4213

### C++ switches -O2; -static; -lm ...

Ok it would be very nice if someone would introduce us with c++ flags(-O2 -static -lm ...) Or atleast pass a link, because in google it is really hard to find any useful info abot because google is not able to find minus. I know when -O2 flag is in use, my program is twice faster, but why? And how t...
Sat Apr 15, 2006 6:20 pm
Forum: Algorithms
Topic: Hopcroft Karp
Replies: 4
Views: 3002

### Hopcroft Karp

I am learning Hopcroft Karp algorithm for maximum bipartite matching. I tried google but didn`t find anything useful(only math whitch i didn`t understand) I didn`t understand: 1)how BFS is implemented there, 2)for what purpose there was Hungarian tree mentioned Maybe i skipped something :) Code and ...