1 files changed, 150 insertions, 0 deletions
diff --git a/src/lib/eina_graph.c b/src/lib/eina_graph.c
new file mode 100644
index 0000000..1216efc
--- /dev/null
+++ b/src/lib/eina_graph.c
@@ -0,0 +1,150 @@
+/* EINA_GRAPH - EFL graph processing library
+ * Copyright (C) 2013 Jérémy Zurcher
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to
+ * deal in the Software without restriction, including without limitation the
+ * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+ * sell copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies of the Software and its Copyright notices. In addition publicly
+ * documented acknowledgment must be given that this software has been used if no
+ * source code of this software is made available publicly. This includes
+ * acknowledgments in either Copyright notices, Manuals, Publicity and Marketing
+ * documents or any documentation provided with any product containing this
+ * software. This License does not apply to any software that links to the
+ * libraries provided by this software (statically or dynamically), but only to
+ * the software provided.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+ * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+ * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif /* HAVE_CONFIG_H */
+
+#include <eina_graph.h>
+#include "eina_graph_private.h"
+
+EAPI Eina_Graph *
+eina_graph_new(unsigned int v, unsigned int step)
+{
+   _Eina_Graph *_g;
+
+   _g = calloc(1, sizeof(_Eina_Graph) + (v * sizeof(Eina_Graph_Adjacents)));
+   if (!_g)
+     {
+        ERR("calloc failed : %s", strerror(errno));
+        return NULL;
+     }
+
+   _g->step = step;
+   _g->vertices = v;
+   _g->adjs = (Eina_Graph_Adjacents *) ((char *) _g + sizeof(_Eina_Graph));
+
+   return (Eina_Graph *) _g;
+}
+
+EAPI void
+eina_graph_free(Eina_Graph *g)
+{
+   unsigned int i;
+   _Eina_Graph * _g = (_Eina_Graph *) g;
+
+   for (i = 0; i< _g->vertices; i++)
+     eina_graph_adjacents_free(&_g->adjs[i]);
+
+   free(_g);
+}
+
+EAPI unsigned int
+eina_graph_vertices_count(const Eina_Graph *g)
+{
+   _Eina_Graph * _g = (_Eina_Graph *) g;
+
+   return _g->vertices;
+}
+
+EAPI unsigned int
+eina_graph_edges_count(const Eina_Graph *g)
+{
+   _Eina_Graph * _g = (_Eina_Graph *) g;
+
+   return _g->edges;
+}
+
+EAPI unsigned int
+eina_graph_degree(const Eina_Graph *g, unsigned int v)
+{
+   _Eina_Graph * _g = (_Eina_Graph *) g;
+
+   return _g->adjs[v].count;
+}
+
+EAPI unsigned int
+eina_graph_degree_max(const Eina_Graph *g)
+{
+   unsigned int i, n, max;
+   _Eina_Graph * _g = (_Eina_Graph *) g;
+
+   max = 0;
+   for (i = 0; i< _g->vertices; i++)
+     {
+        n = _g->adjs[i].count;
+        if ( n > max ) max = n;
+     }
+
+   return max;
+}
+
+EAPI float
+eina_graph_degree_avg(const Eina_Graph *g)
+{
+   _Eina_Graph * _g = (_Eina_Graph *) g;
+
+   return (2.0 * _g->edges) / _g->vertices;
+}
+
+EAPI unsigned int
+eina_graph_self_loops(const Eina_Graph *g)
+{
+   unsigned int *data;
+   unsigned int i, j, n, loops;
+   _Eina_Graph * _g = (_Eina_Graph *) g;
+
+   loops = 0;
+   for (i = 0; i< _g->vertices; i++)
+     {
+        n = _g->adjs[i].count;
+        data = _g->adjs[i].data;
+        for (j = 0; j < n; j++)
+          {
+             if(i == data[j]) loops++;
+          }
+     }
+
+   return loops;
+}
+
+EAPI Eina_Bool
+eina_graph_edge_add(Eina_Graph *g, unsigned int v, unsigned int w)
+{
+   _Eina_Graph * _g = (_Eina_Graph *) g;
+
+   if ((v >= _g->vertices) || (w >= _g->vertices)) return EINA_FALSE;
+
+   if(!eina_graph_adjacents_push(&_g->adjs[v], w, _g->step)) return EINA_FALSE;
+   if (v != w )
+     if(!eina_graph_adjacents_push(&_g->adjs[w], v, _g->step)) return EINA_FALSE;
+
+   _g->edges++;
+
+   return EINA_TRUE;
+}