15#include <graphviz/cgraph.h>
16#include <graphviz/gvc.h>
17#include <graphviz/pack.h>
23int main(
int argc,
char *argv[]) {
28 fp = fopen(argv[1],
"r");
39 for (
size_t i = 0; i < ncc; i++) {
48 for (
size_t i = 0; i < ncc; i++) {
size_t graphviz_node_induce(Agraph_t *g, Agraph_t *edgeset)
int agclose(Agraph_t *g)
deletes a graph, freeing its associated storage
Agraph_t * agread(void *chan, Agdisc_t *disc)
constructs a new graph
int agdelete(Agraph_t *g, void *obj)
deletes object. Equivalent to agclose, agdelnode, and agdeledge for obj being a graph,...
void aginit(Agraph_t *g, int kind, const char *rec_name, int rec_size, int move_to_front)
attach new records to objects of specified kind
int gvFreeLayout(GVC_t *gvc, graph_t *g)
int gvLayout(GVC_t *gvc, graph_t *g, const char *engine)
int gvRender(GVC_t *gvc, graph_t *g, const char *format, FILE *out)
int gvFreeContext(GVC_t *gvc)
Agraph_t ** ccomps(Agraph_t *g, size_t *ncc, char *pfx)
int pack_graph(size_t ng, Agraph_t **gs, Agraph_t *root, bool *fixed)
Pack subgraphs followed by postprocessing.