TO DO: Create a Python Program that satisfies all the testcases
Topics: Graph Data Structures, Depth-First Search, Breadth-First Search, Dijkstra’s
TO DO: Create a Python
Since an electronic circuit is the interconnection of several components, it might not be surprising that they can be represented as graphs which allow our computers to simulate the behavior of the circuit. A sample resistor network has its corresponding netlist representation used in ngspice (see Figure 1).
Description:
This problem focuses on properly parsing the input. To test this, your code should be able to properly store each input resistor and store them in a data structure and representation of your choice. To verify this, your code should be able to identify which resistors are in series and which resistors are in parallel. In the context of a graph, two resistors can be considered in series if there are no branches in the path formed between the resistors. On the other hand, two resistors can be considered in parallel if they are connected to the same two nodes.
Input Format:
The first line of the input consists of 2 integers N and Q which is the total number of resistors and total number of queries, respectively. The next N lines will consist of 3 strings and an integer R, each separated by a space. The first string is the resistor name, the second, and third strings are the node names where the resistor terminals are connected, and R is its resistance value. Finally, there will be Q lines with two strings each which will each be the name of a resistor.
Output Format:
The output is expected to have Q lines which correspond to the answer to each query. If the resistors in the first query are in series, the first line of the output should be SERIES. If they are parallel, the expected output is PARALLEL. If they are neither in series or parallel, the expected output is NEITHER.
Constraints:
● Resistors in the queries are guaranteed to exist.
● 1 ≤ N,Q ≤ 1000 and 0 < R ≤ 109
Three Testcases:
|
Sample Input 1 5 4 Sample Output 1 SERIES |
Sample Input 2 3 6 Sample Output 2 PARALLEL |
Sample Input 3 5 10 Sample Output 3 SERIES |
Step by step
Solved in 3 steps
