OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	02/16/2024 09:01:52 PM	rwxr-xr-x
📄 __init__.py	537 bytes	11/13/2023 09:31:06 PM	rw-r--r--
📁 __pycache__	-	02/16/2024 09:01:52 PM	rwxr-xr-x
📁 compat	-	02/16/2024 09:01:52 PM	rwxr-xr-x
📄 providers.py	4.44 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 reporters.py	1.37 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 resolvers.py	14.67 KB	11/13/2023 09:31:06 PM	rw-r--r--
📄 structs.py	1.97 KB	11/13/2023 09:31:06 PM	rw-r--r--

Editing: structs.py

class DirectedGraph(object):
    """A graph structure with directed edges.
    """

def __init__(self):
        self._vertices = set()
        self._forwards = {}  # <key> -> Set[<key>]
        self._backwards = {}  # <key> -> Set[<key>]

def __iter__(self):
        return iter(self._vertices)

def __len__(self):
        return len(self._vertices)

def __contains__(self, key):
        return key in self._vertices

def copy(self):
        """Return a shallow copy of this graph.
        """
        other = DirectedGraph()
        other._vertices = set(self._vertices)
        other._forwards = {k: set(v) for k, v in self._forwards.items()}
        other._backwards = {k: set(v) for k, v in self._backwards.items()}
        return other

def add(self, key):
        """Add a new vertex to the graph.
        """
        if key in self._vertices:
            raise ValueError("vertex exists")
        self._vertices.add(key)
        self._forwards[key] = set()
        self._backwards[key] = set()

def remove(self, key):
        """Remove a vertex from the graph, disconnecting all edges from/to it.
        """
        self._vertices.remove(key)
        for f in self._forwards.pop(key):
            self._backwards[f].remove(key)
        for t in self._backwards.pop(key):
            self._forwards[t].remove(key)

def connected(self, f, t):
        return f in self._backwards[t] and t in self._forwards[f]

def connect(self, f, t):
        """Connect two existing vertices.

Nothing happens if the vertices are already connected.
        """
        if t not in self._vertices:
            raise KeyError(t)
        self._forwards[f].add(t)
        self._backwards[t].add(f)

def iter_edges(self):
        for f, children in self._forwards.items():
            for t in children:
                yield f, t

def iter_children(self, key):
        return iter(self._forwards[key])

def iter_parents(self, key):
        return iter(self._backwards[key])