Determines whether two nodes in the planar graph
describing the mapping between two adjacent node-node mappings. That
is, given a two correspondences between a nodes on two paths, it
determines whether there is a legal transition between them. This can
be seen as two elements of the mapping matrix, each specified by a row
and column.
Usage
connected(r1, c1, r2, c2)
Arguments
r1
row of first node
c1
column of first node
r2
row of second node
c2
column of second node.
Value
returns T or F
Details
r1,c1 should specify a node to the left/above r2,c2. The outcome
depends on whether r,c is a node or segment on the path. Point-point
mappings can transition to the next point-segment mappings, or the next
point-point segment.