/// <summary>
/// Generates a datatable of Edges and Nodes. The datatable
/// returned has four columns. in_iNodes is the number of
/// nodes returned.
/// If in_iNodes = 0, then all nodes (and edges) are returned.
/// TYPE N1 N2 SCORE
/// -
/// Type = 1:
/// N1: Node Unique Name (ID)
/// N2: Node Caption
/// Type = 2:
/// N1: Node Unique Name of Split Node (source)
/// N2: Node Unique Name of Target Node (target)
/// SCORE: Edge score (not same as split score)
/// </summary>
/// <returns>DataTable for Nodes and Edges</returns>
[SafeToPrepareAttribute(true)]
public DataTable DTGetNodeGraph(string in_szModel, int in_iNodes)

/// <summary>
/// Generates a list of nodes. The whole dependency net has
/// to be generated first.
/// </summary>
/// <returns>DataTable for Nodes.</returns>
[SafeToPrepareAttribute(true)]
public DataTable DTGetNodes(string in_szModel)

/// <summary>
/// Generates a list of edges
/// </summary>
/// <returns>DataTable for Edges.</returns>
[SafeToPrepareAttribute(true)]
public DataTable DTAddNodes(string in_szModel, string in_newNodes,
string in_existingNodes)
/// <summary>
/// Generates a list of edges
/// </summary>
/// <returns>DataTable for Edges.</returns>
[SafeToPrepareAttribute(true)]
public DataTable DTAddNodesConnected(string in_szModel, string
in_newNodes, string in_existingNodes)

/// <summary>
/// Generates a list of edges
/// </summary>
/// <returns>DataTable for Edges.</returns>
[SafeToPrepareAttribute(true)]
private DataTable DTAddNodesInternal(string in_szModel, string
in_newNodes, string in_existingNodes, bool in_fAddRelated)