AddNode()

oGraph = new stzGraph("test")
oGraph.AddNodeXTT("alice", "Person", [:age = 30])
StzGraphQueryQ(oGraph) {
	Match([:node = "n", :where = [:id, "=", "alice"]])
	Set("n.age", [:to = 31])
	Select("n")
	? GraphQ().NodeProperty("alice", "age")
}

p = new stzGraph("p")
p.AddNode("A") p.AddNode("B") p.AddNode("C")
p.AddEdge("A", "B") p.AddEdge("B", "C")
# a path is bipartite
? p.IsBipartite()
t = new stzGraph("t")
t.AddNode("X") t.AddNode("Y") t.AddNode("Z")
t.AddEdge("X", "Y") t.AddEdge("Y", "Z") t.AddEdge("Z", "X")
# a triangle (odd cycle) is not bipartite
? t.IsBipartite()

m = new stzGraph("m")
m.AddNode("A") m.AddNode("B") m.AddNode("C") m.AddNode("D")
m.AddEdgeXTT("A", "B", "", [ :weight = 1 ])
m.AddEdgeXTT("B", "C", "", [ :weight = 2 ])
m.AddEdgeXTT("C", "D", "", [ :weight = 3 ])
m.AddEdgeXTT("D", "A", "", [ :weight = 4 ])
m.AddEdgeXTT("A", "C", "", [ :weight = 5 ])
# the MST weight is 1+2+3 = 6
? m.MSTWeight()
d = new stzGraph("d")
d.AddNode("A") d.AddNode("B") d.AddNode("X")
d.AddEdge("A", "B")
# a graph with no spanning tree returns -1
? d.MSTWeight()