Home | Trees | Indices | Help |
---|
|
object --+ | Graph --+ | UndirectedGraph
This class defines the Undirected Graph. The Undirected Graph class extends the Graph class, and has some behaviour customised for an undirected graph.
|
|||
Inherited from |
|
|||
|
|||
integer |
|
||
integer |
|
||
Inherited from Inherited from |
|
|||
|
|||
__abstractmethods__ =
|
|||
Inherited from |
|
|||
Inherited from |
|
The default connector of an undirected graph is an edge.
|
Returns the degree of vertex i, since indegree and outdegree are equivalent in a directed graph.
|
Returns the number of edges of this graph. The size of an undirected graph is defined as the number of edges. Since the inner representation object only stores the number of arcs, this number of arcs must be halved. However, self-arcs are NOT counted twice, and halving this number leads to errors. Therefore, the number of edges is equal to half the number of non-self arcs, plus the self-arc.
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Thu Feb 25 13:23:34 2010 | http://epydoc.sourceforge.net |