Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

directed_dfs

package

v0.0.0-...-8859e38 Latest Latest Go to latest Published: Dec 31, 2018 License: MIT Imports: 1 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/dczombera/data-structures-and-algorithms-in-go

Links

Open Source Insights

Documentation ¶

Index ¶

type DirectedDFS
- func NewDirectedDFS(g *directed_graph.Digraph, sourceVertices ...int) *DirectedDFS
- func (dfs *DirectedDFS) Count() int
- func (dfs *DirectedDFS) IsConnected(v int) bool

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type DirectedDFS ¶

type DirectedDFS struct {
	// contains filtered or unexported fields
}

func NewDirectedDFS ¶

func NewDirectedDFS(g *directed_graph.Digraph, sourceVertices ...int) *DirectedDFS

func (*DirectedDFS) Count ¶

func (dfs *DirectedDFS) Count() int

func (*DirectedDFS) IsConnected ¶

func (dfs *DirectedDFS) IsConnected(v int) bool

Source Files ¶

View all Source files

directed_dfs.go