[Sigmakee-sumo] Representing a simple graph using SUMO graph theory

[Cameron R. <cr...@sy...>]

Consider the following directed graph:
G1: N1----A12---->N2----A23---->N3

Is the following a proper SUMO representation of G1:
(instance G1 DirectedGraph)
(instance N1 GraphNode)
(graphPart N1 G1)
(instance N2 GraphNode)
(graphPart N2 G1)
(instance N3 GraphNode)
(graphPart N3 G1)
(instance A12 GraphArc)
(graphPart A12 G1)
(instance A23 GraphArc)
(graphPart A23 G1)
(links N1 N2 A12)
(equal N1 InitialNodeFn(A12))
(equal N2 TerminalNodeFn(A12))
(links N2 N3 A23)
(equal N2 InitialNodeFn(A23))
(equal N3 TerminalNodeFn(A23))

Cheers,
Cameron.