tulip.transys.transys.GameGraph

When adding states, you have to say which player controls the outgoing transitions. Use networkx state labels for that:

init(self, node_label_types, edge_label_types)
(Constructor)

Initialize a graph with edges, name, graph attributes.

Parameters
----------
data : input graph
    Data to initialize graph.  If data=None (default) an empty
    graph is created.  The data can be an edge list, or any
    NetworkX graph object.  If the corresponding optional Python
    packages are installed the data can also be a NumPy matrix
    or 2d ndarray, a SciPy sparse matrix, or a PyGraphviz graph.
name : string, optional (default='')
    An optional name for the graph.
attr : keyword arguments, optional (default= no attributes)
    Attributes to add to graph as key=value pairs.

See Also
--------
convert

Examples
--------
>>> G = nx.Graph()   # or DiGraph, MultiGraph, MultiDiGraph, etc
>>> G = nx.Graph(name='my graph')
>>> e = [(1,2),(2,3),(3,4)] # list of edges
>>> G = nx.Graph(e)

Arbitrary graph attribute pairs (key=value) may be assigned

>>> G=nx.Graph(e, day="Friday")
>>> G.graph
{'day': 'Friday'}

Overrides: object.__init__: (inherited documentation)

player_states(self, n)

Return states controlled by player n.

'controlled' means that player n gets to decide the successor state.

Parameters:

n (0 or 1) - player index (id number)

Returns: set

set of states

edge_controlled_by(self, e)

Return the index of the player controlling edge e.

Parameters:

e (2-tuple of nodes (n1, n2))

Returns: integer 0 or 1

Class GameGraph

See also

Reference

init(self, node_label_types, edge_label_types)
(Constructor)

player_states(self, n)

edge_controlled_by(self, e)

Class GameGraph

See also

Reference

__init__(self, node_label_types, edge_label_types) (Constructor)

player_states(self, n)

edge_controlled_by(self, e)

init(self, node_label_types, edge_label_types)
(Constructor)