• Главная
• FastGraph
• BidirectionalGraph

C# Класс FastGraph.BidirectionalGraph

Показать файл Открыть проект

Private Properties

Свойство	Тип	Описание
AddEdgeInternal	bool
Clone	TEdge>.BidirectionalGraph
ICloneable	object
NotifyEdgesRemoved	void
NotifyVerticesRemoved	void
RemoveEdgesInternal	int
RemoveInOutEdges	IEnumerable

Открытые методы

Метод	Описание
AddEdge ( edge ) : bool
AddEdgeRange ( IEnumerable edges ) : int
AddVertex ( vertex ) : bool
AddVertexRange ( IEnumerable vertices ) : int
AddVerticesAndEdge ( edge ) : bool
AddVerticesAndEdgeRange ( IEnumerable edges ) : int
BidirectionalGraph ( ) : System	Initializes a new instance of the BidirectionalGraph{TVertex,TEdge} class.
BidirectionalGraph ( BidirectionalGraph other ) : System	Copy constructor that creates sufficiently deep copy of the graph.
BidirectionalGraph ( bool allowParallelEdges ) : System	Initializes a new instance of the BidirectionalGraph{TVertex,TEdge} class.
BidirectionalGraph ( bool allowParallelEdges, int capacity ) : System	Initializes a new instance of the BidirectionalGraph{TVertex,TEdge} class.
BidirectionalGraph ( bool allowParallelEdges, int vertexCapacity, int edgeCapacity ) : System	Initializes a new instance of the BidirectionalGraph{TVertex,TEdge} class.
Clear ( ) : void
ClearEdges ( vertex ) : void
ClearInEdges ( vertex ) : void
ClearOutEdges ( vertex ) : void
ContainsEdge ( edge ) : bool
ContainsEdge ( source, target ) : bool
ContainsVertex ( vertex ) : bool
Degree ( vertex ) : int
InDegree ( vertex ) : int
InEdge ( vertex, int index ) : TEdge
InEdges ( vertex ) : IEnumerable
IsInEdgesEmpty ( vertex ) : bool
IsOutEdgesEmpty ( vertex ) : bool
MergeVertex ( vertex, EdgeFactory edgeFactory ) : void	Removes the given vertex and merges all its connection to other vertices.
MergeVerticesIf ( VertexPredicate vertexPredicate, EdgeFactory edgeFactory ) : void	Removes vertices matching the given vertexPredicate and merges all their connections to other vertices.
OutDegree ( vertex ) : int
OutEdge ( vertex, int index ) : TEdge
OutEdges ( vertex ) : IEnumerable
RemoveEdge ( edge ) : bool
RemoveEdgeIf ( EdgePredicate predicate ) : int
RemoveInEdgeIf ( vertex, EdgePredicate predicate ) : int
RemoveOutEdgeIf ( vertex, EdgePredicate predicate ) : int
RemoveVertex ( vertex ) : bool
RemoveVertexIf ( VertexPredicate predicate ) : int
TrimEdgeExcess ( ) : void
TryGetEdge ( source, target, &edge ) : bool
TryGetEdges ( source, target, IEnumerable &edges ) : bool
TryGetInEdges ( vertex, IEnumerable &edges ) : bool
TryGetOutEdges ( vertex, IEnumerable &edges ) : bool

Защищенные методы

Метод	Описание
OnEdgeAdded ( edge ) : void	Called on each added edge.
OnEdgeRemoved ( edge ) : void	Called on each removed edge.
OnVertexAdded ( vertex ) : void	Called on each added vertex.
OnVertexRemoved ( vertex ) : void	Called for each removed vertex.

Приватные методы

Метод	Описание
AddEdgeInternal ( edge ) : bool
Clone ( ) : TEdge>.BidirectionalGraph
ICloneable ( ) : object
NotifyEdgesRemoved ( IEnumerable edges ) : void
NotifyVerticesRemoved ( ICollection vertices ) : void
RemoveEdgesInternal ( ICollection edgesToRemove ) : int
RemoveInOutEdges ( vertex ) : IEnumerable

Описание методов