Examples of Hack.Utilities.Graph.addEdge()

Hack.Utilities.Graph.addEdge()
Adds an edge between the source and target objects. If the source or target objects don't exist yet in the graph, they will be added automatically. If the edge aleardy exists, nothing will happen.

            int gatePinNumber = connection.getGatePinNumber();


            switch (connection.getType()) {
                case Connection.TO_INTERNAL:
                    if (isLegalFromPartEdge(connection, part))
                        graph.addEdge(part, getPinInfo(INTERNAL_PIN_TYPE, gatePinNumber));
                    break;


                case Connection.FROM_INTERNAL:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(getPinInfo(INTERNAL_PIN_TYPE, gatePinNumber), part);

View Full Code Here

                        graph.addEdge(part, getPinInfo(INTERNAL_PIN_TYPE, gatePinNumber));
                    break;


                case Connection.FROM_INTERNAL:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(getPinInfo(INTERNAL_PIN_TYPE, gatePinNumber), part);
                    break;


                case Connection.TO_OUTPUT:
                    if (isLegalFromPartEdge(connection, part))
                        graph.addEdge(part, getPinInfo(OUTPUT_PIN_TYPE, gatePinNumber));

View Full Code Here

                        graph.addEdge(getPinInfo(INTERNAL_PIN_TYPE, gatePinNumber), part);
                    break;


                case Connection.TO_OUTPUT:
                    if (isLegalFromPartEdge(connection, part))
                        graph.addEdge(part, getPinInfo(OUTPUT_PIN_TYPE, gatePinNumber));
                    break;


                case Connection.FROM_INPUT:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(getPinInfo(INPUT_PIN_TYPE, gatePinNumber), part);

View Full Code Here

                        graph.addEdge(part, getPinInfo(OUTPUT_PIN_TYPE, gatePinNumber));
                    break;


                case Connection.FROM_INPUT:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(getPinInfo(INPUT_PIN_TYPE, gatePinNumber), part);
                    break;


                case Connection.FROM_TRUE:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(TRUE_NODE_INFO, part);

View Full Code Here

                        graph.addEdge(getPinInfo(INPUT_PIN_TYPE, gatePinNumber), part);
                    break;


                case Connection.FROM_TRUE:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(TRUE_NODE_INFO, part);
                    break;


                case Connection.FROM_FALSE:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(FALSE_NODE_INFO, part);

View Full Code Here

                        graph.addEdge(TRUE_NODE_INFO, part);
                    break;


                case Connection.FROM_FALSE:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(FALSE_NODE_INFO, part);
                    break;


                case Connection.FROM_CLOCK:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(CLOCK_NODE_INFO, part);

View Full Code Here

                        graph.addEdge(FALSE_NODE_INFO, part);
                    break;


                case Connection.FROM_CLOCK:
                    if (isLegalToPartEdge(connection, part))
                        graph.addEdge(CLOCK_NODE_INFO, part);
                    break;
            }
        }


        // connect the "master part" node to all the parts.

View Full Code Here

            }
        }


        // connect the "master part" node to all the parts.
        for (int i = 0; i < partsList.size(); i++)
            graph.addEdge(partsList, new Integer(i));


        // connect all output pins to the "master output" node
        for (int i = 0; i < outputPinsInfo.length; i++)
            graph.addEdge(outputPinsInfo[i], outputPinsInfo);

View Full Code Here

        for (int i = 0; i < partsList.size(); i++)
            graph.addEdge(partsList, new Integer(i));


        // connect all output pins to the "master output" node
        for (int i = 0; i < outputPinsInfo.length; i++)
            graph.addEdge(outputPinsInfo[i], outputPinsInfo);


        // connect the "master input" node to all input pins
        for (int i = 0; i < inputPinsInfo.length; i++)
            graph.addEdge(inputPinsInfo, inputPinsInfo[i]);

View Full Code Here

        for (int i = 0; i < outputPinsInfo.length; i++)
            graph.addEdge(outputPinsInfo[i], outputPinsInfo);


        // connect the "master input" node to all input pins
        for (int i = 0; i < inputPinsInfo.length; i++)
            graph.addEdge(inputPinsInfo, inputPinsInfo[i]);


        return graph;
    }


    // Returns true if an edge should be connected to the given part.

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.