Inheritance diagram for meshlib.Graph:

Public Member Functions
	Graph (java.lang.foreign.MemorySegment ptr, boolean owned, java.lang.Object owner)
	Graph ()
	Graph (meshlib.Graph _other)
meshlib.Graph	assignFromAnother (meshlib.Graph _other)
void	construct (meshlib.Vector_std_vector_MR_GraphEdgeId_MR_GraphVertId neighboursPerVertex, meshlib.Vector_MR_Graph_EndVertices_MR_GraphEdgeId endsPerEdge)
void	construct (meshlib.Vector_std_vector_MR_GraphEdgeId_MR_GraphVertId neighboursPerVertex, meshlib.GraphVertBitSet validVerts, meshlib.Vector_MR_Graph_EndVertices_MR_GraphEdgeId endsPerEdge, meshlib.GraphEdgeBitSet validEdges)
long	vertSize ()
meshlib.GraphVertBitSet	validVerts ()
boolean	valid (meshlib.GraphVertId v)
long	edgeSize ()
meshlib.GraphEdgeBitSet	validEdges ()
boolean	valid (meshlib.GraphEdgeId e)
meshlib.std_vector_MR_GraphEdgeId	neighbours (meshlib.GraphVertId v)
meshlib.Graph_EndVertices	ends (meshlib.GraphEdgeId e)
meshlib.GraphEdgeId	findEdge (meshlib.GraphVertId a, meshlib.GraphVertId b)
boolean	areNeighbors (meshlib.GraphVertId a, meshlib.GraphVertId b)
void	merge (meshlib.GraphVertId remnant, meshlib.GraphVertId dead, meshlib.std_function_void_from_MR_GraphEdgeId_MR_GraphEdgeId onMergeEdges)
boolean	checkValidity ()
Public Member Functions inherited from meshlib.CppObject
final java.lang.foreign.MemorySegment	rawPointer ()
final boolean	isOwned ()
final void	close ()
final java.lang.foreign.MemorySegment	release ()

Additional Inherited Members
Protected Member Functions inherited from meshlib.CppObject
	CppObject (java.lang.foreign.MemorySegment ptr, java.util.function.Consumer< java.lang.foreign.MemorySegment > destroy, java.lang.Object owner)

Detailed Description

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

Instances created here own their C++ objects, see CppObject.

Constructor & Destructor Documentation

◆ Graph() [1/3]

meshlib.Graph.Graph	(	java.lang.foreign.MemorySegment	ptr,
		boolean	owned,
		java.lang.Object	owner )

Wraps a pointer from the C bindings. If owned, the object is destroyed when the wrapper dies. owner is kept alive as long as this wrapper is. Not for normal use.

◆ Graph() [2/3]

meshlib.Graph.Graph ( )

Constructs an empty (default-constructed) instance.

Calls MR_Graph_DefaultConstruct().

◆ Graph() [3/3]

meshlib.Graph.Graph ( meshlib.Graph _other )

Generated from constructor MR::Graph::Graph. The reference to things referred to by the parameter _other (if any) might be preserved in the constructed object.

Calls MR_Graph_ConstructFromAnother().

Member Function Documentation

◆ areNeighbors()

boolean meshlib.Graph.areNeighbors	(	meshlib.GraphVertId	a,
		meshlib.GraphVertId	b )

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

Calls MR_Graph_areNeighbors().

◆ assignFromAnother()

meshlib.Graph meshlib.Graph.assignFromAnother ( meshlib.Graph _other )

Generated from method MR::Graph::operator=. The reference to things referred to by the parameter _other (if any) might be preserved in this object.

Calls MR_Graph_AssignFromAnother().

◆ checkValidity()

boolean meshlib.Graph.checkValidity ( )

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

Calls MR_Graph_checkValidity().

◆ construct() [1/2]

void meshlib.Graph.construct	(	meshlib.Vector_std_vector_MR_GraphEdgeId_MR_GraphVertId	neighboursPerVertex,
		meshlib.GraphVertBitSet	validVerts,
		meshlib.Vector_MR_Graph_EndVertices_MR_GraphEdgeId	endsPerEdge,
		meshlib.GraphEdgeBitSet	validEdges )

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() [2/2]

void meshlib.Graph.construct	(	meshlib.Vector_std_vector_MR_GraphEdgeId_MR_GraphVertId	neighboursPerVertex,
		meshlib.Vector_MR_Graph_EndVertices_MR_GraphEdgeId	endsPerEdge )

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

Calls MR_Graph_construct_2().

◆ edgeSize()

long meshlib.Graph.edgeSize ( )

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

Calls MR_Graph_edgeSize().

◆ ends()

meshlib.Graph_EndVertices meshlib.Graph.ends ( meshlib.GraphEdgeId e )

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

Calls MR_Graph_ends().

◆ findEdge()

meshlib.GraphEdgeId meshlib.Graph.findEdge	(	meshlib.GraphVertId	a,
		meshlib.GraphVertId	b )

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	(	meshlib.GraphVertId	remnant,
		meshlib.GraphVertId	dead,
		meshlib.std_function_void_from_MR_GraphEdgeId_MR_GraphEdgeId	onMergeEdges )

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

meshlib.std_vector_MR_GraphEdgeId meshlib.Graph.neighbours ( meshlib.GraphVertId v )

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

Calls MR_Graph_neighbours().

◆ valid() [1/2]

boolean meshlib.Graph.valid ( meshlib.GraphEdgeId e )

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

Calls MR_Graph_valid_MR_GraphEdgeId().

◆ valid() [2/2]

boolean meshlib.Graph.valid ( meshlib.GraphVertId v )

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

Calls MR_Graph_valid_MR_GraphVertId().

◆ validEdges()

meshlib.GraphEdgeBitSet meshlib.Graph.validEdges ( )

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

Calls MR_Graph_validEdges().

◆ validVerts()

meshlib.GraphVertBitSet meshlib.Graph.validVerts ( )

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

Calls MR_Graph_validVerts().

◆ vertSize()

long meshlib.Graph.vertSize ( )

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

Calls MR_Graph_vertSize().

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

Graph.java

Public Member Functions

Additional Inherited Members