Go to the source code of this file.
Data Structures | |
struct | _PmEdge |
An edge in a graph. More... | |
struct | _PmVertice |
A vertice in a graph. More... | |
struct | PmGraph |
A graph, containing vertices and edges. More... | |
Typedefs | |
typedef _PmEdge | PmEdge |
Graph edge. | |
typedef _PmVertice | PmVertice |
Graph vertice. | |
Functions | |
PmGraph * | pmNewGraph (void) |
Creates a new graph. | |
void | pmDestroyGraph (PmGraph *graph) |
Destroys a graph and all associated vertices and edges. | |
PmVertice * | pmNewVertice (void *data) |
Creates a new vertice. | |
void | pmDestroyVertice (PmVertice *vertice) |
Destroys a vertice. | |
PmEdge * | pmNewEdge (PmVertice *target) |
Creates a new edge. | |
void | pmDestroyEdge (PmEdge *edge) |
Destroys an edge. | |
PmVertice * | pmAddVertice (PmGraph *graph, void *data) |
Adds a vertice to the graph with the specified data. | |
PmEdge * | pmAddEdge (PmVertice *parent, PmVertice *target) |
Adds an edge to the graph with the specified vertice as a target. | |
PmGraph * | pmBuildDepGraph (PmBatch *batch) |
Builds a dependency graph from the specified batch of packages. | |
void | pmTSortPackages (PmGraph *graph, PmBatch *batch) |
Performs a topological sort on a graph containing packages. |
This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details.
You should have received a copy of the GNU Library General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
Graph edge.
|
|
Graph vertice.
|
|
Adds an edge to the graph with the specified vertice as a target.
|
|
Adds a vertice to the graph with the specified data.
|
|
Builds a dependency graph from the specified batch of packages.
|
|
Destroys an edge.
|
|
Destroys a graph and all associated vertices and edges. The data stored inside verticies will not be deleted.
|
|
Destroys a vertice. This will not destroy the data inside the vertice.
|
|
Creates a new edge.
|
|
Creates a new graph.
|
|
Creates a new vertice.
|
|
Performs a topological sort on a graph containing packages.
|