These three classes (Match.java, graph.java and Tuple.java) are used to determine if sub-graph isomorphisms exist between two given graphs. The algorithm uses a depth-first resursive search method to ...

This library solves the problem of working with graphs in a structured, reusable way. It provides implementations of essential graph algorithms that are commonly used in computer science applications, ...