Gecko [ goons4good.org ]

Name	Size	Permission	Date
install	[ DIR ]	drwxr-xr-x	2023-06-15 03:41
__init__.py	0 B	-rw-r--r--	2020-04-02 03:45
__init__.pyc	141 B	-rw-r--r--	2023-06-13 03:24
__init__.pyo	141 B	-rw-r--r--	2023-06-13 03:24
admintool.py	11.4 KB	-rw-r--r--	2020-04-02 03:45
admintool.pyc	11.68 KB	-rw-r--r--	2023-06-13 03:24
admintool.pyo	11.68 KB	-rw-r--r--	2023-06-13 03:24
certdb.py	30.33 KB	-rw-r--r--	2020-04-02 03:45
certdb.pyc	24.24 KB	-rw-r--r--	2023-06-13 03:24
certdb.pyo	24.24 KB	-rw-r--r--	2023-06-13 03:24
config.py	9.13 KB	-rw-r--r--	2020-04-02 03:45
config.pyc	9.6 KB	-rw-r--r--	2023-06-13 03:24
config.pyo	9.5 KB	-rw-r--r--	2023-06-13 03:24
cookie.py	24.26 KB	-rw-r--r--	2020-04-02 03:45
cookie.pyc	18.57 KB	-rw-r--r--	2023-06-13 03:24
cookie.pyo	18.57 KB	-rw-r--r--	2023-06-13 03:24
dn.py	48.4 KB	-rw-r--r--	2020-04-02 03:45
dn.pyc	50.83 KB	-rw-r--r--	2023-06-13 03:24
dn.pyo	50.83 KB	-rw-r--r--	2023-06-13 03:24
dnsutil.py	16.11 KB	-rw-r--r--	2020-04-02 03:45
dnsutil.pyc	17.54 KB	-rw-r--r--	2023-06-13 03:24
dnsutil.pyo	17.29 KB	-rw-r--r--	2023-06-13 03:24
dogtag.py	7.51 KB	-rw-r--r--	2020-04-02 03:45
dogtag.pyc	7.12 KB	-rw-r--r--	2023-06-13 03:24
dogtag.pyo	7.12 KB	-rw-r--r--	2023-06-13 03:24
errors.py	1.94 KB	-rw-r--r--	2020-04-02 03:45
errors.pyc	1.85 KB	-rw-r--r--	2023-06-13 03:24
errors.pyo	1.85 KB	-rw-r--r--	2023-06-13 03:24
graph.py	2.44 KB	-rw-r--r--	2020-04-02 03:45
graph.pyc	3.37 KB	-rw-r--r--	2023-06-13 03:24
graph.pyo	3.37 KB	-rw-r--r--	2023-06-13 03:24
ipa_log_manager.py	6.33 KB	-rw-r--r--	2020-04-02 03:45
ipa_log_manager.pyc	6.62 KB	-rw-r--r--	2023-06-13 03:24
ipa_log_manager.pyo	6.62 KB	-rw-r--r--	2023-06-13 03:24
ipaldap.py	58.15 KB	-rw-r--r--	2020-04-02 03:45
ipaldap.pyc	52.44 KB	-rw-r--r--	2023-06-13 03:24
ipaldap.pyo	51.66 KB	-rw-r--r--	2023-06-13 03:24
ipautil.py	49.64 KB	-rw-r--r--	2020-04-02 03:45
ipautil.pyc	47.54 KB	-rw-r--r--	2023-06-13 03:24
ipautil.pyo	47.37 KB	-rw-r--r--	2023-06-13 03:24
ipavalidate.py	3.55 KB	-rw-r--r--	2020-04-02 03:45
ipavalidate.pyc	3.1 KB	-rw-r--r--	2023-06-13 03:24
ipavalidate.pyo	3.1 KB	-rw-r--r--	2023-06-13 03:24
kerberos.py	6.18 KB	-rw-r--r--	2020-04-02 03:45
kerberos.pyc	8.04 KB	-rw-r--r--	2023-06-13 03:24
kerberos.pyo	8.04 KB	-rw-r--r--	2023-06-13 03:24
kernel_keyring.py	4.73 KB	-rw-r--r--	2020-04-02 03:45
kernel_keyring.pyc	4.78 KB	-rw-r--r--	2023-06-13 03:24
kernel_keyring.pyo	4.37 KB	-rw-r--r--	2023-06-13 03:24
nsslib.py	0 B	-rw-r--r--	2020-04-02 03:45
nsslib.pyc	139 B	-rw-r--r--	2023-06-13 03:24
nsslib.pyo	139 B	-rw-r--r--	2023-06-13 03:24
session_storage.py	12.91 KB	-rw-r--r--	2020-04-02 03:45
session_storage.pyc	9.13 KB	-rw-r--r--	2023-06-13 03:24
session_storage.pyo	9.13 KB	-rw-r--r--	2023-06-13 03:24
ssh.py	6.09 KB	-rw-r--r--	2020-04-02 03:45
ssh.pyc	6.04 KB	-rw-r--r--	2023-06-13 03:24
ssh.pyo	6.04 KB	-rw-r--r--	2023-06-13 03:24
version.py	11.89 KB	-rw-r--r--	2023-06-13 03:23
version.pyc	10.6 KB	-rw-r--r--	2023-06-13 03:24
version.pyo	10.6 KB	-rw-r--r--	2023-06-13 03:24

Rename

#
# Copyright (C) 2015-2017  FreeIPA Contributors see COPYING for license
#
from collections import deque

class Graph(object):
    """
    Simple oriented graph structure

G = (V, E) where G is graph, V set of vertices and E list of edges.
    E = (tail, head) where tail and head are vertices
    """

def __init__(self):
        self.vertices = set()
        self.edges = []
        self._adj = dict()

def add_vertex(self, vertex):
        self.vertices.add(vertex)
        self._adj[vertex] = []

def add_edge(self, tail, head):
        if tail not in self.vertices:
            raise ValueError("tail is not a vertex")

if head not in self.vertices:
            raise ValueError("head is not a vertex")

self.edges.append((tail, head))
        self._adj[tail].append(head)

def remove_edge(self, tail, head):
        try:
            self.edges.remove((tail, head))
        except KeyError:
            raise ValueError(
                "graph does not contain edge: ({0}, {1})".format(tail, head)
            )
        self._adj[tail].remove(head)

def remove_vertex(self, vertex):
        try:
            self.vertices.remove(vertex)
        except KeyError:
            raise ValueError(
                "graph does not contain vertex: {0}".format(vertex)
            )

# delete _adjacencies
        del self._adj[vertex]
        for adj in self._adj.values():
            adj[:] = [v for v in adj if v != vertex]

# delete edges
        self.edges = [
            e for e in self.edges if vertex not in (e[0], e[1])
        ]

def get_tails(self, head):
        """
        Get list of vertices where a vertex is on the right side of an edge
        """
        return [e[0] for e in self.edges if e[1] == head]

def get_heads(self, tail):
        """
        Get list of vertices where a vertex is on the left side of an edge
        """
        return [e[1] for e in self.edges if e[0] == tail]

def bfs(self, start=None):
        """
        Breadth-first search traversal of the graph from `start` vertex.
        Return a set of all visited vertices
        """
        if not start:
            start = next(iter(self.vertices))
        visited = set()
        queue = deque([start])

while queue:
            vertex = queue.popleft()
            if vertex not in visited:
                visited.add(vertex)
                queue.extend(set(self._adj.get(vertex, [])) - visited)
        return visited