ba-st / mole

A model for graphs, both directed and undirected.

Mole

Mole provides a model for graphs, both directed and undirected.

Name origin: This project started as a topological model, which can be shortened to Topo, the Spanish word for Mole.

Quick links

• Explore the docs
• Report a defect
• Request a feature

License

• The code is licensed under MIT.
• The documentation is licensed under CC BY-SA 4.0.

Installation

To load the project in a Pharo image follow these instructions.

Contributing

Check the Contribution Guidelines

mole's Issues

Graph Traversal: Depth-first search

Graph Traversal: Breadth-first search

Graph Operations: Intersection

graph intersection: G1 ∩ G2 = (V1 ∩ V2, E1 ∩ E2)

Graph Operations: Complement

The complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices of H are adjacent if and only if they are not adjacent in G

Vertex-labeled graph

Graph Operations: Union

The graph union is defined as:
G1(V1,E1) U G2(V2,G2) = GU(V1 U V2, E1 U E2)

Edge-labeled graph

Directed Graph Operations: Transpose

Transpose of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G. That is, if G contains an edge (u,v) then the converse/transpose/reverse of G contains an edge (v,u) and vice versa.