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) |
Generated from: MR::Graph mathematical graph consisting from vertices and undirected edges
None meshlib.mrmeshpy.Graph.__init__ | ( | self | ) |
Implicit default constructor.
None meshlib.mrmeshpy.Graph.__init__ | ( | self, | |
Graph | arg0 ) |
Implicit copy constructor.
bool meshlib.mrmeshpy.Graph.areNeighbors | ( | self, | |
GraphVertId | a, | ||
GraphVertId | b ) |
returns true if the vertices a and b are neighbors
bool meshlib.mrmeshpy.Graph.checkValidity | ( | self | ) |
verifies that all internal data structures are valid
None meshlib.mrmeshpy.Graph.construct | ( | self, | |
Vector_std_vector_GraphEdgeId_GraphVertId | neighboursPerVertex, | ||
Vector_Graph_EndVertices_GraphEdgeId | endsPerEdge ) |
constructs the graph from all valid vertices and edges
int meshlib.mrmeshpy.Graph.edgeSize | ( | self | ) |
returns the number of edge records, including invalid ones
Graph.EndVertices meshlib.mrmeshpy.Graph.ends | ( | self, | |
GraphEdgeId | e ) |
returns the ends of given edge
GraphEdgeId meshlib.mrmeshpy.Graph.findEdge | ( | self, | |
GraphVertId | a, | ||
GraphVertId | b ) |
finds and returns edge between vertices a and b; returns invalid edge otherwise
None meshlib.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
std_vector_Id_GraphEdgeTag meshlib.mrmeshpy.Graph.neighbours | ( | self, | |
GraphVertId | v ) |
returns all edges adjacent to given vertex
bool meshlib.mrmeshpy.Graph.valid | ( | self, | |
GraphEdgeId | e ) |
returns true if given edge is valid
bool meshlib.mrmeshpy.Graph.valid | ( | self, | |
GraphVertId | v ) |
returns true if given vertex is valid
GraphEdgeBitSet meshlib.mrmeshpy.Graph.validEdges | ( | self | ) |
returns all valid edges in the graph
GraphVertBitSet meshlib.mrmeshpy.Graph.validVerts | ( | self | ) |
returns all valid vertices in the graph
int meshlib.mrmeshpy.Graph.vertSize | ( | self | ) |
returns the number of vertex records, including invalid ones
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |