mrmeshpy.Graph Class Reference

Classes
class	EndVertices

Public Member Functions
None	__init__ (self)
None	__init__ (self, Graph arg0)
bool	areNeighbors (self, GraphVertId a, GraphVertId b)
bool	checkValidity (self)
None	construct (self, Vector_std_vector_GraphEdgeId_GraphVertId neighboursPerVertex, Vector_Graph_EndVertices_GraphEdgeId endsPerEdge)
int	edgeSize (self)
Graph.EndVertices	ends (self, GraphEdgeId e)
GraphEdgeId	findEdge (self, GraphVertId a, GraphVertId b)
None	merge (self, GraphVertId remnant, GraphVertId dead, func_void_from_Id_GraphEdgeTag_Id_GraphEdgeTag onMergeEdges)
std_vector_Id_GraphEdgeTag	neighbours (self, GraphVertId v)
bool	valid (self, GraphVertId v)
bool	valid (self, GraphEdgeId e)
GraphEdgeBitSet	validEdges (self)
GraphVertBitSet	validVerts (self)
int	vertSize (self)

Static Public Attributes
	EdgeBitSet
	EdgeId = GraphEdgeId
	EndsPerEdge = Vector_Graph_EndVertices_GraphEdgeId
	Neighbours = std_vector_Id_GraphEdgeTag
	NeighboursPerVertex = Vector_std_vector_GraphEdgeId_GraphVertId
	VertBitSet = GraphVertBitSet
	VertId = GraphVertId

Static Protected Member Functions
	_pybind11_conduit_v1_ (*args, **kwargs)

Detailed Description

Generated from:  MR::Graph

mathematical graph consisting from vertices and undirected edges

Constructor & Destructor Documentation

__init__() [1/2]

None mrmeshpy.Graph.__init__

(

self

)

Implicit default constructor.

__init__() [2/2]

None mrmeshpy.Graph.__init__	(		self,
		Graph	arg0 )

Implicit copy constructor.

Member Function Documentation

_pybind11_conduit_v1_()

mrmeshpy.Graph._pybind11_conduit_v1_ ( * args, ** kwargs )

staticprotected

areNeighbors()

bool mrmeshpy.Graph.areNeighbors	(		self,
		GraphVertId	a,
		GraphVertId	b )

returns true if the vertices a and b are neighbors

checkValidity()

bool mrmeshpy.Graph.checkValidity

(

self

)

verifies that all internal data structures are valid

construct()

None mrmeshpy.Graph.construct	(		self,
		Vector_std_vector_GraphEdgeId_GraphVertId	neighboursPerVertex,
		Vector_Graph_EndVertices_GraphEdgeId	endsPerEdge )

constructs the graph from all valid vertices and edges

edgeSize()

int mrmeshpy.Graph.edgeSize

(

self

)

returns the number of edge records, including invalid ones

ends()

Graph.EndVertices mrmeshpy.Graph.ends	(		self,
		GraphEdgeId	e )

returns the ends of given edge

findEdge()

GraphEdgeId mrmeshpy.Graph.findEdge	(		self,
		GraphVertId	a,
		GraphVertId	b )

finds and returns edge between vertices a and b; returns invalid edge otherwise

merge()

None mrmeshpy.Graph.merge	(		self,
		GraphVertId	remnant,
		GraphVertId	dead,
		func_void_from_Id_GraphEdgeTag_Id_GraphEdgeTag	onMergeEdges )

unites two vertices into one (deleting the second one),
which leads to deletion and merge of some edges, for which callback is called

neighbours()

std_vector_Id_GraphEdgeTag mrmeshpy.Graph.neighbours	(		self,
		GraphVertId	v )

returns all edges adjacent to given vertex

valid() [1/2]

bool mrmeshpy.Graph.valid	(		self,
		GraphEdgeId	e )

returns true if given edge is valid

valid() [2/2]

bool mrmeshpy.Graph.valid	(		self,
		GraphVertId	v )

returns true if given vertex is valid

validEdges()

GraphEdgeBitSet mrmeshpy.Graph.validEdges

(

self

)

returns all valid edges in the graph

validVerts()

GraphVertBitSet mrmeshpy.Graph.validVerts

(

self

)

returns all valid vertices in the graph

vertSize()

int mrmeshpy.Graph.vertSize

(

self

)

returns the number of vertex records, including invalid ones

Member Data Documentation

EdgeBitSet

mrmeshpy.Graph.EdgeBitSet

static

EdgeId

mrmeshpy.Graph.EdgeId = GraphEdgeId

static

EndsPerEdge

mrmeshpy.Graph.EndsPerEdge = Vector_Graph_EndVertices_GraphEdgeId

static

Neighbours

mrmeshpy.Graph.Neighbours = std_vector_Id_GraphEdgeTag

static

NeighboursPerVertex

mrmeshpy.Graph.NeighboursPerVertex = Vector_std_vector_GraphEdgeId_GraphVertId

static

VertBitSet

mrmeshpy.Graph.VertBitSet = GraphVertBitSet

static

VertId

mrmeshpy.Graph.VertId = GraphVertId

static

---

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

• mrmeshpy.pyi