A directed graph G = (V, E) is said to be singly connected if uqqv implies that there is at most one simple path from u to v for all vertices u, v∈V. An algorithm is designed to test a graph for being singly connected that takes O(|V|2) steps.
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications