Top "Graph-theory" questions

A graph is a mathematical structure that contains a collection of vertices or 'nodes' and a collection of edges that connect pairs of vertices.

Sort algorithm: Magento checkout totals sorted wrongly causing wrong shipping tax calculation

In Magento there is a functionality where you can define the order of total calculation by specifing before and after …

php sorting magento graph-theory
How to include weight in edge of graph?

I want to include weights or costs of the edge on my graph using this jgrapht interface-class: package org.jgrapht; …

java graph graph-theory jgrapht
Prim's Algorithm Time Complexity

I was looking at the Wikipedia entry for Prim's algorithm and I noticed that its time complexity with an adjacency …

algorithm graph-theory time-complexity prims-algorithm
Names of Graph Traversal Algorithms

What I'm looking for is a comprehensive list of graph traversal algorithms, with brief descriptions of their purpose, as a …

algorithm graph graph-theory
How to assign the same style to a group of edges?

I've got a graph that I want graphviz to layout and visualize for me. The graph has 122 edges and 123 nodes. …

coding-style grouping stylesheet graph-theory graphviz
Are there faster algorithms than Dijkstra?

Given a directed, connected graph with only positive edge weights, are there faster algorithms for finding the shortest path between …

graph-theory dijkstra
How can I generate rectangle style edges instead of curves in GraphViz?

I have generated Graphviz images with the dot language using the Pydot Python library. But the edges are getting draw …

python graph-theory graphviz edge-list
Graph algorithms on GPU

The current GPU execution and memory models are somehow limited (memory limit, limit of data structures, no recursion...). Do you …

cuda graph-theory gpu
Finding the path with the maximum minimal weight

I'm trying to work out an algorithm for finding a path across a directed graph. It's not a conventional path …

algorithm graph graph-theory path-finding directed-graph
Big O in Adjency List - remove vertex and remove edge(time complexity cost of performing various operations on graphs)

I have to prepare explanation of time complexity of removing vertex (O(|V| + |E|)) and edge (O(|E|)) in Adjency …

algorithm graph big-o graph-theory adjacency-list