This is the complete list of members for meshlib::Graph, including all inherited members.

are_neighbors(a:meshlib::GraphVertId, b:meshlib::GraphVertId) const -> bool	meshlib::Graph
assign_from_another(_other:&meshlib::Graph) -> &mut meshlib::Graph	meshlib::Graph
check_validity() const -> bool	meshlib::Graph
construct_2(neighboursPerVertex:&meshlib::Vector_std_vector_MR_GraphEdgeId_MR_GraphVertId, endsPerEdge:&meshlib::Vector_MR_Graph_EndVertices_MR_GraphEdgeId)	meshlib::Graph
construct_4(neighboursPerVertex:&meshlib::Vector_std_vector_MR_GraphEdgeId_MR_GraphVertId, validVerts:&meshlib::GraphVertBitSet, endsPerEdge:&meshlib::Vector_MR_Graph_EndVertices_MR_GraphEdgeId, validEdges:&meshlib::GraphEdgeBitSet)	meshlib::Graph
construct_from_another(_other:&meshlib::Graph) -> meshlib::Owned< meshlib::Graph >	meshlib::Graph	static
copy(ptr:const Self) -> mut Self	meshlib::CppCopy	static
meshlib::destroy(ptr:*mut Self)	meshlib::CppClass	static
meshlib::CppCopy::destroy(ptr:*mut Self)	meshlib::CppClass	static
edge_size() const -> usize	meshlib::Graph
ends(e:meshlib::GraphEdgeId) const -> &meshlib::Graph_EndVertices	meshlib::Graph
find_edge(a:meshlib::GraphVertId, b:meshlib::GraphVertId) const -> meshlib::GraphEdgeId	meshlib::Graph
merge(remnant:meshlib::GraphVertId, dead:meshlib::GraphVertId, onMergeEdges:&meshlib::std_function_void_from_MR_GraphEdgeId_MR_GraphEdgeId)	meshlib::Graph
neighbours(v:meshlib::GraphVertId) const -> &meshlib::std_vector_MR_GraphEdgeId	meshlib::Graph
new() -> meshlib::Owned< meshlib::Graph >	meshlib::Graph	static
valid_edges() const -> &meshlib::GraphEdgeBitSet	meshlib::Graph
valid_mr_graph_edge_id(e:meshlib::GraphEdgeId) const -> bool	meshlib::Graph
valid_mr_graph_vert_id(v:meshlib::GraphVertId) const -> bool	meshlib::Graph
valid_verts() const -> &meshlib::GraphVertBitSet	meshlib::Graph
vert_size() const -> usize	meshlib::Graph