Skip to main content
Computer Science
themanwhosoldtheworld's user avatar
themanwhosoldtheworld's user avatar
themanwhosoldtheworld's user avatar
themanwhosoldtheworld
  • Member for 11 years, 3 months
  • Last seen more than 1 year ago
Profile Activity

15 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Popular Question
comment
Given N sets of disjoint subsets, find a set of disjoint subsets such that it satisfies a criteria
can you illustrate this algorithm using an example, that would be useful.
revised
Given N sets of disjoint subsets, find a set of disjoint subsets such that it satisfies a criteria
added 7 characters in body
comment
Given N sets of disjoint subsets, find a set of disjoint subsets such that it satisfies a criteria
@D.W. I have elaborated the problem in a bit more detail
revised
Given N sets of disjoint subsets, find a set of disjoint subsets such that it satisfies a criteria
added 4 characters in body
revised
Given N sets of disjoint subsets, find a set of disjoint subsets such that it satisfies a criteria
added 4 characters in body
asked
Given N sets of disjoint subsets, find a set of disjoint subsets such that it satisfies a criteria
awarded
 Supporter
awarded
 Autobiographer
awarded
 Editor
comment
Finding shortest path from a node to any node of a particular type
@D.W. i have edited my question accordingly
revised
Finding shortest path from a node to any node of a particular type
added 170 characters in body
awarded
 Student
comment
Finding shortest path from a node to any node of a particular type
@babou can you please elaborate on what you mean by DP + BFS?
asked
Finding shortest path from a node to any node of a particular type