| | |
- builtins.object
-
- ArrayPoolElement_double_t
- ArrayPool_double_t
- DS_Node
- DisjointSets
- Edge
- EdgeList
- EdgeListConstIterator
- EdgeListElement
- EdgeListIterator
- Graph
- NegSpaceElement_double_t
- Node
- UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t
- UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t
- UEVertex_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t
- UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t
- UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t
class ArrayPoolElement_double_t(builtins.object) |
| | |
Methods defined here:
- __getitem__(...) from builtins.PyCapsule
- __getitem__(*args, **kwargs)
Overloaded function.
1. __getitem__(self : rosetta.core.graph.ArrayPoolElement_double_t, index : int) -> float
2. __getitem__(self : rosetta.core.graph.ArrayPoolElement_double_t, index : int) -> float
3. __getitem__(self : rosetta.core.graph.ArrayPoolElement_double_t, index : int) -> float
4. __getitem__(self : rosetta.core.graph.ArrayPoolElement_double_t, index : int) -> float
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(self : rosetta.core.graph.ArrayPoolElement_double_t, size : int, neg_ptr : rosetta.core.graph.NegSpaceElement_double_t) -> NoneType
2. __init__(self : rosetta.core.graph.ArrayPoolElement_double_t, other : rosetta.core.graph.ArrayPoolElement_double_t) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- copy_array_contents(...) from builtins.PyCapsule
- copy_array_contents(self : rosetta.core.graph.ArrayPoolElement_double_t, other : rosetta.core.graph.ArrayPoolElement_double_t) -> NoneType
- size(...) from builtins.PyCapsule
- size(rosetta.core.graph.ArrayPoolElement_double_t) -> int
- valid(...) from builtins.PyCapsule
- valid(rosetta.core.graph.ArrayPoolElement_double_t) -> bool
|
class DisjointSets(builtins.object) |
| | |
Methods defined here:
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(rosetta.core.graph.DisjointSets) -> NoneType
2. __init__(self : rosetta.core.graph.DisjointSets, n_nodes : int) -> NoneType
3. __init__(self : rosetta.core.graph.DisjointSets, : rosetta.core.graph.DisjointSets) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- assign(...) from builtins.PyCapsule
- assign(self : rosetta.core.graph.DisjointSets, : rosetta.core.graph.DisjointSets) -> rosetta.core.graph.DisjointSets
- disjoint_set_sizes(...) from builtins.PyCapsule
- disjoint_set_sizes(rosetta.core.graph.DisjointSets) -> rosetta.utility.vector1_unsigned_long
count the size of each disjoint set. O(N)
- ds_find(...) from builtins.PyCapsule
- ds_find(self : rosetta.core.graph.DisjointSets, node_id : int) -> int
return the representative for a node
- ds_make_set(...) from builtins.PyCapsule
- ds_make_set(rosetta.core.graph.DisjointSets) -> NoneType
add a new node -- as implemented, O(N) operation
use the DS(platform::Size) constructor for better speed.
- ds_union(...) from builtins.PyCapsule
- ds_union(self : rosetta.core.graph.DisjointSets, node1 : int, node2 : int) -> NoneType
make it so that two nodes end up in the same set
- n_disjoint_sets(...) from builtins.PyCapsule
- n_disjoint_sets(rosetta.core.graph.DisjointSets) -> int
count the number of disjoint sets. O(N)
- n_nodes(...) from builtins.PyCapsule
- n_nodes(rosetta.core.graph.DisjointSets) -> int
- node(...) from builtins.PyCapsule
- node(self : rosetta.core.graph.DisjointSets, node_id : int) -> rosetta.core.graph.DS_Node
DS_Node read access
- nodes_in_set(...) from builtins.PyCapsule
- nodes_in_set(self : rosetta.core.graph.DisjointSets, node_id : int) -> rosetta.utility.vector1_unsigned_long
return the nodes in the set containing the specified node.
- sets(...) from builtins.PyCapsule
- sets(rosetta.core.graph.DisjointSets) -> rosetta.std.map_unsigned_long_utility_vector1_unsigned_long_std_allocator_unsigned_long_t
return a map from the representative node of each set to
the list of nodes in their sets
|
class Edge(builtins.object) |
| | |
Methods defined here:
- __init__(...) from builtins.PyCapsule
- __init__(self : handle, owner : core::graph::Graph, first_node_ind : int, second_node_ind : int) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- copy_from(...) from builtins.PyCapsule
- copy_from(self : rosetta.core.graph.Edge, source : rosetta.core.graph.Edge) -> NoneType
copy-from for use in Graph::operator= and copy ctors
- count_dynamic_memory(...) from builtins.PyCapsule
- count_dynamic_memory(rosetta.core.graph.Edge) -> int
how much memory is dynamically allocated by this edge -- must be recursively invoked
by a derived class.
- count_static_memory(...) from builtins.PyCapsule
- count_static_memory(rosetta.core.graph.Edge) -> int
how much memory is statically allocated by this edge
- get_first_node_ind(...) from builtins.PyCapsule
- get_first_node_ind(rosetta.core.graph.Edge) -> int
returns the index of the lower node
- get_other_ind(...) from builtins.PyCapsule
- get_other_ind(self : rosetta.core.graph.Edge, node_index : int) -> int
returns the index of the one node given the index of the other.
node_index must be one of the two nodes that this edge is incident upon.
- get_other_node(...) from builtins.PyCapsule
- get_other_node(*args, **kwargs)
Overloaded function.
1. get_other_node(self : rosetta.core.graph.Edge, node_index : int) -> rosetta.core.graph.Node
returns a const pointer to one node given the index of the other.
node_index must be one of the two nodes that this edge is incident upon.
2. get_other_node(self : rosetta.core.graph.Edge, node_index : int) -> rosetta.core.graph.Node
returns a non-const pointer to one node given the index of the other.
node_index must be one of the two nodes that this edge is incident upon.
- get_second_node_ind(...) from builtins.PyCapsule
- get_second_node_ind(rosetta.core.graph.Edge) -> int
returns the index of the upper node
- is_loop(...) from builtins.PyCapsule
- is_loop(rosetta.core.graph.Edge) -> bool
Is this edge a loop? In Pseudographs, loop edges are incident twice on a single vertex.
- same_edge(...) from builtins.PyCapsule
- same_edge(self : rosetta.core.graph.Edge, node1 : int, node2 : int) -> bool
Is this the same edge as another edge (node1,node2)? Note:
this graph does not work for multi-graphs. Edges must be unique.
- set_pos_in_owners_list(...) from builtins.PyCapsule
- set_pos_in_owners_list(self : rosetta.core.graph.Edge, edge_iterator : rosetta.core.graph.EdgeListIterator) -> NoneType
called only by class Graph, this function gives the Edge the data it needs
to later delete itself from its owner's edge list in constant time.
|
class EdgeList(builtins.object) |
| |
Custom edge list class. Returns const-iterators which only return Edge const *'s
and non-const-iterators which can return either const or non-const Edge*'s. Manages its
own memory using an unordered-object-pool for fast insertion and deletion of EdgeListElements.
Implemented as a doubly linked list, though there's no practical way to start at the
end of a list and work backward since decrementing the end iterator is not a valid operation.
|
| |
Methods defined here:
- __init__(self, /, *args, **kwargs)
- Initialize self. See help(type(self)) for accurate signature.
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- begin(...) from builtins.PyCapsule
- begin(*args, **kwargs)
Overloaded function.
1. begin(rosetta.core.graph.EdgeList) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the front of the list
2. begin(rosetta.core.graph.EdgeList) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the front of the list
- const_begin(...) from builtins.PyCapsule
- const_begin(rosetta.core.graph.EdgeList) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the front of the list
- const_end(...) from builtins.PyCapsule
- const_end(rosetta.core.graph.EdgeList) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the end of the list
- const_last(...) from builtins.PyCapsule
- const_last(rosetta.core.graph.EdgeList) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the last element in the list
- end(...) from builtins.PyCapsule
- end(*args, **kwargs)
Overloaded function.
1. end(rosetta.core.graph.EdgeList) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the end of the list
2. end(rosetta.core.graph.EdgeList) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the end of the list
- erase(...) from builtins.PyCapsule
- erase(self : rosetta.core.graph.EdgeList, to_erase : rosetta.core.graph.EdgeListIterator) -> NoneType
removes an element from the list pointed to by the input iterator
- insert(...) from builtins.PyCapsule
- insert(self : rosetta.core.graph.EdgeList, element_to_insert_before : rosetta.core.graph.EdgeListIterator, edgeptr : core::graph::Edge) -> rosetta.core.graph.EdgeListIterator
insert a new edge-list element in the list infront of the input iterator and
return an iterator to the position of the new element
- is_end_element(...) from builtins.PyCapsule
- is_end_element(self : rosetta.core.graph.EdgeList, element : rosetta.core.graph.EdgeListElement) -> bool
method invoked by the EdgeListIterator class: is an iterator the special
end iterator for a list?
- last(...) from builtins.PyCapsule
- last(*args, **kwargs)
Overloaded function.
1. last(rosetta.core.graph.EdgeList) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the last element in the list
2. last(rosetta.core.graph.EdgeList) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the last element in the list
- push_back(...) from builtins.PyCapsule
- push_back(self : rosetta.core.graph.EdgeList, edgeptr : core::graph::Edge) -> NoneType
create a new edge-list element and insert it at the front of the list
- push_front(...) from builtins.PyCapsule
- push_front(self : rosetta.core.graph.EdgeList, edgeptr : core::graph::Edge) -> NoneType
create a new edge-list element and insert it at the end of the list
- size(...) from builtins.PyCapsule
- size(rosetta.core.graph.EdgeList) -> int
O(N)
|
class EdgeListConstIterator(builtins.object) |
| |
Custom Edge list const iterator class, which returns only const
Edge pointers. This iterator cannot be used to change the structure of its list
without access to that list directly. Customized since STL's const-iterator cannot
be prevented from giving non-const access to its data. The former workaround to
this problem was to define two sets of edge lists on each vertex: a list< Edge * >
and a list< Edge const * >.
|
| |
Methods defined here:
- __eq__(...) from builtins.PyCapsule
- __eq__(*args, **kwargs)
Overloaded function.
1. __eq__(self : rosetta.core.graph.EdgeListConstIterator, rhs : rosetta.core.graph.EdgeListConstIterator) -> bool
equality operator. Do these elements point at the same list element? Asserts
that they belong to the same list. Never compare elements from separate lists.
2. __eq__(self : rosetta.core.graph.EdgeListConstIterator, rhs : rosetta.core.graph.EdgeListIterator) -> bool
const-cast equality operator. Do these elements point at the same list element? Asserts
that they belong to the same list. Never compare elements from separate lists.
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(rosetta.core.graph.EdgeListConstIterator) -> NoneType
2. __init__(self : rosetta.core.graph.EdgeListConstIterator, owner : core::graph::EdgeList) -> NoneType
3. __init__(self : rosetta.core.graph.EdgeListConstIterator, owner : core::graph::EdgeList, element : rosetta.core.graph.EdgeListElement) -> NoneType
4. __init__(self : rosetta.core.graph.EdgeListConstIterator, src : rosetta.core.graph.EdgeListConstIterator) -> NoneType
5. __init__(self : rosetta.core.graph.EdgeListConstIterator, src : rosetta.core.graph.EdgeListIterator) -> NoneType
- __ne__(...) from builtins.PyCapsule
- __ne__(*args, **kwargs)
Overloaded function.
1. __ne__(self : rosetta.core.graph.EdgeListConstIterator, rhs : rosetta.core.graph.EdgeListConstIterator) -> bool
inequality operator. Do these elements point to different elements from the same list? Asserts
that they belong to the same list. Never compare elements from separate lists.
Elements need not be valid to be compared.
2. __ne__(self : rosetta.core.graph.EdgeListConstIterator, rhs : rosetta.core.graph.EdgeListIterator) -> bool
const-cast inequality operator. Do these elements point to different elements from the same list? Asserts
that they belong to the same list. Never compare elements from separate lists.
Elements need not be valid to be compared.
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- assign(...) from builtins.PyCapsule
- assign(self : rosetta.core.graph.EdgeListConstIterator, rhs : rosetta.core.graph.EdgeListConstIterator) -> rosetta.core.graph.EdgeListConstIterator
assignmnet operator
- minus_minus(...) from builtins.PyCapsule
- minus_minus(rosetta.core.graph.EdgeListConstIterator) -> rosetta.core.graph.EdgeListConstIterator
decrement operator. Point this iterator at the previous element in the list.
- plus_plus(...) from builtins.PyCapsule
- plus_plus(rosetta.core.graph.EdgeListConstIterator) -> rosetta.core.graph.EdgeListConstIterator
increment operator. Point this iterator at the next element in the list.
- valid(...) from builtins.PyCapsule
- valid(rosetta.core.graph.EdgeListConstIterator) -> bool
Is this a valid iterator?
|
class EdgeListElement(builtins.object) |
| |
Custom written edge list element class. Little more than a struct.
Defined so that edge list memory management could rely on boost::pool like object
|
| |
Methods defined here:
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(rosetta.core.graph.EdgeListElement) -> NoneType
2. __init__(self : rosetta.core.graph.EdgeListElement, edge : core::graph::Edge, previous : rosetta.core.graph.EdgeListElement, next : rosetta.core.graph.EdgeListElement) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- const_edge(...) from builtins.PyCapsule
- const_edge(rosetta.core.graph.EdgeListElement) -> core::graph::Edge
- const_next(...) from builtins.PyCapsule
- const_next(rosetta.core.graph.EdgeListElement) -> rosetta.core.graph.EdgeListElement
- const_previous(...) from builtins.PyCapsule
- const_previous(rosetta.core.graph.EdgeListElement) -> rosetta.core.graph.EdgeListElement
- edge(...) from builtins.PyCapsule
- edge(*args, **kwargs)
Overloaded function.
1. edge(rosetta.core.graph.EdgeListElement) -> core::graph::Edge
2. edge(self : rosetta.core.graph.EdgeListElement, setting : core::graph::Edge) -> NoneType
- next(...) from builtins.PyCapsule
- next(*args, **kwargs)
Overloaded function.
1. next(rosetta.core.graph.EdgeListElement) -> rosetta.core.graph.EdgeListElement
2. next(self : rosetta.core.graph.EdgeListElement, setting : rosetta.core.graph.EdgeListElement) -> NoneType
- previous(...) from builtins.PyCapsule
- previous(*args, **kwargs)
Overloaded function.
1. previous(rosetta.core.graph.EdgeListElement) -> rosetta.core.graph.EdgeListElement
2. previous(self : rosetta.core.graph.EdgeListElement, setting : rosetta.core.graph.EdgeListElement) -> NoneType
|
class EdgeListIterator(builtins.object) |
| |
Custom Edge list (non-const) iterator class, which can return non-const
Edge pointers. This iterator cannot be used to change the structure of its list
without access to that list directly. Customized since STL's const-iterator cannot
be prevented from giving non-const access to its data. The former workaround to
this problem was to define two sets of edge lists on each vertex: a list< Edge * >
and a list< Edge const * >.
|
| |
Methods defined here:
- __eq__(...) from builtins.PyCapsule
- __eq__(self : rosetta.core.graph.EdgeListIterator, rhs : rosetta.core.graph.EdgeListIterator) -> bool
equality operator. Do these elements point at the same list element? Asserts
that they belong to the same list. Never compare elements from separate lists.
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(rosetta.core.graph.EdgeListIterator) -> NoneType
2. __init__(self : rosetta.core.graph.EdgeListIterator, owner : core::graph::EdgeList) -> NoneType
3. __init__(self : rosetta.core.graph.EdgeListIterator, owner : core::graph::EdgeList, element : rosetta.core.graph.EdgeListElement) -> NoneType
4. __init__(self : rosetta.core.graph.EdgeListIterator, src : rosetta.core.graph.EdgeListIterator) -> NoneType
- __ne__(...) from builtins.PyCapsule
- __ne__(self : rosetta.core.graph.EdgeListIterator, rhs : rosetta.core.graph.EdgeListIterator) -> bool
inequality operator. Do these elements point to different elements from the same list? Asserts
that they belong to the same list. Never compare elements from separate lists.
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- assign(...) from builtins.PyCapsule
- assign(self : rosetta.core.graph.EdgeListIterator, rhs : rosetta.core.graph.EdgeListIterator) -> rosetta.core.graph.EdgeListIterator
assignmnet operator
- minus_minus(...) from builtins.PyCapsule
- minus_minus(rosetta.core.graph.EdgeListIterator) -> rosetta.core.graph.EdgeListIterator
decrement operator. Point this iterator at the previous element in the list.
- plus_plus(...) from builtins.PyCapsule
- plus_plus(rosetta.core.graph.EdgeListIterator) -> rosetta.core.graph.EdgeListIterator
increment operator. Point this iterator at the next element in the list.
- valid(...) from builtins.PyCapsule
- valid(rosetta.core.graph.EdgeListIterator) -> bool
check that this iterator is valid. Will not guarantee that the iterator points at an element
that has not been destroyed.
|
class Graph(builtins.object) |
| |
A Graph with constant time edge insertion and deletion. Extensible.
|
| |
Methods defined here:
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(handle) -> NoneType
2. __init__(self : handle, num_nodes : int) -> NoneType
3. __init__(handle, rosetta.core.graph.Graph) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- add_edge(...) from builtins.PyCapsule
- add_edge(*args, **kwargs)
Overloaded function.
1. add_edge(self : rosetta.core.graph.Graph, node1 : int, node2 : int) -> rosetta.core.graph.Edge
add an edge between two vertices. Invokes "create_edge" from the derived class.
Returns a pointer to the edge after its been added, allowing the calling function
to immediately set data for this edge.
2. add_edge(self : rosetta.core.graph.Graph, example_edge : rosetta.core.graph.Edge) -> rosetta.core.graph.Edge
add an edge to this graph copying the data from an edge in another graph.
Returns a pointer to the edge after its been added, allowing the calling function
to immediately set data for this edge.
- all_pairs_shortest_paths(...) from builtins.PyCapsule
- all_pairs_shortest_paths(rosetta.core.graph.Graph) -> ObjexxFCL::FArray2D<int>
O(V^3). Computes all pairs shortest paths using Warshall's algorithm
and writes all the path distances to the two-dimensional table.
- assign(...) from builtins.PyCapsule
- assign(self : rosetta.core.graph.Graph, source : rosetta.core.graph.Graph) -> rosetta.core.graph.Graph
assignment operator. source and this must have the same type.
- const_edge_list_begin(...) from builtins.PyCapsule
- const_edge_list_begin(rosetta.core.graph.Graph) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the beginning of the (unordered) edge list for the graph.
this edge list contains all the edges in the graph, not simply those for a particular vertex
- const_edge_list_end(...) from builtins.PyCapsule
- const_edge_list_end(rosetta.core.graph.Graph) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the end of the (unordered) edge list for the graph.
this edge list contains all the edges in the graph, not simply those for a particular vertex
- copy_connectivity(...) from builtins.PyCapsule
- copy_connectivity(self : rosetta.core.graph.Graph, source : rosetta.core.graph.Graph) -> NoneType
copy the edge connectivity from a source graph with a potentially
unknown type.
- delete_edge(...) from builtins.PyCapsule
- delete_edge(self : rosetta.core.graph.Graph, edge : rosetta.core.graph.Edge) -> NoneType
remove an edge from the graph. (NEW AS OF 12/9/07) Never call C++'s
"delete" function on an edge pointer directly. Derived classes must implement this function.
If they wish to use unordered_object_pools to manage their memory
- drop_all_edges(...) from builtins.PyCapsule
- drop_all_edges(rosetta.core.graph.Graph) -> NoneType
delete all the edges present in the graph
- drop_all_edges_for_node(...) from builtins.PyCapsule
- drop_all_edges_for_node(self : rosetta.core.graph.Graph, node : int) -> NoneType
delete all the edges for a single vertex in the graph
- edge_list_begin(...) from builtins.PyCapsule
- edge_list_begin(rosetta.core.graph.Graph) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the beginning of the (unordered) edge list for the graph.
this edge list contains all the edges in the graph, not simply those for a particular vertex
- edge_list_end(...) from builtins.PyCapsule
- edge_list_end(rosetta.core.graph.Graph) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the end of the (unordered) edge list for the graph.
this edge list contains all the edges in the graph, not simply those for a particular vertex
- find_edge(...) from builtins.PyCapsule
- find_edge(*args, **kwargs)
Overloaded function.
1. find_edge(self : rosetta.core.graph.Graph, node1 : int, node2 : int) -> rosetta.core.graph.Edge
returns a pointer to the edge connecting nodes node1 and node2, if that edge exists
in the graph, o.w. returns 0. Focuses the graph on this edge for fast subsequent retrieval.
2. find_edge(self : rosetta.core.graph.Graph, node1 : int, node2 : int) -> rosetta.core.graph.Edge
returns a const pointer to the edge connecting nodes node1 and node2, if that edge exists
in the graph, o.w. returns 0. Focuses the graph on this edge for fast subsequent retrieval.
- focused_edge(...) from builtins.PyCapsule
- focused_edge(*args, **kwargs)
Overloaded function.
1. focused_edge(rosetta.core.graph.Graph) -> rosetta.core.graph.Edge
returns a pointer to the focused edge
2. focused_edge(rosetta.core.graph.Graph) -> rosetta.core.graph.Edge
returns a const-pointer to the focused edge
- getTotalMemoryUsage(...) from builtins.PyCapsule
- getTotalMemoryUsage(rosetta.core.graph.Graph) -> int
returns a count of all the memory used by every vertex and edge in a graph
by invoking the polymorphic count_static_memory and count_dynamic_memory of each
(possibly derived) node and edge object as well as for the (possibly derived) graph
class.
- get_edge_exists(...) from builtins.PyCapsule
- get_edge_exists(self : rosetta.core.graph.Graph, node1 : int, node2 : int) -> bool
is an edge already present in the graph? O(V) worst case. O(1) iff all vertices have O(1) edges
- get_node(...) from builtins.PyCapsule
- get_node(*args, **kwargs)
Overloaded function.
1. get_node(self : rosetta.core.graph.Graph, index : int) -> rosetta.core.graph.Node
2. get_node(self : rosetta.core.graph.Graph, index : int) -> rosetta.core.graph.Node
- get_self_ptr(...) from builtins.PyCapsule
- get_self_ptr(*args, **kwargs)
Overloaded function.
1. get_self_ptr(rosetta.core.graph.Graph) -> rosetta.core.graph.Graph
self pointers
2. get_self_ptr(rosetta.core.graph.Graph) -> rosetta.core.graph.Graph
- num_edges(...) from builtins.PyCapsule
- num_edges(rosetta.core.graph.Graph) -> int
- num_nodes(...) from builtins.PyCapsule
- num_nodes(rosetta.core.graph.Graph) -> int
the number of nodes in the graph
- print_vertices(...) from builtins.PyCapsule
- print_vertices(rosetta.core.graph.Graph) -> NoneType
send summary information to the screen for all vertices in the graph
- set_num_nodes(...) from builtins.PyCapsule
- set_num_nodes(self : rosetta.core.graph.Graph, num_nodes : int) -> NoneType
set the number of nodes in the graph -- deletes any existing edges in the graph
|
class Node(builtins.object) |
| | |
Methods defined here:
- __init__(...) from builtins.PyCapsule
- __init__(self : handle, : core::graph::Graph, node_id : int) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- add_edge(...) from builtins.PyCapsule
- add_edge(self : rosetta.core.graph.Node, edge_ptr : core::graph::Edge, : rosetta.core.graph.EdgeListIterator) -> NoneType
adds edge pointer to edge list; returns an iterator to the new
list element
- const_edge_list_begin(...) from builtins.PyCapsule
- const_edge_list_begin(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the beginning of its edge list
- const_edge_list_end(...) from builtins.PyCapsule
- const_edge_list_end(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the end of its edge list
- const_lower_edge_list_begin(...) from builtins.PyCapsule
- const_lower_edge_list_begin(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the beginning of its lower-edge list
- const_lower_edge_list_end(...) from builtins.PyCapsule
- const_lower_edge_list_end(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the end of its lower-edge list
- const_upper_edge_list_begin(...) from builtins.PyCapsule
- const_upper_edge_list_begin(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the beginning of its upper-edge list
- const_upper_edge_list_end(...) from builtins.PyCapsule
- const_upper_edge_list_end(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListConstIterator
returns a const iterator to the end of its upper-edge list
- copy_from(...) from builtins.PyCapsule
- copy_from(self : rosetta.core.graph.Node, source : rosetta.core.graph.Node) -> NoneType
invoked during graph assignment operators to copy any
node data from one graph to another graph. The source node must
be the same type as this node.
- count_dynamic_memory(...) from builtins.PyCapsule
- count_dynamic_memory(rosetta.core.graph.Node) -> int
memory accounting scheme
- count_static_memory(...) from builtins.PyCapsule
- count_static_memory(rosetta.core.graph.Node) -> int
memory accounting scheme
- drop_all_edges(...) from builtins.PyCapsule
- drop_all_edges(rosetta.core.graph.Node) -> NoneType
deletes all edges incident upon this node
- drop_edge(...) from builtins.PyCapsule
- drop_edge(self : rosetta.core.graph.Node, edge_iterator : rosetta.core.graph.EdgeListIterator) -> NoneType
removes an edge iterator from the node's edge list. Only called by Edge class.
- edge_list_begin(...) from builtins.PyCapsule
- edge_list_begin(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the beginning of its edge list
- edge_list_end(...) from builtins.PyCapsule
- edge_list_end(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the end of its edge list
- find_edge(...) from builtins.PyCapsule
- find_edge(*args, **kwargs)
Overloaded function.
1. find_edge(self : rosetta.core.graph.Node, other_node_index : int) -> core::graph::Edge
a "slow" (linear) search for an edge.
2. find_edge(self : rosetta.core.graph.Node, other_node_index : int) -> core::graph::Edge
- get_node_index(...) from builtins.PyCapsule
- get_node_index(rosetta.core.graph.Node) -> int
the index for this node
- get_num_edges_to_larger_indexed_nodes(...) from builtins.PyCapsule
- get_num_edges_to_larger_indexed_nodes(rosetta.core.graph.Node) -> int
the number of upper neighbors -- which "self" neighborness is counted if a loop edge
is present
- get_num_edges_to_smaller_indexed_nodes(...) from builtins.PyCapsule
- get_num_edges_to_smaller_indexed_nodes(rosetta.core.graph.Node) -> int
the number of lower neighbors
- loop_incident(...) from builtins.PyCapsule
- loop_incident(rosetta.core.graph.Node) -> bool
NOTE TO SELF: remove loop support
- lower_edge_list_begin(...) from builtins.PyCapsule
- lower_edge_list_begin(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the beginning of its lower-edge list
- lower_edge_list_end(...) from builtins.PyCapsule
- lower_edge_list_end(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the end of its lower-edge list
- num_edges(...) from builtins.PyCapsule
- num_edges(rosetta.core.graph.Node) -> int
the number of edges incident on this node, which may include a loop edge
- num_neighbors_counting_self(...) from builtins.PyCapsule
- num_neighbors_counting_self(rosetta.core.graph.Node) -> int
the number of neighbors counting "self" as a neighbor.
- num_neighbors_counting_self_static(...) from builtins.PyCapsule
- num_neighbors_counting_self_static(rosetta.core.graph.Node) -> int
the number of neighbors counting "self" as neighbor. Defaults to
num_neighbors_counting_self() but can be set to other values as well.
Useful in calculation of symmetrical structures.
- print(...) from builtins.PyCapsule
- print(rosetta.core.graph.Node) -> NoneType
send summaray data about this node to the screen
- set_num_neighbors_counting_self_static(...) from builtins.PyCapsule
- set_num_neighbors_counting_self_static(self : rosetta.core.graph.Node, neighbor : int) -> NoneType
manually change the number of neighbors for a Node. Used
for symmetry scoring
- upper_edge_list_begin(...) from builtins.PyCapsule
- upper_edge_list_begin(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the beginning of its upper-edge list
- upper_edge_list_end(...) from builtins.PyCapsule
- upper_edge_list_end(rosetta.core.graph.Node) -> rosetta.core.graph.EdgeListIterator
returns a non-const iterator to the end of its upper-edge list
|
class UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t(builtins.object) |
| | |
Methods defined here:
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(rosetta.core.graph.UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> NoneType
2. __init__(self : rosetta.core.graph.UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, owner : core::graph::UpperEdgeGraph<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>, lower_node : int, upper_node : int) -> NoneType
3. __init__(self : rosetta.core.graph.UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, owner : core::graph::UpperEdgeGraph<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>, lower_node : int, upper_node : int, data : core::conformation::PointGraphEdgeData) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- data(...) from builtins.PyCapsule
- data(*args, **kwargs)
Overloaded function.
1. data(rosetta.core.graph.UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> core::conformation::PointGraphEdgeData
2. data(rosetta.core.graph.UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> core::conformation::PointGraphEdgeData
- delete_edge(...) from builtins.PyCapsule
- delete_edge(rosetta.core.graph.UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> NoneType
- deleted(...) from builtins.PyCapsule
- deleted(rosetta.core.graph.UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> bool
- upper_vertex(...) from builtins.PyCapsule
- upper_vertex(rosetta.core.graph.UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> int
|
class UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t(builtins.object) |
| | |
Methods defined here:
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(self : rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, owner : core::graph::UpperEdgeGraph<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>, index : int) -> NoneType
2. __init__(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> NoneType
3. __init__(self : rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, : rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- assign(...) from builtins.PyCapsule
- assign(self : rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, : rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t
- const_upper_edge_list_begin(...) from builtins.PyCapsule
- const_upper_edge_list_begin(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> __gnu_cxx::__normal_iterator<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData> const*, std::vector<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>, std::allocator<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData> > > >
- const_upper_edge_list_end(...) from builtins.PyCapsule
- const_upper_edge_list_end(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> __gnu_cxx::__normal_iterator<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData> const*, std::vector<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>, std::allocator<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData> > > >
- data(...) from builtins.PyCapsule
- data(*args, **kwargs)
Overloaded function.
1. data(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> core::conformation::PointGraphVertexData
2. data(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> core::conformation::PointGraphVertexData
- drop_all_edges(...) from builtins.PyCapsule
- drop_all_edges(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> NoneType
- edge_exists(...) from builtins.PyCapsule
- edge_exists(self : rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, upper_vertex_id : int) -> bool
- get_edge(...) from builtins.PyCapsule
- get_edge(*args, **kwargs)
Overloaded function.
1. get_edge(self : rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, upper_vertex_id : int) -> core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>
2. get_edge(self : rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, upper_vertex_id : int) -> core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>
- num_lower_neighbors(...) from builtins.PyCapsule
- num_lower_neighbors(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> int
- num_neighbors(...) from builtins.PyCapsule
- num_neighbors(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> int
- num_neighbors_counting_self(...) from builtins.PyCapsule
- num_neighbors_counting_self(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> int
- num_upper_neighbors(...) from builtins.PyCapsule
- num_upper_neighbors(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> int
- reserve_edge_space(...) from builtins.PyCapsule
- reserve_edge_space(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> NoneType
- upper_edge_list_begin(...) from builtins.PyCapsule
- upper_edge_list_begin(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> __gnu_cxx::__normal_iterator<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>*, std::vector<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>, std::allocator<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData> > > >
- upper_edge_list_end(...) from builtins.PyCapsule
- upper_edge_list_end(rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> __gnu_cxx::__normal_iterator<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>*, std::vector<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData>, std::allocator<core::graph::UEEdge<core::conformation::PointGraphVertexData, core::conformation::PointGraphEdgeData> > > >
|
class UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t(builtins.object) |
| | |
Methods defined here:
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> NoneType
2. __init__(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, nverts : int) -> NoneType
3. __init__(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, other : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- add_edge(...) from builtins.PyCapsule
- add_edge(*args, **kwargs)
Overloaded function.
1. add_edge(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, lower_vertex : int, upper_vertex : int) -> NoneType
2. add_edge(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, lower_vertex : int, upper_vertex : int, edge_data : core::conformation::PointGraphEdgeData) -> NoneType
- assign(...) from builtins.PyCapsule
- assign(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, other : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t
- drop_all_edges(...) from builtins.PyCapsule
- drop_all_edges(rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> NoneType
- edge_exists(...) from builtins.PyCapsule
- edge_exists(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, lower_vertex : int, upper_vertex : int) -> bool
- get_edge(...) from builtins.PyCapsule
- get_edge(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, lower_vertex : int, upper_vertex : int) -> rosetta.core.graph.UEEdge_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t
- get_vertex(...) from builtins.PyCapsule
- get_vertex(*args, **kwargs)
Overloaded function.
1. get_vertex(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, index : int) -> rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t
2. get_vertex(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, index : int) -> rosetta.core.graph.UEVertex_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t
- num_edges(...) from builtins.PyCapsule
- num_edges(rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> int
- num_vertices(...) from builtins.PyCapsule
- num_vertices(rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t) -> int
- set_num_vertices(...) from builtins.PyCapsule
- set_num_vertices(self : rosetta.core.graph.UpperEdgeGraph_core_conformation_PointGraphVertexData_core_conformation_PointGraphEdgeData_t, num_vertices : int) -> NoneType
|
class UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t(builtins.object) |
| | |
Methods defined here:
- __init__(...) from builtins.PyCapsule
- __init__(*args, **kwargs)
Overloaded function.
1. __init__(rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t) -> NoneType
2. __init__(self : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t, nverts : int) -> NoneType
3. __init__(self : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t, other : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t) -> NoneType
- __new__(*args, **kwargs) from builtins.type
- Create and return a new object. See help(type) for accurate signature.
- add_edge(...) from builtins.PyCapsule
- add_edge(*args, **kwargs)
Overloaded function.
1. add_edge(self : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t, lower_vertex : int, upper_vertex : int) -> NoneType
2. add_edge(self : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t, lower_vertex : int, upper_vertex : int, edge_data : protocols::toolbox::pose_metric_calculators::EnergiesData) -> NoneType
- assign(...) from builtins.PyCapsule
- assign(self : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t, other : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t) -> rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t
- drop_all_edges(...) from builtins.PyCapsule
- drop_all_edges(rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t) -> NoneType
- edge_exists(...) from builtins.PyCapsule
- edge_exists(self : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t, lower_vertex : int, upper_vertex : int) -> bool
- get_vertex(...) from builtins.PyCapsule
- get_vertex(*args, **kwargs)
Overloaded function.
1. get_vertex(self : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t, index : int) -> rosetta.core.graph.UEVertex_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t
2. get_vertex(self : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t, index : int) -> rosetta.core.graph.UEVertex_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t
- num_edges(...) from builtins.PyCapsule
- num_edges(rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t) -> int
- num_vertices(...) from builtins.PyCapsule
- num_vertices(rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t) -> int
- set_num_vertices(...) from builtins.PyCapsule
- set_num_vertices(self : rosetta.core.graph.UpperEdgeGraph_protocols_toolbox_pose_metric_calculators_EmptyVertexData_protocols_toolbox_pose_metric_calculators_EnergiesData_t, num_vertices : int) -> NoneType
| |