Inheritance diagram for wx.Graph.DirectedGraph< DataType >:

## Public Member Functions | |

void | Add (GraphEdge< DataType > edge) |

void | Add (GraphNode< DataType > newNode) |

DirectedGraph () | |

DataType | GetDataOfNode (int id) |

ICollection< int > | GetEdgesFromNode (int nodeID) |

ICollection< int > | GetEdgesToNode (int nodeID) |

object | MakeReadOnly () |

## Properties | |

ICollection< int[]> | Arcs` [get]` |

bool | IsReadonly` [get]` |

ICollection< int > | NodeIDs` [get]` |

wx.Graph.DirectedGraph< DataType >.DirectedGraph | ( | ) |

void wx.Graph.DirectedGraph< DataType >.Add | ( | GraphEdge< DataType > | edge |
) |

Adds a new edge to the graph. The nodes will be added to the this graph of they are not already parts of the graph.

**Parameters:**-
*edge*The new edge (between two nodes).

**Exceptions:**-
*CannotChangeReadonly*Will be raised if this is readonly. *ApplicationException*Will be raised if the nodes of the edge are already part of another graph.

void wx.Graph.DirectedGraph< DataType >.Add | ( | GraphNode< DataType > | newNode |
) |

Adds a new node to the graph.

**Parameters:**-
*newNode*The new node.

**Exceptions:**-
*CannotChangeReadonly*Will be thrown iff this is readonly. *ApplicationException*Will be thrown iff the new node has already been added to another graph.

DataType wx.Graph.DirectedGraph< DataType >.GetDataOfNode | ( | int | id |
) |

This will return the data that is associated with the graph node of the provided ID.

**Parameters:**-
*id*designates the graph node whose data will be returned.

**Returns:**

Implements wx.Graph.IGraph< DataType >.

ICollection<int> wx.Graph.DirectedGraph< DataType >.GetEdgesFromNode | ( | int | nodeID |
) |

Returns a collection of that nodes A (designated by their IDs) where there is an arc from A to the node designated by `nodeID`

.

**Parameters:**-
*nodeID*The node that is the target of the selected edges

**Returns:**

Implements wx.Graph.IGraph< DataType >.

ICollection<int> wx.Graph.DirectedGraph< DataType >.GetEdgesToNode | ( | int | nodeID |
) |

Returns a collection of that nodes A (designated by their IDs) where there is an edge from the node designated by `nodeID`

to A.

**Parameters:**-
*nodeID*The node that is the target of the selected edges

**Returns:**

Implements wx.Graph.IGraph< DataType >.

object wx.Graph.DirectedGraph< DataType >.MakeReadOnly | ( | ) |

ICollection<int[]> wx.Graph.DirectedGraph< DataType >.Arcs` [get]` |

A collection of tuples of integers that represent the edges between the nodes. The integers are node IDs.

Implements wx.Graph.IGraph< DataType >.

bool wx.Graph.DirectedGraph< DataType >.IsReadonly` [get]` |

True iff this is readonly.

Implements wx.ICanBeMadeReadonly.

ICollection<int> wx.Graph.DirectedGraph< DataType >.NodeIDs` [get]` |

Collection of node IDs.

Implements wx.Graph.IGraph< DataType >.

Manual of the (c) 2003-2011 the wx.NET project at