PenguinGraphs Reference DictionaryPropertyMap Structure Reference

DictionaryPropertyMap

public struct DictionaryPropertyMap<Graph: GraphProtocol, Key, Value>: ExternalPropertyMap
where Key: Hashable

extension DictionaryPropertyMap: ParallelCapablePropertyMap where Graph: ParallelGraph

An external property map backed by a dictionary.

Show on GitHub

init(_:defaultValue:)
Initialize self providing values for each edge.
Declaration
Swift

public init(_ values: [Key : Value], defaultValue: Value? = nil)
Show on GitHub


                    
                    
                    subscript(_:)

Declaration

Swift

public subscript(key: Key) -> Value { get set }

Show on GitHub

Available where `Graph.EdgeId`: `Hashable`, `Key` == `Graph.EdgeId`

init(_:forEdgesIn:)
Initializes self using values; graph is unused, but helps type inference along nicely.
Declaration
Swift

public init(_ values: [Graph.EdgeId : Value], forEdgesIn graph: Graph)
Show on GitHub

Available where `Graph.VertexId`: `Hashable`, `Key` == `Graph.VertexId`

init(_:forVerticesIn:)
Initializes self using values; graph is unused, but helps type inference along.
Declaration
Swift

public init(_ values: [Graph.VertexId : Value], forVerticesIn graph: Graph)
Show on GitHub
init(repeating:forVerticesIn:)
Initializes self where every vertex has value; graph is used for type inference.
Declaration
Swift

public init(repeating value: Value, forVerticesIn graph: Graph)
Show on GitHub