This commit is contained in:
parent
0682930521
commit
c74b1b54c1
|
@ -470,6 +470,7 @@ void dags::DAGGraph::nodes_sort_with_belows(int curr_layer, const QList<std::sha
|
|||
}
|
||||
}
|
||||
|
||||
/*
|
||||
void dags::DAGGraph::node_adjust_ingraph_forward(const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes)
|
||||
{
|
||||
int layer_index = 0;
|
||||
|
@ -696,7 +697,7 @@ std::pair<qlonglong, qlonglong> dags::DAGGraph::node_evaluate_with_upstream(std:
|
|||
});
|
||||
return std::make_pair((*prev_it)->layerNumber(), (*prev_it)->sortNumber().toLongLong());
|
||||
}
|
||||
|
||||
*/
|
||||
void dags::DAGGraph::primitiveGraphLayout() {
|
||||
QList<std::shared_ptr<DAGLayerHelper>> sort_seqs;
|
||||
QList<std::shared_ptr<DAGLayerHelper>> refs;
|
||||
|
@ -736,7 +737,7 @@ void dags::DAGGraph::backwardsLayoutImpls()
|
|||
|
||||
void dags::DAGGraph::adjustLayoutImpls()
|
||||
{
|
||||
this->node_adjust_ingraph_forward(this->node_with_layout);
|
||||
//this->node_adjust_ingraph_forward(this->node_with_layout);
|
||||
}
|
||||
|
||||
|
||||
|
|
|
@ -102,18 +102,11 @@ namespace dags {
|
|||
void nodes_sort_with_above(int curr_layer, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
void nodes_sort_with_belows(int curr_layer, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
|
||||
void node_adjust_ingraph_forward(const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
bool node_adjust_inlayer_forward(int curr_layer, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
bool node_adjust_inlayer_partition_indi(int layer_index, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
/**
|
||||
* .
|
||||
*
|
||||
* \param node
|
||||
* \param total_nodes
|
||||
* \return <²ã´Î£¬ÅÅÐòÖµ>
|
||||
*/
|
||||
std::pair<qlonglong, qlonglong> node_evaluate_with_downstream(std::shared_ptr<DAGOrderHelper> node, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
std::pair<qlonglong, qlonglong> node_evaluate_with_upstream(std::shared_ptr<DAGOrderHelper> node, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
//void node_adjust_ingraph_forward(const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
//bool node_adjust_inlayer_forward(int curr_layer, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
//bool node_adjust_inlayer_partition_indi(int layer_index, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
//std::pair<qlonglong, qlonglong> node_evaluate_with_downstream(std::shared_ptr<DAGOrderHelper> node, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
//std::pair<qlonglong, qlonglong> node_evaluate_with_upstream(std::shared_ptr<DAGOrderHelper> node, const QList<std::shared_ptr<DAGOrderHelper>>& total_nodes);
|
||||
|
||||
};
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue