Go to the documentation of this file.
9 def add_node(self, q=None, new_connex=False):
11 Create the memory to store a new edge. Initialize all components to None.
12 Create an empty list of children.
22 def add_edge(self, first, second, orientation=0):
24 Add edge from first to second. Also add edge from second to first if orientation
35 Create a new connex component for node <idx>
43 Change the index of the all the nodes belonging to a connex component.
44 Useful when merging two connex components.
48 self.
connex = [c
if c != past
else future
for c
in self.
connex]
54 Return the list of all node indexes belonging to connex component <connex>.
56 return [i
for i, c
in enumerate(self.
connex)
if c == connex]
def connexIndexes(self, connex)
def add_edge(self, first, second, orientation=0)
def new_connex(self, idx)
def rename_connex(self, past, future)
def add_node(self, q=None, new_connex=False)
result_of::push_front< V const, T >::type append(T const &t, V const &v)
Append the element T at the front of boost fusion vector V.
pinocchio
Author(s):
autogenerated on Sun Dec 22 2024 03:41:09