Merging undirected and unweighted graphs together
I'm looking to take graphs with specific nodes and then based on their
common nodes then combine the graphs together to get one larger graph. In
the picture below I look to take just two graphs of the same size (in this
case they the same size but the graphs can have varying sizes) and combine
them together based on the common node labelled 6, to then get the larger
graph show below in the picture.
Are there any current algorithms that can help achieve what I am looking
to do?
No comments:
Post a Comment