Talk:Set consolidation: Difference between revisions
Content added Content deleted
m (moved Talk:Set consoldation to Talk:Set consolidation: I cannot spell!) |
(→Why.) |
||
| Line 3: | Line 3: | ||
I needed this function to find all the ports on a net in an electronic [[wp:Netlist|netlist]] from huge lists of pairs of ports on all the nets of a design. |
I needed this function to find all the ports on a net in an electronic [[wp:Netlist|netlist]] from huge lists of pairs of ports on all the nets of a design. |
||
I tried to find out what the "computer science-type" name for the routine might be but failed. --[[User:Paddy3118|Paddy3118]] 10:59, 7 May 2012 (UTC) |
I tried to find out what the "computer science-type" name for the routine might be but failed. --[[User:Paddy3118|Paddy3118]] 10:59, 7 May 2012 (UTC) |
||
:I'm not sure either, but if you break the sets down into sets of 2, it becomes the problem of finding the connected components of a graph, the sets of size 2 being the edges and the items being the nodes. --[[User:Spoon!|Spoon!]] 18:59, 7 May 2012 (UTC) |
|||
Revision as of 18:59, 7 May 2012
Why.
I needed this function to find all the ports on a net in an electronic netlist from huge lists of pairs of ports on all the nets of a design. I tried to find out what the "computer science-type" name for the routine might be but failed. --Paddy3118 10:59, 7 May 2012 (UTC)
- I'm not sure either, but if you break the sets down into sets of 2, it becomes the problem of finding the connected components of a graph, the sets of size 2 being the edges and the items being the nodes. --Spoon! 18:59, 7 May 2012 (UTC)