C# (CSharp) Data_Structures_and_Algorithms DirectedAdjSetGraphVertex Examples

Example #1

 protected override void CreateEdgeCore(DirectedAdjSetGraphVertex <T> vertex1, DirectedAdjSetGraphVertex <T> vertex2, double weight)
 {
     if (!ReferenceEquals(vertex1, vertex2) && Data.AreVerticesAdjacent(vertex1, vertex2))
     {
         throw new InvalidOperationException();
     }
     base.CreateEdgeCore(vertex1, vertex2, weight);
 }

Example #2

        internal override void UpdateEdgeData(DirectedAdjSetGraphVertex <T> vertex1, DirectedAdjSetGraphVertex <T> vertex2, Func <EdgeData, EdgeData> updateFunc)
        {
            VertexSetItem setItem = GetVertexSetItem(vertex1, vertex2);

            setItem.EdgeData = updateFunc(setItem.EdgeData);
        }

Example #3

 protected override bool AllowEdge(VertexDisjointSet set, DirectedAdjSetGraphVertex <T> vertex)
 {
     return(true);
 }

Example #4

 internal override void CreateEdge(DirectedAdjSetGraphVertex <T> vertex1, DirectedAdjSetGraphVertex <T> vertex2, double weight)
 {
     List[vertex1.Handle].AddVertex(vertex2, weight);
 }