This project aims to demonstrate how the BFS and DFS algorithms operate on a simple graph representing a map. The user can specify the start and end points, and the program will display the path found ...

C++ implementations of various graph algorithms such as: Graph Traversals (BFS, DFS), Topological Sort, Shortest Path, and Minimum Spanning Trees. I wrote my own implementations of these graph ...

A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given This paper presents a linear time quasi self-stabilizing algorithm for detecting the set of ...

Graph neural networks (GNNs) generally follow a recursive neighbors aggregation scheme. Recent GNNs are not powerful than the 1-Weisfeiler Lehman test, which is a necessary but insufficient condition ...