INGOR
ytAdjGraph.h
1/*
2 math/ytAdjGraph.{h,c} : Adjacent Matrix Graph
3 Copyright (C) 2018, Yoshinori Tamada <tamada A T ytlab.jp>
4 All rights reserved.
5
6 Redistribution and use in source and binary forms, with or without
7 modification, are permitted provided that the following conditions
8 are met:
9
10 * Redistributions of source code must retain the above copyright
11 notice, this list of conditions and the following disclaimer.
12
13 * Redistributions in binary form must reproduce the above copyright
14 notice, this list of conditions and the following disclaimer in
15 the documentation and/or other materials provided with the
16 distribution.
17
18 * Neither the name of Kyoto University nor the names of its
19 contributors may be used to endorse or promote products derived
20 from this software without specific prior written permission.
21
22 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25 FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26 COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27 INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
28 BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
30 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
32 ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33 POSSIBILITY OF SUCH DAMAGE.
34*/
35
36#ifndef __YTLIB_ADJ_GRAPH_H
37#define __YTLIB_ADJ_GRAPH_H
38
39#include "ytGraph.h"
40
41typedef struct {
42#ifdef DOXY
43private:
44#endif
45 ytGraph super;
46 int nodes;
47 char * matrix; /* (u,v) edge is stored in matrix[u + v * nodes]. */
48 int * work; /* for returning a parent list. */
50
51ytAdjGraph * ytAdjGraph_new(int nodes);
52void ytAdjGraph_delete(ytAdjGraph * this);
53int ytAdjGraph_numNodes(const ytAdjGraph * this);
54int ytAdjGraph_numEdges(const ytAdjGraph * this);
55int ytAdjGraph_checkEdge(const ytAdjGraph * this, int src, int dst);
56int ytAdjGraph_degree(const ytAdjGraph * this, int j);
57int ytAdjGraph_numParents(const ytAdjGraph * this, int j);
58int ytAdjGraph_numChildren(const ytAdjGraph * this, int j);
59void ytAdjGraph_addEdge(ytAdjGraph * this, int src, int dst);
60const int * ytAdjGraph_getParents(const ytAdjGraph * this, int j);
61void ytAdjGraph_removeEdge(ytAdjGraph * this, int src, int dst);
62void ytAdjGraph_clear(ytAdjGraph * this);
63void ytAdjGraph_print(const ytAdjGraph * this, FILE * fp);
65void ytAdjGraph_edgeIterNext(const ytAdjGraph * this, ytGraphEdgeIter * iter);
66
67#endif /* __YTLIB_ADJ_GRAPH_H */
Interface class for handling graph structure.
Graph by adjacent matrix.
Definition: ytAdjGraph.h:41
ytGraphEdgeIter * ytAdjGraph_edgeIter(const ytAdjGraph *this)
Generates the ytGraphEdgeIter instance.
Definition: ytAdjGraph.c:332
int ytAdjGraph_numParents(const ytAdjGraph *this, int j)
Returns the number of parents of the specified node.
Definition: ytAdjGraph.c:200
void ytAdjGraph_removeEdge(ytAdjGraph *this, int src, int dst)
Removes the edge.
Definition: ytAdjGraph.c:285
void ytAdjGraph_delete(ytAdjGraph *this)
Deletes the ytAdjGraph instance.
Definition: ytAdjGraph.c:115
int ytAdjGraph_numNodes(const ytAdjGraph *this)
Returnts the number of nodes.
Definition: ytAdjGraph.c:129
int ytAdjGraph_degree(const ytAdjGraph *this, int j)
Returns the number of edges connected to the node.
Definition: ytAdjGraph.c:181
int ytAdjGraph_checkEdge(const ytAdjGraph *this, int src, int dst)
Checks if the specified edge exists in the graph.
Definition: ytAdjGraph.c:167
ytAdjGraph * ytAdjGraph_new(int nodes)
Generates the new ytAdjGraph instance.
Definition: ytAdjGraph.c:67
int ytAdjGraph_numEdges(const ytAdjGraph *this)
Returns the number of edges.
Definition: ytAdjGraph.c:142
void ytAdjGraph_addEdge(ytAdjGraph *this, int src, int dst)
Adds an edge to the graph.
Definition: ytAdjGraph.c:248
Definition: ytGraph.h:53
int ytAdjGraph_numChildren(const ytAdjGraph *this, int j)
Returns the number of children of the specified node.
Definition: ytAdjGraph.c:223
const int * ytAdjGraph_getParents(const ytAdjGraph *this, int j)
Returns the pointer to the parents.
Definition: ytAdjGraph.c:264