Search found 2 matches

by jakecho1
Sun Feb 16, 2014 7:40 am
Forum: Volume 116 (11600-11699)
Topic: 11635 - Hotel booking
Replies: 39
Views: 11180

Re: 11635--Hotel Booking

WA plz help. I splitted towns if the town has a hotel for the driver. Use a prioirty_queue to implement the heap. Otherwise is pretty simple straight dijkstra. #include <iostream> #include <cstdlib> #include <cstdio> #include <cmath> #include <vector> #include <queue> #include <utility> using namesp...
by jakecho1
Mon Feb 10, 2014 4:30 am
Forum: Volume 3 (300-399)
Topic: 315 - Network
Replies: 68
Views: 21612

Re: 315: Network

Hey replying roticv, the post almost 10 years ago. In your posted code, the articulation test for root node might be wrong. We are not looking for "if the #no of connections from root node is more than 2". We are looking for if the # of children for root node from the resulting DFS is more than 2. A...

Go to advanced search