graph

package
v0.0.0-...-1b8f739 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Apr 17, 2016 License: GPL-3.0 Imports: 3 Imported by: 3

Documentation

Overview

Package graph includes base types for radia graphs. I'd have called it common, but that just smells bad.

Package graph is a generated protocol buffer package.

It is generated from these files:

graph.proto

It has these top-level messages:

GraphID
AlgorithmID

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type AlgorithmID

type AlgorithmID struct {
	Id string `protobuf:"bytes,1,opt,name=id" json:"id,omitempty"`
}

AlgorithmID identifies a specific instance of a running algorithm. It should be possible to run multiple instances of any algorithms over a given graph at any one time

func (*AlgorithmID) Descriptor

func (*AlgorithmID) Descriptor() ([]byte, []int)

func (*AlgorithmID) ProtoMessage

func (*AlgorithmID) ProtoMessage()

func (*AlgorithmID) Reset

func (m *AlgorithmID) Reset()

func (*AlgorithmID) String

func (m *AlgorithmID) String() string

type GraphID

type GraphID struct {
	Id string `protobuf:"bytes,1,opt,name=id" json:"id,omitempty"`
}

GraphID is an identified for a specific arrangemnt of nodes and edges. We can use this to select the specific topology we wish to pass messages to.

func (*GraphID) Descriptor

func (*GraphID) Descriptor() ([]byte, []int)

func (*GraphID) ProtoMessage

func (*GraphID) ProtoMessage()

func (*GraphID) Reset

func (m *GraphID) Reset()

func (*GraphID) String

func (m *GraphID) String() string

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL