Package graphalg implements common graph algorithms.

Package graphout implements functions to write graphs to common graph formats.

Equal returns true if g1 and g2 have identical nodes and edges, including the IDs of all nodes.

MakeBiGraph constructs a BiGraph from what may be a unidirectional Graph.

SubgraphKeep returns a subgraph of g that keeps the given nodes and edges.

SubgraphRemove returns a subgraph of g that removes the given nodes and edges from g, as well as all edges incident to those nodes.

Edge identifies an edge in a graph.

WeightedUnit wraps a graph as a weighted graph where all edges have weight 1.

BiGraph extends Graph to graphs that represent both out-edges and in-edges.

Graph represents a directed graph.

A Subgraph is a Graph that consists of a subset of the nodes and vertices from another, underlying Graph.

Weighted represented a weighted directed graph.

IntGraph is a basic Graph g where g[i] is the list of out-edge indexes of node i.