Skip to content
GraphEdgeMarkedForRemoval

GraphEdgeMarkedForRemoval

Description

Check whether an edge is currently marked for removal.

Parameters

Name Direction Description
g in Graph owning the edge.
from in Source node id.
to in Destination node id.

Success

Returns true when the edge is flagged for removal but not yet committed. The graph is not modified.

Failure

Returns false when the edge is absent or not marked. The graph is not modified.

Usage example (Cross-references)

Usage examples (Cross-references)
        GraphAddEdge(&graph, a, b);
    
        bool result = !GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && GraphMarkEdgeForRemoval(&graph, a, b);
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, b);
        bool result = !GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && GraphMarkEdgeForRemoval(&graph, a, b);
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && !GraphMarkEdgeForRemoval(&graph, a, b);
        result      = result && GraphUnmarkEdgeForRemoval(&graph, a, b);
        result      = result && !GraphMarkEdgeForRemoval(&graph, a, b);
        result      = result && GraphUnmarkEdgeForRemoval(&graph, a, b);
        result      = result && !GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && !GraphUnmarkEdgeForRemoval(&graph, a, b);
        result      = result && (GraphCommitChanges(&graph) == 0);
        bool result = GraphMarkEdgeForRemoval(&graph, a, b);
        result      = result && GraphMarkEdgeForRemoval(&graph, a, c);
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, c);
        result      = result && GraphUnmarkEdgeForRemoval(&graph, a, b);
        result      = result && GraphMarkEdgeForRemoval(&graph, a, c);
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, c);
        result      = result && GraphUnmarkEdgeForRemoval(&graph, a, b);
        result      = result && !GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, c);
        result      = result && GraphUnmarkEdgeForRemoval(&graph, a, b);
        result      = result && !GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, c);
        result      = result && (GraphCommitChanges(&graph) == 1);
        result      = result && GraphUnmarkEdgeForRemoval(&graph, a, b);
        result      = result && !GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, c);
        result      = result && (GraphCommitChanges(&graph) == 1);
        result      = result && GraphHasEdge(&graph, a, b);
        bool result = GraphMarkEdgeForRemoval(&graph, a, b);
        result      = result && GraphMarkNodeForDeletion(GraphGetNode(&graph, b));
        result      = result && GraphEdgeMarkedForRemoval(&graph, a, b);
        result      = result && GraphNodeMarkedForDeletion(GraphGetNode(&graph, b));
        result      = result && (GraphCommitChanges(&graph) == 2);
Last updated on