MR.Graph Class Reference

mathematical graph consisting from vertices and undirected edges Generated from class MR.Graph. This is the non-const half of the class. More...

Inheritance diagram for MR.Graph:

Public Member Functions
unsafe	Graph ()
	Constructs an empty (default-constructed) instance.
unsafe	Graph (MR._ByValue_Graph _other)
	Generated from constructor MR.Graph.Graph.
	Graph (Const_Graph _other)
	Generated from constructor MR.Graph.Graph.
	Graph (Graph _other)
	Generated from constructor MR.Graph.Graph.
unsafe MR.Graph	assign (MR._ByValue_Graph _other)
	Generated from method MR.Graph.operator=.
unsafe void	construct (MR._ByValue_Vector_StdVectorMRGraphEdgeId_MRGraphVertId neighboursPerVertex, MR._ByValue_Vector_MRGraphEndVertices_MRGraphEdgeId endsPerEdge)
	constructs the graph from all valid vertices and edges Generated from method MR.Graph.construct.
unsafe void	merge (MR.GraphVertId remnant, MR.GraphVertId dead, MR.Std._ByValue_Function_VoidFuncFromMRGraphEdgeIdMRGraphEdgeId 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.

Detailed Description

mathematical graph consisting from vertices and undirected edges Generated from class MR.Graph. This is the non-const half of the class.

Constructor & Destructor Documentation

Graph() [1/4]

unsafe MR.Graph.Graph ( )

inline

Constructs an empty (default-constructed) instance.

Graph() [2/4]

unsafe MR.Graph.Graph ( MR._ByValue_Graph _other )

inline

Generated from constructor MR.Graph.Graph.

Graph() [3/4]

MR.Graph.Graph ( Const_Graph _other )

inline

Generated from constructor MR.Graph.Graph.

Graph() [4/4]

MR.Graph.Graph ( Graph _other )

inline

Generated from constructor MR.Graph.Graph.

Member Function Documentation

assign()

unsafe MR.Graph MR.Graph.assign ( MR._ByValue_Graph _other )

inline

Generated from method MR.Graph.operator=.

construct()

unsafe void MR.Graph.construct ( MR._ByValue_Vector_StdVectorMRGraphEdgeId_MRGraphVertId neighboursPerVertex, MR._ByValue_Vector_MRGraphEndVertices_MRGraphEdgeId endsPerEdge )

inline

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

merge()

unsafe void MR.Graph.merge ( MR.GraphVertId remnant, MR.GraphVertId dead, MR.Std._ByValue_Function_VoidFuncFromMRGraphEdgeIdMRGraphEdgeId onMergeEdges )

inline

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.

---

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

• MRGraph.cs