Configuration validation in a mixed node topology

1. A method comprising:

identifying, by a device, a link to be removed from a topology comprising a plurality of nodes, the plurality of nodes including one or more nodes of a first type and one or more nodes of a second type; and

determining, by the device, whether removal of the link from the topology would cause one or more nodes in the plurality of nodes to become unreachable by a master node of the first type, wherein the determining comprises:

removing the link from a representation of the topology; and

for each endpoint node located at an endpoint of the link:

creating a node set that includes the endpoint node;

adding, to the node set, other nodes in the plurality of nodes that are directly linked to the endpoint node in the representation of the topology; and

subsequently to the adding, checking whether the node set includes the master node.

2. The method of claim 1 wherein the topology is a mesh topology.

3. The method of claim 1 wherein the one or more nodes of the first type are more capable than the one or more nodes of the second type.

4. The method of claim 3 wherein the one or more nodes of the first type support greater port bandwidth, a larger number of ports, or a higher level of security clearance than the one or more nodes of the second type.

5. The method of claim 1 further comprising:

determining whether removal of the link from the topology would require data traffic between two nodes of the first type to pass through a node of the second type.

6. The method of claim 1 wherein if the endpoint node is of the second type, the adding comprises adding directly linked nodes that are of the first type or the second type, and

wherein if the endpoint node is of the first type, the adding comprises adding directly linked nodes that are of the first type, without adding any directly linked nodes that are of the second type.

7. The method of claim 6 wherein the determining further comprises:

if the node set does not include the master node, repeating the adding and the checking for additional nodes in the node set;

else if the node set includes the master node, returning a first result.

8. The method of claim 7 wherein the determining further comprises:

if every node in the node set has been processed and the first result has not been returned, returning a second result.

9. The method of claim 8 further comprising:

preventing removal of the link if the second result is returned for any endpoint node of the link.

10. The method of claim 1 wherein the device is the master node.

11. The method of claim 1 wherein the topology represents a stacking system, and wherein each node in the plurality of nodes corresponds to a stackable switch in the stacking system.

12. The method of claim 11 wherein the identifying comprises:

receiving a user command specifying a stacking port or a stacking trunk of a node in the plurality of nodes; and

identifying the link based on the stacking port or the stacking trunk.

13. A non-transitory computer readable medium having stored thereon program code executable by a processor, the program code comprising:

code that causes the processor to identify a link to be removed from a topology comprising a plurality of nodes, the plurality of nodes including one or more nodes of a first type and one or more nodes of a second type; and

code that causes the processor to determine whether removal of the link from the topology would cause one or more nodes in the plurality of nodes to become unreachable by a master node of the first type, wherein the determining comprises:

removing the link from a representation of the topology; and

for each endpoint node located at an endpoint of the link:

creating a node set that includes the endpoint node;

adding, to the node set, other nodes in the plurality of nodes that are directly linked to the endpoint node in the representation of the topology; and

subsequently to the adding, checking whether the node set includes the master node.

14. The non-transitory computer readable medium of claim 13 wherein the topology is a mesh topology.

15. The non-transitory computer readable medium of claim 13 wherein the one or more nodes of the first type are more capable than the one or more nodes of the second type.

16. The non-transitory computer readable medium of claim 13 wherein the program code further comprises:

program code that causes the processor to determine whether removal of the link from the topology would require data traffic between two nodes of the first type to pass through a node of the second type.

17. A network device comprising:

a processor; and

a non-transitory computer readable medium having stored thereon program code which, when executed by the processor, causes the processor to:

identify a link to be removed from a topology comprising a plurality of nodes, the plurality of nodes including one or more nodes of a first type and one or more nodes of a second type; and

determine whether removal of the link from the topology would cause one or more nodes in the plurality of nodes to become unreachable by a master node of the first type, wherein the determining comprises:

removing the link from a representation of the topology; and

for each endpoint node located at an endpoint of the link:

creating a node set that includes the endpoint node;

adding, to the node set, other nodes in the plurality of nodes that are directly linked to the endpoint node in the representation of the topology; and

subsequently to the adding, checking whether the node set includes the master node.

18. The network device of claim 17 wherein the topology is a mesh topology.

19. The network device of claim 17 wherein the one or more nodes of the first type are more capable than the one or more nodes of the second type.

20. The network device of claim 17 wherein the program code further causes the processor to determine whether removal of the link from the topology would require data traffic between two nodes of the first type to pass through a node of the second type.