directed_graph 0.3.2

directed_graph: ^0.3.2 copied to clipboard

• Amended factory constructor DirectedGraph.transitiveClosure().

• Amended documentation.

• Added null-safety features.
• Tightened the definition of path. A path [v_i, ..., v_n] is an ordered list of at least two connected vertices where each inner vertex is distinct.
• Functions returning a topological ordering now return an ordered set of vertices, reflecting the fact that in a topological ordering each vertex must be distinct.
• Added the classes WeightedDirectedGraph and BiDirectedGraph.
• Complete overhaul of the class GraphCrawler.

Added GraphCrawler method tree. Amended methods path and paths.

Added the getter data.

Removed debug print statement.

Amended README.md.

• Moved GraphCrawler to a separate file.
• Amended graph crawler method paths.
• Added DirectedGraph constructor .fromData.

Corrected missing links in dartdocs.

Incorporated pedantic lint suggestions. Updated docs.

Added info about class [GraphCrawler]GraphCrawler.

Added explicit generic type parameter to graph getter iterator.

Added class GraphCrawler.

Converted the following DirectedGraph methods to getters:

• isAcyclic,
• localSources,
• outDegreeMap,
• sortedTopologicalOrdering,
• stronglyConnectedComponents,
• topologicalOrdering.

Added methods for finding cycles in cyclic graphs:

• cycle
• findCycle()

Specified type of the parameter comparator in DirectedGraph constructor.

Amended equality operator of ConstantVertex.

Amended section ##Usage in README.md.

Fixed logic in removeEdges(). The field comparator is no longer final, it can be set to trigger a resort of the graph vertices.

Edited image url.

Added method localSources(). DirectedGraph now extends Iterator.

Amended README.md, included travis icon.

Amended package description.

Initial version of the library.