T = Graph.load(name1) self.assertEqual(self.G, T)deftearDown(self):pass 开发者ID:ufkapano,代码行数:96, transpose[as 别名]classTestGraphDirected(unittest.TestCase):defsetUp(self):self.N =4# number of nodesself.G = Graph(self.N, directed=True) self.nodes = ["A","B","C","D"]...
To each multilinear monomial in the free graded algebra with involution we associate a directed labeled graph. Use of these graphs allows us to produce a set of generators for the (T,@?)-ideal of identities. It also leads to new proofs of the results of Kostant and Rowen on the ...