Crate graph_theory

Expand description

§Title

§GraphEngine

node + edge

§EntryEngine

weight + data

Re-exports§

pub use adjacency_list;

Modules§

errors
iterators
placeholder
storages

Structs§

AdjacencyEdge
DirectedEdge: DirectedEdge represents an bidirectional edge between two nodes.
IndeterminateEdge: DynamicEdge represents an bidirectional edge between two nodes.
NodeRangeVisitor: Arguments
NodeSliceVisitor: Arguments
NodesVisitor: A double-ended iterator over the nodes of a graph.
StaticDirected
StaticUndirected
UndirectedEdge: UndirectedEdge represents an bidirectional edge between two nodes.

Enums§

EdgeDirection: Determines the direction between two nodes
EdgeInsertID: Arguments
EdgeQuery: Arguments
GraphEntry: Arguments
GraphKind: Mark the graph as directed or undirected.
Query: Arguments
VisitOrder: used to determine the direction of an edge

Traits§

Edge: Marker trait for edges
EntryEngine
GraphEngine: Represent a graph storage, with a set of nodes and edges.
MutableGraph: Mark a graph engine that can add and delete edges or points
NamedGraph: Labeling a graph can provide Weight information
Node: Represents a node in a graph
WeightedGraph: Labeling a graph can provide Weight information

Type Aliases§

EdgeID: used to determine the direction of an edge
NodeID: used to determine the direction of an edge