English
_ugraph.c
资源名称：leda.tar.gz [点击查看]
上传用户：gzelex
上传日期：2007-01-07
资源大小：707k
文件大小：2k
源码类别：
数值算法/人工智能
开发平台：
MultiPlatform
- /*******************************************************************************
- +
- + LEDA-R 3.2.3
- +
- + _ugraph.c
- +
- + Copyright (c) 1995 by Max-Planck-Institut fuer Informatik
- + Im Stadtwald, 66123 Saarbruecken, Germany
- + All rights reserved.
- +
- *******************************************************************************/
- #include <LEDA/ugraph.h>
- //------------------------------------------------------------------------------
- // undirected graphs
- //------------------------------------------------------------------------------
- // ugraph subgraph constructors:
- ugraph::ugraph(ugraph& G, const list<node>& nl, const list<edge>& el)
- { // construct subugraph (nl,el) of ugraph G
- parent = &G;
- node v,w;
- edge e;
- node* N = new node[G.max_n_index+1];
- forall(v,nl)
- { if (graph_of(v) != parent)
- error_handler(1,"ugraph: illegal node in subgraph constructor");
- N[v->name] = new_node(v);
- }
- forall(e,el)
- { v = source(e);
- w = target(e);
- if ( graph_of(e)!= parent || N[v->name]==0 || N[w->name]==0 )
- error_handler(1,"ugraph: illegal edge in subgraph constructor");
- new_edge(N[v->name],N[w->name],e);
- }
- delete N;
- }
- ugraph::ugraph(ugraph& G, const list<edge>& el)
- { // construct subgraph of ugraph G with edgelist el
- node v,w;
- edge e;
- node* N = new node[G.max_n_index+1];
- forall_nodes(v,G) N[v->name] = 0;
- parent = &G;
- forall(e,el)
- { v = source(e);
- w = target(e);
- if (N[v->name] == 0) N[v->name] = new_node(v);
- if (N[w->name] == 0) N[w->name] = new_node(w);
- if ( graph_of(e) != parent )
- error_handler(1,"ugraph: illegal edge in subgraph constructor");
- new_edge(N[v->name],N[w->name],e);
- }
- delete N;
- }
