gdl_graph_t Class Reference

Proxy of C++ gdl_graph_t class.

Inheritance diagram for gdl_graph_t:

Public Member Functions
"char *"	get_node_label (self, "int" n)
	get_node_label(self, n) -> char *
"void"	print_graph_attributes (self, "FILE *" fp)
	print_graph_attributes(self, fp)
"bool"	print_node (self, "FILE *" fp, "int" n)
	print_node(self, fp, n) -> bool
"bool"	print_edge (self, "FILE *" fp, "int" i, "int" j)
	print_edge(self, fp, i, j) -> bool
"void"	print_node_attributes (self, "FILE *" fp, "int" n)
	print_node_attributes(self, fp, n)
"int"	size (self)
	size(self) -> int
"int"	node_qty (self)
	node_qty(self) -> int
"bool"	exists (self, "int" node)
	exists(self, node) -> bool
"int"	entry (self)
	entry(self) -> int
"int"	exit (self)
	exit(self) -> int
"int"	nsucc (self, "int" node)
	nsucc(self, node) -> int
"int"	npred (self, "int" node)
	npred(self, node) -> int
"int"	succ (self, "int" node, "int" i)
	succ(self, node, i) -> int
"int"	pred (self, "int" node, "int" i)
	pred(self, node, i) -> int
"bool"	empty (self)
	empty(self) -> bool
"bgcolor_t"	get_node_color (self, "int" n)
	get_node_color(self, n) -> bgcolor_t
"bgcolor_t"	get_edge_color (self, "int" i, "int" j)
	get_edge_color(self, i, j) -> bgcolor_t
"size_t"	nedge (self, "int" node, "bool" ispred)
	nedge(self, node, ispred) -> size_t
"int"	edge (self, "int" node, "int" i, "bool" ispred)
	edge(self, node, i, ispred) -> int
"int"	front (self)
	front(self) -> int
"node_iterator"	begin (self)
	begin(self) -> node_iterator
"node_iterator"	end (self)
	end(self) -> node_iterator
	__init__ (self)
	init(self) -> gdl_graph_t
	__disown__ (self)

Properties
	thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")

Constructor & Destructor Documentation

__init__()

__init__

(

self

)

Parameters

self	PyObject *

Reimplemented in cancellable_graph_t, qflow_chart_t, drawable_graph_t, interactive_graph_t, mbl_graph_t, and simple_graph_t.

Member Function Documentation

__disown__()

__disown__

(

self

)

Reimplemented in cancellable_graph_t, and drawable_graph_t.

begin()

"node_iterator" begin

(

self

)

Reimplemented in simple_graph_t.

edge()

"int" edge	(		self,
		"int"	node,
		"int"	i,
		"bool"	ispred )

Parameters

node	int
i	int
ispred	bool

empty()

"bool" empty

(

self

)

Reimplemented in interactive_graph_t.

end()

"node_iterator" end

(

self

)

Reimplemented in simple_graph_t.

entry()

"int" entry

(

self

)

exists()

"bool" exists	(		self,
		"int"	node )

Parameters

node

int

Reimplemented in interactive_graph_t.

exit()

"int" exit

(

self

)

front()

"int" front

(

self

)

Reimplemented in simple_graph_t.

get_edge_color()

"bgcolor_t" get_edge_color	(		self,
		"int"	i,
		"int"	j )

Parameters

i	int
j	int

get_node_color()

"bgcolor_t" get_node_color	(		self,
		"int"	n )

Parameters

n

int

get_node_label()

"char *" get_node_label	(		self,
		"int"	n )

Parameters

n

int

Reimplemented in qflow_chart_t.

nedge()

"size_t" nedge	(		self,
		"int"	node,
		"bool"	ispred )

Parameters

node	int
ispred	bool

node_qty()

"int" node_qty

(

self

)

Reimplemented in interactive_graph_t.

npred()

"int" npred	(		self,
		"int"	node )

Parameters

node

int

Reimplemented in qflow_chart_t, and interactive_graph_t.

nsucc()

"int" nsucc	(		self,
		"int"	node )

Parameters

node

int

Reimplemented in qflow_chart_t, and interactive_graph_t.

pred()

"int" pred	(		self,
		"int"	node,
		"int"	i )

Parameters

node	int
i	int

Reimplemented in qflow_chart_t, and interactive_graph_t.

print_edge()

"bool" print_edge	(		self,
		"FILE *"	fp,
		"int"	i,
		"int"	j )

Parameters

fp	FILE *
i	int
j	int

print_graph_attributes()

"void" print_graph_attributes	(		self,
		"FILE *"	fp )

Parameters

fp

FILE *

print_node()

"bool" print_node	(		self,
		"FILE *"	fp,
		"int"	n )

Parameters

fp	FILE *
n	int

print_node_attributes()

"void" print_node_attributes	(		self,
		"FILE *"	fp,
		"int"	n )

Parameters

fp	FILE *
n	int

Reimplemented in qflow_chart_t.

size()

"int" size

(

self

)

Reimplemented in qflow_chart_t, and interactive_graph_t.

succ()

"int" succ	(		self,
		"int"	node,
		"int"	i )

Parameters

node	int
i	int

Reimplemented in qflow_chart_t, and interactive_graph_t.

Property Documentation

thisown

thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")

static

---

The documentation for this class was generated from the following file:

• ida_gdl.py