Does anyone know where I can find the implementation of the algorithm for converting the activity of a node graph (aka activity-to-node graph) on an event node graph (aka activiy-on-arrow graph)
If you don't know what I'm talking about, look here: http://www.brpreiss.com/books/opus7/html/page581.html
Please provide a working answer in your answer.
Thanks in advance.
- node v v_in v_out, , . (u, v) u_out v_in .
v
v_in
v_out
(u, v)
u_out
, :
- node - - . , - . , , . , . graph event-node.
, . , node event node, - node node , .
node node , , A->B->C A->A'->B->B'->C-C'. node, , , .
A->B->C
A->A'->B->B'->C-C'
foreach node in graph if count of incoming_arrows != 1 { Create new node Assign incoming arrows from old node to new node Create arrow from new node to old node Assign cost 0 to new node } endif end foreach foreach arrow in graph Assign cost of destination node to cost of arrow /* if you want ...preceded by "node name:" to get F:5 */ end foreach Rename the nodes
The required data structures are something like
struct node node_name string node_cost int struct arrow arrow_form_node node arrow_to_node node arrow_cost int
Source: https://habr.com/ru/post/1746792/More articles:What is the best way to store versions when writing a Wiki application? - data-modelingPHP echo text if variable is empty - variableshttps://translate.googleusercontent.com/translate_c?depth=1&pto=aue&rurl=translate.google.com&sl=ru&sp=nmt4&tl=en&u=https://fooobar.com/questions/1746789/should-i-allow-my-clients-to-open-ticketsaccess-trac&usg=ALkJrhh3vqTarm53yj4Ix3YJjOOS7LSoDgКаким образом следует учитывать представления пользователей UIScrollView о своих границах для contentSize? - iphoneSaving wiki versions in Google App Engine / Django - Changing this existing code - pythonWhat Wikipedia uses to mark text and version - stringmatlab non-integration index indexing - matlabPHP echo request result in class? - phpArbitrary random numbers in C: generation for Monte Carlo simulation without atmospheric noise - cPthread Queue System - c ++All Articles