Skip to content

GraphDeinit

Description

Deinitialize graph and all owned node payloads and adjacency storage.

Parameters

Name Direction Description
g in,out Graph to deinitialize.

Usage example (Cross-references)

Usage examples (Cross-references)
    
        MapDeinit(&index);
        GraphDeinit(&graph);
        return result;
    }
    
        MapDeinit(&counts);
        GraphDeinit(&graph);
        return result;
    }
        result      = result && (GraphInDegree(&graph, a) == 0);
    
        GraphDeinit(&graph);
        return result;
    }
        }
    
        GraphDeinit(&graph);
        return false;
    }
        }
    
        GraphDeinit(&graph);
        return false;
    }
        }
    
        GraphDeinit(&graph);
        return false;
    }
        result = result && !GraphNodeVisited(node) && (GraphNodeVisitCount(node) == 0);
    
        GraphDeinit(&graph);
        return result;
    }
        result = result && !GraphNodeVisited(GraphGetNode(&graph, d));
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && (GraphNodeCount(&graph) == 1);
    
        GraphDeinit(&graph);
        return result;
    }
        result = result && (GraphPredecessorAt(&graph, c, 0) == a);
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && (GraphEdgeCount(&graph) == 1);
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && (GraphInDegree(&graph, c) == 0);
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && (GraphInDegree(&graph, a) == 0);
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && (GraphInDegree(&graph, d) == 0);
    
        GraphDeinit(&graph);
        return result;
    }
        result = result && (GraphNodeAt(&graph, reused) == 99);
    
        GraphDeinit(&graph);
        return result;
    }
        (void)GraphNodeVisit(node);
    
        GraphDeinit(&graph);
        return false;
    }
        result = result && (VecPtrAt(&graph.slots, GraphNodeIdIndex(third_id))->generation == (third_generation + 1));
    
        GraphDeinit(&graph);
        return result;
    }
    
        StrDeinit(&name);
        GraphDeinit(&graph);
        return result;
    }
                      graph.alignment == 1 && graph.type_anchor == NULL;
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && GraphContainsNode(&graph, node_id);
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && GraphPredecessorAt(&graph, c, 0) == a;
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && (ZstrCompare(*GraphNodePtrAt(&graph, red), "red") == 0);
    
        GraphDeinit(&graph);
        return result;
    }
        (void)GraphNodeData(&graph_b, node);
    
        GraphDeinit(&graph_b);
        GraphDeinit(&graph_a);
        return false;
    
        GraphDeinit(&graph_b);
        GraphDeinit(&graph_a);
        return false;
    }
        (void)GraphPredecessorAt(&graph, a, 0);
    
        GraphDeinit(&graph);
        return false;
    }
        (void)GraphNeighborAt(&graph, b, 0);
    
        GraphDeinit(&graph);
        return false;
    }
        result      = result && GraphNodeAt(&graph, id1) == 7;
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && GraphPredecessorAt(&graph, c, 0) == a;
    
        GraphDeinit(&graph);
        return result;
    }
        result      = result && (GraphPredecessorAt(&graph, a, 2) == c);
    
        GraphDeinit(&graph);
        return result;
    }
Last updated on