Public Member Functions
def	__init__ (self)

def	addEdgeItem (self, edge, nodes, edges, highlight_level, same_label_siblings=False, scene=None)

def	dotcode_to_qt_items (self, dotcode, highlight_level, same_label_siblings=False, scene=None)

def	getNodeItemForNode (self, node, highlight_level, scene=None)

def	getNodeItemForSubgraph (self, subgraph, highlight_level, scene=None)

def	parse_edges (self, graph, nodes, highlight_level, same_label_siblings, scene=None)

def	parse_nodes (self, graph, highlight_level, scene=None)

Detailed Description

Definition at line 63 of file dot_to_qt.py.

Constructor & Destructor Documentation

◆ init()

def qt_dotgraph.dot_to_qt.DotToQtGenerator.__init__ ( self )

Definition at line 65 of file dot_to_qt.py.

Member Function Documentation

◆ addEdgeItem()

def qt_dotgraph.dot_to_qt.DotToQtGenerator.addEdgeItem	(	self,
		edge,
		nodes,
		edges,
		highlight_level,
		same_label_siblings = `False`,
		scene = `None`
	)

Add EdgeItem by data in edge to edges.

:param same_label_siblings:
    if true, edges with same label will be considered siblings (collective highlighting)

Definition at line 166 of file dot_to_qt.py.

◆ dotcode_to_qt_items()

def qt_dotgraph.dot_to_qt.DotToQtGenerator.dotcode_to_qt_items	(	self,
		dotcode,
		highlight_level,
		same_label_siblings = `False`,
		scene = `None`
	)

Take dotcode, run layout, and creates qt items based on the dot layout.

Returns two dicts, one mapping node names to Node_Item, one mapping edge names to lists of
    Edge_Item.
:param same_label_siblings:
    if true, edges with same label will be considered siblings (collective highlighting)

Definition at line 243 of file dot_to_qt.py.

◆ getNodeItemForNode()

def qt_dotgraph.dot_to_qt.DotToQtGenerator.getNodeItemForNode	(	self,
		node,
		highlight_level,
		scene = `None`
	)

Return a pyqt NodeItem object, or None in case of error or invisible style.

Definition at line 120 of file dot_to_qt.py.

◆ getNodeItemForSubgraph()

def qt_dotgraph.dot_to_qt.DotToQtGenerator.getNodeItemForSubgraph	(	self,
		subgraph,
		highlight_level,
		scene = `None`
	)

Definition at line 68 of file dot_to_qt.py.

◆ parse_edges()

def qt_dotgraph.dot_to_qt.DotToQtGenerator.parse_edges	(	self,
		graph,
		nodes,
		highlight_level,
		same_label_siblings,
		scene = `None`
	)

Recursively search all edges inside the graph and all subgraphs.

Definition at line 295 of file dot_to_qt.py.

◆ parse_nodes()

def qt_dotgraph.dot_to_qt.DotToQtGenerator.parse_nodes	(	self,
		graph,
		highlight_level,
		scene = `None`
	)

Recursively search all nodes inside the graph and all subgraphs.

Definition at line 266 of file dot_to_qt.py.

The documentation for this class was generated from the following file:

dot_to_qt.py

Public Member Functions