|
32 | 32 | "cell_type": "markdown",
|
33 | 33 | "metadata": {},
|
34 | 34 | "source": [
|
35 |
| - "## Spanning tree" |
| 35 | + "## Definitions: out-tree, spanning tree / tree cover, etc." |
36 | 36 | ]
|
37 | 37 | },
|
38 | 38 | {
|
|
191 | 191 | "cell_type": "markdown",
|
192 | 192 | "metadata": {},
|
193 | 193 | "source": [
|
194 |
| - "## DFS numbering for DAGs" |
| 194 | + "## _min-post_ intervals in directed acyclic graphs (DAGs)" |
195 | 195 | ]
|
196 | 196 | },
|
197 | 197 | {
|
|
362 | 362 | "On the other hand, one can show that $\\tilde{I}_v \\not\\subseteq \\tilde{I}_u \\implies u \\not\\leadsto v$."
|
363 | 363 | ]
|
364 | 364 | },
|
| 365 | + { |
| 366 | + "cell_type": "markdown", |
| 367 | + "metadata": {}, |
| 368 | + "source": [ |
| 369 | + "## Extending _min-post_ intervals for graphs" |
| 370 | + ] |
| 371 | + }, |
| 372 | + { |
| 373 | + "cell_type": "markdown", |
| 374 | + "metadata": {}, |
| 375 | + "source": [ |
| 376 | + "This section describes various extensions to the _min-post_ intervals (DFS numbering) going beyond those negative-cut and positive-cut filters described above." |
| 377 | + ] |
| 378 | + }, |
| 379 | + { |
| 380 | + "cell_type": "markdown", |
| 381 | + "metadata": {}, |
| 382 | + "source": [ |
| 383 | + "### Multiple intervals labelling: GRAIL (TODO)" |
| 384 | + ] |
| 385 | + }, |
365 | 386 | {
|
366 | 387 | "cell_type": "markdown",
|
367 | 388 | "metadata": {},
|
|
511 | 532 | "cell_type": "markdown",
|
512 | 533 | "metadata": {},
|
513 | 534 | "source": [
|
514 |
| - "## Computing DFS intervals labelling" |
| 535 | + "## Visualizing DFS intervals on example graphs" |
515 | 536 | ]
|
516 | 537 | },
|
517 | 538 | {
|
|
531 | 552 | "TODO"
|
532 | 553 | ]
|
533 | 554 | },
|
534 |
| - { |
535 |
| - "cell_type": "markdown", |
536 |
| - "metadata": {}, |
537 |
| - "source": [ |
538 |
| - "### Examples of spanning trees and min-post tree intervals labelling" |
539 |
| - ] |
540 |
| - }, |
541 | 555 | {
|
542 | 556 | "cell_type": "code",
|
543 | 557 | "execution_count": null,
|
544 | 558 | "metadata": {},
|
545 | 559 | "outputs": [],
|
546 | 560 | "source": [
|
| 561 | + "# this is needed for example (small) graphs\n", |
547 | 562 | "import git_commit_graph_ext.example_graphs as graphs"
|
548 | 563 | ]
|
549 | 564 | },
|
|
561 | 576 | "cell_type": "markdown",
|
562 | 577 | "metadata": {},
|
563 | 578 | "source": [
|
564 |
| - "Draw a small DAG (from FELINE paper) and its spanning tree, together with _min-post_ tree intervals" |
| 579 | + "### Examples of spanning trees and min-post tree intervals labelling" |
| 580 | + ] |
| 581 | + }, |
| 582 | + { |
| 583 | + "cell_type": "markdown", |
| 584 | + "metadata": {}, |
| 585 | + "source": [ |
| 586 | + "Draw a small DAG (from FELINE paper) and its spanning tree, like on Figure 8 of the FELINE paper, together with its _min-post_ tree intervals." |
565 | 587 | ]
|
566 | 588 | },
|
567 | 589 | {
|
|
738 | 760 | " "
|
739 | 761 | ]
|
740 | 762 | },
|
| 763 | + { |
| 764 | + "cell_type": "markdown", |
| 765 | + "metadata": {}, |
| 766 | + "source": [ |
| 767 | + "## Computing DFS intervals labelling" |
| 768 | + ] |
| 769 | + }, |
741 | 770 | {
|
742 | 771 | "cell_type": "markdown",
|
743 | 772 | "metadata": {},
|
|
0 commit comments