Struct graph::input::edgelist::EdgeListInput[][src]

pub struct EdgeListInput<NI: Idx, EV = ()> { /* fields omitted */ }
Expand description

Reads a graph from a file that contains an edge per line.

An edge is represented by a source node id and a target node id. The two node ids must be separated by a 1-byte character (e.g. whitespace or tab).

The node count of the resulting graph is the highest node id within the file plus one. The edge count will be twice the number of lines in the file.

Example

> cat my_graph.edgelist
0 1
0 2
1 3
2 0

Trait Implementations

Returns the “default value” for a type. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Performs the conversion.

Performs the conversion.

The alignment of pointer.

The type for initializers.

Initializes a with the given initializer. Read more

Dereferences the given pointer. Read more

Mutably dereferences the given pointer. Read more

Drops the object pointed to by the given pointer. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.