src/tools/benchmark_tool/benchmark_tool/rqt_graph/dotcode.py
def _get_node_edge_map(self, edges):
        """
        Return the node connections.

        A dict mapping node name to edge objects partitioned in incoming and outgoing edges.
        """
        node_connections = {}
        for edge in edges:
            if edge.start not in node_connections:
                node_connections[edge.start] = NodeConnections()
            if edge.end not in node_connections:
                node_connections[edge.end] = NodeConnections()
            node_connections[edge.start].outgoing.append(edge)
            node_connections[edge.end].incoming.append(edge)
        return node_connections

        Return the node connections.

        A dict mapping node name to edge objects partitioned in incoming and outgoing edges.
        
Return the node connections.
A dict mapping node name to edge objects partitioned in incoming and outgoing edges.
Return the node connections . A dict mapping node name to edge objects partitioned in incoming and outgoing edges .
def _get_node_edge_map(self, edges):
        node_connections = {}
        for edge in edges:
            if edge.start not in node_connections:
                node_connections[edge.start] = NodeConnections()
            if edge.end not in node_connections:
                node_connections[edge.end] = NodeConnections()
            node_connections[edge.start].outgoing.append(edge)
            node_connections[edge.end].incoming.append(edge)
        return node_connections
def _get_node_edge_map ( self , edges ) : node_connections = { } for edge in edges : if edge . start not in node_connections : node_connections [ edge . start ] = NodeConnections ( ) if edge . end not in node_connections : node_connections [ edge . end ] = NodeConnections ( ) node_connections [ edge . start ] . outgoing . append ( edge ) node_connections [ edge . end ] . incoming . append ( edge ) return node_connections
Return the node connections.
Return the node connections .
"""
        Return the node connections.

        A dict mapping node name to edge objects partitioned in incoming and outgoing edges.
        """
self
edges