tpl_kgraph_example.cc File Reference

Educational examples for k-connected graphs and connectivity analysis. More...

#include <iostream>
#include <tpl_graph.H>

Include dependency graph for tpl_kgraph_example.cc:

Go to the source code of this file.

Functions
int	main ()

Detailed Description

Educational examples for k-connected graphs and connectivity analysis.

WHAT IS K-CONNECTIVITY?

A graph is k-connected if it remains connected after removing any k-1 vertices Measures robustness: Higher k = more fault-tolerant network

TYPES OF CONNECTIVITY:

• 0-connected: Disconnected graph
• 1-connected: Has bridges (removing 1 edge disconnects)
• 2-connected: No bridges, but has cut vertices
• 3-connected: No single point can disconnect graph

EDGE CONNECTIVITY:

Minimum number of edges to remove to disconnect graph Computed using maximum flow algorithms

WHY IT MATTERS:

Network reliability, fault tolerance, redundancy analysis Critical for designing robust communication/transportation networks

COMPILE & RUN:

g++ -std=c++20 -I.. -o tpl_kgraph_example tpl_kgraph_example.cc ./tpl_kgraph_example

Definition in file tpl_kgraph_example.cc.

Function Documentation

main()

int main

(

)

Definition at line 39 of file tpl_kgraph_example.cc.

References Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::maps().