OpenQuizz
Une application de gestion des contenus pédagogiques
DirectedGraph Class Reference
Inheritance diagram for DirectedGraph:
Collaboration diagram for DirectedGraph:

Public Member Functions

def __init__ (self)
 
def __iter__ (self)
 
def __len__ (self)
 
def __contains__ (self, key)
 
def copy (self)
 
def add (self, key)
 
def remove (self, key)
 
def connected (self, f, t)
 
def connect (self, f, t)
 
def iter_edges (self)
 
def iter_children (self, key)
 
def iter_parents (self, key)
 

Detailed Description

A graph structure with directed edges.

Constructor & Destructor Documentation

◆ __init__()

def __init__ (   self)

Member Function Documentation

◆ __contains__()

def __contains__ (   self,
  key 
)

◆ __iter__()

def __iter__ (   self)

◆ __len__()

def __len__ (   self)

◆ add()

def add (   self,
  key 
)
Add a new vertex to the graph.

◆ connect()

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

Nothing happens if the vertices are already connected.

◆ connected()

def connected (   self,
  f,
  t 
)

◆ copy()

def copy (   self)
Return a shallow copy of this graph.

◆ iter_children()

def iter_children (   self,
  key 
)

◆ iter_edges()

def iter_edges (   self)

◆ iter_parents()

def iter_parents (   self,
  key 
)

◆ remove()

def remove (   self,
  key 
)
Remove a vertex from the graph, disconnecting all edges from/to it.

The documentation for this class was generated from the following file: