3
votes
Finding a subset of vertices in graph
For 1, start with identifying the subgraph containing C nodes only as vertices. Just iterate over all vertice nodes and keep those of type C. As edges, keep those which connect two C-nodes. Lets call ...
- 221k
3
votes
Finding a subset of vertices in graph
Find the connected subset for one vertex
The naive answer could look like:
1. Put C0 in the an exploration set
2. While there is still a vertex X in the exploration set:
2.1. Remove X from the ...
- 82.3k
2
votes
Recommended data structures/algorithms for checking peoples' availability schedules
Doing search service side is a very bad idea. You would have to keep assignments synchronized with DB doing error-prone cache invalidation and potentially moving significant volumes of data around.
Do ...
- 4,507
2
votes
Recommended data structures/algorithms for checking peoples' availability schedules
At the moment, we run through all the users, their availability slots, and their assigned events in order to determine whether they're available for a specific event.
The first thing you want to get ...
- 221k
2
votes
Recommended data structures/algorithms for checking peoples' availability schedules
One way to do it is to represent each user and each event as a bitmap. Essentially, each half hour corresponds to a bit, the entire day corresponding to 6 bytes. 0 means the person is available, and 1—...
- 139k
Only top scored, non community-wiki answers of a minimum length are eligible