meshlib::Graph Struct Reference

Inheritance diagram for meshlib::Graph:

Public Member Functions
auto	assign_from_another (_other:&meshlib::Graph) -> &mut meshlib::Graph
void	construct_2 (neighboursPerVertex:&meshlib::Vector_std_vector_MR_GraphEdgeId_MR_GraphVertId, endsPerEdge:&meshlib::Vector_MR_Graph_EndVertices_MR_GraphEdgeId)
void	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)
auto	vert_size () const -> usize
auto	valid_verts () const -> &meshlib::GraphVertBitSet
auto	valid_mr_graph_vert_id (v:meshlib::GraphVertId) const -> bool
auto	edge_size () const -> usize
auto	valid_edges () const -> &meshlib::GraphEdgeBitSet
auto	valid_mr_graph_edge_id (e:meshlib::GraphEdgeId) const -> bool
auto	neighbours (v:meshlib::GraphVertId) const -> &meshlib::std_vector_MR_GraphEdgeId
auto	ends (e:meshlib::GraphEdgeId) const -> &meshlib::Graph_EndVertices
auto	find_edge (a:meshlib::GraphVertId, b:meshlib::GraphVertId) const -> meshlib::GraphEdgeId
auto	are_neighbors (a:meshlib::GraphVertId, b:meshlib::GraphVertId) const -> bool
void	merge (remnant:meshlib::GraphVertId, dead:meshlib::GraphVertId, onMergeEdges:&meshlib::std_function_void_from_MR_GraphEdgeId_MR_GraphEdgeId)
auto	check_validity () const -> bool

Static Public Member Functions
static auto	new () -> meshlib::Owned< meshlib::Graph >
static auto	construct_from_another (_other:&meshlib::Graph) -> meshlib::Owned< meshlib::Graph >
Static Public Member Functions inherited from meshlib::CppClass
static void	destroy (ptr:*mut Self)
Static Public Member Functions inherited from meshlib::CppCopy
static auto	copy (ptr:*const Self) -> *mut Self

Detailed Description

mathematical graph consisting from vertices and undirected edges Generated from class MR::Graph.

Generated from class MR::Graph. Heap-allocated instances are held in Owned<Graph>.

Member Function Documentation

are_neighbors()

auto meshlib::Graph::are_neighbors	(	a:meshlib::GraphVertId	,
		b:meshlib::GraphVertId	) const -> bool

returns true if the vertices a and b are neighbors Generated from method MR::Graph::areNeighbors.

Calls MR_Graph_areNeighbors().

assign_from_another()

auto meshlib::Graph::assign_from_another

(

_other:&meshlib::Graph

)

-> &mut meshlib::Graph

Generated from method MR::Graph::operator=.

Calls MR_Graph_AssignFromAnother(). The reference to things referred to by the parameter _other (if any) might be preserved in this object.

check_validity()

auto meshlib::Graph::check_validity

(

)

const -> bool

verifies that all internal data structures are valid Generated from method MR::Graph::checkValidity.

Calls MR_Graph_checkValidity().

construct_2()

void meshlib::Graph::construct_2	(	neighboursPerVertex:&meshlib::Vector_std_vector_MR_GraphEdgeId_MR_GraphVertId	,
		endsPerEdge:&meshlib::Vector_MR_Graph_EndVertices_MR_GraphEdgeId	)

constructs the graph from all valid vertices and edges Generated from method MR::Graph::construct.

Calls MR_Graph_construct_2().

construct_4()

void 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	)

constructs the graph from given data that can contain invalid vertices and edges Generated from method MR::Graph::construct.

Calls MR_Graph_construct_4().

construct_from_another()

auto meshlib::Graph::construct_from_another ( _other:&meshlib::Graph ) -> meshlib::Owned< meshlib::Graph >

static

Generated from constructor MR::Graph::Graph.

Calls MR_Graph_ConstructFromAnother(). The reference to things referred to by the parameter _other (if any) might be preserved in the constructed object.

edge_size()

auto meshlib::Graph::edge_size

(

)

const -> usize

returns the number of edge records, including invalid ones Generated from method MR::Graph::edgeSize.

Calls MR_Graph_edgeSize().

ends()

auto meshlib::Graph::ends

(

e:meshlib::GraphEdgeId

)

const -> &meshlib::Graph_EndVertices

returns the ends of given edge Generated from method MR::Graph::ends.

Calls MR_Graph_ends().

find_edge()

auto meshlib::Graph::find_edge	(	a:meshlib::GraphVertId	,
		b:meshlib::GraphVertId	) const -> meshlib::GraphEdgeId

finds and returns edge between vertices a and b; returns invalid edge otherwise Generated from method MR::Graph::findEdge.

Calls MR_Graph_findEdge().

merge()

void meshlib::Graph::merge	(	remnant:meshlib::GraphVertId	,
		dead:meshlib::GraphVertId	,
		onMergeEdges:&meshlib::std_function_void_from_MR_GraphEdgeId_MR_GraphEdgeId	)

unites two vertices into one (deleting the second one), which leads to deletion and merge of some edges, for which callback is called Generated from method MR::Graph::merge.

Calls MR_Graph_merge().

neighbours()

auto meshlib::Graph::neighbours

(

v:meshlib::GraphVertId

)

const -> &meshlib::std_vector_MR_GraphEdgeId

returns all edges adjacent to given vertex Generated from method MR::Graph::neighbours.

Calls MR_Graph_neighbours().

new()

auto meshlib::Graph::new ( ) -> meshlib::Owned< meshlib::Graph >

static

Constructs an empty (default-constructed) instance.

Calls MR_Graph_DefaultConstruct().

valid_edges()

auto meshlib::Graph::valid_edges

(

)

const -> &meshlib::GraphEdgeBitSet

returns all valid edges in the graph Generated from method MR::Graph::validEdges.

Calls MR_Graph_validEdges().

valid_mr_graph_edge_id()

auto meshlib::Graph::valid_mr_graph_edge_id

(

e:meshlib::GraphEdgeId

)

const -> bool

returns true if given edge is valid Generated from method MR::Graph::valid.

Calls MR_Graph_valid_MR_GraphEdgeId().

valid_mr_graph_vert_id()

auto meshlib::Graph::valid_mr_graph_vert_id

(

v:meshlib::GraphVertId

)

const -> bool

returns true if given vertex is valid Generated from method MR::Graph::valid.

Calls MR_Graph_valid_MR_GraphVertId().

valid_verts()

auto meshlib::Graph::valid_verts

(

)

const -> &meshlib::GraphVertBitSet

returns all valid vertices in the graph Generated from method MR::Graph::validVerts.

Calls MR_Graph_validVerts().

vert_size()

auto meshlib::Graph::vert_size

(

)

const -> usize

returns the number of vertex records, including invalid ones Generated from method MR::Graph::vertSize.

Calls MR_Graph_vertSize().

---

The documentation for this struct was generated from the following file:

• MRGraph.rs