equal
deleted
inserted
replaced
428 } |
428 } |
429 if(connect) addEdge(n,b); |
429 if(connect) addEdge(n,b); |
430 return b; |
430 return b; |
431 } |
431 } |
432 |
432 |
|
433 ///Split an edge. |
|
434 |
|
435 ///This function splits an edge. First a new node \c b is added to the graph, |
|
436 ///then the original edge is re-targetes to \c b. Finally an edge |
|
437 ///from \c b to the original target is added. |
|
438 ///\return The newly created node. |
|
439 ///\warning This functionality cannot be used together with the Snapshot |
|
440 ///feature. |
|
441 Node split(Edge e) |
|
442 { |
|
443 Node b = addNode(); |
|
444 addEdge(b,target(e)); |
|
445 changeTarget(e,b); |
|
446 return b; |
|
447 } |
|
448 |
433 ///Class to make a snapshot of the graph and to restrore to it later. |
449 ///Class to make a snapshot of the graph and to restrore to it later. |
434 |
450 |
435 ///Class to make a snapshot of the graph and to restrore to it later. |
451 ///Class to make a snapshot of the graph and to restrore to it later. |
436 /// |
452 /// |
437 ///The newly added nodes and edges can be removed using the |
453 ///The newly added nodes and edges can be removed using the |