Cypher is declarative
MATCH // define graph shape
(A)-[HAS]->(B)
WHERE // filter graph
A.status = 'Active'
# PS this would make a great interview question | |
def map_int(i, state): | |
i = ord('0') + ( i + state ) % 9 | |
state += i | |
return i, state | |
def map_lower(c, state): | |
x = ord('a') + (c + state ) % 25 | |
state += x |
import numpy as np | |
print "Question 1" | |
a = np.array([ | |
[1, 2, 3, 4], | |
[1, 1, 1, 1], | |
[1, 2, 1, 2], | |
[1, 2, 1, 1] | |
]) |
This document outlines solutions to building the database for a voting system with the following features: