Question

所以我需要使用Numpy数组和Python 2检查图是否为二分图

这是我开发的用于检查图形的代码：

from __future__ import print_function
import numpy as np

class grafo:
    visited = []

    def __init__(self, n):
        self.vertices = []
        self.adjacency = np.zeros((n,n))
        self.visited.append(True)
        self.size = n
        self.color = [-1] * self.size
        self.color.append(0)

    def isBipartita(self):
        finalRes = str()
        init = 0
        self.color[init] = 1
        self.visited.append(init)
        while self.visited: 
            i = self.visited.pop() 
            print("[FIRST CHECK] adyacencia[" + str(i)+"][" + str(i) + "] == 1?")
            if self.adjacency[i][i] == 1:  //HERE IT CORRUPTS AT SOME POINT
                finalRes = "NO"
                print("True")
                return finalRes; 

            for f in range(self.size): 
                print("[SECOND CHECK] adyacencia[" + str(i)+"][" + str(f) + "] == 1 and color[" + str(f) +"] == -1")
                if self.adjacency[i][f] == 1 and self.color[f] == -1:
                    print("True")
                    self.color[f] = 1 - self.color[i] 
                    self.visited.append(f)
                else:
                    print("[THIRD CHECK] adyacencia[" + str(i)+"][" + str(f) + "] == 1 and color[" + str(f) +"] == color[" + str(i) +"]")
                    if self.adjacency[i][f] == 1 and self.color[f] == self.color[i]:
                        print("True")
                        finalRes = "NO"
                        return finalRes

        finalRes = "YES"
        return finalRes

    def __str__(self):
        return str(self.adjacency)


#PROGRAM

lenV = raw_input("") #This is the length of the Adjacency array for the graph
lenV = int(lenV)
inputs = []

for i in range(0, lenV):
    inputs.append(raw_input())

print("\n-> Inputs:")
print(inputs)
print("\n-> List with Inputs Values:")
tempVal = list()
for numC in inputs:
    tempVal.append(numC)

print(tempVal)

print("\n-> Split and get into array:")
G = grafo(lenV)
for x in range(0,lenV):
    tempList = list(tempVal[x])
    print(tempList)
    for y in range(0, lenV):
        G.adjacency[x][y] = tempList[y]
print("\n-> Array to check:")       
print(G)
print("\n")
print(G.isBipartita())

问题在isBipartita方法的“ grafo”类中；在检查时的某个时刻，numpy整数数组返回一个布尔值并给出ValueError作为输出。

这是我用来测试的一些示例：

这是我得到的输出：

/** LIKE 20 SUCCESSFUL CHECKS LATER **/
[SECOND CHECK] adyacencia[1][3] == 1 and color[3] == -1
[THIRD CHECK] adyacencia[1][3] == 1 and color[3] == color[1]
[FIRST CHECK] adyacencia[True][True] == 1?
Traceback (most recent call last):
  File "bipartitaChecker.py", line 76, in <module>
    print(G.isBipartita())
  File "bipartitaChecker.py", line 23, in isBipartita
    if self.adjacency[i][i] == 1: 
ValueError: The truth value of an array with more than one element is ambiguous. Use a.any() or a.all()

如您所见，在Traceback调用之前，最后一个“ [FIRST CHECK]”具有adyacencia [True] [True]，而这并不是这种方式……我已经研究了ValueError，但是一切都会导致我仅在某些国外情况下出现此错误，但就我而言，它不应引起该错误...

我不知道发生了什么事！!

我将不胜感激。

检查图是否为二分图

0 个答案: