/*
    This software may only be used by you under license from AT&T Corp.
    ("AT&T").  A copy of AT&T's Source Code Agreement is available at
    AT&T's Internet website having the URL:
    <http://www.research.att.com/sw/tools/graphviz/license/source.html>
    If you received this software without first entering into a license
    with AT&T, you have an infringing copy of this software and cannot use
    it without violating AT&T's intellectual property rights.
*/

#if _PACKAGE_AST
_BEGIN_EXTERNS_ /* public data */
#endif

/* tabs at 8, or you're a sorry loser */

extern void		abomination(Agraph_t *);
extern void		acyclic(Agraph_t *);
extern void		add_to_component(Agnode_t *);
extern void		add_tree_edge(Agedge_t *);
extern void		allocate_aux_edges(Agraph_t *);
extern void		allocate_ranks(Agraph_t *);
extern void		arrow_flags (edge_t *e, int *sflag, int *eflag);
extern double	arrow_length (edge_t *e, int flag);
extern void		basic_merge(Agedge_t *, Agedge_t *);
extern void		begin_component(void);
extern shape_desc	*bind_shape(char* name);
extern unsigned char	bothdowncandidates(Agnode_t *, Agnode_t *);
extern unsigned char	bothupcandidates(Agnode_t *, Agnode_t *);
extern void		build_ranks(Agraph_t *, int);
extern void		build_skeleton(Agraph_t *, Agraph_t *);
extern void		class1(Agraph_t *);
extern void		class2(Agraph_t *);
extern void		cleanup1(Agraph_t *);
extern Agnode_t		*clone_vn(Agraph_t *, Agnode_t *);
extern void		cluster_leader(Agraph_t *);
extern void		collapse_cluster(Agraph_t *, Agraph_t *);
extern void		collapse_leaves(Agraph_t *);
extern void		collapse_rankset(Agraph_t *, Agraph_t *, int);
extern void		collapse_sets(Agraph_t *);
extern void		compress_graph(Agraph_t *);
extern void		compute_bb(Agraph_t *, Agraph_t *);
extern void		contain_clustnodes(Agraph_t *);
extern void		contain_nodes(Agraph_t *);
extern void		contain_subclust(Agraph_t *);
extern void		create_aux_edges(Agraph_t *);
extern void		decompose(Agraph_t *, int);
extern void		delete_fast_edge(Agedge_t *);
extern void		delete_fast_node(Agraph_t *, Agnode_t *);
extern void		delete_flat_edge(Agedge_t *);
extern void		delete_other_edge(Agedge_t *);
extern void		dfs(Agnode_t *);
extern void		dfs_cutval(Agnode_t *, Agedge_t *);
extern void		dfs_enter_inedge(Agnode_t *);
extern void		dfs_enter_outedge(Agnode_t *);
extern int		dfs_range(Agnode_t *, Agedge_t *, int);
extern void		do_leaves(Agraph_t *, Agnode_t *);
extern void		do_ordering(Agraph_t *, int);
extern void		dot_cleanup(graph_t* g);
extern void		dot_cleanup_edge(edge_t* e);
extern void		dot_cleanup_graph(graph_t* g);
extern void		dot_cleanup_node(node_t* n);
extern void		dot_free_splines(edge_t* e);
extern void		dot_init_node_edge(Agraph_t *);
extern void		dot_init_edge(Agedge_t *);
extern void		dot_init_node(Agnode_t *);
extern void		dot_layout(Agraph_t *g);
extern void		dot_init_graph(graph_t *g);
extern unsigned char	downcandidate(Agnode_t *);
extern void		edgelabel_ranks(Agraph_t *);
extern void		end_component(void);
extern void		enqueue(queue *, Agnode_t *);
extern Agedge_t		*enter_edge(Agedge_t *);
extern void		exchange(Agnode_t *, Agnode_t *);
extern void		exchange_tree_edges(Agedge_t *, Agedge_t *);
extern void		expand_cluster(Agraph_t *);
extern void		expand_leaves(Agraph_t *);
extern void		expand_ranksets(Agraph_t *);
extern Agedge_t		*fast_edge(Agedge_t *);
extern void		fast_node(Agraph_t *, Agnode_t *);
extern void		fast_nodeapp(Agnode_t *, Agnode_t *);
extern void		feasible_tree(void);
extern void		find_clusters(Agraph_t *);
extern Agedge_t		*find_fast_edge(Agnode_t *, Agnode_t *);
extern Agnode_t		*find_fast_node(Agraph_t *, Agnode_t *);
extern Agedge_t		*find_flat_edge(Agnode_t *, Agnode_t *);
extern void		findlr(Agnode_t *, Agnode_t *, int *, int *);
extern void		flat_edge(Agraph_t *, Agedge_t *);
extern int		flat_edges(Agraph_t *);
extern int		flat_limits(Agraph_t *, Agedge_t *);
extern int		flat_mval(Agnode_t *);
extern void		flat_node(Agedge_t *);
extern int		idealsize(Agraph_t *, double);
extern Agnode_t		*incident(Agedge_t *);
extern int		in_cross(Agnode_t *, Agnode_t *);
extern void		incr_width(Agraph_t *, Agnode_t *);
extern void		infuse(Agraph_t *, Agnode_t *);
extern void		init_cutvalues(void);
extern void		init_rank(void);
extern int		inside_cluster(Agraph_t *, Agnode_t *);
extern void		install_cluster(Agraph_t *, Agnode_t *, int, queue *);
extern void		install_in_rank(Agraph_t *, Agnode_t *);
extern void		interclexp(Agraph_t *);
extern void		interclrep(Agraph_t *, Agedge_t *);
extern void		interclust1(Agraph_t *, Agnode_t *, Agnode_t *, Agedge_t *);
extern int		is_a_normal_node_of(Agraph_t *, Agnode_t *);
extern int		is_a_vnode_of_an_edge_of(Agraph_t *, Agnode_t *);
extern int		is_cluster(Agraph_t *);
extern int		is_cluster_edge(Agedge_t *);
extern int		is_fast_node(Agraph_t *, Agnode_t *);
extern void		keepout_othernodes(Agraph_t *);
extern Agnode_t		*label_vnode(Agraph_t *, Agedge_t *);
extern Agnode_t		*leader_of(Agraph_t *, Agnode_t *);
extern Agedge_t		*leave_edge(void);
extern int		left2right(Agraph_t *, Agnode_t *, Agnode_t *);
extern int		local_cross(elist, int);
extern void		LR_balance(void);
extern void     dot_compoundEdges (Agraph_t*);
extern Agedge_t		*make_aux_edge(Agnode_t *, Agnode_t *, int, int);
extern void		make_chain(Agraph_t *, Agnode_t *, Agnode_t *, Agedge_t *);
extern void		make_edge_pairs(Agraph_t *);
extern void		make_interclust_chain(Agraph_t *, Agnode_t *, Agnode_t *, Agedge_t *);
extern void		make_leafslots(Agraph_t *);
extern void		make_LR_constraints(Agraph_t *);
extern void		make_lrvn(Agraph_t *);
extern int		make_new_cluster(Agraph_t *, Agraph_t *);
extern void		make_slots(Agraph_t *, int, int, int);
extern Agnode_t		*make_vn_slot(Agraph_t *, int, int);
extern Agnode_t		*map_interclust_node(Agnode_t *);
extern void		map_path(Agnode_t *, Agnode_t *, Agedge_t *, Agedge_t *, int);
extern void		mark_clusters(Agraph_t *);
extern void		mark_lowclusters(Agraph_t *);
extern int		mergeable(edge_t *e, edge_t *f);
extern void		merge_chain(Agraph_t *, Agedge_t *, Agedge_t *, int);
extern void		merge_components(Agraph_t *);
extern Agnode_t		*merge_leaves(Agraph_t *, Agnode_t *, Agnode_t *);
extern void		merge_oneway(Agedge_t *, Agedge_t *);
extern void		merge_ranks(Agraph_t *);
extern void		mergevirtual(Agraph_t *, int, int, int, int);
extern void		minmax_edges(Agraph_t *);
extern int		ncross(Agraph_t *);
extern queue		*new_queue(int);
extern Agedge_t		*new_virtual_edge(Agnode_t *, Agnode_t *, Agedge_t *);
extern void		node_induce(Agraph_t *, Agraph_t *);
extern int		nonconstraint_edge(Agedge_t *);
extern int		nsiter2(Agraph_t *);
extern int		ordercmpf(int *, int *);
extern void		ordered_edges(Agraph_t *);
extern void		other_edge(Agedge_t *);
extern int		out_cross(Agnode_t *, Agnode_t *);
extern point		place_leaf(Agnode_t *, point, int);
extern Agnode_t		*plain_vnode(Agraph_t *, Agedge_t *);
extern int		portcmp(port_t p0, port_t p1);
extern int		ports_eq(Agedge_t *, Agedge_t *);
extern void		pos_clusters(Agraph_t *);
extern void		potential_leaf(Agraph_t *, Agedge_t *, Agnode_t *);
extern void		rank1(Agraph_t *);
extern void		rank(Agraph_t *, int, int);
extern int		rank_set_class(Agraph_t *);
extern int		rcross(Agraph_t *, int);
extern void		rebuild_vlists(Agraph_t *);
extern void		rec_bb(Agraph_t *, Agraph_t *);
extern void		rec_reset_vlists(Agraph_t *);
extern void		rec_save_vlists(Agraph_t *);
extern void		remove_aux_edges(Agraph_t *);
extern void		remove_rankleaders(Agraph_t *);
extern void		renewlist(elist *);
extern void		reorder(Agraph_t *, int, int, int);
extern void		rerank(Agnode_t *, int);
extern point		resize_leaf(Agnode_t *, point);
extern void		reverse_edge(Agedge_t *);
extern void		routesplinesinit(void);
extern point		*routesplines(path *, int *);
extern void		routesplinesterm(void);
extern void		safe_delete_fast_edge(Agedge_t *);
extern void		safe_list_append(Agedge_t *, elist *);
extern void		safe_other_edge(Agedge_t *);
extern void		save_vlist(Agraph_t *);
extern void		scan_ranks(Agraph_t *);
extern void		scan_result(void);
extern void		search_component(Agraph_t *, Agnode_t *);
extern void		separate_subclust(Agraph_t *);
extern void		setbounds(Agnode_t *, int *, int, int);
extern void		set_aspect(graph_t *g);
extern void		set_minmax(Agraph_t *);
extern void		setup_page(Agraph_t *, point);
extern void		set_xcoords(Agraph_t *);
extern void		set_ycoords(Agraph_t *);
extern int		strccnt(char *, char);
extern void		TB_balance(void);
extern int		tight_tree(void);
extern void		transpose(Agraph_t *, int);
extern int		transpose_step(Agraph_t *, int, int);
extern int		treesearch(Agnode_t *);
extern Agnode_t		*treeupdate(Agnode_t *, Agnode_t *, int, int);
extern void		unmerge_oneway(Agedge_t *);
extern unsigned char	upcandidate(Agnode_t *);
extern void		update(Agedge_t *, Agedge_t *);
extern void		update_bb(Agraph_t *, point);
extern Agedge_t		*virtual_edge(Agnode_t *, Agnode_t *, Agedge_t *);
extern Agnode_t		*virtual_node(Agraph_t *);
extern void		virtual_weight(Agedge_t *);
extern int		vnode_not_related_to(Agraph_t *, Agnode_t *);
extern void		x_cutval(Agedge_t *);
extern int		x_val(Agedge_t *, Agnode_t *, int);
extern void		zapinlist(elist *, Agedge_t *);

#if defined(_BLD_dot) && defined(_DLL)
#   define extern __EXPORT__
#endif
extern void     dot_nodesize(Agnode_t* , boolean);
extern void     dot_concentrate(Agraph_t *);
extern void     dot_mincross(Agraph_t *);
extern void     dot_position(Agraph_t *);
extern void     dot_rank(Agraph_t *);
extern void     dot_sameports(Agraph_t *);
extern void     dot_splines(Agraph_t *);
#undef extern

#ifdef _PACKAGE_AST
_END_EXTERNS_
#endif