Metadata-Version: 2.1
Name: expertsystem
Version: 0.0a1
Summary: UNKNOWN
Home-page: https://github.com/ComPWA/expertsystem
Author: The ComPWA team
Maintainer-email: compwa-admin@ep1.rub.de
License: GPLv3 or later
Description: [![PyPI](https://badge.fury.io/py/expertsystem.svg)](https://pypi.org/project/expertsystem)
        [![Travis CI](https://travis-ci.com/ComPWA/expertsystem.svg?branch=master)](https://travis-ci.com/ComPWA/expertsystem)
        [![Test coverage](https://codecov.io/gh/ComPWA/expertsystem/branch/master/graph/badge.svg)](https://codecov.io/gh/ComPWA/expertsystem)
        [![Codacy Badge](https://api.codacy.com/project/badge/Grade/db355758fb0e4654818b85997f03e3b8)](https://www.codacy.com/gh/ComPWA/expertsystem)
        [![Documentation build status](https://readthedocs.org/projects/expertsystem/badge/?version=latest)](https://pwa.readthedocs.io/projects/expertsystem/)
        [![Code style: black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black)
        
        # PWA Expert System
        
        The goal is to build state transition graphs, going from an initial state to a
        final state
        
        A state transition graph consists of nodes and edges/lines (in correspondence
        to Feynman graphs):
        
        - The connection lines we call particle lines, which are basically a list of
          quantum numbers (QN) that define the particle state (That list can be empty
          at first).
        - The nodes are of type InteractionNode, that contain all information for the
          transition of this specific step. An interaction node has M ingoing lines and
          N outgoing lines (M, N = Integer & M > 0, N > 0) .
        
        ## Concept of building graphs
        
        ### Step 1
        Building of all possible topologies. A topology is a graph, in which the edges
        and nodes are empty (no QN information). See the topology sub-modules.
        
        ### Step 2
        Filling the toplogy graphs with QN information. This means initializing the
        topology graphs with the initial and final state quantum numbers and
        propagating these through the complete graph. Here also the combinatorics of
        the initial and final state should be taken into account.
        
        ### Step 3
        Duplicate the graphs and insert concrete particles for the edges (inserting the
        mass variable).
        
        ### Step 4
        Output to XML model file.
        
Platform: UNKNOWN
Requires-Python: >=3.3
Description-Content-Type: text/markdown
