Public Member Functions | |
def | __init__ |
def | add_edge |
def | add_node |
def | add_subgraph |
def | del_edge |
def | del_node |
def | get_edge |
def | get_edge_defaults |
def | get_edge_list |
def | get_edges |
def | get_graph_defaults |
def | get_graph_type |
def | get_name |
def | get_next_sequence_number |
def | get_node |
def | get_node_defaults |
def | get_node_list |
def | get_nodes |
def | get_simplify |
def | get_strict |
def | get_subgraph |
def | get_subgraph_list |
def | get_subgraphs |
def | get_suppress_disconnected |
def | get_top_graph_type |
def | get_type |
def | set_edge_defaults |
def | set_graph_defaults |
def | set_name |
def | set_node_defaults |
def | set_parent_graph |
def | set_simplify |
def | set_strict |
def | set_suppress_disconnected |
def | set_type |
def | to_string |
Public Attributes | |
obj_dict |
Class representing a graph in Graphviz's dot language. This class implements the methods to work on a representation of a graph in Graphviz's dot language. graph(graph_name='G', graph_type='digraph', strict=False, suppress_disconnected=False, attribute=value, ...) graph_name: the graph's name graph_type: can be 'graph' or 'digraph' suppress_disconnected: defaults to False, which will remove from the graph any disconnected nodes. simplify: if True it will avoid displaying equal edges, i.e. only one edge between two nodes. removing the duplicated ones. All the attributes defined in the Graphviz dot language should be supported. Attributes can be set through the dynamically generated methods: set_[attribute name], i.e. set_size, set_fontname or using the instance's attributes: Graph.obj_dict['attributes'][attribute name], i.e. graph_instance.obj_dict['attributes']['label'] graph_instance.obj_dict['attributes']['fontname']
def rqt_decision_graph.pydot.Graph.__init__ | ( | self, | |
graph_name = 'G' , |
|||
obj_dict = None , |
|||
graph_type = 'digraph' , |
|||
strict = False , |
|||
suppress_disconnected = False , |
|||
simplify = False , |
|||
attrs | |||
) |
def rqt_decision_graph.pydot.Graph.add_edge | ( | self, | |
graph_edge | |||
) |
def rqt_decision_graph.pydot.Graph.add_node | ( | self, | |
graph_node | |||
) |
def rqt_decision_graph.pydot.Graph.add_subgraph | ( | self, | |
sgraph | |||
) |
def rqt_decision_graph.pydot.Graph.del_edge | ( | self, | |
src_or_list, | |||
dst = None , |
|||
index = None |
|||
) |
Delete an edge from the graph. Given an edge's (source, destination) node names all matching edges(s) will be deleted if 'index' is not specified or set to None. If there are several matching edges and 'index' is given, only the edge in that position will be deleted. 'index' should be an integer specifying the position of the edge to delete. If index is larger than the number of matching edges, no action is taken. If edges are deleted it returns True. If no action is taken it returns False.
def rqt_decision_graph.pydot.Graph.del_node | ( | self, | |
name, | |||
index = None |
|||
) |
Delete a node from the graph. Given a node's name all node(s) with that same name will be deleted if 'index' is not specified or set to None. If there are several nodes with that same name and 'index' is given, only the node in that position will be deleted. 'index' should be an integer specifying the position of the node to delete. If index is larger than the number of nodes with that name, no action is taken. If nodes are deleted it returns True. If no action is taken it returns False.
def rqt_decision_graph.pydot.Graph.get_edge | ( | self, | |
src_or_list, | |||
dst = None |
|||
) |
Retrieved an edge from the graph. Given an edge's source and destination the corresponding Edge instance(s) will be returned. If one or more edges exist with that source and destination a list of Edge instances is returned. An empty list is returned otherwise.
def rqt_decision_graph.pydot.Graph.get_edge_defaults | ( | self, | |
attrs | |||
) |
def rqt_decision_graph.pydot.Graph.get_edge_list | ( | self | ) |
def rqt_decision_graph.pydot.Graph.get_edges | ( | self | ) |
def rqt_decision_graph.pydot.Graph.get_graph_defaults | ( | self, | |
attrs | |||
) |
def rqt_decision_graph.pydot.Graph.get_graph_type | ( | self | ) |
def rqt_decision_graph.pydot.Graph.get_name | ( | self | ) |
def rqt_decision_graph.pydot.Graph.get_node | ( | self, | |
name | |||
) |
def rqt_decision_graph.pydot.Graph.get_node_defaults | ( | self, | |
attrs | |||
) |
def rqt_decision_graph.pydot.Graph.get_node_list | ( | self | ) |
def rqt_decision_graph.pydot.Graph.get_nodes | ( | self | ) |
def rqt_decision_graph.pydot.Graph.get_simplify | ( | self | ) |
def rqt_decision_graph.pydot.Graph.get_strict | ( | self, | |
val | |||
) |
def rqt_decision_graph.pydot.Graph.get_subgraph | ( | self, | |
name | |||
) |
def rqt_decision_graph.pydot.Graph.get_subgraph_list | ( | self | ) |
def rqt_decision_graph.pydot.Graph.get_subgraphs | ( | self | ) |
def rqt_decision_graph.pydot.Graph.get_suppress_disconnected | ( | self, | |
val | |||
) |
def rqt_decision_graph.pydot.Graph.get_type | ( | self | ) |
def rqt_decision_graph.pydot.Graph.set_edge_defaults | ( | self, | |
attrs | |||
) |
def rqt_decision_graph.pydot.Graph.set_graph_defaults | ( | self, | |
attrs | |||
) |
def rqt_decision_graph.pydot.Graph.set_name | ( | self, | |
graph_name | |||
) |
def rqt_decision_graph.pydot.Graph.set_node_defaults | ( | self, | |
attrs | |||
) |
def rqt_decision_graph.pydot.Graph.set_parent_graph | ( | self, | |
parent_graph | |||
) |
Reimplemented from rqt_decision_graph.pydot.Common.
def rqt_decision_graph.pydot.Graph.set_simplify | ( | self, | |
simplify | |||
) |
def rqt_decision_graph.pydot.Graph.set_strict | ( | self, | |
val | |||
) |
def rqt_decision_graph.pydot.Graph.set_suppress_disconnected | ( | self, | |
val | |||
) |
def rqt_decision_graph.pydot.Graph.set_type | ( | self, | |
graph_type | |||
) |
def rqt_decision_graph.pydot.Graph.to_string | ( | self | ) |
Reimplemented from rqt_decision_graph.pydot.Common.
Reimplemented in rqt_decision_graph.pydot.Dot.