Releted ACM on BFS, DFS, Dijkstra, MST, Graph

Post here if you don't find any other place for your post. But please, stay on-topic: algorithms, programming or something related to this web site and its services.

Moderator: Board moderators

Post Reply
ishtiaq ahmed
Learning poster
Posts: 53
Joined: Sat Jul 29, 2006 7:33 am
Location: (CSE,DU), Dhaka,Bangladesh

Releted ACM on BFS, DFS, Dijkstra, MST, Graph

Post by ishtiaq ahmed » Fri May 02, 2008 8:56 pm

Dear all,
I will be very happy if you post me some related ACM problems on these topics. Thanks in advance.
No venture no gain

with best regards
------------------------
ishtiaq ahmed

User avatar
newton
Experienced poster
Posts: 162
Joined: Thu Jul 13, 2006 7:07 am
Location: Campus Area. Dhaka.Bangladesh
Contact:

Re: Releted ACM on BFS, DFS, Dijkstra, MST, Graph

Post by newton » Mon Jun 09, 2008 10:18 pm

Try this BFS and DFS problems
173(h), 208(m), 222(h), 247(m), 260(h), 273(h)(comp geometry), 274(h), 280(e), 298(h), 314(h), 321(h), 336(e), 439(e), 452(e), 521(h), 532(e), 539(e), 589(h), 590(m), 599(m), 615(m), 627(m), 633(h), 677(h), 710(h), 793(m), 794(h), 804(h), 924(e), 928(h), 10021(m), 10039(m), 10044(m), 10047(h), 10067(h), 10076(e), 10085(m)

(e) -> easy
(h) -> hard

Post Reply

Return to “Other words”