MR.Const_Graph Class Reference

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

Inheritance diagram for MR.Const_Graph:

Classes
class	_InOptConst_EndVertices
	This is used for optional parameters of class EndVertices with default arguments. This is only used const parameters. For non-const ones we have _InOptMut_EndVertices. Usage:
class	_InOptMut_EndVertices
	This is used for optional parameters of class EndVertices with default arguments. This is only used mutable parameters. For const ones we have _InOptConst_EndVertices. Usage:
struct	_Underlying
class	Const_EndVertices
	Generated from class MR.Graph.EndVertices. This is the const half of the class. More...
class	EndVertices
	Generated from class MR.Graph.EndVertices. This is the non-const half of the class. More...

Public Member Functions
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.

Protected Member Functions
virtual unsafe void	Dispose (bool disposing)

Detailed Description

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

Constructor & Destructor Documentation

Const_Graph() [1/4]

unsafe MR.Const_Graph.Const_Graph ( )

inline

Constructs an empty (default-constructed) instance.

Const_Graph() [2/4]

unsafe MR.Const_Graph.Const_Graph ( MR._ByValue_Graph _other )

inline

Generated from constructor MR.Graph.Graph.

Const_Graph() [3/4]

MR.Const_Graph.Const_Graph ( Const_Graph _other )

inline

Generated from constructor MR.Graph.Graph.

Const_Graph() [4/4]

MR.Const_Graph.Const_Graph ( Graph _other )

inline

Generated from constructor MR.Graph.Graph.

Member Function Documentation

areNeighbors()

unsafe bool MR.Const_Graph.areNeighbors ( MR.GraphVertId a, MR.GraphVertId b )

inline

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

checkValidity()

unsafe bool MR.Const_Graph.checkValidity ( )

inline

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

Dispose() [1/2]

virtual void MR.Const_Graph.Dispose ( )

inlinevirtual

Dispose() [2/2]

virtual unsafe void MR.Const_Graph.Dispose ( bool disposing )

inlineprotectedvirtual

edgeSize()

unsafe ulong MR.Const_Graph.edgeSize ( )

inline

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

ends()

unsafe MR.Graph.Const_EndVertices MR.Const_Graph.ends ( MR.GraphEdgeId e )

inline

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

findEdge()

unsafe MR.GraphEdgeId MR.Const_Graph.findEdge ( MR.GraphVertId a, MR.GraphVertId b )

inline

finds and returns edge between vertices a and b; returns invalid edge otherwise Generated from method MR.Graph.findEdge.

neighbours()

unsafe MR.Std.Const_Vector_MRGraphEdgeId MR.Const_Graph.neighbours ( MR.GraphVertId v )

inline

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

valid() [1/2]

unsafe bool MR.Const_Graph.valid ( MR.GraphEdgeId e )

inline

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

valid() [2/2]

unsafe bool MR.Const_Graph.valid ( MR.GraphVertId v )

inline

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

validEdges()

unsafe MR.Const_GraphEdgeBitSet MR.Const_Graph.validEdges ( )

inline

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

validVerts()

unsafe MR.Const_GraphVertBitSet MR.Const_Graph.validVerts ( )

inline

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

vertSize()

unsafe ulong MR.Const_Graph.vertSize ( )

inline

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

---

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

• MRGraph.cs