Search found 3 matches
- Sun May 21, 2006 2:29 am
- Forum: Algorithms
- Topic: Shortest path
- Replies: 10
- Views: 4722
Shortest path
How to find m-th shortest path in weighted graph.
- Wed May 17, 2006 2:56 am
- Forum: Algorithms
- Topic: help!!
- Replies: 0
- Views: 1049
help!!
This problem is from some acm site. Help me solve this problem.
On the chessboard of size NxN(N<=10^6) leaves only three figures. They are black king, white king and black-white king. The black-white king is very unusual chess piece for us, because it is invisible. Black and white kings decided to ...
On the chessboard of size NxN(N<=10^6) leaves only three figures. They are black king, white king and black-white king. The black-white king is very unusual chess piece for us, because it is invisible. Black and white kings decided to ...
- Sat May 13, 2006 1:22 pm
- Forum: Other words
- Topic: Help for this nice problems
- Replies: 0
- Views: 1735
Help for this nice problems
I found this problems in some text which I get from my teachar. I tried to solve them but I failed.
1. You are given an oriented graph. Each edge of the graph is colored in one of the three colors. Problem is to find the length of the shortest path from the first vertex to the N-th. Note that any ...
1. You are given an oriented graph. Each edge of the graph is colored in one of the three colors. Problem is to find the length of the shortest path from the first vertex to the N-th. Note that any ...