pycgs 1.0.0

Python implementation of the Coreference-based Graph Search (CGS) algorithm.

Coreference-based Graph Search (CGS)

This is the Python implementation of the CGS algorithm.

Documentation

The documentation for pycgs is available on the documentation website of the ShennongAlpha (ShennongDoc):

• English
• 中文

You can also contribute to the documentation on the ShennongDoc GitHub repository by submitting a pull request:

• English
• 中文

Foundational CGS

from pycgs import cgs

relationships = [('A', 'B'), ('B', 'C'), ('D', 'B'), ('E', 'F')]
primary_terms = cgs.foundational_cgs(relationships)

print(primary_terms)
# Output:
# {'A': 'C', 'B': 'C', 'C': 'C', 'D': 'C', 'E': 'F', 'F': 'F'}

Weighted CGS

from pycgs import cgs

weighted_relationships = [('A', 'B', 1), ('B', 'C', 2), ('D', 'B', 1), ('B', 'E', 1)]
primary_terms = cgs.weighted_cgs(weighted_relationships)

print(primary_terms)
# Output:
# {'A': 'C', 'B': 'C', 'C': 'C', 'D': 'C', 'E': 'E'}