/// <summary> /// Parameter Constructor /// </summary> /// <param name="inputGraph">The graph for which the extended blocks are to be found</param> public GAlg_ExtendedBasicBlockFinder(AlgorithmDataRecord io_arg) : base(io_arg) { m_ebbRoots = new List <CGraphNode>(); m_allEbbs = new Dictionary <CGraphNode, List <CGraphNode> >(); // AddSourceGraph(inputGraph); // m_sourceGraph = inputGraph; }
public override void SetAlgorithmicInterface(AlgorithmDataRecord info) { throw new NotImplementedException(); }
public GAlg_DFSSpanningTree(AlgorithmDataRecord io_args) : base(io_args) { m_Mappping = new CIntergraphElementDependences(); }
/// <summary> /// Initializes a new instance of the <see cref="GAlg_EdgeOrientedDFS"/> class. /// </summary> /// <param name="graph">The graph.</param> public GAlg_EdgeOrientedDFS(AlgorithmDataRecord io_args) : base(io_args) { }
/// <summary> /// Constructor /// </summary> /// <param name="graph">Graph to which the algorithm is applied</param> public GAlg_NodeOrientedDFS(AlgorithmDataRecord io_args) : base(io_args) { e_Init += eventHandler1; }
// CONTEXT public GAlg_CondensedGraphBuilder(AlgorithmDataRecord input) : base(input) { m_sourceGraph = input.GetIArgumentOriginGraph(); m_condensedNodeContents = m_sourceGraph[input.GetIArgumentGlobalKey()]; }
public override void SetAlgorithmicInterface(AlgorithmDataRecord input) { }