Databases
StackOverflow2013
Postsdbo
POGraph implementation, functions and parameters. What makes more sense?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POGraph implementation, functions and parameters. What makes more sense?
    primarykey
    data
    text
    <p>Just for kind of "fun" I'm developing almost every algorithm (if possible) shown in the book Introduction to Algorithms (Cormen) in C. I've reached the graphs chapters and I'm not sure how to design my functions, but first take a look at my data structures (hope this will make clear my question).</p> <pre><code>typedef struct s_multi_matrix { int width; int height; int depth; multi_matrix_type type; // stores either MMTYPE_INT or MMTYPE_RECORD enums to know where to read values (ivals or rvals) int * ivals; DT_record * rvals; } DT_multi_matrix; typedef struct s_double_linked_list { DT_record * sentinel; } DT_double_linked_list; typedef struct s_record // multi purpose structure { int key; enum e_record_type type; // stores either TYPE_INT, TYPE_SZ, TYPE_FLOAT, TYPE_VOID to know how to use the data union union { int ival; char * sval; float fval; void * vval; } data; struct s_record * left, // for trees, disjoint sets and linked lists * right, * parent; } DT_record; typedef struct s_graph // this is the structure I'm focusing on right now { graph_type type; // GRAPH_DIRECTED or GRAPH_UNDIRECTED graph_adj_type adj_type; // ADJ_LIST or ADJ_MATRIX edge_type etype; // WEIGHTED or NOT_WEIGHTED union { DT_double_linked_list * list; DT_multi_matrix * matrix; } adjacency; } DT_graph; </code></pre> <p>So, I'm thinking about several functions to manipulate the DT_graph type:</p> <pre><code>// takes a pointer to a pointer to a graph, allocates memory and sets properties void build_graph(DT_graph ** graph_ptr, graph_type gtype, graph_adj_type atype); // prints the graph in file (using graphviz) void print_graph(DT_graph * graph, char * graph_name); </code></pre> <p>This is the tricky part, since my graph type has several different type combinations (undirected and weighted edges, directed and weighted edges, undirected and not weighted edges, directed and not weighed edges, ...) I'm wondering which is the best approach for the functions:</p> <pre><code>void dgraph_add_wedge(DT_graph * graph, DT_record * u, DT_record * v, int weight); void ugraph_add_wedge(DT_graph * graph, DT_record * u, DT_record * v, int weight); void dgraph_add_nwedge(DT_graph * graph, DT_record * u, DT_record * v); void ugraph_add_nwedge(DT_graph * graph, DT_record * u, DT_record * v); </code></pre> <p>The first two would add a weighted vertex into a directed / undirected graph and the last two would do the same thing but without any weight related to the edge. The other approach that comes to my mind looks like this:</p> <pre><code>void graph_add_edge(DT_graph * graph, DT_record * u, DT_record * v, edge_type etype, graph_type gtype); </code></pre> <p>This seems like a "golden" method for everything, and depending on the values for etype and gtype would do different operations on the graph.</p> <p>Soooooooo, based upon your experiences and knowledge, what do you recommend?</p> <p>BTW, I'm sure that any one has asked this before, since this is MY implementation.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. USnairdaen
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POGraph implementation, functions and parameters. What makes more sense?
      1. UStagoma
      1. VTFavorite
    1. COYour indentation seems a bit random.
      singulars
      1. POGraph implementation, functions and parameters. What makes more sense?
      1. USCraig Gidney
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload