本文整理汇总了Python中graphillion.GraphSet.add方法的典型用法代码示例。如果您正苦于以下问题：Python GraphSet.add方法的具体用法？Python GraphSet.add怎么用？Python GraphSet.add使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类graphillion.GraphSet的用法示例。
在下文中一共展示了GraphSet.add方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: test_networkx
# 需要导入模块: from graphillion import GraphSet [as 别名]
# 或者: from graphillion.GraphSet import add [as 别名]
def test_networkx(self):
try:
import networkx as nx
except ImportError:
return
try:
if nx.__version__[0] == "1": # for NetworkX version 1.x
GraphSet.converters['to_graph'] = nx.Graph
GraphSet.converters['to_edges'] = nx.Graph.edges
else: # for NetworkX version 2.x
GraphSet.converters['to_graph'] = nx.from_edgelist
GraphSet.converters['to_edges'] = nx.to_edgelist
g = nx.grid_2d_graph(3, 3)
GraphSet.set_universe(g)
g = GraphSet.universe()
self.assertTrue(isinstance(g, nx.Graph))
self.assertEqual(len(g.edges()), 12)
v00, v01, v10 = (0,0), (0,1), (1,0)
e1, e2 = (v00, v01), (v00, v10)
gs = GraphSet([nx.Graph([e1])])
self.assertEqual(len(gs), 1)
g = gs.pop()
self.assertEqual(len(gs), 0)
self.assertTrue(isinstance(g, nx.Graph))
self.assertTrue(list(g.edges()) == [(v00, v01)] or list(g.edges()) == [(v01, v00)])
gs.add(nx.Graph([e2]))
self.assertEqual(len(gs), 1)
except:
raise
finally:
GraphSet.converters['to_graph'] = lambda edges: edges
GraphSet.converters['to_edges'] = lambda graph: graph示例2: test_modifiers
# 需要导入模块: from graphillion import GraphSet [as 别名]
# 或者: from graphillion.GraphSet import add [as 别名]
def test_modifiers(self):
v = [g0, g12, g13]
gs = GraphSet(v)
gs.add(g1)
self.assertTrue(g1 in gs)
gs.remove(g1)
self.assertTrue(g1 not in gs)
self.assertRaises(KeyError, gs.remove, g1)
gs.add(g0)
gs.discard(g0)
self.assertTrue(g0 not in gs)
gs.discard(g0) # no exception raised
gs = GraphSet(v)
gs.add(e2)
self.assertEqual(gs, GraphSet([g12, g123, g2]))
gs = GraphSet(v)
gs.remove(e2)
self.assertEqual(gs, GraphSet([g0, g1, g13]))
self.assertRaises(KeyError, gs.remove, e4)
gs = GraphSet(v)
gs.discard(e2)
self.assertEqual(gs, GraphSet([g0, g1, g13]))
gs.discard(e4) # no exception raised
v = [g1, g12, g13]
gs = GraphSet(v)
g = gs.pop()
self.assertTrue(isinstance(g, list))
self.assertTrue(g not in gs)
self.assertEqual(gs | GraphSet([g]), GraphSet(v))
self.assertTrue(gs)
gs.clear()
self.assertFalse(gs)
self.assertRaises(KeyError, gs.pop)
self.assertRaises(KeyError, gs.add, [(1,4)])
self.assertRaises(KeyError, gs.remove, [(1,4)])
self.assertRaises(KeyError, gs.discard, [(1,4)])
self.assertRaises(KeyError, gs.add, (1,4))
self.assertRaises(KeyError, gs.remove, (1,4))
self.assertRaises(KeyError, gs.discard, (1,4))
u = [g0, g1, g12, g123, g1234, g134, g14, g4]
gs = GraphSet(u)
gs.flip(e1)
self.assertEqual(gs, GraphSet([g0, g1, g14, g2, g23, g234, g34, g4]))