I've got a problem where I have to identify differences in network. The
network may have different types of nodes and may only have a string of
ring-like topology:
Code:
A--B--C--D--E
or
A--B--C--D--E
| |
+-----------+
What I must do is identify the simplest way to change Network 1 into
Network 2
For example:
Code:
Network 1:
A--D--C--B
Network 2:
A--B--C--D
Solution: Swap nodes B and D
Another example:
Network 1:
A--B--C--D--E
Network 2:
A--B--C--D--E
| |
+-----------+
Solution: Connect node E to node A
NOTE: This is not a homework problem. This is a work-related problem.
My current solution is to run through a set of possible problems and
analyze each one. Something like this:
* Compare network topologies: (string-like or ring-like)
* Count the number of nodes on each network.
* Identify which nodes are identical and which are different.
* Does the topology type (string vs. ring) need to change? If so, what
is the simplest fix?
* Are 2 nodes swapped? If yes, identify which ones.
* Are 3 nodes different? Then...
* etc...
This does not seem like the most efficient way of doing things, and it
seems like this is something that someone would have worked out in
acadamia somewhere.
My question: Is there a well known algorthm for this sort of problem?
Many thanks!
- Kevin
