graph

Graph module.

class Edge

Bases: object

Struct-like definition of an edge.

__eq__(other: object) → bool

Return self==value.

class InteractionNode(type_name: str, number_of_ingoing_edges: int, number_of_outgoing_edges: int)

Bases: object

Struct-like definition of an interaction node.

class StateTransitionGraph

Bases: object

Graph class that contains edges and nodes.

Similar to feynman graphs. The graphs are directed, meaning the edges are ingoing and outgoing to specific nodes (since feynman graphs also have a time axis) This class can contain the full information of a state transition from a initial state to a final state. This information can be attached to the nodes and edges via properties.

__eq__(other: object) → bool

Return self==value.

add_edges(edge_ids: List[int]) → None

Add edges with the ids in the edge_ids list.

add_node(node_id: int) → None

Adds a node with id node_id.

Raises

ValueError – if node_id already exists

attach_edges_to_node_ingoing(ingoing_edge_ids: Sequence[int], node_id: int) → None

Attach existing edges to nodes.

So that the are ingoing to these nodes.

Parameters

• ingoing_edge_ids ([int]) – list of edge ids, that will be attached

• node_id (int) – id of the node to which the edges will be attached

Raises

• ValueError – if an edge not doesn’t exist.

• ValueError – if an edge ID is already an ingoing node.

attach_edges_to_node_outgoing(outgoing_edge_ids: Sequence[int], node_id: int) → None

get_originating_node_list(edge_ids: Sequence[int]) → List[Optional[int]]

Get list of node ids from which the supplied edges originate from.

Parameters

edge_ids ([int]) – list of edge ids for which the origin node is searched for

Returns

a list of node ids

Return type

[int]

set_graph_element_properties_comparator(comparator: Callable) → None

swap_edges(edge_id1: int, edge_id2: int) → None

verify() → bool

Verify if the graph is connected.

So that no dangling parts which are not connected.

are_graphs_isomorphic(graph1: expertsystem.topology.graph.StateTransitionGraph, graph2: expertsystem.topology.graph.StateTransitionGraph) → bool

Check if two graphs are isomorphic.

Returns

True if the two graphs have a one-to-one mapping of the node IDs and edge IDs.

Return type

bool

dicts_unequal(dict1: dict, dict2: dict) → bool

get_edges_ingoing_to_node(graph: expertsystem.topology.graph.StateTransitionGraph, node_id: Optional[int]) → List[int]

get_edges_outgoing_to_node(graph: expertsystem.topology.graph.StateTransitionGraph, node_id: Optional[int]) → List[int]

get_final_state_edges(graph: expertsystem.topology.graph.StateTransitionGraph) → List[int]

get_initial_state_edges(graph: expertsystem.topology.graph.StateTransitionGraph) → List[int]

get_intermediate_state_edges(graph: expertsystem.topology.graph.StateTransitionGraph) → List[int]

get_originating_final_state_edges(graph: expertsystem.topology.graph.StateTransitionGraph, node_id: Optional[int]) → List[int]

get_originating_initial_state_edges(graph: expertsystem.topology.graph.StateTransitionGraph, node_id: int) → List[int]