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	construct (MR._ByValue_Vector_StdVectorMRGraphEdgeId_MRGraphVertId neighboursPerVertex, MR._ByValue_GraphVertBitSet validVerts, MR._ByValue_Vector_MRGraphEndVertices_MRGraphEdgeId endsPerEdge, MR._ByValue_GraphEdgeBitSet validEdges)
	constructs the graph from given data that can contain invalid vertices and edges Generated from method MR.Graph.construct.
unsafe void	merge (MR.GraphVertId remnant, MR.GraphVertId dead, MR.Std._ByValue_Function_Void_From_MRGraphEdgeId_MRGraphEdgeId 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.
Public Member Functions inherited from MR.Const_Graph
virtual void	Dispose ()
unsafe	Const_Graph ()
	Constructs an empty (default-constructed) instance.
unsafe	Const_Graph (MR._ByValue_Graph _other)
	Generated from constructor MR.Graph.Graph.
	Const_Graph (Const_Graph _other)
	Generated from constructor MR.Graph.Graph.
	Const_Graph (Graph _other)
	Generated from constructor MR.Graph.Graph.
unsafe ulong	vertSize ()
	returns the number of vertex records, including invalid ones Generated from method MR.Graph.vertSize.
unsafe MR.Const_GraphVertBitSet	validVerts ()
	returns all valid vertices in the graph Generated from method MR.Graph.validVerts.
unsafe bool	valid (MR.GraphVertId v)
	returns true if given vertex is valid Generated from method MR.Graph.valid.
unsafe ulong	edgeSize ()
	returns the number of edge records, including invalid ones Generated from method MR.Graph.edgeSize.
unsafe MR.Const_GraphEdgeBitSet	validEdges ()
	returns all valid edges in the graph Generated from method MR.Graph.validEdges.
unsafe bool	valid (MR.GraphEdgeId e)
	returns true if given edge is valid Generated from method MR.Graph.valid.
unsafe MR.Std.Const_Vector_MRGraphEdgeId	neighbours (MR.GraphVertId v)
	returns all edges adjacent to given vertex Generated from method MR.Graph.neighbours.
unsafe MR.Graph.Const_EndVertices	ends (MR.GraphEdgeId e)
	returns the ends of given edge Generated from method MR.Graph.ends.
unsafe MR.GraphEdgeId	findEdge (MR.GraphVertId a, MR.GraphVertId b)
	finds and returns edge between vertices a and b; returns invalid edge otherwise Generated from method MR.Graph.findEdge.
unsafe bool	areNeighbors (MR.GraphVertId a, MR.GraphVertId b)
	returns true if the vertices a and b are neighbors Generated from method MR.Graph.areNeighbors.
unsafe bool	checkValidity ()
	verifies that all internal data structures are valid Generated from method MR.Graph.checkValidity.

Additional Inherited Members
Protected Member Functions inherited from MR.Const_Graph
virtual unsafe void	Dispose (bool disposing)

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

unsafe void MR.Graph.construct ( MR._ByValue_Vector_StdVectorMRGraphEdgeId_MRGraphVertId neighboursPerVertex, MR._ByValue_GraphVertBitSet validVerts, MR._ByValue_Vector_MRGraphEndVertices_MRGraphEdgeId endsPerEdge, MR._ByValue_GraphEdgeBitSet validEdges )

inline

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

construct() [2/2]

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_Void_From_MRGraphEdgeId_MRGraphEdgeId 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