Class GraphReader

Namespace

AlgorithmsSW.Graph

Assembly

AlgorithmsSW.dll

public class GraphReader

Inheritance

object

GraphReader

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Extension Methods

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>)

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Interpolate<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Substitute<T, TBuffer>(TBuffer, (T input, T[] output)[])

CollectionExtensions.Copy<TStack, T>(TStack)

Comparable.ToComparable<T>(T, IComparer<T>)

Formatter.AsText<T>(T?)

Formatter.Describe<TLabel, TDescription>(TLabel, TDescription, string)

Formatter.Log<T>(T)

Formatter.Pretty<T>(T, params int[])

Methods

ReadGraph<T>(TextReader, IComparer<T>)

Reads in a graph from a text file.

public void ReadGraph<T>(TextReader reader, IComparer<T> comparer)

Parameters

reader TextReader

comparer IComparer<T>

Type Parameters

T

Remarks

The first item in the file is the number of vertices, the second item is the number of edges, and each subsequent pair of items represents an edge. Any whitespace can separate items.