gml2gv.h

Go to the documentation of this file.

 
#include <stdio.h>
#include <cgraph/cgraph.h>
#include <util/list.h>
 
typedef struct {
    unsigned short kind;
    unsigned short sort;
    char* name;
    union {
        char* value;
        void *lp; 
    }u;
} gmlattr;
typedef struct  {…};
 
void free_attr(gmlattr *p);
 
DEFINE_LIST_WITH_DTOR(attrs, gmlattr *, free_attr)
 
typedef struct {
    char* id;
    attrs_t attrlist;  
} gmlnode;
typedef struct {…};
 
void free_node(gmlnode *p);
 
DEFINE_LIST_WITH_DTOR(nodes, gmlnode *, free_node)
 
typedef struct {
    char* source;
    char* target;
    attrs_t attrlist;  
} gmledge;
typedef struct {…};
 
void free_edge(gmledge *p);
 
DEFINE_LIST_WITH_DTOR(edges, gmledge *, free_edge)
 
typedef struct gmlgraph {
    struct gmlgraph* parent;
    int directed;
    attrs_t attrlist;  
    nodes_t nodelist;
    edges_t edgelist;
    void *graphlist; 
} gmlgraph;
typedef struct gmlgraph {…};
 
void free_graph(gmlgraph *p);
 
DEFINE_LIST_WITH_DTOR(graphs, gmlgraph *, free_graph)
 
extern int gmllex(void);
extern void gmllexeof(void);
extern void gmlerror(const char *);
extern int gmlerrors(void);
extern void initgmlscan (FILE*);
extern Agraph_t* gml_to_gv (char*, FILE*, int, int*);