IEEEDAY: workshop:Graph Theory

#graph-theory #IEEE #INSAT #insat #CS #cs_chapter #IEEEXtreme #CP #workshop #programming #event #computer #ieeeday
Share

 Workshop:Graph Theory

Goals and objectives:
The main goal of this workshop was to introduce participants to the core concepts of graph theory, a fundamental area in computer science and competitive programming. The session aimed to provide attendees with a solid understanding of how graphs can model networks, relationships, and problem-solving scenarios.

Facilitator/Speaker: LETAIEF BOUKAMCHA ADEM

Description of the session:
The workshop began with an overview of graphs, including definitions of vertices and edges, and the differences between directed, undirected, weighted, and unweighted graphs. Participants learned about graph representations, such as adjacency lists and matrices, and explored important properties like connectivity and degree.

The session then moved to practical algorithms, covering Depth-First Search (DFS) and Breadth-First Search (BFS), with explanations on their implementation and applications. Participants were shown how these algorithms can solve problems such as detecting cycles, finding connected components, and computing shortest paths.

Hands-on exercises allowed attendees to implement simple graphs and traversals, reinforcing their understanding of the theoretical concepts. The facilitator also highlighted real-world applications in networking, social media analysis, and competitive programming challenges.

Insights from feedback:
Participants reported gaining a clear understanding of graph theory fundamentals and valued the combination of theory and practical coding. Many expressed interest in exploring more advanced algorithms in the future.

Summary:
The workshop was successful in providing both conceptual clarity and hands-on experience. The structured teaching and illustrative examples made complex ideas accessible to all participants.

Future recommendations:
Future sessions could include advanced graph algorithms such as Dijkstra’s, Floyd-Warshall, Minimum Spanning Trees, and network flow, to deepen participants’ skills.

The workshop took place as part of the IEEE Day activities.

Written by CS Chapter General Secretary,
Ons Sassi



  Date and Time

  Location

  Hosts

  Registration



  • Add_To_Calendar_icon Add Event to Calendar
  • 676 Centre Urbain Nord BP, Tunis 1080
  • Tunis, Tunis, Tunis
  • Tunisia Tunisia 1080

  • Contact Event Hosts


  Speakers

Adem Letaief Boukamcha

Biography:

Software Engineering student at INSAT | Competitive programmer | ACPC Finalist





  Media

IMG_2010 1.52 MiB
566218495_1354267929735387_5675565265753799581_n 58.06 KiB
569213743_1354267899735390_3153214048768451739_n 132.03 KiB