Definition in file eg_edgraph.h.
#include <stdio.h>
#include <limits.h>
#include <stddef.h>
#include "eg_elist.h"
Include dependency graph for eg_edgraph.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Data Structures | |
| struct | EGeDgraph_t |
| structure that holds all graph related structures needed to define a directed graph, and to allow modifications over it. More... | |
| struct | EGeDgraphEdge_t |
| structure that hold all edge related structures needed to define a directed graph, and add/delete/modify it's structure More... | |
| struct | EGeDgraphNode_t |
| structure that hold all node related structures needed to define a graph, and add/delete/modify it's structure More... | |
Defines | |
| #define | EGeDgraphAddEdge(G, head_pt, tail_pt, e) |
| Add an edge to a graph. | |
| #define | EGeDgraphAddNode(G, v) |
| Add a node to the graph. | |
| #define | EGeDgraphChangeHead(G, e, head_pt) |
| Change the head of an edge. | |
| #define | EGeDgraphChangeTail(G, e, tail_pt) |
| Change the tail of an edge. | |
| #define | EGeDgraphClear(G) ; |
| Clear the structure so that we can free it (without memory leaks). Note that this macro does nothing, because it is always safe to free this structure. | |
| #define | EGeDgraphDelEdge(G, e) |
| Delete an edge from a graph. | |
| #define | EGeDgraphDelNode(G, v) |
| Remove a node from a graph. | |
| #define | EGeDgraphEdgeClear(G) ; |
| Clear the structure so that we can free it (without memory leaks). Note that this macro does nothing, because it is always safe to free this structure. | |
| #define | EGeDgraphEdgeInit(e) |
| Initialize an edge as an empty edge, non attached to any graph. | |
| #define | EGeDgraphEdgeReset(edge_pt) EGeDgraphEdgeInit(edge_pt) |
| Reset the given edge pointer as an edge not linked to a graph. | |
| #define | EGeDgraphInit(G) |
| Initialize a graph structure as an empty graph with no members. | |
| #define | EGeDgraphNodeClear(G) |
| Clear the structure so that we can free it (without memory leaks). Note that this macro does nothing, because it is always safe to free this structure. | |
| #define | EGeDgraphNodeInit(v) |
| Initialize a node as an empty non-attached node. | |
| #define | EGeDgraphNodeReset(node_pt) EGeDgraphNodeInit(node_pt) |
| Reset the given node pointer as a node not linked to a graph. | |
| #define | EGeDgraphReset(graph_pt) EGeDgraphInit(graph_pt) |
| Reset the given graph pointer as an empty graph. | |
Typedefs | |
| typedef EGeDgraph_t | EGeDgraph_t |
| structure that holds all graph related structures needed to define a directed graph, and to allow modifications over it. | |
| typedef EGeDgraphEdge_t | EGeDgraphEdge_t |
| structure that hold all edge related structures needed to define a directed graph, and add/delete/modify it's structure | |
| typedef EGeDgraphNode_t | EGeDgraphNode_t |
| structure that hold all node related structures needed to define a graph, and add/delete/modify it's structure | |
1.4.5