issues
search
cc-routing
/
routing-sara
Seznam Advanced Routing Algorithm
1
stars
2
forks
source link
Add support for traversing multiple neighboring graphs
#37
Open
blahami2
opened
8 years ago
blahami2
commented
8 years ago
E
is a border edge
E
has two nodes, one
A
in graph
G
and the other
B
is just a “stub” (also in graph
G
)
Make
E.getOtherNode( A )
return
B’
(instead of
B
), where
B’
is a node of the neighboring graph
H
and
B.orig_id = B’.orig_id
E
is a border edgeE
has two nodes, oneA
in graphG
and the otherB
is just a “stub” (also in graphG
)E.getOtherNode( A )
returnB’
(instead ofB
), whereB’
is a node of the neighboring graphH
andB.orig_id = B’.orig_id