I have a large, non-cyclic directed graph.
Each node has several key / value pairs. Some of the keys can be searched by range.
Let's say that all nodes have the following keys:
- color - red, blue, green, etc.
- price is an integer
- size is an integer
I want to select a list of nodes from my graph so that:
- all nodes have color = red
- all nodes have a price> = 10 and <= 20
- the list is sorted by increasing the size
- any node that meets the criteria of color and price and has no outgoing links (no edges from this node) is listed
- no two nodes in the list sharing an edge
, , , .
.
( ) ? , , ?